/** * Hashes this node using its accept state status and set of outgoing _transition paths. * This is an expensive operation, so the result is cached and only cleared when necessary. * @return an int of this node's hash code */ @Override public int hashCode() { if(storedHashCode == null) { int hash = 7; hash = 53 * hash + (this.isAcceptNode ? 1 : 0); hash = 53 * hash + (this.outgoingTransitionTreeMap != null ? this.outgoingTransitionTreeMap.hashCode() : 0); //recursively hashes the nodes in all the //_transition paths stemming from this node storedHashCode = hash; return hash; } else return storedHashCode; }
@Override public int hashCode() { int hashcode = 0; hashcode += 31 * p; hashcode += 31 * pPrime; hashcode += 31 * qPrime; for (int i = 0; i < tempListIdx; i++) { hashcode += 31 * tempList[tempListIdx]; } hashcode += sparseMap.hashCode(); return hashcode; }
@Override public int hashCode() { return this.treeMap.hashCode(); }
@Override public int hashCode() { return versionMap.hashCode(); }
@Override public int hashCode() { return this.treeMap.hashCode(); }
@Override public int hashCode() { return this.treeMap.hashCode(); }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((fileHistoryId == null) ? 0 : fileHistoryId.hashCode()); result = prime * result + ((versions == null) ? 0 : versions.hashCode()); return result; }
+ ((sortedMap == null) ? 0 : sortedMap.hashCode()); result = prime * result + ((treeMap == null) ? 0 : treeMap.hashCode()); result = prime * result + ((weakHashMap == null) ? 0 : weakHashMap.hashCode());
result = prime * result + (int) (timestamp ^ (timestamp >>> 32)); result = prime * result + ((treeMap == null) ? 0 : treeMap.hashCode()); result = prime * result + ((weakHashMap == null) ? 0 : weakHashMap.hashCode());
/** {@inheritDoc} */ @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((freqTable == null) ? 0 : freqTable.hashCode()); return result; }
@Override public int hashCode() { return this.treeMap.hashCode(); }
/** {@inheritDoc} */ @Override public int hashCode() { return annotations.hashCode(); }
@Override public int hashCode() { return this.treeMap.hashCode(); }
/** {@inheritDoc} */ @Override public int hashCode() { return annotations.hashCode(); }
/** {@inheritDoc} */ @Override public int hashCode() { return annotations.hashCode(); }
@Override public int hashCode() { return Objects.hashCode(bin.hashCode(), maxBinSize); }
@Override public int hashCode() { return Objects.hashCode(bin.hashCode(), maxBinSize); }
@Override public int hashCode() { return Objects.hashCode(bin.hashCode(), maxBinSize); }
/** {@inheritDoc} */ public int hashCode() { int hash = type.hashCode(); hash = (hash * 31) + elements.hashCode(); hash = (hash * 31) + visibility.hashCode(); return hash; }
/** {@inheritDoc} */ public int hashCode() { int hash = type.hashCode(); hash = (hash * 31) + elements.hashCode(); hash = (hash * 31) + visibility.hashCode(); return hash; }