| /dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/ |
| H A D | bgl_primal_adapter.cpp | 86 Arrangement_2::Vertex_iterator vit; in main() local
90 for (vit = arr.vertices_begin(); vit != arr.vertices_end(); ++vit) in main()
91 std::cout << "(" << vit->point() << ") at distance " in main()
92 << dist_map[vit] << std::endl; in main()
|
| H A D | consolidated_curve_data.cpp | 53 Arrangement_2::Vertex_const_iterator vit; in main() local
56 for (vit = arr.vertices_begin(); vit != arr.vertices_end(); ++vit) { in main()
64 eit = first = vit->incident_halfedges(); in main()
82 std::cout << "Red-blue intersection at (" << vit->point() << ")" in main()
|
| /dports/math/cgal/CGAL-5.3/examples/BGL_arrangement_2/ |
| H A D | primal.cpp | 80 Arrangement_2::Vertex_iterator vit; in main() local
84 for (vit = arr.vertices_begin(); vit != arr.vertices_end(); ++vit) in main()
85 std::cout << "(" << vit->point() << ") at distance " in main()
86 << dist_map[vit] << std::endl; in main()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/IO/ |
| H A D | write_VTU.h | 246 vit != tr.finite_vertices_end(); in write_cdt_points_tag()
247 ++vit) in write_cdt_points_tag()
249 V[vit] = inum++; in write_cdt_points_tag()
250 os << vit->point()[0] << " "; in write_cdt_points_tag()
251 os << vit->point()[1] << " "; in write_cdt_points_tag()
253 os << vit->point()[2] << " "; in write_cdt_points_tag()
278 vit != tr.finite_vertices_end(); in write_cdt_points()
279 ++vit) in write_cdt_points()
282 coordinates.push_back(vit->point()[0]); in write_cdt_points()
283 coordinates.push_back(vit->point()[1]); in write_cdt_points()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | basic_properties.c | 129 igraph_vit_t vit; in igraph_diversity() local
167 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_diversity()
168 IGRAPH_FINALLY(igraph_vit_destroy, &vit); in igraph_diversity()
170 for (IGRAPH_VIT_RESET(vit), i = 0; in igraph_diversity()
171 !IGRAPH_VIT_END(vit); in igraph_diversity()
172 IGRAPH_VIT_NEXT(vit), i++) { in igraph_diversity()
173 long int v = IGRAPH_VIT_GET(vit); in igraph_diversity()
185 igraph_vit_destroy(&vit); in igraph_diversity()
|
| /dports/biology/abyss/abyss-2.3.1/Graph/ |
| H A D | GraphAlgorithms.h | 42 for (adjacency_iterator vit = vrange.first; in find_transitive_edges() local
43 vit != vrange.second; ++vit) in find_transitive_edges()
44 seen[get(vertex_index, g, *vit)] = false; in find_transitive_edges()
47 for (adjacency_iterator vit = vrange.first; in find_transitive_edges() local
48 vit != vrange.second; ++vit) { in find_transitive_edges()
49 vertex_descriptor v = *vit; in find_transitive_edges()
|
| H A D | GraphUtil.h | 20 std::pair<vertex_iterator, vertex_iterator> vit = vertices(g); in num_vertices_removed() local
21 for (vertex_iterator u = vit.first; u != vit.second; ++u) in num_vertices_removed()
33 std::pair<vertex_iterator, vertex_iterator> vit = vertices(g); in printHistogram() local
34 for (vertex_iterator u = vit.first; u != vit.second; ++u) { in printHistogram()
|
| /dports/math/cgal/CGAL-5.3/examples/Skin_surface_3/ |
| H A D | skin_surface_writer.h | 30 for (Vertex_iterator vit = p.vertices_begin(); in write_polyhedron_with_normals() local
31 vit != p.vertices_end(); vit ++) { in write_polyhedron_with_normals()
32 Vector n = policy.normal(vit); in write_polyhedron_with_normals()
34 out << vit->point() << " " << n << std::endl; in write_polyhedron_with_normals()
|
| /dports/math/cgal/CGAL-5.3/examples/Surface_mesh_shortest_path/ |
| H A D | shortest_paths_with_id.cpp | 50 vertex_iterator vit, vit_end; in main() local
51 for ( boost::tie(vit, vit_end) = vertices(tmesh); in main()
52 vit != vit_end; ++vit) in main()
55 shortest_paths.shortest_path_points_to_source_points(*vit, std::back_inserter(points)); in main()
|
| H A D | shortest_paths.cpp | 50 vertex_iterator vit, vit_end; in main() local
51 for ( boost::tie(vit, vit_end) = vertices(tmesh); in main()
52 vit != vit_end; ++vit) in main()
55 shortest_paths.shortest_path_points_to_source_points(*vit, std::back_inserter(points)); in main()
|
| H A D | shortest_paths_OpenMesh.cpp | 62 vertex_iterator vit, vit_end; in main() local
63 for ( boost::tie(vit, vit_end) = vertices(tmesh); in main()
64 vit != vit_end; ++vit) in main()
67 shortest_paths.shortest_path_points_to_source_points(*vit, std::back_inserter(points)); in main()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boxm2/volm/exe/ |
| H A D | boxm2_volumetric_evaluate_roi_max_score.cxx | 297 …for (std::vector<double>::iterator vit = test_img_thres.begin(); vit != test_img_thres.end(); ++vi…
300 cnt_pair.first = *vit; cnt_pair.second = cnt_vec;
343 …for (std::vector<double>::iterator vit = test_img_thres.begin(); vit != test_img_thres.end(); ++vi…
345 float pre = *vit/max_score_all;
346 folder_name << out() << "/ProbMap_scaled_" << *vit;
361 …for (std::vector<double>::iterator vit = test_img_thres.begin(); vit != test_img_thres.end(); ++vi…
368 out_png(ii, jj) = volm_io::scale_score_to_1_255_sig(kl(), ku(), *vit, tile_img(ii,jj));
393 for (std::vector<double>::iterator vit = thresholds.begin(); vit != thresholds.end(); ++vit) {
395 fout << *vit;
|
| /dports/math/polymake/polymake-4.5/apps/polytope/src/ |
| H A D | universal_polytope_ilps.cc | 63 auto vit = volume_vect.begin(); in universal_polytope_impl() local
65 *vit = abs(det(points.minor(f, All))), ++vit; in universal_polytope_impl()
106 Vector<Integer>::iterator vit = volume_vect.begin(); in foldable_max_signature_ilp() local
111 *vit = max_simplex_vol; ++vit; // black maximal simplex in foldable_max_signature_ilp()
112 *vit = max_simplex_vol; ++vit; // white maximal simplex in foldable_max_signature_ilp()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/volm/desc/ |
| H A D | volm_desc_ex_2d_matcher.cxx | 121 for (unsigned int & vit : grd_bin_id) in create_query_desc() local
122 weights_hist_[vit] += w_grd; in create_query_desc()
153 for (unsigned int & vit : obj_bin_id) in create_query_desc() local
154 weights_hist_[vit] += w_obj; in create_query_desc()
160 for (std::vector<float>::iterator vit = weights_hist_.begin(); vit != weights_hist_.end(); ++vit) in create_query_desc()
161 std::cout << *vit << ' '; in create_query_desc()
|
| /dports/science/axom/axom-0.6.1/src/axom/sidre/core/ |
| H A D | Buffer.cpp | 176 std::set<View*>::iterator vit = m_views.begin(); in deallocate() local
177 for(; vit != m_views.end(); ++vit) in deallocate()
179 (*vit)->unapply(); in deallocate()
392 std::set<View*>::iterator vit = m_views.begin(); in detachFromAllViews() local
393 for(; vit != m_views.end(); ++vit) in detachFromAllViews()
395 (*vit)->setBufferViewToEmpty(); in detachFromAllViews()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Triangulation_ds_vertex.h | 80 typename TDS::Full_cell::Vertex_handle_iterator vit(full_cell()->vertices_begin());
82 while( vit != full_cell()->vertices_end() )
84 if( Vertex_handle() == *vit )
86 if( this == &(**vit) )
91 ++vit;
|
| /dports/math/graphthing/graphthing-1.3.2/src/ |
| H A D | factory.cc | 91 Graph::v_const_iterator vit; in C() local
99 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in C()
101 e = new Edge (prev, *vit); in C()
104 first = *vit; in C()
105 prev = *vit; in C()
292 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in S()
293 if (*vit == v) in S()
295 e = new Edge (v, *vit); in S()
316 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in W()
317 if (*vit == v) in W()
[all …]
|
| /dports/math/cgal/CGAL-5.3/demo/Triangulation_2/ |
| H A D | Regular_triangulation_2.cpp | 303 vit = dt.finite_vertices_begin(), in on_actionSavePoints_triggered() local
305 vit!= end; ++vit) in on_actionSavePoints_triggered()
307 points_3.push_back(K::Point_3(vit->point().x(), in on_actionSavePoints_triggered()
308 vit->point().y(), in on_actionSavePoints_triggered()
309 vit->point().weight())); in on_actionSavePoints_triggered()
317 vit = dt.finite_vertices_begin(), in on_actionSavePoints_triggered() local
319 vit!= end; ++vit) in on_actionSavePoints_triggered()
321 ofs << vit->point() << std::endl; in on_actionSavePoints_triggered()
|
| /dports/math/igraph/igraph-0.9.5/examples/simple/ |
| H A D | igraph_get_all_shortest_paths_dijkstra.c | 63 igraph_vit_t vit; in check_nrgeo() local
86 igraph_vit_create(graph, vs, &vit); in check_nrgeo()
87 for (IGRAPH_VIT_RESET(vit); !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit)) { in check_nrgeo()
88 long int node = IGRAPH_VIT_GET(vit); in check_nrgeo()
94 igraph_vit_destroy(&vit); in check_nrgeo()
|
| /dports/cad/openscad-devel/openscad-63a7c77740030c63d646eb0684ba6947eecb0db7/test-code/ |
| H A D | nef_polyhedron_2-bug.cc | 42 for (Vertex_const_iterator vit = explorer.vertices_begin(); vit!=explorer.vertices_end(); ++vit) { in print() local
43 std::cout << VI(vit, true); in print()
44 …if (explorer.is_standard(vit)) std::cout << " [ " << to_double(explorer.point(vit).x()) << ", " <<… in print()
|
| /dports/cad/openscad/openscad-41f58fe57c03457a3a8b4dc541ef5654ec3e8c78/test-code/ |
| H A D | nef_polyhedron_2-bug.cc | 42 for (Vertex_const_iterator vit = explorer.vertices_begin(); vit!=explorer.vertices_end(); ++vit) { in print() local
43 std::cout << VI(vit, true); in print()
44 …if (explorer.is_standard(vit)) std::cout << " [ " << to_double(explorer.point(vit).x()) << ", " <<… in print()
|
| /dports/math/polymake/polymake-4.5/apps/topaz/src/ |
| H A D | lawler.cc | 44 for (auto vit=entire(V); !vit.at_end(); ++vit) in lawler() local
45 Cnew.replaceMin(*cit + *vit); in lawler()
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_experimental/filter_multiscale_align/lib/Patate/common/surface_mesh/ |
| H A D | objWriter.hpp | 26 for (typename Mesh::VertexIterator vit = mesh.verticesBegin(); in write() local
27 vit != mesh.verticesEnd(); ++vit) in write()
29 out << "v " << mesh.position(*vit).transpose() << "\n"; in write()
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/io/ |
| H A D | NCHelperFV.cpp | 50 std::vector<std::string>::iterator vit; in init_mesh_vals() local
52 if ((vit = std::find(dimNames.begin(), dimNames.end(), "slon")) != dimNames.end()) in init_mesh_vals()
53 idx = vit - dimNames.begin(); in init_mesh_vals()
63 idx = vit - dimNames.begin(); in init_mesh_vals()
73 if ((vit = std::find(dimNames.begin(), dimNames.end(), "lon")) != dimNames.end()) in init_mesh_vals()
74 idx = vit - dimNames.begin(); in init_mesh_vals()
94 idx = vit - dimNames.begin(); in init_mesh_vals()
111 idx = vit - dimNames.begin(); in init_mesh_vals()
113 idx = vit - dimNames.begin(); in init_mesh_vals()
122 idx = vit - dimNames.begin(); in init_mesh_vals()
[all …]
|
| /dports/math/cgal/CGAL-5.3/examples/Optimal_transportation_reconstruction_2/ |
| H A D | otr2_mass_example.cpp | 60 std::vector<Point>::iterator vit; in main() local
61 for (vit = isolated_vertices.begin(); vit != isolated_vertices.end(); vit++) in main()
62 std::cout << *vit << std::endl; in main()
|