| /external/skia/src/pathops/ |
| D | SkPathOpsCurve.cpp | 63 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setConicBounds() argument
67 dRect.setBounds(dCurve, fConic, tStart, tEnd); in setConicBounds()
73 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setCubicBounds() argument
77 dRect.setBounds(dCurve, fCubic, tStart, tEnd); in setCubicBounds()
83 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setQuadBounds() argument
87 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 | 252 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg,
273 double tStart, double tEnd,
|
| D | SkOpAngle.cpp | 448 double tEnd = index ? rh->fComputedEnd->t() : this->fComputedEnd->t(); in endsIntersect() local
453 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
460 limited[index] = approximately_equal_orderable(t, tEnd); in endsIntersect()
702 double tEnd = angle->fEnd->t(); in loopContains() local
709 if (lStart != tEnd) { in loopContains()
|
| D | SkOpCoincidence.cpp | 614 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, bool* added in addIfMissing() argument
616 SkASSERT(tStart < tEnd); in addIfMissing()
619 SkASSERT(between(over1s->fT, tEnd, over1e->fT)); in addIfMissing()
622 SkASSERT(between(over2s->fT, tEnd, over2e->fT)); in addIfMissing()
631 coinTe = TRange(over1s, tEnd, coinSeg SkDEBUGPARAMS(over1e)); in addIfMissing()
636 oppTe = TRange(over2s, tEnd, oppSeg SkDEBUGPARAMS(over2e)); in addIfMissing()
|
| D | SkPathOpsTSect.h | 1509 double tEnd = oCoinE.perpT(); in linesIntersect() local
1510 bool swap = tStart > tEnd; in linesIntersect()
1512 SkTSwap(tStart, tEnd); in linesIntersect()
1515 tEnd = SkTMin(tEnd, span->fEndT); in linesIntersect()
1516 if (tStart > tEnd) { in linesIntersect()
1529 if (tEnd == span->fEndT) { in linesIntersect()
1543 double tStep = tEnd - tStart; in linesIntersect()
|
| D | SkPathOpsDebug.cpp | 1721 … double tStart, double tEnd, const SkOpSegment* coinSeg, const SkOpSegment* oppSeg, bool* added, in debugAddIfMissing() argument
1723 SkASSERT(tStart < tEnd); in debugAddIfMissing()
1726 SkASSERT(between(over1s->fT, tEnd, over1e->fT)); in debugAddIfMissing()
1729 SkASSERT(between(over2s->fT, tEnd, over2e->fT)); in debugAddIfMissing()
1738 coinTe = TRange(over1s, tEnd, coinSeg SkDEBUGPARAMS(over1e)); in debugAddIfMissing()
1743 oppTe = TRange(over2s, tEnd, oppSeg SkDEBUGPARAMS(over2e)); in debugAddIfMissing()
|
| D | SkPathOpsCurve.h | 100 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 | 216 void init(StrokeType strokeType, SkQuadConstruct* , SkScalar tStart, SkScalar tEnd);
480 SkScalar tEnd) { in init() argument
483 quadPts->init(tStart, tEnd); in init()
|