/libcore/luni/src/main/java/java/util/ |
H A D | NavigableSet.java | 30 * whether lower and upper bounds are inclusive versus exclusive. 181 * {@code fromElement}, inclusive, to {@code toElement}, exclusive 202 * (or equal to, if {@code inclusive} is true) {@code toElement}. The 211 * @param inclusive {@code true} if the high endpoint 214 * (or equal to, if {@code inclusive} is true) {@code toElement} 227 NavigableSet<E> headSet(E toElement, boolean inclusive); argument 231 * than (or equal to, if {@code inclusive} is true) {@code fromElement}. 240 * @param inclusive {@code true} if the low endpoint 256 NavigableSet<E> tailSet(E fromElement, boolean inclusive); argument
|
H A D | NavigableMap.java | 33 * whether lower and upper bounds are inclusive versus exclusive. 307 * equal to, if {@code inclusive} is true) {@code toKey}. The returned 316 * @param inclusive {@code true} if the high endpoint 319 * (or equal to, if {@code inclusive} is true) {@code toKey} 332 NavigableMap<K,V> headMap(K toKey, boolean inclusive); argument 336 * equal to, if {@code inclusive} is true) {@code fromKey}. The returned 345 * @param inclusive {@code true} if the low endpoint 348 * (or equal to, if {@code inclusive} is true) {@code fromKey} 361 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument
|
H A D | TreeMap.java | 707 public NavigableMap<K, V> headMap(K to, boolean inclusive) { argument 708 Bound toBound = inclusive ? INCLUSIVE : EXCLUSIVE; 716 public NavigableMap<K, V> tailMap(K from, boolean inclusive) { argument 717 Bound fromBound = inclusive ? INCLUSIVE : EXCLUSIVE; 1038 public NavigableSet<K> headSet(K to, boolean inclusive) { argument 1039 return TreeMap.this.headMap(to, inclusive).navigableKeySet(); 1046 public NavigableSet<K> tailSet(K from, boolean inclusive) { argument 1047 return TreeMap.this.tailMap(from, inclusive).navigableKeySet(); 1414 public NavigableMap<K, V> headMap(K to, boolean inclusive) { argument 1415 Bound toBound = inclusive 1423 tailMap(K from, boolean inclusive) argument 1622 headSet(K to, boolean inclusive) argument 1630 tailSet(K from, boolean inclusive) argument [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentNavigableMap.java | 39 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); argument 47 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument
|
H A D | ConcurrentSkipListSet.java | 387 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 388 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive)); 396 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 397 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
|
H A D | ConcurrentSkipListMap.java | 1966 boolean inclusive) { 1970 (this, null, false, toKey, inclusive, false); 1979 boolean inclusive) { 1983 (this, fromKey, inclusive, null, false, false); 2333 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 2334 return new KeySet<E>(m.headMap(toElement, inclusive)); 2336 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 2337 return new KeySet<E>(m.tailMap(fromElement, inclusive)); 2843 boolean inclusive) { 2846 return newSubMap(null, false, toKey, inclusive); 1965 headMap(K toKey, boolean inclusive) argument 1978 tailMap(K fromKey, boolean inclusive) argument 2842 headMap(K toKey, boolean inclusive) argument 2849 tailMap(K fromKey, boolean inclusive) argument [all...] |