Fast lookup tables for Unicode. Accessible by constant time.
Fast lookup tables. Accessible by constant time.
of_map def m creates the table which has the same value to m.
The table returns def for the characters for which m is undefined.
of_map def m
Equality and hash are necessary for table generation.
Tables for boolean values.
Tables for small (< 256, >=0) integers
Tables for integers. If integers are not span the whole 31-bit or
63-bit values, Bytes.t is more space efficient than int tbl.
Tables for bytes.