This commit adds a new datatype: the quickmap. It provides an extremely
fast but relatively high collision string hash to whatever key hashmap.
This is optimized purely for variable names, and is intended to use for
variable name lookup during (eval ...) or (string->symbol ...) if I must
implement that.
The hashmap is bucketed, with a set number of buckets (199 in this case).
Each bucket is preallocated at initialization containing an empty vector.
There will only ever be one of these initialized as it is only to contain
globally accessible names.
The interface provides new, get, remove, contains_key, insert, and an
iterator implementation.
Unit tests are included and CI is updated.
Signed-off-by: Ava Affine <ava@sunnypup.io>
