mirror of
https://github.com/janet-lang/janet
synced 2024-10-01 08:20:40 +00:00
0e29b52d96
This corrects changes in internal structure when values were inserted in different orders (which was previously incorrect.) Robinhood hashing should correct this by making the internal structure of the hashtable invariant of insertion order. This, in turn, allows naive and deterministic equality, comparison, and hashing of structs. |
||
|---|---|---|
| .. | ||
| compile.h | ||
| disasm.h | ||
| gst.h | ||
| parse.h | ||
| stl.h | ||