@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(actual); result = HASH_CODE_PRIME * result + hashCodeFor(expected); return result; }
@Override public int hashCode() { return HASH_CODE_PRIME * hashCodeFor(description); } }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { return HASH_CODE_PRIME + hashCodeFor(value) + hashCodeFor(args); }
@Override public int hashCode() { return HASH_CODE_PRIME * hashCodeFor(description); } }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(actual); result = HASH_CODE_PRIME * result + hashCodeFor(expected); return result; }
@Override public int hashCode() { return HASH_CODE_PRIME + hashCodeFor(value) + hashCodeFor(args); }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(key); result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(format); result = HASH_CODE_PRIME * result + Arrays.hashCode(arguments); return result; }
@Override protected Set<Object> newSetUsingComparisonStrategy() { // define a comparator so that we can use areEqual to compare objects in Set collections // the "less than" comparison does not make much sense here but need to be defined. return new TreeSet<>((o1, o2) -> { if (areEqual(o1, o2)) return 0; return Objects.hashCodeFor(o1) < Objects.hashCodeFor(o2) ? -1 : 1; }); }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(format); result = HASH_CODE_PRIME * result + Arrays.hashCode(arguments); return result; }
@Override protected Set<Object> newSetUsingComparisonStrategy() { // define a comparator so that we can use areEqual to compare objects in Set collections // the "less than" comparison does not make much sense here but need to be defined. return new TreeSet<>((o1, o2) -> { if (areEqual(o1, o2)) return 0; return Objects.hashCodeFor(o1) < Objects.hashCodeFor(o2) ? -1 : 1; }); }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(key); result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
/** * Returns the hash code of this attribute, based on its name and value. * * @return the hash code of this attribute. */ @Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(name); result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(attributes); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(key); result = HASH_CODE_PRIME * result + hashCodeFor(value); return result; }
@Override public int hashCode() { int result = 1; result = HASH_CODE_PRIME * result + hashCodeFor(format); result = HASH_CODE_PRIME * result + Arrays.hashCode(arguments); return result; }
@Override public int compare(Object o1, Object o2) { if (areEqual(o1, o2)) return 0; return Objects.hashCodeFor(o1) < Objects.hashCodeFor(o2) ? -1 : 1; } });