Search

Home

Sort by

Searched refs:inclusive (Results 1 - 9 of 9) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A D	NavigableSet.java	64 * inclusive versus exclusive. Subsets of any {@code NavigableSet} 214 * {@code fromElement}, inclusive, to {@code toElement}, exclusive 235 * (or equal to, if {@code inclusive} is true) {@code toElement}. The 244 * @param inclusive {@code true} if the high endpoint 247 * (or equal to, if {@code inclusive} is true) {@code toElement} 260 NavigableSet<E> headSet(E toElement, boolean inclusive); argument 264 * than (or equal to, if {@code inclusive} is true) {@code fromElement}. 273 * @param inclusive {@code true} if the low endpoint 289 NavigableSet<E> tailSet(E fromElement, boolean inclusive); argument
H A D	NavigableMap.java	65 * inclusive versus exclusive. Submaps of any {@code NavigableMap} 338 * equal to, if {@code inclusive} is true) {@code toKey}. The returned 347 * @param inclusive {@code true} if the high endpoint 350 * (or equal to, if {@code inclusive} is true) {@code toKey} 363 NavigableMap<K,V> headMap(K toKey, boolean inclusive); argument 367 * equal to, if {@code inclusive} is true) {@code fromKey}. The returned 376 * @param inclusive {@code true} if the low endpoint 379 * (or equal to, if {@code inclusive} is true) {@code fromKey} 392 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument
H A D	TreeSet.java	`337 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 338 return new TreeSet<>(m.headMap(toElement, inclusive)); 349 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 350 return new TreeSet<>(m.tailMap(fromElement, inclusive));`
H A D	TreeMap.java	927 public NavigableMap<K,V> headMap(K toKey, boolean inclusive) { argument 930 false, toKey, inclusive); 941 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { argument 943 false, fromKey, inclusive, 1165 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 1166 return new KeySet<>(m.headMap(toElement, inclusive)); 1168 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 1169 return new KeySet<>(m.tailMap(fromElement, inclusive)); 1362 * if loInclusive is true, lo is the inclusive bound, else lo 1420 final boolean inRange(Object key, boolean inclusive) { argument 1879 headMap(K toKey, boolean inclusive) argument 1891 tailMap(K fromKey, boolean inclusive) argument 1972 headMap(K toKey, boolean inclusive) argument 1984 tailMap(K fromKey, boolean inclusive) argument [all...]
H A D	Collections.java	450 * position, inclusive. 481 * position, inclusive.<p> 765 * and <tt>list.size()-1</tt>, inclusive. (This method has no effect on 1301 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 1303 ns.headSet(toElement, inclusive)); 1306 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 1308 ns.tailSet(fromElement, inclusive)); 1990 public NavigableMap<K, V> headMap(K toKey, boolean inclusive) argument 1991 { return unmodifiableNavigableMap(nm.headMap(toKey, inclusive)); } 1992 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) argument 2381 headSet(E toElement, boolean inclusive) argument 2387 tailSet(E fromElement, boolean inclusive) argument 2981 headMap(K toKey, boolean inclusive) argument 2988 tailMap(K fromKey, boolean inclusive) argument 3416 headSet(E toElement, boolean inclusive) argument 3420 tailSet(E fromElement, boolean inclusive) argument 4197 headMap(K toKey, boolean inclusive) argument 4201 tailMap(K fromKey, boolean inclusive) argument [all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
H A D	ConcurrentNavigableMap.java	`70 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); argument 77 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument`
H A D	ConcurrentSkipListSet.java	`428 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument 429 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive)); 437 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument 438 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));`
H A D	ConcurrentSkipListMap.java	2066 boolean inclusive) { 2070 (this, null, false, toKey, inclusive, false); 2079 boolean inclusive) { 2083 (this, fromKey, inclusive, null, false, false); 2414 public NavigableSet<K> headSet(K toElement, boolean inclusive) { argument 2415 return new KeySet<>(m.headMap(toElement, inclusive)); 2417 public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { argument 2418 return new KeySet<>(m.tailMap(fromElement, inclusive)); 2962 public SubMap<K,V> headMap(K toKey, boolean inclusive) { argument 2965 return newSubMap(null, false, toKey, inclusive); 2065 headMap(K toKey, boolean inclusive) argument 2078 tailMap(K fromKey, boolean inclusive) argument 2968 tailMap(K fromKey, boolean inclusive) argument [all...]
/libcore/ojluni/src/main/java/java/time/format/
H A D	DateTimeFormatterBuilder.java	447 throw new IllegalArgumentException("The width must be from 1 to 19 inclusive but was " + width); 493 throw new IllegalArgumentException("The minimum width must be from 1 to 19 inclusive but was " + minWidth); 496 throw new IllegalArgumentException("The maximum width must be from 1 to 19 inclusive but was " + maxWidth); 860 throw new IllegalArgumentException("The fractional digits must be from -1 to 9 inclusive but was " + fractionalDigits); 2766 throw new IllegalArgumentException("The minWidth must be from 1 to 10 inclusive but was " + minWidth); 2769 throw new IllegalArgumentException("The maxWidth must be from 1 to 10 inclusive but was " + minWidth); 2924 throw new IllegalArgumentException("Minimum width must be from 0 to 9 inclusive but was " + minWidth); 2927 throw new IllegalArgumentException("Maximum width must be from 1 to 9 inclusive but was " + maxWidth); 3012 * The fractional value is between 0 (inclusive) and 1 (exclusive). 3039 * The fractional value must be between 0 (inclusive) an [all...]

Completed in 495 milliseconds