16 struct Contour {  struct
23     Contour(const SkRect& bounds, int lastStart, int verbStart)  in Contour()  argument
29     vector<Contour*> fChildren;  argument
42 static Contour::Direction to_direction(SkScalar dy) {  in to_direction()  argument
43     return dy > 0 ? Contour::Direction::kCCW : dy < 0 ? Contour::Direction::kCW :  in to_direction()
44             Contour::Direction::kNone;  in to_direction()
61     Contour::Direction directions[3];  in contains_edge()
92         if (zero_or_one(tVals[index]) && Contour::Direction::kCCW != directions[index]) {  in contains_edge()
105         Contour::Direction* direction) {  in left_edge()
179     void contourBounds(vector<Contour>* containers) {  in contourBounds()
204     int nextEdge(Contour& contour, Edge edge) {  in nextEdge()
236             Contour::Direction direction;  in nextEdge()
260     bool containerContains(Contour& contour, Contour& test) {  in containerContains()
277     void inParent(Contour& contour, Contour& parent) {  in inParent()
297     bool checkContainerChildren(Contour* parent, Contour* child) {  in checkContainerChildren()
311     bool markReverse(Contour* parent, Contour* child) {  in markReverse()
318             child->fDirection = (Contour::Direction) -(int) child->fDirection;  in markReverse()
324     SkPath reverseMarkedContours(vector<Contour>& contours, SkPathFillType fillType) {  in reverseMarkedContours()
331         for (const Contour& contour : contours) {  in reverseMarkedContours()
390     vector<Contour> contours;   // one per contour  in AsWinding()
397     Contour sorted(SkRect(), 0, 0);  in AsWinding()
403             [](const Contour* contour) -> bool { return !contour->fChildren.size(); } )) {  in AsWinding()