Home
last modified time | relevance | path

Searched refs:tailMap (Results 1 – 25 of 39) sorted by relevance

12

/external/guava/guava/src/com/google/common/collect/
DForwardingSortedMap.java91 public SortedMap<K, V> tailMap(K fromKey) { in tailMap() method in ForwardingSortedMap
92 return delegate().tailMap(fromKey); in tailMap()
134 Object ceilingKey = self.tailMap(key).firstKey(); in standardContainsKey()
155 return tailMap(fromKey).headMap(toKey); in standardSubMap()
DAbstractNavigableMap.java100 return tailMap(key, true).firstEntry(); in ceilingEntry()
106 return tailMap(key, false).firstEntry(); in higherEntry()
144 public SortedMap<K, V> tailMap(K fromKey) { in tailMap() method in AbstractNavigableMap
145 return tailMap(fromKey, true); in tailMap()
DForwardingNavigableMap.java128 return tailMap(key, true).firstEntry(); in standardCeilingEntry()
156 return tailMap(key, false).firstEntry(); in standardHigherEntry()
377 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() method
378 return delegate().tailMap(fromKey, inclusive); in tailMap()
396 return tailMap(fromKey, true); in standardTailMap()
DImmutableSortedMap.java542 return headMap(toKey, toInclusive).tailMap(fromKey, fromInclusive); in subMap()
556 public ImmutableSortedMap<K, V> tailMap(K fromKey) { in tailMap() method in ImmutableSortedMap
557 return tailMap(fromKey, true); in tailMap()
574 public abstract ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive); in tailMap() method in ImmutableSortedMap
598 return tailMap(key, true).firstEntry(); in ceilingEntry()
608 return tailMap(key, false).firstEntry(); in higherEntry()
DStandardRowSortedTable.java133 public SortedMap<R, Map<C, V>> tailMap(R fromKey) { in tailMap() method in StandardRowSortedTable.RowSortedMap
136 sortedBackingMap().tailMap(fromKey), factory).rowMap(); in tailMap()
DTreeRangeSet.java284 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) { in tailMap() method in TreeRangeSet.RangesByUpperBound
333 backingItr = rangesByLowerBound.tailMap(lowerEntry.getKey(), true).values().iterator(); in entryIterator()
335 backingItr = rangesByLowerBound.tailMap(upperBoundWindow.lowerEndpoint(), true) in entryIterator()
445 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) {
467 positiveRanges = positiveRangesByUpperBound.tailMap(
577 Entry<Cut<C>, Range<C>> firstEntry = tailMap(cut, true).firstEntry();
667 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) {
721 rangesByUpperBound.tailMap(restriction.lowerBound, false).values().iterator();
724 completeRangeItr = rangesByLowerBound.tailMap(lowerBoundWindow.lowerBound.endpoint(),
DMaps.java874 public SortedMap<K, V> tailMap(K fromKey) {
917 public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
1969 @Override public SortedMap<K, V2> tailMap(K fromKey) {
1970 return transformEntries(fromMap().tailMap(fromKey), transformer);
2063 @Override public NavigableMap<K, V2> tailMap(K fromKey) {
2064 return tailMap(fromKey, true);
2067 @Override public NavigableMap<K, V2> tailMap(K fromKey, boolean inclusive) {
2069 fromMap().tailMap(fromKey, inclusive), transformer);
2820 return (SortedSet<K>) tailMap(fromElement).keySet();
2864 @Override public SortedMap<K, V> tailMap(K fromKey) {
[all …]
DAbstractMapBasedMultimap.java1018 return new SortedKeySet(sortedMap().tailMap(fromElement)); in tailSet()
1102 return new NavigableKeySet(sortedMap().tailMap(fromElement, inclusive)); in tailSet()
1399 public SortedMap<K, Collection<V>> tailMap(K fromKey) {
1400 return new SortedAsMap(sortedMap().tailMap(fromKey));
1554 public NavigableMap<K, Collection<V>> tailMap(K fromKey) {
1555 return tailMap(fromKey, true);
1559 public NavigableMap<K, Collection<V>> tailMap(K fromKey, boolean inclusive) {
1560 return new NavigableAsMap(sortedMap().tailMap(fromKey, inclusive));
DEmptyImmutableSortedMap.java103 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() method in EmptyImmutableSortedMap
DTreeBasedTable.java227 @Override public SortedMap<C, V> tailMap(C fromKey) { in tailMap() method in TreeBasedTable.TreeRow
272 map = map.tailMap(lowerBound); in computeBackingRowMap()
DRegularImmutableSortedMap.java118 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() method
DSynchronized.java1094 @Override public SortedMap<K, V> tailMap(K fromKey) {
1096 return sortedMap(delegate().tailMap(fromKey), mutex);
1491 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
1494 delegate().tailMap(fromKey, inclusive), mutex);
1506 @Override public SortedMap<K, V> tailMap(K fromKey) {
1507 return tailMap(fromKey, true);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
DSortedMapInterfaceTest.java72 SortedMap<K, V> subMap = map.tailMap(key); in testTailMapWriteThrough()
99 SortedMap<K, V> subMap = map.tailMap(key); in testTailMapRemoveThrough()
122 SortedMap<K, V> subMap = map.tailMap(key); in testTailMapClearThrough()
DSafeTreeMap.java258 @Override public SortedMap<K, V> tailMap(K fromKey) {
259 return tailMap(fromKey, true);
262 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
264 delegate.tailMap(checkValid(fromKey), inclusive));
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DImmutableSortedMap.java163 = map.tailMap(key).entrySet().iterator().next(); in putEntryWithChecks()
285 return tailMap(fromKey, fromInclusive).headMap(toKey, toInclusive); in subMap()
288 public ImmutableSortedMap<K, V> tailMap(K fromKey) { in tailMap() method in ImmutableSortedMap
290 return newView(sortedDelegate.tailMap(fromKey)); in tailMap()
293 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() method in ImmutableSortedMap
301 return tailMap(fromKey); in tailMap()
/external/guava/guava-tests/test/com/google/common/collect/
DSynchronizedNavigableMapTest.java201 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() method in SynchronizedNavigableMapTest.TestMap
203 return delegate().tailMap(fromKey, inclusive); in tailMap()
206 @Override public SortedMap<K, V> tailMap(K fromKey) { in tailMap() method in SynchronizedNavigableMapTest.TestMap
207 return tailMap(fromKey, true); in tailMap()
377 SortedMap<String, Integer> subMap = map.tailMap("a"); in testTailMap_K()
384 NavigableMap<String, Integer> subMap = map.tailMap("a", true); in testTailMap_K_B()
DTreeBasedTableTest.java302 = sortedTable.rowMap().tailMap("cat"); in testRowKeyMapTailMap()
396 entrySet = row.tailMap(15).entrySet(); in testRowEntrySetContains()
409 Set<Map.Entry<Integer, Character>> entrySet = row.tailMap(15).entrySet(); in testRowEntrySetRemove()
427 assertEquals(row.tailMap(15).size(), 1); in testRowSize()
433 SortedMap<Integer, Character> subRow = row.tailMap(2); in testSubRowClearAndPut()
DMapsTest.java691 assertThat(map.tailMap("onea").entrySet()).has().exactly( in testAsMapSorted()
745 map.tailMap("a").keySet().add("a"); in testAsMapSortedSubViewKeySetsDoNotSupportAdd()
755 map.headMap("r").tailMap("m").keySet().add("a"); in testAsMapSortedSubViewKeySetsDoNotSupportAdd()
787 assertThat(map.tailMap("onea").entrySet()).has().exactly( in testAsMapNavigable()
795 map.tailMap("three", true)); in testAsMapNavigable()
817 map.descendingMap().tailMap("three", true)); in testAsMapNavigable()
818 assertThat(map.tailMap("three", false).entrySet()).has().item( in testAsMapNavigable()
820 assertNull(map.tailMap("three", true).lowerEntry("three")); in testAsMapNavigable()
860 NavigableMap<String, Integer> tailMap = map.tailMap("s", true); in testAsMapNavigableReadsThrough() local
865 assertThat(tailMap.entrySet()).has().exactly( in testAsMapNavigableReadsThrough()
[all …]
DForwardingNavigableMapTest.java211 public SortedMap<K, V> tailMap(K fromKey) { in tailMap() method
374 forward().tailMap("a", false);
DImmutableSortedMapTest.java223 .tailMap("b"); in makePopulatedMap()
238 .tailMap("a", false); in makePopulatedMap()
728 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", true); in testTailMapInclusive()
736 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", false); in testTailMapExclusive()
DTreeRangeSetTest.java119 assertThat(navigableMap.tailMap(key, inclusive).entrySet()) in testNavigationAgainstExpected()
120 .has().exactlyAs(expected.tailMap(key, inclusive).entrySet()).inOrder(); in testNavigationAgainstExpected()
123 assertThat(navigableMap.tailMap(key, inclusive).descendingMap().entrySet()) in testNavigationAgainstExpected()
124 .has().exactlyAs(expected.tailMap(key, inclusive).descendingMap().entrySet()).inOrder(); in testNavigationAgainstExpected()
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
DTreeBasedTableTest.java259 = sortedTable.rowMap().tailMap("cat"); in testRowKeyMapTailMap()
353 entrySet = row.tailMap(15).entrySet(); in testRowEntrySetContains()
366 Set<Map.Entry<Integer, Character>> entrySet = row.tailMap(15).entrySet(); in testRowEntrySetRemove()
384 assertEquals(row.tailMap(15).size(), 1); in testRowSize()
390 SortedMap<Integer, Character> subRow = row.tailMap(2); in testSubRowClearAndPut()
DImmutableSortedMapTest.java146 .tailMap("b"); in makePopulatedMap()
161 .tailMap("a", false); in makePopulatedMap()
629 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", true); in testTailMapInclusive()
637 ImmutableSortedMap.of("one", 1, "two", 2, "three", 3).tailMap("three", false); in testTailMapExclusive()
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
DSortedMapNavigationTester.java112 assertTrue(navigableMap.tailMap(a.getKey()).containsKey(a.getKey())); in testTailMapInclusive()
130 assertThat(navigableMap.tailMap(entries.get(i).getKey()).entrySet()) in testTailMap()
DNavigableMapNavigationTester.java259 assertFalse(navigableMap.tailMap(a.getKey(), false).containsKey(a.getKey())); in testTailMapExclusive()
264 assertTrue(navigableMap.tailMap(a.getKey(), true).containsKey(a.getKey())); in testTailMapInclusive()

12