| Age | Commit message (Collapse) | Author |
|---|
|
by calling make_hash2.
|
|
MAP_DEF and HASHMAP_DEF must have adjacent values
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
* __builtin_clz may not exist
* fix bitcount fallback
|
|
The old hashing did not care which value belonged to which key,
for example:
would hash the same.
|
|
|
|
|
|
Deep hashing should ignore the three lowest bits of the level.
|
|
|
|
|
|
|
|
|
|
|
|
to use an iterator instead of foreach with callback.
Will be easier to make yielding.
|
|
|
|
|
|
A lightweight stack that can be used to store any type.
PUSH and POP return pointers into stack slots.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
to use a common struct hashmap_doer_state.
|
|
|
|
|
|
|
