72   private final int numVertices;  field in S2Loop
92     this.numVertices = vertices.size();  in S2Loop()
93     this.vertices = new S2Point[numVertices];  in S2Loop()
126     numVertices = 4;  in S2Loop()
127     vertices = new S2Point[numVertices];  in S2Loop()
142     this.numVertices = src.numVertices();  in S2Loop()
183   public int numVertices() {  in numVertices()  method in S2Loop
184     return numVertices;  in numVertices()
204     if (numVertices() != other.numVertices()) {  in compareTo()
205       return this.numVertices() - other.numVertices();  in compareTo()
210     int maxVertices = numVertices();  in compareTo()
228     for (int i = 1; i < numVertices; ++i) {  in initFirstLogicalVertex()
260     int last = numVertices() - 1;  in invert()
284     if (numVertices() < 3) {  in getAreaCentroid()
314     for (int i = 1; i <= numVertices(); ++i) {  in getAreaCentroid()
555     if (numVertices() != b.numVertices()) {  in boundaryApproxEquals()
558     int maxVertices = numVertices();  in boundaryApproxEquals()
632         vertices[numVertices - 1]);  in contains()
636     if (numVertices < 2000) {  in contains()
637       for (int i = 0; i < numVertices; i++) {  in contains()
641       DataEdgeIterator it = getEdgeIterator(numVertices);  in contains()
667     for (int i = 0; i < numVertices(); i++) {  in getDistance()
686           return numVertices;  in getEdgeIterator()
706     if (numVertices < 3) {  in isValid()
712     for (int i = 0; i < numVertices; ++i) {  in isValid()
721     for (int i = 0; i < numVertices; ++i) {  in isValid()
731     DataEdgeIterator it = getEdgeIterator(numVertices);  in isValid()
732     for (int a1 = 0; a1 < numVertices; a1++) {  in isValid()
733       int a2 = (a1 + 1) % numVertices;  in isValid()
738         int b2 = (b1 + 1) % numVertices;  in isValid()
847     for (int i = 0; i <= numVertices(); ++i) {  in initBound()
874       for (int i = 1; i <= numVertices; i++) {  in findVertex()
899     DataEdgeIterator it = getEdgeIterator(b.numVertices);  in checkEdgeCrossings()
903     for (int j = 0; j < b.numVertices(); ++j) {  in checkEdgeCrossings()