Module org.apache.lucene.core
Package org.apache.lucene.util.hnsw
Class HnswConcurrentMergeBuilder.MergeSearcher
java.lang.Object
org.apache.lucene.util.hnsw.HnswGraphSearcher
org.apache.lucene.util.hnsw.HnswConcurrentMergeBuilder.MergeSearcher
- Enclosing class:
HnswConcurrentMergeBuilder
This searcher will obtain the lock and make a copy of neighborArray when seeking the graph such
that concurrent modification of the graph will not impact the search
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) intgraphNextNeighbor(HnswGraph graph) Get the next neighbor from the graph, you must callHnswGraphSearcher.graphSeek(HnswGraph, int, int)before calling this method.(package private) voidSeek a specific node in the given graph.Methods inherited from class org.apache.lucene.util.hnsw.HnswGraphSearcher
search, search, searchLevel, searchLevel
-
Field Details
-
nodeBuffer
private int[] nodeBuffer -
upto
private int upto -
size
private int size
-
-
Constructor Details
-
MergeSearcher
-
-
Method Details
-
graphSeek
Description copied from class:HnswGraphSearcherSeek a specific node in the given graph. The default implementation will just callHnswGraph.seek(int, int)- Overrides:
graphSeekin classHnswGraphSearcher
-
graphNextNeighbor
Description copied from class:HnswGraphSearcherGet the next neighbor from the graph, you must callHnswGraphSearcher.graphSeek(HnswGraph, int, int)before calling this method. The default implementation will just callHnswGraph.nextNeighbor()- Overrides:
graphNextNeighborin classHnswGraphSearcher- Returns:
- see
HnswGraph.nextNeighbor()
-