- <init>
- countNodeEqualToTop
Perform a traversal of the heap binary tree using recursion. Given a node, visit
its children and ch
- countPositionEqualToTop
Perform a traversal of the heap binary tree using recursion. Given a node, visit
its children and ch
- getHeapArray
- nextNodeAndAdjust
Move all the least spans in the queue that are positioned on the document and
node to their next nod
- nextPositionAndAdjust
Move all the least spans in the queue that are positioned on the same document,
node and position to
- nodeEqual
- pop
- positionEqual
- scoreInNode
- size
- sumScoreInNode
Perform a traversal of the heap binary tree using recursion. Given a node, visit
its children and ch