public boolean hasStringAt(final int pos) { return this.size() > pos && this.get(pos).isInput(); }
public boolean hasExpressionAt(final int pos) { return this.size() > pos && this.get(pos).isExpression(); }
private static Each composeEach(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;
private static AssignationSequence composeSequence( final ExpressionParsingState state, final int nodeIndex, final boolean allowParametersWithoutValue) { if (state == null || nodeIndex >= state.size()) { return null; final int startIndex = state.size() - inputParts.length; final int endIndex = state.size(); for (int i = startIndex; i < endIndex; i++) { final Assignation assignation =
static Assignation composeAssignation( final ExpressionParsingState state, final int nodeIndex, final boolean allowParametersWithoutValue) { if (state == null || nodeIndex >= state.size()) { return null;
private static ExpressionSequence composeSequence(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;
static Expression parseAndCompose(final ExpressionParsingState state, final String parseTarget) { /* * Takes a String (probably a substring of a parsing node), checks whether it is a reference to * another node or not and, if not, performs a composition operation on it. Then just composes * the target. */ int index = parseAsSimpleIndexPlaceholder(parseTarget); if (index == -1) { // parseTarget is not a mere index placeholder, so add it and compose it index = state.size(); state.addNode(parseTarget); } if (compose(state, index) == null || !state.hasExpressionAt(index)) { return null; } return state.get(index).getExpression(); }
static ExpressionParsingState compose(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;
public boolean hasStringAt(final int pos) { return this.size() > pos && this.get(pos).isInput(); }
public boolean hasExpressionAt(final int pos) { return this.size() > pos && this.get(pos).isExpression(); }
private static AssignationSequence composeSequence( final ExpressionParsingState state, final int nodeIndex, final boolean allowParametersWithoutValue) { if (state == null || nodeIndex >= state.size()) { return null; final int startIndex = state.size() - inputParts.length; final int endIndex = state.size(); for (int i = startIndex; i < endIndex; i++) { final Assignation assignation =
private static Each composeEach(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;
static Expression parseAndCompose(final ExpressionParsingState state, final String parseTarget) { /* * Takes a String (probably a substring of a parsing node), checks whether it is a reference to * another node or not and, if not, performs a composition operation on it. Then just composes * the target. */ int index = parseAsSimpleIndexPlaceholder(parseTarget); if (index == -1) { // parseTarget is not a mere index placeholder, so add it and compose it index = state.size(); state.addNode(parseTarget); } if (compose(state, index) == null || !state.hasExpressionAt(index)) { return null; } return state.get(index).getExpression(); }
static Assignation composeAssignation( final ExpressionParsingState state, final int nodeIndex, final boolean allowParametersWithoutValue) { if (state == null || nodeIndex >= state.size()) { return null;
private static ExpressionSequence composeSequence(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;
static ExpressionParsingState compose(final ExpressionParsingState state, final int nodeIndex) { if (state == null || nodeIndex >= state.size()) { return null;