Source file "com/google/common/geometry/S2Polygon.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,892 of 1,892 | 0% | 256 of 256 | 0% | 176 | 176 | 404 | 404 | 48 | 48 |
| destructiveUnionSloppy(List, S1Angle) | | 0% | | 0% | 7 | 7 | 38 | 38 | 1 | 1 |
| isValid(List) | | 0% | | 0% | 9 | 9 | 22 | 22 | 1 | 1 |
| clipBoundary(S2Polygon, boolean, S2Polygon, boolean, boolean, boolean, S2PolygonBuilder) | | 0% | | 0% | 9 | 9 | 22 | 22 | 1 | 1 |
| getAreaCentroid(boolean) | | 0% | | 0% | 4 | 4 | 15 | 15 | 1 | 1 |
| insertLoop(S2Loop, S2Loop, Map) | | 0% | | 0% | 7 | 7 | 22 | 22 | 1 | 1 |
| init(List) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| isNormalized() | | 0% | | 0% | 8 | 8 | 19 | 19 | 1 | 1 |
| intersects(S2Polygon) | | 0% | | 0% | 11 | 11 | 11 | 11 | 1 | 1 |
| boundaryApproxEquals(S2Polygon, double) | | 0% | | 0% | 7 | 7 | 14 | 14 | 1 | 1 |
| contains(S2Polygon) | | 0% | | 0% | 11 | 11 | 11 | 11 | 1 | 1 |
| clipEdge(S2Point, S2Point, S2Polygon.S2LoopSequenceIndex, boolean, List) | | 0% | | 0% | 4 | 4 | 17 | 17 | 1 | 1 |
| addIntersection(S2Point, S2Point, S2Point, S2Point, boolean, int, List) | | 0% | | 0% | 8 | 8 | 10 | 10 | 1 | 1 |
| toString() | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| initToIntersectionSloppy(S2Polygon, S2Polygon, S1Angle) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| contains(S2Point) | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| initToUnionSloppy(S2Polygon, S2Polygon, S1Angle) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| entries(Map) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| S2Polygon(S2Polygon) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| compareTo(S2Polygon) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| initLoop(S2Loop, int, Map) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| contains(S2Cell) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| mayIntersect(S2Cell) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| remove(Map, Map.Entry) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| containsOrCrosses(S2Loop) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| getLastDescendant(int) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| getDistance(S2Point) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| S2Polygon(S2Loop) | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| containsAllShells(S2Polygon) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| excludesAllHoles(S2Polygon) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| intersectsAnyShell(S2Polygon) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| getParent(int) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| release(List) | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| sortValueLoops(Map) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| anyLoopContains(S2Loop) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| S2Polygon() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| S2Polygon(List) | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| loop(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| initToIntersection(S2Polygon, S2Polygon) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| initToUnion(S2Polygon, S2Polygon) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| getArea() | | 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 | |
| numLoops() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getAreaAndCentroid() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| destructiveUnion(List) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getCapBound() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getNumVertices() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getRectBound() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |