| split(Hyperplane, AbstractRegionBSPTree, AbstractRegionBSPTree) |  | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| classifyRecursive(AbstractRegionBSPTree.AbstractRegionNode, Point) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| getBoundarySize() | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| hasNodeWithLocationRecursive(AbstractRegionBSPTree.AbstractRegionNode, RegionLocation) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| complementRecursive(AbstractRegionBSPTree.AbstractRegionNode) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| createBoundaryList(Function) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| insert(Iterable, RegionCutRule) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| AbstractRegionBSPTree(boolean) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| complement(AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$getSubtreeInitializer$1(AbstractRegionBSPTree.AbstractRegionNode) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| classify(Point) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isFull() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| setFull() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| setEmpty() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getSubtreeInitializer(RegionCutRule) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| project(Point) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$getSubtreeInitializer$3(AbstractRegionBSPTree.AbstractRegionNode) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$getSubtreeInitializer$2(AbstractRegionBSPTree.AbstractRegionNode) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getRegionSizeProperties() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lambda$createBoundaryIterable$4(Function) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(BoundarySource, RegionCutRule) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| invalidate() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| union(AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| union(AbstractRegionBSPTree, AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| intersection(AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| intersection(AbstractRegionBSPTree, AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| difference(AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| difference(AbstractRegionBSPTree, AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| xor(AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| xor(AbstractRegionBSPTree, AbstractRegionBSPTree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| condense() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| insert(HyperplaneConvexSubset, RegionCutRule) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(HyperplaneSubset, RegionCutRule) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| complement() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(HyperplaneSubset) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(HyperplaneConvexSubset) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(Iterable) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| insert(BoundarySource) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| copyNodeProperties(AbstractRegionBSPTree.AbstractRegionNode, AbstractRegionBSPTree.AbstractRegionNode) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$insert$0(RegionCutRule, HyperplaneConvexSubset) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSize() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| boundaries() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| createBoundaryIterable(Function) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getBoundaries() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getCentroid() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |