Lines Matching defs:mHashes
70 int[] mHashes;
94 int index = binarySearchHashes(mHashes, N, hash);
108 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
113 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
132 int index = binarySearchHashes(mHashes, N, 0);
146 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
151 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
170 mHashes = (int[])array[1];
173 if (DEBUG) Log.d(TAG, "Retrieving 2x cache " + mHashes
184 mHashes = (int[])array[1];
187 if (DEBUG) Log.d(TAG, "Retrieving 1x cache " + mHashes
194 mHashes = new int[size];
236 mHashes = ContainerHelpers.EMPTY_INTS;
246 mHashes = ContainerHelpers.EMPTY_INTS;
269 final int[] ohashes = mHashes;
272 mHashes = ContainerHelpers.EMPTY_INTS;
288 if (mHashes.length < minimumCapacity) {
289 final int[] ohashes = mHashes;
293 System.arraycopy(ohashes, 0, mHashes, 0, osize);
429 if (osize >= mHashes.length) {
433 if (DEBUG) Log.d(TAG, "put: grow from " + mHashes.length + " to " + n);
435 final int[] ohashes = mHashes;
443 if (mHashes.length > 0) {
445 System.arraycopy(ohashes, 0, mHashes, 0, ohashes.length);
455 System.arraycopy(mHashes, index, mHashes, index + 1, osize - index);
460 if (osize != mSize || index >= mHashes.length) {
465 mHashes[index] = hash;
481 System.arraycopy(array.mHashes, 0, mHashes, 0, N);
518 if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to 0");
519 freeArrays(mHashes, mArray, osize);
520 mHashes = ContainerHelpers.EMPTY_INTS;
525 if (mHashes.length > (BASE_SIZE*2) && mSize < mHashes.length/3) {
531 if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to " + n);
533 final int[] ohashes = mHashes;
543 System.arraycopy(ohashes, 0, mHashes, 0, index);
549 System.arraycopy(ohashes, index + 1, mHashes, index, nsize - index);
557 System.arraycopy(mHashes, index + 1, mHashes, index, nsize - index);
651 final int[] hashes = mHashes;