Edward Langley 82ad459c4e feat: intern cell keys for O(1) comparison and indexing
Refactor DataStore to use interned keys (InternedKey) instead of
string-based CellKey for O(1) hash and compare operations.

Introduce SymbolTable-backed interning for all category and item
names, storing them as Symbol identifiers throughout the data structure.

Add secondary index mapping (category, item) pairs to sets of interned
keys, enabling efficient partial match queries without scanning all cells.

Optimize matching_values() to avoid allocating CellKey strings by
working directly with interned keys and intersecting index sets.

Update all callers to use new API: iter_cells(), matching_values(),
and internal lookup_key() helper.

Co-Authored-By: fiddlerwoaroof/git-smart-commit (unsloth/Qwen3.5-35B-A3B-GGUF:Q5_K_M)
2026-04-05 01:07:08 -07:00
2026-03-31 00:08:28 -07:00
2026-04-02 16:21:45 -07:00
2026-04-03 23:07:13 -07:00
2026-04-02 11:34:22 -07:00
2026-04-03 13:44:26 -07:00
Description
No description provided
626 KiB
Languages
Rust 99.1%
Python 0.6%
Nix 0.3%