Modifier and Type | Field and Description |
---|---|
(package private) java.util.List<QueryTree> |
children |
Modifier | Constructor and Description |
---|---|
private |
DisjunctionQueryTree(java.util.List<QueryTree> children) |
Modifier and Type | Method and Description |
---|---|
boolean |
advancePhase(double minWeight)
Find the next-most highly-weighted path below this node
|
void |
collectTerms(java.util.function.BiConsumer<java.lang.String,BytesRef> termCollector)
Collect terms from the most highly-weighted path below this node
|
java.lang.String |
toString(int depth)
Returns a string representation of the node
|
double |
weight()
The weight of this node
|
anyTerm, conjunction, conjunction, disjunction, disjunction, space, term, term, term, toString
final java.util.List<QueryTree> children
private DisjunctionQueryTree(java.util.List<QueryTree> children)
public double weight()
QueryTree
public void collectTerms(java.util.function.BiConsumer<java.lang.String,BytesRef> termCollector)
QueryTree
collectTerms
in class QueryTree
public boolean advancePhase(double minWeight)
QueryTree
advancePhase
in class QueryTree
minWeight
- do not advance if the next path has a weight below this valuefalse
if there are no more paths above the minimum weight