Expand description
Janet table (mutable HashMap) type.
Structs§
- An iterator that moves out of a
JanetTable
. - An iterator over a reference to the
JanetTable
key-value pairs. - An iterator over a mutable reference to the
JanetTable
key-value pairs. - Janet tables are mutable data structures that map keys to values. Values are put into a Janet table with a key, and can be looked up later with the same key. Tables are implemented with an underlying open hash table, so they are quite fast and cache friendly.
- An iterator over a reference to the
JanetTable
keys. - A view into an occupied entry in a
JanetTable
. It is part of theEntry
enum. - The error returned by
try_insert
when the key already exists. - A view into a vacant entry in a
JanetTable
. It is part of theEntry
enum. - An iterator over a reference to the
JanetTable
values. - An Iterator over a mutable reference to the
JanetTable
values.
Enums§
- A view into a single entry in a map, which may either be vacant or occupied.