OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:kPointCount
(Results
1 - 11
of
11
) sorted by null
/external/skia/tests/
PathOpsTestCommon.h
16
static const int
kPointCount
= 3;
17
SkDPoint fPts[
kPointCount
];
26
static const int
kPointCount
= 4;
27
SkDPoint fPts[
kPointCount
];
/external/skqp/tests/
PathOpsTestCommon.h
16
static const int
kPointCount
= 3;
17
SkDPoint fPts[
kPointCount
];
26
static const int
kPointCount
= 4;
27
SkDPoint fPts[
kPointCount
];
/external/dynamic_depth/internal/dynamic_depth/
point_cloud.cc
17
const char
kPointCount
[] = "PointCount";
103
DynamicDepthConst::PointCloud(),
kPointCount
,
129
if (!deserializer.ParseInt(DynamicDepthConst::PointCloud(),
kPointCount
,
/external/skia/src/pathops/
SkPathOpsConic.h
14
static const int
kPointCount
= 3;
15
static const int kPointLast =
kPointCount
- 1;
48
const SkDConic& set(const SkPoint pts[
kPointCount
], SkScalar weight
97
static int pointCount() { return
kPointCount
; }
112
static SkDConic SubDivide(const SkPoint a[
kPointCount
], SkScalar weight, double t1, double t2) {
121
static SkDPoint SubDivide(const SkPoint pts[
kPointCount
], SkScalar weight,
183
int pointCount() const override { return SkDConic::
kPointCount
; }
SkPathOpsCubic.h
18
static const int
kPointCount
= 4;
19
static const int kPointLast =
kPointCount
- 1;
43
const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
44
SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
52
int convexHull(char order[
kPointCount
]) const;
68
static int FindInflections(const SkPoint a[
kPointCount
], double tValues[2]) {
87
void otherPts(int index, const SkDPoint* o1Pts[
kPointCount
- 1]) const;
88
static int pointCount() { return
kPointCount
; }
110
const SkDCubic& set(const SkPoint pts[
kPointCount
]
123
static SkDCubic SubDivide(const SkPoint a[
kPointCount
], double t1, double t2)
[
all
...]
SkPathOpsQuad.h
23
static const int
kPointCount
= 3;
24
static const int kPointLast =
kPointCount
- 1;
27
SkDPoint fPts[
kPointCount
];
53
const SkDQuad& set(const SkPoint pts[
kPointCount
]
62
const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
63
SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
89
static int pointCount() { return
kPointCount
; }
98
static SkDQuad SubDivide(const SkPoint a[
kPointCount
], double t1, double t2) {
104
static SkDPoint SubDivide(const SkPoint pts[
kPointCount
], const SkDPoint& a, const SkDPoint& c,
174
int pointCount() const override { return SkDQuad::
kPointCount
; }
[
all
...]
/external/skqp/src/pathops/
SkPathOpsConic.h
14
static const int
kPointCount
= 3;
15
static const int kPointLast =
kPointCount
- 1;
48
const SkDConic& set(const SkPoint pts[
kPointCount
], SkScalar weight
97
static int pointCount() { return
kPointCount
; }
112
static SkDConic SubDivide(const SkPoint a[
kPointCount
], SkScalar weight, double t1, double t2) {
121
static SkDPoint SubDivide(const SkPoint pts[
kPointCount
], SkScalar weight,
183
int pointCount() const override { return SkDConic::
kPointCount
; }
SkPathOpsCubic.h
18
static const int
kPointCount
= 4;
19
static const int kPointLast =
kPointCount
- 1;
43
const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
44
SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
52
int convexHull(char order[
kPointCount
]) const;
68
static int FindInflections(const SkPoint a[
kPointCount
], double tValues[2]) {
87
void otherPts(int index, const SkDPoint* o1Pts[
kPointCount
- 1]) const;
88
static int pointCount() { return
kPointCount
; }
110
const SkDCubic& set(const SkPoint pts[
kPointCount
]
123
static SkDCubic SubDivide(const SkPoint a[
kPointCount
], double t1, double t2)
[
all
...]
SkPathOpsQuad.h
23
static const int
kPointCount
= 3;
24
static const int kPointLast =
kPointCount
- 1;
27
SkDPoint fPts[
kPointCount
];
53
const SkDQuad& set(const SkPoint pts[
kPointCount
]
62
const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
63
SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n <
kPointCount
); return fPts[n]; }
89
static int pointCount() { return
kPointCount
; }
98
static SkDQuad SubDivide(const SkPoint a[
kPointCount
], double t1, double t2) {
104
static SkDPoint SubDivide(const SkPoint pts[
kPointCount
], const SkDPoint& a, const SkDPoint& c,
174
int pointCount() const override { return SkDQuad::
kPointCount
; }
[
all
...]
/external/skia/src/core/
SkGeometry.h
449
kPointCount
= 1 + 2 * kQuadCount,
451
SkAutoSTMalloc<
kPointCount
, SkPoint> fStorage;
/external/skqp/src/core/
SkGeometry.h
449
kPointCount
= 1 + 2 * kQuadCount,
451
SkAutoSTMalloc<
kPointCount
, SkPoint> fStorage;
Completed in 455 milliseconds