@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return filterEntries(unfiltered.tailMap(fromKey, inclusive), entryPredicate); } }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return Maps.unmodifiableNavigableMap(delegate.tailMap(fromKey, inclusive)); } }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return delegate().tailMap(fromKey, inclusive); }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return filterEntries(unfiltered.tailMap(fromKey, inclusive), entryPredicate); } }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return Maps.unmodifiableNavigableMap(delegate.tailMap(fromKey, inclusive)); } }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return delegate().tailMap(fromKey, inclusive); }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { synchronized (mutex) { return navigableMap(delegate().tailMap(fromKey, inclusive), mutex); } }
@CollectionSize.Require(absent = ZERO) public void testTailMapInclusive() { assertTrue(navigableMap.tailMap(a.getKey(), true).containsKey(a.getKey())); } }
@Override public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { return forward().tailMap(toKey, inclusive).descendingMap(); }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { return new SafeTreeMap<>(delegate.tailMap(checkValid(fromKey), inclusive)); }
@Override public NavigableMap<K, V2> tailMap(K fromKey, boolean inclusive) { return transformEntries(fromMap().tailMap(fromKey, inclusive), transformer); }
@Override public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { return map().tailMap(fromElement, inclusive).navigableKeySet(); }
@CollectionSize.Require(absent = ZERO) public void testTailMapExclusive() { assertFalse(navigableMap.tailMap(a.getKey(), false).containsKey(a.getKey())); }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { synchronized (mutex) { return navigableMap(delegate().tailMap(fromKey, inclusive), mutex); } }
@Override public NavigableSet<K> tailSet(K fromElement, boolean inclusive) { return map().tailMap(fromElement, inclusive).navigableKeySet(); }
@Override public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { return forward().tailMap(toKey, inclusive).descendingMap(); }
@Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { assertTrue(Thread.holdsLock(mutex)); return delegate().tailMap(fromKey, inclusive); }
@Override NavigableMap<K, V> createSubMap(SortedMap<K, V> sortedMap, K firstExclusive, K lastExclusive) { NavigableMap<K, V> map = (NavigableMap<K, V>) sortedMap; if (from == Bound.NO_BOUND && to == Bound.INCLUSIVE) { return map.headMap(lastInclusive, true); } else if (from == Bound.EXCLUSIVE && to == Bound.NO_BOUND) { return map.tailMap(firstExclusive, false); } else if (from == Bound.EXCLUSIVE && to == Bound.EXCLUSIVE) { return map.subMap(firstExclusive, false, lastExclusive, false); } else if (from == Bound.EXCLUSIVE && to == Bound.INCLUSIVE) { return map.subMap(firstExclusive, false, lastInclusive, true); } else if (from == Bound.INCLUSIVE && to == Bound.INCLUSIVE) { return map.subMap(firstInclusive, true, lastInclusive, true); } else { return (NavigableMap<K, V>) super.createSubMap(map, firstExclusive, lastExclusive); } } }
public void testTailMap_K() { NavigableMap<String, Integer> map = create(); SortedMap<String, Integer> subMap = map.tailMap("a"); assertTrue(subMap instanceof SynchronizedSortedMap); assertSame(mutex, ((SynchronizedSortedMap<String, Integer>) subMap).mutex); }
public void testTailMap_K_B() { NavigableMap<String, Integer> map = create(); NavigableMap<String, Integer> subMap = map.tailMap("a", true); assertTrue(subMap instanceof SynchronizedNavigableMap); assertSame(mutex, ((SynchronizedNavigableMap<String, Integer>) subMap).mutex); }