1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* 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 SkPathOpsRect_DEFINED
#define SkPathOpsRect_DEFINED
#include "SkPathOpsPoint.h"
struct SkDRect {
double fLeft, fTop, fRight, fBottom;
void add(const SkDPoint& pt) {
fLeft = SkTMin(fLeft, pt.fX);
fTop = SkTMin(fTop, pt.fY);
fRight = SkTMax(fRight, pt.fX);
fBottom = SkTMax(fBottom, pt.fY);
}
bool contains(const SkDPoint& pt) const {
return approximately_between(fLeft, pt.fX, fRight)
&& approximately_between(fTop, pt.fY, fBottom);
}
void debugInit();
bool intersects(const SkDRect& r) const {
SkASSERT(fLeft <= fRight);
SkASSERT(fTop <= fBottom);
SkASSERT(r.fLeft <= r.fRight);
SkASSERT(r.fTop <= r.fBottom);
return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom;
}
void set(const SkDPoint& pt) {
fLeft = fRight = pt.fX;
fTop = fBottom = pt.fY;
}
double width() const {
return fRight - fLeft;
}
double height() const {
return fBottom - fTop;
}
void setBounds(const SkDConic& curve) {
setBounds(curve, curve, 0, 1);
}
void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
void setBounds(const SkDCubic& curve) {
setBounds(curve, curve, 0, 1);
}
void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd);
void setBounds(const SkDQuad& curve) {
setBounds(curve, curve, 0, 1);
}
void setBounds(const SkDQuad& curve, const SkDQuad& sub, double tStart, double tEnd);
bool valid() const {
return fLeft <= fRight && fTop <= fBottom;
}
};
#endif
|
