public class SparseIntArray
extends java.lang.Object
Constructor and Description |
---|
SparseIntArray()
Creates a new SparseIntArray containing no mappings.
|
SparseIntArray(int initialCapacity)
Creates a new SparseIntArray 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(int key,
int 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 SparseIntArray.
|
void |
delete(int key)
Removes the mapping from the specified key, if there was any.
|
int |
get(int key)
Gets the int mapped from the specified key, or
0
if no such mapping has been made. |
int |
get(int key,
int valueIfKeyNotFound)
Gets the int mapped from the specified key, or the specified value
if no such mapping has been made.
|
int |
indexOfKey(int 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(int 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. |
int |
keyAt(int index)
Given an index in the range
0...size()-1 , returns
the key from the index th key-value mapping that this
SparseIntArray stores. |
void |
put(int key,
int 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 |
removeAt(int index)
Removes the mapping at the given index.
|
int |
size()
Returns the number of key-value mappings that this SparseIntArray
currently stores.
|
int |
valueAt(int index)
Given an index in the range
0...size()-1 , returns
the value from the index th key-value mapping that this
SparseIntArray stores. |
public SparseIntArray()
public SparseIntArray(int initialCapacity)
public int get(int key)
0
if no such mapping has been made.public int get(int key, int valueIfKeyNotFound)
public void delete(int key)
public void removeAt(int index)
public void put(int key, int value)
public int size()
public int keyAt(int index)
0...size()-1
, returns
the key from the index
th key-value mapping that this
SparseIntArray stores.public int valueAt(int index)
0...size()-1
, returns
the value from the index
th key-value mapping that this
SparseIntArray stores.public int indexOfKey(int key)
keyAt(int)
would return the
specified key, or a negative number if the specified
key is not mapped.public int indexOfValue(int 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(int key, int value)