Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:ptAtT
(Results
1 - 25
of
38
) sorted by relevance
1
2
/third_party/skia/tests/
H
A
D
PathOpsCubicIntersectionTest.cpp
61
SkDPoint xy1 = c1.
ptAtT
(tt1);
in standardTestCases()
63
SkDPoint xy2 = c2.
ptAtT
(tt2);
in standardTestCases()
421
xy1 = c1.
ptAtT
(tt1);
in oneOff()
423
xy2 = c2.
ptAtT
(tt2);
in oneOff()
517
SkDPoint xy1 = c1.
ptAtT
(tt1);
in CubicIntersection_RandTest()
519
SkDPoint xy2 = c2.
ptAtT
(tt2);
in CubicIntersection_RandTest()
536
t1[0] = c1.
ptAtT
(t1Seed - t1Step);
in intersectionFinder()
537
t1[1] = c1.
ptAtT
(t1Seed);
in intersectionFinder()
538
t1[2] = c1.
ptAtT
(t1Seed + t1Step);
in intersectionFinder()
539
t2[0] = c2.
ptAtT
(t2See
in intersectionFinder()
[all...]
H
A
D
PathOpsQuadIntersectionTest.cpp
44
SkDPoint xy1 = quad1.
ptAtT
(tt1);
in standardTestCases()
46
SkDPoint xy2 = quad2.
ptAtT
(tt2);
in standardTestCases()
348
SkDPoint xy1 = quad1.
ptAtT
(tt1);
in oneOffTest1()
350
SkDPoint xy2 = quad2.
ptAtT
(tt2);
in oneOffTest1()
403
SkDPoint pt1 = quad1.
ptAtT
(tt1);
in coincidentTestOne()
404
SkDPoint pt2 = quad2.
ptAtT
(tt2);
in coincidentTestOne()
428
t1[0] = quad1.
ptAtT
(t1Seed - t1Step);
in intersectionFinder()
429
t1[1] = quad1.
ptAtT
(t1Seed);
in intersectionFinder()
430
t1[2] = quad1.
ptAtT
(t1Seed + t1Step);
in intersectionFinder()
431
t2[0] = quad2.
ptAtT
(t2See
in intersectionFinder()
[all...]
H
A
D
PathOpsCubicLineIntersectionTest.cpp
155
SkDPoint xy1 = cubic.
ptAtT
(tt1);
in testOne()
157
SkDPoint xy2 = line.
ptAtT
(tt2);
in testOne()
166
SkDPoint prev = cubic.
ptAtT
(cubicT * 2 - 1);
in testOne()
167
SkDPoint sect = cubic.
ptAtT
(cubicT);
in testOne()
170
SkDPoint prevL = line.
ptAtT
(i[1][0] - 0.0000007);
in testOne()
172
SkDPoint nextL = line.
ptAtT
(i[1][0] + 0.0000007);
in testOne()
H
A
D
PathOpsCubicLineIntersectionIdeas.cpp
59
SkDPoint cubicAtT = cubic.
ptAtT
(t);
in binary_search()
76
SkDPoint lessPt = cubic.
ptAtT
(t - lastStep);
in binary_search()
85
SkDPoint morePt = cubic.
ptAtT
(t + lastStep);
in binary_search()
157
SkDPoint pt = cubic.
ptAtT
(t);
in DEF_TEST()
173
SkDPoint calcPt = cubic.
ptAtT
(t);
in DEF_TEST()
266
SkDPoint calcPt = cubic.
ptAtT
(t);
H
A
D
PathOpsQuadLineIntersectionTest.cpp
96
SkDPoint quadXY = quad.
ptAtT
(quadT);
in testOneOffs()
98
SkDPoint lineXY = line.
ptAtT
(lineT);
in testOneOffs()
141
SkDPoint t1 = quad.
ptAtT
(tt1);
in DEF_TEST()
144
SkDPoint t2 = line.
ptAtT
(tt2);
in DEF_TEST()
H
A
D
PathOpsConicLineIntersectionTest.cpp
86
SkDPoint conicXY = conic.
ptAtT
(conicT);
in testOneOffs()
88
SkDPoint lineXY = line.
ptAtT
(lineT);
in testOneOffs()
136
SkDPoint t1 = conic.
ptAtT
(tt1);
in DEF_TEST()
139
SkDPoint t2 = line.
ptAtT
(tt2);
in DEF_TEST()
H
A
D
PathOpsAngleIdeas.cpp
107
const SkDVector& pt = quad.
ptAtT
(t) - quad[0];
in quadAngle()
153
SkDVector m0 = quad1.
ptAtT
(0.5) - quad1[0];
in checkParallel()
154
SkDVector m1 = quad2.
ptAtT
(0.5) - quad2[0];
in checkParallel()
197
SkDVector m0 = quad1.
ptAtT
(0.5) - quad1[0];
198
SkDVector m1 = quad2.
ptAtT
(0.5) - quad2[0];
302
SkDPoint pt1 = quad1.
ptAtT
(tRange.t1);
in bruteMinT()
307
SkDPoint pt2 = quad2.
ptAtT
(tRange.t2);
in bruteMinT()
358
SkDPoint pt1 = quad1.
ptAtT
(tRange.t1);
in bruteMinT()
359
SkDPoint pt2 = quad2.
ptAtT
(tRange.t2);
in bruteMinT()
486
midSpokes[index] = q.
ptAtT
(0.
in testQuadAngles()
[all...]
H
A
D
PathOpsQuadLineIntersectionThreadedTest.cpp
62
SkDPoint quadXY = quad.
ptAtT
(quadT);
in testLineIntersect()
64
SkDPoint lineXY = line.
ptAtT
(lineT);
in testLineIntersect()
97
SkDPoint xy = quad.
ptAtT
(tIndex / 4.0);
in testQuadLineIntersectMain()
H
A
D
PathOpsConicQuadIntersectionTest.cpp
59
SkDPoint xy1 = conic.
ptAtT
(tt1);
in conicQuadIntersection()
61
SkDPoint xy2 = quad.
ptAtT
(tt2);
in conicQuadIntersection()
H
A
D
PathOpsCubicQuadIntersectionTest.cpp
80
SkDPoint xy1 = cubic.
ptAtT
(tt1);
in cubicQuadIntersection()
82
SkDPoint xy2 = quad.
ptAtT
(tt2);
in cubicQuadIntersection()
H
A
D
PathOpsCubicConicIntersectionTest.cpp
70
SkDPoint xy1 = cubic.
ptAtT
(tt1);
in cubicConicIntersection()
72
SkDPoint xy2 = conic.
ptAtT
(tt2);
in cubicConicIntersection()
H
A
D
PathOpsLineIntersectionTest.cpp
90
SkDPoint result1 = line1.
ptAtT
(ts[0][i]);
in check_results()
91
SkDPoint result2 = line2.
ptAtT
(ts[1][i]);
in check_results()
97
result2 = line2.
ptAtT
(ts[1][i ^ 1]);
in check_results()
H
A
D
PathOpsAngleTest.cpp
42
SkDPoint dPt = line.
ptAtT
(t);
in DEF_TEST()
76
SkDPoint dPt = line.
ptAtT
(t);
in DEF_TEST()
78
SkDPoint qPt = line.
ptAtT
(t2);
in DEF_TEST()
80
SkDPoint qPt2 = line.
ptAtT
(t3);
in DEF_TEST()
H
A
D
PathOpsDLineTest.cpp
30
SkDPoint mid = line.
ptAtT
(.5);
in DEF_TEST()
/third_party/skia/src/pathops/
H
A
D
SkDCubicLineIntersection.cpp
101
SkDPoint cubicMidPt = fCubic.
ptAtT
(cubicMidT);
in checkCoincident()
133
SkDPoint calcPt = c.
ptAtT
(roots[index]);
in intersectRay()
173
SkDPoint calcPt = c.
ptAtT
(roots[index]);
in HorizontalIntersect()
193
SkDPoint pt = { fCubic.
ptAtT
(cubicT).fX, axisIntercept };
in horizontalIntersect()
217
SkDPoint cubicMidPt = fCubic.
ptAtT
(cubicMidT);
in uniqueAnswer()
223
SkDPoint cPt = fCubic.
ptAtT
(cubicT);
in uniqueAnswer()
236
SkDPoint calcPt = c.
ptAtT
(roots[index]);
in VerticalIntersect()
256
SkDPoint pt = { axisIntercept, fCubic.
ptAtT
(cubicT).fY };
in verticalIntersect()
367
SkDPoint xy = fCubic.
ptAtT
(t);
in findLineT()
385
SkDPoint lPt = fLine.
ptAtT
(l
in pinTs()
[all...]
H
A
D
SkDConicLineIntersection.cpp
42
SkDPoint conicMidPt = fConic.
ptAtT
(conicMidT);
in checkCoincident()
81
SkDPoint pt = fConic.
ptAtT
(conicT);
in horizontalIntersect()
110
SkDEBUGCODE(SkDPoint conicPt = fConic.
ptAtT
(conicT));
in intersect()
111
SkDEBUGCODE(SkDPoint linePt = fLine->
ptAtT
(lineT));
in intersect()
159
SkDPoint pt = fConic.
ptAtT
(conicT);
in verticalIntersect()
272
SkDPoint xy = fConic.
ptAtT
(t);
in findLineT()
291
*pt = (*fLine).
ptAtT
(lT);
in pinTs()
293
*pt = fConic.
ptAtT
(qT);
in pinTs()
327
SkDPoint conicMidPt = fConic.
ptAtT
(conicMidT);
in uniqueAnswer()
333
SkDPoint qPt = fConic.
ptAtT
(conic
in uniqueAnswer()
[all...]
H
A
D
SkPathOpsCurve.h
105
return line.
ptAtT
(t);
in dline_xy_at_t()
111
return quad.
ptAtT
(t);
in dquad_xy_at_t()
117
return conic.
ptAtT
(t);
in dconic_xy_at_t()
123
return cubic.
ptAtT
(t);
in dcubic_xy_at_t()
135
return c.fLine.
ptAtT
(t);
in ddline_xy_at_t()
139
return c.fQuad.
ptAtT
(t);
in ddquad_xy_at_t()
143
return c.fConic.
ptAtT
(t);
in ddconic_xy_at_t()
147
return c.fCubic.
ptAtT
(t);
in ddcubic_xy_at_t()
265
SkDPoint dst[2] = { line.
ptAtT
(startT), line.
ptAtT
(end
in line_is_vertical()
[all...]
H
A
D
SkDQuadLineIntersection.cpp
120
SkDPoint quadMidPt = fQuad.
ptAtT
(quadMidT);
in checkCoincident()
207
SkDPoint pt = fQuad.
ptAtT
(quadT);
in horizontalIntersect()
231
SkDPoint quadMidPt = fQuad.
ptAtT
(quadMidT);
in uniqueAnswer()
237
SkDPoint qPt = fQuad.
ptAtT
(quadT);
in uniqueAnswer()
263
SkDPoint pt = fQuad.
ptAtT
(quadT);
in verticalIntersect()
372
SkDPoint xy = fQuad.
ptAtT
(t);
in findLineT()
391
*pt = (*fLine).
ptAtT
(lT);
in pinTs()
393
*pt = fQuad.
ptAtT
(qT);
in pinTs()
447
fPt[index] = quad.
ptAtT
(fT[0][index]);
in intersectRay()
H
A
D
SkPathOpsRect.cpp
26
add(curve.
ptAtT
(t));
in setBounds()
43
add(curve.
ptAtT
(t));
in setBounds()
60
add(curve.
ptAtT
(t));
in setBounds()
H
A
D
SkPathOpsQuad.h
91
SkDPoint
ptAtT
(double t) const;
176
SkDPoint
ptAtT
(double t) const override { return fQuad.
ptAtT
(t); }
H
A
D
SkPathOpsLine.cpp
9
SkDPoint SkDLine::
ptAtT
(double t) const {
in ptAtT()
function in SkDLine
48
SkDPoint realPt =
ptAtT
(t);
in nearPoint()
72
SkDPoint realPt =
ptAtT
(t);
in nearRay()
H
A
D
SkPathOpsConic.h
99
SkDPoint
ptAtT
(double t) const;
185
SkDPoint
ptAtT
(double t) const override { return fConic.
ptAtT
(t); }
H
A
D
SkPathOpsCubic.cpp
35
SkDPoint cubicAtT =
ptAtT
(t);
in binarySearch()
40
SkDPoint lessPt =
ptAtT
(priorT);
in binarySearch()
59
SkDPoint morePt =
ptAtT
(nextT);
in binarySearch()
70
SkDPoint testAtT =
ptAtT
(t);
in binarySearch()
274
SkDPoint pt = cubic.
ptAtT
(inflectionTs[index]);
in ComplexBreak()
281
SkDPoint pt = cubic.
ptAtT
(maxCurvature[index]);
in ComplexBreak()
579
SkDPoint SkDCubic::
ptAtT
(double t) const {
729
SkDPoint mid = dCurve.
ptAtT
(t);
H
A
D
SkPathOpsCubic.h
90
SkDPoint
ptAtT
(double t) const;
232
SkDPoint
ptAtT
(double t) const override { return fCubic.
ptAtT
(t); }
H
A
D
SkPathOpsAsWinding.cpp
121
result = quad.
ptAtT
(t).asSkPoint();
in left_edge()
134
result = conic.
ptAtT
(t).asSkPoint();
in left_edge()
149
SkPoint temp = cubic.
ptAtT
(tValues[index]).asSkPoint();
in left_edge()
157
result = cubic.
ptAtT
(t).asSkPoint();
in left_edge()
Completed in 21 milliseconds
1
2