Alastair Hogge
a89308146a
SAT solver based on Davis–Putnam–Logemann–Loveland (DPLL) based propositional satisfiability in Ada. Supported features include: * Conflict analysis and backjumping * Two-watched literals scheme * Built-in support for At-Most-One constraints * Custom theories PR: 296552
11 lines
374 B
Plaintext
11 lines
374 B
Plaintext
--- adasat.gpr.orig 2026-07-01 12:26:53 UTC
|
|
+++ adasat.gpr
|
|
@@ -13,6 +13,7 @@ library project AdaSAT is
|
|
for Object_Dir use "obj/" & Library_Kind_Param & "/" & Build_Mode;
|
|
for Library_Name use "adasat";
|
|
for Library_Kind use Library_Kind_Param;
|
|
+ for Library_Version use "libadasat.so.%%SO_VERSION%%";
|
|
|
|
Common_Ada_Cargs := ("-gnatwa", "-gnatyg", "-fPIC");
|
|
|