| classifyResultant(int, Polygon) |  | 0% | | 0% | 7 | 7 | 21 | 21 | 1 | 1 |
| node(Geometry[], double) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| CoverageCleaner(Geometry[]) | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| mergeStrategy(int) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| computeResultants(double) | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| mergeOverlaps(HashMap) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| extent(Geometry[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| createCoverageIndex() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setOverlapMergeStrategy(int) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| toPolygonArray(Geometry) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| clean(Geometry[], double, int, double) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| classifyResult(Polygon[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| clean(Geometry[], double, double) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| clean() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| isMergableGap(Polygon) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| polygonize(Geometry) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| findMergableGaps(List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| isPolygonal(Geometry) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| setSnappingDistance(double) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setGapMaximumWidth(double) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| computeDefaultSnappingDistance(Geometry[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| extractNodedSegmentStrings(Geometry, List) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| cleanOverlapGap(Geometry[], int, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getResult() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| cleanGapWidth(Geometry[], double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| covers(Geometry, Point) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$findMergableGaps$0(Polygon) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getOverlaps() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMergedGaps() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |