630 |
|
/** |
631 |
|
* Return true if given key greater than or equal to least and |
632 |
|
* strictly less than fence, bypassing either test if least or |
633 |
< |
* fence oare null. Needed mainly in submap operations. |
633 |
> |
* fence are null. Needed mainly in submap operations. |
634 |
|
*/ |
635 |
|
boolean inHalfOpenRange(K key, K least, K fence) { |
636 |
|
if (key == null) |
1414 |
|
|
1415 |
|
/** |
1416 |
|
* Return SimpleImmutableEntry or key for results of findNear |
1417 |
< |
* ofter screening to ensure result is in given range. Needed by |
1417 |
> |
* after screening to ensure result is in given range. Needed by |
1418 |
|
* submaps. |
1419 |
|
* @param kkey the key |
1420 |
|
* @param rel the relation -- OR'ed combination of EQ, LT, GT |
1858 |
|
*/ |
1859 |
|
public Set<K> keySet() { |
1860 |
|
/* |
1861 |
< |
* Note: Lazy intialization works here and for other views |
1861 |
> |
* Note: Lazy initialization works here and for other views |
1862 |
|
* because view classes are stateless/immutable so it doesn't |
1863 |
|
* matter wrt correctness if more than one is created (which |
1864 |
|
* will only rarely happen). Even so, the following idiom |
1889 |
|
*/ |
1890 |
|
public Set<K> descendingKeySet() { |
1891 |
|
/* |
1892 |
< |
* Note: Lazy intialization works here and for other views |
1892 |
> |
* Note: Lazy initialization works here and for other views |
1893 |
|
* because view classes are stateless/immutable so it doesn't |
1894 |
|
* matter wrt correctness if more than one is created (which |
1895 |
|
* will only rarely happen). Even so, the following idiom |