Home
last modified time | relevance | path

Searched refs:l_edges (Results 1 – 13 of 13) sorted by relevance

/dports/cad/gmsh/gmsh-4.9.2-source/Geo/
H A DGVertex.cpp39 if(std::find(l_edges.begin(), l_edges.end(), e) == l_edges.end()) in addEdge()
40 l_edges.push_back(e); in addEdge()
45 auto it = std::find(l_edges.begin(), l_edges.end(), e); in delEdge()
46 if(it != l_edges.end()) l_edges.erase(it); in delEdge()
64 if(l_edges.size()) { in getAdditionalInfoString()
66 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in getAdditionalInfoString()
67 if(it != l_edges.begin()) sstream << ", "; in getAdditionalInfoString()
127 std::find_if(begin(l_edges), end(l_edges), in isOnSeam()
129 return location != end(l_edges); in isOnSeam()
137 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in faces()
H A DgmshVertex.cpp67 if(l_edges.size() == 1 && (*l_edges.begin())->getBeginVertex() == in reparamOnFace()
68 (*l_edges.begin())->getEndVertex()) { in reparamOnFace()
69 Range<double> bb = (*l_edges.begin())->parBounds(0); in reparamOnFace()
70 return (*l_edges.begin())->reparamOnFace(face, bb.low(), dir); in reparamOnFace()
H A DGVertex.h25 std::vector<GEdge *> l_edges;
54 virtual std::vector<GEdge *> const &edges() const { return l_edges; } in edges()
57 virtual std::size_t numEdges() const { return l_edges.size(); } in numEdges()
H A DGFace.h36 std::vector<GEdge *> l_edges;
99 virtual std::vector<GEdge *> const &edges() const { return l_edges; } in edges()
100 void set(const std::vector<GEdge *> &f) { l_edges = f; } in set()
104 l_edges.push_back(f); in setEdge()
112 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) in containsEdge()
H A DGFace.cpp80 const auto found = std::find(l_edges.begin(), l_edges.end(), edge); in delEdge()
82 if(found != l_edges.end()) { l_edges.erase(found); } in delEdge()
112 el.getEdges(l_edges); in setBoundEdges()
126 if(std::find(l_edges.begin(), l_edges.end(), ge) == l_edges.end()) { in setBoundEdges()
351 for(auto ge : l_edges) { in vertices()
384 if(l_edges.size() > 20) { in getAdditionalInfoString()
392 else if(l_edges.size()) { in getAdditionalInfoString()
394 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in getAdditionalInfoString()
1517 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in genusGeom()
1930 for(auto eIter = l_edges.begin(); eIter != l_edges.end(); ++eIter) { in setMeshMaster()
[all …]
H A DOCCFace.cpp56 l_edges.clear(); in _setup()
101 l_edges.push_back(it->getEdge()); in _setup()
137 l_edges.size(), _umin, _umax, _vmin, _vmax); in _setup()
171 for(std::size_t i = 0; i < l_edges.size(); i++) { in _setup()
172 GEdge *e = l_edges[i]; in _setup()
H A DxyFace.h16 xyFace(GModel *gm, int t, xyEdge *e) : GFace(gm, t) { l_edges.push_back(e); } in xyFace()
H A DOCCVertex.cpp43 for(auto ge : l_edges) { in reparamOnFace()
H A DgmshFace.cpp47 l_edges.clear(); in resetNativePtr()
92 l_edges.push_back(e); in resetNativePtr()
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/
H A DBackgroundMeshTools.cpp32 std::vector<GEdge *> const &l_edges = gv->edges(); in max_edge_curvature() local
33 for(auto ite = l_edges.begin(); ite != l_edges.end(); ++ite) { in max_edge_curvature()
352 std::vector<GEdge *> const &l_edges = gv->edges(); in max_edge_curvature_metric() local
353 for(auto ite = l_edges.begin(); ite != l_edges.end(); ++ite) { in max_edge_curvature_metric()
H A DmeshGRegionBoundaryRecovery.cpp740 std::set<int> l_faces, l_edges; in reconstructmesh() local
755 l_edges.insert(shellmark(parentseg)); in reconstructmesh()
869 if(l_edges.size() > 0) { in reconstructmesh()
873 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in reconstructmesh()
H A DmeshGRegionExtruded.cpp167 std::vector<GEdge *> const &l_edges = from->edges(); in extrudeMesh() local
168 for(auto it = l_edges.begin(); it != l_edges.end(); ++it) { in extrudeMesh()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/hxt/tetBR/src/
H A Dhxt_boundary_recovery.cxx404 std::set<int> /*l_faces, */l_edges; in reconstructmesh() local
432 l_edges.insert(shellmark(parentseg)); in reconstructmesh()