Compressed and Sparse tuple set extensional propagation - #213
Merged
Conversation
|
Too many files changed for review. ( |
zayenz
force-pushed
the
feature/tuple-set-extensional-propagators
branch
11 times, most recently
from
July 12, 2026 08:41
b4b4f61 to
473f6a9
Compare
added 5 commits
July 12, 2026 11:18
Add dense, sparse, and compressed support storage, automatic selection, and representation-aware posting for integer and Boolean tables. Treat finalization failure as terminal and release partial support data. Bound support sizes before allocation, preserve disabled propagation work across cloning, scan sparse deltas by actual table values, and subsume sparse actors once at most one advisor remains. Share compact actor policy while retaining representation-specific support loops, and allow DFA-derived tuple sets to select storage explicitly.
Finalize materialized table constraints with EPK_AUTO so small tables retain dense supports while larger sparse tables can use compressed storage. Cover automatic selection with a large diagonal FlatZinc table.
Let table-building examples choose support storage from the finalized table instead of forcing dense supports.
Select focused sparse, compressed, finalization, cloning, DFA, and FlatZinc tests in both build systems. This exercises the representation contracts without adding the large stress cases to the general check target.
zayenz
force-pushed
the
feature/tuple-set-extensional-propagators
branch
from
July 12, 2026 09:19
473f6a9 to
14c3f30
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
TupleSet-backed extensional constraints can choose between dense, sparse, compressed-dense, and automatic support representations. This is useful when the table shape does not fit the old dense representation well: large domains with few supports benefit from sparse data, while tables with wide value gaps can avoid carrying mostly empty dense support words.
The new sparse representation stores supports by active tuple/value structure and uses incremental propagation for positive tables, with fallback paths for cases where the compact sparse form is not suitable. The compressed-dense representation keeps the dense-table propagation model but stores only non-empty support words, which preserves much of the dense propagator behavior while reducing the cost of wide, sparse word ranges.
Passing
EPK_AUTOtoTupleSet::finalizeselects a representation for the finalized TupleSet, so callers that do not have a strong reason to force a variant can leave the choice to the table metadata. For backwards compatibility, the default is stillEPK_DENSEwhen no other information is given.