| testVisit_specifiedOrder() |  | 0% | | n/a | 1 | 1 | 39 | 39 | 1 | 1 |
| testVisit_earlyTerminationPermutations() | | 0% | | n/a | 1 | 1 | 39 | 39 | 1 | 1 |
| testExtract_leafNode() | | 0% | | n/a | 1 | 1 | 24 | 24 | 1 | 1 |
| testExtract_internalNode() | | 0% | | n/a | 1 | 1 | 19 | 19 | 1 | 1 |
| testHeight() | | 0% | | n/a | 1 | 1 | 25 | 25 | 1 | 1 |
| testFindNode_nodeCutBehavior() | | 0% | | n/a | 1 | 1 | 27 | 27 | 1 | 1 |
| testFindNode_minusCutBehavior() | | 0% | | n/a | 1 | 1 | 27 | 27 | 1 | 1 |
| testFindNode_plusCutBehavior() | | 0% | | n/a | 1 | 1 | 27 | 27 | 1 | 1 |
| testExtract_extractFromSameTree() | | 0% | | n/a | 1 | 1 | 19 | 19 | 1 | 1 |
| testTransform_multipleCuts() | | 0% | | n/a | 1 | 1 | 20 | 20 | 1 | 1 |
| testInsert_hyperplaneSubset_concaveRegion() | | 0% | | n/a | 1 | 1 | 23 | 23 | 1 | 1 |
| testInsert_convexList_concaveRegion() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testFindNode_emptyTree() | | 0% | | 0% | 5 | 5 | 16 | 16 | 1 | 1 |
| testFindNode_singleArg() | | 0% | | n/a | 1 | 1 | 26 | 26 | 1 | 1 |
| testNodeTrim() | | 0% | | n/a | 1 | 1 | 24 | 24 | 1 | 1 |
| testInsert_boundarySource() | | 0% | | n/a | 1 | 1 | 22 | 22 | 1 | 1 |
| testCount() | | 0% | | n/a | 1 | 1 | 20 | 20 | 1 | 1 |
| testSplitIntoTree() | | 0% | | n/a | 1 | 1 | 29 | 29 | 1 | 1 |
| testInsert_convex_split() | | 0% | | n/a | 1 | 1 | 23 | 23 | 1 | 1 |
| testNodesIterable_multipleNodes() | | 0% | | 0% | 2 | 2 | 21 | 21 | 1 | 1 |
| testSplitIntoTree_plusOnly() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testInsert_convexList_convexRegion() | | 0% | | n/a | 1 | 1 | 14 | 14 | 1 | 1 |
| testSplitIntoTree_minusOnly() | | 0% | | n/a | 1 | 1 | 19 | 19 | 1 | 1 |
| testTransform_xAxisReflection() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testTransform_yAxisReflection() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testTransform_xAndYAxisReflection() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testInsert_convex_noSplit() | | 0% | | n/a | 1 | 1 | 15 | 15 | 1 | 1 |
| testVisit_defaultOrder() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testTreeString_reachesMaxDepth() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testVisit_visitorReturnsNull_terminatesEarly() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testVisit_visitorReturnsTerminate_terminatesEarly() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testNodeStateGetters() | | 0% | | n/a | 1 | 1 | 18 | 18 | 1 | 1 |
| testInsertCut_createRegionWithThicknessOfHyperplane() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| testVisit_visitNode() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testSubtreeNodesIterable_multipleNodeSubtree() | | 0% | | 0% | 2 | 2 | 13 | 13 | 1 | 1 |
| testTreeString_zeroMaxDepth() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| assertNodesCopiedRecursive(TestBSPTree.TestNode, TestBSPTree.TestNode) | | 0% | | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| testTreeString() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testInsertCut_fitsCutterToCell() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testInsert_convex_emptyTree() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testVisit_nullVisitOrderSkipsSubtree() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testVisit_noneVisitOrderSkipsSubtree() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testTransform_singleCut() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testDepth_detachedNodes() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testDepth() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testSubtreeNodesIterable_singleNodeSubtree() | | 0% | | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| checkTransformedPointNodeMap(TestBSPTree, Transform, Map) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| testExtract_clearsExistingNodesInCallingTree() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testInsertCut_doesNotPassThroughCell_removesExistingChildren() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testInsertCut_cutExistsInTree_sameOrientation() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testInsertCut_cutExistsInTree_oppositeOrientation() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| createPointNodeMap(TestBSPTree, int, int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| testCopy_withCuts() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testTreeString_negativeMaxDepth() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testToString() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testClearCut_root_fullTree() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testExtract_singleNodeTree() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| testNodesIterable_emptyTree() | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| testCopy_changesToOneTreeDoNotAffectCopy() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testInsertCut() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| testInsertCut_doesNotPassThroughCell_intersects() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| testClearCut_cutDoesNotExist() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testClearCut_cutExists() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| testInsertCut_doesNotPassThroughCell_parallel() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testClearCut_root_emptyTree() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testInitialization() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testCopy_rootOnly() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testNodeToString() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| lambda$testInsert_boundarySource$0(TestLineSegment, TestLineSegment, TestLineSegment, TestLineSegment, TestLineSegment) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| testCopy_instancePassedAsArgument() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testTransform_singleNodeTree() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| testNodesIterable_iteratorThrowsNoSuchElementExceptionAtEnd() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testInsert_boundarySource_emptySource() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getLineSegments(TestBSPTree) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testTransform_multipleCuts$5(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| testTreeString_emptyTree() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lambda$testTransform_xAndYAxisReflection$8(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testTransform_singleCut$4(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testTransform_singleNodeTree$3(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testTransform_yAxisReflection$7(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testTransform_xAxisReflection$6(TestPoint2D) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testVisit_visitNode$2(List, TestBSPTree.TestNode) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testVisit_defaultOrder$1(List, TestBSPTree.TestNode) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$getLineSegments$9(TestBSPTree.TestNode) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| AbstractBSPTreeTest() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |