@Override public int hashCode() { /* * The sum of the sums of the hash codes in each subset is just the sum of * each input element's hash code times the number of sets that element * appears in. Each element appears in exactly half of the 2^n sets, so: */ return inputSet.keySet().hashCode() << (inputSet.size() - 1); }
@Override public int hashCode() { int h = 1; h *= 1000003; h ^= this.canPossiblyBeStatic ? 1231 : 1237; h *= 1000003; h ^= this.methodsReferenced.hashCode(); return h; }
@Override public int hashCode() { int h = 1; h *= 1000003; h ^= this.typeName.hashCode(); h *= 1000003; h ^= this.internalContainerOf.hashCode(); return h; }
@Override public int hashCode() { /* * The sum of the sums of the hash codes in each subset is just the sum of * each input element's hash code times the number of sets that element * appears in. Each element appears in exactly half of the 2^n sets, so: */ return inputSet.keySet().hashCode() << (inputSet.size() - 1); }
@Override public int hashCode() { int result = segment.hashCode(); result = 31 * result + servers.hashCode(); return result; }
@Override public int hashCode() { int h = 1; h *= 1000003; h ^= this.unsupportedClasses.hashCode(); h *= 1000003; h ^= this.unsupportedMembersByClass.hashCode(); return h; }
@Override public int hashCode() { int h = 1; h *= 1000003; h ^= this.importedName.hashCode(); h *= 1000003; h ^= this.canonicalName.hashCode(); h *= 1000003; h ^= this.simpleName.hashCode(); h *= 1000003; h ^= this.members.hashCode(); return h; }
@Override public int hashCode() { int result = worker.hashCode(); result = 31 * result + currCapacityUsed; result = 31 * result + availabilityGroups.hashCode(); result = 31 * result + runningTasks.hashCode(); result = 31 * result + lastCompletedTaskTime.hashCode(); result = 31 * result + (blacklistedUntil != null ? blacklistedUntil.hashCode() : 0); return result; }
@Override public int hashCode() { /* * The sum of the sums of the hash codes in each subset is just the sum of * each input element's hash code times the number of sets that element * appears in. Each element appears in exactly half of the 2^n sets, so: */ return inputSet.keySet().hashCode() << (inputSet.size() - 1); }
@Override public boolean equals(@Nullable Object object) { if (object == this) { return true; } else if (object instanceof ImmutableSet && isHashCodeFast() && ((ImmutableSet<?>) object).isHashCodeFast() && hashCode() != object.hashCode()) { return false; } return Sets.equalsImpl(this, object); }
@Override public boolean equals(@NullableDecl Object object) { if (object == this) { return true; } else if (object instanceof ImmutableSet && isHashCodeFast() && ((ImmutableSet<?>) object).isHashCodeFast() && hashCode() != object.hashCode()) { return false; } return Sets.equalsImpl(this, object); }
h ^= (portSpecs == null) ? 0 : this.portSpecs.hashCode(); h *= 1000003; h ^= (exposedPorts == null) ? 0 : this.exposedPorts.hashCode(); h *= 1000003; h ^= (tty == null) ? 0 : this.tty.hashCode(); h ^= (image == null) ? 0 : this.image.hashCode(); h *= 1000003; h ^= (volumes == null) ? 0 : this.volumes.hashCode(); h *= 1000003; h ^= (workingDir == null) ? 0 : this.workingDir.hashCode();
public final void testConsistentHashCode() { for (ImmutableTable<Character, Integer, String> testInstance : getTestInstances()) { assertEquals(testInstance.cellSet().hashCode(), testInstance.hashCode()); } } }
/** * Computes a hash code from attributes: {@code name}, {@code permissions}, {@code central}, {@code simplePermissions}, {@code version}. * @return hashCode value */ @Override public int hashCode() { int h = 5381; h += (h << 5) + name.hashCode(); h += (h << 5) + permissions.hashCode(); h += (h << 5) + Booleans.hashCode(central); h += (h << 5) + simplePermissions.hashCode(); h += (h << 5) + version.hashCode(); return h; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((valueType == null) ? 0 : valueType.hashCode()); result = prime * result + ((values == null) ? 0 : values.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + (namedColumns == null ? 0 : namedColumns.hashCode()); result = prime * result + (dynamicColumn == null ? 0 : dynamicColumn.hashCode()); return result; }
/** * Computes a hash code from attributes: {@code username}, {@code passwordHash}, {@code ldap}, {@code roles}, {@code version}. * @return hashCode value */ @Override public int hashCode() { int h = 5381; h += (h << 5) + username.hashCode(); h += (h << 5) + passwordHash.hashCode(); h += (h << 5) + Booleans.hashCode(ldap); h += (h << 5) + roles.hashCode(); h += (h << 5) + version.hashCode(); return h; }
/** * Computes a hash code from attributes: {@code name}, {@code descriptor}, {@code annotationTypes}, {@code parameterAnnotationTypes}, {@code toAsmMethod}. * @return hashCode value */ @Override public int hashCode() { @Var int h = 5381; h += (h << 5) + name.hashCode(); h += (h << 5) + descriptor.hashCode(); h += (h << 5) + annotationTypes.hashCode(); h += (h << 5) + parameterAnnotationTypes.hashCode(); h += (h << 5) + toAsmMethod.hashCode(); return h; }
/** * Computes a hash code from attributes: {@code methodName}, {@code methodReturnType}, {@code methodParameterTypes}, {@code uniqueNum}, {@code methodMetaTypes}. * @return hashCode value */ @Override public int hashCode() { @Var int h = 5381; h += (h << 5) + methodName.hashCode(); h += (h << 5) + methodReturnType.hashCode(); h += (h << 5) + methodParameterTypes.hashCode(); h += (h << 5) + uniqueNum; h += (h << 5) + methodMetaTypes.hashCode(); return h; }