accept(ParseTreeVisitor) |  | 0% |  | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
valueExpression(int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
expression(int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
AND() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
BETWEEN() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
LIKE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
REGEXP() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
RLIKE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_ANY() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_ALL() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_PHRASE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_PHRASE_PREFIX() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_REGEXP() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
MATCH_PHRASE_EDGE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
LEFT_PAREN() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
RIGHT_PAREN() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
IN() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
COMMA(int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
IS() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
NULL() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
TRUE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
FALSE() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
valueExpression() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
COMMA() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getRuleIndex() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
enterRule(ParseTreeListener) |  | 100% |   | 50% | 1 | 2 | 0 | 2 | 0 | 1 |
exitRule(ParseTreeListener) |  | 100% |   | 50% | 1 | 2 | 0 | 2 | 0 | 1 |
query() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
NOT() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
DorisParser.PredicateContext(ParserRuleContext, int) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
expression() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |