Home
last modified time | relevance | path

Searched refs:eItr (Results 1 – 8 of 8) sorted by relevance

/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/
H A DHeuristicSolver.h213 Graph::EdgeItr eItr(*aeItr); in setSolution()
248 if (xnItr == g.getEdgeNode1(eItr)) { in applyR1()
260 h.handleRemoveEdge(eItr, ynItr); in applyR1()
273 h.handleRemoveEdge(eItr, ynItr); in applyR1()
275 removeSolverEdge(eItr); in applyR1()
425 eItr != eEnd; ++eItr) { in setup()
428 addSolverEdge(eItr); in setup()
452 Graph::EdgeItr eItr = *aeItr; in disconnectTrivialNodes() local
484 eItr != eEnd; ++eItr) { in eliminateIndependentEdges()
485 edgesToProcess.push_back(eItr); in eliminateIndependentEdges()
[all …]
H A DGraph.h115 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; } in getEdge() argument
116 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; } in getEdge() argument
220 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } in getEdgeCosts() argument
234 void setEdgeData(EdgeItr eItr, void *data) { getEdge(eItr).setData(data); } in setEdgeData() argument
239 void* getEdgeData(EdgeItr eItr) { return getEdge(eItr).getData(); } in getEdgeData() argument
299 EdgeEntry &e = getEdge(eItr); in getEdgeOtherNode()
327 EdgeItr eItr = *itr; in removeNode() local
329 removeEdge(eItr); in removeNode()
337 void removeEdge(EdgeItr eItr) { in removeEdge() argument
338 EdgeEntry &e = getEdge(eItr); in removeEdge()
[all …]
H A DHeuristicBase.h202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts() argument
208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) { in postUpdateEdgeCostts() argument
214 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge() argument
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge() argument
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/Heuristics/
H A DBriggs.h189 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr)); in preUpdateEdgeCosts()
191 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr)); in preUpdateEdgeCosts()
202 handleAddEdge(eItr); in postUpdateEdgeCosts()
211 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge() argument
224 computeEdgeContributions(eItr); in handleAddEdge()
229 addEdgeContributions(eItr, n1Itr); in handleAddEdge()
241 addEdgeContributions(eItr, n2Itr); in handleAddEdge()
271 subtractEdgeContributions(eItr, nItr); in handleRemoveEdge()
427 Graph::EdgeItr eItr = *aeItr; in initializeNode() local
428 computeEdgeContributions(eItr); in initializeNode()
[all …]
/dports/games/scourge/scourge/src/tools/
H A Dpagegui.cpp115 std::map <std::string,Element*>::iterator eItr; in ClearCurrent() local
118 for ( eItr = theme->elements.begin(); eItr != theme->elements.end(); eItr++ ) in ClearCurrent()
119 eItr->second->Clear(); in ClearCurrent()
/dports/math/vtk8/VTK-8.2.0/Filters/Core/
H A DvtkContour3DLinearGrid.cxx861 typename EdgeVectorType::iterator eItr, eEnd; in Reduce() local
867 for ( eItr = (*ldItr).LocalEdges.begin(); eItr != eEnd; ++eItr ) in Reduce()
869 this->Edges[edgeNum].V0 = eItr->V0; in Reduce()
870 this->Edges[edgeNum].V1 = eItr->V1; in Reduce()
871 this->Edges[edgeNum].T = eItr->T; in Reduce()
/dports/math/vtk9/VTK-9.1.0/Filters/Core/
H A DvtkContour3DLinearGrid.cxx590 for (auto eItr = lEdges->begin(); eItr != eEnd; ++eItr) in operator ()() local
592 edges->V0 = eItr->V0; in operator ()()
593 edges->V1 = eItr->V1; in operator ()()
594 edges->Data.T = eItr->Data; in operator ()()
/dports/audio/espeak/espeak-1.48.04-source/dictsource/
H A Den_rules1248 X) atron (_ eItr@n