Searched defs:fT (Results 1 - 6 of 6) sorted by relevance

/external/skia/src/pathops/
H A DSkOpEdgeBuilder.cpp275 double fT[2]; member in struct:Splitsville
285 split->fT[0] = index ? splitT[index - 1] : 0;
286 split->fT[1] = index < breaks ? splitT[index] : 1;
287 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]);
306 split->fT[0] = splits[prior].fT[0];
313 split->fT[1] = splits[next].fT[1];
316 if (0 == split->fT[
[all...]
H A DSkIntersections.h27 sk_bzero(fT, sizeof(fT));
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);
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t);
199 fT[(int) swap][tIndex] = t;
225 fT[0][index] = fT[
313 double fT[2][13]; member in class:SkIntersections
[all...]
H A DSkOpSpan.h121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1;
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2;
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2
124 : between(s2->fT, start1->fT, e2->fT)
166 double fT; member in class:SkOpPtT
[all...]
H A DSkPathOpsWinding.cpp87 fT = span->t() * (1 - t) + span->next()->t() * t;
89 fSlope = segment->dSlopeAtT(fT);
90 fPt = segment->ptAtT(fT);
98 double fT; member in struct:SkOpRayHit
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) {
159 && roughly_equal(base.fT, t)
182 newHit->fT = t;
273 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY);
285 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT,
298 // SkASSERT(!approximately_zero(hit->fT) || !hi
[all...]
/external/swiftshader/third_party/PowerVR_SDK/Tools/
H A DPVRTMisc.cpp46 VERTTYPE fN, fD, fT; local
66 fT = VERTTYPEDIV(-fN, fD);
69 pvIntersection->x = pv0->x + VERTTYPEMUL(fT, vD.x);
70 pvIntersection->y = pv0->y + VERTTYPEMUL(fT, vD.y);
71 pvIntersection->z = pv0->z + VERTTYPEMUL(fT, vD.z);
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixFunction.h244 * each diagonal block is computed by \p atomic. The off-diagonal parts of \p fT are set to zero.
247 void matrix_function_compute_block_atomic(const MatrixType& T, AtomicType& atomic, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT) argument
249 fT.setZero(T.rows(), T.cols());
251 fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i))
324 * This routine completes the computation of \p fT, denoting a matrix function applied to the triangular
325 * matrix \p T. It assumes that the block diagonal part of \p fT has already been computed. The part below
329 void matrix_function_compute_above_diagonal(const MatrixType& T, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT) argument
344 DynMatrixType C = fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i))
347 * fT.block(blockStart(i+k), blockStart(i+k), clusterSize(i+k), clusterSize(i+k));
349 C += fT
460 MatrixType fT; // matrix function applied to T local
[all...]

Completed in 161 milliseconds