191   public S2Point vertex(int i) {  in vertex()  method in S2Loop
214       int compare = vertex(iThis).compareTo(other.vertex(iOther));  in compareTo()
229       if (vertex(i).compareTo(vertex(first)) < 0) {  in initFirstLogicalVertex()
304     S2Point origin = vertex(0);  in getAreaCentroid()
315       areaSum += S2.signedArea(origin, vertex(i - 1), vertex(i));  in getAreaCentroid()
318         S2Point trueCentroid = S2.trueCentroid(origin, vertex(i - 1), vertex(i));  in getAreaCentroid()
412     if (!contains(b.vertex(0)) && findVertex(b.vertex(0)) < 0) {  in contains()
427       if (b.contains(vertex(0)) && b.findVertex(vertex(0)) < 0) {  in contains()
457     if (contains(b.vertex(0)) && findVertex(b.vertex(0)) < 0) {  in intersects()
474       if (b.contains(vertex(0)) && b.findVertex(vertex(0)) < 0) {  in intersects()
494     int m = findVertex(b.vertex(1));  in containsNested()
497       return contains(b.vertex(1));  in containsNested()
502         vertex(m - 1), vertex(m), vertex(m + 1), b.vertex(0), b.vertex(2)) > 0;  in containsNested()
540     if (!contains(b.vertex(0)) && findVertex(b.vertex(0)) < 0) {  in containsOrCrosses()
562       if (!S2.approxEquals(vertex(iThis), b.vertex(iOther), maxError)) {  in boundaryApproxEquals()
649         inside ^= crosser.edgeOrVertexCrossing(vertex(ai + 1));  in contains()
669           S1Angle.min(minDistance, S2EdgeUtil.getDistance(normalized, vertex(i), vertex(i + 1)));  in getDistance()
691           return vertex(index);  in getEdgeIterator()
696           return vertex(index + 1);  in getEdgeIterator()
713       if (!S2.isUnitLength(vertex(i))) {  in isValid()
722       Integer previousVertexIndex = vmap.put(vertex(i), i);  in isValid()
734       EdgeCrosser crosser = new EdgeCrosser(vertex(a1), vertex(a2), vertex(0));  in isValid()
736       for (it.getCandidates(vertex(a1), vertex(a2)); it.hasNext(); it.next()) {  in isValid()
754           double abc = S2.angle(vertex(a1), vertex(a2), vertex(b1));  in isValid()
757           double abd = S2.angle(vertex(a1), vertex(a2), vertex(b2));  in isValid()
765             crosser.restartAt(vertex(b1));  in isValid()
771           crosses = crosser.robustCrossing(vertex(b2)) > 0;  in isValid()
776                 new S2LatLng(vertex(a1)).toStringDegrees(),  in isValid()
777                 new S2LatLng(vertex(a2)).toStringDegrees(),  in isValid()
778                 new S2LatLng(vertex(b1)).toStringDegrees(),  in isValid()
779                 new S2LatLng(vertex(b2)).toStringDegrees()));  in isValid()
818     Preconditions.checkState(bound.contains(vertex(1)));  in initOrigin()
833     boolean v1Inside = S2.orderedCCW(S2.ortho(vertex(1)), vertex(0), vertex(2), vertex(1));  in initOrigin()
834     if (v1Inside != contains(vertex(1))) {  in initOrigin()
848       bounder.addPoint(vertex(i));  in initBound()
875         vertexToIndex.put(vertex(i), i);  in findVertex()
905         new S2EdgeUtil.EdgeCrosser(b.vertex(j), b.vertex(j + 1), vertex(0));  in checkEdgeCrossings()
907       for (it.getCandidates(b.vertex(j), b.vertex(j + 1)); it.hasNext(); it.next()) {  in checkEdgeCrossings()
910           crosser.restartAt(vertex(i));  in checkEdgeCrossings()
913         int crossing = crosser.robustCrossing(vertex(i + 1));  in checkEdgeCrossings()
920         if (vertex(i + 1).equals(b.vertex(j + 1))) {  in checkEdgeCrossings()
922               vertex(i), vertex(i + 1), vertex(i + 2), b.vertex(j), b.vertex(j + 2)));  in checkEdgeCrossings()