*
* @param key
* @oparam toAdd
+ * @return the new value of the count for the key
*/
- public void add(int key, int toAdd)
+ public int add(int key, int toAdd)
{
+ int newValue = toAdd;
int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
if (i >= 0)
{
mValues[i] += toAdd;
+ newValue = mValues[i];
}
else
{
int n = 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;
}
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);
}
mValues[i] = toAdd;
mSize++;
}
+ return newValue;
}
}