| /dports/databases/pgrouting/pgrouting-3.2.0/include/lineGraph/ |
| H A D | pgr_lineGraphFull.hpp | 231 V_i vertexIt, vertexEnd; in apply_transformation() local
237 for (boost::tie(vertexIt, vertexEnd) = boost::vertices(digraph.graph); in apply_transformation()
238 vertexIt != vertexEnd; vertexIt++) { in apply_transformation()
239 V vertex = *vertexIt; in apply_transformation()
273 for (boost::tie(vertexIt, vertexEnd) = in apply_transformation()
275 vertexIt != vertexEnd; vertexIt++) { in apply_transformation()
276 V vertex = *vertexIt; in apply_transformation()
|
| H A D | pgr_lineGraph.hpp | 171 V_i vertexIt, vertexEnd; in create_edges() local
177 for (boost::tie(vertexIt, vertexEnd) = boost::vertices(digraph.graph); in create_edges()
178 vertexIt != vertexEnd; vertexIt++) { in create_edges()
179 auto vertex = *vertexIt; in create_edges()
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/rep_sep/ |
| H A D | rgraph_heuristics.h | 304 TVertexIterator vertexIt(me.graph); in solve()
305 while(!atEnd(vertexIt)) in solve()
308 if(!hasKey(visitedVertices,*vertexIt)) in solve()
312 appendValue(temporary_component,*vertexIt); in solve()
317 best_expansion = *vertexIt; in solve()
322 goNext(vertexIt); in solve()
|
| /dports/biology/seqan1/seqan-1.3.1/apps/rep_sep/ |
| H A D | rgraph_heuristics.h | 304 TVertexIterator vertexIt(me.graph); in solve()
305 while(!atEnd(vertexIt)) in solve()
308 if(!hasKey(visitedVertices,*vertexIt)) in solve()
312 appendValue(temporary_component,*vertexIt); in solve()
317 best_expansion = *vertexIt; in solve()
322 goNext(vertexIt); in solve()
|
| /dports/math/ignition-math/ignitionrobotics-ign-math-46f3dd24499c/include/ignition/math/graph/ |
| H A D | Graph.hh | 250 auto vertexIt = this->adjList.find(v); in LinkEdge() local
251 assert(vertexIt != this->adjList.end()); in LinkEdge()
252 vertexIt->second.insert(_edge.Id()); in LinkEdge()
296 auto vertexIt = this->adjList.find(_vertex); in AdjacentsFrom() local
297 if (vertexIt == this->adjList.end()) in AdjacentsFrom()
300 for (auto const &edgeId : vertexIt->second) in AdjacentsFrom()
|
| /dports/math/openturns/openturns-1.18/lib/src/Base/Func/ |
| H A D | P1LagrangeEvaluation.cxx | 143 …ection::const_iterator vertexIt = simplices.cbegin_at(i), vertexGuard = simplices.cend_at(i); vert… in setMesh() local
145 const UnsignedInteger vertexIndex = (*vertexIt); in setMesh()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/external/vulkancts/modules/vulkan/draw/ |
| H A D | vktBasicDrawTests.cpp | 717 …std::vector<PositionColorVertex>::iterator vertexIt = m_data.vertices.begin() + m_data.params.vert… in generateDrawData() local
719 tcu::VecAccess<float, 4, 4> positionAccess = vertexIt->position.xyzw(); in generateDrawData()
724 tcu::VecAccess<float, 4, 4> colorAccess = vertexIt->color.xyzw(); in generateDrawData()
832 std::vector<PositionColorVertex>::iterator vertexIt = vertexStart + idx; in generateDrawData() local
834 tcu::VecAccess<float, 4, 4> positionAccess = vertexIt->position.xyzw(); in generateDrawData()
839 tcu::VecAccess<float, 4, 4> colorAccess = vertexIt->color.xyzw(); in generateDrawData()
985 …std::vector<PositionColorVertex>::iterator vertexIt = m_data.vertices.begin() + cmdIt->vertexOffse… in generateDrawData() local
987 tcu::VecAccess<float, 4, 4> positionAccess = vertexIt->position.xyzw(); in generateDrawData()
992 tcu::VecAccess<float, 4, 4> colorAccess = vertexIt->color.xyzw(); in generateDrawData()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/glmark2/src/src/ |
| H A D | model.cpp | 259 for (vector<Vertex>::iterator vertexIt = object.vertices.begin(); in calculate_texcoords() local
260 vertexIt != object.vertices.end(); in calculate_texcoords()
261 vertexIt++) in calculate_texcoords()
263 Vertex& curVertex = *vertexIt; in calculate_texcoords()
|
| /dports/benchmarks/glmark2/glmark2-2021.12/src/ |
| H A D | model.cpp | 275 for (vector<Vertex>::iterator vertexIt = object.vertices.begin(); in calculate_texcoords() local
276 vertexIt != object.vertices.end(); in calculate_texcoords()
277 vertexIt++) in calculate_texcoords()
279 Vertex& curVertex = *vertexIt; in calculate_texcoords()
|
| /dports/graphics/opencollada/OpenCOLLADA-1.6.68/COLLADAMaya/src/ |
| H A D | COLLADAMayaGeometryExporter.cpp | 1267 for ( MItMeshVertex vertexIt ( mesh ); !vertexIt.isDone(); vertexIt.next() ) in getPerVertexNormalsTangents() local
1270 int vertexIndex = vertexIt.index(); in getPerVertexNormalsTangents()
1271 vertexIt.getConnectedVertices ( vertexNeighbors ); in getPerVertexNormalsTangents()
|
| /dports/math/mdal/MDAL-release-0.9.0/mdal/frmts/ |
| H A D | mdal_selafin.cpp | 787 std::unique_ptr<MeshSelafinVertexIterator> vertexIt( in calculateExtent() local
796 count = vertexIt->next( bufferSize, verticesCoord.data() ); in calculateExtent()
|
| /dports/graphics/qgis/qgis-3.22.3/external/mdal/frmts/ |
| H A D | mdal_selafin.cpp | 782 std::unique_ptr<MeshSelafinVertexIterator> vertexIt( in calculateExtent() local
791 count = vertexIt->next( bufferSize, verticesCoord.data() ); in calculateExtent()
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/external/mdal/frmts/ |
| H A D | mdal_selafin.cpp | 788 std::unique_ptr<MeshSelafinVertexIterator> vertexIt( in calculateExtent() local
797 count = vertexIt->next( bufferSize, verticesCoord.data() ); in calculateExtent()
|
| /dports/math/cvc3/cvc3-2.4.1/src/theory_arith/ |
| H A D | theory_arith_old.cpp | 5123 EdgesList::iterator vertexIt = incomingEdges.begin(); in computeModel() local
5125 for (; vertexIt != vertexItEnd; vertexIt ++) { in computeModel()
5126 Expr vertex = (*vertexIt).first; in computeModel()
5131 vertexIt = outgoingEdges.begin(); in computeModel()
5133 for (; vertexIt != vertexItEnd; vertexIt ++) { in computeModel()
5134 Expr vertex = (*vertexIt).first; in computeModel()
|