Lines Matching defs:mKeys
60 mKeys = new int[initialCapacity];
78 int i = binarySearch(mKeys, 0, mSize, key);
91 int i = binarySearch(mKeys, 0, mSize, key);
113 int[] keys = mKeys;
141 int i = binarySearch(mKeys, 0, mSize, key);
149 mKeys[i] = key;
154 if (mGarbage && mSize >= mKeys.length) {
158 i = ~binarySearch(mKeys, 0, mSize, key);
161 if (mSize >= mKeys.length) {
162 int n = Math.max(mSize + 1, mKeys.length * 2);
167 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
168 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
171 mKeys = nkeys;
177 System.arraycopy(mKeys, i, mKeys, i + 1, mSize - i);
181 mKeys[i] = key;
209 return mKeys[index];
248 return binarySearch(mKeys, 0, mSize, key);
291 if (mSize != 0 && key <= mKeys[mSize - 1]) {
296 if (mGarbage && mSize >= mKeys.length) {
301 if (pos >= mKeys.length) {
302 int n = Math.max(pos + 1, mKeys.length * 2);
307 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
308 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
311 mKeys = nkeys;
315 mKeys[pos] = key;
326 if (mGarbage && mSize >= mKeys.length) {
330 if (mKeys.length < capacity) {
334 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
337 mKeys = nkeys;
370 private int[] mKeys;
