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