final int length = set1.length; final TObjectHashingStrategy hashingStrategy = _hashingStrategy; hash = hashingStrategy.computeHashCode(key1) & 0x7fffffff; hash ^= hashingStrategy.computeHashCode(key2) & 0x7fffffff; index = hash % length; cur1 = set1[index]; && (cur1 == REMOVED || !hashingStrategy.equals(cur1, key1))) || (cur2 != null && !hashingStrategy.equals(cur2, key2))) { long start = -1L; if (this.stats != null) { cur2 = set2[index]; } while ((cur1 != null && (cur1 == REMOVED || !hashingStrategy.equals(cur1, key1))) || (cur2 != null && !hashingStrategy.equals(cur2, key2))); if (this.stats != null) { this.stats.endQueryResultsHashCollisionProbe(start);
public final boolean execute(Object key) { h += _hashingStrategy.computeHashCode(key); return true; } }
public final boolean execute(Object key, Object value) { h += (_hashingStrategy.computeHashCode(key) ^ (value == null ? 0 : value.hashCode())); return true; } }
&& objectHasher.equals((o = values[index]), val) && duplicateObserver.eliminateDuplicate(val, o)) { return -index - 1; // already stored || !objectHasher.equals((o = values[index]), val) || !duplicateObserver.eliminateDuplicate(val, o))); && (states[index] == REMOVED || (set[index] != key || duplicateObserver == null || !objectHasher.equals((o = values[index]), val) || !duplicateObserver.eliminateDuplicate(val, o)))) { index -= probe;
length = set.length; hashingStrategy = _hashingStrategy; hash = hashingStrategy.computeHashCode(obj) & 0x7fffffff; index = hash % length; cur = set[index]; && (cur == REMOVED || ! hashingStrategy.equals(cur, obj))) { long start = -1L; if (this.stats != null) { && (cur == REMOVED || ! hashingStrategy.equals(cur, obj))); if (this.stats != null) { this.stats.endQueryResultsHashCollisionProbe(start);
static int computeHashCode(final Object o, final TObjectHashingStrategy hashingStrategy) { return hash(hashingStrategy.computeHashCode(o)) & 0x7fffffff; }
return index; // empty, all done else if (cur != REMOVED && hashingStrategy.equals(cur, key)) { return -index - 1; // already stored && !hashingStrategy.equals(cur, key)); int firstRemoved = index; while (cur != null && (cur == REMOVED || !hashingStrategy.equals(cur, key))) { index -= probe; if (index < 0) {
final int length = set1.length; final TObjectHashingStrategy hashingStrategy = _hashingStrategy; hash = hashingStrategy.computeHashCode(key1) & 0x7fffffff; hash ^= hashingStrategy.computeHashCode(key2) & 0x7fffffff; index = hash % length; cur1 = set1[index]; return index; // empty, all done else if (hashingStrategy.equals(cur1, key1) && hashingStrategy.equals(cur2, key2)) { return -index - 1; // already stored cur2 = set2[index]; } while ((cur1 != null && cur1 != REMOVED && !hashingStrategy.equals(cur1, key1)) || (cur2 != null && !hashingStrategy.equals(cur2, key2))); int firstRemoved = index; while ((cur1 != null && (cur1 == REMOVED || !hashingStrategy.equals(cur1, key1))) || (cur2 != null && !hashingStrategy.equals(cur2, key2))) { index -= probe; if (index < 0) {
int hash; while ((o = source.nextElement()) != null) { hash = hashingStrategy.computeHashCode(o); if (dupsMap.put(hash, o) != null) {
length = set.length; hashingStrategy = _hashingStrategy; hash = hashingStrategy.computeHashCode(obj) & 0x7fffffff; index = hash % length; cur = set[index]; } else if (cur != REMOVED && hashingStrategy.equals(cur, obj)) { return -index -1; // already stored } else { // already FULL or REMOVED, must probe } while (cur != null && cur != REMOVED && ! hashingStrategy.equals(cur, obj)); int firstRemoved = index; while (cur != null && (cur == REMOVED || ! hashingStrategy.equals(cur, obj))) { index -= probe; if (index < 0) {
itr = sources[i]; while ((o = itr.nextElement()) != null) { hash = hashingStrategy.computeHashCode(o); if (dupsMap.put(hash, o) != null) {
if (prev != null) { if (!hashingStrategy.equals(prev, v)) { prev = null; dups.remove(hashingStrategy.computeHashCode(v), v); dups.remove(hashingStrategy.computeHashCode(v), v);
dups.getDuplicateObserver(), this.hashingStrategy); if (dups.put((vh = this.hashingStrategy.computeHashCode(v)), v) != null) {