splitInternalNode(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset) |  | 100% |  | 100% | 0 | 8 | 0 | 43 | 0 | 1 |
acceptRecursive(AbstractBSPTree.AbstractNode, BSPTreeVisitor) |  | 100% |   | 87% | 6 | 27 | 0 | 24 | 0 | 1 |
findNode(AbstractBSPTree.AbstractNode, Point, BSPTree.FindNodeCutRule) |  | 100% |  | 100% | 0 | 11 | 0 | 11 | 0 | 1 |
insertRecursive(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset, HyperplaneConvexSubset, AbstractBSPTree.SubtreeInitializer) |  | 100% |   | 90% | 1 | 6 | 0 | 12 | 0 | 1 |
trimToNode(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset) |  | 100% |  | 100% | 0 | 6 | 0 | 13 | 0 | 1 |
extractParentPath(AbstractBSPTree.AbstractNode, AbstractBSPTree.AbstractNode) |  | 100% |  | 100% | 0 | 3 | 0 | 16 | 0 | 1 |
copySubtree(AbstractBSPTree.AbstractNode, AbstractBSPTree.AbstractNode) |  | 100% |  | 100% | 0 | 3 | 0 | 12 | 0 | 1 |
transformRecursive(AbstractBSPTree.AbstractNode, Transform, boolean) |  | 100% |  | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
splitIntoTrees(Hyperplane, AbstractBSPTree, AbstractBSPTree) |  | 100% |  | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
cutNode(AbstractBSPTree.AbstractNode, Hyperplane, AbstractBSPTree.SubtreeInitializer) |  | 100% |   | 75% | 1 | 3 | 0 | 6 | 0 | 1 |
toString() |  | 100% | | n/a | 0 | 1 | 0 | 8 | 0 | 1 |
removeNodeCut(AbstractBSPTree.AbstractNode) |  | 100% |  | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
splitLeafNode(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
extract(AbstractBSPTree.AbstractNode) |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
transform(Transform) |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
setNodeCut(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset, AbstractBSPTree.SubtreeInitializer) |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
splitSubtree(AbstractBSPTree.AbstractNode, HyperplaneConvexSubset) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
importSubtree(AbstractBSPTree.AbstractNode) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
treeString(int) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
getRoot() |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
insert(HyperplaneConvexSubset, AbstractBSPTree.SubtreeInitializer) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
setRoot(AbstractBSPTree.AbstractNode) |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
copy(BSPTree) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
copyNode(AbstractBSPTree.AbstractNode) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
invalidate() |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
findNode(Point, BSPTree.FindNodeCutRule) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
shouldContinueVisit(BSPTreeVisitor.Result) |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
swapsInsideOutside(Transform) |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
accept(BSPTreeVisitor) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
accept(AbstractBSPTree.AbstractNode, BSPTreeVisitor) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
lambda$nodes$0() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
count() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
height() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
treeString() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
AbstractBSPTree() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
nodes() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
getVersion() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |