/dports/editors/lazarus/lazarus/components/aggpas/gpc/ |
H A D | gpc.pas | 302 function PREV_INDEX(i, n : integer) : integer; begin PREV_INDEX := ((i - 1 + n) mod n); end; in PREV_INDEX() function 306 OPTIMAL := NE(v[PREV_INDEX(i, n)].y, v[i].y) or NE(v[NEXT_INDEX(i, n)].y, v[i].y); 311 …FWD_MIN := GE(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GT(v[NEXT_INDEX(i, n)].vertex.y, v[… 321 …REV_MIN := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GE(v[NEXT_INDEX(i, n)].vertex.y, v[… 327 NOT_RMAX := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y); 683 max := PREV_INDEX(min, num_vertices); 687 max := PREV_INDEX(max, num_vertices); 703 v := PREV_INDEX(v, num_vertices);
|
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/aggpas/gpc/ |
H A D | gpc.pas | 302 function PREV_INDEX(i, n : integer) : integer; begin PREV_INDEX := ((i - 1 + n) mod n); end; in PREV_INDEX() function 306 OPTIMAL := NE(v[PREV_INDEX(i, n)].y, v[i].y) or NE(v[NEXT_INDEX(i, n)].y, v[i].y); 311 …FWD_MIN := GE(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GT(v[NEXT_INDEX(i, n)].vertex.y, v[… 321 …REV_MIN := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GE(v[NEXT_INDEX(i, n)].vertex.y, v[… 327 NOT_RMAX := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y); 683 max := PREV_INDEX(min, num_vertices); 687 max := PREV_INDEX(max, num_vertices); 703 v := PREV_INDEX(v, num_vertices);
|
/dports/editors/lazarus-qt5/lazarus/components/aggpas/gpc/ |
H A D | gpc.pas | 302 function PREV_INDEX(i, n : integer) : integer; begin PREV_INDEX := ((i - 1 + n) mod n); end; in PREV_INDEX() function 306 OPTIMAL := NE(v[PREV_INDEX(i, n)].y, v[i].y) or NE(v[NEXT_INDEX(i, n)].y, v[i].y); 311 …FWD_MIN := GE(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GT(v[NEXT_INDEX(i, n)].vertex.y, v[… 321 …REV_MIN := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GE(v[NEXT_INDEX(i, n)].vertex.y, v[… 327 NOT_RMAX := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y); 683 max := PREV_INDEX(min, num_vertices); 687 max := PREV_INDEX(max, num_vertices); 703 v := PREV_INDEX(v, num_vertices);
|
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/aggpas/gpc/ |
H A D | gpc.pas | 302 function PREV_INDEX(i, n : integer) : integer; begin PREV_INDEX := ((i - 1 + n) mod n); end; in PREV_INDEX() function 306 OPTIMAL := NE(v[PREV_INDEX(i, n)].y, v[i].y) or NE(v[NEXT_INDEX(i, n)].y, v[i].y); 311 …FWD_MIN := GE(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GT(v[NEXT_INDEX(i, n)].vertex.y, v[… 321 …REV_MIN := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y) and GE(v[NEXT_INDEX(i, n)].vertex.y, v[… 327 NOT_RMAX := GT(v[PREV_INDEX(i, n)].vertex.y, v[i].vertex.y); 683 max := PREV_INDEX(min, num_vertices); 687 max := PREV_INDEX(max, num_vertices); 703 v := PREV_INDEX(v, num_vertices);
|
/dports/math/R-cran-gpclib/gpclib/src/ |
H A D | gpc.c | 79 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 82 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 85 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 90 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 93 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 524 max= PREV_INDEX(min, num_vertices); in build_lmt() 528 max= PREV_INDEX(max, num_vertices); in build_lmt() 544 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/math/p5-Math-Geometry-Planar-GPC-PolygonXS/Math-Geometry-Planar-GPC-PolygonXS-0.052/ |
H A D | gpc.c | 77 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 80 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 83 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 88 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 91 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 523 max= PREV_INDEX(min, num_vertices); in build_lmt() 527 max= PREV_INDEX(max, num_vertices); in build_lmt() 543 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/graphics/agg/agg-2.5/gpc/ |
H A D | gpc.c | 77 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 80 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 83 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 88 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 91 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 522 max= PREV_INDEX(min, num_vertices); in build_lmt() 526 max= PREV_INDEX(max, num_vertices); in build_lmt() 542 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/graphics/libQGLViewer/libQGLViewer-2.7.2/QGLViewer/VRender/ |
H A D | gpc.cpp | 123 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 126 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 129 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 134 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 137 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 581 max= PREV_INDEX(min, num_vertices); in build_lmt() 585 max= PREV_INDEX(max, num_vertices); in build_lmt() 601 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/math/octomap/octomap-1.9.7/octovis/src/extern/QGLViewer/VRender/ |
H A D | gpc.cpp | 123 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 126 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 129 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 134 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 137 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 581 max= PREV_INDEX(min, num_vertices); in build_lmt() 585 max= PREV_INDEX(max, num_vertices); in build_lmt() 601 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/devel/libgpc/gpc232/ |
H A D | gpc.c | 78 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 81 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 84 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 89 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 92 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 523 max= PREV_INDEX(min, num_vertices); in build_lmt() 527 max= PREV_INDEX(max, num_vertices); in build_lmt() 543 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/misc/vxl/vxl-3.3.2/core/vgl/internals/ |
H A D | gpc.c | 77 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 80 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 83 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 88 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 91 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 511 max= PREV_INDEX(min, num_vertices); in build_lmt() 515 max= PREV_INDEX(max, num_vertices); in build_lmt() 531 v= PREV_INDEX(v, num_vertices); in build_lmt()
|
/dports/math/p5-Math-Geometry-Planar-GPC/Math-Geometry-Planar-GPC-1.04/ |
H A D | GPC.xs | 1915 #define PREV_INDEX(i, n) ((i - 1 + n) % n) macro 1918 #define OPTIMAL(v, i, n) ((v[PREV_INDEX(i, n)].y != v[i].y) || \ 1921 #define FWD_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \ 1926 #define REV_MIN(v, i, n) ((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \ 1929 #define NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) 2373 max= PREV_INDEX(min, num_vertices); 2377 max= PREV_INDEX(max, num_vertices); 2393 v= PREV_INDEX(v, num_vertices);
|