| testXor_simpleCrossingCuts() |  | 0% | | n/a | 1 | 1 | 41 | 41 | 1 | 1 |
| testIntersection_simpleCrossingCuts() | | 0% | | n/a | 1 | 1 | 35 | 35 | 1 | 1 |
| testDifference_simpleCrossingCuts() | | 0% | | n/a | 1 | 1 | 35 | 35 | 1 | 1 |
| testXor_boxTreeWithSingleCutTree() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testDifference_boxTreeWithSingleCutTree() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testUnion_simpleCrossingCuts() | | 0% | | n/a | 1 | 1 | 29 | 29 | 1 | 1 |
| testIntersection_boxTreeWithSingleCutTree() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| insertSkewedBowtie(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testUnion_boxTreeWithSingleCutTree() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testUnion_mixedCutRules() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| insertBox(TestRegionBSPTree, TestPoint2D, TestPoint2D) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testUnion_singleNodeTrees() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testIntersection_singleNodeTrees() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testDifference_singleNodeTrees() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testXor_singleNodeTrees() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| lambda$testXor_simpleCrossingCuts$17(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| lambda$testUnion_mixedCutRules$1() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testUnion_mixedCutRules$3(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testXor_boxTreeWithSingleCutTree$19() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testDifference_boxTreeWithSingleCutTree$15() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testIntersection_boxTreeWithSingleCutTree$10() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testUnion_boxTreeWithSingleCutTree$5() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testDifference_simpleCrossingCuts$13(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testIntersection_simpleCrossingCuts$8(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testUnion_simpleCrossingCuts$0(TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testUnion_treeWithComplement() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testIntersection_treeWithComplement() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testXor_treeWithComplement() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testDifference_treeWithCopy() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| unionChecker(Supplier, Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| intersectionChecker(Supplier, Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| differenceChecker(Supplier, Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| xorChecker(Supplier, Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testXor_boxTreeWithSingleCutTree$18() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testDifference_boxTreeWithSingleCutTree$14() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testIntersection_boxTreeWithSingleCutTree$9() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testUnion_boxTreeWithSingleCutTree$4() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testUnion_mixedCutRules$2() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| xAxisTree() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| yAxisTree() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$xorChecker$28(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$differenceChecker$26(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$intersectionChecker$24(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$unionChecker$22(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testXor_treeWithComplement$21(Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testIntersection_treeWithComplement$12(Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testUnion_treeWithComplement$7(Supplier) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testXor_treeWithComplement$20() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testDifference_treeWithCopy$16() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testIntersection_treeWithComplement$11() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testUnion_treeWithComplement$6() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| emptyTree() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| fullTree() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$xorChecker$29(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$differenceChecker$27(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$intersectionChecker$25(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$unionChecker$23(TestRegionBSPTree, TestRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| AbstractRegionBSPTreeBooleanTest() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |