| static {...} |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| isValidToReorder(ConflictRulesMaker.ValEntry, LogicalJoin, LogicalJoin, ExpressionRewriteContext) | | 0% | | 0% | 29 | 29 | 63 | 63 | 1 | 1 |
| makeConflictRules(Edge, List, ExpressionRewriteContext) | | 0% | | 0% | 9 | 9 | 26 | 26 | 1 | 1 |
| simplifyConflictRules(long, List) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| isEvalToNullOrFalse(Set, Expression, ExpressionRewriteContext) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| generateAssocLeftTreeCR(Edge, List) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| generateAssocRightTreeCR(Edge, List) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| generateLAssocCR(Edge, List) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| generateRAssocCR(Edge, List) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| isAssocLeftTree(Edge, Edge, ExpressionRewriteContext) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| isAssocRightTree(Edge, Edge, ExpressionRewriteContext) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| isLAssoc(Edge, Edge, ExpressionRewriteContext) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| isRAssoc(Edge, Edge, ExpressionRewriteContext) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| subTreeEdge(Edge, List) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| subTreeEdges(BitSet, List) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getIndexForJoinType(JoinType) | | 0% | | 0% | 6 | 6 | 7 | 7 | 1 | 1 |
| lambda$subTreeEdges$3(List, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$simplifyConflictRules$0(long, Pair) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$subTreeEdge$2(BitSet, Edge) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$subTreeEdge$1(long, Edge) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |