-
Enhancement
-
Resolution: Unresolved
-
P4
-
None
-
1.3.0
-
Fix Understood
-
generic
-
generic
Name: jk109818 Date: 06/26/2000
java version "1.3.0"
Java(TM) 2 Runtime Environment, Standard Edition (build 1.3.0-C)
Java HotSpot(TM) Client VM (build 1.3.0-C, mixed mode)
I need to get items from a TreeSet by their index number, so I would like the
following function: Object get(int index).
This can be implemented very efficiently -- each tree node only needs to know
their number of children. Then, comparing the number of chidren in the left
sub-tree to the requested index, the algorithm either goes to the left or to the
right sub-tree. If the right sub-tree is chosen, the number of children in the
left sub-tree is subtracted from the requested index, etc...
Please let me know if this feature will be implemented by you.
With kind regards,
Marcel Nijman
(Review ID: 105174)
======================================================================
- duplicates
-
JDK-8324766 Implementation of Policy based Data Structure in Java Collections Framework
-
- Closed
-
-
JDK-8186181 Enhance JDK with IndexedTreeSet, IndexedTreeMap
-
- Closed
-
- relates to
-
JDK-4472792 (coll) Add java.util.IndexedSet interface as part of collections API
-
- Open
-
-
JDK-8186181 Enhance JDK with IndexedTreeSet, IndexedTreeMap
-
- Closed
-