Add getRectCount to SkRegtion

include/core/SkRegion.h

 
 /*
  * Copyright 2005 The Android Open Source Project
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #ifndef SkRegion_DEFINED
@@ skipping 68 matching lines @@
     /** Return true if this region consists of more than 1 rectangular area */
     bool isComplex() const { return !this->isEmpty() && !this->isRect(); }
 
     /**
      *  Return the bounds of this region. If the region is empty, returns an
      *  empty rectangle.
      */
     const SkIRect& getBounds() const { return fBounds; }
 
     /**
+     *  Returns the number of rects that comprise this region.

[reed1, 2013/07/17 19:14:36]

I'd like to make the definition a little fuzzier, so we're not married to this
returning exactly the same number of rects that Iter might return. How about...

/**
Returns a value that grows approximately linearly with the number of intervals
comprised in the region. Empty will return 0, Rect will return 1, Complex will
return some value > 1. Use this to compare two regions, where the larger count
likely indicates a more complex region.
*/

int computeRegionComplexity() const;

[vmpstr, 2013/07/17 19:59:08]

Done.

+     *  Experimental: please do not use this unless absolutely necessary.
+     */
+    int getRectCount() const;
+
+    /**
      *  Returns true if the region is non-empty, and if so, appends the
      *  boundary(s) of the region to the specified path.
      *  If the region is empty, returns false, and path is left unmodified.
      */
     bool getBoundaryPath(SkPath* path) const;
 
     /**
      *  Set the region to be empty, and return false, since the resulting
      *  region is empty
      */
@@ skipping 328 matching lines @@
     static bool Oper(const SkRegion&, const SkRegion&, SkRegion::Op, SkRegion*);
 
     friend struct RunHead;
     friend class Iterator;
     friend class Spanerator;
     friend class SkRgnBuilder;
     friend class SkFlatRegion;
 };
 
 #endif