本文整理了Java中org.apache.lucene.util.BitSet.approximateCardinality()方法的一些代码示例，展示了BitSet.approximateCardinality()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。BitSet.approximateCardinality()方法的具体详情如下：
包路径：org.apache.lucene.util.BitSet
类名称：BitSet
方法名：approximateCardinality

BitSet.approximateCardinality介绍

[英]Return an approximation of the cardinality of this set. Some implementations may trade accuracy for speed if they have the ability to estimate the cardinality of the set without iterating over all the data. The default implementation returns #cardinality().
[中]返回此集合的基数的近似值。如果一些实现能够在不迭代所有数据的情况下估计集合的基数，那么它们可能会以精度换取速度。默认实现返回#cardinality（）。

代码示例

代码示例来源：origin: org.apache.lucene/lucene-core

/**
 * Same as {@link #BitDocIdSet(BitSet, long)} but uses the set's
 * {@link BitSet#approximateCardinality() approximate cardinality} as a cost.
 */
public BitDocIdSet(BitSet set) {
 this(set, set.approximateCardinality());
}

代码示例来源：origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

/**
 * Same as {@link #BitDocIdSet(BitSet, long)} but uses the set's
 * {@link BitSet#approximateCardinality() approximate cardinality} as a cost.
 */
public BitDocIdSet(BitSet set) {
 this(set, set.approximateCardinality());
}

代码示例来源：origin: harbby/presto-connectors

/**
 * Same as {@link #BitDocIdSet(BitSet, long)} but uses the set's
 * {@link BitSet#approximateCardinality() approximate cardinality} as a cost.
 */
public BitDocIdSet(BitSet set) {
 this(set, set.approximateCardinality());
}

代码示例来源：origin: org.infinispan/infinispan-embedded-query

/**
 * Same as {@link #BitDocIdSet(BitSet, long)} but uses the set's
 * {@link BitSet#approximateCardinality() approximate cardinality} as a cost.
 */
public BitDocIdSet(BitSet set) {
 this(set, set.approximateCardinality());
}