| setSubtree(HyperplaneConvexSubset, AbstractBSPTree.AbstractNode, AbstractBSPTree.AbstractNode) |  | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| height() | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| count() | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| depth() | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| AbstractBSPTree.AbstractNode(AbstractBSPTree) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| checkValid() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| isPlus() | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| isMinus() | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| getCutHyperplane() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| accept(BSPTreeVisitor) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| isLeaf() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isInternal() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| trim(HyperplaneConvexSubset) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| makeRoot() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| nodeInvalidated() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$nodes$0() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getTree() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getParent() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getCut() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getPlus() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMinus() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |