ArrayMap

ArrayMap

ArrayMap()

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

ArrayMap

ArrayMap(map: ArrayMap<K, V>!)

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

ArrayMap

ArrayMap(capacity: Int)

Create a new ArrayMap with a given initial capacity.

clear

fun clear(): Unit

Make the array map empty. All storage is released.

containsAll

fun containsAll(collection: MutableCollection<*>!): Boolean

Determine if the array map contains all of the keys in the given collection.

containsKey

fun containsKey(key: K): Boolean

Check whether a key exists in the array.

containsValue

fun containsValue(value: V): Boolean

Check whether a value exists in the array. This requires a linear search through the entire array.

ensureCapacity

fun ensureCapacity(minimumCapacity: Int): Unit

Ensure the array map can hold at least minimumCapacity items.

equals

fun equals(other: Any?): Boolean

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

• It is reflexive: for any non-null reference value x, x.equals(x) should return true.
• It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
• It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
• For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

This implementation returns false if the object is not a map, or if the maps have different sizes. Otherwise, for each key in this map, values of both maps are compared. If the values for any key are not equal, the method returns false, otherwise it returns true.

forEach

fun forEach(action: BiConsumer<in K, in V>): Unit

Performs the given action for all elements in the stored order. This implementation overrides the default implementation to avoid iterating using the entrySet() and iterates in the key-value order consistent with keyAt(int) and valueAt(int).

get

fun get(key: K): V?

Retrieve a value from the array.

hashCode

fun hashCode(): Int

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

• Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
• If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
• It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

indexOfKey

fun indexOfKey(key: Any!): Int

Returns the index of a key in the set.

indexOfValue

fun indexOfValue(value: Any!): Int

Returns an index for which valueAt would return the specified value, or a negative number if no keys map to the specified value. Beware that this is a linear search, unlike lookups by key, and that multiple keys can map to the same value and this will find only one of them.

isEmpty

fun isEmpty(): Boolean

Return true if the array map contains no items.

keyAt

fun keyAt(index: Int): K

Return the key at the given index in the array.

For indices outside of the range 0...size()-1, the behavior is undefined for apps targeting android.os.Build.VERSION_CODES#P and earlier, and an ArrayIndexOutOfBoundsException is thrown for apps targeting android.os.Build.VERSION_CODES#Q and later.

put

fun put(
    key: K, 
    value: V
): V?

Add a new value to the array map.

putAll

fun putAll(array: ArrayMap<out K, out V>!): Unit

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

putAll

fun putAll(from: Map<out K, V>): Unit

Perform a put(java.lang.Object,java.lang.Object) of all key/value pairs in map

remove

fun remove(key: K): V?

Remove an existing key from the array map.

removeAll

fun removeAll(collection: MutableCollection<*>!): Boolean

Remove all keys in the array map that exist in the given collection.

removeAt

fun removeAt(index: Int): V

Remove the key/value mapping at the given index.

For indices outside of the range 0...size()-1, the behavior is undefined for apps targeting android.os.Build.VERSION_CODES#P and earlier, and an ArrayIndexOutOfBoundsException is thrown for apps targeting android.os.Build.VERSION_CODES#Q and later.

replaceAll

fun replaceAll(function: BiFunction<in K, in V, out V>): Unit

Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception. Exceptions thrown by the function are relayed to the caller. This implementation overrides the default implementation to avoid iterating using the entrySet() and iterates in the key-value order consistent with keyAt(int) and valueAt(int).

retainAll

fun retainAll(collection: MutableCollection<*>!): Boolean

Remove all keys in the array map that do not exist in the given collection.

setValueAt

fun setValueAt(
    index: Int, 
    value: V
): V

Set the value at a given index in the array.

For indices outside of the range 0...size()-1, the behavior is undefined for apps targeting android.os.Build.VERSION_CODES#P and earlier, and an ArrayIndexOutOfBoundsException is thrown for apps targeting android.os.Build.VERSION_CODES#Q and later.

toString

fun toString(): String

Returns a string representation of the object.

This implementation composes a string by iterating over its mappings. If this map contains itself as a key or a value, the string "(this Map)" will appear in its place.

valueAt

fun valueAt(index: Int): V

Return the value at the given index in the array.

For indices outside of the range 0...size()-1, the behavior is undefined for apps targeting android.os.Build.VERSION_CODES#P and earlier, and an ArrayIndexOutOfBoundsException is thrown for apps targeting android.os.Build.VERSION_CODES#Q and later.

entries

val entries: MutableSet<MutableEntry<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 and allocates additional state information associated with the container that will remain for the life of the container.

Note:

keys

val keys: MutableSet<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 and allocates additional state information associated with the container that will remain for the life of the container.

size

val size: Int

Return the number of items in this array map.

values

val values: MutableCollection<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 and allocates additional state information associated with the container that will remain for the life of the container.