Home
last modified time | relevance | path

Searched refs:vertexMap (Results 1 – 25 of 120) sorted by relevance

12345

/dports/graphics/geos/geos-3.9.1/src/edgegraph/
H A DEdgeGraph.cpp64 auto it = vertexMap.find(orig); in addEdge()
65 if (it != vertexMap.end()) { in addEdge()
99 vertexMap[orig] = e; in insert()
103 auto it = vertexMap.find(dest); in insert()
104 if (it != vertexMap.end()) { in insert()
111 vertexMap[dest] = e->sym(); in insert()
120 for (auto it = vertexMap.begin(); it != vertexMap.end(); ++it) { in getVertexEdges()
131 auto it = vertexMap.find(orig); in findEdge()
132 if (it != vertexMap.end()) { in findEdge()
/dports/graphics/qgis-ltr/qgis-3.16.16/src/app/vertextool/
H A Dqgsvertexeditor.cpp81 return mLockedFeature->vertexMap().count(); in rowCount()
99 if ( index.row() >= mLockedFeature->vertexMap().count() ) in data()
106 const QgsVertexEntry *vertex = mLockedFeature->vertexMap().at( index.row() ); in data()
296 const QgsVertexEntry *entry = mLockedFeature->vertexMap().at( row ); in calcR()
302 const QgsPoint &p1 = mLockedFeature->vertexMap().at( row - 1 )->point(); in calcR()
303 const QgsPoint &p2 = mLockedFeature->vertexMap().at( row )->point(); in calcR()
304 const QgsPoint &p3 = mLockedFeature->vertexMap().at( row + 1 )->point(); in calcR()
386 const QList<QgsVertexEntry *> &vertexMap = mLockedFeature->vertexMap(); in updateTableSelection() local
389 for ( int i = 0, n = vertexMap.size(); i < n; ++i ) in updateTableSelection()
391 if ( vertexMap[i]->isSelected() ) in updateTableSelection()
[all …]
/dports/graphics/qgis/qgis-3.22.3/src/app/vertextool/
H A Dqgsvertexeditor.cpp83 return mLockedFeature->vertexMap().count(); in rowCount()
101 if ( index.row() >= mLockedFeature->vertexMap().count() ) in data()
108 const QgsVertexEntry *vertex = mLockedFeature->vertexMap().at( index.row() ); in data()
298 const QgsVertexEntry *entry = mLockedFeature->vertexMap().at( row ); in calcR()
304 const QgsPoint &p1 = mLockedFeature->vertexMap().at( row - 1 )->point(); in calcR()
305 const QgsPoint &p2 = mLockedFeature->vertexMap().at( row )->point(); in calcR()
306 const QgsPoint &p3 = mLockedFeature->vertexMap().at( row + 1 )->point(); in calcR()
388 const QList<QgsVertexEntry *> &vertexMap = mLockedFeature->vertexMap(); in updateTableSelection() local
391 for ( int i = 0, n = vertexMap.size(); i < n; ++i ) in updateTableSelection()
393 if ( vertexMap[i]->isSelected() ) in updateTableSelection()
[all …]
/dports/math/dune-alugrid/dune-alugrid-08c6496d4d4a33df6456c3b402182f353dc2e76d/dune/alugrid/impl/parallel/
H A Daluzoltan.hh80 _vertexMap( vertexMap ), in ObjectCollection()
86 ldb_vertex_map_t& vertexMap() { return _vertexMap; } in vertexMap() function in ALUGridZoltan::ObjectCollection
107 return objs->vertexMap().size(); in get_number_of_objects()
119 ldb_vertex_map_t& vertexMap = objs->vertexMap(); in get_object_list() local
124 const iterator end = vertexMap.end(); in get_object_list()
247 ldb_vertex_map_t& vertexMap = objs->vertexMap(); in get_geometry_list() local
252 const iterator end = vertexMap.end(); in get_geometry_list()
267 ldb_vertex_map_t& vertexMap, in CALL_Zoltan_LB_Partition() argument
289 ObjectCollectionType objects( rank, vertexMap, edgeSet ); in CALL_Zoltan_LB_Partition()
389 alugrid_assert ( vertex != vertexMap.end () ); in CALL_Zoltan_LB_Partition()
[all …]
H A Dalusfc.hh19 vertexmap_t& vertexMap, // the space filling curve in CALL_spaceFillingCurve() argument
31 const iterator vertexEnd = vertexMap.end(); in CALL_spaceFillingCurve()
34 for( iterator it = vertexMap.begin(); it != vertexEnd; ++ it ) in CALL_spaceFillingCurve()
44 for( iterator it = vertexMap.begin(); it != vertexEnd; ++ it ) in CALL_spaceFillingCurve()
91 for (iterator it = vertexMap.begin (); it != vertexEnd; ) in CALL_spaceFillingCurve()
96 vertexMap.erase( it++ ); in CALL_spaceFillingCurve()
166 vertexmap_t& vertexMap, // the space filling curve in CALL_parallelSpaceFillingCurve() argument
185 const iterator vertexEnd = vertexMap.end(); in CALL_parallelSpaceFillingCurve()
190 for( iterator it = vertexMap.begin(); it != vertexEnd; ++ it ) in CALL_parallelSpaceFillingCurve()
275 for( iterator it = vertexMap.begin(); it != vertexEnd; ++ it ) in CALL_parallelSpaceFillingCurve()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/edgegraph/
H A DEdgeGraph.java40 private Map vertexMap = new HashMap(); field in EdgeGraph
85 HalfEdge eAdj = (HalfEdge) vertexMap.get(orig); in addEdge()
126 vertexMap.put(orig, e); in insert()
129 HalfEdge eAdjDest = (HalfEdge) vertexMap.get(dest); in insert()
134 vertexMap.put(dest, e.sym()); in insert()
141 return vertexMap.values(); in getVertexEdges()
153 HalfEdge e = (HalfEdge) vertexMap.get(orig); in findEdge()
/dports/math/vtk8/VTK-8.2.0/Infovis/Core/
H A DvtkExtractSelectedGraph.cxx298 std::map<vtkIdType, vtkIdType> vertexMap; in RequestData() local
323 vertexMap[inVert] = outVert; in RequestData()
344 vertexMap[inVert] = outVert; in RequestData()
365 if (vertexMap.find(e.Source) == vertexMap.end()) in RequestData()
370 if (vertexMap.find(e.Target) == vertexMap.end()) in RequestData()
388 vertexMap[addVert[j]] = outVert; in RequestData()
392 vtkIdType source = vertexMap[e.Source]; in RequestData()
393 vtkIdType target = vertexMap[e.Target]; in RequestData()
419 if (vertexMap.find(e.Source) != vertexMap.end() && in RequestData()
420 vertexMap.find(e.Target) != vertexMap.end()) in RequestData()
[all …]
H A DvtkExtractSelectedTree.cxx89 std::map<vtkIdType, vtkIdType> vertexMap; in BuildTree() local
96 vertexMap[inVert] = outVert; in BuildTree()
106 if (vertexMap.find(e.Source) != vertexMap.end() && in BuildTree()
107 vertexMap.find(e.Target) != vertexMap.end()) in BuildTree()
109 vtkIdType source = vertexMap[e.Source]; in BuildTree()
110 vtkIdType target = vertexMap[e.Target]; in BuildTree()
/dports/math/vtk9/VTK-9.1.0/Infovis/Core/
H A DvtkExtractSelectedGraph.cxx291 std::map<vtkIdType, vtkIdType> vertexMap; in RequestData() local
316 vertexMap[inVert] = outVert; in RequestData()
337 vertexMap[inVert] = outVert; in RequestData()
358 if (vertexMap.find(e.Source) == vertexMap.end()) in RequestData()
363 if (vertexMap.find(e.Target) == vertexMap.end()) in RequestData()
381 vertexMap[addVert[j]] = outVert; in RequestData()
385 vtkIdType source = vertexMap[e.Source]; in RequestData()
386 vtkIdType target = vertexMap[e.Target]; in RequestData()
412 if (vertexMap.find(e.Source) != vertexMap.end() && in RequestData()
413 vertexMap.find(e.Target) != vertexMap.end()) in RequestData()
[all …]
H A DvtkExtractSelectedTree.cxx87 std::map<vtkIdType, vtkIdType> vertexMap; in BuildTree() local
94 vertexMap[inVert] = outVert; in BuildTree()
103 if (vertexMap.find(e.Source) != vertexMap.end() && vertexMap.find(e.Target) != vertexMap.end()) in BuildTree()
105 vtkIdType source = vertexMap[e.Source]; in BuildTree()
106 vtkIdType target = vertexMap[e.Target]; in BuildTree()
/dports/math/vtk6/VTK-6.2.0/Infovis/Core/
H A DvtkExtractSelectedGraph.cxx326 vertexMap[inVert] = outVert; in RequestData()
347 vertexMap[inVert] = outVert; in RequestData()
368 if (vertexMap.find(e.Source) == vertexMap.end()) in RequestData()
373 if (vertexMap.find(e.Target) == vertexMap.end()) in RequestData()
391 vertexMap[addVert[j]] = outVert; in RequestData()
395 vtkIdType source = vertexMap[e.Source]; in RequestData()
396 vtkIdType target = vertexMap[e.Target]; in RequestData()
422 if (vertexMap.find(e.Source) != vertexMap.end() && in RequestData()
423 vertexMap.find(e.Target) != vertexMap.end()) in RequestData()
425 vtkIdType source = vertexMap[e.Source]; in RequestData()
[all …]
H A DvtkExtractSelectedTree.cxx91 vtksys_stl::map<vtkIdType, vtkIdType> vertexMap; in BuildTree() local
98 vertexMap[inVert] = outVert; in BuildTree()
108 if (vertexMap.find(e.Source) != vertexMap.end() && in BuildTree()
109 vertexMap.find(e.Target) != vertexMap.end()) in BuildTree()
111 vtkIdType source = vertexMap[e.Source]; in BuildTree()
112 vtkIdType target = vertexMap[e.Target]; in BuildTree()
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/
H A DGModelIO_BDF.cpp152 std::map<int, MVertex *> &vertexMap) in readElementBDF() argument
199 auto it = vertexMap.find(n[i]); in readElementBDF()
200 if(it == vertexMap.end()) { in readElementBDF()
218 std::map<int, MVertex *> vertexMap; in readBDF() local
231 vertexMap[num] = new MVertex(x, y, z, nullptr, num); in readBDF()
235 Msg::Info("%d nodes", vertexMap.size()); in readBDF()
274 vertexMap)) { in readBDF()
285 vertexMap)) { in readBDF()
297 vertexMap)) { in readBDF()
311 vertexMap)) { in readBDF()
[all …]
/dports/sysutils/terraform-provider-gridscale/terraform-provider-gridscale-1.6.2/vendor/github.com/hashicorp/terraform-plugin-sdk/internal/dag/
H A Dwalk.go50 vertexMap map[Vertex]*walkerVertex member
150 if w.vertexMap == nil {
151 w.vertexMap = make(map[Vertex]*walkerVertex)
179 w.vertexMap[v] = info
187 info, ok := w.vertexMap[v]
198 delete(w.vertexMap, v)
211 waiterInfo, ok := w.vertexMap[waiter]
218 depInfo, ok := w.vertexMap[dep]
242 waiterInfo, ok := w.vertexMap[waiter]
264 info, ok := w.vertexMap[v]
[all …]
/dports/sysutils/terraform-provider-vultr/terraform-provider-vultr-0.1.10/vendor/github.com/hashicorp/terraform/dag/
H A Dwalk.go50 vertexMap map[Vertex]*walkerVertex member
155 if w.vertexMap == nil {
156 w.vertexMap = make(map[Vertex]*walkerVertex)
184 w.vertexMap[v] = info
192 info, ok := w.vertexMap[v]
203 delete(w.vertexMap, v)
216 waiterInfo, ok := w.vertexMap[waiter]
223 depInfo, ok := w.vertexMap[dep]
247 waiterInfo, ok := w.vertexMap[waiter]
269 info, ok := w.vertexMap[v]
[all …]
/dports/sysutils/terraform/terraform-1.0.11/internal/dag/
H A Dwalk.go50 vertexMap map[Vertex]*walkerVertex member
160 if w.vertexMap == nil {
161 w.vertexMap = make(map[Vertex]*walkerVertex)
188 w.vertexMap[v] = info
196 info, ok := w.vertexMap[v]
207 delete(w.vertexMap, v)
218 waiterInfo, ok := w.vertexMap[waiter]
225 depInfo, ok := w.vertexMap[dep]
245 waiterInfo, ok := w.vertexMap[waiter]
263 info, ok := w.vertexMap[v]
[all …]
/dports/cad/openscad/openscad-41f58fe57c03457a3a8b4dc541ef5654ec3e8c78/src/
H A Dexport.cc139 …auto pos1 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[0].x(), p[0].y(), p[0]… in ExportMesh()
140 …auto pos2 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[1].x(), p[1].y(), p[1]… in ExportMesh()
141 …auto pos3 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[2].x(), p[2].y(), p[2]… in ExportMesh()
147 for (const auto& e : vertexMap) { in ExportMesh()
161 for (const auto& e : vertexMap) { in foreach_vertex()
/dports/cad/openscad-devel/openscad-63a7c77740030c63d646eb0684ba6947eecb0db7/src/
H A Dexport.cc139 …auto pos1 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[0].x(), p[0].y(), p[0]… in ExportMesh()
140 …auto pos2 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[1].x(), p[1].y(), p[1]… in ExportMesh()
141 …auto pos3 = vertexMap.emplace(std::make_pair<std::array<double, 3>, int>({p[2].x(), p[2].y(), p[2]… in ExportMesh()
147 for (const auto& e : vertexMap) { in ExportMesh()
161 for (const auto& e : vertexMap) { in foreach_vertex()
/dports/astro/celestia-gtk/celestia-1.6.1/src/tools/cmod/
H A Dxtocmod.cpp352 void DumpVertexDescription(VertexAttribute vertexMap[], in DumpVertexDescription() argument
369 VertexAttribute vertexMap[], in DumpMeshVertices() argument
402 switch (vertexMap[attr].format) in DumpMeshVertices()
442 VertexAttribute vertexMap[]) in CreateVertexAttributeMap() argument
447 vertexMap[i].offset = 0; in CreateVertexAttributeMap()
448 vertexMap[i].format = VertexAttribute::InvalidFormat; in CreateVertexAttributeMap()
531 vertexMap[attr].offset = declElements[i].Offset; in CreateVertexAttributeMap()
532 vertexMap[attr].format = format; in CreateVertexAttributeMap()
713 VertexAttribute vertexMap[VertexAttribute::MaxAttribute]; in WinMain() local
714 CreateVertexAttributeMap(declElements, vertexMap); in WinMain()
[all …]
/dports/astro/celestia/celestia-1.6.1/src/tools/cmod/
H A Dxtocmod.cpp352 void DumpVertexDescription(VertexAttribute vertexMap[], in DumpVertexDescription() argument
369 VertexAttribute vertexMap[], in DumpMeshVertices() argument
402 switch (vertexMap[attr].format) in DumpMeshVertices()
442 VertexAttribute vertexMap[]) in CreateVertexAttributeMap() argument
447 vertexMap[i].offset = 0; in CreateVertexAttributeMap()
448 vertexMap[i].format = VertexAttribute::InvalidFormat; in CreateVertexAttributeMap()
531 vertexMap[attr].offset = declElements[i].Offset; in CreateVertexAttributeMap()
532 vertexMap[attr].format = format; in CreateVertexAttributeMap()
713 VertexAttribute vertexMap[VertexAttribute::MaxAttribute]; in WinMain() local
714 CreateVertexAttributeMap(declElements, vertexMap); in WinMain()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/tests/org.eclipse.core.tests.resources/src/org/eclipse/core/tests/internal/builders/
H A DComputeProjectOrderTest.java32 Collection<Object> existingVertexes = new HashSet<>(digraph.vertexMap.keySet()); in testComputeVertexOrderDuration()
51 Collection<Object> existingVertexes = new HashSet<>(digraph.vertexMap.keySet());
59 assertEquals(digraph.vertexMap.keySet(), filtered.vertexMap.keySet());
66 assertEquals(Collections.singleton(initialVertex), filtered.vertexMap.keySet());
113 assertEquals(expectedVertexes, filtered.vertexMap.keySet());
138 assertEquals(expectedVertexes, filtered.vertexMap.keySet());
169 assertEquals(expectedVertexes, filtered.vertexMap.keySet());
184 assertEquals(expectedVertexes, filtered.vertexMap.keySet());
198 assertEquals(expectedVertexes, filtered.vertexMap.keySet());
224 assertEquals(expectedVertexes, filtered.vertexMap.keySet()); in testCycle2Nodes()
[all …]
/dports/devel/bullet/bullet3-3.21/Extras/VHACD/src/
H A DvhacdManifoldMesh.cpp124 CircularListElement<TMMVertex>** vertexMap = new CircularListElement<TMMVertex>*[nV]; in Copy() local
129 vertexMap[v] = m_vertices.GetHead(); in Copy()
146 if (vertexMap[v]->GetData().m_duplicate) in Copy()
148 …vertexMap[v]->GetData().m_duplicate = edgeMap[vertexMap[v]->GetData().m_duplicate->GetData().m_id]; in Copy()
171 …edgeMap[e]->GetData().m_vertices[v] = vertexMap[edgeMap[e]->GetData().m_vertices[v]->GetData().m_i… in Copy()
191 …triangleMap[f]->GetData().m_vertices[v] = vertexMap[triangleMap[f]->GetData().m_vertices[v]->GetDa… in Copy()
195 delete[] vertexMap; in Copy()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/vhacd/src/
H A DvhacdManifoldMesh.cpp117 CircularListElement<TMMVertex>** vertexMap = new CircularListElement<TMMVertex>*[nV]; in Copy() local
121 vertexMap[v] = m_vertices.GetHead(); in Copy()
135 if (vertexMap[v]->GetData().m_duplicate) { in Copy()
136 …vertexMap[v]->GetData().m_duplicate = edgeMap[vertexMap[v]->GetData().m_duplicate->GetData().m_id]; in Copy()
152 …edgeMap[e]->GetData().m_vertices[v] = vertexMap[edgeMap[e]->GetData().m_vertices[v]->GetData().m_i… in Copy()
166 …triangleMap[f]->GetData().m_vertices[v] = vertexMap[triangleMap[f]->GetData().m_vertices[v]->GetDa… in Copy()
170 delete[] vertexMap; in Copy()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/vhacd/src/
H A DvhacdManifoldMesh.cpp117 CircularListElement<TMMVertex>** vertexMap = new CircularListElement<TMMVertex>*[nV]; in Copy() local
121 vertexMap[v] = m_vertices.GetHead(); in Copy()
135 if (vertexMap[v]->GetData().m_duplicate) { in Copy()
136 …vertexMap[v]->GetData().m_duplicate = edgeMap[vertexMap[v]->GetData().m_duplicate->GetData().m_id]; in Copy()
152 …edgeMap[e]->GetData().m_vertices[v] = vertexMap[edgeMap[e]->GetData().m_vertices[v]->GetData().m_i… in Copy()
166 …triangleMap[f]->GetData().m_vertices[v] = vertexMap[triangleMap[f]->GetData().m_vertices[v]->GetDa… in Copy()
170 delete[] vertexMap; in Copy()
/dports/devel/py-bullet3/bullet3-3.21/Extras/VHACD/src/
H A DvhacdManifoldMesh.cpp124 CircularListElement<TMMVertex>** vertexMap = new CircularListElement<TMMVertex>*[nV]; in Copy() local
129 vertexMap[v] = m_vertices.GetHead(); in Copy()
146 if (vertexMap[v]->GetData().m_duplicate) in Copy()
148 …vertexMap[v]->GetData().m_duplicate = edgeMap[vertexMap[v]->GetData().m_duplicate->GetData().m_id]; in Copy()
171 …edgeMap[e]->GetData().m_vertices[v] = vertexMap[edgeMap[e]->GetData().m_vertices[v]->GetData().m_i… in Copy()
191 …triangleMap[f]->GetData().m_vertices[v] = vertexMap[triangleMap[f]->GetData().m_vertices[v]->GetDa… in Copy()
195 delete[] vertexMap; in Copy()

12345