-
Enhancement
-
Resolution: Fixed
-
P4
-
1.2.0
-
b51
-
generic
-
generic
Name: rm29839 Date: 07/08/98
I am trying to do some interpolation, at Reuters.
A clean implementation is to use the
map.get( key )
to return an interpolated value, if the real value does not exist.
However in doing this I would like to access
n-keys either side of the key I am requesting.
The current SortMap interface only allows me to get at the value either side of the key value (using headMap.lastKey() &
tailMap.firstKey() ).
This is inadequate for some kinds of interpolation where I need several keys either side of the key in question.
As a general solution to this problem it seems reasonable that Sorted classes should return a ListIterator as well as an iterator.
(Review ID: 34731)
======================================================================
- relates to
-
JDK-6415641 (coll) Getting NavigableMap/NavigableSet right
-
- Closed
-
-
JDK-7129185 (coll) Please add Collections.emptyNavigableSet()
-
- Closed
-
-
JDK-4912961 (coll) The set returned by TreeMap.keySet should implement SortedSet
-
- Closed
-