| testIntersections() |  | 0% | | n/a | 1 | 1 | 30 | 30 | 1 | 1 |
| testClassify() | | 0% | | 0% | 2 | 2 | 16 | 16 | 1 | 1 |
| testContains() | | 0% | | 0% | 2 | 2 | 16 | 16 | 1 | 1 |
| checkIntersections(Circle, Line, Vector2D[]) | | 0% | | 0% | 3 | 3 | 20 | 20 | 1 | 1 |
| testToTree_threeSegments() | | 0% | | n/a | 1 | 1 | 18 | 18 | 1 | 1 |
| testLinecast_segmentPointOnBoundary() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testToTree_fourSegments() | | 0% | | n/a | 1 | 1 | 15 | 15 | 1 | 1 |
| testLinecast() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| checkBasicApproximationProperties(Circle, RegionBSPTree2D) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| checkLinecast(Circle, LineConvexSubset, Vector2D[]) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| testHashCode() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| testEquals() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testLinecast_intersectionsNotInSegment() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testToTree_multipleApproximationSizes() | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| checkContains(Circle, boolean, Vector2D[]) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| testToTree_closeApproximation() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testFrom() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testFrom_illegalRadius() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| lambda$testProject$8(Circle, Vector2D, double, double) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| testGeometricProperties() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testProject_argumentEqualsCenter() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testToTree_invalidSegmentCount() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testProject() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| assertFiniteSegment(LineConvexSubset, Vector2D, Vector2D) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testToString() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testFrom_illegalCenter() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$static$0(LineConvexSubset, LineConvexSubset) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testFrom_illegalCenter$2() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalCenter$1() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalRadius$7(Precision.DoubleEquivalence) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalRadius$6() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalRadius$5() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalRadius$4() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testFrom_illegalRadius$3() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testToTree_invalidSegmentCount$10(Circle) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testToTree_invalidSegmentCount$9(Circle) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| CircleTest() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |