@Override public int hashCode() { return Arrays.deepHashCode(fields); }
/** * Create a new {@link SimpleKey} instance. * @param elements the elements of the key */ public SimpleKey(Object... elements) { Assert.notNull(elements, "Elements must not be null"); this.params = new Object[elements.length]; System.arraycopy(elements, 0, this.params, 0, elements.length); this.hashCode = Arrays.deepHashCode(this.params); }
/** * Get the hash code of this principal. * * @return the hash code of this principal */ public int hashCode() { return Arrays.deepHashCode(p); }
private int calculateHashCode( Object[] keyFields ) { // deep used because Binary type is a native byte[] return Arrays.deepHashCode( keyFields ); }
@Override public int hashCode(Object o) { Object[] oa = (Object[]) o; return Arrays.deepHashCode(oa); }
/** * {@inheritDoc} */ @Override public int hashCode() { return Arrays.deepHashCode(markerArray); }
private static <T> int listHashCode(List<T> alist) { if (alist == null) { return 1; } else { return Arrays.deepHashCode(alist.toArray()); } }
/** * Calculates a simple hashCode of all the native data objects in the supplied row. This method will return a better * distribution of values for rows of numbers or rows with the same values in different positions. NOTE: This method * performs against the native values, not the values returned by ValueMeta. This means that if you have two rows with * different primitive values ['2008-01-01:12:30'] and ['2008-01-01:00:00'] that use a format object to change the * value (as Date yyyy-MM-dd), the hashCodes will be different resulting in the two rows not being considered equal * via the hashCode even though compare() or equals() might consider them to be. * * @param rowData The data to calculate a hashCode with * @return the calculated hashCode * @throws KettleValueException in case there is a data conversion error */ @Override public int hashCode( Object[] rowData ) throws KettleValueException { return Arrays.deepHashCode( rowData ); }
@Override public int hashCode() { return Arrays.deepHashCode(data); }
/** * Create a new {@link SimpleKey} instance. * @param elements the elements of the key */ public SimpleKey(Object... elements) { Assert.notNull(elements, "Elements must not be null"); this.params = new Object[elements.length]; System.arraycopy(elements, 0, this.params, 0, elements.length); this.hashCode = Arrays.deepHashCode(this.params); }
@Override public int hashCode() { int hash = 5; hash = 29 * hash + Objects.hashCode(this.fullName); hash = 29 * hash + Arrays.deepHashCode(this.parameters); return hash; }
@Override public int hashCode() { if (value == null) { return 31; } if (value instanceof Object[]) { return 31 + Arrays.deepHashCode((Object[]) value); } return 31 + value.hashCode(); }
/** Implements {@link Annotation#hashCode}. */ private static int annotationHashCode( Class<? extends Annotation> type, Map<String, Object> members) throws Exception { int result = 0; for (Method method : type.getDeclaredMethods()) { String name = method.getName(); Object value = members.get(name); result += (127 * name.hashCode()) ^ (Arrays.deepHashCode(new Object[] {value}) - 31); } return result; }
/** * Returns the hash code for the given object. If the object is {@code null}, this method returns zero. Otherwise * calls the method {@code hashCode} of the given object. * * @param o the given object. * @return the hash code for the given object */ public static int hashCodeFor(Object o) { if (o == null) return 0; return isArray(o) && !o.getClass().getComponentType().isPrimitive() ? java.util.Arrays.deepHashCode((Object[]) o) : o.hashCode() ; }
@Override public int hashCode() { int result; long temp; result = depth; result = 31 * result + width; result = 31 * result + Arrays.deepHashCode(table); result = 31 * result + Arrays.hashCode(hashA); result = 31 * result + (int) (size ^ (size >>> 32)); temp = Double.doubleToLongBits(eps); result = 31 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(confidence); result = 31 * result + (int) (temp ^ (temp >>> 32)); return result; }
/** * Returns the hash code for the given object. If the object is {@code null}, this method returns zero. Otherwise * calls the method {@code hashCode} of the given object. * * @param o the given object. * @return the hash code for the given object */ public static int hashCodeFor(Object o) { if (o == null) return 0; return isArray(o) && !o.getClass().getComponentType().isPrimitive() ? java.util.Arrays.deepHashCode((Object[]) o) : o.hashCode() ; }
public int hashCode() { final int PRIME = 59; int result = 1; result = result * PRIME + java.util.Arrays.deepHashCode(this.getPaths()); return result; }
for (Object o : selectedFields) { if (o instanceof List) { out.putInt(Arrays.deepHashCode(((List) o).toArray())); } else if (o instanceof Object[]) { out.putInt(Arrays.deepHashCode((Object[]) o)); } else if (o instanceof byte[]) { out.putInt(Arrays.hashCode((byte[]) o));
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + Arrays.deepHashCode(axes); result = 31 * result + (addedEdges ? 1 : 0); result = 31 * result + (mMulTranspose != null ? mMulTranspose.hashCode() : 0); return result; }
@Override public int hashCode() { int hash = 5; hash = 73 * hash + (this.pos != null ? this.pos.hashCode() : 0); hash = 73 * hash + (this.norm != null ? this.norm.hashCode() : 0); hash = 73 * hash + (this.tang4d != null ? this.tang4d.hashCode() : 0); hash = 73 * hash + (this.tang != null ? this.tang.hashCode() : 0); hash = 73 * hash + (this.uv0 != null ? this.uv0.hashCode() : 0); hash = 73 * hash + (this.uv1 != null ? this.uv1.hashCode() : 0); hash = 73 * hash + (this.color != null ? this.color.hashCode() : 0); hash = 73 * hash + (this.material != null ? this.material.hashCode() : 0); hash = 73 * hash + (this.smoothing != null ? this.smoothing.hashCode() : 0); hash = 73 * hash + Arrays.deepHashCode(this.boneWeightsIndices); return hash; }