Searched defs:sect1 (Results 1 - 2 of 2) sorted by relevance
/external/skia/tests/ |
H A D | PathOpsDebug.cpp | 465 void DumpBoth(SkTSect<TCurve, OppCurve>* sect1, SkTSect<OppCurve, TCurve>* sect2) { argument 466 sect1->dumpBoth(sect2); 495 void DumpBounded(SkTSect<TCurve, OppCurve>* sect1, int id) { argument 496 sect1->dumpBounded(id); 525 void DumpBounds(SkTSect<TCurve, OppCurve>* sect1) { argument 526 sect1->dumpBounds(); 555 void DumpCoin(SkTSect<TCurve, OppCurve>* sect1) { argument 556 sect1->dumpCoin(); 585 void DumpCoinCurves(SkTSect<TCurve, OppCurve>* sect1) { argument 586 sect1 [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsTSect.h | 220 static void BinarySearch(SkTSect* sect1, SkTSect<OppCurve, TCurve>* sect2, 279 static int EndsEqual(const SkTSect* sect1, const SkTSect<OppCurve, TCurve>* sect2, 1841 int SkTSect<TCurve, OppCurve>::EndsEqual(const SkTSect<TCurve, OppCurve>* sect1, argument 1844 if (sect1->fCurve[0] == sect2->fCurve[0]) { 1846 intersections->insert(0, 0, sect1->fCurve[0]); 1848 if (sect1->fCurve[0] == sect2->fCurve[OppCurve::kPointLast]) { 1850 intersections->insert(0, 1, sect1->fCurve[0]); 1852 if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[0]) { 1854 intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]); 1856 if (sect1 2019 BinarySearch(SkTSect<TCurve, OppCurve>* sect1, SkTSect<OppCurve, TCurve>* sect2, SkIntersections* intersections) argument [all...] |
Completed in 103 milliseconds