/openjdk7/jdk/test/java/util/TreeMap/ |
H A D | SubMapClear.java | 39 Set subSet = treeSet.subSet(new Integer(4),new Integer(10)); 40 subSet.clear(); // Used to throw exception
|
H A D | SubMap.java | 68 SortedSet s2 = s.subSet(new Integer(2), new Integer(2)); 88 SortedSet s3 = s.subSet(new Integer(2), new Integer(3));
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | SortedSet.java | 83 * SortedSet<String> sub = s.subSet(low, high+"\0");</pre> 89 * SortedSet<String> sub = s.subSet(low+"\0", high);</pre> 151 SortedSet<E> subSet(E fromElement, E toElement); method in interface:SortedSet
|
H A D | NavigableSet.java | 52 * null}. Methods {@code subSet}, {@code headSet}, 68 * {@link #subSet(Object, Object) subSet(E, E)}, 226 NavigableSet<E> subSet(E fromElement, boolean fromInclusive, method in interface:NavigableSet 290 * <p>Equivalent to {@code subSet(fromElement, true, toElement, false)}. 296 SortedSet<E> subSet(E fromElement, E toElement); method in interface:NavigableSet
|
H A D | TreeSet.java | 323 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, method in class:TreeSet 360 public SortedSet<E> subSet(E fromElement, E toElement) { method in class:TreeSet 361 return subSet(fromElement, true, toElement, false);
|
H A D | Collections.java | 1133 * <tt>subSet</tt>, <tt>headSet</tt>, or <tt>tailSet</tt> views, result in 1160 public SortedSet<E> subSet(E fromElement, E toElement) { method in class:Collections.UnmodifiableSortedSet 1161 return new UnmodifiableSortedSet<>(ss.subSet(fromElement,toElement)); 1730 * sorted set when iterating over it or any of its <tt>subSet</tt>, 1788 public SortedSet<E> subSet(E fromElement, E toElement) { method in class:Collections.SynchronizedSortedSet 1791 ss.subSet(fromElement, toElement), mutex); 2456 public SortedSet<E> subSet(E fromElement, E toElement) { method in class:Collections.CheckedSortedSet 2457 return checkedSortedSet(ss.subSet(fromElement,toElement), type);
|
H A D | TreeMap.java | 1067 public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, method in class:TreeMap.KeySet 1078 public SortedSet<E> subSet(E fromElement, E toElement) { method in class:TreeMap.KeySet 1079 return subSet(fromElement, true, toElement, false);
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListSet.java | 403 public NavigableSet<E> subSet(E fromElement, method in class:ConcurrentSkipListSet 436 public NavigableSet<E> subSet(E fromElement, E toElement) { method in class:ConcurrentSkipListSet 437 return subSet(fromElement, true, toElement, false);
|
H A D | ConcurrentSkipListMap.java | 2354 public NavigableSet<E> subSet(E fromElement, method in class:ConcurrentSkipListMap.KeySet 2367 public NavigableSet<E> subSet(E fromElement, E toElement) { method in class:ConcurrentSkipListMap.KeySet 2368 return subSet(fromElement, true, toElement, false);
|
/openjdk7/jdk/test/java/util/NavigableMap/ |
H A D | LockStep.java | 139 ? s.subSet(Integer.MIN_VALUE, true, Integer.MAX_VALUE, true) 140 : s.subSet(Integer.MAX_VALUE, true, Integer.MIN_VALUE, true); 229 equal2(s, s.subSet(a, true, z, true)); 231 testEmptySet(s.subSet(a, true, a, false)); 232 testEmptySet(s.subSet(z, true, z, false)); 308 equalNavigableSetsLeaf(s1.subSet(min, true, max, true), 309 s2.subSet(min, true, max, true)); 314 equalNavigableSetsLeaf((NavigableSet) s1.subSet(min, max), 315 (NavigableSet) s2.subSet(min, max)); 678 s.subSet( [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/ |
H A D | XSWildcardDecl.java | 457 boolean subset2sets(String[] subSet, String[] superSet){ argument 458 for (int i=0; i<subSet.length; i++) { 459 if (!elementInSet(subSet[i], superSet))
|
/openjdk7/jdk/test/java/util/Collection/ |
H A D | MOAT.java | 725 testNavigableSet(ns.subSet(0, false, 5, true)); 726 testNavigableSet(ns.subSet(1, true, 6, false)); 1064 check(m.navigableKeySet().subSet(-86, true, 86, false) 1072 check(m.descendingKeySet().subSet(86, true, -86, false)
|