fix SkIRect doc to match include
changed int to int32_t as needed Docs-Preview: https://skia.org/?cl=90840 Bug: skia:6898 Change-Id: I909168314acc5ee007d4a4d4e39062e652c7d6c6 Reviewed-on: https://skia-review.googlesource.com/90840 Commit-Queue: Cary Clark <caryclark@skia.org> Reviewed-by: Cary Clark <caryclark@skia.org>
This commit is contained in:
parent
a3cf3659ed
commit
6def7201ed
@ -287,7 +287,7 @@ rect: -10, 35, 5, 60 isEmpty: false
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int left() const
|
||||
#Method int32_t left() const
|
||||
|
||||
Returns left edge of IRect, if sorted.
|
||||
Call sort() to reverse fLeft and fRight if needed.
|
||||
@ -311,7 +311,7 @@ sorted.fLeft: 10 sorted.left(): 10
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int top() const
|
||||
#Method int32_t top() const
|
||||
|
||||
Returns top edge of IRect, if sorted. Call isEmpty to see if IRect may be invalid,
|
||||
and sort() to reverse fTop and fBottom if needed.
|
||||
@ -335,7 +335,7 @@ sorted.fTop: 5 sorted.top(): 5
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int right() const
|
||||
#Method int32_t right() const
|
||||
|
||||
Returns right edge of IRect, if sorted.
|
||||
Call sort() to reverse fLeft and fRight if needed.
|
||||
@ -359,7 +359,7 @@ sorted.fRight: 15 sorted.right(): 15
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int bottom() const
|
||||
#Method int32_t bottom() const
|
||||
|
||||
Returns bottom edge of IRect, if sorted. Call isEmpty to see if IRect may be invalid,
|
||||
and sort() to reverse fTop and fBottom if needed.
|
||||
@ -383,7 +383,7 @@ sorted.fBottom: 25 sorted.bottom(): 25
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int x() const
|
||||
#Method int32_t x() const
|
||||
|
||||
Returns left edge of IRect, if sorted. Call isEmpty to see if IRect may be invalid,
|
||||
and sort() to reverse fLeft and fRight if needed.
|
||||
@ -407,7 +407,7 @@ sorted.fLeft: 10 sorted.x(): 10
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int y() const
|
||||
#Method int32_t y() const
|
||||
|
||||
Returns top edge of IRect, if sorted. Call isEmpty to see if IRect may be invalid,
|
||||
and sort() to reverse fTop and fBottom if needed.
|
||||
@ -431,7 +431,7 @@ sorted.fTop: 5 sorted.y(): 5
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int width() const
|
||||
#Method int32_t width() const
|
||||
|
||||
Returns span on the x-axis. This does not check if IRect is sorted, or if
|
||||
result fits in 32-bit signed integer; result may be negative.
|
||||
@ -455,7 +455,7 @@ large width: -5
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int height() const
|
||||
#Method int32_t height() const
|
||||
|
||||
Returns span on the y-axis. This does not check if IRect is sorted, or if
|
||||
result fits in 32-bit signed integer; result may be negative.
|
||||
@ -512,7 +512,7 @@ original rect: 20, 30, 40, 50 size: 20, 20
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int centerX() const
|
||||
#Method int32_t centerX() const
|
||||
|
||||
Returns average of left edge and right edge. Result does not change if Rect
|
||||
is sorted. Result may be incorrect if Rect is far from the origin.
|
||||
@ -543,7 +543,7 @@ left: -10 right: 11 centerX: 0 div2: 0
|
||||
|
||||
# ------------------------------------------------------------------------------
|
||||
|
||||
#Method int centerY() const
|
||||
#Method int32_t centerY() const
|
||||
|
||||
Returns average of top edge and bottom edge. Result does not change if Rect
|
||||
is sorted. Result may be incorrect if Rect is far from the origin.
|
||||
|
@ -344,7 +344,7 @@ rect: -10, 35, 5, 60 isEmpty: false
|
||||
## left
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int left() const
|
||||
int32_t left() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_left">left</a> edge of <a href="#IRect">IRect</a>, if sorted.
|
||||
@ -377,7 +377,7 @@ sorted.fLeft: 10 sorted.left(): 10
|
||||
## top
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int top() const
|
||||
int32_t top() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_top">top</a> edge of <a href="#IRect">IRect</a>, if sorted. Call <a href="#SkIRect_isEmpty">isEmpty</a> to see if <a href="#IRect">IRect</a> may be invalid,
|
||||
@ -410,7 +410,7 @@ sorted.fTop: 5 sorted.top(): 5
|
||||
## right
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int right() const
|
||||
int32_t right() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_right">right</a> edge of <a href="#IRect">IRect</a>, if sorted.
|
||||
@ -443,7 +443,7 @@ sorted.fRight: 15 sorted.right(): 15
|
||||
## bottom
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int bottom() const
|
||||
int32_t bottom() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_bottom">bottom</a> edge of <a href="#IRect">IRect</a>, if sorted. Call <a href="#SkIRect_isEmpty">isEmpty</a> to see if <a href="#IRect">IRect</a> may be invalid,
|
||||
@ -476,7 +476,7 @@ sorted.fBottom: 25 sorted.bottom(): 25
|
||||
## x
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int x() const
|
||||
int32_t x() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_left">left</a> edge of <a href="#IRect">IRect</a>, if sorted. Call <a href="#SkIRect_isEmpty">isEmpty</a> to see if <a href="#IRect">IRect</a> may be invalid,
|
||||
@ -509,7 +509,7 @@ sorted.fLeft: 10 sorted.x(): 10
|
||||
## y
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int y() const
|
||||
int32_t y() const
|
||||
</pre>
|
||||
|
||||
Returns <a href="#SkIRect_top">top</a> edge of <a href="#IRect">IRect</a>, if sorted. Call <a href="#SkIRect_isEmpty">isEmpty</a> to see if <a href="#IRect">IRect</a> may be invalid,
|
||||
@ -542,7 +542,7 @@ sorted.fTop: 5 sorted.y(): 5
|
||||
## width
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int width() const
|
||||
int32_t width() const
|
||||
</pre>
|
||||
|
||||
Returns span on the <a href="#SkIRect_x">x</a>-axis. This does not check if <a href="#IRect">IRect</a> is sorted, or if
|
||||
@ -575,7 +575,7 @@ large width: -5
|
||||
## height
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int height() const
|
||||
int32_t height() const
|
||||
</pre>
|
||||
|
||||
Returns span on the <a href="#SkIRect_y">y</a>-axis. This does not check if <a href="#IRect">IRect</a> is sorted, or if
|
||||
@ -642,7 +642,7 @@ outset rect: 20, 30, 80, 90 size: 60, 60
|
||||
## centerX
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int centerX() const
|
||||
int32_t centerX() const
|
||||
</pre>
|
||||
|
||||
Returns average of <a href="#SkIRect_left">left</a> edge and <a href="#SkIRect_right">right</a> edge. Result does not change if <a href="SkRect_Reference#Rect">Rect</a>
|
||||
@ -678,7 +678,7 @@ left: -10 right: 11 centerX: 0 div2: 0
|
||||
## centerY
|
||||
|
||||
<pre style="padding: 1em 1em 1em 1em;width: 62.5em; background-color: #f0f0f0">
|
||||
int centerY() const
|
||||
int32_t centerY() const
|
||||
</pre>
|
||||
|
||||
Returns average of <a href="#SkIRect_top">top</a> edge and <a href="#SkIRect_bottom">bottom</a> edge. Result does not change if <a href="SkRect_Reference#Rect">Rect</a>
|
||||
|
Loading…
Reference in New Issue
Block a user