| /external/skia/src/pathops/ |
| D | SkPathOpsCurve.cpp | 12 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setConicBounds() argument
16 dRect.setBounds(dCurve, fConic, tStart, tEnd); in setConicBounds()
22 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setCubicBounds() argument
26 dRect.setBounds(dCurve, fCubic, tStart, tEnd); in setCubicBounds()
32 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setQuadBounds() argument
36 dRect.setBounds(dCurve, fQuad, tStart, tEnd); in setQuadBounds()
|
| D | SkPathOpsRect.h | 54 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
60 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd);
66 void setBounds(const SkDQuad& curve, const SkDQuad& sub, double tStart, double tEnd);
|
| D | SkOpCoincidence.h | 102 double tStart, double tEnd,
112 double tStart, double tEnd,
|
| D | SkOpCoincidence.cpp | 59 static void t_range(const SkOpPtT* overS, const SkOpPtT* overE, double tStart, double tEnd, in t_range() argument
62 double start = 0 < denom ? tStart : tEnd; in t_range()
63 double end = 0 < denom ? tEnd : tStart; in t_range()
174 const SkOpPtT* over2s, const SkOpPtT* over2e, double tStart, double tEnd, in addIfMissing() argument
178 t_range(over1s, over1e, tStart, tEnd, coinPtTStart, coinPtTEnd, &coinTs, &coinTe); in addIfMissing()
179 t_range(over2s, over2e, tStart, tEnd, oppPtTStart, oppPtTEnd, &oppTs, &oppTe); in addIfMissing()
|
| D | SkOpAngle.cpp | 416 double tEnd = index ? rh->fComputedEnd->t() : this->fComputedEnd->t(); in endsIntersect() local
421 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
428 limited[index] = approximately_equal_orderable(t, tEnd); in endsIntersect()
674 double tEnd = angle->fEnd->t(); in loopContains() local
681 if (lStart != tEnd) { in loopContains()
|
| D | SkPathOpsDebug.cpp | 1168 static void t_range(const SkOpPtT* overS, const SkOpPtT* overE, double tStart, double tEnd, in t_range() argument
1171 double start = 0 < denom ? tStart : tEnd; in t_range()
1172 double end = 0 < denom ? tEnd : tStart; in t_range()
1205 const SkOpPtT* over2s, const SkOpPtT* over2e, double tStart, double tEnd, in debugAddIfMissing() argument
1209 t_range(over1s, over1e, tStart, tEnd, coinPtTStart, coinPtTEnd, &coinTs, &coinTe); in debugAddIfMissing()
1210 t_range(over2s, over2e, tStart, tEnd, oppPtTStart, oppPtTEnd, &oppTs, &oppTe); in debugAddIfMissing()
|
| D | SkPathOpsTSect.h | 1426 double tEnd = oCoinE.perpT(); in linesIntersect() local
1427 bool swap = tStart > tEnd; in linesIntersect()
1429 SkTSwap(tStart, tEnd); in linesIntersect()
1432 tEnd = SkTMin(tEnd, span->fEndT); in linesIntersect()
1433 if (tStart > tEnd) { in linesIntersect()
1446 if (tEnd == span->fEndT) { in linesIntersect()
1460 double tStep = tEnd - tStart; in linesIntersect()
|
| D | SkPathOpsCurve.h | 84 double tStart, double tEnd, double* topT);
|
| /external/mesa3d/src/mesa/swrast/ |
| D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ in NAME() local
190 tStart = tEnd = 0.0; in NAME()
207 tEnd = t; in NAME()
212 if (inSegment && (tEnd > tStart)) { in NAME()
214 segment(ctx, &line, NAME(plot), tStart, tEnd); in NAME()
|
| /external/skia/tests/ |
| D | PathOpsTestCommon.cpp | 143 const double tEnd = i1 < ts.count() ? ts[i1] : 1; in CubicToQuads() local
146 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
159 tStart = tEnd; in CubicToQuads()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| D | AbstractIntegrator.java | 237 final double[] y, final double[] yDot, final double tEnd) in acceptStep() argument
328 isLastStep = isLastStep || MathUtils.equals(currentT, tEnd, 1); in acceptStep()
|
| /external/skia/src/core/ |
| D | SkStroke.cpp | 214 void init(StrokeType strokeType, SkQuadConstruct* , SkScalar tStart, SkScalar tEnd);
468 SkScalar tEnd) { in init() argument
471 quadPts->init(tStart, tEnd); in init()
|