Uses of Interface
org.apache.lucene.util.hnsw.RandomAccessVectorValues
-
Packages that use RandomAccessVectorValues Package Description org.apache.lucene.util.hnsw Navigable Small-World graph, nominally Hierarchical but currently only has a single layer. -
-
Uses of RandomAccessVectorValues in org.apache.lucene.util.hnsw
Methods in org.apache.lucene.util.hnsw that return RandomAccessVectorValues Modifier and Type Method Description RandomAccessVectorValues<T>
RandomAccessVectorValues. copy()
Creates a new copy of thisRandomAccessVectorValues
.Methods in org.apache.lucene.util.hnsw with parameters of type RandomAccessVectorValues Modifier and Type Method Description void
HnswGraphBuilder. addGraphNode(int node, RandomAccessVectorValues<T> values)
OnHeapHnswGraph
HnswGraphBuilder. build(RandomAccessVectorValues<T> vectorsToAdd)
Reads all the vectors from two copies of aRandomAccessVectorValues
.static <T> HnswGraphBuilder<T>
HnswGraphBuilder. create(RandomAccessVectorValues<T> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, int M, int beamWidth, long seed)
static <T> HnswGraphBuilder<T>
HnswGraphBuilder. create(RandomAccessVectorValues<T> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, int M, int beamWidth, long seed, HnswGraph initializerGraph, Map<Integer,Integer> oldToNewOrdinalMap)
static NeighborQueue
HnswGraphSearcher. 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 NeighborQueue
HnswGraphSearcher. 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.NeighborQueue
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.
-