Source Edit

containers deepdive

TLDR

the initBlah procs arent necessary as their initialized by default
- use {...}.toBlah or newBlah(...) instead
custom types require an overloaded hash and == proc before being use as keys in a table

each has a blahRef variant
- CountTableA tracks the occurrences of each key
- OrderedTableA; B preserves the insertion order of keys
- TableA; B regular hash table
== check returns true if both/neither are nil and
- count: content + count identical
- ordered: content + order identical
- table: content identical

efficient string to string hash table supporting case/style in/sensitive
- style insenstive: ignores _ and case
- case is/not sensitive does what you think
particularly powerful as values can be retrieved from ram if $key not found

FormatFlag enum
- useEnvironment value for $key if not found
- useEmpty string as default $key value
- useKey for value if not found in env/table
StringTableMode enum
- modeCaseInSensitive
- modeStyleInsensitive
StringTableObj
StringTableRef

authnz = newStringTable([("ROLE", "USER"), ("TRUSTED", "0")], modeCaseSensitive): also accepts a tuplevarargs of keyX,valY, ... Source Edit
hasKey`gensym135 = 0 <= index`gensym135: Source Edit
hasKey`gensym137 = 0 <= index`gensym137: Source Edit
keys = var collectResult_3003127682 = newSeq(Natural(0)) for k in keys(hashTable): add(collectResult_3003127682, k) collectResult_3003127682: Source Edit
keyValues = var collectResult_3003128177 = newSeq(Natural(0)) for k, v in pairs(hashTable): add(collectResult_3003128177, (k, v)) collectResult_3003128177: Source Edit
u = User(name: "Hello", uid: 99): Source Edit
values = var collectResult_3003127932 = newSeq(Natural(0)) for k in values(hashTable): add(collectResult_3003127932, k) collectResult_3003127932: Source Edit

anotherTable = (data: [(2851137560, "first", 1), (0, "", 0), (0, "", 0), (436751995, "second", 2), (0, "", 0), (0, "", 0), (0, "", 0), (0, "", 0)], counter: 2): Source Edit
baseTable = [("fname", "noah"), ("lname", "hall")]: system table Source Edit
countTable = (data: [(0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (119, 1), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (111, 4), (112, 2), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (114, 2), (99, 1), (0, 0), (115, 1), (0, 0), (0, 0), (101, 2)], counter: 7, isSorted: false): anyOpenArrayLikeThing.toCountTable Source Edit
hashTable = (data: [(0, "", ""), (0, "", ""), (2350561362, "lname", "hall"), (3368835387, "fname", "noah"), (0, "", ""), (0, "", ""), (0, "", ""), (0, "", "")], counter: 2): newTable Source Edit
orderededTable = (data: [(0, 0, "", ""), (0, 0, "", ""), (2350561362, -1, "lname", "hall"), (3368835387, 2, "fname", "noah"), (0, 0, "", ""), (0, 0, "", ""), (0, 0, "", ""), (0, 0, "", "")], counter: 2, first: 3, last: 2): ('a', 5), ('b', 9).toOrderedTable Source Edit

proc echoMutated(): void {....raises: [], tags: [], forbids: [].}: Source Edit
proc echoUser(): void {....raises: [ValueError], tags: [], forbids: [].}: Source Edit
proc hash(x: User): Hash {....raises: [], tags: [], forbids: [].}: arbitrary logic for hashing a User for use as key in a table Source Edit