Searched defs:activeEdges (Results 1 - 2 of 2) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DEdgeWalker.cpp1844 static void addToActive(SkTDArray<ActiveEdge>& activeEdges, const InEdge* edge) { argument
1845 size_t count = activeEdges.count();
1847 if (edge == activeEdges[index].fWorkEdge.fEdge) {
1851 ActiveEdge* active = activeEdges.append();
2046 static InEdge** advanceEdges(SkTDArray<ActiveEdge>* activeEdges, argument
2053 if (activeEdges) {
2055 ActiveEdge* activePtr = activeEdges->begin() - 1;
2056 ActiveEdge* lastActive = activeEdges->end();
2059 activeEdges->remove(activePtr - activeEdges
2080 computeInterceptBottom(SkTDArray<ActiveEdge>& activeEdges, SkScalar y, SkScalar bottom) argument
2137 findBottom(InEdge** currentPtr, InEdge** edgeListEnd, SkTDArray<ActiveEdge>* activeEdges, SkScalar y, bool , InEdge**& testPtr) argument
2226 sortHorizontal(SkTDArray<ActiveEdge>& activeEdges, SkTDArray<ActiveEdge*>& edgeList, SkScalar y) argument
[all...]
/external/skia/experimental/Intersection/
H A DEdgeWalker.cpp1844 static void addToActive(SkTDArray<ActiveEdge>& activeEdges, const InEdge* edge) { argument
1845 size_t count = activeEdges.count();
1847 if (edge == activeEdges[index].fWorkEdge.fEdge) {
1851 ActiveEdge* active = activeEdges.append();
2046 static InEdge** advanceEdges(SkTDArray<ActiveEdge>* activeEdges, argument
2053 if (activeEdges) {
2055 ActiveEdge* activePtr = activeEdges->begin() - 1;
2056 ActiveEdge* lastActive = activeEdges->end();
2059 activeEdges->remove(activePtr - activeEdges
2080 computeInterceptBottom(SkTDArray<ActiveEdge>& activeEdges, SkScalar y, SkScalar bottom) argument
2137 findBottom(InEdge** currentPtr, InEdge** edgeListEnd, SkTDArray<ActiveEdge>* activeEdges, SkScalar y, bool , InEdge**& testPtr) argument
2226 sortHorizontal(SkTDArray<ActiveEdge>& activeEdges, SkTDArray<ActiveEdge*>& edgeList, SkScalar y) argument
[all...]

Completed in 123 milliseconds