RoundRect contains

include/core/SkRRect.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkRRect_DEFINED
 #define SkRRect_DEFINED
 
@@ skipping 182 matching lines @@
     }
 
     friend bool operator!=(const SkRRect& a, const SkRRect& b) {
         return a.fRect != b.fRect ||
                !SkScalarsEqual(a.fRadii[0].asScalars(),
                                b.fRadii[0].asScalars(), 8);
     }
 
     /**
      *  Returns true if (p.fX,p.fY) is inside the RR, and the RR
-     *  is not empty.
+     *  is not empty. The 'loose' parameter controls the containment
+     *  policly on the right and bottom edges (loose -> "<="; !loose ->
+     *  "<"). It should be set to true when the point should be considered
+     *  "in" when it lies on a R/B edge (e.g., the right edge of an SkRect).
      *
      *  Contains treats the left and top differently from the right and bottom.
      *  The left and top coordinates of the RR are themselves considered
      *  to be inside, while the right and bottom are not. All the points on the
      *  edges of the corners are considered to be inside.
      */
-    bool contains(const SkPoint& p) const {
-        return contains(p.fX, p.fY);
+    bool contains(const SkPoint& p, bool loose = false) const {
+        return contains(p.fX, p.fY, loose);
     }
 
     /**
      *  Returns true if (x,y) is inside the RR, and the RR
-     *  is not empty.
+     *  is not empty. The 'loose' parameter controls the containment
+     *  policly on the right and bottom edges (loose -> "<="; !loose ->
+     *  "<"). It should be set to true when the point should be considered
+     *  "in" when it lies on a R/B edge (e.g., the right edge of an SkRect).
      *
      *  Contains treats the left and top differently from the right and bottom.
      *  The left and top coordinates of the RR are themselves considered
      *  to be inside, while the right and bottom are not. All the points on the
      *  edges of the corners are considered to be inside.
      */
-    bool contains(SkScalar x, SkScalar y) const;
+    bool contains(SkScalar x, SkScalar y, bool loose = false) const;
 
     /**
      *  Call inset on the bounds, and adjust the radii to reflect what happens
      *  in stroking: If the corner is sharp (no curvature), leave it alone,
      *  otherwise we grow/shrink the radii by the amount of the inset. If a
      *  given radius becomes negative, it is pinned to 0.
      *
      *  It is valid for dst == this.
      */
     void inset(SkScalar dx, SkScalar dy, SkRRect* dst) const;
@@ skipping 10 matching lines @@
      *
      *  It is valid for dst == this.
      */
     void outset(SkScalar dx, SkScalar dy, SkRRect* dst) const {
         this->inset(-dx, -dy, dst);
     }
     void outset(SkScalar dx, SkScalar dy) {
         this->inset(-dx, -dy, this);
     }
 
+    /**
+     *  Returns true if 'rect' is wholy inside the RR, and both
+     *  are not empty.
+     *
+     *  Contains treats the left and top differently from the right and bottom.
+     *  The left and top coordinates of the RR are themselves considered
+     *  to be inside, while the right and bottom are not. All the points on the
+     *  edges of the corners are considered to be inside.
+     */
+    bool contains(const SkRect& rect) const;
+
     SkDEBUGCODE(void validate() const;)
 
     enum {
         kSizeInMemory = 12 * sizeof(SkScalar)
     };
 
     /**
      *  Write the rrect into the specified buffer. This is guaranteed to always
      *  write kSizeInMemory bytes, and that value is guaranteed to always be
      *  a multiple of 4. Return kSizeInMemory.
@@ skipping 15 matching lines @@
     // TODO: add padding so we can use memcpy for flattening and not copy
     // uninitialized data
 
     void computeType() const;
 
     // to access fRadii directly
     friend class SkPath;
 };
 
 #endif