@InternalApi public abstract class ImmutableSortedMap<K,V> extends Object implements Iterable<Map.Entry<K,V>>
Modifier and Type | Class and Description |
---|---|
static class |
ImmutableSortedMap.Builder |
Constructor and Description |
---|
ImmutableSortedMap() |
Modifier and Type | Method and Description |
---|---|
abstract boolean |
containsKey(K key) |
boolean |
equals(Object o) |
abstract V |
get(K key) |
abstract Comparator<K> |
getComparator() |
abstract K |
getMaxKey() |
abstract K |
getMinKey() |
abstract K |
getPredecessorKey(K key) |
abstract K |
getSuccessorKey(K key) |
int |
hashCode() |
abstract int |
indexOf(K key) |
abstract void |
inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor) |
abstract ImmutableSortedMap<K,V> |
insert(K key,
V value) |
abstract boolean |
isEmpty() |
abstract Iterator<Map.Entry<K,V>> |
iterator() |
abstract Iterator<Map.Entry<K,V>> |
iteratorFrom(K key) |
abstract ImmutableSortedMap<K,V> |
remove(K key) |
abstract Iterator<Map.Entry<K,V>> |
reverseIterator() |
abstract Iterator<Map.Entry<K,V>> |
reverseIteratorFrom(K key) |
abstract int |
size() |
String |
toString() |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
forEach, spliterator
public abstract boolean containsKey(K key)
public abstract ImmutableSortedMap<K,V> remove(K key)
public abstract ImmutableSortedMap<K,V> insert(K key, V value)
public abstract K getMinKey()
public abstract K getMaxKey()
public abstract int size()
public abstract boolean isEmpty()
public abstract void inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
public abstract int indexOf(K key)
public abstract Comparator<K> getComparator()
Copyright © 2019 Google LLC. All rights reserved.