Modifier and Type | Field and Description |
---|---|
static Operator |
DoubleEvaluator.DIVIDE
The division operator.
|
static Operator |
DoubleEvaluator.EXPONENT
The exponentiation operator.
|
static Operator |
DoubleEvaluator.MINUS
The substraction operator.
|
static Operator |
DoubleEvaluator.MODULO
The modulo operator.
|
static Operator |
DoubleEvaluator.MULTIPLY
The multiplication operator.
|
static Operator |
DoubleEvaluator.NEGATE
The negate unary operator in the standard operator precedence.
|
static Operator |
DoubleEvaluator.NEGATE_HIGH
The negate unary operator in the Excel like operator precedence.
|
static Operator |
DoubleEvaluator.PLUS
The addition operator.
|
Modifier and Type | Method and Description |
---|---|
protected Operator |
AbstractEvaluator.guessOperator(Token previous,
List<Operator> candidates)
When a token can be more than one operator (homonym operators), this method guesses the right operator.
|
Modifier and Type | Method and Description |
---|---|
Collection<Operator> |
Parameters.getOperators()
Gets the supported operators.
|
Collection<Operator> |
AbstractEvaluator.getOperators()
Gets the operators supported by this evaluator.
|
Modifier and Type | Method and Description |
---|---|
void |
Parameters.add(Operator operator)
Adds an operator to the supported ones.
|
protected Double |
DoubleEvaluator.evaluate(Operator operator,
Iterator<Double> operands,
Object evaluationContext) |
protected T |
AbstractEvaluator.evaluate(Operator operator,
Iterator<T> operands,
Object evaluationContext)
Evaluates an operation.
|
Modifier and Type | Method and Description |
---|---|
void |
Parameters.addOperators(Collection<Operator> operators)
Adds operators to the supported ones.
|
protected Operator |
AbstractEvaluator.guessOperator(Token previous,
List<Operator> candidates)
When a token can be more than one operator (homonym operators), this method guesses the right operator.
|
protected void |
AbstractEvaluator.validateHomonyms(List<Operator> operators)
Validates that homonym operators are valid.
|
Copyright © 2014. All Rights Reserved.