FileDocCategorySizeDatePackage
SparseIntArray.javaAPI DocAndroid 1.5 API7188Wed May 06 22:41:56 BST 2009android.util

SparseIntArray

public class SparseIntArray extends Object
SparseIntArrays map integers to integers. Unlike a normal array of integers, there can be gaps in the indices. It is intended to be more efficient than using a HashMap to map Integers to Integers.

Fields Summary
private int[]
mKeys
private int[]
mValues
private int
mSize
Constructors Summary
public SparseIntArray()
Creates a new SparseIntArray containing no mappings.

        this(10);
public 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.

        initialCapacity = ArrayUtils.idealIntArraySize(initialCapacity);

        mKeys = new int[initialCapacity];
        mValues = new int[initialCapacity];
        mSize = 0;
Methods Summary
public voidappend(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.

        if (mSize != 0 && key <= mKeys[mSize - 1]) {
            put(key, value);
            return;
        }

        int pos = mSize;
        if (pos >= mKeys.length) {
            int n = ArrayUtils.idealIntArraySize(pos + 1);

            int[] nkeys = new int[n];
            int[] nvalues = new int[n];

            // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n);
            System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
            System.arraycopy(mValues, 0, nvalues, 0, mValues.length);

            mKeys = nkeys;
            mValues = nvalues;
        }

        mKeys[pos] = key;
        mValues[pos] = value;
        mSize = pos + 1;
private static intbinarySearch(int[] a, int start, int len, int key)

        int high = start + len, low = start - 1, guess;

        while (high - low > 1) {
            guess = (high + low) / 2;

            if (a[guess] < key)
                low = guess;
            else
                high = guess;
        }

        if (high == start + len)
            return ~(start + len);
        else if (a[high] == key)
            return high;
        else
            return ~high;
private voidcheckIntegrity()

        for (int i = 1; i < mSize; i++) {
            if (mKeys[i] <= mKeys[i - 1]) {
                for (int j = 0; j < mSize; j++) {
                    Log.e("FAIL", j + ": " + mKeys[j] + " -> " + mValues[j]);
                }

                throw new RuntimeException();
            }
        }
public voidclear()
Removes all key-value mappings from this SparseIntArray.

        mSize = 0;
public voiddelete(int key)
Removes the mapping from the specified key, if there was any.

        int i = binarySearch(mKeys, 0, mSize, key);

        if (i >= 0) {
            removeAt(i);
        }
public intget(int key)
Gets the int mapped from the specified key, or 0 if no such mapping has been made.

        return get(key, 0);
public intget(int key, int valueIfKeyNotFound)
Gets the int mapped from the specified key, or the specified value if no such mapping has been made.

        int i = binarySearch(mKeys, 0, mSize, key);

        if (i < 0) {
            return valueIfKeyNotFound;
        } else {
            return mValues[i];
        }
public intindexOfKey(int key)
Returns the index for which {@link #keyAt} would return the specified key, or a negative number if the specified key is not mapped.

        return binarySearch(mKeys, 0, mSize, key);
public intindexOfValue(int value)
Returns an index for which {@link #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.

        for (int i = 0; i < mSize; i++)
            if (mValues[i] == value)
                return i;

        return -1;
public intkeyAt(int index)
Given an index in the range 0...size()-1, returns the key from the indexth key-value mapping that this SparseIntArray stores.

        return mKeys[index];
public voidput(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.

        int i = binarySearch(mKeys, 0, mSize, key);

        if (i >= 0) {
            mValues[i] = value;
        } else {
            i = ~i;

            if (mSize >= mKeys.length) {
                int n = ArrayUtils.idealIntArraySize(mSize + 1);

                int[] nkeys = new int[n];
                int[] nvalues = new int[n];

                // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n);
                System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
                System.arraycopy(mValues, 0, nvalues, 0, mValues.length);

                mKeys = nkeys;
                mValues = nvalues;
            }

            if (mSize - i != 0) {
                // Log.e("SparseIntArray", "move " + (mSize - i));
                System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
                System.arraycopy(mValues, i, mValues, i + 1, mSize - i);
            }

            mKeys[i] = key;
            mValues[i] = value;
            mSize++;
        }
public voidremoveAt(int index)
Removes the mapping at the given index.

        System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
        System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
        mSize--;
public intsize()
Returns the number of key-value mappings that this SparseIntArray currently stores.

        return mSize;
public intvalueAt(int index)
Given an index in the range 0...size()-1, returns the value from the indexth key-value mapping that this SparseIntArray stores.

        return mValues[index];