hpgs/lib/hpgsscanline.c

92    \c order 1 is the intersection order
96    \c order2 is the intersection order
100    the edge is inserted twice with an opposite sign in order to draw
144    using merge sort. Merge sort is used in order to preserve
145    the order of two equal x positions with opposite sign.
604 		   c->scanlines[iscan].points[j].order);
648       int order = x > d->x_last ? 1 : -1;
650       if (hpgs_paint_scanline_add_point(d->c->scanlines+d->iscan_last,d->x_last,order))
653       if (hpgs_paint_scanline_add_point(d->c->scanlines+d->iscan_last,x,-order))
849       int iscan0,iscan1,order;
885 	  order = x1 < x0 ? -1 : 1;
893 	      hpgs_paint_scanline_add_point(c->scanlines+iscan0,x0,order))
897 	      hpgs_paint_scanline_add_point(c->scanlines+iscan1,x1,-order))
901 	    { int tmp = iscan0; iscan0 = iscan1; iscan1 = tmp; order = -order; }
932 		    hpgs_paint_scanline_add_point(c->scanlines+iscan,x,-order))
936 		    hpgs_paint_scanline_add_point(c->scanlines+iscan+1,x,order))
944 						  point->p.x,-order))
949 						  point->p.x,order))
1004             // add endpoint with appropriate order.
1007                 int order = x1 > d.x_last ? 1 : -1;
1015                 if (hpgs_paint_scanline_add_point(c->scanlines+d.iscan_last,d.x_last,order))
1018                 if (hpgs_paint_scanline_add_point(c->scanlines+d.iscan_last,x1,-order))
1155    optimized algorithm is used in order to retrieve the cut of the border
1206 		   c->scanlines[iscan].points[j].order);
1239                                                    int iscan, int order,
1251                                         d->o_last,o<=0 ? order : 0))
1263       d->o_last = order;
1330   int order = (int)((dscan-rdscan)*256.0+0.5);
1332   return hpgs_bezier_clipper_alpha_cut_data_push(d,t,x,iscan,order,0);
1425               int order = (int)((dscan1-rdscan1)*256.0+0.5);
1427               return hpgs_bezier_clipper_alpha_cut_data_push(d,t1,x,iscan0,order,0);
1443               int order = (int)((dscan1-rdscan1)*256.0+0.5);
1445               return hpgs_bezier_clipper_alpha_cut_data_push(d,t1,x,iscan0,order,0);
1489    intersection points. This methid is used in order to create the
1515       int iscan0,iscan1,o,order;
1606                   order = o*(int)(256 * (dscan1 - rdscan1) + 0.5);
1608                   if (hpgs_paint_scanline_add_slope(c->scanlines+iscan,last_x,x1,last_order,order))
1645             // add endpoint with appropriate order.
1658                 order = (int)((dscan1-rdscan1)*256.0+0.5);
1663                                                   order))
1684           so += c->scanlines[iscan].points[j].order;
1687                    c->scanlines[iscan].points[j].order,so);
1718    Adds an intersection point with coordinate \c x and order \c 0 to the
1731   s->points[s->n_points].order = o;
1772       // interpolate order of already exiting segment.
1774       int order =
1776         (int)((s->points[i0+1].order * (x1-s->points[i0-1].x)  )/
1780       s->points[i0].order = order;
1782       // subtract intermediate order from already existing next point.
1784       if (order)
1785         s->points[i0].order -= order;
1795       int order =
1798       s->points[i0].order += order - last_order;
1799       last_order = order;
1814       // interpolate order of already exiting segment.
1815       int order =
1817         (int)((s->points[i0+1].order * (x2-s->points[i0-1].x)  )/
1822       s->points[i0].order = order + o - last_order;
1824       // subtract intermediate order from already existing next point.
1826       if (order)
1827         s->points[i0].order -= order;
1831     s->points[i0].order += o-last_order;
1896 	  owind += orig->points[io].order;
1902 	  cwind += clip->points[ic].order;
1962 	  owind += orig->points[io].order;
1968 	  cwind += clip->points[ic].order;
2000 	  owind += orig->points[io].order;
2007 	  cwind += clip->points[ic].order;
2052     Use \c hpgs_paint_clipper_destroy in order to destroy the returned
2135 	  owind += img->points[io].order;
2144 	  cwind += clip->points[ic].order;
2227 	  owind += img->points[io].order;
2234 	  cwind += clip->points[ic].order;
2242           (cwind+clip->points[ic].order*(x-clip_last_x)/(clip->points[ic].x-clip_last_x))/256.0;
2249                ic < clip->n_points ? clip->points[ic].order : -1,
2448     Use \c hpgs_paint_clipper_destroy in order to destroy the returned
2468       // slightly reinterpret lly and ury in order to