Tables
Tables are Tomo’s associative mapping structure, also known as a Dictionary or Map. Tables are efficiently implemented as a hash table that preserves insertion order and has fast access to keys and values as list slices. Tables support all types as both keys and values.
Syntax
Tables are written using {}
curly braces with =
equals signs associating key expressions with value expressions and commas
between entries:
:= {"A"=10, "B"=20} table
Empty tables must specify the key and value types explicitly:
: {Text=Int} = {} empty
For type annotations, a table that maps keys with type K
to
values of type V
is written as {K=V}
.
Comprehensions
Similar to lists, tables can use comprehensions to dynamically construct tables:
:= {i=10*i for i in 10}
t := {i=10*i for i in 10 if i mod 2 == 0}
t := {-1=-10, i=10*i for i in 10} t
Accessing Values
Table values can be accessed with square bracket indexing. The result is an optional value:
:= {"A"=1, "B"=2}
table >> table["A"]
= 1?
>> table["missing"]
= none
As with all optional values, you can use the !
postfix
operator to assert that the value is non-none (and create a runtime error if
it is), or you can use the or
operator to provide a fallback
value in the case that it’s none:
>> table["A"]!
= 1
>> table["missing"] or -1
= -1
Fallback Tables
Tables can specify a fallback table that is used when looking up a value if it is not found in the table itself:
:= {"A"=10}
t := {"B"=20; fallback=t}
t2 >> t2["A"]
= 10?
The fallback is available by the .fallback
field, which
returns an optional table value:
>> t2.fallback
= {"A"=10}?
>> t.fallback
= none
Default Values
Tables can specify a default value which will be returned if a value is not present in the table or its fallback (if any).
:= &{"foo"=12; default=0}
counts >> counts["foo"]
= 12
>> counts["baz"]
= 0
["baz"] += 1
counts>> counts["baz"]
= 1
When values are accessed from a table with a default value, the return type is non-optional (because a value will always be present).
Setting Values
You can assign a new key/value mapping or overwrite an existing one using
.set(key, value)
or an =
assignment statement:
:= {"A"=1, "B"=2}
t ["B"] = 222
t["C"] = 333
t>> t
= {"A"=1, "B"=222, "C"=333}
Length
Table length can be accessed by the .length
field:
>> {"A"=10, "B"=20}.length
= 2
Accessing Keys and Values
The keys and values of a table can be efficiently accessed as lists using a constant-time immutable slice of the internal data from the table:
:= {"A"=10, "B"=20}
t >> t.keys
= ["A", "B"]
>> t.values
= [10, 20]
Iteration
You can iterate over the key/value pairs in a table like this:
for key, value in table
...
for key in table
...
Table iteration operates over the value of the table when the loop began, so modifying the table during iteration is safe and will not result in the loop iterating over any of the new values.