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