Searched refs:it_edge (Results 1 – 7 of 7) sorted by relevance
/dports/graphics/blender/blender-2.91.0/source/blender/freestyle/intern/stroke/ |
H A D | Operators.cpp | 96 ++it_edge) { in chain() 97 if (pred(**it_edge) < 0) { in chain() 162 ++it_edge) { in chain() 163 if (pred(**it_edge) < 0) { in chain() 239 ++it_edge) { 240 if (pred(**it_edge)) { 291 ++it_edge) { 292 if (pred(**it_edge) || pred_ts(**it_edge)) { 343 ++it_edge) { in bidirectionalChain() 344 if (pred(**it_edge) < 0) { in bidirectionalChain() [all …]
|
/dports/math/cgal/CGAL-5.3/demo/CGAL_ipelets/ |
H A D | triangulation.cpp | 104 …for (Polygon_2::Edge_const_iterator it_edge=it_pol->edges_begin();it_edge!=it_pol->edges_end();++i… in protected_run() local 105 Cdt.insert_constraint(it_edge->point(0),it_edge->point(1)); in protected_run()
|
/dports/cad/sumo/sumo-1.2.0/src/netbuild/ |
H A D | NBNodeCont.cpp | 409 …for (EdgeVector::const_iterator it_edge = current->getEdges().begin(); it_edge != current->getEdge… in removeUnwishedNodes() local 410 if (edges2keep.find((*it_edge)->getID()) != edges2keep.end()) { in removeUnwishedNodes() 774 …or (EdgeVector::const_iterator it_edge = n->getOutgoingEdges().begin(); it_edge != n->getOutgoingE… in pruneClusterFringe() local 775 NBNode* neighbor = (*it_edge)->getToNode(); in pruneClusterFringe() 777 clusterDist = MIN2(clusterDist, (*it_edge)->getLoadedLength()); in pruneClusterFringe() 781 …or (EdgeVector::const_iterator it_edge = n->getIncomingEdges().begin(); it_edge != n->getIncomingE… in pruneClusterFringe() local 782 NBNode* neighbor = (*it_edge)->getFromNode(); in pruneClusterFringe() 838 …(EdgeVector::const_iterator it_edge = (*j)->getIncomingEdges().begin(); it_edge != (*j)->getIncomi… in feasibleCluster() local 839 NBEdge* edge = *it_edge; in feasibleCluster() 845 …(EdgeVector::const_iterator it_edge = (*j)->getOutgoingEdges().begin(); it_edge != (*j)->getOutgoi… in feasibleCluster() local [all …]
|
H A D | NBAlgorithms_Ramps.cpp | 70 … for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) { in computeRamps() local 71 noramps.insert((*it_edge)->getID()); in computeRamps()
|
H A D | NBNetBuilder.cpp | 177 … for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) { in compute() local 178 nodeIDs.push_back((*it_edge)->getToNode()->getID()); in compute()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/Corefinement/ |
H A D | intersection_impl.h | 943 typename std::vector<halfedge_descriptor>::iterator it_edge=all_edges.begin(); in compute_intersection_points() local 964 for (;it_edge!=all_edges.end();++it_edge){ in compute_intersection_points() 967 if ( it_edge==all_edges.begin() ) in compute_intersection_points() 995 for (;it_edge!=all_edges.end();++it_edge){ in compute_intersection_points() 996 if ( it_edge!=all_edges.begin() ){ in compute_intersection_points() 1000 cip_handle_case_edge(node_id,fset_bis,*it_edge,h_2,tm1,tm2); in compute_intersection_points() 1010 cip_handle_case_edge(node_id,&fset,*it_edge,h_2,tm1,tm2); in compute_intersection_points() 1031 for (;it_edge!=all_edges.end();++it_edge){ in compute_intersection_points() 1032 if ( it_edge!=all_edges.begin() ){ in compute_intersection_points() 1036 cip_handle_case_vertex(node_id,fset_bis,*it_edge,h_2,tm1,tm2); in compute_intersection_points() [all …]
|
/dports/cad/sumo/sumo-1.2.0/src/netwrite/ |
H A D | NWWriter_SUMO.cpp | 143 …or (std::map<std::string, NBEdge*>::const_iterator it_edge = ec.begin(); it_edge != ec.end(); it_e… in writeNetwork() local 144 NBEdge* from = it_edge->second; in writeNetwork()
|