本文整理汇总了Java中org.apache.lucene.util.OpenBitSet.andNotCount方法的典型用法代码示例。如果您正苦于以下问题：Java OpenBitSet.andNotCount方法的具体用法？Java OpenBitSet.andNotCount怎么用？Java OpenBitSet.andNotCount使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类org.apache.lucene.util.OpenBitSet的用法示例。
在下文中一共展示了OpenBitSet.andNotCount方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: checkOrderDependencyStrictlySmaller
import org.apache.lucene.util.OpenBitSet; //导入方法依赖的package包/类
public static boolean checkOrderDependencyStrictlySmaller(final SortedPartition A,
final SortedPartition B) {
final long overlapping =
OpenBitSet.andNotCount(A.getEquivalenceSetsBitRepresentation(),
B.getEquivalenceSetsBitRepresentation());
if (overlapping > 0) {
logger.trace("Returned checkOrderDependency early (bitset optimization): {} ~/~> {}", A, B);
return false;
}
long j = 0;
for (long i = 0; i < A.size(); i++) {
final LongOpenHashBigSet partitionA = A.get(i);
// try to match the current partition of A
// with partitions from B
long matchingBs = 0;
while (matchingBs < partitionA.size64()) {
final LongOpenHashBigSet partitionB = B.get(j);
// TODO: This should not be necessary anymore, because of bitset check above
if (partitionB.size64() > (A.get(i).size64() - matchingBs)) {
// the size of the current partition of B is greater than
// the size of non-matched row indices of current partition of A
return false;
}
for (final long rowIndexB : partitionB) {
if (!partitionA.contains(rowIndexB)) {
// row indices don't match: i-th smallest partition of A
return false;
}
matchingBs++;
}
j++;
}
}
return true;
}