Searched refs:fromInclusive (Results 1 - 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DNavigableSet.java199 * fromInclusive} and {@code toInclusive} are both true. The returned set
208 * @param fromInclusive {@code true} if the low endpoint
230 NavigableSet<E> subSet(E fromElement, boolean fromInclusive, argument
H A DNavigableMap.java303 * {@code fromInclusive} and {@code toInclusive} are both true. The
313 * @param fromInclusive {@code true} if the low endpoint
333 NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, argument
H A DTreeSet.java323 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, argument
325 return new TreeSet<>(m.subMap(fromElement, fromInclusive,
H A DTreeMap.java912 public NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, argument
915 false, fromKey, fromInclusive,
1160 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, argument
1162 return new KeySet<>(m.subMap(fromElement, fromInclusive,
1868 public NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, argument
1870 if (!inRange(fromKey, fromInclusive))
1875 false, fromKey, fromInclusive,
1961 public NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, argument
1963 if (!inRange(fromKey, fromInclusive))
1969 false, fromKey, fromInclusive);
[all...]
H A DCollections.java1296 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { argument
1298 ns.subSet(fromElement, fromInclusive, toElement, toInclusive));
1985 public NavigableMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { argument
1987 nm.subMap(fromKey, fromInclusive, toKey, toInclusive));
2375 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { argument
2377 return new SynchronizedNavigableSet<>(ns.subSet(fromElement, fromInclusive, toElement, toInclusive), mutex);
2974 public NavigableMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) { argument
2977 nm.subMap(fromKey, fromInclusive, toKey, toInclusive), mutex);
3412 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { argument
3413 return checkedNavigableSet(ns.subSet(fromElement, fromInclusive, toElemen
4193 subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentNavigableMap.java62 ConcurrentNavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, argument
H A DConcurrentSkipListSet.java415 boolean fromInclusive,
419 (m.subMap(fromElement, fromInclusive,
414 subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DConcurrentSkipListMap.java2051 boolean fromInclusive,
2057 (this, fromKey, fromInclusive, toKey, toInclusive, false);
2408 boolean fromInclusive,
2411 return new KeySet<>(m.subMap(fromElement, fromInclusive,
2592 K fromKey, boolean fromInclusive,
2602 this.loInclusive = fromInclusive;
2918 SubMap<K,V> newSubMap(K fromKey, boolean fromInclusive, argument
2925 boolean ti = fromInclusive;
2926 fromInclusive = toInclusive;
2932 fromInclusive
2050 subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
2407 subSet(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) argument
2591 SubMap(ConcurrentSkipListMap<K,V> map, K fromKey, boolean fromInclusive, K toKey, boolean toInclusive, boolean isDescending) argument
2955 subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) argument
[all...]

Completed in 102 milliseconds