Lines Matching refs:mKeys
42 mKeys = new int[initialCapacity];
60 int i = binarySearch(mKeys, 0, mSize, key);
73 int i = binarySearch(mKeys, 0, mSize, key);
84 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
95 int i = binarySearch(mKeys, 0, mSize, key);
102 if (mSize >= mKeys.length) {
108 // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n);
109 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
112 mKeys = nkeys;
118 System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
122 mKeys[i] = key;
142 return mKeys[index];
160 return binarySearch(mKeys, 0, mSize, key);
191 if (mSize != 0 && key <= mKeys[mSize - 1]) {
197 if (pos >= mKeys.length) {
203 // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n);
204 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
207 mKeys = nkeys;
211 mKeys[pos] = key;
238 if (mKeys[i] <= mKeys[i - 1]) {
240 Log.e("FAIL", j + ": " + mKeys[j] + " -> " + mValues[j]);
248 private int[] mKeys;
