1 |
|
/* |
2 |
|
* %W% %E% |
3 |
|
* |
4 |
< |
* Copyright 2004 Sun Microsystems, Inc. All rights reserved. |
4 |
> |
* Copyright 2005 Sun Microsystems, Inc. All rights reserved. |
5 |
|
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. |
6 |
|
*/ |
7 |
|
|
874 |
|
private transient Set<Map.Entry<K,V>> descendingEntrySet = null; |
875 |
|
private transient Set<K> descendingKeySet = null; |
876 |
|
|
877 |
– |
transient Set<K> keySet = null; // XXX remove when integrated |
878 |
– |
transient Collection<V> values = null; // XXX remove when integrated |
879 |
– |
|
877 |
|
/** |
878 |
|
* Returns a Set view of the keys contained in this map. The set's |
879 |
|
* iterator will return the keys in ascending order. The set is backed by |
1338 |
|
TreeMap.Entry<K,V> e = fromStart ? getFirstEntry() : getCeilingEntry(fromKey); |
1339 |
|
K first = key(e); |
1340 |
|
if (!toEnd && compare(first, toKey) >= 0) |
1341 |
< |
throw(new NoSuchElementException()); |
1341 |
> |
throw new NoSuchElementException(); |
1342 |
|
return first; |
1343 |
|
} |
1344 |
|
|
1346 |
|
TreeMap.Entry<K,V> e = toEnd ? getLastEntry() : getLowerEntry(toKey); |
1347 |
|
K last = key(e); |
1348 |
|
if (!fromStart && compare(last, fromKey) < 0) |
1349 |
< |
throw(new NoSuchElementException()); |
1349 |
> |
throw new NoSuchElementException(); |
1350 |
|
return last; |
1351 |
|
} |
1352 |
|
|