/** * A NumberRange's hashCode is based on hashCode values of the discrete items it represents. * * @return the hashCode value */ @Override public int hashCode() { if (hashCodeCache == null) { hashCodeCache = super.hashCode(); } return hashCodeCache; }
@Override public int hashCode() { int result = Objects.hash( super.hashCode(), range, main, nodata, overflowFallback, last, hasGaps, name, unit); result = 31 * result + Arrays.hashCode(minimums); result = 31 * result + Arrays.hashCode(categories); return result; }
/** * Returns the hash code value for this Vector. */ public synchronized int hashCode() { return super.hashCode(); }
@Override public int hashCode() { // override hashCode so that lint tools don't complain return super.hashCode(); }
/** * Returns the hash code value for this Vector. */ public synchronized int hashCode() { return super.hashCode(); }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (list != null ? Arrays.hashCode(list) : 0); return result; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + Arrays.hashCode(elements); return result; }
@Override public int hashCode() { if (hash == 0) { final int prime = 31; int result = super.hashCode(); result = prime * result + ((list == null) ? 0 : list.hashCode()); hash = result; } return hash; }
@Override public int hashCode() { if (hash == 0) { final int prime = 31; int result = super.hashCode(); result = prime * result + ((list == null) ? 0 : list.hashCode()); hash = result; } return hash; }
@Override public int hashCode() { if (hash == 0) { final int prime = 31; int result = super.hashCode(); result = prime * result + ((list == null) ? 0 : list.hashCode()); hash = result; } return hash; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + totalPages; result = 31 * result + (int) (totalElements ^ (totalElements >>> 32)); result = 31 * result + numberOfElements; result = 31 * result + size; result = 31 * result + number; result = 31 * result + (content != null ? content.hashCode() : 0); return result; } }
@Override public int hashCode() { return Objects.hash(super.hashCode(), bakingList); } }
@Override public int hashCode() { if (hash == 0) { final int prime = 31; int result = super.hashCode(); result = prime * result + ((list == null) ? 0 : list.hashCode()); hash = result; } return hash; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + totalPages; result = 31 * result + (int) (totalElements ^ (totalElements >>> 32)); result = 31 * result + numberOfElements; result = 31 * result + size; result = 31 * result + number; result = 31 * result + (content != null ? content.hashCode() : 0); return result; } }
@Override public int hashCode() { return Objects.hash(super.hashCode(), backing); } }
@Override public int hashCode() { final int PRIME = 31; int result = super.hashCode(); result = PRIME * result + Arrays.hashCode(array); result = PRIME * result + ((crs == null) ? 0 : crs.hashCode()); result = PRIME * result + end; result = PRIME * result + start; return result; } @Override
/** * Same contract than {@link AbstractList}, just slightly more efficient for this particular class. */ @Override public int hashCode() { final V element = property.getValue(); final int hashCode = (element != null) ? 31 + element.hashCode() : 1; assert hashCode == super.hashCode() : hashCode; return hashCode; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + klabel.hashCode(); return result; }
/** * Same contract than {@link AbstractList}, just slightly more efficient for this particular class. */ @Override public int hashCode() { final V element = property.getValue(); final int hashCode = (element != null) ? 31 + element.hashCode() : 1; assert hashCode == super.hashCode() : hashCode; return hashCode; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (basicHeaderSegment != null ? basicHeaderSegment.hashCode() : 0); result = 31 * result + (additionalHeaderSegments != null ? additionalHeaderSegments.hashCode() : 0); result = 31 * result + (dataSegment != null ? dataSegment.hashCode() : 0); result = 31 * result + (headerDigest != null ? headerDigest.hashCode() : 0); result = 31 * result + (dataDigest != null ? dataDigest.hashCode() : 0); return result; }