Orkuncakilkaya
539f258d92
Types phase 4 — containers. A splice-on-demand open-addressing hash table (runtime/native/dict.ludic, FNV-1a, linear probing, tombstones, grow at 0.7) behind two namespaces: - Dict.* — string -> int map: new/set/get/get_or/has/remove/size/clear/keys. Resource counts, id/name registries. O(1) average vs a linear list scan. - Set.* — set of strings: new/add/has/remove/size/clear/members. Tags, unlocked achievements, visited tiles. Shares the same table. Values are int (also an entity handle / small id); Value.* covers richer maps. [T; N] inline fixed arrays remain future work — typed buffers and []T slices already cover heap-backed arrays. Wired: parser splice trigger (g_uses_dict), emit_call dispatch, reseeded seed, a self-asserting example (examples/library/containers.ludic + feat_case), and per-symbol docs + inventory. All suites green incl. golden renders byte- identical and the bootstrap fixpoint. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
619 B
619 B
| id | title | order |
|---|---|---|
| set | Set | 13 |
A set of string members — membership tests for tags, unlocked achievements, or visited tiles. A Set shares the same open-addressing hash table as Dict, so add / has / remove are O(1) on average and duplicates are ignored. Create one with Set.new, then add / has / remove / size / clear / members. Arguments are positional. The runtime is spliced in only when a program mentions Set. (or Dict.).