Home
last modified time | relevance | path

Searched refs:incoming_edges (Results 1 – 25 of 107) sorted by relevance

12345

/dports/math/py-sympy/sympy-1.9/sympy/multipledispatch/
H A Dutils.py43 incoming_edges = reverse_dict(edges)
44 incoming_edges = {k: set(val) for k, val in incoming_edges.items()}
45 S = OrderedDict.fromkeys(v for v in edges if v not in incoming_edges)
52 assert n in incoming_edges[m]
53 incoming_edges[m].remove(n)
54 if not incoming_edges[m]:
56 if any(incoming_edges.get(v, None) for v in edges):
/dports/devel/py-multipledispatch/multipledispatch-0.4.8/multipledispatch/
H A Dutils.py47 incoming_edges = reverse_dict(edges)
48 incoming_edges = dict((k, set(val)) for k, val in incoming_edges.items())
49 S = set((v for v in edges if v not in incoming_edges))
56 assert n in incoming_edges[m]
57 incoming_edges[m].remove(n)
58 if not incoming_edges[m]:
60 if any(incoming_edges.get(v, None) for v in edges):
/dports/math/py-theano/Theano-1.0.5/theano/gof/
H A Dsched.py137 incoming_edges = reverse_dict(edges)
138 incoming_edges = dict((k, set(val))
139 for k, val in iteritems(incoming_edges))
140 S = set((v for v in edges if v not in incoming_edges))
147 assert n in incoming_edges[m]
148 incoming_edges[m].remove(n)
149 if not incoming_edges[m]:
151 if any(incoming_edges.get(v, None) for v in edges):
/dports/lang/ruby26/ruby-2.6.9/lib/rubygems/resolver/molinillo/lib/molinillo/dependency_graph/
H A Ddetach_vertex_named.rb22 v.incoming_edges.delete(e)
23 if !v.root? && v.incoming_edges.empty?
28 @vertex.incoming_edges.each do |e|
41 e.destination.incoming_edges << e
43 @vertex.incoming_edges.each do |e|
H A Ddelete_edge.rb19 edge.destination.incoming_edges.delete(edge)
26 edge.destination.incoming_edges << edge
H A Dadd_edge_no_circular.rb19 edge.destination.incoming_edges << edge
27 delete_first(edge.destination.incoming_edges, edge)
H A Dvertex.rb35 incoming_edges.map(&:requirement) + explicit_requirements
49 incoming_edges.map(&:origin)
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/
H A Dtree-ssa-threadupdate.c123 struct el *incoming_edges; member
252 elt->incoming_edges = NULL; in lookup_redirection_data()
269 elt->incoming_edges = xmalloc (sizeof (struct el)); in lookup_redirection_data()
270 elt->incoming_edges->e = incoming_edge; in lookup_redirection_data()
271 elt->incoming_edges->next = NULL; in lookup_redirection_data()
289 el->next = elt->incoming_edges; in lookup_redirection_data()
291 elt->incoming_edges = el; in lookup_redirection_data()
588 for (el = rd->incoming_edges; el; el = next) in redirect_edges()
643 if (rd->incoming_edges) in redirect_edges()
/dports/multimedia/py-ffmpeg-python/ffmpeg-python-0.2.0/ffmpeg/
H A D_run.py69 incoming_edges = node.incoming_edges
72 _format_input_stream_name(stream_name_map, edge) for edge in incoming_edges
118 if len(node.incoming_edges) == 0:
121 for edge in node.incoming_edges:
126 if stream_name != '0' or len(node.incoming_edges) > 1:
/dports/net-p2p/bazarr/bazarr-1.0.2/libs/ffmpeg/
H A D_run.py69 incoming_edges = node.incoming_edges
72 _format_input_stream_name(stream_name_map, edge) for edge in incoming_edges
118 if len(node.incoming_edges) == 0:
121 for edge in node.incoming_edges:
126 if stream_name != '0' or len(node.incoming_edges) > 1:
/dports/www/firefox-esr/firefox-91.8.0/gfx/harfbuzz/src/
H A Dhb-repacker.hh43 incoming_edges (0), in vertex_t()
52 unsigned incoming_edges; member
59 return incoming_edges > 1; in is_shared()
250 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_kahn()
306 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_shortest_distance()
369 clone->incoming_edges++; in duplicate()
370 child.incoming_edges--; in duplicate()
437 child.incoming_edges, in print_overflows()
457 vertices_[i].incoming_edges = 0; in update_incoming_edge_count()
463 vertices_[l.objidx].incoming_edges++; in update_incoming_edge_count()
/dports/www/lagrange/lagrange-1.7.3/lib/harfbuzz/src/
H A Dhb-repacker.hh43 incoming_edges (0), in vertex_t()
52 unsigned incoming_edges; member
59 return incoming_edges > 1; in is_shared()
250 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_kahn()
306 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_shortest_distance()
369 clone->incoming_edges++; in duplicate()
370 child.incoming_edges--; in duplicate()
437 child.incoming_edges, in print_overflows()
457 vertices_[i].incoming_edges = 0; in update_incoming_edge_count()
463 vertices_[l.objidx].incoming_edges++; in update_incoming_edge_count()
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/harfbuzz/src/
H A Dhb-repacker.hh43 incoming_edges (0), in vertex_t()
52 unsigned incoming_edges; member
59 return incoming_edges > 1; in is_shared()
250 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_kahn()
306 if (!(vertices_[link.objidx].incoming_edges - removed_edges[link.objidx])) in sort_shortest_distance()
369 clone->incoming_edges++; in duplicate()
370 child.incoming_edges--; in duplicate()
437 child.incoming_edges, in print_overflows()
457 vertices_[i].incoming_edges = 0; in update_incoming_edge_count()
463 vertices_[l.objidx].incoming_edges++; in update_incoming_edge_count()
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-ssa-threadupdate.c126 struct el *incoming_edges; member
265 elt->incoming_edges = NULL; in lookup_redirection_data()
282 elt->incoming_edges = XNEW (struct el); in lookup_redirection_data()
283 elt->incoming_edges->e = e; in lookup_redirection_data()
284 elt->incoming_edges->next = NULL; in lookup_redirection_data()
302 el->next = elt->incoming_edges; in lookup_redirection_data()
304 elt->incoming_edges = el; in lookup_redirection_data()
391 if (THREAD_TARGET2 (rd->incoming_edges->e)) in ssa_fix_duplicate_block_edges()
395 edge e = rd->incoming_edges->e; in ssa_fix_duplicate_block_edges()
488 for (el = rd->incoming_edges; el; el = next) in ssa_redirect_edges()
[all …]
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dtree-ssa-threadupdate.c126 struct el *incoming_edges; member
265 elt->incoming_edges = NULL; in lookup_redirection_data()
282 elt->incoming_edges = XNEW (struct el); in lookup_redirection_data()
283 elt->incoming_edges->e = e; in lookup_redirection_data()
284 elt->incoming_edges->next = NULL; in lookup_redirection_data()
302 el->next = elt->incoming_edges; in lookup_redirection_data()
304 elt->incoming_edges = el; in lookup_redirection_data()
391 if (THREAD_TARGET2 (rd->incoming_edges->e)) in ssa_fix_duplicate_block_edges()
395 edge e = rd->incoming_edges->e; in ssa_fix_duplicate_block_edges()
488 for (el = rd->incoming_edges; el; el = next) in ssa_redirect_edges()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/perfetto/src/trace_processor/importers/proto/
H A Dheap_graph_walker.cc112 PERFETTO_CHECK(c.incoming_edges == 0); in CalculateRetained()
181 component.incoming_edges++; in FoundSCC()
183 component.orig_incoming_edges = component.incoming_edges; in FoundSCC()
230 child_component.incoming_edges -= count; in FoundSCC()
234 PERFETTO_CHECK(child_component.incoming_edges == 0); in FoundSCC()
255 if (child_component.incoming_edges == 0) in FoundSCC()
/dports/www/osrm-backend/osrm-backend-5.26.0/unit_tests/extractor/
H A Dintersection_analysis_tests.cpp107 const auto incoming_edges = getIncomingEdges(graph, node); in BOOST_AUTO_TEST_CASE() local
109 for (const auto incoming_edge : incoming_edges) in BOOST_AUTO_TEST_CASE()
231 const auto incoming_edges = getIncomingEdges(graph, node); in BOOST_AUTO_TEST_CASE() local
233 for (const auto incoming_edge : incoming_edges) in BOOST_AUTO_TEST_CASE()
/dports/cad/freehdl/freehdl-0.0.7/freehdl/
H A Dcdfggen-chunk.h282 vector<int> incoming_edges; member
285 CDFGG_Node (int index, string type, vector<int> incoming_edges, vector<int> outgoing_edges) in CDFGG_Node()
288 incoming_edges (incoming_edges), in CDFGG_Node()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-ssa-threadupdate.c135 struct el *incoming_edges; member
367 elt->incoming_edges = NULL; in lookup_redirection_data()
385 elt->incoming_edges->e = e; in lookup_redirection_data()
404 el->next = elt->incoming_edges; in lookup_redirection_data()
406 elt->incoming_edges = el; in lookup_redirection_data()
696 edge e = rd->incoming_edges->e; in compute_path_counts()
1003 edge e = rd->incoming_edges->e; in estimated_freqs_path()
1046 edge e = rd->incoming_edges->e; in freqs_to_counts_path()
1084 edge e = rd->incoming_edges->e; in clear_counts_path()
1119 edge e = rd->incoming_edges->e; in ssa_fix_duplicate_block_edges()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-ssa-threadupdate.c135 struct el *incoming_edges; member
367 elt->incoming_edges = NULL; in lookup_redirection_data()
385 elt->incoming_edges->e = e; in lookup_redirection_data()
404 el->next = elt->incoming_edges; in lookup_redirection_data()
406 elt->incoming_edges = el; in lookup_redirection_data()
696 edge e = rd->incoming_edges->e; in compute_path_counts()
1003 edge e = rd->incoming_edges->e; in estimated_freqs_path()
1046 edge e = rd->incoming_edges->e; in freqs_to_counts_path()
1084 edge e = rd->incoming_edges->e; in clear_counts_path()
1119 edge e = rd->incoming_edges->e; in ssa_fix_duplicate_block_edges()
[all …]
/dports/devel/tla/tla-1.3.5/src/hackerlab/rx/
H A Dsuper.c832 e = it->incoming_edges; in semifree_superstate()
841 e = it->incoming_edges; in semifree_superstate()
1021 if (it->incoming_edges) in rx__really_free_superstate()
1025 e = it->incoming_edges; in rx__really_free_superstate()
1052 if (tct->future->incoming_edges == tct) in rx__really_free_superstate()
1055 if (tct->future->incoming_edges == tct) in rx__really_free_superstate()
1056 tct->future->incoming_edges = 0; in rx__really_free_superstate()
1395 superstate->incoming_edges = 0; in rx_superstate()
1606 if (!dest->incoming_edges) in solve_destination()
1608 dest->incoming_edges = e; in solve_destination()
[all …]
/dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/lalrpop-0.17.2/src/lr1/trace/trace_graph/
H A Dmod.rs192 let edges = enumerator.incoming_edges(start_state); in new()
221 fn incoming_edges(&self, index: NodeIndex) -> Edges<'graph, SymbolSets<'grammar>, Directed> { in incoming_edges() method
291 let edges = self.incoming_edges(index); in push_next_child()
303 let edges = self.incoming_edges(index); in push_next_child()
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/lalrpop-0.16.3/src/lr1/trace/trace_graph/
H A Dmod.rs192 let edges = enumerator.incoming_edges(start_state); in new()
221 fn incoming_edges(&self, index: NodeIndex) -> Edges<'graph, SymbolSets<'grammar>, Directed> { in incoming_edges() method
291 let edges = self.incoming_edges(index); in push_next_child()
303 let edges = self.incoming_edges(index); in push_next_child()
/dports/net/krill/krill-0.9.4/cargo-crates/lalrpop-0.19.6/src/lr1/trace/trace_graph/
H A Dmod.rs192 let edges = enumerator.incoming_edges(start_state); in new()
221 fn incoming_edges(&self, index: NodeIndex) -> Edges<'graph, SymbolSets<'grammar>, Directed> { in incoming_edges() method
291 let edges = self.incoming_edges(index); in push_next_child()
303 let edges = self.incoming_edges(index); in push_next_child()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dtree-ssa-threadupdate.c142 struct el *incoming_edges; member
335 elt->incoming_edges = NULL; in lookup_redirection_data()
352 elt->incoming_edges = XNEW (struct el); in lookup_redirection_data()
353 elt->incoming_edges->e = e; in lookup_redirection_data()
354 elt->incoming_edges->next = NULL; in lookup_redirection_data()
372 el->next = elt->incoming_edges; in lookup_redirection_data()
374 elt->incoming_edges = el; in lookup_redirection_data()
504 edge e = rd->incoming_edges->e; in ssa_fix_duplicate_block_edges()
668 for (el = rd->incoming_edges; el; el = next) in ssa_redirect_edges()
717 if (rd->incoming_edges) in ssa_redirect_edges()

12345