Lines Matching refs:mKeys
45 mKeys = new int[initialCapacity];
63 int i = binarySearch(mKeys, 0, mSize, key);
76 int i = binarySearch(mKeys, 0, mSize, key);
109 int[] keys = mKeys;
137 int i = binarySearch(mKeys, 0, mSize, key);
145 mKeys[i] = key;
150 if (mGarbage && mSize >= mKeys.length) {
154 i = ~binarySearch(mKeys, 0, mSize, key);
157 if (mSize >= mKeys.length) {
163 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
164 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
167 mKeys = nkeys;
173 System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
177 mKeys[i] = key;
205 return mKeys[index];
244 return binarySearch(mKeys, 0, mSize, key);
287 if (mSize != 0 && key <= mKeys[mSize - 1]) {
292 if (mGarbage && mSize >= mKeys.length) {
297 if (pos >= mKeys.length) {
303 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
304 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
307 mKeys = nkeys;
311 mKeys[pos] = key;
338 if (mKeys[i] <= mKeys[i - 1]) {
340 Log.e("FAIL", j + ": " + mKeys[j] + " -> " + mValues[j]);
348 private int[] mKeys;
