Fix compilation of example/queens

SSoelvsten · Nov 28, 2023 · 9a7e828 · 9a7e828
1 parent 2bc9306
commit 9a7e828
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 6 deletions.
diff --git a/docs/example/queens.md b/docs/example/queens.md
@@ -238,11 +238,11 @@ uint64_t n_queens_list(uint64_t N, uint64_t column,
 
       // Obtain the lexicographically minimal true assignment. Well, only one
       // exists, so we get the only one left.
-      adiar::bdd_satmin(restricted_constraints, [&N, &partial_assignment](adiar::bdd::label_t x, bool v) {
+      adiar::bdd_satmin(restricted_constraints, [&N, &partial_assignment](adiar::pair<adiar::bdd::label_t, bool> xv) {
         // Skip all empty (false) locations
-        if (!v) { return; }
+        if (!xv.second) { return; }
 
-        partial_assignment.at(j_of_label(N, x)) = i_of_label(N, x);
+        partial_assignment.at(j_of_label(N, xv.first)) = i_of_label(N, xv.first);
       });
 
       n_queens_print_solution(partial_assignment);

diff --git a/example/queens.cpp b/example/queens.cpp
@@ -268,11 +268,11 @@ uint64_t n_queens_list(uint64_t N, uint64_t column,
 
       // Obtain the lexicographically minimal true assignment. Well, only one
       // exists, so we get the only one left.
-      adiar::bdd_satmin(restricted_constraints, [&N, &partial_assignment](adiar::bdd::label_type x, bool v) {
+      adiar::bdd_satmin(restricted_constraints, [&N, &partial_assignment](adiar::pair<adiar::bdd::label_type, bool> xv) {
         // Skip all empty (false) locations
-        if (!v) { return; }
+        if (!xv.second) { return; }
 
-        partial_assignment.at(j_of_label(N, x)) = i_of_label(N, x);
+        partial_assignment.at(j_of_label(N, xv.first)) = i_of_label(N, xv.first);
       });
 
       n_queens_print_solution(partial_assignment);