OAI/Combinatorics/LowSpaceSubsetSum/Compression/CompressionCallbackCells.lean
11 declarations, 0 contain sorry, 0 declared as axioms
Live storage of the compression dictionary callbacks
The key is constructed once, the trie inserts only a new path, and the cached distinct count controls overflow. The lookup callback retains no new dictionary or list of matches.
- def
OAI.LowSpaceSubsetSum.CompressionCallbackCells.weightCodeline 17 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.weightCode_valueline 21 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.weightCode_cellsline 26 - def
OAI.LowSpaceSubsetSum.CompressionCallbackCells.reportline 31 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.report_valueline 38 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.report_cellsline 47 - def
OAI.LowSpaceSubsetSum.CompressionCallbackCells.probeline 58 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.probe_valueline 64 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.probe_cellsline 68 - def
OAI.LowSpaceSubsetSum.CompressionCallbackCells.dictionaryCellsline 80 - theorem
OAI.LowSpaceSubsetSum.CompressionCallbackCells.dictionaryCells_boundline 83