Details
Description
When I was implementing a new part of our large system I needed a sorted map,
where keys and corresponding values could also be accessed directly by index (as
in array or List). Both keyed and indexed access methods had to be efficient,
while insertions or removals needn't to be.
I was amazed to find absolutely no ready-to-use implementations, that's why I
decided to create my own.
I created a sorted map, which uses array as a backend storage. I borrowed some
internal implementation ideas from java.util.ArrayList, java.util.TreeMap and
org.apache.commons.collections.map.AbstractHashedMap and LinkedMap.
See attachment.
I hope you will find the idea useful.
Attachments
Attachments
Issue Links
- is duplicated by
-
COLLECTIONS-443 Proposal for adding IndexedTreeMap to collections
- Closed
- relates to
-
COLLECTIONS-479 An Order Statistic Tree
- Open