| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentNavigableMap.java | 47 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:ConcurrentNavigableMap
68 ConcurrentNavigableMap<K,V> tailMap(K fromKey); method in interface:ConcurrentNavigableMap
|
| H A D | ConcurrentSkipListSet.java | 397 return new ConcurrentSkipListSet<E>(m.tailMap(fromElement, inclusive));
|
| H A D | ConcurrentSkipListMap.java | 1978 public ConcurrentNavigableMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap
2009 public ConcurrentNavigableMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap
2010 return tailMap(fromKey, true);
2337 return new KeySet<E>(m.tailMap(fromElement, inclusive));
2442 * <tt>tailMap</tt> methods of their underlying maps.
2849 public SubMap<K,V> tailMap(K fromKey, method in class:ConcurrentSkipListMap.SubMap
2864 public SubMap<K,V> tailMap(K fromKey) { method in class:ConcurrentSkipListMap.SubMap
2865 return tailMap(fromKey, true);
|
| /libcore/luni/src/main/java/java/util/ |
| H A D | SortedMap.java | 124 public SortedMap<K,V> tailMap(K startKey); method in interface:SortedMap
|
| H A D | NavigableMap.java | 31 * and {@code tailMap} differ from the like-named {@code
52 * {@link #tailMap(Object) tailMap(K)}
361 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); method in interface:NavigableMap
388 * <p>Equivalent to {@code tailMap(fromKey, true)}.
394 SortedMap<K,V> tailMap(K fromKey); method in interface:NavigableMap
|
| H A D | TreeMap.java | 716 public NavigableMap<K, V> tailMap(K from, boolean inclusive) { method in class:TreeMap
721 public SortedMap<K, V> tailMap(K fromInclusive) { method in class:TreeMap
1047 return TreeMap.this.tailMap(from, inclusive).navigableKeySet();
1051 return TreeMap.this.tailMap(fromInclusive, true).navigableKeySet();
1423 public NavigableMap<K, V> tailMap(K from, boolean inclusive) { method in class:TreeMap.BoundedMap
1428 public NavigableMap<K, V> tailMap(K fromInclusive) { method in class:TreeMap.BoundedMap
1631 return tailMap(from, inclusive).navigableKeySet();
1635 return tailMap(fromInclusive).navigableKeySet();
|
| H A D | TreeSet.java | 400 return new TreeSet<E>(backingMap.tailMap(start, startInclusive));
|
| H A D | Collections.java | 845 @Override public SortedMap<K, V> tailMap(K startKey) { method in class:Collections.SynchronizedSortedMap
847 return new SynchronizedSortedMap<K, V>(sm.tailMap(startKey),
1352 @Override public SortedMap<K, V> tailMap(K after) { method in class:Collections.UnmodifiableSortedMap
1353 return new UnmodifiableSortedMap<K, V>(sm.tailMap(after));
3390 @Override public SortedMap<K, V> tailMap(K fromKey) { method in class:Collections.CheckedSortedMap
3391 return new CheckedSortedMap<K, V>(sm.tailMap(fromKey), keyType, valueType);
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | OldTreeMapTest.java | 453 // java.util.TreeMap.tailMap(java.lang.Object)
454 Map tail = tm.tailMap(objArray[900].toString());
462 SortedMap sort = tm.tailMap("99");
465 sort.tailMap("101");
472 tm.tailMap(this);
479 tm.tailMap(null);
|