An "open" BitSet implementation that allows direct access to the array of words storing the bits.

Unlike java.util.bitset, the fact that bits are packed into an array of longs is part of the interface. This allows efficient implementation of other algorithms by someone other than the author. It also allows one to efficiently implement alternate serialization or interchange formats.

OpenBitSet

is faster than

java.util.BitSet

in most operations and *much* faster at calculating cardinality of sets and results of set operations. It can also handle sets of larger cardinality (up to 64 * 2**32-1)

The goals of

OpenBitSet

are the fastest implementation possible, and maximum code reuse. Extra safety and encapsulation may always be built on top, but if that's built in, the cost can never be removed (and hence people re-implement their own version in order to get better performance). If you want a "safe", totally encapsulated (and slower and limited) BitSet class, use

java.util.BitSet

.

Performance Results

For a list of all members of this type, see OpenBitSet Members.

System.Object
   Lucene.Net.Search.DocIdSet
      Lucene.Net.Util.OpenBitSet
         Lucene.Net.Util.OpenBitSetDISI

Thread Safety

Public static (Shared in Visual Basic) members of this type are safe for multithreaded operations. Instance members are not guaranteed to be thread-safe.

Requirements

Namespace: Lucene.Net.Util

Assembly: Lucene.Net (in Lucene.Net.dll)

See Also

OpenBitSet Members | Lucene.Net.Util Namespace

---