Lines Matching defs:hash
71 * list; the second entry is a pointer to the int[] hash code array for it.
83 private int indexOf(Object key, int hash) {
91 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
93 // If the hash code wasn't found, then we have no entry for this key.
105 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
110 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
116 // hash chain to reduce the number of array entries that will
131 // If the hash code wasn't found, then we have no entry for this key.
154 // hash chain to reduce the number of array entries that will
357 final int hash;
360 hash = 0;
363 hash = value.hashCode();
364 index = indexOf(value, hash);
399 mHashes[index] = hash;
413 final int hash = value == null ? 0 : value.hashCode();
417 if (index > 0 && mHashes[index - 1] > hash) {
421 System.err.println(TAG + " New hash " + hash
422 + " is before end of array hash " + mHashes[index - 1]
430 mHashes[index] = hash;
532 // pass, use the property that the sets are sorted by hash to make this linear passes
533 // (except for hash collisions, which means worst case still n*m), then do one