aboutsummaryrefslogtreecommitdiffhomepage
path: root/docs/SkRect_Reference.bmh
diff options
context:
space:
mode:
authorGravatar Mike Reed <reed@google.com>2018-01-08 17:09:54 -0500
committerGravatar Skia Commit-Bot <skia-commit-bot@chromium.org>2018-01-08 22:32:51 +0000
commit185ffe916eb374ab3dfe3f42e265d26dacdd30ca (patch)
treee1a3bcdcc9465304117c53f7c0dc99ad339d9507 /docs/SkRect_Reference.bmh
parentc59b03071f5b255b5ce42749ff5d8238adca13e2 (diff)
make growToInclude private
Bug: skia: Change-Id: Id55344ba2f33563d22c2bf4d5829a9a31095a47d Reviewed-on: https://skia-review.googlesource.com/92143 Commit-Queue: Mike Reed <reed@google.com> Reviewed-by: Cary Clark <caryclark@google.com> Reviewed-by: Brian Salomon <bsalomon@google.com>
Diffstat (limited to 'docs/SkRect_Reference.bmh')
-rw-r--r--docs/SkRect_Reference.bmh101
1 files changed, 0 insertions, 101 deletions
diff --git a/docs/SkRect_Reference.bmh b/docs/SkRect_Reference.bmh
index 19bfecd05e..ddebdb104f 100644
--- a/docs/SkRect_Reference.bmh
+++ b/docs/SkRect_Reference.bmh
@@ -56,7 +56,6 @@ integer input cannot convert to SkScalar without loss of precision.
# contains() # Returns true if points are equal or inside. ##
# dump() # Sends text representation using floats to standard output. ##
# dumpHex # Sends text representation using hexadecimal to standard output. ##
-# growToInclude # Sets to union of bounds and one or more Points. ##
# height # Returns span in y. ##
# inset() # Moves the sides symmetrically about the center. ##
# intersect() # Sets to shared area; returns true if not empty. ##
@@ -1736,106 +1735,6 @@ sorted: 10, 0, 55, 100
# ------------------------------------------------------------------------------
-#Method void growToInclude(SkPoint pt)
-
-Grows Rect to include (pt.fX, pt.fY), modifying it so that:
-
-#Formula
-fLeft <= pt.fX <= fRight && fTop <= pt.fY <= fBottom
-##
-.
-
-If Rect is inverted, then Rect will preserve the top left, and the result
-will not be inverted.
-
-#Param pt Point to include ##
-
-#Example
- SkRect rect = { 1, 1, 0, 0 };
- rect.growToInclude( { 42, 24 } );
- SkDebugf("rect: %g, %g, %g, %g ", rect.left(), rect.top(), rect.right(), rect.bottom());
- SkDebugf("isEmpty: %s\n", rect.isEmpty() ? "true" : "false");
-#StdOut
-rect: 1, 1, 42, 24 isEmpty: false
-##
-##
-
-#SeeAlso join
-
-##
-
-# ------------------------------------------------------------------------------
-
-#Method void growToInclude(const SkPoint pts[], int count)
-
-For each of count Point in pts, grows Rect to include (pt.fX, pt.fY), modifying
-it so that:
-#Formula
-fLeft <= pt.fX <= fRight && fTop <= pt.fY <= fBottom
-##
-.
-
-If Rect is inverted, then Rect will contain bounds of
-Points after one or more calls. In this case, Rect is empty after first call.
-
-#Param pts Point array ##
-#Param count number of points in array ##
-
-#Example
- SkPoint pts[] = { { 30, 50 }, { 40, 50 }, { 30, 60 } };
- SkRect rect = { pts[0].fX, pts[0].fY, pts[0].fX, pts[0].fY };
- rect.growToInclude( pts[1] );
- rect.growToInclude( pts[2] );
- SkDebugf("rect: %g, %g, %g, %g ", rect.left(), rect.top(), rect.right(), rect.bottom());
-#StdOut
-rect: 30, 50, 40, 60
-##
-##
-
-#SeeAlso join
-
-##
-
-# ------------------------------------------------------------------------------
-
-#Method void growToInclude(const SkPoint pts[], size_t stride, int count)
-
-For each of count Point in pts, grows Rect to include (pt.fX, pt.fY), modifying
-it so that:
-#Formula
-fLeft <= pt.fX <= fRight && fTop <= pt.fY <= fBottom
-##
-.
-
-Point may be followed with other data in each array element. stride is number
-of bytes in element; the interval to skip to advance from one Point to
-the next.
-
-If Rect is inverted, then Rect will contain bounds of
-Points after one or more calls. In this case, Rect is empty after first call.
-
-#Param pts array of elements beginning with Point ##
-#Param stride size of pts elements in 32-bit words; zero or greater ##
-#Param count number of elements in array ##
-
-#Bug 7142 ##
-#Example
- SkPoint3 pts[] = { { 30, 50, -1 }, { 40, 50, -1 }, { 30, 60, -1 } };
- SkRect rect = { 1, 1, 0, 0 };
- rect.growToInclude((SkPoint* ) &pts[0].fX, sizeof(SkPoint3), SK_ARRAY_COUNT(pts));
- SkDebugf("rect: %g, %g, %g, %g ", rect.left(), rect.top(), rect.right(), rect.bottom());
-#StdOut
-#Volatile
-rect: 30, 50, 40, 60
-##
-##
-
-#SeeAlso join
-
-##
-
-# ------------------------------------------------------------------------------
-
#Method bool contains(const SkRect& r) const
Returns true if Rect contains r.