OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:startPt
(Results
1 - 7
of
7
) sorted by null
/external/chromium_org/third_party/skia/gm/
degeneratesegments.cpp
40
static SkPoint AddMove(SkPath& path, SkPoint&
startPt
) {
41
SkPoint moveToPt =
startPt
+ SkPoint::Make(0, 10*SK_Scalar1);
46
static SkPoint AddMoveClose(SkPath& path, SkPoint&
startPt
) {
47
SkPoint moveToPt =
startPt
+ SkPoint::Make(0, 10*SK_Scalar1);
53
static SkPoint AddDegenLine(SkPath& path, SkPoint&
startPt
) {
54
path.lineTo(
startPt
);
55
return
startPt
;
58
static SkPoint AddMoveDegenLine(SkPath& path, SkPoint&
startPt
) {
59
SkPoint moveToPt =
startPt
+ SkPoint::Make(0, 10*SK_Scalar1);
65
static SkPoint AddMoveDegenLineClose(SkPath& path, SkPoint&
startPt
) {
[
all
...]
/external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticBounds.cpp
17
_Point
startPt
;
18
xy_at_t(quad, startT,
startPt
.x,
startPt
.y);
21
return
startPt
.x <= endPt.x ? startT : endT;
Intersections.cpp
12
const _Point&
startPt
, const _Point& endPt) {
14
remove(s2, e2,
startPt
, endPt);
16
remove(s1, e1,
startPt
, endPt);
37
bool s1in = between(cs1, s1, ce1) ||
startPt
.approximatelyEqual(fPt[i1])
38
||
startPt
.approximatelyEqual(fPt[iEnd1]);
51
bool s2in = between(cs2, s2, ce2) ||
startPt
.approximatelyEqual(fPt[i2])
52
||
startPt
.approximatelyEqual(fPt[iEnd2]);
58
fPt[i1] =
startPt
;
65
fPt[iEnd1] =
startPt
;
88
insertCoincident(s1, s2,
startPt
);
[
all
...]
Intersections.h
69
const _Point&
startPt
, const _Point& endPt);
139
void remove(double one, double two, const _Point&
startPt
, const _Point& endPt);
/external/chromium_org/third_party/skia/src/pathops/
SkOpContour.cpp
110
const SkPoint&
startPt
= coincidence.fPts[0][startSwapped];
114
|| thisOne.isMissing(startT,
startPt
) || other.isMissing(oEndT,
startPt
)) {
115
thisOne.addTPair(startT, &other, oEndT, true,
startPt
,
126
|| thisOne.isMissing(startT,
startPt
) || other.isMissing(oStartT,
startPt
)) {
127
thisOne.addTPair(startT, &other, oStartT, true,
startPt
,
518
const SkPoint*
startPt
= &coincidence.fPts[0][0];
523
SkTSwap(
startPt
, endPt);
532
const SkPoint& oMatchStartPt = cancel ? *endPt : *
startPt
;
[
all
...]
SkOpSegment.h
286
void addTCancel(const SkPoint&
startPt
, const SkPoint& endPt, SkOpSegment* other);
287
bool addTCoincident(const SkPoint&
startPt
, const SkPoint& endPt, double endT,
315
int step, SkPoint*
startPt
, SkPoint* endPt, double* endT) const;
401
void addCancelOutsides(const SkPoint&
startPt
, const SkPoint& endPt, SkOpSegment* other);
402
void addCoinOutsides(const SkPoint&
startPt
, const SkPoint& endPt, SkOpSegment* other);
474
void setCoincidentRange(const SkPoint&
startPt
, const SkPoint& endPt, SkOpSegment* other);
481
const SkPoint&
startPt
);
482
static void TrackOutside(SkTArray<SkPoint, true>* outsideTs, const SkPoint&
startPt
);
SkOpSegment.cpp
212
void SkOpSegment::addCancelOutsides(const SkPoint&
startPt
, const SkPoint& endPt,
220
} while (
startPt
!= fTs[tIndex].fPt && tIndex < tCount);
229
SkASSERT(fTs[tIndex].fT < 1 ||
startPt
!= *nextPt);
230
} while (
startPt
== *nextPt);
290
void SkOpSegment::addCoinOutsides(const SkPoint&
startPt
, const SkPoint& endPt,
292
// walk this to
startPt
293
// walk other to
startPt
299
} while (
startPt
!= fTs[tIndex].fPt);
304
if (
startPt
!= span.fPt) {
307
if (span.fOther == other && span.fPt ==
startPt
) {
[
all
...]
Completed in 268 milliseconds