Minor Description
In the class Javadoc of http://svn.apache.org/viewvc/commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/bidimap/DualHashBidiMap.java?view=markup
there is a mention that Collections would welcome a direct hash-based implementation of BidiMap interface.
I am working on such; my source is available at https://github.com/coderodde/BidirectionalHashMap
At this point it does not adhere to style/interfaces of Commons Collections (such as implementing the BidiMap interface), yet I believe that is a matter of simple rewrite.
Currently, it represents the "collision chains" as AVL-trees, thus guaranteeing O(log n) access/modification even on poor hash functions. If that is not required, rewriting would be trivial as well.
I have several questions, but I have to start from the most important: is there any acute need for such a data structure?
Attachments
Issue Links
- links to
