OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:endPt
(Results
1 - 12
of
12
) sorted by null
/external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticBounds.cpp
19
_Point
endPt
;
20
xy_at_t(quad, endT,
endPt
.x,
endPt
.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
);
39
bool e1in = between(cs1, e1, ce1) ||
endPt
.approximatelyEqual(fPt[i1])
40
||
endPt
.approximatelyEqual(fPt[iEnd1]);
53
bool e2in = between(cs2, e2, ce2) ||
endPt
.approximatelyEqual(fPt[i2])
54
||
endPt
.approximatelyEqual(fPt[iEnd2]);
61
fPt[i1] =
endPt
;
68
fPt[iEnd1] =
endPt
;
89
insertCoincident(e1, e2,
endPt
);
[
all
...]
Intersections.h
69
const _Point& startPt, const _Point&
endPt
);
139
void remove(double one, double two, const _Point& startPt, const _Point&
endPt
);
QuadraticImplicit.cpp
86
const _Point*
endPt
[2];
92
endPt
[opp - 1] = &q1[end];
94
double origX =
endPt
[0]->x;
95
double origY =
endPt
[0]->y;
96
double adj =
endPt
[1]->x - origX;
97
double opp =
endPt
[1]->y - origY;
/external/chromium_org/third_party/skia/gm/
degeneratesegments.cpp
119
SkPoint
endPt
= startPt + SkPoint::Make(40*SK_Scalar1, 0);
120
path.lineTo(
endPt
);
121
return
endPt
;
126
SkPoint
endPt
= moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
128
path.lineTo(
endPt
);
129
return
endPt
;
134
SkPoint
endPt
= moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
136
path.lineTo(
endPt
);
138
return
endPt
;
143
SkPoint
endPt
= startPt + SkPoint::Make(40*SK_Scalar1, 0)
[
all
...]
/external/chromium_org/third_party/skia/src/pathops/
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);
480
static void TrackOutsidePair(SkTArray<SkPoint, true>* outsideTs, const SkPoint&
endPt
,
SkDQuadIntersection.cpp
87
const SkDPoint*
endPt
[2];
93
endPt
[opp - 1] = &q1[end];
95
double origX =
endPt
[0]->fX;
96
double origY =
endPt
[0]->fY;
97
double adj =
endPt
[1]->fX - origX;
98
double opp =
endPt
[1]->fY - origY;
SkOpContour.cpp
519
const SkPoint*
endPt
= &coincidence.fPts[0][1];
523
SkTSwap(startPt,
endPt
);
532
const SkPoint& oMatchStartPt = cancel ? *
endPt
: *startPt;
543
(void) other.joinCoincidence(&thisOne, endT, *
endPt
, -step, cancel);
567
const SkPoint*
endPt
= &coincidence.fPts[0][1];
571
SkTSwap<const SkPoint*>(startPt,
endPt
);
585
thisOne.addTCancel(*startPt, *
endPt
, &other);
587
success = thisOne.addTCoincident(*startPt, *
endPt
, endT, &other);
SkOpSegment.cpp
212
void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint&
endPt
,
224
} while (
endPt
!= other->fTs[oIndex].fPt && oIndex < oCount);
235
SkASSERT(other->fTs[oIndex].fT < 1 ||
endPt
!= *oNextPt);
236
} while (
endPt
== *oNextPt);
290
void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint&
endPt
,
351
} while (
endPt
!= nextPt);
690
startPt
endPt
test/oTest first pos test/oTest final pos
692
void SkOpSegment::addTCancel(const SkPoint& startPt, const SkPoint&
endPt
, SkOpSegment* other) {
761
oFoundEnd |=
endPt
== oTest->fPt;
764
} while (
endPt
!= test->fPt && test->fT < 1)
[
all
...]
SkDCubicIntersection.cpp
438
const SkDPoint*
endPt
[3];
441
endPt
[opp - 1] = &c1[end];
444
double origX =
endPt
[triTest]->fX;
445
double origY =
endPt
[triTest]->fY;
450
double adj =
endPt
[oppTest]->fX - origX;
451
double opp =
endPt
[oppTest]->fY - origY;
SkOpAngle.cpp
439
SkDPoint
endPt
;
440
endPt
.set(rh.fSegment->pts()[rh.fStart < rh.fEnd ? rPts : 0]);
441
SkDVector m1 =
endPt
- fCurvePart[0];
445
SkDPoint
endPt
;
446
endPt
.set(fSegment->pts()[fStart < fEnd ? lPts : 0]);
447
SkDVector m0 =
endPt
- fCurvePart[0];
[
all
...]
/external/chromium_org/third_party/skia/src/gpu/
GrAAConvexPathRenderer.cpp
50
const SkPoint&
endPt
() const {
71
p0 = segments[0].
endPt
();
77
pj = segments[1].
endPt
() - p0;
80
const SkPoint pj = segments[i + 1].
endPt
() - p0;
95
const SkPoint& pt = segments[i].
endPt
();
137
const SkPoint* prevPt = &sega.
endPt
();
381
verts[*v + 0].fPos = sega.
endPt
();
406
verts[*v + 1].fPos = sega.
endPt
();
443
SkPoint qpts[] = {sega.
endPt
(), segb.fPts[0], segb.fPts[1]};
Completed in 245 milliseconds