3 ms·
It's actually something like a counter that counts starting from the most significant bits first, in the article there is a link to a comment that explains the
by antirez 13y ago
It's actually something like a counter that counts starting from the most significant bits first, in the article there is a link to a comment that explains the implementation.
- qwerta 13y agoSo it was hard because hash table could resize between calls? For HTreeMap I used expanding Hash Tree. There are 4 dir levels, each with 128 entries. If dir becomes full (or has too many collisions), it splits into another 128 dirs. Iterations is done by increasing counter. If dir at level 2 is not found, it is increased by 128^2. Writing iterators took single day.