本文整理了Java中java.util.TreeMap.hashCode()
方法的一些代码示例,展示了TreeMap.hashCode()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TreeMap.hashCode()
方法的具体详情如下:
包路径:java.util.TreeMap
类名称:TreeMap
方法名:hashCode
暂无
代码示例来源:origin: hankcs/HanLP
/**
* 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;
}
代码示例来源:origin: apache/hive
@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;
}
代码示例来源:origin: goldmansachs/gs-collections
@Override
public int hashCode()
{
return this.treeMap.hashCode();
}
代码示例来源:origin: voldemort/voldemort
@Override
public int hashCode() {
return versionMap.hashCode();
}
代码示例来源:origin: eclipse/eclipse-collections
@Override
public int hashCode()
{
return this.treeMap.hashCode();
}
代码示例来源:origin: eclipse/eclipse-collections
@Override
public int hashCode()
{
return this.treeMap.hashCode();
}
代码示例来源:origin: syncany/syncany
@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;
}
代码示例来源:origin: protostuff/protostuff
+ ((sortedMap == null) ? 0 : sortedMap.hashCode());
result = prime * result
+ ((treeMap == null) ? 0 : treeMap.hashCode());
result = prime * result
+ ((weakHashMap == null) ? 0 : weakHashMap.hashCode());
代码示例来源:origin: protostuff/protostuff
result = prime * result + (int) (timestamp ^ (timestamp >>> 32));
result = prime * result
+ ((treeMap == null) ? 0 : treeMap.hashCode());
result = prime * result
+ ((weakHashMap == null) ? 0 : weakHashMap.hashCode());
代码示例来源:origin: org.apache.commons/commons-math
/** {@inheritDoc} */
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result +
((freqTable == null) ? 0 : freqTable.hashCode());
return result;
}
代码示例来源:origin: org.eclipse.collections/eclipse-collections
@Override
public int hashCode()
{
return this.treeMap.hashCode();
}
代码示例来源:origin: nikita36078/J2ME-Loader
/** {@inheritDoc} */
@Override
public int hashCode() {
return annotations.hashCode();
}
代码示例来源:origin: com.goldmansachs/gs-collections
@Override
public int hashCode()
{
return this.treeMap.hashCode();
}
代码示例来源:origin: com.google.android.tools/dx
/** {@inheritDoc} */
@Override
public int hashCode() {
return annotations.hashCode();
}
代码示例来源:origin: com.android.tools.build/builder
/** {@inheritDoc} */
@Override
public int hashCode() {
return annotations.hashCode();
}
代码示例来源:origin: com.netflix.sstableadaptor/sstable-adaptor-cassandra
@Override
public int hashCode()
{
return Objects.hashCode(bin.hashCode(), maxBinSize);
}
代码示例来源:origin: org.apache.cassandra/cassandra-all
@Override
public int hashCode()
{
return Objects.hashCode(bin.hashCode(), maxBinSize);
}
代码示例来源:origin: jsevellec/cassandra-unit
@Override
public int hashCode()
{
return Objects.hashCode(bin.hashCode(), maxBinSize);
}
代码示例来源:origin: nikita36078/J2ME-Loader
/** {@inheritDoc} */
public int hashCode() {
int hash = type.hashCode();
hash = (hash * 31) + elements.hashCode();
hash = (hash * 31) + visibility.hashCode();
return hash;
}
代码示例来源:origin: com.google.android.tools/dx
/** {@inheritDoc} */
public int hashCode() {
int hash = type.hashCode();
hash = (hash * 31) + elements.hashCode();
hash = (hash * 31) + visibility.hashCode();
return hash;
}
内容来源于网络,如有侵权,请联系作者删除!