ArrayMap
-
android
class ArrayMap<K, V> : SimpleArrayMap, Map
ArrayMap is a generic key->value mapping data structure that is designed to be more memory efficient than a traditional java.util.HashMap, this implementation is a version of the platform's android.util.ArrayMap that can be used on older versions of the platform. It keeps its mappings in an array data structure -- an integer array of hash codes for each item, and an Object array of the key/value pairs. This allows it to avoid having to create an extra object for every entry put in to the map, and it also tries to control the growth of the size of these arrays more aggressively (since growing them only requires copying the entries in the array, not rebuilding a hash map).
If you don't need the standard Java container APIs provided here (iterators etc), consider using SimpleArrayMap instead.
Note that this implementation is not intended to be appropriate for data structures that may contain large numbers of items. It is generally slower than a traditional HashMap, since lookups require a binary search and adds and removes require inserting and deleting entries in the array. For containers holding up to hundreds of items, the performance difference is not significant, less than 50%.
Because this container is intended to better balance memory use, unlike most other standard Java containers it will shrink its array as items are removed from it. Currently you have no control over this shrinking -- if you set a capacity and then remove an item, it may reduce the capacity to better match the current size. In the future an explicit call to set the capacity should turn off this aggressive shrinking behavior.
NOTE: Consider using MutableScatterMap instead of this class. MutableScatterMap also avoids creating an extra object per entry but offers overall better performance characteristics. If a Map-like interface is required, please see asMap and asMutableMap.
Summary
Public constructors |
|
|---|---|
ArrayMap() |
android
|
|
Create a new ArrayMap with a given initial capacity. |
android
|
ArrayMap(map: SimpleArrayMap?)Create a new ArrayMap with the mappings from the given ArrayMap. |
android
|
Public functions |
||
|---|---|---|
Boolean |
containsAll(collection: (Mutable)Collection<Any!>)Determine if the array map contains all of the keys in the given collection. |
android
|
Boolean |
containsKey(key: Any?)Check whether a key exists in the array. |
android
|
Boolean |
containsValue(value: Any?)Check whether a value exists in the array. |
android
|
(Mutable)Set<(Mutable)Map.Entry<K!, V!>!> |
entrySet()Return a |
android
|
V! |
Retrieve a value from the array. |
android
|
(Mutable)Set<K!> |
keySet()Return a |
android
|
Unit |
Perform a put of all key/value pairs in map |
android
|
V! |
Remove an existing key from the array map. |
android
|
Boolean |
removeAll(collection: (Mutable)Collection<Any!>)Remove all keys in the array map that exist in the given collection. |
android
|
Boolean |
retainAll(collection: (Mutable)Collection<Any!>)Remove all keys in the array map that do not exist in the given collection. |
android
|
(Mutable)Collection<V!> |
values()Return a |
android
|
Inherited functions |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Public constructors
ArrayMap
ArrayMap(map: SimpleArrayMap?)
Create a new ArrayMap with the mappings from the given ArrayMap.
Public functions
containsAll
fun containsAll(collection: (Mutable)Collection<Any!>): Boolean
Determine if the array map contains all of the keys in the given collection.
| Parameters | |
|---|---|
collection: (Mutable)Collection<Any!> |
The collection whose contents are to be checked against. |
| Returns | |
|---|---|
Boolean |
Returns true if this array map contains a key for every entry in collection, else returns false. |
containsKey
fun containsKey(key: Any?): Boolean
Check whether a key exists in the array.
| Parameters | |
|---|---|
key: Any? |
The key to search for. ** This must be the same type as K ** |
| Returns | |
|---|---|
Boolean |
Returns |
containsValue
fun containsValue(value: Any?): Boolean
Check whether a value exists in the array. This requires a linear search through the entire array.
| Parameters | |
|---|---|
value: Any? |
The value to search for. ** This must be the same type as V ** |
| Returns | |
|---|---|
Boolean |
Returns |
entrySet
fun entrySet(): (Mutable)Set<(Mutable)Map.Entry<K!, V!>!>
Return a java.util.Set for iterating over and interacting with all mappings in the array map.
Note: this is a very inefficient way to access the array contents, it requires generating a number of temporary objects.
Note:
the semantics of this Set are subtly different than that of ajava.util.HashMap: most important, the Map.Entry object returned by its iterator is a single object that exists for the entire iterator, so you can not hold on to it after calling Iterator.next.get
fun get(key: Any?): V!
Retrieve a value from the array.
| Parameters | |
|---|---|
key: Any? |
The key of the value to retrieve. ** This must be the same type as K ** |
| Returns | |
|---|---|
V! |
Returns the value associated with the given key, or |
keySet
fun keySet(): (Mutable)Set<K!>
Return a java.util.Set for iterating over and interacting with all keys in the array map.
Note: this is a fairly inefficient way to access the array contents, it requires generating a number of temporary objects.
remove
fun remove(key: Any?): V!
Remove an existing key from the array map.
| Parameters | |
|---|---|
key: Any? |
The key of the mapping to remove. ** This must be the same type as V ** |
| Returns | |
|---|---|
V! |
Returns the value that was stored under the key, or |
removeAll
fun removeAll(collection: (Mutable)Collection<Any!>): Boolean
Remove all keys in the array map that exist in the given collection.
| Parameters | |
|---|---|
collection: (Mutable)Collection<Any!> |
The collection whose contents are to be used to remove keys. |
| Returns | |
|---|---|
Boolean |
Returns true if any keys were removed from the array map, else false. |
retainAll
fun retainAll(collection: (Mutable)Collection<Any!>): Boolean
Remove all keys in the array map that do not exist in the given collection.
| Parameters | |
|---|---|
collection: (Mutable)Collection<Any!> |
The collection whose contents are to be used to determine which keys to keep. |
| Returns | |
|---|---|
Boolean |
Returns true if any keys were removed from the array map, else false. |
values
fun values(): (Mutable)Collection<V!>
Return a java.util.Collection for iterating over and interacting with all values in the array map.
Note: this is a fairly inefficient way to access the array contents, it requires generating a number of temporary objects.