HomeSort by relevance Sort by last modified time
    Searched defs:testLines (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticImplicit.cpp 161 const _Line* testLines[] = { &line, (const _Line*) &hull[0], (const _Line*) &hull[1] };
162 size_t testCount = sizeof(testLines) / sizeof(testLines[0]);
166 int roots = intersect(q2, *testLines[index], rootTs);
172 xy_at_t(*testLines[index], rootTs.fT[1][idx2], lPt.x, lPt.y);
  /external/skia/experimental/Intersection/
QuadraticImplicit.cpp 161 const _Line* testLines[] = { &line, (const _Line*) &hull[0], (const _Line*) &hull[1] };
162 size_t testCount = sizeof(testLines) / sizeof(testLines[0]);
166 int roots = intersect(q2, *testLines[index], rootTs);
172 xy_at_t(*testLines[index], rootTs.fT[1][idx2], lPt.x, lPt.y);
  /external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp 152 const SkDLine* testLines[] = { &line, (const SkDLine*) &hull[0], (const SkDLine*) &hull[1] };
153 const size_t kTestCount = SK_ARRAY_COUNT(testLines);
158 int roots = rootTs.intersect(q2, *testLines[index]);
166 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
  /external/skia/src/pathops/
SkDQuadIntersection.cpp 152 const SkDLine* testLines[] = { &line, (const SkDLine*) &hull[0], (const SkDLine*) &hull[1] };
153 const size_t kTestCount = SK_ARRAY_COUNT(testLines);
158 int roots = rootTs.intersect(q2, *testLines[index]);
166 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);

Completed in 406 milliseconds