Package com.google.cloud.firestore.collection (3.28.0)
| GitHub Repository |
This package is not the recommended entry point to using this client library!
For this library, we recommend using com.google.cloud.firestore for new applications.
Classes
| Class | Description |
|---|---|
| com.google.cloud.firestore.collection.ArraySortedMap | 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. |
| com.google.cloud.firestore.collection.ImmutableSortedMap | |
| com.google.cloud.firestore.collection.ImmutableSortedMap.Builder | |
| com.google.cloud.firestore.collection.ImmutableSortedMapIterator | |
| com.google.cloud.firestore.collection.ImmutableSortedSet | |
| com.google.cloud.firestore.collection.LLRBBlackValueNode | |
| com.google.cloud.firestore.collection.LLRBEmptyNode | |
| com.google.cloud.firestore.collection.LLRBNode.NodeVisitor | |
| com.google.cloud.firestore.collection.LLRBRedValueNode | |
| com.google.cloud.firestore.collection.LLRBValueNode | |
| com.google.cloud.firestore.collection.RBTreeSortedMap | 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. |
Interfaces
Enums
| Enum | Description |
|---|---|
| com.google.cloud.firestore.collection.LLRBNode.Color |