| /dports/cad/gmsh/gmsh-4.9.2-source/Numeric/ |
| H A D | HierarchicalBasisHcurlLine.cpp | 77 int edgeIt = 0; in generateHcurlBasis() local
78 for(int j = 0; j < 3; j++) { edgeBasis[edgeIt][j] = psie_0[j]; } in generateHcurlBasis()
79 edgeIt++; in generateHcurlBasis()
81 for(int j = 0; j < 3; j++) { edgeBasis[edgeIt][j] = psie_1[j]; } in generateHcurlBasis()
82 edgeIt++; in generateHcurlBasis()
85 edgeBasis[edgeIt][j] = (2 * float(iedge) - 1) / float(iedge) * in generateHcurlBasis()
90 edgeIt++; in generateHcurlBasis()
|
| H A D | HierarchicalBasisHcurlPri.cpp | 194 int edgeIt = 0; in generateHcurlBasis() local
213 edgeIt++; in generateHcurlBasis()
216 edgeIt++; in generateHcurlBasis()
227 edgeIt++; in generateHcurlBasis()
242 matrixVectorProductForMapping(1, edgeBasis[edgeIt], edgeBasis[edgeIt]); in generateHcurlBasis()
243 edgeIt++; in generateHcurlBasis()
1415 int edgeIt = 0; in generateCurlBasis() local
1443 edgeIt++; in generateCurlBasis()
1449 edgeIt++; in generateCurlBasis()
1474 edgeIt++; in generateCurlBasis()
[all …]
|
| H A D | HierarchicalBasisHcurlTria.cpp | 122 int edgeIt = 0; in generateHcurlBasis() local
126 edgeIt++; in generateHcurlBasis()
131 edgeIt++; in generateHcurlBasis()
135 edgeBasis[edgeIt][j] = in generateHcurlBasis()
141 edgeIt++; in generateHcurlBasis()
335 int edgeIt = 0; in generateCurlBasis() local
338 edgeBasis[edgeIt][2] = det * curlpsie_0[i]; in generateCurlBasis()
339 edgeIt++; in generateCurlBasis()
342 edgeIt++; in generateCurlBasis()
345 edgeBasis[edgeIt][2] = in generateCurlBasis()
[all …]
|
| H A D | HierarchicalBasisHcurlQuad.cpp | 68 int edgeIt = 0; in generateHcurlBasis() local
97 edgeBasis[edgeIt][j] = in generateHcurlBasis()
100 edgeIt++; in generateHcurlBasis()
195 int edgeIt = 0; in generateCurlBasis() local
221 edgeBasis[edgeIt][j] = in generateCurlBasis()
224 edgeIt++; in generateCurlBasis()
|
| H A D | HierarchicalBasisHcurlTetra.cpp | 172 int edgeIt = 0; in generateHcurlBasis() local
175 edgeIt++; in generateHcurlBasis()
180 edgeIt++; in generateHcurlBasis()
189 edgeIt++; in generateHcurlBasis()
1146 int edgeIt = 0; in generateCurlBasis() local
1151 edgeIt++; in generateCurlBasis()
1154 edgeIt++; in generateCurlBasis()
1157 edgeBasis[edgeIt][0] = in generateCurlBasis()
1166 edgeBasis[edgeIt][1] = in generateCurlBasis()
1175 edgeBasis[edgeIt][2] = in generateCurlBasis()
[all …]
|
| /dports/graphics/opensubdiv/OpenSubdiv-3_4_4/examples/common/ |
| H A D | export_obj.py | 96 edgeIt = OpenMaya.MItMeshEdge(path) variable
98 edgeIt.setIndex(edgeIds[i], dummy)
100 edgeIt.getConnectedFaces(faceList)
101 vid0 = edgeIt.index(0)
102 vid1 = edgeIt.index(1)
|
| /dports/graphics/geos/geos-3.9.1/src/operation/relate/ |
| H A D | RelateNodeGraph.cpp | 93 vector<Edge*>::iterator edgeIt = edges->begin(); in computeIntersectionNodes() local
94 for(; edgeIt < edges->end(); ++edgeIt) { in computeIntersectionNodes()
95 Edge* e = *edgeIt; in computeIntersectionNodes()
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/rep_sep/ |
| H A D | rgraph_heuristics.h | 248 TEdgeIterator edgeIt(me.graph); in solve()
255 while(!atEnd(edgeIt)) in solve()
257 TEdgeDescriptor ed = *edgeIt; in solve()
258 … if(!hasKey(visitedVertices,sourceVertex(edgeIt)) && !hasKey(visitedVertices,targetVertex(edgeIt))) in solve()
268 sV = sourceVertex(edgeIt); in solve()
269 tV = targetVertex(edgeIt); in solve()
272 goNext(edgeIt); in solve()
|
| /dports/games/trenchbroom/TrenchBroom-ed46601/common/src/View/ |
| H A D | ResizeBrushesToolController.cpp | 109 Model::BrushFace::EdgeList::const_iterator edgeIt, edgeEnd; in buildEdgeRenderer() local
113 for (edgeIt = edges.begin(), edgeEnd = edges.end(); edgeIt != edgeEnd; ++edgeIt) { in buildEdgeRenderer()
114 const Model::BrushEdge* edge = *edgeIt; in buildEdgeRenderer()
|
| H A D | VertexHandleManager.cpp | 806 Model::BrushEdgeSet::const_iterator edgeIt, edgeEnd; in validateRenderState() local
807 for (edgeIt = edges.begin(), edgeEnd = edges.end(); edgeIt != edgeEnd; ++edgeIt) { in validateRenderState()
808 const Model::BrushEdge* edge = *edgeIt; in validateRenderState()
824 Model::BrushFace::EdgeList::const_iterator edgeIt, edgeEnd; in validateRenderState() local
825 … for (edgeIt = edges.begin(), edgeEnd = edges.end(); edgeIt != edgeEnd; ++edgeIt) { in validateRenderState()
826 const Model::BrushEdge* edge = *edgeIt; in validateRenderState()
|
| /dports/biology/seqan1/seqan-1.3.1/apps/rep_sep/ |
| H A D | rgraph_heuristics.h | 248 TEdgeIterator edgeIt(me.graph); in solve()
255 while(!atEnd(edgeIt)) in solve()
257 TEdgeDescriptor ed = *edgeIt; in solve()
258 … if(!hasKey(visitedVertices,sourceVertex(edgeIt)) && !hasKey(visitedVertices,targetVertex(edgeIt))) in solve()
268 sV = sourceVertex(edgeIt); in solve()
269 tV = targetVertex(edgeIt); in solve()
272 goNext(edgeIt); in solve()
|
| /dports/math/vtk8/VTK-8.2.0/Infovis/BoostGraphAlgorithms/ |
| H A D | vtkBoostBiconnectedComponents.cxx | 126 vtkSmartPointer<vtkOutEdgeIterator> edgeIt = vtkSmartPointer<vtkOutEdgeIterator>::New(); in RequestData() local
131 output->GetOutEdges(u, edgeIt); in RequestData()
133 while (edgeIt->HasNext() && comp == -1) in RequestData()
135 vtkOutEdgeType e = edgeIt->Next(); in RequestData()
|
| /dports/math/vtk9/VTK-9.1.0/Infovis/BoostGraphAlgorithms/ |
| H A D | vtkBoostBiconnectedComponents.cxx | 123 vtkSmartPointer<vtkOutEdgeIterator> edgeIt = vtkSmartPointer<vtkOutEdgeIterator>::New(); in RequestData() local
128 output->GetOutEdges(u, edgeIt); in RequestData()
130 while (edgeIt->HasNext() && comp == -1) in RequestData()
132 vtkOutEdgeType e = edgeIt->Next(); in RequestData()
|
| /dports/math/vtk6/VTK-6.2.0/Infovis/BoostGraphAlgorithms/ |
| H A D | vtkBoostBiconnectedComponents.cxx | 128 vtkSmartPointer<vtkOutEdgeIterator> edgeIt = vtkSmartPointer<vtkOutEdgeIterator>::New(); in RequestData() local
133 output->GetOutEdges(u, edgeIt); in RequestData()
135 while (edgeIt->HasNext() && comp == -1) in RequestData()
137 vtkOutEdgeType e = edgeIt->Next(); in RequestData()
|
| /dports/databases/pgrouting/pgrouting-3.2.0/include/lineGraph/ |
| H A D | pgr_lineGraph.hpp | 94 typename boost::graph_traits < G >::edge_iterator edgeIt, edgeEnd; in get_postgres_results_directed() local
98 for (boost::tie(edgeIt, edgeEnd) = boost::edges(this->graph); in get_postgres_results_directed()
99 edgeIt != edgeEnd; edgeIt++) { in get_postgres_results_directed()
100 E e = *edgeIt; in get_postgres_results_directed()
|
| H A D | pgr_lineGraphFull.hpp | 92 typename boost::graph_traits < G >::edge_iterator edgeIt, edgeEnd; in get_postgres_results_directed() local
102 for (boost::tie(edgeIt, edgeEnd) = boost::edges(this->graph); in get_postgres_results_directed()
103 edgeIt != edgeEnd; edgeIt++) { in get_postgres_results_directed()
104 E e = *edgeIt; in get_postgres_results_directed()
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/relate/ |
| H A D | RelateNodeGraph.java | 90 for (Iterator edgeIt = geomGraph.getEdgeIterator(); edgeIt.hasNext(); ) { in computeIntersectionNodes()
91 Edge e = (Edge) edgeIt.next(); in computeIntersectionNodes()
|
| /dports/math/vtk8/VTK-8.2.0/Common/Misc/ |
| H A D | vtkPolygonBuilder.cxx | 131 EdgeMap::iterator edgeIt = this->Edges.begin(); in GetPolygons() local
132 Edge edge = *(edgeIt); in GetPolygons()
148 Edges.erase(edgeIt); //remove offending edge in GetPolygons()
|
| /dports/math/vtk9/VTK-9.1.0/Common/Misc/ |
| H A D | vtkPolygonBuilder.cxx | 130 EdgeMap::iterator edgeIt = this->Edges.begin(); in GetPolygons() local
131 Edge edge = *(edgeIt); in GetPolygons()
147 Edges.erase(edgeIt); // remove offending edge in GetPolygons()
|
| /dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_algorithms/ |
| H A D | maximum_weighted_matching.h | 147 for (TEdgeIter edgeIt(graph); !atEnd(edgeIt); goNext(edgeIt)) in maximumWeightedMatchingGreedy()
148 edges.push_back(edgeIt); in maximumWeightedMatchingGreedy()
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_algorithms/ |
| H A D | maximum_weighted_matching.h | 147 for (TEdgeIter edgeIt(graph); !atEnd(edgeIt); goNext(edgeIt)) in maximumWeightedMatchingGreedy()
148 edges.push_back(edgeIt); in maximumWeightedMatchingGreedy()
|
| /dports/science/cdk/cdk-cdk-2.3/legacy/src/main/java/org/openscience/cdk/ringsearch/cyclebasis/ |
| H A D | CycleBasis.java | 133 for (Iterator edgeIt = edges.iterator(); edgeIt.hasNext();) { in CycleBasis()
134 Edge edge = (Edge) edgeIt.next(); in CycleBasis()
|
| /dports/cad/sumo/sumo-1.2.0/src/netbuild/ |
| H A D | NBNodeCont.cpp | 316 …for (std::map<std::string, NBEdge*>::const_iterator edgeIt = ec.begin(); edgeIt != ec.end(); ++edg… in removeComponents() local
317 edgesLeft.insert(edgeIt->first); in removeComponents()
334 … for (EdgeVector::const_iterator edgeIt = listIt->begin(); edgeIt != listIt->end(); ++edgeIt) { in removeComponents() local
335 std::set<std::string>::iterator leftIt = edgesLeft.find((*edgeIt)->getID()); in removeComponents()
337 queue.push_back(*edgeIt); in removeComponents()
355 … for (std::set<NBEdge*>::iterator edgeIt = toRemove.begin(); edgeIt != toRemove.end(); ++edgeIt) { in removeComponents() local
356 NBNode* const fromNode = (*edgeIt)->getFromNode(); in removeComponents()
357 NBNode* const toNode = (*edgeIt)->getToNode(); in removeComponents()
358 ec.erase(dc, *edgeIt); in removeComponents()
|
| /dports/math/ignition-math/ignitionrobotics-ign-math-46f3dd24499c/include/ignition/math/graph/ |
| H A D | Graph.hh | 573 auto edgeIt = this->edges.find(_edge); in RemoveEdge() local
574 if (edgeIt == this->edges.end()) in RemoveEdge()
577 auto edgeVertices = edgeIt->second.Vertices(); in RemoveEdge()
582 if (edgeIt->second.From(v) != kNullId) in RemoveEdge()
|
| /dports/databases/qt5-sqldrivers-sqlite2/kde-qtbase-5.15.2p263/src/gui/util/ |
| H A D | qshadergraph.cpp | 149 const auto edgeIt = std::find_if(outgoing.cbegin(), in removeNodesWithUnboundInputs() local
155 if (edgeIt != outgoing.cend()) in removeNodesWithUnboundInputs()
156 currentEdges.removeAll(*edgeIt); in removeNodesWithUnboundInputs()
|