public class StateLogicalAndBooleanExpression6 extends StackState<com.querydsl.core.types.dsl.BooleanExpression,StackState<foundation.rpg.common.symbols.Or,StackState<com.querydsl.core.types.dsl.BooleanExpression,? extends State>>>
| Constructor and Description |
|---|
StateLogicalAndBooleanExpression6(QueryFactory factory,
com.querydsl.core.types.dsl.BooleanExpression node,
StackState<foundation.rpg.common.symbols.Or,StackState<com.querydsl.core.types.dsl.BooleanExpression,? extends State>> prev) |
| Modifier and Type | Method and Description |
|---|---|
List<Object> |
stack() |
State |
visitAnd(foundation.rpg.common.symbols.And symbol) |
State |
visitOr(foundation.rpg.common.symbols.Or symbol) |
State |
visitRPar(foundation.rpg.common.symbols.RPar symbol) |
getNode, getPrevgetFactory, visitAdditiveExpression, visitAtomicExpression, visitComma, visitCommaSeparatedListOfExpression, visitCommaSeparatedListOfObject, visitCommaSeparatedNonEmptyListOfExpression, visitCommaSeparatedNonEmptyListOfObject, visitDot, visitDouble, visitEnd, visitEqual, visitExclEqual, visitExpression, visitGt, visitGtEqual, visitIdentifier, visitIn, visitIs, visitLogicalAndBooleanExpression, visitLogicalOrBooleanExpression, visitLong, visitLPar, visitLt, visitLtEqual, visitMinus, visitMultiplicativeExpression, visitNot, visitNull, visitObject, visitPlus, visitPredicate, visitRelationalBooleanExpression, visitSl, visitStar, visitString, visitTilda, visitToken, visitUnaryExpression, visitWhiteSpacepublic StateLogicalAndBooleanExpression6(QueryFactory factory, com.querydsl.core.types.dsl.BooleanExpression node, StackState<foundation.rpg.common.symbols.Or,StackState<com.querydsl.core.types.dsl.BooleanExpression,? extends State>> prev)
public State visitRPar(foundation.rpg.common.symbols.RPar symbol) throws foundation.rpg.parser.UnexpectedInputException
public State visitOr(foundation.rpg.common.symbols.Or symbol) throws foundation.rpg.parser.UnexpectedInputException
public State visitAnd(foundation.rpg.common.symbols.And symbol)
Copyright © 2020. All rights reserved.