Compressed and Sparse tuple set extensional propagation

CMakeLists.txt

@@ -1110,6 +1110,9 @@ if(BUILD_TESTING)
       Int::Arithmetic::Max::Nary
       Int::Cumulative::Man::Fix::0::4
       Int::Distinct::Random
+      Extensional::TupleSet::Sparse::IncrementalDelta
+      Extensional::TupleSet::Auto::DefaultDispatch
+      Extensional::TupleSet::DenseCompressed::WideGap
       Int::Linear::Bool::Int::Lq
       Int::MiniModel::LinExpr::Bool::352
       NoGoods::Queens

Makefile.in

@@ -1312,6 +1312,9 @@ check: test
 			   -test Int::Arithmetic::Max::Nary \
 			   -test Int::Cumulative::Man::Fix::0::4 \
 			   -test Int::Distinct::Random \
+			   -test Extensional::TupleSet::Sparse::IncrementalDelta \
+			   -test Extensional::TupleSet::Auto::DefaultDispatch \
+			   -test Extensional::TupleSet::DenseCompressed::WideGap \
 			   -test Int::Linear::Bool::Int::Lq \
 			   -test Int::MiniModel::LinExpr::Bool::352  \
 			   -test NoGoods::Queens \

changelog.in

@@ -75,6 +75,27 @@ This release modernizes the Gecode build infrastructure, adds a
 first-class CMake package for downstream consumers, refreshes the
 autoconf build path, and updates CI coverage for current platforms.
 
+[ENTRY]
+Module: int
+What:   new
+Rank:   major
+[DESCRIPTION]
+Add selectable TupleSet support representations for extensional integer
+constraints. TupleSet instances can now use dense, sparse, compressed
+dense, or automatic support representation selection. Extensional
+posting dispatches to the matching propagator family, and examples that
+materialize larger tuple tables now request automatic selection directly.
+
+[ENTRY]
+Module: test
+What:   change
+Rank:   minor
+[DESCRIPTION]
+Extend extensional TupleSet regression coverage for sparse,
+compressed-dense, automatic dispatch, negative, and reified postings.
+Keep the check target focused on a small set of TupleSet smoke tests so
+it remains a fast general correctness check.
+
 [ENTRY]
 Module: other
 What:   change

examples/black-hole.cpp

@@ -177,7 +177,7 @@ class BlackHole : public Script {
           for (int s2 = 4; s2--; )
             for (int i = -1; i <= 1; i+=2)
               ts.add({r+13*s1, (r+i+52+13*s2)%52});
-      ts.finalize();
+      ts.finalize(EPK_AUTO);
 
       for (int i = 51; i--; )
         extensional(*this, IntVarArgs({x[i],x[i+1]}), ts);

examples/colored-matrix.cpp

@@ -624,7 +624,7 @@ namespace {
         }
       }
     }
-    result.finalize();
+    result.finalize(EPK_AUTO);
     return result;
   }
 

examples/crossword.cpp

@@ -40,7 +40,6 @@
 
 using namespace Gecode;
 
-
 // Grid data
 namespace {
   // Grid data
@@ -174,7 +173,7 @@ class Crossword : public Script {
               ts.add(w);
             }
           }
-          ts.finalize();
+          ts.finalize(EPK_AUTO);
 
           // Array of all words of length w_l
           IntVarArgs words(*this,n,0,n_w-1);

examples/crowded-chess.cpp

@@ -115,7 +115,7 @@ namespace {
       delete s;
     }
 
-    bishops.finalize();
+    bishops.finalize(EPK_AUTO);
   }
 }
 /**
@@ -420,4 +420,3 @@ main(int argc, char* argv[]) {
 }
 
 // STATISTICS: example-any
-

examples/golf.cpp

@@ -126,7 +126,7 @@ class Golf : public Script {
       for (int p1=0; p1<playerCount-1; p1++)
         for (int p2=p1+1; p2<playerCount; p2++)
           ts.add({p1, p2, pairCount++});
-      ts.finalize();
+      ts.finalize(EPK_AUTO);
 
       // Collect pairs of golfers into pairs
       IntVarArgs pairs;

examples/kakuro.cpp

@@ -406,7 +406,7 @@ namespace {
     while (DistinctLinear* s = d.next()) {
       ts.add(s->solution()); delete s;
     }
-    ts.finalize();
+    ts.finalize(EPK_AUTO);
     return ts;
   }