207 struct EdgeList {  struct
208     EdgeList() : fHead(nullptr), fTail(nullptr) {}  in EdgeList()  argument
302     bool isActive(EdgeList* activeEdges) const {  in isActive()
645 void remove_edge(Edge* edge, EdgeList* edges) {  in remove_edge()
651 void insert_edge(Edge* edge, Edge* prev, EdgeList* edges) {  in insert_edge()
658 void find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) {  in find_enclosing_edges()
677 void find_enclosing_edges(Edge* edge, EdgeList* edges, Comparator& c, Edge** left, Edge** right) {  in find_enclosing_edges()
696 void fix_active_state(Edge* edge, EdgeList* activeEdges, Comparator& c) {  in fix_active_state()
759 void erase_edge_if_zero_winding(Edge* edge, EdgeList* edges) {  in erase_edge_if_zero_winding()
771 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Comparator& c);
773 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c) {  in set_top()
782 void set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c) {  in set_bottom()
791 void merge_edges_above(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c) {  in merge_edges_above()
811 void merge_edges_below(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c) {  in merge_edges_below()
831 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Comparator& c) {  in merge_collinear_edges()
848 void split_edge(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c, SkChunkAlloc& alloc);
850 void cleanup_active_edges(Edge* edge, EdgeList* activeEdges, Comparator& c, SkChunkAlloc& alloc) {  in cleanup_active_edges()
884 void split_edge(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c, SkChunkAlloc& alloc) {  in split_edge()
919 Vertex* check_for_intersection(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c,  in check_for_intersection()
1123     EdgeList activeEdges;  in simplify()
1175     EdgeList activeEdges;  in tessellate()