Update markdown files

Automatic commit by the Housekeeper-Nightly-Bookmaker bot.

TBR=update-docs@skia.org
NO_MERGE_BUILDS

Change-Id: I6919c0b5eace99c4ea229599afef13bdcbb12449
Reviewed-on: https://skia-review.googlesource.com/92480
Reviewed-by: Update Docs <update-docs@skia.org>
Commit-Queue: Update Docs <update-docs@skia.org>

1 files changed, 0 insertions, 123 deletions

diff --git a/site/user/api/SkRect_Reference.md b/site/user/api/SkRect_Reference.md
index 678f28f8af..f679e6284c 100644
--- a/site/user/api/SkRect_Reference.md
+++ b/site/user/api/SkRect_Reference.md
@@ -47,7 +47,6 @@ integer input cannot convert to <a href="undocumented#SkScalar">SkScalar</a> wit
 | <a href="#SkRect_contains">contains</a> | Returns true if points are equal or inside. |
 | <a href="#SkRect_dump_2">dump</a> | Sends text representation using floats to standard output. |
 | <a href="#SkRect_dumpHex">dumpHex</a> | Sends text representation using hexadecimal to standard output. |
-| <a href="#SkRect_growToInclude">growToInclude</a> | Sets to union of bounds and one or more <a href="#Point">Points</a>. |
 | <a href="#SkRect_height">height</a> | Returns span in <a href="#SkRect_y">y</a>. |
 | <a href="#SkRect_inset">inset</a> | Moves the sides symmetrically about the center. |
 | <a href="#SkRect_intersect">intersect</a> | Sets to shared area; returns true if not empty. |
@@ -2258,128 +2257,6 @@ sorted: 10, 0, 55, 100
 
 ---
 
-<a name="SkRect_growToInclude"></a>
-## growToInclude
-
-<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
-void growToInclude(SkPoint pt)
-</pre>
-
-Grows <a href="#Rect">Rect</a> to include (<a href="#SkRect_growToInclude_pt">pt</a>.fX, <a href="#SkRect_growToInclude_pt">pt</a>.fY), modifying it so that:
-
-<a href="#SkRect_fLeft">fLeft</a> <= <a href="#SkRect_growToInclude_pt">pt</a>.fX <= <a href="#SkRect_fRight">fRight</a> && <a href="#SkRect_fTop">fTop</a> <= <a href="#SkRect_growToInclude_pt">pt</a>.fY <= <a href="#SkRect_fBottom">fBottom</a>.
-
-If <a href="#Rect">Rect</a> is inverted, then <a href="#Rect">Rect</a> will preserve the <a href="#SkRect_top">top</a> <a href="#SkRect_left">left</a>, and the result
-will not be inverted.
-
-### Parameters
-
-<table>  <tr>    <td><a name="SkRect_growToInclude_pt"> <code><strong>pt </strong></code> </a></td> <td>
-<a href="SkPoint_Reference#Point">Point</a> to include</td>
-  </tr>
-</table>
-
-### Example
-
-<div><fiddle-embed name="9a2bb963b7bdde80710cac5d148c6ccd">
-
-#### Example Output
-
-~~~~
-rect: 1, 1, 42, 24  isEmpty: false
-~~~~
-
-</fiddle-embed></div>
-
-### See Also
-
-<a href="#SkRect_join">join</a>
-
----
-
-<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
-void growToInclude(const SkPoint pts[], int count)
-</pre>
-
-For each of <a href="#SkRect_growToInclude_2_count">count</a> <a href="SkPoint_Reference#Point">Point</a> in <a href="#SkRect_growToInclude_2_pts">pts</a>, grows <a href="#Rect">Rect</a> to include (pt.fX, pt.fY), modifying
-it so that:
-<a href="#SkRect_fLeft">fLeft</a> <= pt.fX <= <a href="#SkRect_fRight">fRight</a> && <a href="#SkRect_fTop">fTop</a> <= pt.fY <= <a href="#SkRect_fBottom">fBottom</a>.
-
-If <a href="#Rect">Rect</a> is inverted, then <a href="#Rect">Rect</a> will contain bounds of
-<a href="#Point">Points</a> after one or more calls. In this case, <a href="#Rect">Rect</a> is empty after first call.
-
-### Parameters
-
-<table>  <tr>    <td><a name="SkRect_growToInclude_2_pts"> <code><strong>pts </strong></code> </a></td> <td>
-<a href="SkPoint_Reference#Point">Point</a> array</td>
-  </tr>  <tr>    <td><a name="SkRect_growToInclude_2_count"> <code><strong>count </strong></code> </a></td> <td>
-number of points in array</td>
-  </tr>
-</table>
-
-### Example
-
-<div><fiddle-embed name="73082d5aea2026cae4c42ec587417df2">
-
-#### Example Output
-
-~~~~
-rect: 30, 50, 40, 60
-~~~~
-
-</fiddle-embed></div>
-
-### See Also
-
-<a href="#SkRect_join">join</a>
-
----
-
-<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
-void growToInclude(const SkPoint pts[], size_t stride, int count)
-</pre>
-
-For each of <a href="#SkRect_growToInclude_3_count">count</a> <a href="SkPoint_Reference#Point">Point</a> in <a href="#SkRect_growToInclude_3_pts">pts</a>, grows <a href="#Rect">Rect</a> to include (pt.fX, pt.fY), modifying
-it so that:
-<a href="#SkRect_fLeft">fLeft</a> <= pt.fX <= <a href="#SkRect_fRight">fRight</a> && <a href="#SkRect_fTop">fTop</a> <= pt.fY <= <a href="#SkRect_fBottom">fBottom</a>.
-
-<a href="SkPoint_Reference#Point">Point</a> may be followed with other data in each array element. <a href="#SkRect_growToInclude_3_stride">stride</a> is number
-of bytes in element; the interval to skip to advance from one <a href="SkPoint_Reference#Point">Point</a> to
-the next.
-
-If <a href="#Rect">Rect</a> is inverted, then <a href="#Rect">Rect</a> will contain bounds of
-<a href="#Point">Points</a> after one or more calls. In this case, <a href="#Rect">Rect</a> is empty after first call.
-
-### Parameters
-
-<table>  <tr>    <td><a name="SkRect_growToInclude_3_pts"> <code><strong>pts </strong></code> </a></td> <td>
-array of elements beginning with <a href="SkPoint_Reference#Point">Point</a></td>
-  </tr>  <tr>    <td><a name="SkRect_growToInclude_3_stride"> <code><strong>stride </strong></code> </a></td> <td>
-size of <a href="#SkRect_growToInclude_3_pts">pts</a> elements in 32-bit words; zero or greater</td>
-  </tr>  <tr>    <td><a name="SkRect_growToInclude_3_count"> <code><strong>count </strong></code> </a></td> <td>
-number of elements in array</td>
-  </tr>
-</table>
-
-### Example
-
-<div><fiddle-embed name="1275f2f35d5ca9412bd2ae0e81e9f2e0">
-
-#### Example Output
-
-~~~~
-#Volatile
-rect: 30, 50, 40, 60
-~~~~
-
-</fiddle-embed></div>
-
-### See Also
-
-<a href="#SkRect_join">join</a>
-
----
-
 <a name="SkRect_contains"></a>
 ## contains