androidx.collection
-
ArraySet
/ArrayMap
Implementations of
Set
andMap
, respectively, which are backed by an array with lookups done by a binary search. -
SparseArrayCompat
/LongSparseArray
Map-like structures whose keys are
int
andlong
, respectively, which prevents boxing compared to a traditionalMap
. -
LruCache
A map-like cache which keeps frequently-used entries and automatically evicts others.
-
CircularArray
/CircularIntArray
List-like structures which can efficiently prepend and append elements.
Classes
ArrayMap<K, V> |
ArrayMap is a generic key->value mapping data structure that is
designed to be more memory efficient than a traditional HashMap ,
this implementation is a version of the platform's
android.util.ArrayMap that can be used on older versions of the platform.
|
ArraySet<E> |
ArraySet is a generic set data structure that is designed to be more memory efficient than a
traditional HashSet .
|
CircularArray<E> | CircularArray is a generic circular array data structure that provides O(1) random read, O(1) prepend and O(1) append. |
CircularIntArray | CircularIntArray is a circular integer array data structure that provides O(1) random read, O(1) prepend and O(1) append. |
LongSparseArray<E> | SparseArray mapping longs to Objects. |
LruCache<K, V> |
Static library version of android.util.LruCache .
|
SimpleArrayMap<K, V> |
Base implementation of ArrayMap that doesn't include any standard Java
container API interoperability.
|
SparseArrayCompat<E> | SparseArrays map integers to Objects. |