/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | Intersections.cpp | 35 double cs1 = fT[fSwap][i1]; 36 double ce1 = fT[fSwap][iEnd1]; 49 double cs2 = fT[fSwap ^ 1][i2]; 50 double ce2 = fT[fSwap ^ 1][iEnd2]; 57 fT[fSwap][i1] = s1; 60 fT[fSwap][i1] = e1; 64 fT[fSwap][iEnd1] = s1; 67 fT[fSwap][iEnd1] = e1; 75 fT[fSwap ^ 1][i2] = s2; 77 fT[fSwa [all...] |
H A D | LineIntersection.cpp | 30 i.fPt[0] = xy_at_t(a, i.fT[0][0]); 32 i.fPt[1] = xy_at_t(a, i.fT[0][1]); 69 i.fT[0][0] = numerA; 70 i.fT[1][0] = numerB; 105 i.fT[0][0] = i.fT[0][1] = 0; 112 i.fT[0][0] = SkTMax(SkTMin(at0, 1.0), 0.0); 113 i.fT[0][1] = SkTMax(SkTMin(at1, 1.0), 0.0); 117 i.fT[1][0] = i.fT[ [all...] |
H A D | Intersections.h | 21 bzero(fT, sizeof(fT)); 50 double val = fT[fSwap][index]; 53 fT[fSwap][index] = val; 98 SkTSwap(fT[0][index], fT[1][index]); 129 double fT[2][9]; member in class:Intersections
|
H A D | LineIntersection_Test.cpp | 49 xy_at_t(line1, ts.fT[0][i], result1.x, result1.y); 50 xy_at_t(line2, ts.fT[1][i], result2.x, result2.y); 55 xy_at_t(line2, ts.fT[1][i ^ 1], result2.x, result2.y);
|
H A D | CubicIntersection.cpp | 71 SkTSwap(i.fT[0][s], i.fT[1][s]); 128 double to1 = t1Start + (t1 - t1Start) * locals.fT[0][tIdx]; 129 double to2 = t2Start + (t2 - t2Start) * locals.fT[1][tIdx]; 156 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx - 1] + to1) / 2; 159 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx + 1] + to1) / 2; 183 i.used() > 0 ? i.fT[0][i.used() - 1] : -1); 189 (t2Start + (t2 - t2Start) * locals.fT[1][tIdx - 1] + to2) / 2; 191 (t2Start + (t2 - t2Start) * locals.fT[1][tIdx + 1] + to2) / 2; 223 i.used() > 0 ? i.fT[ [all...] |
H A D | CubicConvexHull.cpp | 70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]); 71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); 73 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]); 74 lineTs.fT[1][0] = interp(minT2, maxT2, lineTs.fT[1][0]); 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 78 intersections.insert(lineTs.fT[ [all...] |
H A D | thingsToDo.txt | 202 if (minSpan.fT != span.fT) { 244 double fromT = fTs[from].fT; 249 if ((step > 0 ? span.fT - fromT : fromT - span.fT) >= FLT_EPSILON ) { 394 next = start->fT == 0 ? NULL : this; 395 nextOther = other->fTs[start->fOtherIndex].fT > 1 - FLT_EPSILON ? NULL : other; 397 next = end->fT == 1 ? NULL : this; 398 nextOther = other->fTs[end->fOtherIndex].fT < FLT_EPSILON ? NULL : other; 406 bool checkNext = !next && (step < 0 ? span.fT < FLT_EPSILO [all...] |
/external/skia/experimental/Intersection/ |
H A D | Intersections.cpp | 35 double cs1 = fT[fSwap][i1]; 36 double ce1 = fT[fSwap][iEnd1]; 49 double cs2 = fT[fSwap ^ 1][i2]; 50 double ce2 = fT[fSwap ^ 1][iEnd2]; 57 fT[fSwap][i1] = s1; 60 fT[fSwap][i1] = e1; 64 fT[fSwap][iEnd1] = s1; 67 fT[fSwap][iEnd1] = e1; 75 fT[fSwap ^ 1][i2] = s2; 77 fT[fSwa [all...] |
H A D | LineIntersection.cpp | 30 i.fPt[0] = xy_at_t(a, i.fT[0][0]); 32 i.fPt[1] = xy_at_t(a, i.fT[0][1]); 69 i.fT[0][0] = numerA; 70 i.fT[1][0] = numerB; 105 i.fT[0][0] = i.fT[0][1] = 0; 112 i.fT[0][0] = SkTMax(SkTMin(at0, 1.0), 0.0); 113 i.fT[0][1] = SkTMax(SkTMin(at1, 1.0), 0.0); 117 i.fT[1][0] = i.fT[ [all...] |
H A D | Intersections.h | 21 bzero(fT, sizeof(fT)); 50 double val = fT[fSwap][index]; 53 fT[fSwap][index] = val; 98 SkTSwap(fT[0][index], fT[1][index]); 129 double fT[2][9]; member in class:Intersections
|
H A D | LineIntersection_Test.cpp | 49 xy_at_t(line1, ts.fT[0][i], result1.x, result1.y); 50 xy_at_t(line2, ts.fT[1][i], result2.x, result2.y); 55 xy_at_t(line2, ts.fT[1][i ^ 1], result2.x, result2.y);
|
H A D | CubicIntersection.cpp | 71 SkTSwap(i.fT[0][s], i.fT[1][s]); 128 double to1 = t1Start + (t1 - t1Start) * locals.fT[0][tIdx]; 129 double to2 = t2Start + (t2 - t2Start) * locals.fT[1][tIdx]; 156 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx - 1] + to1) / 2; 159 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx + 1] + to1) / 2; 183 i.used() > 0 ? i.fT[0][i.used() - 1] : -1); 189 (t2Start + (t2 - t2Start) * locals.fT[1][tIdx - 1] + to2) / 2; 191 (t2Start + (t2 - t2Start) * locals.fT[1][tIdx + 1] + to2) / 2; 223 i.used() > 0 ? i.fT[ [all...] |
H A D | CubicConvexHull.cpp | 70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]); 71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); 73 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]); 74 lineTs.fT[1][0] = interp(minT2, maxT2, lineTs.fT[1][0]); 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 78 intersections.insert(lineTs.fT[ [all...] |
H A D | thingsToDo.txt | 202 if (minSpan.fT != span.fT) { 244 double fromT = fTs[from].fT; 249 if ((step > 0 ? span.fT - fromT : fromT - span.fT) >= FLT_EPSILON ) { 394 next = start->fT == 0 ? NULL : this; 395 nextOther = other->fTs[start->fOtherIndex].fT > 1 - FLT_EPSILON ? NULL : other; 397 next = end->fT == 1 ? NULL : this; 398 nextOther = other->fTs[end->fOtherIndex].fT < FLT_EPSILON ? NULL : other; 406 bool checkNext = !next && (step < 0 ? span.fT < FLT_EPSILO [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkIntersections.cpp | 60 fT[1][index] = 1 - fT[1][index]; 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); 72 double oldOne = fT[0][index]; 73 double oldTwo = fT[1][index]; 82 fT[0][index] = one; 83 fT[ [all...] |
H A D | SkDLineIntersection.cpp | 32 bool startMatch = fT[0][0] == 0 && (fT[1][0] == 0 || fT[1][0] == 1); 33 bool endMatch = fT[0][1] == 1 && (fT[1][1] == 0 || fT[1][1] == 1); 39 bool pStartMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; 40 bool pEndMatch = fT[ [all...] |
H A D | SkOpSegment.cpp | 46 double referenceT = fTs[index].fT; 49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) { 62 referenceT = fTs[index].fT; 65 } while (precisely_negative(fTs[index].fT - referenceT)); 131 if (approximately_negative(span.fT - lastT)) { 143 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT); 152 lastT = span.fT; 192 __FUNCTION__, debugID(), span(index).fT, span(endIndex).fT, 229 SkASSERT(fTs[tIndex].fT < [all...] |
H A D | SkOpSpan.h | 17 double fT; member in struct:SkOpSpan 18 double fOtherT; // value at fOther[fOtherIndex].fT
|
H A D | SkPathOpsDebug.cpp | 298 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 307 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) { 330 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 362 bool change = lastT != fTs[i].fT || lastWind != fTs[i].fWindValue 372 lastT = fTs[i].fT; 408 if (lastId == fID && lastT == fTs[i].fT) { 412 lastT = fTs[i].fT; 420 SkDebugf(") t=%1.9g (%1.9g,%1.9g)", span->fT, xAt [all...] |
H A D | SkDCubicIntersection.cpp | 262 double tRange1 = fT[0][last] - fT[0][0]; 263 double tRange2 = fT[1][last] - fT[1][0]; 265 double testT1 = fT[0][0] + tRange1 * index / 5; 266 double testT2 = fT[1][0] + tRange2 * index / 5; 275 fT[0][1] = fT[0][last]; 276 fT[1][1] = fT[ [all...] |
/external/skia/src/pathops/ |
H A D | SkIntersections.cpp | 60 fT[1][index] = 1 - fT[1][index]; 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); 72 double oldOne = fT[0][index]; 73 double oldTwo = fT[1][index]; 82 fT[0][index] = one; 83 fT[ [all...] |
H A D | SkDLineIntersection.cpp | 32 bool startMatch = fT[0][0] == 0 && (fT[1][0] == 0 || fT[1][0] == 1); 33 bool endMatch = fT[0][1] == 1 && (fT[1][1] == 0 || fT[1][1] == 1); 39 bool pStartMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1; 40 bool pEndMatch = fT[ [all...] |
H A D | SkOpSpan.h | 17 double fT; member in struct:SkOpSpan 18 double fOtherT; // value at fOther[fOtherIndex].fT
|
H A D | SkOpSegment.cpp | 46 double referenceT = fTs[index].fT; 49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) { 62 referenceT = fTs[index].fT; 65 } while (precisely_negative(fTs[index].fT - referenceT)); 131 if (approximately_negative(span.fT - lastT)) { 143 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT); 152 lastT = span.fT; 192 __FUNCTION__, debugID(), span(index).fT, span(endIndex).fT, 229 SkASSERT(fTs[tIndex].fT < [all...] |
H A D | SkPathOpsDebug.cpp | 297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 306 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) { 329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 361 bool change = lastT != fTs[i].fT || lastWind != fTs[i].fWindValue 371 lastT = fTs[i].fT; 407 if (lastId == fID && lastT == fTs[i].fT) { 411 lastT = fTs[i].fT; 419 SkDebugf(") t=%1.9g (%1.9g,%1.9g)", span->fT, xAt [all...] |