39   private final int numVertices;  field in S2Polyline
49     this.numVertices = vertices.size();  in S2Polyline()
50     this.vertices = vertices.toArray(new S2Point[numVertices]);  in S2Polyline()
59     this.numVertices = src.numVertices();  in S2Polyline()
88   public int numVertices() {  in numVertices()  method in S2Polyline
89     return numVertices;  in numVertices()
103     for (int i = 1; i < numVertices(); ++i) {  in getArclengthAngle()
124     for (int i = 1; i < numVertices(); ++i) {  in interpolate()
128     for (int i = 1; i < numVertices(); ++i) {  in interpolate()
139     return vertex(numVertices() - 1);  in interpolate()
155     for (int i = 0; i < numVertices(); ++i) {  in getRectBound()
179     if (numVertices() == 0) {  in mayIntersect()
186     for (int i = 0; i < numVertices(); ++i) {  in mayIntersect()
198       for (int i = 1; i < numVertices(); ++i) {  in mayIntersect()
214     Preconditions.checkState(numVertices() > 0, "Empty polyline");  in getNearestEdgeIndex()
216     if (numVertices() == 1) {  in getNearestEdgeIndex()
226     for (int i = 0; i < numVertices() - 1; ++i) {  in getNearestEdgeIndex()
241     Preconditions.checkState(numVertices() > 0, "Empty polyline");  in projectToEdge()
242     Preconditions.checkState(numVertices() == 1 || index < numVertices() - 1, "Invalid edge index");  in projectToEdge()
243     if (numVertices() == 1) {  in projectToEdge()
257     if (numVertices != thatPolygon.numVertices) {
271     return Objects.hashCode(numVertices, Arrays.deepHashCode(vertices));