lux.xpath
Class BinaryOperation
java.lang.Object
lux.xpath.AbstractExpression
lux.xpath.BinaryOperation
- All Implemented Interfaces:
- Visitable
public class BinaryOperation
- extends AbstractExpression
| Methods inherited from class lux.xpath.AbstractExpression |
acceptSubs, appendSub, getBindingContext, getLastContextStep, getRoot, getSubs, getSuper, getTail, getType, isAbsolute, replaceRoot, setSubs, toString |
BinaryOperation
public BinaryOperation(AbstractExpression op1,
BinaryOperation.Operator operator,
AbstractExpression op2)
toString
public void toString(StringBuilder buf)
- Description copied from class:
AbstractExpression
- Each subclass must implement the toString(StringBuilder) method by
rendering itself as a syntatically valid XPath/XQuery expression in
the given buffer.
- Specified by:
toString in class AbstractExpression
getOperand1
public AbstractExpression getOperand1()
getOperand2
public AbstractExpression getOperand2()
getOperator
public BinaryOperation.Operator getOperator()
accept
public AbstractExpression accept(ExpressionVisitor visitor)
isDocumentOrdered
public boolean isDocumentOrdered()
- Overrides:
isDocumentOrdered in class AbstractExpression
- Returns:
- whether this expression is proven to return results in document order. This method
returns true iff all its subs return true, or it has none. Warning: incorrect results may occur if
document-ordering is falsely asserted.
getPrecedence
public int getPrecedence()
- Specified by:
getPrecedence in class AbstractExpression
- Returns:
- a number indicating the *outer* precedence of this expression.
Expressions with lower precedence numbers have lower
precedence, ie bind more loosely, than expressions with higher
precedence. Expressions with no sub-expressions are assigned a high
precedence. Complex expressions can be seen as having an inner and an outer
precedence; for example function call expressions behave as a comma with regard
to their sub-expressions, the arguments, and like parentheses to their enclosing expression.
Copyright © 2013. All Rights Reserved.