Class Lucene91OnHeapHnswGraph
java.lang.Object
org.apache.lucene.util.hnsw.HnswGraph
org.apache.lucene.backward_codecs.lucene91.Lucene91OnHeapHnswGraph
An
HnswGraph
where all nodes and connections are held in memory. This class is used to
construct the HNSW graph before it's written to the index.-
Nested Class Summary
Nested classes/interfaces inherited from class org.apache.lucene.util.hnsw.HnswGraph
HnswGraph.ArrayNodesIterator, HnswGraph.CollectionNodesIterator, HnswGraph.NodesIterator
-
Field Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
addNode
(int level, int node) Add node on the given levelint
Returns the graph's current entry node on the top level shown as ordinals of the nodes on 0th levelgetNeighbors
(int level, int node) Returns theNeighborQueue
connected to the given node.getNodesOnLevel
(int level) int
int
Returns the current number of levels in the graphvoid
seek
(int level, int targetNode) int
size()
-
Method Details
-
getNeighbors
Returns theNeighborQueue
connected to the given node.- Parameters:
level
- level of the graphnode
- the node whose neighbors are returned, represented as an ordinal on the level 0.
-
size
public int size() -
addNode
public void addNode(int level, int node) Add node on the given level- Parameters:
level
- level to add a node onnode
- the node to add, represented as an ordinal on the level 0.
-
seek
public void seek(int level, int targetNode) -
nextNeighbor
public int nextNeighbor()- Specified by:
nextNeighbor
in classHnswGraph
-
numLevels
public int numLevels()Returns the current number of levels in the graph -
entryNode
public int entryNode()Returns the graph's current entry node on the top level shown as ordinals of the nodes on 0th level -
getNodesOnLevel
- Specified by:
getNodesOnLevel
in classHnswGraph
-