| /external/perfetto/ui/src/frontend/drag/ |
| D | border_drag_strategy.ts | 28 let tEnd =
30 if (tStart > tEnd) {
32 [tEnd, tStart] = [tStart, tEnd];
34 super.updateGlobals(tStart, tEnd);
36 [this.timeScale.timeToPx(tStart), this.timeScale.timeToPx(tEnd)];
|
| D | drag_strategy.ts | 25 protected updateGlobals(tStart: number, tEnd: number) {
26 const vizTime = new TimeSpan(tStart, tEnd);
|
| D | outer_drag_strategy.ts | 23 const tEnd = Math.max(dragBeginTime, dragEndTime); constant
24 super.updateGlobals(tStart, tEnd);
|
| D | inner_drag_strategy.ts | 27 const tEnd = this.timeScale.pxToTime(this.pixelBounds[1] + move); constant
28 super.updateGlobals(tStart, tEnd);
|
| /external/perfetto/ui/src/tracks/chrome_slices/ |
| D | frontend.ts | 80 let tEnd = data.ends[i];
89 tEnd = visibleWindowTime.end;
92 const rect = this.getSliceRect(tStart, tEnd, depth);
210 let tEnd = data.ends[i];
212 tEnd = globals.frontendLocalState.visibleWindowTime.end;
214 if (tStart <= t && t <= tEnd) {
258 getSliceRect(tStart: number, tEnd: number, depth: number): SliceRect
263 const right = Math.min(timeScale.timeToPx(tEnd), pxEnd);
270 !(tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end)
|
| /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 | 56 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
62 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd);
68 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 | 525 double tEnd = index ? rh->fComputedEnd->t() : this->fComputedEnd->t(); in endsIntersect() local
530 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
537 limited[index] = approximately_equal_orderable(t, tEnd); in endsIntersect()
804 double tEnd = angle->fEnd->t(); in loopContains() local
811 if (lStart != tEnd) { in loopContains()
|
| D | SkPathOpsTSect.cpp | 1161 double tEnd = oCoinE.perpT(); in linesIntersect() local
1162 bool swap = tStart > tEnd; in linesIntersect()
1165 swap(tStart, tEnd); in linesIntersect()
1168 tEnd = std::min(tEnd, span->fEndT); in linesIntersect()
1169 if (tStart > tEnd) { in linesIntersect()
1182 if (tEnd == span->fEndT) { in linesIntersect()
1196 double tStep = tEnd - tStart; in linesIntersect()
|
| /external/skqp/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 | 56 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
62 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd);
68 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 | 525 double tEnd = index ? rh->fComputedEnd->t() : this->fComputedEnd->t(); in endsIntersect() local
530 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
537 limited[index] = approximately_equal_orderable(t, tEnd); in endsIntersect()
804 double tEnd = angle->fEnd->t(); in loopContains() local
811 if (lStart != tEnd) { in loopContains()
|
| D | SkPathOpsTSect.cpp | 1160 double tEnd = oCoinE.perpT(); in linesIntersect() local
1161 bool swap = tStart > tEnd; in linesIntersect()
1164 swap(tStart, tEnd); in linesIntersect()
1167 tEnd = SkTMin(tEnd, span->fEndT); in linesIntersect()
1168 if (tStart > tEnd) { in linesIntersect()
1181 if (tEnd == span->fEndT) { in linesIntersect()
1195 double tStep = tEnd - tStart; in linesIntersect()
|
| D | SkOpCoincidence.cpp | 620 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, bool* added in addIfMissing() argument
622 SkASSERT(tStart < tEnd); in addIfMissing()
625 SkASSERT(between(over1s->fT, tEnd, over1e->fT)); in addIfMissing()
628 SkASSERT(between(over2s->fT, tEnd, over2e->fT)); in addIfMissing()
637 coinTe = TRange(over1s, tEnd, coinSeg SkDEBUGPARAMS(over1e)); in addIfMissing()
643 oppTe = TRange(over2s, tEnd, oppSeg SkDEBUGPARAMS(over2e)); in addIfMissing()
|
| /external/perfetto/ui/src/frontend/ |
| D | tickmark_panel.ts | 42 const tEnd = data.tsEnds[i]; constant
43 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) {
48 const rectEnd = timeScale.timeToPx(tEnd) + TRACK_SHELL_WIDTH;
|
| D | viewer_page.ts | 107 let tEnd = vizTime.end + tDelta; variable
110 tEnd = tStart + origDelta;
111 } else if (tEnd > traceTime.endSec) {
112 tEnd = traceTime.endSec;
113 tStart = tEnd - origDelta;
115 frontendLocalState.updateVisibleTime(new TimeSpan(tStart, tEnd));
|
| /external/perfetto/ui/src/tracks/thread_state/ |
| D | frontend.ts | 74 const tEnd = data.ends[i]; constant
76 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) {
83 const rectEnd = timeScale.timeToPx(tEnd);
114 timeScale.timeToPx(tEnd));
|
| /external/perfetto/ui/src/tracks/cpu_slices/ |
| D | frontend.ts | 92 const tEnd = data.ends[i]; constant
96 const rectEnd = timeScale.timeToPx(tEnd);
157 const tEnd = data.ends[startIndex]; constant
161 const rectEnd = timeScale.timeToPx(tEnd);
241 const tEnd = data.ends[i]; constant
243 if (tStart <= t && t <= tEnd) {
|
| /external/mesa3d/src/mesa/swrast/ |
| D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ in NAME() local
193 tStart = tEnd = 0.0; in NAME()
210 tEnd = t; in NAME()
215 if (inSegment && (tEnd > tStart)) { in NAME()
217 segment(ctx, &line, NAME(plot), tStart, tEnd); in NAME()
|
| /external/perfetto/ui/src/tracks/process_scheduling/ |
| D | frontend.ts | 82 const tEnd = data.ends[i]; constant
87 const rectEnd = timeScale.timeToPx(tEnd);
|
| /external/skqp/tests/ |
| D | PathOpsTestCommon.cpp | 146 const double tEnd = i1 < ts.count() ? ts[i1] : 1; in CubicToQuads() local
149 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
162 tStart = tEnd; in CubicToQuads()
|
| /external/skia/tests/ |
| D | PathOpsTestCommon.cpp | 147 const double tEnd = i1 < ts.count() ? ts[i1] : 1; in CubicToQuads() local
150 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
163 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()
|