Home
last modified time | relevance | path

Searched refs:e_first (Results 1 – 25 of 81) sorted by relevance

1234

/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/intern/
H A Dbmesh_structure.c205 BMEdge *e_iter, *e_first; in bmesh_disk_edge_exists() local
208 e_first = e_iter = v1->e; in bmesh_disk_edge_exists()
224 BMEdge *e_first, *e_iter; in bmesh_disk_count() local
225 e_iter = e_first = v->e; in bmesh_disk_count()
228 } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first); in bmesh_disk_count()
237 BMEdge *e_first, *e_iter; in bmesh_disk_count_at_most() local
238 e_iter = e_first = v->e; in bmesh_disk_count_at_most()
283 BMEdge *e_first, *e_iter; in bmesh_disk_facevert_count() local
286 e_first = e_iter = v->e; in bmesh_disk_facevert_count()
301 BMEdge *e_first, *e_iter; in bmesh_disk_facevert_count_at_most() local
[all …]
H A Dbmesh_iterators.c447 iter->e_first = iter->vdata->e; in bmiter__edge_of_vert_begin()
451 iter->e_first = NULL; in bmiter__edge_of_vert_begin()
462 if (iter->e_next == iter->e_first) { in bmiter__edge_of_vert_step()
479 iter->e_first = iter->l_first->e; in bmiter__face_of_vert_begin()
480 iter->e_next = iter->e_first; in bmiter__face_of_vert_begin()
485 iter->e_first = iter->e_next = NULL; in bmiter__face_of_vert_begin()
518 iter->e_first = iter->l_first->e; in bmiter__loop_of_vert_begin()
519 iter->e_next = iter->e_first; in bmiter__loop_of_vert_begin()
524 iter->e_first = iter->e_next = NULL; in bmiter__loop_of_vert_begin()
H A Dbmesh_query.c672 l_a = e_first->l; in BM_vert_other_disk_edge()
690 l_a = e_first->l; in BM_vert_other_disk_edge()
905 e_first = e_iter = v->e; in BM_vert_face_check()
922 BMEdge *e_first, *e_iter; in BM_vert_is_wire() local
924 e_first = e_iter = v->e; in BM_vert_is_wire()
955 e_first = e_iter = v->e; in BM_vert_is_manifold()
988 e_first = l_first->e; in BM_vert_is_manifold()
993 e_prev = e_first; in BM_vert_is_manifold()
1046 BMEdge *e_iter, *e_first; in bm_loop_region_count__clear() local
1049 e_iter = e_first = l->e; in bm_loop_region_count__clear()
[all …]
H A Dbmesh_marking.c74 const BMEdge *e_iter = e_first; in bm_vert_is_edge_select_any_other()
77 while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first) { in bm_vert_is_edge_select_any_other()
89 const BMEdge *e_iter, *e_first;
90 e_iter = e_first = v->e;
95 } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first);
104 const BMEdge *e_iter, *e_first; in bm_vert_is_edge_visible_any() local
105 e_iter = e_first = v->e; in bm_vert_is_edge_visible_any()
110 } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first); in bm_vert_is_edge_visible_any()
1313 BMEdge *e_iter, *e_first; in BM_vert_hide_set() local
1314 e_iter = e_first = v->e; in BM_vert_hide_set()
[all …]
H A Dbmesh_iterators.h117 BMEdge *e_first, *e_next; member
122 BMEdge *e_first, *e_next; member
127 BMEdge *e_first, *e_next; member
/dports/devel/libxo/libxo-0.6.1/tests/core/
H A Dtest_03.c29 const char *e_first; in main() member
48 for ( ; ep->e_first; ep++) { in main()
51 ep->e_first, ep->e_last, ep->e_dept); in main()
H A Dtest_04.c29 const char *e_first; in main() member
49 for ( ; ep->e_first; ep++) { in main()
53 ep->e_first, ep->e_last, ep->e_dept); in main()
H A Dtest_06.c29 const char *e_first; in main() member
50 for ( ; ep->e_first; ep++) { in main()
53 ep->e_first, ep->e_last, ep->e_dept); in main()
H A Dtest_07.c30 const char *e_first; in main() member
77 for ( ; ep->e_first; ep++) { in main()
82 ep->e_first, ep->e_nic, ep->e_last, ep->e_dept, ep->e_percent); in main()
H A Dtest_05.c38 const char *e_first; in main() member
124 for ( ; ep->e_first; ep++) { in main()
129 ep->e_first, ep->e_nic, ep->e_last, ep->e_dept, ep->e_percent); in main()
/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/
H A Dordered_out_edges.cpp122 Traits::out_edge_iterator e_first, e_last; in main()
131 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
132 while (e_first != e_last) in main()
133 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/
H A Dordered_out_edges.cpp122 Traits::out_edge_iterator e_first, e_last; in main()
131 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
132 while (e_first != e_last) in main()
133 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/
H A Dordered_out_edges.cpp109 Traits::out_edge_iterator e_first, e_last; in main()
118 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
119 while (e_first != e_last) in main()
120 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/
H A Dordered_out_edges.cpp109 Traits::out_edge_iterator e_first, e_last; in main()
118 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
119 while (e_first != e_last) in main()
120 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/example/
H A Dordered_out_edges.cpp109 Traits::out_edge_iterator e_first, e_last; in main()
118 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
119 while (e_first != e_last) in main()
120 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/
H A Dordered_out_edges.cpp109 Traits::out_edge_iterator e_first, e_last; in main()
118 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
119 while (e_first != e_last) in main()
120 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/example/
H A Dordered_out_edges.cpp109 Traits::out_edge_iterator e_first, e_last; in main()
118 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
119 while (e_first != e_last) in main()
120 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/math/libflame/libflame-5.2.0/src/base/flamec/util/lapack/
H A DFLA_Norm1_tridiag.c81 float e_first = e[ (0 )*inc_e ]; in FLA_Norm1_tridiag_ops() local
87 nm = max( fabs( d_first ) + fabs( e_first ), in FLA_Norm1_tridiag_ops()
128 double e_first = e[ (0 )*inc_e ]; in FLA_Norm1_tridiag_opd() local
134 nm = max( fabs( d_first ) + fabs( e_first ), in FLA_Norm1_tridiag_opd()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/example/
H A Dordered_out_edges.cpp122 Traits::out_edge_iterator e_first, e_last; in main()
131 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
132 while (e_first != e_last) in main()
133 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/example/
H A Dordered_out_edges.cpp133 Traits::out_edge_iterator e_first, e_last; in main()
142 boost::tie(e_first, e_last) = edge_range(0, 1, g); in main()
143 while (e_first != e_last) in main()
144 std::cout << "name(0,1) = " << name[*e_first++] << std::endl; in main()
/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/tools/
H A Dbmesh_decimate_collapse.c864 e_iter = e_first; in bm_edge_collapse_is_degenerate_topology()
870 } while ((e_iter = bmesh_disk_edge_next(e_iter, e_first->v1)) != e_first); in bm_edge_collapse_is_degenerate_topology()
872 e_iter = e_first; in bm_edge_collapse_is_degenerate_topology()
878 } while ((e_iter = bmesh_disk_edge_next(e_iter, e_first->v2)) != e_first); in bm_edge_collapse_is_degenerate_topology()
881 e_iter = e_first; in bm_edge_collapse_is_degenerate_topology()
884 } while ((e_iter = bmesh_disk_edge_next(e_iter, e_first->v1)) != e_first); in bm_edge_collapse_is_degenerate_topology()
909 l_radial = e_first->l; in bm_edge_collapse_is_degenerate_topology()
928 e_iter = e_first; in bm_edge_collapse_is_degenerate_topology()
933 } while ((e_iter = bmesh_disk_edge_next(e_iter, e_first->v2)) != e_first); in bm_edge_collapse_is_degenerate_topology()
1235 BMEdge *e_first; in bm_decim_edge_collapse() local
[all …]
H A Dbmesh_separate.c98 BMEdge *e_first, *e_iter; in BM_mesh_separate_faces() local
99 e_iter = e_first = l_iter->e; in BM_mesh_separate_faces()
112 } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first); in BM_mesh_separate_faces()
/dports/math/fcl05/fcl-0.5.0/include/fcl/shape/
H A Dgeometric_shapes.h408 int e_first = index[j]; in computeMomentofInertia() local
410 const Vec3f& v1 = points[e_first]; in computeMomentofInertia()
448 int e_first = index[j]; in computeCOM() local
450 const Vec3f& v1 = points[e_first]; in computeCOM()
454 com += (points[e_first] + points[e_second] + plane_center) * d_six_vol; in computeCOM()
482 int e_first = index[j]; in computeVolume() local
484 const Vec3f& v1 = points[e_first]; in computeVolume()
/dports/math/fcl/fcl-0.7.0/include/fcl/geometry/shape/
H A Dconvex-inl.h134 int e_first = faces[vertex_base + j]; in computeMomentofInertia() local
136 const Vector3<S>& v1 = vertices[e_first]; in computeMomentofInertia()
185 int e_first = faces[face_index + j]; in computeCOM() local
187 const Vector3<S>& v1 = vertices[e_first]; in computeCOM()
232 int e_first = faces[face_index + j]; in computeVolume() local
234 const Vector3<S>& v1 = vertices[e_first]; in computeVolume()
/dports/math/cgal/CGAL-5.3/include/CGAL/Nef_S2/
H A Dleda_sphere_map.h54 { Halfedge_handle e_res,e_rev, e_first = G.first_adj_edge(v); in new_halfedge_pair_at_source() local
55 if ( e_first == nil ) { in new_halfedge_pair_at_source()
59 e_res = G.new_edge(e_first,v,LEDA::before); in new_halfedge_pair_at_source()
60 e_rev = G.new_edge(e_first,v,LEDA::before); in new_halfedge_pair_at_source()

1234