public class NoReorderEvaluationPlan extends Object implements IEvaluationPlan
Modifier and Type | Field and Description |
---|---|
protected IJoinNexus |
joinNexus |
protected int[] |
order |
protected long[] |
rangeCount |
protected IRule |
rule |
Constructor and Description |
---|
NoReorderEvaluationPlan(IJoinNexus joinNexus,
IRule rule) |
Modifier and Type | Method and Description |
---|---|
int[] |
getOrder()
Return the evaluation order.
|
boolean |
isEmpty()
true iff the IRule was proven to be empty based on
range counts or other data. |
long |
rangeCount(int tailIndex)
The range count for the predicate.
|
protected final IJoinNexus joinNexus
protected final IRule rule
protected final long[] rangeCount
protected final int[] order
public NoReorderEvaluationPlan(IJoinNexus joinNexus, IRule rule)
public int[] getOrder()
IEvaluationPlan
getOrder
in interface IEvaluationPlan
[2,0,1]
says that the predicates will
be evaluated in the order tail[2], then tail[0], then tail[1].public boolean isEmpty()
IEvaluationPlan
true
iff the IRule
was proven to be empty based on
range counts or other data.isEmpty
in interface IEvaluationPlan
public long rangeCount(int tailIndex)
IEvaluationPlan
rangeCount
in interface IEvaluationPlan
tailIndex
- The index of the predicate in the tail of the rule.IRangeCountFactory
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.