OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:minT
(Results
1 - 10
of
10
) sorted by null
/external/chromium_org/third_party/skia/src/utils/
SkCubicInterval.cpp
17
SkScalar
minT
= 0;
22
t = SkScalarAve(
minT
, maxT);
29
minT
= t;
/external/skia/src/utils/
SkCubicInterval.cpp
17
SkScalar
minT
= 0;
22
t = SkScalarAve(
minT
, maxT);
29
minT
= t;
/external/chromium_org/third_party/skia/experimental/Intersection/
CubicBezierClip_Test.cpp
27
double
minT
= 0;
29
bezier_clip(reduce1, reduce2,
minT
, maxT);
QuadraticBezierClip_Test.cpp
31
double
minT
= 0;
33
bezier_clip(quad1, quad2,
minT
, maxT);
40
double
minT
= 0;
42
bezier_clip(quad1, quad2,
minT
, maxT);
59
double
minT
= 0;
61
bezier_clip(reduce1, reduce2,
minT
, maxT);
CubicConvexHull.cpp
82
double
minT
, maxT;
83
if (!bezier_clip(smaller, larger,
minT
, maxT)) {
84
if (
minT
== maxT) {
87
minT2 = interp(minT2, maxT2,
minT
);
89
minT1 = interp(minT1, maxT1,
minT
);
102
double newMinT1 = interp(minT1, maxT1,
minT
);
114
double newMinT2 = interp(minT2, maxT2,
minT
);
QuadraticIntersection.cpp
66
double
minT
, maxT;
67
if (!bezier_clip(smaller, larger,
minT
, maxT)) {
68
if (approximately_equal(
minT
, maxT)) {
72
largeT = interp(minT2, maxT2,
minT
);
83
smallT = interp(minT1, maxT1,
minT
);
101
double newMinT1 = interp(minT1, maxT1,
minT
);
112
double newMinT2 = interp(minT2, maxT2,
minT
);
/external/skia/experimental/Intersection/
CubicBezierClip_Test.cpp
27
double
minT
= 0;
29
bezier_clip(reduce1, reduce2,
minT
, maxT);
QuadraticBezierClip_Test.cpp
31
double
minT
= 0;
33
bezier_clip(quad1, quad2,
minT
, maxT);
40
double
minT
= 0;
42
bezier_clip(quad1, quad2,
minT
, maxT);
59
double
minT
= 0;
61
bezier_clip(reduce1, reduce2,
minT
, maxT);
CubicConvexHull.cpp
82
double
minT
, maxT;
83
if (!bezier_clip(smaller, larger,
minT
, maxT)) {
84
if (
minT
== maxT) {
87
minT2 = interp(minT2, maxT2,
minT
);
89
minT1 = interp(minT1, maxT1,
minT
);
102
double newMinT1 = interp(minT1, maxT1,
minT
);
114
double newMinT2 = interp(minT2, maxT2,
minT
);
QuadraticIntersection.cpp
66
double
minT
, maxT;
67
if (!bezier_clip(smaller, larger,
minT
, maxT)) {
68
if (approximately_equal(
minT
, maxT)) {
72
largeT = interp(minT2, maxT2,
minT
);
83
smallT = interp(minT1, maxT1,
minT
);
101
double newMinT1 = interp(minT1, maxT1,
minT
);
112
double newMinT2 = interp(minT2, maxT2,
minT
);
Completed in 199 milliseconds