Uses of Class
org.apache.lucene.util.hnsw.NeighborQueue
Packages that use NeighborQueue
Package
Description
Lucene 9.0 file format.
Navigable Small-World graph, nominally Hierarchical but currently only has a single layer.
-
Uses of NeighborQueue in org.apache.lucene.backward_codecs.lucene90
Methods in org.apache.lucene.backward_codecs.lucene90 that return NeighborQueueModifier and TypeMethodDescriptionstatic NeighborQueueLucene90OnHeapHnswGraph.search(float[] query, int topK, int numSeed, RandomAccessVectorValues<float[]> vectors, VectorSimilarityFunction similarityFunction, HnswGraph graphValues, Bits acceptOrds, int visitedLimit, SplittableRandom random) Searches for the nearest neighbors of a query vector.Methods in org.apache.lucene.backward_codecs.lucene90 with parameters of type NeighborQueueModifier and TypeMethodDescriptionprivate voidLucene90HnswGraphBuilder.addDiverseNeighbors(int node, NeighborQueue candidates) private voidLucene90HnswGraphBuilder.popToScratch(NeighborQueue candidates) -
Uses of NeighborQueue in org.apache.lucene.util.hnsw
Fields in org.apache.lucene.util.hnsw declared as NeighborQueueModifier and TypeFieldDescriptionprivate final NeighborQueueHnswGraphSearcher.candidatesScratch data structures that are used in eachHnswGraphSearcher.searchLevel(T, int, int, int[], org.apache.lucene.util.hnsw.RandomAccessVectorValues<T>, org.apache.lucene.util.hnsw.HnswGraph)call.Methods in org.apache.lucene.util.hnsw that return NeighborQueueModifier and TypeMethodDescriptionstatic NeighborQueueHnswGraphSearcher.search(byte[] query, int topK, RandomAccessVectorValues<byte[]> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, HnswGraph graph, Bits acceptOrds, int visitedLimit) Searches HNSW graph for the nearest neighbors of a query vector.static NeighborQueueHnswGraphSearcher.search(float[] query, int topK, RandomAccessVectorValues<float[]> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, HnswGraph graph, Bits acceptOrds, int visitedLimit) Searches HNSW graph for the nearest neighbors of a query vector.HnswGraphSearcher.searchLevel(T query, int topK, int level, int[] eps, RandomAccessVectorValues<T> vectors, HnswGraph graph) Searches for the nearest neighbors of a query vector in a given level.private NeighborQueueHnswGraphSearcher.searchLevel(T query, int topK, int level, int[] eps, RandomAccessVectorValues<T> vectors, HnswGraph graph, Bits acceptOrds, int visitedLimit) Methods in org.apache.lucene.util.hnsw with parameters of type NeighborQueueModifier and TypeMethodDescriptionprivate voidHnswGraphBuilder.addDiverseNeighbors(int level, int node, NeighborQueue candidates) private voidHnswGraphBuilder.popToScratch(NeighborQueue candidates) Constructors in org.apache.lucene.util.hnsw with parameters of type NeighborQueueModifierConstructorDescriptionHnswGraphSearcher(VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, NeighborQueue candidates, BitSet visited) Creates a new graph searcher.