| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
Strategy: Calculate an over estimation of heap size that will give
such a low probability for overflow, that "it will not happen".
Scary assumption 1: Uniformly distributed hash values.
Scary assumption 2: Tree size is normally distributed (right?)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
