Package edu.uiuc.ncsa.qdl.expressions

Class ESN2

java.lang.Object

edu.uiuc.ncsa.qdl.expressions.ExpressionImpl

edu.uiuc.ncsa.qdl.expressions.ESN2

All Implemented Interfaces:

ExpressionNode, ExpressionInterface, HasResultInterface, Statement, Serializable

public class ESN2
extends ExpressionImpl

After a parser change to treat the dot as an operator, this was introduced. It mostly has replaced the older ExpressionStemNode, but not quite everywhere yet.

Created by Jeff Gaynor
on 6/12/21 at 6:42 AM

See Also:

Serialized Form

Field Summary

Fields inherited from class edu.uiuc.ncsa.qdl.expressions.ExpressionImpl

arguments, result, valence

Fields inherited from interface edu.uiuc.ncsa.qdl.statements.ExpressionInterface

ALL_INDICES_NODE, ALT_IF_NODE, ASSIGNMENT_NODE, CLOSED_SLICE_NODE, COMPARISON_DYAD_NODE, CONSTANT_NODE, DYAD_NODE, DYADIC_FUNCTION_REFERENCE_NODE, EXPRESSION_STEM_NODE, EXPRESSION_STEM2_NODE, FUNCTION_REFERENCE_NODE, LAMBDA_DEFINITION_NODE, LIST_NODE, MODULE_NODE, MONAD_NODE, NILAD_NODE, OPEN_SLICE_NODE, PARENTHESIZED_NODE, PARSE_EXPRESSION_BLOCK_NODE, PARSE_STATEMENT_BLOCK_NODE, POLYAD_NODE, QDL_NULL_NODE, SELECT_NODE, SET_NODE, STEM_ENTRY_NODE, STEM_EXTRACTION_NODE, STEM_NODE, UNKNOWN_NODE, VARIABLE_NODE

Constructor Summary

Constructors

Constructor	Description
ESN2()

Method Summary

Modifier and Type	Method	Description
Object	evaluate(State state)
protected Object	get(State state)
ExpressionInterface	getLeftArg()
int	getNodeType()	QDL is not strongly typed but Java is, so each node type should have a unique integer and conditionals should use that, not the instanceof operator.
ExpressionInterface	getRightArg()
ExpressionInterface	makeCopy()
protected void	newWhittle(IndexList indexList)	Turns on or off all machinery associated with the allowing .
boolean	remove(State state)
void	set(State state, Object newValue)
void	setLeftArg(ExpressionInterface swri)
void	setRightArg(ExpressionInterface swri)
protected void	whittleIndices(IndexList indexList)	Actual stem contract: Evaluates the indices from right to left and does the evaluations, When this is done, the index set is simply indices, ready fo set or get in the stem.

Methods inherited from class edu.uiuc.ncsa.qdl.expressions.ExpressionImpl

evalArg, evalLastArg, evaluatedArgs, getAlias, getArgAt, getArgCount, getArguments, getEvaluatedArgs, getLastArg, getOperatorType, getResult, getResultType, getSourceCode, getTokenPosition, hasAlias, hasEvaluatedArgs, hasTokenPosition, isEvaluated, isSizeQuery, setAlias, setArguments, setEvaluated, setEvaluatedArgs, setOperatorType, setResult, setResultType, setSizeQuery, setSourceCode, setTokenPosition, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

ESN2

public ESN2()

Method Detail

evaluate

public Object evaluate(State state)

makeCopy

public ExpressionInterface makeCopy()

getLeftArg

public ExpressionInterface getLeftArg()

setLeftArg

public void setLeftArg(ExpressionInterface swri)

setRightArg

public void setRightArg(ExpressionInterface swri)

getRightArg

public ExpressionInterface getRightArg()

get

protected Object get(State state)

whittleIndices

protected void whittleIndices(IndexList indexList)

Actual stem contract: Evaluates the indices from right to left and does the evaluations, When this is done, the index set is simply indices, ready fo set or get in the stem.

Parameters:

indexList -

newWhittle

protected void newWhittle(IndexList indexList)

Turns on or off all machinery associated with the allowing . to accept stem lists as multi indices.

remove

public boolean remove(State state)

set

public void set(State state,
                Object newValue)

getNodeType

public int getNodeType()

Description copied from interface: ExpressionInterface

QDL is not strongly typed but Java is, so each node type should have a unique integer and conditionals should use that, not the instanceof operator. This allows for efficient programming with switch statements rather than a bevy of conditionals (potentially each of which gets done even if the correct case has been handled).

Returns: