Home
last modified time | relevance | path

Searched refs:fT (Results 1 – 25 of 70) sorted by relevance

123

/external/skia/src/pathops/
DSkIntersections.cpp15 if (!between(rangeStart, fT[0][index], rangeEnd)) { in closestTo()
30 fT[1][index] = 1 - fT[1][index]; in flip()
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert()
42 double oldOne = fT[0][index]; in insert()
43 double oldTwo = fT[1][index]; in insert()
59 memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining); in insert()
60 memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining); in insert()
74 if (fT[0][index] > one) { in insert()
87 memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining); in insert()
[all …]
DSkOpCoincidence.cpp100 if (fCoinPtTStart->fT > coinPtTStart->fT || (this->flipped() in extend()
101 ? fOppPtTStart->fT < oppPtTStart->fT : fOppPtTStart->fT > oppPtTStart->fT)) { in extend()
105 if (fCoinPtTEnd->fT < coinPtTEnd->fT || (this->flipped() in extend()
106 ? fOppPtTEnd->fT > oppPtTEnd->fT : fOppPtTEnd->fT < oppPtTEnd->fT)) { in extend()
124 if (s->fT > e->fT) { in contains()
129 return fCoinPtTStart->fT <= s->fT && e->fT <= fCoinPtTEnd->fT; in contains()
132 double oppTs = fOppPtTStart->fT; in contains()
133 double oppTe = fOppPtTEnd->fT; in contains()
138 return oppTs <= s->fT && e->fT <= oppTe; in contains()
165 double oppLastT = fOppPtTStart->fT; in ordered()
[all …]
DSkDLineIntersection.cpp17 bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]); in cleanUpParallelLines()
18 bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]); in cleanUpParallelLines()
19 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
21 if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0])) in cleanUpParallelLines()
22 && fT[0][1] == 1 && zero_or_one(fT[1][1])) { in cleanUpParallelLines()
35 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
37 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
59 fT[0][0] = numerA; in intersectRay()
60 fT[1][0] = numerB; in intersectRay()
73 fT[0][0] = fT[1][0] = 0; in intersectRay()
[all …]
DSkOpSpan.h121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1; in Overlaps()
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2; in Overlaps()
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2 in Overlaps()
124 : between(s2->fT, start1->fT, e2->fT) ? start1 : nullptr; in Overlaps()
125 const SkOpPtT* end1 = s1->fT < e1->fT ? e1 : s1; in Overlaps()
126 const SkOpPtT* end2 = s2->fT < e2->fT ? e2 : s2; in Overlaps()
127 *eOut = between(s1->fT, end2->fT, e1->fT) ? end2 in Overlaps()
128 : between(s2->fT, end1->fT, e2->fT) ? end1 : nullptr; in Overlaps()
130 SkOPOBJASSERT(s1, start1->fT >= end2->fT || start2->fT >= end1->fT); in Overlaps()
163 return fT < end->fT ? this : end; in starter()
[all …]
DSkIntersections.h27 sk_bzero(fT, sizeof(fT)); in SkIntersections()
44 TArray operator[](int n) const { return TArray(fT[n]); }
112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t); in hasOppT()
199 fT[(int) swap][tIndex] = t; in set()
225 fT[0][index] = fT[0][index] * (1 + BUMP_EPSILON * 2) - BUMP_EPSILON; in unBumpT()
226 if (!between(0, fT[0][index], 1)) { in unBumpT()
317 double fT[2][13]; variable
DSkOpSpan.cpp58 if (ptT->fT == t && ptT->segment() == segment) { in contains()
99 fT = t; in init()
167 double min = walk->fT; in collapsed()
181 min = std::min(min, walk->fT); in collapsed()
182 max = std::max(max, walk->fT); in collapsed()
255 SkASSERT(this->t() != spanPtT->fT); in merge()
256 SkASSERT(!zero_or_one(spanPtT->fT)); in merge()
269 if (nextC->span() == remainder->span() && nextC->fT == remainder->fT) { in merge()
339 if (!zero_or_one(inner->fT)) { in mergeMatches()
342 SkOPASSERT(inner->fT != test->fT); in mergeMatches()
[all …]
DSkPathOpsDebug.cpp730 if (t == result->fT || this->match(result, this, t, pt)) { in debugAddT()
734 if (t < result->fT) { in debugAddT()
903 bool swapped = priorPtT->fT > ptT->fT; in debugMissingCoincidence()
1478 if (this->contains(baseSeg, testSeg, testPtT->fT)) { in debugAddEndMovedSpans()
1512 oppTs = oppStart->fT; in debugAddEndMovedSpans()
1513 oppTe = testPtT->fT; in debugAddEndMovedSpans()
1517 coinTs = oppStart->fT; in debugAddEndMovedSpans()
1518 coinTe = testPtT->fT; in debugAddEndMovedSpans()
1573 FAIL_IF(1 == span->coinPtTStart()->fT, span); in debugAddEndMovedSpans()
1574 bool onEnd = span->coinPtTStart()->fT == 0; in debugAddEndMovedSpans()
[all …]
DSkOpCoincidence.h59 bool flipped() const { return fOppPtTStart->fT > fOppPtTEnd->fT; } in flipped()
83 SkOPASSERT(!fCoinPtTStart || ptT->fT != fCoinPtTStart->fT); in setCoinPtTEnd()
91 SkOPASSERT(!fCoinPtTEnd || ptT->fT != fCoinPtTEnd->fT); in setCoinPtTStart()
104 SkOPASSERT(!fOppPtTStart || ptT->fT != fOppPtTStart->fT); in setOppPtTEnd()
112 SkOPASSERT(!fOppPtTEnd || ptT->fT != fOppPtTEnd->fT); in setOppPtTStart()
DSkOpEdgeBuilder.cpp274 double fT[2]; in walk() member
284 split->fT[0] = index ? splitT[index - 1] : 0; in walk()
285 split->fT[1] = index < breaks ? splitT[index] : 1; in walk()
286 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]); in walk()
305 split->fT[0] = splits[prior].fT[0]; in walk()
314 split->fT[1] = splits[next].fT[1]; in walk()
DSkPathOpsWinding.cpp90 fT = span->t() * (1 - t) + span->next()->t() * t; in makeTestBase()
92 fSlope = segment->dSlopeAtT(fT); in makeTestBase()
93 fPt = segment->ptAtT(fT); in makeTestBase()
101 double fT; member
137 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) { in rayCheck()
162 && roughly_equal(base.fT, t) in rayCheck()
185 newHit->fT = t; in rayCheck()
275 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop()
287 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT, in sortableTop()
/external/skqp/src/pathops/
DSkIntersections.cpp15 if (!between(rangeStart, fT[0][index], rangeEnd)) { in closestTo()
30 fT[1][index] = 1 - fT[1][index]; in flip()
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert()
42 double oldOne = fT[0][index]; in insert()
43 double oldTwo = fT[1][index]; in insert()
59 memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining); in insert()
60 memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining); in insert()
74 if (fT[0][index] > one) { in insert()
87 memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining); in insert()
[all …]
DSkOpCoincidence.cpp100 if (fCoinPtTStart->fT > coinPtTStart->fT || (this->flipped() in extend()
101 ? fOppPtTStart->fT < oppPtTStart->fT : fOppPtTStart->fT > oppPtTStart->fT)) { in extend()
105 if (fCoinPtTEnd->fT < coinPtTEnd->fT || (this->flipped() in extend()
106 ? fOppPtTEnd->fT > oppPtTEnd->fT : fOppPtTEnd->fT < oppPtTEnd->fT)) { in extend()
124 if (s->fT > e->fT) { in contains()
129 return fCoinPtTStart->fT <= s->fT && e->fT <= fCoinPtTEnd->fT; in contains()
132 double oppTs = fOppPtTStart->fT; in contains()
133 double oppTe = fOppPtTEnd->fT; in contains()
138 return oppTs <= s->fT && e->fT <= oppTe; in contains()
165 double oppLastT = fOppPtTStart->fT; in ordered()
[all …]
DSkDLineIntersection.cpp17 bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]); in cleanUpParallelLines()
18 bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]); in cleanUpParallelLines()
19 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
21 if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0])) in cleanUpParallelLines()
22 && fT[0][1] == 1 && zero_or_one(fT[1][1])) { in cleanUpParallelLines()
35 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
37 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
59 fT[0][0] = numerA; in intersectRay()
60 fT[1][0] = numerB; in intersectRay()
73 fT[0][0] = fT[1][0] = 0; in intersectRay()
[all …]
DSkOpSpan.h121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1; in Overlaps()
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2; in Overlaps()
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2 in Overlaps()
124 : between(s2->fT, start1->fT, e2->fT) ? start1 : nullptr; in Overlaps()
125 const SkOpPtT* end1 = s1->fT < e1->fT ? e1 : s1; in Overlaps()
126 const SkOpPtT* end2 = s2->fT < e2->fT ? e2 : s2; in Overlaps()
127 *eOut = between(s1->fT, end2->fT, e1->fT) ? end2 in Overlaps()
128 : between(s2->fT, end1->fT, e2->fT) ? end1 : nullptr; in Overlaps()
130 SkOPOBJASSERT(s1, start1->fT >= end2->fT || start2->fT >= end1->fT); in Overlaps()
163 return fT < end->fT ? this : end; in starter()
[all …]
DSkIntersections.h27 sk_bzero(fT, sizeof(fT)); in SkIntersections()
44 TArray operator[](int n) const { return TArray(fT[n]); }
112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t); in hasOppT()
199 fT[(int) swap][tIndex] = t; in set()
225 fT[0][index] = fT[0][index] * (1 + BUMP_EPSILON * 2) - BUMP_EPSILON; in unBumpT()
226 if (!between(0, fT[0][index], 1)) { in unBumpT()
317 double fT[2][13]; variable
DSkOpSpan.cpp58 if (ptT->fT == t && ptT->segment() == segment) { in contains()
99 fT = t; in init()
167 double min = walk->fT; in collapsed()
181 min = SkTMin(min, walk->fT); in collapsed()
182 max = SkTMax(max, walk->fT); in collapsed()
255 SkASSERT(this->t() != spanPtT->fT); in merge()
256 SkASSERT(!zero_or_one(spanPtT->fT)); in merge()
269 if (nextC->span() == remainder->span() && nextC->fT == remainder->fT) { in merge()
339 if (!zero_or_one(inner->fT)) { in mergeMatches()
342 SkOPASSERT(inner->fT != test->fT); in mergeMatches()
[all …]
DSkPathOpsDebug.cpp753 if (t == result->fT || this->match(result, this, t, pt)) { in debugAddT()
757 if (t < result->fT) { in debugAddT()
926 bool swapped = priorPtT->fT > ptT->fT; in debugMissingCoincidence()
1501 if (this->contains(baseSeg, testSeg, testPtT->fT)) { in debugAddEndMovedSpans()
1535 oppTs = oppStart->fT; in debugAddEndMovedSpans()
1536 oppTe = testPtT->fT; in debugAddEndMovedSpans()
1540 coinTs = oppStart->fT; in debugAddEndMovedSpans()
1541 coinTe = testPtT->fT; in debugAddEndMovedSpans()
1596 FAIL_IF(1 == span->coinPtTStart()->fT, span); in debugAddEndMovedSpans()
1597 bool onEnd = span->coinPtTStart()->fT == 0; in debugAddEndMovedSpans()
[all …]
DSkOpCoincidence.h59 bool flipped() const { return fOppPtTStart->fT > fOppPtTEnd->fT; } in flipped()
83 SkOPASSERT(!fCoinPtTStart || ptT->fT != fCoinPtTStart->fT); in setCoinPtTEnd()
91 SkOPASSERT(!fCoinPtTEnd || ptT->fT != fCoinPtTEnd->fT); in setCoinPtTStart()
104 SkOPASSERT(!fOppPtTStart || ptT->fT != fOppPtTStart->fT); in setOppPtTEnd()
112 SkOPASSERT(!fOppPtTEnd || ptT->fT != fOppPtTEnd->fT); in setOppPtTStart()
DSkOpEdgeBuilder.cpp280 double fT[2]; in walk() member
290 split->fT[0] = index ? splitT[index - 1] : 0; in walk()
291 split->fT[1] = index < breaks ? splitT[index] : 1; in walk()
292 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]); in walk()
311 split->fT[0] = splits[prior].fT[0]; in walk()
320 split->fT[1] = splits[next].fT[1]; in walk()
DSkPathOpsWinding.cpp89 fT = span->t() * (1 - t) + span->next()->t() * t; in makeTestBase()
91 fSlope = segment->dSlopeAtT(fT); in makeTestBase()
92 fPt = segment->ptAtT(fT); in makeTestBase()
100 double fT; member
136 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) { in rayCheck()
161 && roughly_equal(base.fT, t) in rayCheck()
184 newHit->fT = t; in rayCheck()
274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop()
286 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT, in sortableTop()
/external/skqp/src/core/
DSkArenaAllocList.h35 T& operator*() const { return fCurr->fT; }
36 T* operator->() const { return &fCurr->fT; }
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node()
54 T fT; member
71 return fTail->fT; in append()
/external/skia/src/core/
DSkArenaAllocList.h35 T& operator*() const { return fCurr->fT; }
36 T* operator->() const { return &fCurr->fT; }
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node()
54 T fT; member
71 return fTail->fT; in append()
/external/skia/modules/sksg/src/
DSkSGTransform.cpp89 : fT(std::move(t)) { in Inverse()
90 SkASSERT(fT); in Inverse()
92 this->observeInval(fT); in Inverse()
96 this->unobserveInval(fT); in ~Inverse()
101 fT->revalidate(ic, ctm); in onRevalidate()
103 if (!TransformPriv::As<T>(fT).invert(&fInverted)) { in onRevalidate()
123 const sk_sp<Transform> fT; member in sksg::__anon359380d30111::Inverse
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
DMatrixFunction.h247 …T, AtomicType& atomic, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT) in matrix_function_compute_block_atomic() argument
249 fT.setZero(T.rows(), T.cols()); in matrix_function_compute_block_atomic()
251 fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i)) in matrix_function_compute_block_atomic()
329 …l(const MatrixType& T, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT) in matrix_function_compute_above_diagonal() argument
344 DynMatrixType C = fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i)) in matrix_function_compute_above_diagonal()
347 * fT.block(blockStart(i+k), blockStart(i+k), clusterSize(i+k), clusterSize(i+k)); in matrix_function_compute_above_diagonal()
349 C += fT.block(blockStart(i), blockStart(m), clusterSize(i), clusterSize(m)) in matrix_function_compute_above_diagonal()
352 * fT.block(blockStart(m), blockStart(i+k), clusterSize(m), clusterSize(i+k)); in matrix_function_compute_above_diagonal()
354 fT.block(blockStart(i), blockStart(i+k), clusterSize(i), clusterSize(i+k)) in matrix_function_compute_above_diagonal()
459 MatrixType fT; // matrix function applied to T
[all …]
/external/skia/samplecode/
DSamplePath.cpp562 SkScalar fT = 0.5f; member in CubicCurve2
586 case '-': fT -= 1.0f / 32; break; in onChar()
587 case '=': fT += 1.0f / 32; break; in onChar()
591 fT = std::min(1.0f, std::max(0.0f, fT)); in onChar()
611 tmp[i] = lerp(prev[i], prev[i+1], fT); in showFrame()
675 SkPoint p0 = SkEvalQuadAt(&fPts[0], fT), in showInnerQuads()
676 p1 = SkEvalQuadAt(&fPts[1], fT), in showInnerQuads()
677 p2 = lerp(p0, p1, fT); in showInnerQuads()
715 canvas->drawString(SkStringPrintf("t = %g", fT), 20, 20, font, paint); in onDrawContent()

123