Expand description
The design of the hashtable is based on the requirments we have. First is we need it to support being both thread local and global. Second we need iterate and mutate at the same time. Third we need to be able to clean up the heap allocation when it is garbage collected.
Structs§
- Hash
Table 🔒Core - Hash
Table 🔒Inner - Lisp
Hash 🔒Table - Rooted
Lisp 🔒Hash Table - Automatically derived from LispHashTable via
#[derive(Trace)]