Lines Matching defs:hash
26 * It keeps its mappings in an array data structure -- an integer array of hash
31 * a hash map).
69 * list; the second entry is a pointer to the int[] hash code array for it.
77 * Special hash array value that indicates the container is immutable.
86 int indexOf(Object key, int hash) {
94 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
96 // If the hash code wasn't found, then we have no entry for this key.
108 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
113 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
119 // hash chain to reduce the number of array entries that will
134 // If the hash code wasn't found, then we have no entry for this key.
157 // hash chain to reduce the number of array entries that will
419 final int hash;
422 hash = 0;
425 hash = key.hashCode();
426 index = indexOf(key, hash);
462 mHashes[index] = hash;
476 final int hash = key == null ? 0 : key.hashCode();
480 if (index > 0 && mHashes[index-1] > hash) {
483 Log.w(TAG, "New hash " + hash
484 + " is before end of array hash " + mHashes[index-1]
490 mHashes[index] = hash;