/openjdk7/jdk/test/java/util/TreeMap/ |
H A D | NullPermissiveComparator.java | 66 equal(m.tailMap("b"), "{b=B, c=C}"); 68 equal(m.tailMap(null), "{a=A, b=B, c=C}"); 74 equal(m.tailMap("b"), "{b=B, c=C}"); 76 equal(m.tailMap(null), "{null=NULL, a=A, b=B, c=C}"); 86 equal(m.tailMap("b"), "{b=B, c=C}"); 88 equal(m.tailMap(null), "{}"); 94 equal(m.tailMap("b"), "{b=B, c=C, null=NULL}"); 96 equal(m.tailMap(null), "{null=NULL}");
|
H A D | HeadTailTypeError.java | 44 m.tailMap(new Object()); 45 throw new Exception("tailMap, natural ordering"); 59 m.tailMap(new Integer(0)); 60 throw new Exception("tailMap, explicit comparator"); 101 m.tailMap(null); 102 throw new Exception("(null endpoint)tailMap, natural ordering"); 116 m.tailMap(null); 117 throw new Exception("(null endpoint)tailMap, explicit comparator"); 152 m.tailMap(new Integer(0)); 155 m.tailMap("llam [all...] |
H A D | NullAtEnd.java | 97 SortedMap<String,String> m3 = m2.tailMap("b");
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentNavigableMap.java | 76 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:ConcurrentNavigableMap 97 ConcurrentNavigableMap<K,V> tailMap(K fromKey); method in interface:ConcurrentNavigableMap
|
H A D | ConcurrentSkipListSet.java | 427 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
|
H A D | ConcurrentSkipListMap.java | 2006 public ConcurrentNavigableMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap 2037 public ConcurrentNavigableMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap 2038 return tailMap(fromKey, true); 2365 return new KeySet<E>(m.tailMap(fromElement, inclusive)); 2470 * <tt>tailMap</tt> methods of their underlying maps. 2877 public SubMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap.SubMap 2892 public SubMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap.SubMap 2893 return tailMap(fromKey, true);
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | SortedMap.java | 208 SortedMap<K,V> tailMap(K fromKey); method in interface:SortedMap
|
H A D | NavigableMap.java | 56 * and {@code tailMap} differ from the like-named {@code 77 * {@link #tailMap(Object) tailMap(K)} 390 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:NavigableMap 417 * <p>Equivalent to {@code tailMap(fromKey, true)}. 423 SortedMap<K,V> tailMap(K fromKey); method in interface:NavigableMap
|
H A D | TreeSet.java | 350 return new TreeSet<>(m.tailMap(fromElement, inclusive));
|
H A D | TreeMap.java | 904 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap 939 public SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap 940 return tailMap(fromKey, true); 1076 return new KeySet<>(m.tailMap(fromElement, inclusive)); 1510 public final SortedMap<K,V> tailMap(K fromKey) { method in class:TreeMap.NavigableSubMap 1511 return tailMap(fromKey, true); 1725 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.AscendingSubMap 1806 public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive) { method in class:TreeMap.DescendingSubMap 1874 public SortedMap<K,V> tailMap(K fromKey) { throw new InternalError(); } method in class:TreeMap.SubMap
|
H A D | Collections.java | 1511 * <tt>subMap</tt>, <tt>headMap</tt>, or <tt>tailMap</tt> views, result in 1545 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.UnmodifiableSortedMap 1546 return new UnmodifiableSortedMap<>(sm.tailMap(fromKey)); 2106 * <tt>tailMap</tt> views. 2179 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.SynchronizedSortedMap 2181 return new SynchronizedSortedMap<>(sm.tailMap(fromKey),mutex); 2967 public SortedMap<K,V> tailMap(K fromKey) { method in class:Collections.CheckedSortedMap 2968 return checkedSortedMap(sm.tailMap(fromKey), keyType, valueType);
|
/openjdk7/jdk/test/java/util/Collections/ |
H A D | ViewSynch.java | 39 static Map m2 = m.tailMap(ZERO);
|
/openjdk7/jdk/test/java/util/NavigableMap/ |
H A D | LockStep.java | 128 ? m.tailMap(Integer.MIN_VALUE, true) 129 : m.tailMap(Integer.MAX_VALUE, true); 372 equal2(m, m.tailMap(a)); 379 testEmptyMap(m.tailMap(z, false)); 382 equal2(m.tailMap(z, true), singletonMap(z, m.get(z))); 485 equalNavigableMapsLeaf(m1.tailMap(min, true), 486 m2.tailMap(min, true)); 497 equalNavigableMapsLeaf((NavigableMap) m1.tailMap(min), 498 (NavigableMap) m2.tailMap(min)); 523 m.tailMap( [all...] |
/openjdk7/jdk/test/java/util/Collection/ |
H A D | BiggernYours.java | 71 compareMaps(m1.tailMap(Integer.MIN_VALUE), 72 m2.tailMap(Integer.MIN_VALUE));
|
H A D | MOAT.java | 816 testNavigableMap(nm.tailMap(0, false)); 817 testNavigableMap(nm.tailMap(1, true)); 1027 return m.tailMap(-99, false); }}, 1045 equal(m.descendingMap().tailMap(86, true).remove(k), v); }}, 1050 equal(m.tailMap(-86, true).remove(k), v); }},
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | PropMap.java | 325 public SortedMap<Object, Object> tailMap(Object fromKey) { method in class:PropMap 326 return theMap.tailMap(fromKey);
|