| constructReplaceMap() |  | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toDigest() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| computeUnique(DataTrait.Builder) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| withChildrenAndTheirOutputs(List, List) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| computeUniform(DataTrait.Builder) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| computeEqualSet(DataTrait.Builder) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| computeFd(DataTrait.Builder) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| lambda$withGroupExpression$2(Optional) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$withNewOutputs$4(List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$withGroupExprLogicalPropChildren$3(Optional, Optional, List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$withChildren$0(List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| LogicalIntersect(SetOperation.Qualifier, List, List, Optional, Optional, List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$withChildrenAndTheirOutputs$1(List, List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| LogicalIntersect(SetOperation.Qualifier, List, List, List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| withGroupExprLogicalPropChildren(Optional, Optional, List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| withChildren(List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| withGroupExpression(Optional) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| withNewOutputs(List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| LogicalIntersect(SetOperation.Qualifier, List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| accept(PlanVisitor, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |