Home
last modified time | relevance | path

Searched refs:coincident (Results 1 - 7 of 7) sorted by relevance

/third_party/skia/src/pathops/
H A DSkPathOpsTSect.cpp899 // reduce coincident runs to single entries in extractCoincident()
947 // find the first fully coincident span in findCoincidentRun()
1083 // if the ends of each line intersect the opposite curve, the lines are coincident in linesIntersect()
1156 // convergence may fail if the curves are nearly coincident in linesIntersect()
1296 // check middle t value to see if it is coincident as well in mergeCoincidence()
1582 const SkTSpan* coincident = fCoincident; in validate() local
1583 while (coincident) { in validate()
1585 coincident = coincident->fNext; in validate()
1881 gets stuck in a loop. It adds an extension to allow a coincident en in BinarySearch()
1919 SkTSpan* coincident = sect1->fCoincident; BinarySearch() local
[all...]
H A DSkOpSegment.cpp20 Consider segments containing tiny or small intervals. Consider coincident segments
21 because coincidence finds intersections through distance measurement that non-coincident
228 // break the span so that the coincident part does not change the angle of the remainder
536 Opposite values result from combining coincident spans.
1146 // look for pairs of undetected coincident curves
1148 // Even though pairs of curves correct detect coincident runs, a run may be missed
1154 // the resulting run from point 1 to point 2 is coincident on A and B.
1188 // FIXME?: this assumes that if the opposite segment is coincident then no more in missingCoincidence()
1670 bool coincident = true; in testForCoincidence() local
1677 coincident in testForCoincidence()
[all...]
H A DSkOpSpan.h43 bool coincident() const { return fCoincident; } in coincident() function in SkOpPtT
174 mutable bool fCoincident; // set if at some point a coincident span pointed here
407 SkOpSpanBase* fCoinEnd; // linked list of coincident spans that end here (may point to itself)
566 SkOpSpan* fCoincident; // linked list of spans coincident with this one (may point to itself)
571 int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident
572 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
H A DSkOpSpan.cpp287 // the insert above may have put both ends of a coincident run in the same span in checkForCollapsedCoincidence()
288 // for each coincident ptT in loop; see if its opposite in is also in the loop in checkForCollapsedCoincidence()
289 // this implementation is the motivation for marking that a ptT is referenced by a coincident span in checkForCollapsedCoincidence()
293 if (!test->coincident()) { in checkForCollapsedCoincidence()
H A DSkPathOpsDebug.cpp291 // see if next coincident operation makes a change; if so, record it in debugAddToCoinChangedDict()
830 // look for pairs of undetected coincident curves
832 // Even though pairs of curves correct detect coincident runs, a run may be missed
838 // the resulting run from point 1 to point 2 is coincident on A and B.
868 // FIXME?: this assumes that if the opposite segment is coincident then no more in debugMissingCoincidence()
1555 /* If A is coincident with B and B includes an endpoint, and A's matching point
1561 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
1609 // for each coincident pair, match the spans
1859 /* detects overlaps of different coincident run
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrTriangulator.cpp444 static bool coincident(const SkPoint& a, const SkPoint& b) { in coincident() function
804 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in mergeEdgesAbove()
805 TESS_LOG("merging coincident above edges (%g, %g) -> (%g, %g)\n", in mergeEdgesAbove()
825 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { in mergeEdgesBelow()
826 TESS_LOG("merging coincident below edges (%g, %g) -> (%g, %g)\n", in mergeEdgesBelow()
970 TESS_LOG("found coincident verts at %g, %g; merging %g into %g\n", in mergeVertices()
998 if (prevV && coincident(prevV->fPoint, p)) { in makeSortedVertex()
1000 } else if (nextV && coincident(nextV->fPoint, p)) { in makeSortedVertex()
1080 if (coincident(p, left->fTop->fPoint)) { in checkForIntersection()
1082 } else if (coincident( in checkForIntersection()
[all...]
/third_party/skia/tests/
H A DPathOpsDebug.cpp775 const SkOpSpan* coincident = fCoincident; in dumpCoin() local
780 coincident->dump(); in dumpCoin()
785 } while ((coincident = coincident->fCoincident) != this); in dumpCoin()

Completed in 18 milliseconds