Home
last modified time | relevance | path

Searched refs:ordered_nodes (Results 1 – 25 of 65) sorted by relevance

123

/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dget_node_info.R101 ordered_nodes <-
105 for (i in seq(ordered_nodes)) {
122 ordered_nodes[i])
125 if (ordered_nodes[i] %in%
130 if (!(ordered_nodes[i] %in%
133 ordered_nodes[i])) {
146 if (ordered_nodes[i] %in%
154 ordered_nodes[i])) {
173 ordered_nodes[i]
184 ordered_nodes[i])]),
[all …]
/dports/devel/py-logilab-common/logilab-common-1.8.2/test/
H A Dtest_graph.py21 from logilab.common.graph import get_cycles, has_path, ordered_nodes, UnorderableGraph
52 ordered = ordered_nodes(graph)
57 ordered = ordered_nodes(graph)
60 ordered = ordered_nodes(graph)
65 ordered = ordered_nodes(graph)
70 ordered = ordered_nodes(graph)
75 ordered = ordered_nodes(graph)
80 ordered = ordered_nodes(graph)
85 self.assertRaises(UnorderableGraph, ordered_nodes, graph)
/dports/security/py-angr/angr-9.0.5405/angr/analyses/cfg/
H A Dcfg_utils.py159 ordered_nodes = [ ]
162 CFGUtils._append_scc(graph, ordered_nodes, sccs[n.scc_id])
164 ordered_nodes.append(n)
167 return ordered_nodes
170 ordered_nodes = [ n for n in ordered_nodes if n in nodes ]
171 return ordered_nodes
182 def _append_scc(graph, ordered_nodes, scc): argument
195 for parent_node in reversed(ordered_nodes):
212 ordered_nodes.extend(CFGUtils.quasi_topological_sort_nodes(subgraph))
/dports/cad/tochnog/Sources/Tochnog-Latest-jan-2014/
H A Dmerge.cc31 *old_node_numbers=NULL, *ordered_nodes=NULL, in merge() local
47 ordered_nodes = get_new_int(1+max_node); in merge()
89 ordered_list_apply( inod, ordered_nodes, tmp_max_node, in merge()
110 ordered_list_apply( inod, ordered_nodes, tmp_max_node, node, in merge()
139 delete[] ordered_nodes; in merge()
H A Drefine_l.cc28 long int version, long int edge_nodes[2], long int ordered_nodes[] );
60 edge_nodes[2], *ordered_nodes=NULL; in refine_locally() local
93 ordered_nodes = get_new_int(1+max_node_refined); in refine_locally()
553 version, edge_nodes, ordered_nodes ); in refine_locally()
558 version, edge_nodes, ordered_nodes ); in refine_locally()
565 version, edge_nodes, ordered_nodes ); in refine_locally()
570 version, edge_nodes, ordered_nodes ); in refine_locally()
575 version, edge_nodes, ordered_nodes ); in refine_locally()
934 delete[] ordered_nodes; in refine_locally()
1037 long int version, long int edge_nodes[2], long int ordered_nodes[] ) in refine_get_node_number() argument
[all …]
H A Drefine_g.cc45 *ordered_nodes=NULL; in refine_globally() local
72 ordered_nodes = get_new_int(MUL*(1+max_node)); in refine_globally()
325 ordered_list_apply( inod, ordered_nodes, tmp_max_node, tmp_node, in refine_globally()
365 delete[] ordered_nodes; in refine_globally()
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/circuits/
H A Dcircuit_dag.py150 def ordered_nodes(self) -> Iterator[Unique[ops.Operation]]: member in CircuitDag
182 return (node.val for node in self.ordered_nodes())
203 for node in self.ordered_nodes():
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/circuits/
H A Dcircuit_dag.py150 def ordered_nodes(self) -> Iterator[Unique[ops.Operation]]: member in CircuitDag
182 return (node.val for node in self.ordered_nodes())
203 for node in self.ordered_nodes():
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/circuits/
H A Dcircuit_dag.py150 def ordered_nodes(self) -> Iterator[Unique[ops.Operation]]: member in CircuitDag
182 return (node.val for node in self.ordered_nodes())
203 for node in self.ordered_nodes():
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/circuits/
H A Dcircuit_dag.py150 def ordered_nodes(self) -> Iterator[Unique[ops.Operation]]: member in CircuitDag
182 return (node.val for node in self.ordered_nodes())
203 for node in self.ordered_nodes():
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/circuits/
H A Dcircuit_dag.py150 def ordered_nodes(self) -> Iterator[Unique[ops.Operation]]: member in CircuitDag
182 return (node.val for node in self.ordered_nodes())
203 for node in self.ordered_nodes():
/dports/biology/p5-Bio-MAGETAB/Bio-MAGETAB-1.31/lib/Bio/MAGETAB/Util/Writer/
H A DSDRF.pm255 my @ordered_nodes;
265 push @ordered_nodes, $current, $edge;
279 push @ordered_nodes, $current;
284 push @ordered_nodes, @fvs;
287 push @lists, \@ordered_nodes;
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/bookmarks/browser/
H A Dbookmark_model.cc672 const std::vector<const BookmarkNode*>& ordered_nodes) { in ReorderChildren() argument
677 DCHECK_EQ(parent->children().size(), ordered_nodes.size()); in ReorderChildren()
678 for (const BookmarkNode* node : ordered_nodes) in ReorderChildren()
684 if (ordered_nodes.size() > 1) { in ReorderChildren()
686 for (size_t i = 0; i < ordered_nodes.size(); ++i) in ReorderChildren()
687 order[ordered_nodes[i]] = i; in ReorderChildren()
690 ordered_nodes.size()); in ReorderChildren()
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/undo/
H A Dbookmark_undo_service.cc310 std::vector<const BookmarkNode*> ordered_nodes; in Undo() local
312 ordered_nodes.push_back( in Undo()
316 model->ReorderChildren(parent, ordered_nodes); in Undo()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/undo/
H A Dbookmark_undo_service.cc310 std::vector<const BookmarkNode*> ordered_nodes; in Undo() local
312 ordered_nodes.push_back( in Undo()
316 model->ReorderChildren(parent, ordered_nodes); in Undo()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/bookmarks/browser/
H A Dbookmark_model.cc694 const std::vector<const BookmarkNode*>& ordered_nodes) { in ReorderChildren() argument
699 DCHECK_EQ(parent->children().size(), ordered_nodes.size()); in ReorderChildren()
700 for (const BookmarkNode* node : ordered_nodes) in ReorderChildren()
706 if (ordered_nodes.size() > 1) { in ReorderChildren()
708 for (size_t i = 0; i < ordered_nodes.size(); ++i) in ReorderChildren()
709 order[ordered_nodes[i]] = i; in ReorderChildren()
712 ordered_nodes.size()); in ReorderChildren()
/dports/net-mgmt/etherape/etherape-0.9.20/src/
H A Ddiagram.c181 GTree *ordered_nodes);
1138 GTree *ordered_nodes = NULL; in limit_nodes() local
1151 ordered_nodes = g_tree_new(traffic_compare); in limit_nodes()
1153 g_tree_foreach(canvas_nodes, (GTraverseFunc)add_ordered_node, ordered_nodes); in limit_nodes()
1154 g_tree_foreach(ordered_nodes, (GTraverseFunc)check_ordered_node, in limit_nodes()
1156 g_tree_destroy(ordered_nodes); in limit_nodes()
1160 GTree *ordered_nodes) in add_ordered_node() argument
1162 g_tree_insert(ordered_nodes, node, node); in add_ordered_node()
1164 g_tree_nnodes(ordered_nodes)); in add_ordered_node()
/dports/lang/zig-devel/zig-0.9.0/src/link/MachO/
H A DTrie.zig195 /// iterate over `Trie.ordered_nodes` and call this method on each node.
281 ordered_nodes: std.ArrayListUnmanaged(*Node) = .{},
328 self.ordered_nodes.shrinkRetainingCapacity(0);
329 try self.ordered_nodes.ensureTotalCapacity(allocator, self.node_count);
340 self.ordered_nodes.appendAssumeCapacity(next);
347 for (self.ordered_nodes.items) |node| {
374 for (self.ordered_nodes.items) |node| {
385 self.ordered_nodes.deinit(allocator);
/dports/lang/zig/zig-0.9.0/src/link/MachO/
H A DTrie.zig195 /// iterate over `Trie.ordered_nodes` and call this method on each node.
281 ordered_nodes: std.ArrayListUnmanaged(*Node) = .{},
328 self.ordered_nodes.shrinkRetainingCapacity(0);
329 try self.ordered_nodes.ensureTotalCapacity(allocator, self.node_count);
340 self.ordered_nodes.appendAssumeCapacity(next);
347 for (self.ordered_nodes.items) |node| {
374 for (self.ordered_nodes.items) |node| {
385 self.ordered_nodes.deinit(allocator);
/dports/www/firefox/firefox-99.0/third_party/python/gyp/pylib/gyp/
H A Dcommon.py583 ordered_nodes = []
594 ordered_nodes.insert(0, node)
597 return ordered_nodes
/dports/net/cjdns/cjdns-cjdns-v21.1/node_build/dependencies/libuv/build/gyp/pylib/gyp/
H A Dcommon.py594 ordered_nodes = []
605 ordered_nodes.insert(0, node)
608 return ordered_nodes
/dports/www/npm-node16/npm-6.14.8/lib/node_modules/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py600 ordered_nodes = []
611 ordered_nodes.insert(0, node)
614 return ordered_nodes
/dports/www/node10/node-v10.24.1/tools/gyp/pylib/gyp/
H A Dcommon.py590 ordered_nodes = []
601 ordered_nodes.insert(0, node)
604 return ordered_nodes
/dports/www/npm-node14/npm-6.14.8/lib/node_modules/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py600 ordered_nodes = []
611 ordered_nodes.insert(0, node)
614 return ordered_nodes
/dports/www/npm/npm-6.14.8/lib/node_modules/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py600 ordered_nodes = []
611 ordered_nodes.insert(0, node)
614 return ordered_nodes

123