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>
22 lines
366 B
Markdown
22 lines
366 B
Markdown
---
|
|
id: set-add
|
|
name: Set.add
|
|
category: set
|
|
kind: namespace-method
|
|
tokens: Set.add
|
|
sig: Set.add(s, key)
|
|
tip: Add a member (duplicates ignored).
|
|
order: 1
|
|
ns: Set
|
|
member: add
|
|
---
|
|
|
|
Adds <code>key</code> to the set. Adding a member that is already present is a harmless no-op.
|
|
|
|
```ludic
|
|
program Demo {
|
|
handler Step phase Update {
|
|
Set.add(tags, "poison")
|
|
}
|
|
}
|
|
```
|