148 lines
4.0 KiB
Java
148 lines
4.0 KiB
Java
package com.google.common.collect;
|
|
|
|
import com.google.common.collect.Maps;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
import java.util.NavigableMap;
|
|
import java.util.NavigableSet;
|
|
import java.util.NoSuchElementException;
|
|
import java.util.Set;
|
|
import java.util.SortedMap;
|
|
|
|
/* loaded from: classes.dex */
|
|
abstract class AbstractNavigableMap<K, V> extends Maps.IteratorBasedAbstractMap<K, V> implements NavigableMap<K, V> {
|
|
|
|
private final class DescendingMap extends Maps.DescendingMap<K, V> {
|
|
private DescendingMap() {
|
|
}
|
|
|
|
@Override // com.google.common.collect.Maps.DescendingMap
|
|
Iterator<Map.Entry<K, V>> b() {
|
|
return AbstractNavigableMap.this.a();
|
|
}
|
|
|
|
@Override // com.google.common.collect.Maps.DescendingMap
|
|
NavigableMap<K, V> c() {
|
|
return AbstractNavigableMap.this;
|
|
}
|
|
}
|
|
|
|
AbstractNavigableMap() {
|
|
}
|
|
|
|
abstract Iterator<Map.Entry<K, V>> a();
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> ceilingEntry(K k) {
|
|
return tailMap(k, true).firstEntry();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public K ceilingKey(K k) {
|
|
return (K) Maps.a(ceilingEntry(k));
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public NavigableSet<K> descendingKeySet() {
|
|
return descendingMap().navigableKeySet();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public NavigableMap<K, V> descendingMap() {
|
|
return new DescendingMap();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> firstEntry() {
|
|
return (Map.Entry) Iterators.b(entryIterator(), (Object) null);
|
|
}
|
|
|
|
@Override // java.util.SortedMap
|
|
public K firstKey() {
|
|
Map.Entry<K, V> firstEntry = firstEntry();
|
|
if (firstEntry != null) {
|
|
return firstEntry.getKey();
|
|
}
|
|
throw new NoSuchElementException();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> floorEntry(K k) {
|
|
return headMap(k, true).lastEntry();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public K floorKey(K k) {
|
|
return (K) Maps.a(floorEntry(k));
|
|
}
|
|
|
|
@Override // java.util.NavigableMap, java.util.SortedMap
|
|
public SortedMap<K, V> headMap(K k) {
|
|
return headMap(k, false);
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> higherEntry(K k) {
|
|
return tailMap(k, false).firstEntry();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public K higherKey(K k) {
|
|
return (K) Maps.a(higherEntry(k));
|
|
}
|
|
|
|
@Override // java.util.AbstractMap, java.util.Map, java.util.SortedMap
|
|
public Set<K> keySet() {
|
|
return navigableKeySet();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> lastEntry() {
|
|
return (Map.Entry) Iterators.b(a(), (Object) null);
|
|
}
|
|
|
|
@Override // java.util.SortedMap
|
|
public K lastKey() {
|
|
Map.Entry<K, V> lastEntry = lastEntry();
|
|
if (lastEntry != null) {
|
|
return lastEntry.getKey();
|
|
}
|
|
throw new NoSuchElementException();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> lowerEntry(K k) {
|
|
return headMap(k, false).lastEntry();
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public K lowerKey(K k) {
|
|
return (K) Maps.a(lowerEntry(k));
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public NavigableSet<K> navigableKeySet() {
|
|
return new Maps.NavigableKeySet(this);
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> pollFirstEntry() {
|
|
return (Map.Entry) Iterators.g(entryIterator());
|
|
}
|
|
|
|
@Override // java.util.NavigableMap
|
|
public Map.Entry<K, V> pollLastEntry() {
|
|
return (Map.Entry) Iterators.g(a());
|
|
}
|
|
|
|
@Override // java.util.NavigableMap, java.util.SortedMap
|
|
public SortedMap<K, V> subMap(K k, K k2) {
|
|
return subMap(k, true, k2, false);
|
|
}
|
|
|
|
@Override // java.util.NavigableMap, java.util.SortedMap
|
|
public SortedMap<K, V> tailMap(K k) {
|
|
return tailMap(k, true);
|
|
}
|
|
}
|