Class ImmutableSortedMap<K,V> (3.33.2)

public abstract class ImmutableSortedMap<K,V> implements Iterable<Map.Entry<K,V>>

public ImmutableSortedMap()

public abstract boolean containsKey(K key)

public boolean equals(Object o)

public abstract V get(K key)

public abstract Comparator<K> getComparator()

public abstract K getMaxKey()

public abstract K getMinKey()

public abstract K getPredecessorKey(K key)

public abstract K getSuccessorKey(K key)

public int hashCode()

public abstract void inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)

public abstract int indexOf(K key)

public abstract ImmutableSortedMap<K,V> insert(K key, V value)

public abstract boolean isEmpty()

public abstract Iterator<Map.Entry<K,V>> iterator()

public abstract Iterator<Map.Entry<K,V>> iteratorFrom(K key)

public abstract ImmutableSortedMap<K,V> remove(K key)

public abstract Iterator<Map.Entry<K,V>> reverseIterator()

public abstract Iterator<Map.Entry<K,V>> reverseIteratorFrom(K key)

public abstract int size()

public String toString()