Uses of Interface
io.github.jbellis.jvector.util.Bits

Packages that use Bits

Package	Description
io.github.jbellis.jvector.disk
io.github.jbellis.jvector.graph
io.github.jbellis.jvector.util

Uses of Bits in io.github.jbellis.jvector.disk

Methods in io.github.jbellis.jvector.disk that return Bits

Modifier and Type	Method	Description
Bits	OnDiskGraphIndex.OnDiskView.liveNodes()

Uses of Bits in io.github.jbellis.jvector.graph

Methods in io.github.jbellis.jvector.graph that return Bits

Modifier and Type	Method	Description
Bits	GraphIndex.View.liveNodes()	Return a Bits instance indicating which nodes are live.

Methods in io.github.jbellis.jvector.graph with parameters of type Bits

Modifier and Type	Method	Description
boolean	ConcurrentNeighborSet.removeDeletedNeighbors(Bits deletedNodes)
void	NodeArray.retain(Bits selected)	Retains only the elements in the current NodeArray whose corresponding index is set in the given BitSet.
SearchResult	GraphSearcher.search(NodeSimilarity.ScoreFunction scoreFunction, NodeSimilarity.Reranker reranker, int topK, float threshold, float rerankFloor, Bits acceptOrds)
SearchResult	GraphSearcher.search(NodeSimilarity.ScoreFunction scoreFunction, NodeSimilarity.Reranker reranker, int topK, float threshold, Bits acceptOrds)
SearchResult	GraphSearcher.search(NodeSimilarity.ScoreFunction scoreFunction, NodeSimilarity.Reranker reranker, int topK, Bits acceptOrds)
static <T> SearchResult	GraphSearcher.search(T targetVector, int topK, RandomAccessVectorValues<T> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, GraphIndex<T> graph, Bits acceptOrds)	Convenience function for simple one-off searches.

Uses of Bits in io.github.jbellis.jvector.util

Classes in io.github.jbellis.jvector.util that implement Bits

Modifier and Type	Class	Description
class	AtomicFixedBitSet	A BitSet implementation that offers concurrent reads and writes through an AtomicLongArray as bit storage.
static class	Bits.MatchAllBits	Bits with all bits set.
static class	Bits.MatchNoBits	Bits with no bits set.
class	BitSet	Base implementation for a bit set.
final class	FixedBitSet	BitSet of fixed length (numBits), backed by accessible (FixedBitSet.getBits()) long[], accessed with an int index, implementing Bits.
class	GrowableBitSet	A BitSet implementation that grows as needed to accommodate set(index) calls.
class	SparseFixedBitSet	A bit set that only stores longs that have at least one bit which is set.
class	SynchronizedGrowableBitSet	A thread-safe BitSet implementation that grows as needed to accommodate set(index) calls.

Fields in io.github.jbellis.jvector.util declared as Bits

Modifier and Type	Field	Description
static final Bits	Bits.ALL
static final Bits	Bits.NONE

Methods in io.github.jbellis.jvector.util that return Bits

Modifier and Type	Method	Description
static Bits	Bits.intersectionOf(Bits a, Bits b)	Return a Bits that is set for a given ordinal iff both it is set in both `a` and `b`.
static Bits	Bits.inverseOf(Bits bits)	Returns a Bits that is true when `bits` is false, and false when `bits` is true

Methods in io.github.jbellis.jvector.util with parameters of type Bits

Modifier and Type	Method	Description
static FixedBitSet	FixedBitSet.copyOf(Bits bits)	Make a copy of the given bits.
static Bits	Bits.intersectionOf(Bits a, Bits b)	Return a Bits that is set for a given ordinal iff both it is set in both `a` and `b`.
static Bits	Bits.inverseOf(Bits bits)	Returns a Bits that is true when `bits` is false, and false when `bits` is true