Example usage for java.util Arrays deepHashCode

Introduction

In this page you can find the example usage for java.util Arrays deepHashCode.

Prototype

public static int deepHashCode(Object a[]) 

Source Link

Document

Returns a hash code based on the "deep contents" of the specified array.

Usage

From source file:org.protempa.valueset.ValueSetBuilder.java

@Override
public int hashCode() {
    int hash = 7;
    hash = 79 * hash + Objects.hashCode(this.id);
    hash = 79 * hash + Objects.hashCode(this.displayName);
    hash = 79 * hash + Arrays.deepHashCode(this.valueSetElementBuilders);
    hash = 79 * hash + Objects.hashCode(this.lowerBoundBuilder);
    hash = 79 * hash + Objects.hashCode(this.upperBoundBuilder);
    hash = 79 * hash + Objects.hashCode(this.sourceIdBuilder);
    hash = 79 * hash + Objects.hashCode(this.ordered);
    return hash;/* ww  w .j a v a2s.  com*/
}

---

From source file:com.hpcloud.mon.app.command.CreateMetricCommand.java

@Override
public int hashCode() {
    final int prime = 31;
    int result = 1;
    result = prime * result + ((dimensions == null) ? 0 : dimensions.hashCode());
    result = prime * result + ((name == null) ? 0 : name.hashCode());
    // Note Deep hash code is used here
    result = prime * result + Arrays.deepHashCode(timeValues);
    result = prime * result + (int) (timestamp ^ (timestamp >>> 32));
    long temp;//from  w  ww.j av a 2s. c  o  m
    temp = Double.doubleToLongBits(value);
    result = prime * result + (int) (temp ^ (temp >>> 32));
    return result;
}

---

From source file:io.fouad.jtb.core.beans.ReplyKeyboardMarkup.java

@Override
public int hashCode() {
    int result = Arrays.deepHashCode(keyboard);
    result = 31 * result + (resizeKeyboard != null ? resizeKeyboard.hashCode() : 0);
    result = 31 * result + (oneTimeKeyboard != null ? oneTimeKeyboard.hashCode() : 0);
    result = 31 * result + (selective != null ? selective.hashCode() : 0);
    return result;
}

---

From source file:com.opengamma.analytics.financial.model.volatility.smile.fitting.sabr.StandardSmileSurfaceDataBundle.java

@Override
public int hashCode() {
    final int prime = 31;
    int result = 1;
    result = prime * result + _forwardCurve.hashCode();
    result = prime * result + Arrays.deepHashCode(_impliedVols);

    result = prime * result + Arrays.deepHashCode(_strikes);
    result = prime * result + Arrays.hashCode(_expiries);
    return result;
}

---

From source file:it.restrung.rest.cache.RequestCache.java

/**
 * Calculates a cache key based on a array of params by performing a deep hashcode lookup
 *
 * @param params the params//from  www  . ja va  2s  .  c  om
 * @return the unique cache key
 */
public static int cacheKey(Object... params) {
    return Arrays.deepHashCode(params);
}

---

From source file:org.jasig.jpa.CacheKey.java

private int internalHashCode() {
    final int prime = 31;
    int result = 1;
    result = prime * result + Arrays.deepHashCode(key);
    result = prime * result + ((source == null) ? 0 : source.hashCode());
    return result;
}

---

From source file:com.softenido.cafedark.io.virtual.ZipVirtualFileSystem.java

@Override
public int hashCode() {
    return Arrays.deepHashCode(this.items);
}

---

From source file:org.wandora.utils.DataURL.java

@Override
public int hashCode() {
    if (data != null) {
        return Arrays.deepHashCode(new Object[] { data });
    } else {//from ww  w . j a  va  2  s .  c  o m
        return 0;
    }
}

---

From source file:org.apache.flink.api.java.typeutils.TupleTypeInfoBase.java

@Override
public int hashCode() {
    return this.types.hashCode() ^ Arrays.deepHashCode(this.types);
}

---

From source file:org.apache.lens.server.api.error.LensException.java

@Override
public int hashCode() {

    final int PRIME = 59;
    int result = 1;

    result = result * PRIME + errorInfo.hashCode();
    result = result * PRIME + (this.getMessage() == null ? 0 : this.getMessage().hashCode());
    result = result * PRIME + Arrays.deepHashCode(errorMsgFormattingArgs);
    return result;
}

---

• «
• 1
• 2
• 3
• »