public class SparseIntArray extends Object implements Cloneable
Note that this container keeps its mappings in an array data structure, using a binary search to find keys. The implementation is not intended to be appropriate for data structures that may contain large numbers of items. It is generally slower than a traditional HashMap, since lookups require a binary search and adds and removes require inserting and deleting entries in the array. For containers holding up to hundreds of items, the performance difference is not significant, less than 50%.
It is possible to iterate over the items in this container using
keyAt(int)
and valueAt(int)
. Iterating over the keys using
keyAt(int)
with ascending values of the index will return the
keys in ascending order, or the values corresponding to the keys in ascending
order in the case of valueAt(int)
.
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.
|
SparseIntArray |
clone()
Creates and returns a copy of this object.
|
int[] |
copyKeys()
Provides a copy of keys.
|
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.
|
void |
setValueAt(int index,
int value)
Directly set the value at a particular index.
|
int |
size()
Returns the number of key-value mappings that this SparseIntArray
currently stores.
|
String |
toString()
Returns a string representation of the object.
|
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 SparseIntArray clone()
Object
x
, the expression:
will be true, and that the expression:x.clone() != x
will bex.clone().getClass() == x.getClass()
true
, but these are not absolute requirements.
While it is typically the case that:
will bex.clone().equals(x)
true
, this is not an absolute requirement.
By convention, the returned object should be obtained by calling
super.clone
. If a class and all of its superclasses (except
Object
) obey this convention, it will be the case that
x.clone().getClass() == x.getClass()
.
By convention, the object returned by this method should be independent
of this object (which is being cloned). To achieve this independence,
it may be necessary to modify one or more fields of the object returned
by super.clone
before returning it. Typically, this means
copying any mutable objects that comprise the internal "deep structure"
of the object being cloned and replacing the references to these
objects with references to the copies. If a class contains only
primitive fields or references to immutable objects, then it is usually
the case that no fields in the object returned by super.clone
need to be modified.
The method clone
for class Object
performs a
specific cloning operation. First, if the class of this object does
not implement the interface Cloneable
, then a
CloneNotSupportedException
is thrown. Note that all arrays
are considered to implement the interface Cloneable
and that
the return type of the clone
method of an array type T[]
is T[]
where T is any reference or primitive type.
Otherwise, this method creates a new instance of the class of this
object and initializes all its fields with exactly the contents of
the corresponding fields of this object, as if by assignment; the
contents of the fields are not themselves cloned. Thus, this method
performs a "shallow copy" of this object, not a "deep copy" operation.
The class Object
does not itself implement the interface
Cloneable
, so calling the clone
method on an object
whose class is Object
will result in throwing an
exception at run time.
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.
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.
public int valueAt(int index)
0...size()-1
, returns
the value from the index
th key-value mapping that this
SparseIntArray 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.
public void setValueAt(int index, int value)
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)
public int[] copyKeys()
public String toString()
toString
method returns a string that
"textually represents" this object. The result should
be a concise but informative representation that is easy for a
person to read.
It is recommended that all subclasses override this method.
The toString
method for class Object
returns a string consisting of the name of the class of which the
object is an instance, the at-sign character `@
', and
the unsigned hexadecimal representation of the hash code of the
object. In other words, this method returns a string equal to the
value of:
getClass().getName() + '@' + Integer.toHexString(hashCode())
This implementation composes a string by iterating over its mappings.