Lines Matching defs:mHashes

73     int[] mHashes;
86 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
100 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
105 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
124 int index = ContainerHelpers.binarySearch(mHashes, N, 0);
138 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
143 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
162 mHashes = (int[]) array[1];
166 Log.d(TAG, "Retrieving 2x cache " + mHashes + " now have "
187 mHashes = (int[]) array[1];
191 Log.d(TAG, "Retrieving 1x cache " + mHashes + " now have " + sBaseCacheSize
207 mHashes = new int[size];
266 mHashes = EmptyArray.INT;
298 freeArrays(mHashes, mArray, mSize);
299 mHashes = EmptyArray.INT;
310 if (mHashes.length < minimumCapacity) {
311 final int[] ohashes = mHashes;
315 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
386 if (mSize >= mHashes.length) {
390 if (DEBUG) Log.d(TAG, "add: grow from " + mHashes.length + " to " + n);
392 final int[] ohashes = mHashes;
396 if (mHashes.length > 0) {
398 System.arraycopy(ohashes, 0, mHashes, 0, ohashes.length);
409 System.arraycopy(mHashes, index, mHashes, index + 1, mSize - index);
413 mHashes[index] = hash;
428 if (index >= mHashes.length) {
431 if (index > 0 && mHashes[index - 1] > hash) {
437 + " is before end of array hash " + mHashes[index - 1]
444 mHashes[index] = hash;
457 System.arraycopy(array.mHashes, 0, mHashes, 0, N);
493 if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to 0");
494 freeArrays(mHashes, mArray, mSize);
495 mHashes = EmptyArray.INT;
499 if (mHashes.length > (BASE_SIZE * 2) && mSize < mHashes.length / 3) {
505 if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to " + n);
507 final int[] ohashes = mHashes;
514 System.arraycopy(ohashes, 0, mHashes, 0, index);
522 System.arraycopy(ohashes, index + 1, mHashes, index, mSize - index);
531 System.arraycopy(mHashes, index + 1, mHashes, index, mSize - index);
631 final int[] hashes = mHashes;