SimpleArrayMap

public class SimpleArrayMap
extends Object

java.lang.Object
   ↳ androidx.collection.SimpleArrayMap<K, V>

Base implementation of ArrayMap that doesn't include any standard Java container API interoperability. These features are generally heavier-weight ways to interact with the container, so discouraged, but they can be useful to make it easier to use as a drop-in replacement for HashMap. If you don't need them, this class can be preferrable since it doesn't bring in any of the implementation of those APIs, allowing that code to be stripped by ProGuard.

Summary

Public constructors

SimpleArrayMap()

Create a new empty ArrayMap.

SimpleArrayMap(int capacity)

Create a new ArrayMap with a given initial capacity.

SimpleArrayMap(SimpleArrayMap<K, V> map)

Create a new ArrayMap with the mappings from the given ArrayMap.

Public methods

void clear()

Make the array map empty.

boolean containsKey(Object key)

Check whether a key exists in the array.

boolean containsValue(Object value)

Check whether a value exists in the array.

void ensureCapacity(int minimumCapacity)

Ensure the array map can hold at least minimumCapacity items.

boolean equals(Object object)

This implementation returns false if the object is not a Map or SimpleArrayMap, or if the maps have different sizes.

V get(Object key)

Retrieve a value from the array.

V getOrDefault(Object key, V defaultValue)

Retrieve a value from the array, or defaultValue if there is no mapping for the key.

int hashCode()

int indexOfKey(Object key)

Returns the index of a key in the set.

boolean isEmpty()

Return true if the array map contains no items.

K keyAt(int index)

Return the key at the given index in the array.

V put(K key, V value)

Add a new value to the array map.

void putAll(SimpleArrayMap<? extends K, ? extends V> array)

Perform a put(Object, Object) of all key/value pairs in array

V putIfAbsent(K key, V value)

Add a new value to the array map only if the key does not already have a value or it is mapped to null.

boolean remove(Object key, Object value)

Remove an existing key from the array map only if it is currently mapped to value.

V remove(Object key)

Remove an existing key from the array map.

V removeAt(int index)

Remove the key/value mapping at the given index.

boolean replace(K key, V oldValue, V newValue)

Replace the mapping for key only if it is already mapped to a value.

V replace(K key, V value)

Replace the mapping for key only if it is already mapped to a value.

V setValueAt(int index, V value)

Set the value at a given index in the array.

int size()

Return the number of items in this array map.

String toString()

This implementation composes a string by iterating over its mappings.

V valueAt(int index)

Return the value at the given index in the array.

Inherited methods

Public constructors

SimpleArrayMap

public SimpleArrayMap ()

Create a new empty ArrayMap. The default capacity of an array map is 0, and will grow once items are added to it.

SimpleArrayMap

public SimpleArrayMap (int capacity)

Create a new ArrayMap with a given initial capacity.

Parameters
capacity int

SimpleArrayMap

public SimpleArrayMap (SimpleArrayMap<K, V> map)

Create a new ArrayMap with the mappings from the given ArrayMap.

Parameters
map SimpleArrayMap

Public methods

clear

public void clear ()

Make the array map empty. All storage is released.

containsKey

public boolean containsKey (Object key)

Check whether a key exists in the array.

Parameters
key Object: The key to search for.
Returns
boolean Returns true if the key exists, else false.

containsValue

public boolean containsValue (Object value)

Check whet