void |
HnswGraphBuilder.addGraphNode(int node,
RandomAccessVectorValues<T> values) |
|
OnHeapHnswGraph |
HnswGraphBuilder.build(RandomAccessVectorValues<T> vectorsToAdd) |
|
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(byte[] query,
int topK,
RandomAccessVectorValues<byte[]> vectors,
VectorEncoding vectorEncoding,
VectorSimilarityFunction similarityFunction,
OnHeapHnswGraph graph,
Bits acceptOrds,
int visitedLimit) |
|
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.
|
static NeighborQueue |
HnswGraphSearcher.search(float[] query,
int topK,
RandomAccessVectorValues<float[]> vectors,
VectorEncoding vectorEncoding,
VectorSimilarityFunction similarityFunction,
OnHeapHnswGraph graph,
Bits acceptOrds,
int visitedLimit) |
|
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.
|