| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/ |
| H A D | NodeGraphPartTestSuite.h | 64 ngp.eraseNode(id3); in testSuppression()
102 ngp.eraseNode(id3); in testCopy()
105 ngp.eraseNode(id4); in testCopy()
176 ngp.eraseNode(node); in testGarbageCollecting()
238 nodeset.eraseNode(*iter); in testIteratorEnd()
281 nodeset.eraseNode(2 + i * 19); in testIteratorAddNodes()
295 nodeset2.eraseNode(1); in testIteratorAddNodes()
297 nodeset2.eraseNode(3); in testIteratorAddNodes()
299 nodeset2.eraseNode(5); in testIteratorAddNodes()
323 ngp.eraseNode(node); in _privateTestBigNodeGraphPart_()
[all …]
|
| H A D | GraphListenerTestSuite.h | 249 g1.eraseNode(id5); // -1 nodes/-3 arcs for g1 in testDAG()
314 g1.eraseNode(id5); // -1 nodes/-3 edges for g1 in testUndiGraph()
404 g1.eraseNode(id5); // -1 nodes/-2 edges / -1 arcs for g1 in testMixedGraph()
459 g.eraseNode(id5); // -1 nodes/-3 edges for g in testUndiGraphWithGraphListener()
485 g.eraseNode(id5); // -1 nodes/-3 arcs for g in testDiGraphWithGraphListener()
516 g.eraseNode(id5); // -1 nodes/-3 arcs for g in testDAGWithGraphListener()
543 g.eraseNode(id5); // -1 nodes/-2 edge / -1 arcs for g in testMixedGraphWithGraphListener()
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BN/ |
| H A D | CliqueGraphTestSuite.h | 324 TS_GUM_ASSERT_THROWS_NOTHING(g1.eraseNode(1)); in testEraseNode()
326 TS_GUM_ASSERT_THROWS_NOTHING(g1.eraseNode(1)); in testEraseNode()
328 TS_GUM_ASSERT_THROWS_NOTHING(g1.eraseNode(15)); in testEraseNode()
332 TS_GUM_ASSERT_THROWS_NOTHING(g2.eraseNode(1)); in testEraseNode()
334 TS_GUM_ASSERT_THROWS_NOTHING(g2.eraseNode(1)); in testEraseNode()
340 TS_GUM_ASSERT_THROWS_NOTHING(g3.eraseNode(1)); in testEraseNode()
342 TS_GUM_ASSERT_THROWS_NOTHING(g3.eraseNode(1)); in testEraseNode()
500 graph.eraseNode(1); in testGetClique_2()
529 graph.eraseNode(whichId); in testGetContainerNode()
533 graph.eraseNode(whichId); in testGetContainerNode()
[all …]
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/testunits/tests/ |
| H A D | GraphTestSuite.py | 11 g.eraseNode(1)
12 g.eraseNode(2)
13 g.eraseNode(4)
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/ |
| H A D | mixedGraph_inl.h | 54 INLINE void MixedGraph::eraseNode(const NodeId id) { in eraseNode() function
58 NodeGraphPart::eraseNode(id); in eraseNode()
|
| H A D | undiGraph_inl.h | 57 INLINE void UndiGraph::eraseNode(const NodeId id) { in eraseNode() function
62 NodeGraphPart::eraseNode(id); in eraseNode()
|
| H A D | diGraph_inl.h | 67 INLINE void DiGraph::eraseNode(const NodeId id) { in eraseNode() function
74 NodeGraphPart::eraseNode(id); in eraseNode()
|
| H A D | DAG.cpp | 110 g.eraseNode(node); in dSeparation()
123 g.eraseNode(node); in dSeparation()
|
| H A D | cliqueGraph_inl.h | 94 INLINE void CliqueGraph::eraseNode(const NodeId id) { in eraseNode() function
107 UndiGraph::eraseNode(id); in eraseNode()
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphicalModels/inference/scheduler/ |
| H A D | schedulerBasic_tpl.h | 117 dag.eraseNode(id); in nbOperations()
148 dag.eraseNode(id); in nbOperations()
190 dag.eraseNode(id); in memoryUsage()
234 dag.eraseNode(id); in memoryUsage()
|
| /dports/lang/intel-compute-runtime/compute-runtime-21.52.22081/opencl/source/event/ |
| H A D | event_tracker.cpp | 174 bool eraseNode = false; in dump() local
180 eraseNode = true; in dump()
182 eraseNode = true; in dump()
185 if (eraseNode) { in dump()
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/algorithms/triangulations/ |
| H A D | incrementalTriangulation.cpp | 248 void IncrementalTriangulation::eraseNode(const NodeId X) { in eraseNode() function in gum::IncrementalTriangulation
318 _junction_tree_.eraseNode(_cliques_of_mps_[MPS_of_X[0]][0]); in eraseNode()
319 _T_mpd_.eraseNode(MPS_of_X[0]); in eraseNode()
341 _graph_.eraseNode(X); in eraseNode()
451 _junction_tree_.eraseNode(c_X); in addEdge()
452 _T_mpd_.eraseNode(mps_X); in addEdge()
463 _junction_tree_.eraseNode(c_Y); in addEdge()
464 _T_mpd_.eraseNode(mps_Y); in addEdge()
889 _junction_tree_.eraseNode(to_connect); in _updateJunctionTree_()
901 _junction_tree_.eraseNode(elt.first); in _updateJunctionTree_()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
| H A D | edge_set.h | 277 void eraseNode(const Node& node) { in eraseNode() function
308 _arcset.eraseNode(node); in erase()
313 _arcset.eraseNode(nodes[i]); in erase()
709 void eraseNode(const Node& node) { in eraseNode() function
735 _arcset.eraseNode(node); in erase()
740 _arcset.eraseNode(nodes[i]); in erase()
980 void eraseNode(const Node& node) { in eraseNode() function
1009 _arcset.eraseNode(node); in erase()
1019 _arcset.eraseNode(nodes[i]); in erase()
1332 void eraseNode(const Node& node) { in eraseNode() function
[all …]
|
| /dports/math/lemon/lemon-1.3.1/lemon/ |
| H A D | edge_set.h | 277 void eraseNode(const Node& node) { in eraseNode() function
308 _arcset.eraseNode(node); in erase()
313 _arcset.eraseNode(nodes[i]); in erase()
709 void eraseNode(const Node& node) { in eraseNode() function
735 _arcset.eraseNode(node); in erase()
740 _arcset.eraseNode(nodes[i]); in erase()
980 void eraseNode(const Node& node) { in eraseNode() function
1009 _arcset.eraseNode(node); in erase()
1019 _arcset.eraseNode(nodes[i]); in erase()
1332 void eraseNode(const Node& node) { in eraseNode() function
[all …]
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
| H A D | edge_set.h | 277 void eraseNode(const Node& node) { in eraseNode() function
308 _arcset.eraseNode(node); in erase()
313 _arcset.eraseNode(nodes[i]); in erase()
709 void eraseNode(const Node& node) { in eraseNode() function
735 _arcset.eraseNode(node); in erase()
740 _arcset.eraseNode(nodes[i]); in erase()
980 void eraseNode(const Node& node) { in eraseNode() function
1009 _arcset.eraseNode(node); in erase()
1019 _arcset.eraseNode(nodes[i]); in erase()
1332 void eraseNode(const Node& node) { in eraseNode() function
[all …]
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/CodeGen/ |
| H A D | MachineDominators.h | 150 inline void eraseNode(MachineBasicBlock *BB) { in eraseNode() function
151 DT->eraseNode(BB); in eraseNode()
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/multidim/implementations/ |
| H A D | multiDimFunctionGraphManager_tpl.h | 115 MultiDimFunctionGraphManager< GUM_SCALAR, TerminalNodePolicy >::eraseNode(NodeId eraseId, in eraseNode() function
137 InternalNode* eraseNode = _functionGraph_->_internalNodeMap_[eraseId]; in eraseNode() local
140 Link< Parent >* picle = eraseNode->parents(); in eraseNode()
154 _functionGraph_->_model_.eraseNode(eraseId); in eraseNode()
382 _functionGraph_->_model_.eraseNode(curId); in _adjacentSwap_()
410 _functionGraph_->_model_.eraseNode(origin); in migrateNode_()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 146 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
151 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 153 void CallGraph::eraseNode(CallGraphNode *node) {
158 eraseNode(edge.getTarget());
|