LongSparseArray

<E : Any?> LongSparseArray(initialCapacity: Int = 10)

Creates a new LongSparseArray containing no mappings that will not require any additional memory allocation to store the specified number of mappings. If you supply an initial capacity of 0, the sparse array will be initialized with a light-weight representation not requiring any additional array allocations.

open fun append(key: Long, value: E): Unit

Puts a key/value pair into the array, optimizing for the case where the key is greater than all existing keys in the array.

open fun clear(): Unit

Removes all key-value mappings from this LongSparseArray.

open fun containsKey(key: Long): Boolean

Returns true if the specified key is mapped.

open fun containsValue(value: E): Boolean

Returns true if the specified value is mapped from any key.

open fun delete(key: Long): Unit

Removes the mapping from the specified key, if there was any.

open operator fun get(key: Long): E?

Gets the value mapped from the specified key, or null if no such mapping has been made.

open fun get(key: Long, defaultValue: E): E

Gets the value mapped from the specified key, or defaultValue if no such mapping has been made.

open fun indexOfKey(key: Long): Int

Returns the index for which keyAt would return the specified key, or a negative number if the specified key is not mapped.

open fun indexOfValue(value: E): Int

Returns an index for which valueAt would return the specified key, 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.

open fun isEmpty(): Boolean

Return true if size is 0.

open fun keyAt(index: Int): Long

Given an index in the range 0...size()-1, returns the key from the indexth key-value mapping that this LongSparseArray stores.

The keys corresponding to indices in ascending order are guaranteed to be in ascending order, e.g., keyAt(0) will return the smallest key and keyAt(size()-1) will return the largest key.

open fun put(key: Long, value: E): Unit

Adds a mapping from the specified key to the specified value, replacing the previous mapping from the specified key if there was one.

open fun putAll(other: LongSparseArray<E>): Unit

Copies all of the mappings from other to this map. The effect of this call is equivalent to that of calling put on this map once for each mapping from key to value in other.

open fun putIfAbsent(key: Long, value: E): E?

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

open fun remove(key: Long): Unit

Removes the mapping from the specified key, if there was any.

open fun remove(key: Long, value: E): Boolean

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

open fun removeAt(index: Int): Unit

Removes the mapping at the specified index.

open fun replace(key: Long, value: E): E?

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

open fun replace(key: Long, oldValue: E, newValue: E): Boolean

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

open fun setValueAt(index: Int, value: E): Unit

Given an index in the range 0...size()-1, sets a new value for the indexth key-value mapping that this LongSparseArray stores.

open fun size(): Int

Returns the number of key-value mappings that this LongSparseArray currently stores.

open 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 value, the string "(this Map)" will appear in its place.

open fun valueAt(index: Int): E

Given an index in the range 0...size()-1, returns the value from the indexth key-value mapping that this LongSparseArray stores.

The values corresponding to indices in ascending order are guaranteed to be associated with keys in ascending order, e.g., valueAt(0) will return the value associated with the smallest key and valueAt(size()-1) will return the value associated with the largest key.

inline operator fun <T : Any?> LongSparseArray<T>.contains(key: Long): Boolean

Returns true if the collection contains key.

inline fun <T : Any?> LongSparseArray<T>.forEach(action: (key: Long, value) -> Unit): Unit

Performs the given action for each key/value entry.

inline fun <T : Any?> LongSparseArray<T>.getOrDefault(key: Long, defaultValue: T): T

Return the value corresponding to key, or defaultValue when not present.

inline fun <T : Any?> LongSparseArray<T>.getOrElse(key: Long, defaultValue: () -> T): T

Return the value corresponding to key, or from defaultValue when not present.

inline fun <T : Any?> LongSparseArray<T>.isNotEmpty(): Boolean

Return true when the collection contains elements.

fun <T : Any?> LongSparseArray<T>.keyIterator(): LongIterator

Return an iterator over the collection's keys.

operator fun <T : Any?> LongSparseArray<T>.plus(other: LongSparseArray<T>): LongSparseArray<T>

Creates a new collection by adding or replacing entries from other.

inline operator fun <T : Any?> LongSparseArray<T>.set(key: Long, value: T): Unit

Allows the use of the index operator for storing values in the collection.

fun <T : Any?> LongSparseArray<T>.valueIterator(): Iterator<T>

Return an iterator over the collection's values.

val LongSparseArray<T>.size: Int

Returns the number of key/value pairs in the collection.