/dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/GTpo/src/gtpo/ |
H A D | node.hpp | 43 auto outEdge = outEdgePtr.lock(); in add_out_edge() local 44 auto outEdgeSrc = outEdge->get_src().lock(); in add_out_edge() 45 if ( outEdge ) { in add_out_edge() 47 outEdge->set_src( node ); in add_out_edge() 49 if ( !outEdge->get_dst().expired() ) { in add_out_edge() 50 … config_t::template container_adapter< weak_nodes_t >::insert( outEdge->get_dst(), _out_nodes ); in add_out_edge() 51 … this->notify_out_node_inserted( weak_node_t{node}, outEdge->get_dst(), weak_edge_t{outEdge} ); in add_out_edge() 76 auto node<config_t>::remove_out_edge( const weak_edge_t outEdge ) -> void in remove_out_edge() argument 79 auto outEdgePtr = outEdge.lock( ); in remove_out_edge() 88 this->notify_out_node_removed( node, outEdgePtr->get_dst(), outEdge ); in remove_out_edge() [all …]
|
/dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/src/ |
H A D | qanBehaviour.cpp | 85 auto outEdge = edge.lock(); in on_out_node_inserted() local 86 if ( outNode && outEdge ) in on_out_node_inserted() 87 outNodeInserted( *qobject_cast<qan::Node*>(outNode.get()), *outEdge ); in on_out_node_inserted() 94 auto outEdge = edge.lock(); in on_out_node_removed() local 95 if ( outNode && outEdge ) in on_out_node_removed() 96 outNodeRemoved( *qobject_cast<qan::Node*>(outNode.get()), *outEdge ); in on_out_node_removed()
|
/dports/cad/sumo/sumo-1.2.0/src/netwrite/ |
H A D | NWWriter_OpenDrive.cpp | 139 const NBEdge* outEdge = nullptr; in writeNetwork() local 150 if (outEdge != nullptr) { in writeNetwork() 163 outEdge = c.toEdge; in writeNetwork() 208 const NBEdge* outEdge = c.toEdge; in writeNetwork() local 209 if (outEdge == nullptr) { in writeNetwork() 329 if (outEdge != nullptr in addPedestrianConnection() 331 && outEdge->getPermissions(0) == SVC_PEDESTRIAN in addPedestrianConnection() 351 const NBEdge* outEdge = cLeft.toEdge; in writeInternalEdge() local 373 endShape = getRightLaneBorder(outEdge, cLeft.toLane); in writeInternalEdge() 436 const int toIndex = c.toLane - outEdge->getNumLanes(); in writeInternalEdge() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/cluster/ |
H A D | ClusterPlanRep.cpp | 196 AdjEntryArray<int> outEdge(*m_pClusterGraph, 2); //0 in 1 out in ModelBoundaries() local 203 convertClusterGraph(m_pClusterGraph->rootCluster(), currentEdge, outEdge); in ModelBoundaries() 209 AdjEntryArray<int>& outEdge) in convertClusterGraph() argument 224 convertClusterGraph(child, currentEdge, outEdge); in convertClusterGraph() 230 insertBoundary(act, currentEdge, outEdge, isLeaf); in convertClusterGraph() 240 AdjEntryArray<int>& outEdge, in insertBoundary() argument 278 outEdge[*it] = (*it)->isSource() ? 1 : 0; in insertBoundary() 282 if (outEdge[*it] == 2) in insertBoundary() 283 outEdge[*it] = (*it)->isSource() ? 1 : 0; in insertBoundary() 295 OGDF_ASSERT(outEdge[*it] != 2); in insertBoundary() [all …]
|
/dports/cad/sumo/sumo-1.2.0/src/utils/router/ |
H A D | AccessEdge.h | 39 …AccessEdge(int numericalID, const _IntermodalEdge* inEdge, const _IntermodalEdge* outEdge, const d… in AccessEdge() argument 40 …_IntermodalEdge(inEdge->getID() + ":" + outEdge->getID(), numericalID, outEdge->getEdge(), "!acces… in AccessEdge()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 241 for (auto &outEdge : oldOutEdges) { in removeNode() local 242 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 368 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 406 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 480 if (outEdge.id == dstId) in updateEdges() 481 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 483 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 484 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 519 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 520 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 245 for (auto &outEdge : oldOutEdges) { in removeNode() local 246 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 372 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 388 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 462 if (outEdge.id == dstId) in updateEdges() 463 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 465 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 466 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 501 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 502 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 238 for (auto &outEdge : oldOutEdges) { in removeNode() local 239 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 365 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 403 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 477 if (outEdge.id == dstId) in updateEdges() 478 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 480 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 481 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 516 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 517 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 238 for (auto &outEdge : oldOutEdges) { in removeNode() local 239 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 365 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 403 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 477 if (outEdge.id == dstId) in updateEdges() 478 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 480 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 481 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 516 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 517 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 245 for (auto &outEdge : oldOutEdges) { in removeNode() local 246 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 372 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 388 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 462 if (outEdge.id == dstId) in updateEdges() 463 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 465 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 466 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 501 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 502 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 238 for (auto &outEdge : oldOutEdges) { in removeNode() local 239 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 365 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 403 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 477 if (outEdge.id == dstId) in updateEdges() 478 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 480 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 481 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 516 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 517 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 245 for (auto &outEdge : oldOutEdges) { in removeNode() local 246 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 430 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 445 for (auto &outEdge : outEdges[srcId]) in getFusedLoopNestInsertionPoint() local 446 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 515 for (auto &outEdge : oldOutEdges) { in updateEdges() local 517 if (outEdge.id == dstId) in updateEdges() 518 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 552 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 553 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 245 for (auto &outEdge : oldOutEdges) { in removeNode() local 246 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 430 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 445 for (auto &outEdge : outEdges[srcId]) in getFusedLoopNestInsertionPoint() local 446 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 515 for (auto &outEdge : oldOutEdges) { in updateEdges() local 517 if (outEdge.id == dstId) in updateEdges() 518 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 552 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 553 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/mlir/lib/Transforms/ |
H A D | LoopFusion.cpp | 288 for (auto &outEdge : oldOutEdges) { in removeNode() local 289 removeEdge(id, outEdge.id, outEdge.value); in removeNode() 471 for (auto &outEdge : outEdges[id]) in getOutEdgeCount() local 486 for (auto &outEdge : outEdges[srcId]) in getFusedLoopNestInsertionPoint() local 487 if (outEdge.id != dstId) in getFusedLoopNestInsertionPoint() 556 for (auto &outEdge : oldOutEdges) { in updateEdges() local 558 if (outEdge.id == dstId) in updateEdges() 559 removeEdge(srcId, outEdge.id, outEdge.value); in updateEdges() 593 addEdge(dstId, outEdge.id, outEdge.value); in updateEdges() 594 removeEdge(sibId, outEdge.id, outEdge.value); in updateEdges() [all …]
|
/dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/planners/informedtrees/bitstar/ |
H A D | Vertex.h | 204 void insertInEdgeQueueOutLookup(const SearchQueue::EdgeQueueElemPtr &outEdge); 210 void removeFromEdgeQueueOutLookup(const SearchQueue::EdgeQueueElemPtr &outEdge); 216 …d removeFromEdgeQueueOutLookup(const SearchQueue::EdgeQueueElemPtrVector::const_iterator &outEdge);
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/compiler/ |
H A D | asserts.cpp | 144 for (const auto &outEdge : out_edges_range(t, g)) { in replaceAssertVertex() local 145 NFAVertex v = target(outEdge, g); in replaceAssertVertex() 154 const u32 flags_final = conjunct(g[outEdge].assert_flags, in replaceAssertVertex() 159 g[outEdge].assert_flags); in replaceAssertVertex()
|
/dports/graphics/py-pandana/pandana-0.6.1/src/contraction_hierarchies/src/Contractor/ |
H A D | Contractor.h | 469 …cGraph::EdgeIterator outEdge = _graph->BeginEdges( node ), endOutEdges = _graph->EndEdges( node );… variable 470 const _EdgeData& outData = _graph->GetEdgeData( outEdge ); 473 const NodeID target = _graph->GetTarget( outEdge ); 487 …cGraph::EdgeIterator outEdge = _graph->BeginEdges( node ), endOutEdges = _graph->EndEdges( node );… variable 488 const _EdgeData& outData = _graph->GetEdgeData( outEdge ); 491 const NodeID target = _graph->GetTarget( outEdge );
|
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/emst/ |
H A D | dtb_impl.hpp | 202 size_t outEdge = neighborsOutComponent[component]; in AddAllEdges() local 203 if (connections.Find(inEdge) != connections.Find(outEdge)) in AddAllEdges() 208 AddEdge(inEdge, outEdge, neighborsDistances[component]); in AddAllEdges() 209 connections.Union(inEdge, outEdge); in AddAllEdges()
|
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 443 for _, outEdge := range cur.Out { 444 delete(outEdge.Dest.In, cur) 465 for _, outEdge := range cur.Out { 466 child := outEdge.Dest 469 child.In[parent] = outEdge 470 parent.Out[child] = outEdge 472 outEdge.Src = parent 473 outEdge.Residual = true 477 outEdge.Inline = parentEdgeInline && outEdge.Inline
|
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/tools/walkers/haplotypecaller/graphs/ |
H A D | ChainPruner.java | 26 for ( final E outEdge : graph.outgoingEdgesOf(chainStart) ) { in findAllChains() 27 final Path<V,E> chain = findChain(outEdge, graph); in findAllChains()
|
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 482 for _, outEdge := range cur.Out { 483 delete(outEdge.Dest.In, cur) 504 for _, outEdge := range cur.Out { 505 child := outEdge.Dest 508 child.In[parent] = outEdge 509 parent.Out[child] = outEdge 511 outEdge.Src = parent 512 outEdge.Residual = true 516 outEdge.Inline = parentEdgeInline && outEdge.Inline
|
/dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 473 for _, outEdge := range cur.Out { 474 delete(outEdge.Dest.In, cur) 495 for _, outEdge := range cur.Out { 496 child := outEdge.Dest 499 child.In[parent] = outEdge 500 parent.Out[child] = outEdge 502 outEdge.Src = parent 503 outEdge.Residual = true 507 outEdge.Inline = parentEdgeInline && outEdge.Inline
|
/dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 482 for _, outEdge := range cur.Out { 483 delete(outEdge.Dest.In, cur) 504 for _, outEdge := range cur.Out { 505 child := outEdge.Dest 508 child.In[parent] = outEdge 509 parent.Out[child] = outEdge 511 outEdge.Src = parent 512 outEdge.Residual = true 516 outEdge.Inline = parentEdgeInline && outEdge.Inline
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 482 for _, outEdge := range cur.Out { 483 delete(outEdge.Dest.In, cur) 504 for _, outEdge := range cur.Out { 505 child := outEdge.Dest 508 child.In[parent] = outEdge 509 parent.Out[child] = outEdge 511 outEdge.Src = parent 512 outEdge.Residual = true 516 outEdge.Inline = parentEdgeInline && outEdge.Inline
|
/dports/net/storj/storj-1.45.3/vendor/github.com/google/pprof/internal/graph/ |
H A D | graph.go | 482 for _, outEdge := range cur.Out { 483 delete(outEdge.Dest.In, cur) 504 for _, outEdge := range cur.Out { 505 child := outEdge.Dest 508 child.In[parent] = outEdge 509 parent.Out[child] = outEdge 511 outEdge.Src = parent 512 outEdge.Residual = true 516 outEdge.Inline = parentEdgeInline && outEdge.Inline
|