本文整理了Java中org.apache.lucene.search.BooleanQuery.computeHashCode()
方法的一些代码示例,展示了BooleanQuery.computeHashCode()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。BooleanQuery.computeHashCode()
方法的具体详情如下:
包路径:org.apache.lucene.search.BooleanQuery
类名称:BooleanQuery
方法名:computeHashCode
暂无
代码示例来源:origin: org.apache.lucene/lucene-core
@Override
public int hashCode() {
// no need for synchronization, in the worst case we would just compute the hash several times.
if (hashCode == 0) {
hashCode = computeHashCode();
assert hashCode != 0;
}
assert hashCode == computeHashCode();
return hashCode;
}
代码示例来源:origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene
@Override
public int hashCode() {
// no need for synchronization, in the worst case we would just compute the hash several times.
if (hashCode == 0) {
hashCode = computeHashCode();
assert hashCode != 0;
}
assert hashCode == computeHashCode();
return hashCode;
}
代码示例来源:origin: org.infinispan/infinispan-embedded-query
@Override
public int hashCode() {
if (mutable) {
assert clauseSets == null;
return 31 * super.hashCode() + Objects.hash(disableCoord, minimumNumberShouldMatch, clauses);
}
if (hashCode == 0) {
// no need for synchronization, in the worst case we would just compute the hash several times
hashCode = computeHashCode();
assert hashCode != 0;
}
assert hashCode == computeHashCode();
return 31 * super.hashCode() + hashCode;
}
代码示例来源:origin: harbby/presto-connectors
@Override
public int hashCode() {
if (mutable) {
assert clauseSets == null;
return 31 * super.hashCode() + Objects.hash(disableCoord, minimumNumberShouldMatch, clauses);
}
if (hashCode == 0) {
// no need for synchronization, in the worst case we would just compute the hash several times
hashCode = computeHashCode();
assert hashCode != 0;
}
assert hashCode == computeHashCode();
return 31 * super.hashCode() + hashCode;
}
内容来源于网络,如有侵权,请联系作者删除!