65  * Insert the given edge into the edge table.  First we must find the correct
66  * bucket in the Edge table, then find the right slot in the bucket.  Finally,
78      * find the right bucket to put the edge into  in miInsertEdgeInET()
109      * now insert the edge in the right bucket  in miInsertEdgeInET()
141  * This routine creates the edge table for scan converting polygons.
142  * The Edge Table (ET) looks like:
157  * per scanline at which an edge is initially entered.
175      *  initialize the Active Edge Table  in miCreateETandAET()
183      *  initialize the Edge Table.  in miCreateETandAET()
195      *  a time -- these make up one edge of the polygon.  in miCreateETandAET()
213          * don't add horizontal edges to the Edge table.  in miCreateETandAET()
219              *  initialize integer edge algorithm  in miCreateETandAET()
240  * This routine moves EdgeTableEntries from the EdgeTable into the Active Edge
273  * use by the winding number rule.  The final Active Edge Table (AET) might
315  * Active Edge Table.
381  * largest by partitioning the array into a left edge list and a right edge
382  * list.  The algorithm used to traverse each edge is an extension of
391     int ml = 0, m1l = 0;        /* left edge slope and slope+1    */  in miFillConvexPoly()
392     int mr = 0, m1r = 0;        /* right edge slope and slope+1   */  in miFillConvexPoly()
393     int incr1l = 0, incr2l = 0; /* left edge error increments     */  in miFillConvexPoly()
394     int incr1r = 0, incr2r = 0; /* right edge error increments    */  in miFillConvexPoly()
431          *  add a left edge if we need to  in miFillConvexPoly()
437              *  find the next edge, considering the end  in miFillConvexPoly()
454          *  add a right edge if we need to  in miFillConvexPoly()
460              *  find the next edge, considering the end  in miFillConvexPoly()
478          *  a right edge as well as a left edge.  in miFillConvexPoly()
528     EdgeTableEntry *pAET;       /* the Active Edge Table   */  in miFillGeneralPoly()
531     EdgeTableEntry *pWETE;      /* Winding Edge Table      */  in miFillGeneralPoly()
538     EdgeTable ET;               /* Edge Table header node  */  in miFillGeneralPoly()
540     EdgeTableEntry *pETEs;      /* Edge Table Entries buff */  in miFillGeneralPoly()
563              *  Add a new edge to the active edge table when we  in miFillGeneralPoly()
564              *  get to the next edge.  in miFillGeneralPoly()
574              *  for each active edge  in miFillGeneralPoly()
605              *  Add a new edge to the active edge table when we  in miFillGeneralPoly()
606              *  get to the next edge.  in miFillGeneralPoly()
618              *  for each active edge  in miFillGeneralPoly()
622                  *  if the next edge in the active edge table is  in miFillGeneralPoly()
623                  *  also the next edge in the winding active edge  in miFillGeneralPoly()
652              *  reevaluate the Winding active edge table if we  in miFillGeneralPoly()
653              *  just had to resort it or if we just exited an edge.  in miFillGeneralPoly()