Lines Matching defs:hash
29 * It keeps its mappings in an array data structure -- an integer array of hash
34 * a hash map).
76 * Special hash array value that indicates the container is immutable.
89 * list; the second entry is a pointer to the int[] hash code array for it.
102 private static int binarySearchHashes(int[] hashes, int N, int hash) {
104 return ContainerHelpers.binarySearch(hashes, N, hash);
114 int indexOf(Object key, int hash) {
122 int index = binarySearchHashes(mHashes, N, hash);
124 // If the hash code wasn't found, then we have no entry for this key.
136 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
141 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
147 // hash chain to reduce the number of array entries that will
162 // If the hash code wasn't found, then we have no entry for this key.
185 // hash chain to reduce the number of array entries that will
474 final int hash;
477 hash = 0;
480 hash = mIdentityHashCode ? System.identityHashCode(key) : key.hashCode();
481 index = indexOf(key, hash);
526 mHashes[index] = hash;
540 final int hash = key == null ? 0
545 if (index > 0 && mHashes[index-1] > hash) {
548 Log.w(TAG, "New hash " + hash
549 + " is before end of array hash " + mHashes[index-1]
555 mHashes[index] = hash;
578 int hash = mHashes[i];
579 if (hash != basehash) {
580 basehash = hash;
584 // We are in a run of entries with the same hash code. Go backwards through