| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
with over estimation of heap size.
|
|
|
|
where key 1 is less than key 1.0
|
|
|
|
Use extra key and value if needed.
|
|
Did not build a hashmap once the small limit was exceeded.
|
|
|
|
Maps should become hashmaps when merged size exceeds small limit size.
|
|
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.
|
|
|
|
|
|
|
