ڧ ܧݧ <funny.falcon / gmail.com> wrote:
> what's the profit from using binary tree in place of hash?

Mainly: not caring about the quality of hash function :)

Also: no extra allocation/resizing for buckets (but existing allocations
get 1 pointer bigger than my ihash implementation).  Splay tree has
self-optimizing behavior may also be good for us (but hurts CoW).


Fwiw, I also played with critbit trees (with container_of), but could
not figure out how to do non-recursive traversal nor conditional
unlink/delete while traversing :<