Class ArraySortedMap<K,V> (3.25.1)

Version 3.25.1

• 3.28.0 (latest)
• 3.27.2
• 3.26.5
• 3.25.1
• 3.24.3
• 3.22.0
• 3.21.4
• 3.20.0
• 3.17.0
• 3.16.3
• 3.15.7
• 3.14.4
• 3.13.2
• 3.12.1
• 3.11.0
• 3.10.0
• 3.9.6
• 3.8.2
• 3.7.10
• 3.6.0
• 3.5.0
• 3.4.2
• 3.3.0
• 3.2.0
• 3.1.0
• 3.0.21

public class ArraySortedMap<K,V> extends ImmutableSortedMap<K,V>

This is an array backed implementation of ImmutableSortedMap. It uses arrays and linear lookups to achieve good memory efficiency while maintaining good performance for small collections. To avoid degrading performance with increasing collection size it will automatically convert to a RBTreeSortedMap after an insert call above a certain threshold.

Note: This package is copied from https://github.com/firebase/firebase-admin-java/tree/master/ src/main/java/com/google/firebase/database/collection

Inheritance

java.lang.Object > ImmutableSortedMap > ArraySortedMap<K,V>

Inherited Members

ImmutableSortedMap.containsKey(K)

ImmutableSortedMap.equals(Object)

ImmutableSortedMap.get(K)

ImmutableSortedMap.getComparator()

ImmutableSortedMap.getMaxKey()

ImmutableSortedMap.getMinKey()

ImmutableSortedMap.getPredecessorKey(K)

ImmutableSortedMap.getSuccessorKey(K)

ImmutableSortedMap.hashCode()

ImmutableSortedMap.inOrderTraversal(LLRBNode.NodeVisitor<K,V>)

ImmutableSortedMap.indexOf(K)

ImmutableSortedMap.insert(K,V)

ImmutableSortedMap.isEmpty()

ImmutableSortedMap.iterator()

ImmutableSortedMap.iteratorFrom(K)

ImmutableSortedMap.remove(K)

ImmutableSortedMap.reverseIterator()

ImmutableSortedMap.reverseIteratorFrom(K)

ImmutableSortedMap.size()

ImmutableSortedMap.toString()

Object.clone()

Object.finalize()

Object.getClass()

Object.notify()

Object.notifyAll()

Object.wait()

Object.wait(long)

Object.wait(long,int)

Type Parameters
Name	Description
K
V

Static Methods

<A,B,C>buildFrom(List<A> keys, Map<B,C> values, ImmutableSortedMap.Builder.KeyTranslator<A,B> translator, Comparator<A> comparator)

public static ArraySortedMap<A,C> <A,B,C>buildFrom(List<A> keys, Map<B,C> values, ImmutableSortedMap.Builder.KeyTranslator<A,B> translator, Comparator<A> comparator)

Parameters
Name	Description
keys	List<A>
values	Map<B,C>
translator	KeyTranslator<A,B>
comparator	Comparator<A>

Returns
Type	Description
ArraySortedMap<A,C>

<K,V>fromMap(Map<K,V> map, Comparator<K> comparator)

public static ArraySortedMap<K,V> <K,V>fromMap(Map<K,V> map, Comparator<K> comparator)

Parameters
Name	Description
map	Map<K,V>
comparator	Comparator<K>

Returns
Type	Description
ArraySortedMap<K,V>

Constructors

ArraySortedMap(Comparator<K> comparator)

public ArraySortedMap(Comparator<K> comparator)

Parameter
Name	Description
comparator	Comparator<K>

Methods

containsKey(K key)

public boolean containsKey(K key)

Parameter
Name	Description
key	K

Returns
Type	Description
boolean

Overrides

ImmutableSortedMap<K,V>.containsKey(K key)

get(K key)

public V get(K key)

Parameter
Name	Description
key	K

Returns
Type	Description
V

Overrides

ImmutableSortedMap<K,V>.get(K key)

getComparator()

public Comparator<K> getComparator()

Returns
Type	Description
Comparator<K>

Overrides

ImmutableSortedMap<K,V>.getComparator()

getMaxKey()

public K getMaxKey()

Returns
Type	Description
K

Overrides

ImmutableSortedMap<K,V>.getMaxKey()

getMinKey()

public K getMinKey()

Returns
Type	Description
K

Overrides

ImmutableSortedMap<K,V>.getMinKey()

getPredecessorKey(K key)

public K getPredecessorKey(K key)

Parameter
Name	Description
key	K

Returns
Type	Description
K

Overrides

ImmutableSortedMap<K,V>.getPredecessorKey(K key)

getSuccessorKey(K key)

public K getSuccessorKey(K key)

Parameter
Name	Description
key	K

Returns
Type	Description
K

Overrides

ImmutableSortedMap<K,V>.getSuccessorKey(K key)

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

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

Parameter
Name	Description
visitor	NodeVisitor<K,V>

Overrides

ImmutableSortedMap<K,V>.inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)

indexOf(K key)

public int indexOf(K key)

Parameter
Name	Description
key	K

Returns
Type	Description
int

Overrides

ImmutableSortedMap<K,V>.indexOf(K key)

insert(K key, V value)

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

Parameters
Name	Description
key	K
value	V

Returns
Type	Description
ImmutableSortedMap<K,V>

Overrides

ImmutableSortedMap<K,V>.insert(K key, V value)

isEmpty()

public boolean isEmpty()

Returns
Type	Description
boolean

Overrides

ImmutableSortedMap<K,V>.isEmpty()

iterator()

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

Returns
Type	Description
Iterator<Entry<K,V>>

Overrides

ImmutableSortedMap<K,V>.iterator()

iteratorFrom(K key)

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

Parameter
Name	Description
key	K

Returns
Type	Description
Iterator<Entry<K,V>>

Overrides

ImmutableSortedMap<K,V>.iteratorFrom(K key)

remove(K key)

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

Parameter
Name	Description
key	K

Returns
Type	Description
ImmutableSortedMap<K,V>

Overrides

ImmutableSortedMap<K,V>.remove(K key)

reverseIterator()

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

Returns
Type	Description
Iterator<Entry<K,V>>

Overrides

ImmutableSortedMap<K,V>.reverseIterator()

reverseIteratorFrom(K key)

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

Parameter
Name	Description
key	K

Returns
Type	Description
Iterator<Entry<K,V>>

Overrides

ImmutableSortedMap<K,V>.reverseIteratorFrom(K key)

size()

public int size()

Returns
Type	Description
int

Overrides

ImmutableSortedMap<K,V>.size()