Lines Matching refs:mKeys
47 mKeys = new long[initialCapacity];
56 int length = mKeys.length;
58 System.arraycopy(mKeys, 0, result, 0, length);
87 int i = binarySearch(mKeys, 0, mSize, key);
100 int i = binarySearch(mKeys, 0, mSize, key);
122 long[] keys = mKeys;
150 int i = binarySearch(mKeys, 0, mSize, key);
158 mKeys[i] = key;
163 if (mGarbage && mSize >= mKeys.length) {
167 i = ~binarySearch(mKeys, 0, mSize, key);
170 if (mSize >= mKeys.length) {
176 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
177 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
180 mKeys = nkeys;
186 System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
190 mKeys[i] = key;
218 return mKeys[index];
257 return binarySearch(mKeys, 0, mSize, key);
300 if (mSize != 0 && key <= mKeys[mSize - 1]) {
305 if (mGarbage && mSize >= mKeys.length) {
310 if (pos >= mKeys.length) {
316 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
317 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
320 mKeys = nkeys;
324 mKeys[pos] = key;
351 if (mKeys[i] <= mKeys[i - 1]) {
353 Log.e("FAIL", j + ": " + mKeys[j] + " -> " + mValues[j]);
361 private long[] mKeys;
