Incorporating change missed in previous CL...

core/cross/gpu2d/local_triangulator.h

 /*
  * Copyright 2010, Google Inc.
  * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 174 matching lines @@
   //
   // The triangulation obeys the following guarantees:
   //   - If the convex hull is a quadrilateral, then the shortest edge
   //     will be chosen for the cut into two triangles.
   //   - If one of the vertices is contained in the triangle spanned
   //     by the other three, three triangles will be produced.
   void Triangulate(bool compute_inside_edges,
                    bool fill_right_side);
 
   // Number of triangles computed by Triangulate().
-  int num_triangles() {
+  int num_triangles() const {
     return num_triangles_;
   }
 
   // Returns the computed triangle at index, 0 <= index <
   // num_triangles().
   Triangle* get_triangle(int index) {
     DCHECK(index >= 0 && index < num_triangles_);
     return &triangles_[index];
   }
 
   // Number of vertices facing the inside of the shape, if
   // compute_inside_edges was true when Triangulate() was called.
-  int num_interior_vertices() {
+  int num_interior_vertices() const {
     return num_interior_vertices_;
   }
 
   // Fetches the given interior vertex, 0 <= index <
   // num_interior_vertices(). Returns NULL if index is out of range.
   Vertex* get_interior_vertex(int index) {
     DCHECK(index >= 0 && index < num_interior_vertices_);
     return interior_vertices_[index];
   }
 
@@ skipping 27 matching lines @@
   int num_triangles_;
 
   DISALLOW_COPY_AND_ASSIGN(LocalTriangulator);
 };
 
 }  // namespace gpu2d
 }  // namespace o3d
 
 #endif  // O3D_CORE_CROSS_GPU2D_LOCAL_TRIANGULATOR_H_