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 |
|
|