Lines Matching defs:hash
65 * list; the second entry is a pointer to the int[] hash code array for it.
78 private int indexOf(Object key, int hash) {
86 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
88 // If the hash code wasn't found, then we have no entry for this key.
100 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
105 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
111 // hash chain to reduce the number of array entries that will
126 // If the hash code wasn't found, then we have no entry for this key.
149 // hash chain to reduce the number of array entries that will
372 final int hash;
375 hash = 0;
378 hash = mIdentityHashCode ? System.identityHashCode(value) : value.hashCode();
379 index = indexOf(value, hash);
413 mHashes[index] = hash;
426 final int hash = value == null ? 0
431 if (index > 0 && mHashes[index - 1] > hash) {
436 Log.w(TAG, "New hash " + hash
437 + " is before end of array hash " + mHashes[index - 1]
444 mHashes[index] = hash;
546 // pass, use the property that the sets are sorted by hash to make this linear passes
547 // (except for hash collisions, which means worst case still n*m), then do one