Classes
ArraySortedMap<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
ImmutableSortedMap<K,V>
ImmutableSortedMap.Builder
ImmutableSortedMapIterator<K,V>
ImmutableSortedSet<T>
LLRBBlackValueNode<K,V>
LLRBEmptyNode<K,V>
LLRBNode.NodeVisitor<K,V>
LLRBRedValueNode<K,V>
LLRBValueNode<K,V>
RBTreeSortedMap<K,V>
This is a red-black tree backed implementation of ImmutableSortedMap. This has better asymptotic complexity for large collections, but performs worse in practice than an ArraySortedMap for small collections. It also uses about twice as much memory.
Note: This package is copied from https://github.com/firebase/firebase-admin-java/tree/master/ src/main/java/com/google/firebase/database/collection