| UnequalPredicateInfer.InferenceGraph(Set) |   | 98% | | 91% | 3 | 18 | 2 | 60 | 0 | 1 |
| connectInThisPath(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int, int) | | 95% | | 85% | 3 | 11 | 2 | 8 | 0 | 1 |
| getGraph() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| generatePredicates(UnequalPredicateInfer.InferenceGraph.Relation[][]) | | 98% | | 95% | 1 | 11 | 2 | 21 | 0 | 1 |
| hasIndexOrPartitionColumn(Expression, Expression) | | 96% | | 94% | 1 | 10 | 1 | 16 | 0 | 1 |
| getType(ComparisonPredicate) | | 88% | | 83% | 1 | 4 | 1 | 7 | 0 | 1 |
| chooseEqualPredicates(Set) | | 100% | | 94% | 2 | 18 | 0 | 39 | 0 | 1 |
| chooseInputPredicates(UnequalPredicateInfer.InferenceGraph.Relation[][]) | | 100% | | 100% | 0 | 10 | 0 | 28 | 0 | 1 |
| chooseUnequalPredicates(UnequalPredicateInfer.InferenceGraph.Relation[][], Set) | | 100% | | 100% | 0 | 13 | 0 | 21 | 0 | 1 |
| addCastLiteralGraphEdges(Set) | | 100% | | 100% | 0 | 10 | 0 | 19 | 0 | 1 |
| connect(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int, int) | | 100% | | 100% | 0 | 14 | 0 | 10 | 0 | 1 |
| isTableFilter(int, int) | | 100% | | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
| dfs(int, List, List) | | 100% | | 100% | 0 | 5 | 0 | 8 | 0 | 1 |
| topoSort() | | 100% | | 100% | 0 | 3 | 0 | 9 | 0 | 1 |
| expandGraph(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int) | | 100% | | 100% | 0 | 4 | 0 | 6 | 0 | 1 |
| isSyntheticGraphEdge(Expression, Expression, UnequalPredicateInfer.InferenceGraph.Relation) | | 100% | | 87% | 1 | 5 | 0 | 7 | 0 | 1 |
| deduce(UnequalPredicateInfer.InferenceGraph.Relation[][]) | | 100% | | 100% | 0 | 4 | 0 | 5 | 0 | 1 |
| addSyntheticGraphEdge(Expression, Expression, UnequalPredicateInfer.InferenceGraph.Relation, Set) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| removeExprEqualToConstant(List, Set) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| initGraph(UnequalPredicateInfer.InferenceGraph.Relation[][]) | | 100% | | 100% | 0 | 3 | 0 | 4 | 0 | 1 |
| isAllLiteral(int, int) | | 100% | | 100% | 0 | 3 | 0 | 3 | 0 | 1 |
| clear(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int, UnequalPredicateInfer.InferenceGraph.Relation) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| set(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int, UnequalPredicateInfer.InferenceGraph.Relation) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| normalizePredicate(ComparisonPredicate) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| checkDeducible(UnequalPredicateInfer.InferenceGraph.Relation[][], int, int, int, UnequalPredicateInfer.InferenceGraph.Relation) | | 100% | | 100% | 0 | 2 | 0 | 2 | 0 | 1 |
| validGraphExpression(Expression) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| normalize(ComparisonPredicate) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |