Searched defs:inclusive (Results 1 - 8 of 8) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentNavigableMap.java68 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); argument
76 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument
H A DConcurrentSkipListSet.java417 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
418 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive));
426 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
427 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
H A DConcurrentSkipListMap.java1994 boolean inclusive) {
1998 (this, null, false, toKey, inclusive, false);
2007 boolean inclusive) {
2011 (this, fromKey, inclusive, null, false, false);
2361 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
2362 return new KeySet<E>(m.headMap(toElement, inclusive));
2364 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
2365 return new KeySet<E>(m.tailMap(fromElement, inclusive));
2871 boolean inclusive) {
2874 return newSubMap(null, false, toKey, inclusive);
1993 headMap(K toKey, boolean inclusive) argument
2006 tailMap(K fromKey, boolean inclusive) argument
2870 headMap(K toKey, boolean inclusive) argument
2877 tailMap(K fromKey, boolean inclusive) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DNavigableMap.java58 * whether lower and upper bounds are inclusive versus exclusive.
336 * equal to, if {@code inclusive} is true) {@code toKey}. The returned
345 * @param inclusive {@code true} if the high endpoint
348 * (or equal to, if {@code inclusive} is true) {@code toKey}
361 NavigableMap<K,V> headMap(K toKey, boolean inclusive); argument
365 * equal to, if {@code inclusive} is true) {@code fromKey}. The returned
374 * @param inclusive {@code true} if the low endpoint
377 * (or equal to, if {@code inclusive} is true) {@code fromKey}
390 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); argument
H A DNavigableSet.java55 * whether lower and upper bounds are inclusive versus exclusive.
210 * {@code fromElement}, inclusive, to {@code toElement}, exclusive
231 * (or equal to, if {@code inclusive} is true) {@code toElement}. The
240 * @param inclusive {@code true} if the high endpoint
243 * (or equal to, if {@code inclusive} is true) {@code toElement}
256 NavigableSet<E> headSet(E toElement, boolean inclusive); argument
260 * than (or equal to, if {@code inclusive} is true) {@code fromElement}.
269 * @param inclusive {@code true} if the low endpoint
285 NavigableSet<E> tailSet(E fromElement, boolean inclusive); argument
H A DTreeSet.java337 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 DTreeMap.java890 public NavigableMap<K,V> headMap(K toKey, boolean inclusive) { argument
893 false, toKey, inclusive);
904 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { argument
906 false, fromKey, inclusive,
1072 public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
1073 return new KeySet<>(m.headMap(toElement, inclusive));
1075 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
1076 return new KeySet<>(m.tailMap(fromElement, inclusive));
1249 * if loInclusive is true, lo is the inclusive bound, else lo
1307 final boolean inRange(Object key, boolean inclusive) { argument
1717 headMap(K toKey, boolean inclusive) argument
1725 tailMap(K fromKey, boolean inclusive) argument
1798 headMap(K toKey, boolean inclusive) argument
1806 tailMap(K fromKey, boolean inclusive) argument
[all...]
/openjdk7/jdk/src/macosx/classes/apple/laf/
H A DJRSUIUtils.java48 static boolean currentMacOSXVersionMatchesGivenVersionRange(final int version, final boolean inclusive, final boolean matchBelow, final boolean matchAbove) { argument
61 if (inclusive && minorVers == version) return true;

Completed in 4433 milliseconds