Home
last modified time | relevance | path

Searched refs:pt_list (Results 1 – 25 of 85) sorted by relevance

1234

/dports/graphics/opendx/dx-4.4.4/src/exec/hwrender/xgl/
H A DhwUnconPointDraw.c123 Xgl_pt_list *pt_list ; in _dxfUnconnectedPointDraw() local
172 Xgl_pt_list pt_list ; in _dxfUnconnectedPointDraw() local
175 pt_list.pt_type = XGL_PT_F3D ; in _dxfUnconnectedPointDraw()
177 pt_list.bbox = NULL ; in _dxfUnconnectedPointDraw()
178 pt_list.num_pts = xf->npositions ; in _dxfUnconnectedPointDraw()
235 if (!pt_list->pts.f3d) in _dxfUnconnectedPointDraw()
270 if (!pt_list->pts.color_f3d) in _dxfUnconnectedPointDraw()
304 pt_list->pt_type = pt_type ; in _dxfUnconnectedPointDraw()
305 pt_list->bbox = NULL ; in _dxfUnconnectedPointDraw()
306 pt_list->num_pts = n ; in _dxfUnconnectedPointDraw()
[all …]
H A DhwPolyhedraDrawXGL.c.h108 pt_list[ds].pt_type = XGL_PT_F3D; \
109 pt_list[ds].bbox = NULL; \
110 pt_list[ds].num_pts = VerticesPerFacet; \
111 pt_list[ds].pts.f3d = &pt_f3d[dp]; \
175 Xgl_pt_list *pt_list ; in CdfDraw() local
207 pt_list = (Xgl_pt_list *)(mem + sizeof(int)) ; in CdfDraw()
246 ndrawn, pt_list) ; in CdfDraw()
273 Xgl_pt_list *pt_list ; in CdcDraw() local
382 ndrawn, pt_list); in CdcDraw()
409 Xgl_pt_list *pt_list ; in CdpDraw() local
[all …]
H A DhwLineDraw.c119 Xgl_pt_list *pt_list ; in tdmCdfLineDraw() local
181 pt_list[dl].pt_type = XGL_PT_F3D ; in tdmCdfLineDraw()
182 pt_list[dl].pts.f3d = &pt_f3d[p] ; in tdmCdfLineDraw()
183 pt_list[dl].bbox = NULL ; in tdmCdfLineDraw()
184 pt_list[dl].num_pts = 2 ; in tdmCdfLineDraw()
227 Xgl_pt_list *pt_list ; in tdmCdcLineDraw() local
302 pt_list[dl].bbox = NULL ; in tdmCdcLineDraw()
303 pt_list[dl].num_pts = 2 ; in tdmCdcLineDraw()
367 Xgl_pt_list *pt_list ; in tdmCdpLineDraw() local
444 pt_list[dl].bbox = NULL ; in tdmCdpLineDraw()
[all …]
H A DhwPolylineDraw.c119 Xgl_pt_list *pt_list ; in tdmCdfPolylineDraw() local
135 pt_list = (Xgl_pt_list *) (mem + sizeof(int)) ; in tdmCdfPolylineDraw()
169 pt_list = (Xgl_pt_list *)(mem+sizeof(int)); in tdmCdfPolylineDraw()
180 pt_list[nextpl].pt_type = XGL_PT_F3D; in tdmCdfPolylineDraw()
181 pt_list[nextpl].pts.f3d = pt_f3d + nextpt; in tdmCdfPolylineDraw()
182 pt_list[nextpl].bbox = NULL; in tdmCdfPolylineDraw()
183 pt_list[nextpl].num_pts = eend - estart; in tdmCdfPolylineDraw()
242 Xgl_pt_list *pt_list ; in tdmCdcPolylineDraw() local
303 pt_list[nextpl].bbox = NULL; in tdmCdcPolylineDraw()
395 Xgl_pt_list *pt_list ; in tdmCdpPolylineDraw() local
[all …]
H A DhwCacheUtilXGL.c307 _dxf_FreePointCacheXGL((Pointer)pt_list) ; in _dxf_PutPointCacheXGL()
315 Xgl_pt_list *pt_list = (Xgl_pt_list *)p ; in _dxf_FreePointCacheXGL() local
316 DPRINT1("\n(_dxf_FreePointCacheXGL %x)", pt_list) ; in _dxf_FreePointCacheXGL()
318 if (pt_list) in _dxf_FreePointCacheXGL()
320 if (pt_list->pts.color_normal_f3d) in _dxf_FreePointCacheXGL()
322 tdmFree((Pointer)pt_list->pts.color_normal_f3d) ; in _dxf_FreePointCacheXGL()
323 pt_list->pts.color_normal_f3d = 0 ; in _dxf_FreePointCacheXGL()
325 if (pt_list->bbox) in _dxf_FreePointCacheXGL()
327 tdmFree((Pointer)pt_list->bbox) ; in _dxf_FreePointCacheXGL()
328 pt_list->bbox = 0 ; in _dxf_FreePointCacheXGL()
[all …]
H A DhwMeshDraw.c.h342 register Xgl_pt_list *pt_list, *end ; in tdmMeshDraw() local
345 pt_list = stripsXGL->pt_lists ; in tdmMeshDraw()
346 end = &pt_list[stripsXGL->num_strips] ; in tdmMeshDraw()
354 for ( ; pt_list < end ; pt_list++) in tdmMeshDraw()
355 xgl_multipolyline (XGLCTX, NULL, 1, pt_list) ; in tdmMeshDraw()
360 for ( ; pt_list < end ; pt_list++, facet_list++) in tdmMeshDraw()
362 xgl_triangle_strip (XGLCTX, facet_list, pt_list) ; in tdmMeshDraw()
365 for ( ; pt_list < end ; pt_list++) in tdmMeshDraw()
367 xgl_triangle_strip (XGLCTX, NULL, pt_list) ; in tdmMeshDraw()
/dports/math/cgal/CGAL-5.3/demo/CGAL_ipelets/
H A Dhilbert_sort.cpp51 std::vector<Point_2> pt_list; in protected_run() local
53 read_active_objects( CGAL::dispatch_or_drop_output<Point_2>( std::back_inserter(pt_list) ) ); in protected_run()
55 if (pt_list.empty()) { in protected_run()
60 if (fn==0) CGAL::hilbert_sort(pt_list.begin(), pt_list.end()); in protected_run()
61 else CGAL::hilbert_sort(pt_list.begin(), pt_list.end(), CGAL::Hilbert_sort_middle_policy()); in protected_run()
63 draw_polyline_in_ipe(pt_list.begin(), pt_list.end()); in protected_run()
H A Dmulti_delaunay.cpp73 std::vector<Point_2> pt_list; in protected_run() local
77 if (pt_list.empty()){ in protected_run()
83 dt.insert(pt_list.begin(),pt_list.end()); in protected_run()
100 pt_list.clear(); in protected_run()
101 pt_list.push_back(pt0); in protected_run()
102 pt_list.push_back(pt1); in protected_run()
103 vertI_cgal -> info() = pt_list; in protected_run()
138 int order = pt_list.size()-1; in protected_run()
142 for(std::vector<Point_2>::iterator it_pt = pt_list.begin();it_pt!=pt_list.end();++it_pt){ in protected_run()
149 for(std::vector<Point_2>::iterator it_pt = pt_list.begin();it_pt!=pt_list.end();++it_pt){ in protected_run()
[all …]
H A Ddiagrams.cpp75 std::list<Point_2> pt_list; in protected_run() local
82 std::back_inserter(pt_list), in protected_run()
93 if (pt_list.empty() && sg_list.empty()){ in protected_run()
103 svd.insert(pt_list.begin(),pt_list.end()); in protected_run()
105 dt.insert(pt_list.begin(),pt_list.end()); in protected_run()
111 if (pt_list.empty() && cir_list.empty()){ in protected_run()
118 for (std::list<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();it++) in protected_run()
131 for (std::list<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();it++) in protected_run()
H A Dtriangulation.cpp64 std::list<Point_2> pt_list; in protected_run() local
71 std::back_inserter(pt_list), in protected_run()
85 if (pt_list.empty()) { in protected_run()
89 dt.insert(pt_list.begin(),pt_list.end()); in protected_run()
95 if (pt_list.empty() && sg_list.empty()){ in protected_run()
99 Cdt.insert(pt_list.begin(),pt_list.end()); in protected_run()
122 if (pt_list.empty() && cir_list.empty()){ in protected_run()
126 for (std::list<Point_2>::iterator it_pt=pt_list.begin();it_pt!=pt_list.end();++it_pt) in protected_run()
H A Dhull.cpp86 std::list<Point_2> pt_list; in protected_run() local
91 std::back_inserter(pt_list), in protected_run()
94 point_grabber(std::back_inserter(pt_list)) in protected_run()
98 if (pt_list.empty() && cir_list.empty()) { in protected_run()
105 for (std::list<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();++it) in protected_run()
161 std::list<Point_2> pt_list; in protected_run() local
165 if (pt_list.empty()) { in protected_run()
172 for(std::list<Point_2>::iterator it = pt_list.begin();it!=pt_list.end();++it){ in protected_run()
178 pt_list.clear(); in protected_run()
180 pt_list.push_back(triang.dual(itt)); in protected_run()
[all …]
H A Ddistance.cpp58 std::list<Point_2> pt_list; in protected_run() local
70 std::back_inserter(pt_list) in protected_run()
74 if (pt_list.empty()) {print_error_message(("No mark selected")); return;} in protected_run()
75 std::list<Point_2>::iterator it=pt_list.begin(); in protected_run()
77 if (pt_list.end()==it) { in protected_run()
80 if (pt_list.end()!=it) { in protected_run()
H A Dbbox_restriction.cpp57 std::vector<Point_2> pt_list; in protected_run() local
61 std::back_inserter(pt_list),std::back_inserter(cir_list), in protected_run()
68 if (pt_list.size()<2) { in protected_run()
73 CGAL::Bbox_2 bbox_2=pt_list.begin()->bbox(); in protected_run()
74 for (std::vector<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();++it) in protected_run()
H A Dcircle_pencils.cpp53 std::list<Point_2> pt_list,pt_list1; in protected_run() local
80 std::back_inserter(pt_list), in protected_run()
85 std::list<Point_2>::iterator it=pt_list.begin(); in protected_run()
90 if (it!=pt_list.end()) { c0=Circle_2(*it,0); ++it;} in protected_run()
94 if (it!=pt_list.end()) { c1=Circle_2(*it,0); ++it;} in protected_run()
98 if (it!=pt_list.end()) { c2=Circle_2(*it,0); ++it;} in protected_run()
101 if ((it!=pt_list.end())||(cit!=cir_list.end())) in protected_run()
H A Dsvdlinf.cpp57 std::list<Point_2> pt_list; in protected_run() local
68 std::back_inserter(pt_list), in protected_run()
76 if (pt_list.empty() and sg_list.empty()) { in protected_run()
115 svd.insert(pt_list.begin(),pt_list.end()); in protected_run()
H A Dpca.cpp49 std::list<Point_2> pt_list; in protected_run() local
58 std::back_inserter(pt_list), in protected_run()
82 if (!pt_list.empty()) s=1; in protected_run()
99 …linear_least_squares_fitting_2(pt_list.begin(),pt_list.end(),line,centroid,CGAL::Dimension_tag<0>(… in protected_run()
H A Dmst.cpp65 std::list<Point_2> pt_list; in protected_run() local
69 std::back_inserter(pt_list) in protected_run()
73 if (pt_list.empty()) { in protected_run()
78 Triangulation t(pt_list.begin(), pt_list.end()); in protected_run()
H A Dalpha_shapes.cpp63 std::list<Point_2> pt_list; in protected_run() local
69 CGAL::dispatch_or_drop_output<Point_2,Circle_2>(std::back_inserter(pt_list), in protected_run()
74 if (pt_list.empty() && cir_list.empty()) { in protected_run()
80 for (std::list<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();++it) in protected_run()
H A Dmesh_2.cpp58 std::list<Point_2> pt_list; in protected_run() local
66 std::back_inserter(pt_list), in protected_run()
73 if (pt_list.empty() && sg_list.empty() && pol_list.empty()) { in protected_run()
80 for (std::list<Point_2>::iterator it=pt_list.begin();it!=pt_list.end();++it) in protected_run()
H A Dhyperbolic.cpp68 std::list<Point_2> pt_list,pt_list1; in protected_run() local
85 std::back_inserter(pt_list), in protected_run()
93 std::list<Point_2>::iterator it=pt_list.begin(); in protected_run()
97 if (pt_list.empty() || cir_list.empty()){ in protected_run()
119 if (it!=pt_list.end()) { in protected_run()
126 if( (it!=pt_list.end())||(cit!=cir_list.end())){ in protected_run()
/dports/math/cgal/CGAL-5.3/examples/CGAL_ipelets/
H A Dtest_grabbers.cpp18 std::list<Point_2> pt_list; in main() local
24 …sg_list.begin(), sg_list.end(),CGAL::internal::point_grabber<Kernel>(std::back_inserter(pt_list))); in main()
26 assert (pt_list.size()==4); in main()
29 pol_list.push_back(Polygon_2(pt_list.begin(),pt_list.end())); in main()
30 pol_list.push_back(Polygon_2(pt_list.begin(),pt_list.end())); in main()
32 …l_list.begin(), pol_list.end(),CGAL::internal::point_grabber<Kernel>(std::back_inserter(pt_list))); in main()
34 assert (pt_list.size()==12); in main()
47 …std::copy(pt_list.begin(), pt_list.end(),CGAL::internal::wpoint_grabber<Kernel>(std::back_inserter… in main()
/dports/cad/alliance/alliance/src/ocp/src/placer/
H A Diocgram.y47 con_list *pt_list = NULL; variable
101 space : SPACE IOCID PTVIRG { pt_list = add_space(pt_list, con_orient, $2);
110 pt_list = add_con(pt_list, con_orient, buf);
122 pt_list = add_con(pt_list, con_orient, buf);
172 return pt_list; in iocparse()
/dports/games/shockolate/systemshock-0.8.2-43-ga9eb1b93/src/GameSrc/
H A Dfrterr.c613 _fdt_hgt_val = -pt_list[0][1]; in _fr_flat_lit_ext_wall()
617 _fdt_hgt_val = -pt_list[3][1]; in _fr_flat_lit_ext_wall()
622 _fdt_hgt_val = -pt_list[1][1]; in _fr_flat_lit_ext_wall()
626 _fdt_hgt_val = -pt_list[2][1]; in _fr_flat_lit_ext_wall()
639 ext_wall_uv_l(_fdt_tmppts[0], pt_list[0]); in _fr_tmap_ext_wall()
641 ext_wall_uv_l(_fdt_tmppts[3], pt_list[3]); in _fr_tmap_ext_wall()
644 ext_wall_uv_r(_fdt_tmppts[1], pt_list[1]); in _fr_tmap_ext_wall()
656 _fdt_hgt_val = pt_list[0][1]; in _fr_tmap_lit_ext_wall()
660 _fdt_hgt_val = pt_list[3][1]; in _fr_tmap_lit_ext_wall()
665 _fdt_hgt_val = pt_list[1][1]; in _fr_tmap_lit_ext_wall()
[all …]
/dports/cad/alliance/alliance/src/abv/src/
H A Dbvl_util.c370 void *bvl_vectnam(pt_list,left,right,name,type) in bvl_vectnam() argument
372 void *pt_list; in bvl_vectnam()
392 ptpor = (bepor_list *)pt_list;
436 ptbux = (bebux_list *)pt_list;
481 ptreg = (bereg_list *)pt_list;
526 ptaux = (beaux_list *)pt_list;
/dports/cad/alliance/alliance/src/fvh/src/
H A Dfbl_util.c446 void *fbl_vectnam(pt_list,left,right,name,type) in fbl_vectnam() argument
448 void *pt_list; in fbl_vectnam()
468 ptpor = (fbpor_list *)pt_list;
512 ptbux = (fbbux_list *)pt_list;
557 ptreg = (fbreg_list *)pt_list;
602 ptaux = (fbaux_list *)pt_list;

1234