commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Efremov, Rodion" <>
Subject [collections]
Date Mon, 03 Jul 2017 19:19:00 GMT
Good day!

I am working on a bidirectional (bijective) hash map at

there is a note in the Javadoc that Collections would like to have a directed hash table based

My current implementation combines both tree and hash table approach: all "collision chains"
are actually AVL-tree based "collision trees" so that even if hashing is really poor (or even
constant), access/modification of data is no worse than O(log n). Also, I maintain an internal
iteration list (like LinkedHashMap) that allows faster iteration and faster of relinking of
nodes to new hash tables when expanding the hash tables.

Could someone take a look at my current source and tell me how that fits/doesn't fit into

Best regards,

Rodion E.


BidirectionalHashMap - My implementation of a bidirectional bijective hash map in Java

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message