Compressed and Sparse tuple set extensional propagation

[zayenz]

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_AUTO to TupleSet::finalize selects 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 still EPK_DENSE when no other information is given.

[greptile-apps]

Too many files changed for review. (1342 files found, 100 file limit)