public class LongSparseArray<E>
extends java.lang.Object
| Constructor and Description |
|---|
LongSparseArray()
Creates a new SparseArray containing no mappings.
|
LongSparseArray(int initialCapacity)
Creates a new SparseArray containing no mappings that will not
require any additional memory allocation to store the specified
number of mappings.
|
| Modifier and Type | Method and Description |
|---|---|
void |
append(long key,
E value)
Puts a key/value pair into the array, optimizing for the case where
the key is greater than all existing keys in the array.
|
void |
clear()
Removes all key-value mappings from this SparseArray.
|
void |
delete(long key)
Removes the mapping from the specified key, if there was any.
|
E |
get(long key)
Gets the Object mapped from the specified key, or
null
if no such mapping has been made. |
E |
get(long key,
E valueIfKeyNotFound)
Gets the Object mapped from the specified key, or the specified Object
if no such mapping has been made.
|
long[] |
getKeys() |
int |
indexOfKey(long key)
Returns the index for which
keyAt(int) would return the
specified key, or a negative number if the specified
key is not mapped. |
int |
indexOfValue(E value)
Returns an index for which
valueAt(int) would return the
specified key, or a negative number if no keys map to the
specified value. |
long |
keyAt(int index)
Given an index in the range
0...size()-1, returns
the key from the indexth key-value mapping that this
SparseArray stores. |
void |
put(long key,
E value)
Adds a mapping from the specified key to the specified value,
replacing the previous mapping from the specified key if there
was one.
|
void |
remove(long key)
Alias for
delete(long). |
void |
setValueAt(int index,
E value)
Given an index in the range
0...size()-1, sets a new
value for the indexth key-value mapping that this
SparseArray stores. |
void |
setValues(long[] keys,
E uniqueValue)
Sets all supplied keys to the given unique value.
|
int |
size()
Returns the number of key-value mappings that this SparseArray
currently stores.
|
E |
valueAt(int index)
Given an index in the range
0...size()-1, returns
the value from the indexth key-value mapping that this
SparseArray stores. |
public LongSparseArray()
public LongSparseArray(int initialCapacity)
public long[] getKeys()
public void setValues(long[] keys,
E uniqueValue)
keys - Keys to setuniqueValue - Value to set all supplied keys topublic E get(long key)
null
if no such mapping has been made.public E get(long key, E valueIfKeyNotFound)
public void delete(long key)
public void remove(long key)
delete(long).public void put(long key,
E value)
public int size()
public long keyAt(int index)
0...size()-1, returns
the key from the indexth key-value mapping that this
SparseArray stores.public E valueAt(int index)
0...size()-1, returns
the value from the indexth key-value mapping that this
SparseArray stores.public void setValueAt(int index,
E value)
0...size()-1, sets a new
value for the indexth key-value mapping that this
SparseArray stores.public int indexOfKey(long key)
keyAt(int) would return the
specified key, or a negative number if the specified
key is not mapped.public int indexOfValue(E value)
valueAt(int) 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.public void clear()
public void append(long key,
E value)