Lines Matching refs:mKeys
51 mKeys = new long[initialCapacity];
70 int i = binarySearch(mKeys, 0, mSize, key);
83 int i = binarySearch(mKeys, 0, mSize, key);
105 long[] keys = mKeys;
132 int i = binarySearch(mKeys, 0, mSize, key);
140 mKeys[i] = key;
145 if (mGarbage && mSize >= mKeys.length) {
149 i = ~binarySearch(mKeys, 0, mSize, key);
152 if (mSize >= mKeys.length) {
158 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
159 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
162 mKeys = nkeys;
168 System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
172 mKeys[i] = key;
200 return mKeys[index];
239 return binarySearch(mKeys, 0, mSize, key);
280 if (mSize != 0 && key <= mKeys[mSize - 1]) {
285 if (mGarbage && mSize >= mKeys.length) {
290 if (pos >= mKeys.length) {
296 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
297 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
300 mKeys = nkeys;
304 mKeys[pos] = key;
332 if (mKeys[i] <= mKeys[i - 1]) {
334 Log.e("FAIL", j + ": " + mKeys[j] + " -> " + mValues[j]);
342 private long[] mKeys;
