Home
last modified time | relevance | path

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

12

/external/skia/src/pathops/
DSkIntersections.cpp60 fT[1][index] = 1 - fT[1][index]; in flip()
65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert()
72 double oldOne = fT[0][index]; in insert()
73 double oldTwo = fT[1][index]; in insert()
82 fT[0][index] = one; in insert()
83 fT[1][index] = two; in insert()
93 if (fT[0][index] > one) { in insert()
106 memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining); in insert()
107 memmove(&fT[1][index + 1], &fT[1][index], sizeof(fT[1][0]) * remaining); in insert()
[all …]
DSkDLineIntersection.cpp32 bool startMatch = fT[0][0] == 0 && (fT[1][0] == 0 || fT[1][0] == 1); in cleanUpCoincidence()
33 bool endMatch = fT[0][1] == 1 && (fT[1][1] == 0 || fT[1][1] == 1); in cleanUpCoincidence()
39 bool pStartMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; in cleanUpCoincidence()
40 bool pEndMatch = fT[0][1] == 1 || fT[1][1] == 0 || fT[1][1] == 1; in cleanUpCoincidence()
49 bool startMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; in cleanUpParallelLines()
50 bool endMatch = fT[0][1] == 1 || fT[1][1] == 0 || fT[1][1] == 1; in cleanUpParallelLines()
51 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
59 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
61 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
83 fT[0][0] = numerA; in intersectRay()
[all …]
DSkOpSegment.cpp45 double referenceT = fTs[index].fT; in activeAngle()
48 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) { in activeAngle()
61 referenceT = fTs[index].fT; in activeAngle()
64 } while (precisely_negative(fTs[index].fT - referenceT)); in activeAngle()
126 if (approximately_negative(span.fT - lastT)) { in activeLeftTop()
138 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT); in activeLeftTop()
147 lastT = span.fT; in activeLeftTop()
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
234 double nextT = fTs[tIndex].fT; in addCancelOutsides()
238 SkASSERT(other->fTs[oIndex].fT < 1 || endPt != *oNextPt); in addCancelOutsides()
[all …]
DSkDCubicIntersection.cpp259 double tRange1 = fT[0][last] - fT[0][0]; in cubicCheckCoincidence()
260 double tRange2 = fT[1][last] - fT[1][0]; in cubicCheckCoincidence()
262 double testT1 = fT[0][0] + tRange1 * index / 5; in cubicCheckCoincidence()
263 double testT2 = fT[1][0] + tRange2 * index / 5; in cubicCheckCoincidence()
272 fT[0][1] = fT[0][last]; in cubicCheckCoincidence()
273 fT[1][1] = fT[1][last]; in cubicCheckCoincidence()
525 if (fT[0][0] == i[0][0] && fT[1][0] == i[1][0]) { in intersect()
530 double tAvg = (fT[0][exIdx] + i[0][cpIdx]) / 2; in intersect()
536 tAvg = (fT[1][exIdx] + i[1][cpIdx]) / 2; in intersect()
548 double tAvg = (fT[0][cpIdx] + i[0][cpIdx + 1]) / 2; in intersect()
[all …]
DSkIntersections.h24 sk_bzero(fT, sizeof(fT)); in SkIntersections()
38 TArray operator[](int n) const { return TArray(fT[n]); }
42 memcpy(fT, i.fT, sizeof(fT)); in set()
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
273 double fT[2][9]; variable
DSkOpSegment.h42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1; in complete()
68 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT); in dxdy()
187 return fTs[tIndex].fT; in t()
191 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid; in tAtMid()
327 double fT; member
DSkOpSpan.h17 double fT; member
DSkOpAngle.cpp399 if (precisely_equal(fSegment->span(smaller).fT, fSegment->span(larger).fT)) { in setSpans()
429 fStart, spanStart.fT, fEnd, spanEnd.fT); in dump()
DSkDCubicLineIntersection.cpp353 fUsed = c.intersectRay(fT[0]); in intersectRay()
355 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
DSkPathOpsDebug.cpp104 DebugDumpDouble(fT); in dump()
DSkDQuadLineIntersection.cpp408 fUsed = q.intersectRay(fT[0]); in intersectRay()
410 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
/external/chromium_org/third_party/skia/src/pathops/
DSkIntersections.cpp60 fT[1][index] = 1 - fT[1][index]; in flip()
65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert()
72 double oldOne = fT[0][index]; in insert()
73 double oldTwo = fT[1][index]; in insert()
82 fT[0][index] = one; in insert()
83 fT[1][index] = two; in insert()
93 if (fT[0][index] > one) { in insert()
106 memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining); in insert()
107 memmove(&fT[1][index + 1], &fT[1][index], sizeof(fT[1][0]) * remaining); in insert()
[all …]
DSkDLineIntersection.cpp32 bool startMatch = fT[0][0] == 0 && (fT[1][0] == 0 || fT[1][0] == 1); in cleanUpCoincidence()
33 bool endMatch = fT[0][1] == 1 && (fT[1][1] == 0 || fT[1][1] == 1); in cleanUpCoincidence()
39 bool pStartMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; in cleanUpCoincidence()
40 bool pEndMatch = fT[0][1] == 1 || fT[1][1] == 0 || fT[1][1] == 1; in cleanUpCoincidence()
49 bool startMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; in cleanUpParallelLines()
50 bool endMatch = fT[0][1] == 1 || fT[1][1] == 0 || fT[1][1] == 1; in cleanUpParallelLines()
51 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
59 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
61 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
83 fT[0][0] = numerA; in intersectRay()
[all …]
DSkOpSegment.cpp45 double referenceT = fTs[index].fT; in activeAngle()
48 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) { in activeAngle()
61 referenceT = fTs[index].fT; in activeAngle()
64 } while (precisely_negative(fTs[index].fT - referenceT)); in activeAngle()
126 if (approximately_negative(span.fT - lastT)) { in activeLeftTop()
138 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT); in activeLeftTop()
147 lastT = span.fT; in activeLeftTop()
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
234 double nextT = fTs[tIndex].fT; in addCancelOutsides()
238 SkASSERT(other->fTs[oIndex].fT < 1 || endPt != *oNextPt); in addCancelOutsides()
[all …]
DSkDCubicIntersection.cpp259 double tRange1 = fT[0][last] - fT[0][0]; in cubicCheckCoincidence()
260 double tRange2 = fT[1][last] - fT[1][0]; in cubicCheckCoincidence()
262 double testT1 = fT[0][0] + tRange1 * index / 5; in cubicCheckCoincidence()
263 double testT2 = fT[1][0] + tRange2 * index / 5; in cubicCheckCoincidence()
272 fT[0][1] = fT[0][last]; in cubicCheckCoincidence()
273 fT[1][1] = fT[1][last]; in cubicCheckCoincidence()
525 if (fT[0][0] == i[0][0] && fT[1][0] == i[1][0]) { in intersect()
530 double tAvg = (fT[0][exIdx] + i[0][cpIdx]) / 2; in intersect()
536 tAvg = (fT[1][exIdx] + i[1][cpIdx]) / 2; in intersect()
548 double tAvg = (fT[0][cpIdx] + i[0][cpIdx + 1]) / 2; in intersect()
[all …]
DSkIntersections.h24 sk_bzero(fT, sizeof(fT)); in SkIntersections()
38 TArray operator[](int n) const { return TArray(fT[n]); }
42 memcpy(fT, i.fT, sizeof(fT)); in set()
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
273 double fT[2][9]; variable
DSkOpSegment.h42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1; in complete()
68 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT); in dxdy()
187 return fTs[tIndex].fT; in t()
191 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid; in tAtMid()
327 double fT; member
DSkOpSpan.h17 double fT; member
DSkOpAngle.cpp399 if (precisely_equal(fSegment->span(smaller).fT, fSegment->span(larger).fT)) { in setSpans()
429 fStart, spanStart.fT, fEnd, spanEnd.fT); in dump()
DSkDCubicLineIntersection.cpp353 fUsed = c.intersectRay(fT[0]); in intersectRay()
355 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
DSkPathOpsDebug.cpp104 DebugDumpDouble(fT); in dump()
DSkDQuadLineIntersection.cpp408 fUsed = q.intersectRay(fT[0]); in intersectRay()
410 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-US/
Den-US_lh0_kdt_dur.pkb670 b_��:����&�N����ԎaY�9a1-X��"�fT%�U�����,��Ak)�-�p)��Z@Ȃ���eIe�&5CU�BLV���A��b�AT�cz$
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-GB/
Den-GB_kdt_g2p.pkb190 …"R�9�x+ʂ]AO���X��2%�~����ȌeA�-�/�� P^�(2�<8�2��P�D{0�����?����;fT)rߓ�����Ȭy������)…
/external/jpeg/
Dtestimg.ppm4 …fT>hV>lX@t[E`L�hPysQ�wU�t\�l^�__�V\�Q[�T\�ou�zx̆|��~�����}��x��v��r��t��u��u��u��s��s��r|�ny�ju{a…

12