Home
last modified time | relevance | path

Searched refs:new_nodes (Results 1 – 25 of 476) sorted by relevance

12345678910>>...20

/dports/textproc/py-sphinx/Sphinx-3.5.2/tests/
H A Dtest_versioning.py77 assert not new_nodes
83 new_nodes = list(merge_doctrees(original, added, is_paragraph))
85 assert len(new_nodes) == 1
91 new_nodes = list(merge_doctrees(original, deleted, is_paragraph))
93 assert not new_nodes
101 assert not new_nodes
107 new_nodes = list(merge_doctrees(original, insert, is_paragraph))
109 assert len(new_nodes) == 1
118 assert len(new_nodes) == 1
128 assert len(new_nodes) == 1
[all …]
/dports/games/minetest/minetest-5.4.1/src/
H A Denvironment.cpp148 core::aabbox3d<s16> new_nodes; in continueRaycast() local
151 new_nodes = state->m_search_range; in continueRaycast()
159 new_nodes.MinEdge.X = new_nodes.MaxEdge.X; in continueRaycast()
161 new_nodes.MaxEdge.X = new_nodes.MinEdge.X; in continueRaycast()
163 new_nodes.MinEdge.Y = new_nodes.MaxEdge.Y; in continueRaycast()
165 new_nodes.MaxEdge.Y = new_nodes.MinEdge.Y; in continueRaycast()
167 new_nodes.MinEdge.Z = new_nodes.MaxEdge.Z; in continueRaycast()
169 new_nodes.MaxEdge.Z = new_nodes.MinEdge.Z; in continueRaycast()
173 for (s16 x = new_nodes.MinEdge.X; x <= new_nodes.MaxEdge.X; x++) in continueRaycast()
174 for (s16 y = new_nodes.MinEdge.Y; y <= new_nodes.MaxEdge.Y; y++) in continueRaycast()
[all …]
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dadd_n_nodes.R101 new_nodes <-
110 new_nodes <-
111 new_nodes %>%
118 new_nodes <-
119 new_nodes %>%
123 new_nodes[, 1] <- new_nodes[, 1] + graph$last_node
126 dplyr::bind_rows(graph$nodes_df, new_nodes)
H A Dadd_nodes_from_df_cols.R163 new_nodes <-
168 new_nodes <-
177 new_nodes[, 1] <- new_nodes[, 1] + graph$last_node
181 dplyr::bind_rows(graph$nodes_df, new_nodes)
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/executor/
H A Dpointwise_fusion_pass.cc170 std::vector<nnvm::ObjectPtr> new_nodes; in CopyAndReplaceSubgraphs() local
171 new_nodes.reserve(idx.num_nodes()); in CopyAndReplaceSubgraphs()
191 new_nodes.emplace_back(nnvm::Node::Create()); in CopyAndReplaceSubgraphs()
192 auto& node_copy = new_nodes.back(); in CopyAndReplaceSubgraphs()
196 new_nodes.emplace_back(idx[i].weak_ref.lock()); in CopyAndReplaceSubgraphs()
199 auto& node_copy = new_nodes.back(); in CopyAndReplaceSubgraphs()
206 node_copy->inputs.emplace_back(new_nodes[input.node_id], in CopyAndReplaceSubgraphs()
262 node_copy->control_deps.emplace_back(new_nodes[dep]); in CopyAndReplaceSubgraphs()
271 ret.outputs.emplace_back(new_nodes[output.node_id], in CopyAndReplaceSubgraphs()
314 new_nodes[i]->control_deps.insert(new_nodes[i]->control_deps.begin() + dep_num, in CopyAndReplaceSubgraphs()
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/executor/
H A Dpointwise_fusion_pass.cc170 std::vector<nnvm::ObjectPtr> new_nodes; in CopyAndReplaceSubgraphs() local
171 new_nodes.reserve(idx.num_nodes()); in CopyAndReplaceSubgraphs()
191 new_nodes.emplace_back(nnvm::Node::Create()); in CopyAndReplaceSubgraphs()
192 auto& node_copy = new_nodes.back(); in CopyAndReplaceSubgraphs()
196 new_nodes.emplace_back(idx[i].weak_ref.lock()); in CopyAndReplaceSubgraphs()
199 auto& node_copy = new_nodes.back(); in CopyAndReplaceSubgraphs()
206 node_copy->inputs.emplace_back(new_nodes[input.node_id], in CopyAndReplaceSubgraphs()
262 node_copy->control_deps.emplace_back(new_nodes[dep]); in CopyAndReplaceSubgraphs()
271 ret.outputs.emplace_back(new_nodes[output.node_id], in CopyAndReplaceSubgraphs()
314 new_nodes[i]->control_deps.insert(new_nodes[i]->control_deps.begin() + dep_num, in CopyAndReplaceSubgraphs()
[all …]
/dports/science/smoldyn/smoldyn-2.67/source/BioNetGen/Perl2/Visualization/
H A DContactMap.pm97 my @new_nodes = ();
102 push @new_nodes, makeNode('Mol',$mol,$mol_ind);
109 push @new_nodes, makeNode('Comp',$comp,$c_id,\@parents);
116 push @new_nodes, makeNode('CompState',$compstate,$id,\@parents);
124 my $comp1 = findComp(\@new_nodes,$splits[0],$splits[1]);
125 my $comp2 = findComp(\@new_nodes,$splits[2],$splits[3]);
128 push @new_nodes,makeNode('BondState',"+",$id,\@parents);
131 my $psg = makeStructureGraph('ContactMap',\@new_nodes);
/dports/textproc/py-parso/parso-0.8.3/parso/python/
H A Ddiff.py713 if new_nodes:
719 return new_nodes
723 new_nodes = []
774 if new_nodes:
775 while new_nodes:
794 if len(new_nodes) > 1 and new_nodes[-2].type == 'error_node':
803 if not new_nodes:
807 last_node = new_nodes[-1]
828 new_nodes.pop()
831 assert new_nodes
[all …]
/dports/devel/cpp-hocon/cpp-hocon-0.3.0/lib/src/nodes/
H A Dconfig_node_object.cc230 shared_node_list new_nodes; in add_value_on_path() local
231 new_nodes.insert(new_nodes.end(), indent.begin(), indent.end()); in add_value_on_path()
232 new_nodes.push_back(make_shared<config_node_path>(desired_path.first())); in add_value_on_path()
233 …new_nodes.push_back(make_shared<config_node_single_token>(make_shared<ignored_whitespace>(nullptr,… in add_value_on_path()
234 new_nodes.push_back(make_shared<config_node_single_token>(tokens::colon_token())); in add_value_on_path()
235 …new_nodes.push_back(make_shared<config_node_single_token>(make_shared<ignored_whitespace>(nullptr,… in add_value_on_path()
238 new_nodes.push_back(indented_value); in add_value_on_path()
249 …new_nodes.push_back(new_object.add_value_on_path(desired_path.sub_path(1), indented_value, flavor)… in add_value_on_path()
281 make_shared<config_node_field>(new_nodes)); in add_value_on_path()
295 … children_copy.insert(children_copy.end() - 1, make_shared<config_node_field>(new_nodes)); in add_value_on_path()
[all …]
/dports/net-mgmt/etherape/etherape-0.9.20/src/stats/
H A Dnode.c381 g_list_free(new_nodes); in new_nodes_clear()
382 new_nodes = NULL; in new_nodes_clear()
387 new_nodes = g_list_prepend(new_nodes, node); in new_nodes_add()
392 new_nodes = g_list_remove(new_nodes, node); in new_nodes_remove()
402 if (!new_nodes) in new_nodes_pop()
405 node = new_nodes->data; in new_nodes_pop()
406 old_item = new_nodes; in new_nodes_pop()
416 new_nodes = g_list_remove_link(new_nodes, new_nodes); in new_nodes_pop()
418 if (new_nodes) in new_nodes_pop()
425 if (!new_nodes) in new_nodes_pop()
[all …]
/dports/multimedia/streamlink/streamlink-2.1.2/docs/
H A Dext_github.py36 new_nodes = []
41 new_nodes.append(nodes.Text(head))
50 new_nodes.append(link)
52 if not new_nodes:
57 new_nodes.append(nodes.Text(tail))
59 parent.replace(node, new_nodes)
/dports/multimedia/livestreamer/livestreamer-1.12.2/docs/
H A Dext_github.py40 new_nodes = []
45 new_nodes.append(nodes.Text(head))
54 new_nodes.append(link)
56 if not new_nodes:
61 new_nodes.append(nodes.Text(tail))
63 parent.replace(node, new_nodes)
/dports/devel/arcanist/arcanist-b2e715f/src/utils/
H A DAbstractDirectedGraph.php226 $new_nodes = $this->knownNodes;
229 foreach ($new_nodes as $node => $edges) {
243 $new_nodes = $this->loadEdges($load);
245 if (!isset($new_nodes[$node]) || !is_array($new_nodes[$node])) {
254 $this->addNodes($new_nodes);
/dports/devel/arcanist-lib/arcanist-b2e715f/src/utils/
H A DAbstractDirectedGraph.php226 $new_nodes = $this->knownNodes;
229 foreach ($new_nodes as $node => $edges) {
243 $new_nodes = $this->loadEdges($load);
245 if (!isset($new_nodes[$node]) || !is_array($new_nodes[$node])) {
254 $this->addNodes($new_nodes);
/dports/misc/mnn/MNN-1.2.0/tools/converter/source/tensorflow/
H A DTfModelOptimizer.cpp73 new_nodes->push_back(moments_node); in FoldMoments()
74 new_nodes->push_back(moments_axes_node); in FoldMoments()
179 new_nodes->push_back(gamma_node); in FoldBatchNormsAlgebraic()
180 new_nodes->push_back(beta_node); in FoldBatchNormsAlgebraic()
181 new_nodes->push_back(mean_node); in FoldBatchNormsAlgebraic()
182 new_nodes->push_back(variance_node); in FoldBatchNormsAlgebraic()
183 new_nodes->push_back(mul1_input0_node); in FoldBatchNormsAlgebraic()
618 std::vector<NodeDef>* new_nodes) { in FuseConvPad() argument
625 new_nodes->push_back(weight_node); in FuseConvPad()
626 new_nodes->push_back(input_node); in FuseConvPad()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/
H A Disomorphvf2.py899 new_nodes = set()
901 new_nodes.update(
909 new_nodes = set()
911 new_nodes.update(
992 new_nodes = set()
994 new_nodes.update(
1006 new_nodes = set()
1008 new_nodes.update(
1020 new_nodes = set()
1022 new_nodes.update(
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/xml/
H A Dxpath_path.cc62 NodeSet* new_nodes = NodeSet::Create(); in Evaluate() local
71 new_nodes->Append(node); in Evaluate()
73 nodes.Swap(*new_nodes); in Evaluate()
121 NodeSet* new_nodes = NodeSet::Create(); in Evaluate() local
138 new_nodes->MarkSubtreesDisjoint(true); in Evaluate()
150 new_nodes->Append(node); in Evaluate()
154 nodes.Swap(*new_nodes); in Evaluate()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/xml/
H A Dxpath_path.cc62 NodeSet* new_nodes = NodeSet::Create(); in Evaluate() local
71 new_nodes->Append(node); in Evaluate()
73 nodes.Swap(*new_nodes); in Evaluate()
121 NodeSet* new_nodes = NodeSet::Create(); in Evaluate() local
138 new_nodes->MarkSubtreesDisjoint(true); in Evaluate()
150 new_nodes->Append(node); in Evaluate()
154 nodes.Swap(*new_nodes); in Evaluate()
/dports/databases/percona-toolkit/percona-toolkit-3.3.0/lib/Percona/XtraDB/
H A DCluster.pm174 my $new_nodes = [];
176 return $new_nodes unless @$nodes;
185 push @$new_nodes, @$nodes_found;
188 $new_nodes = $self->remove_duplicate_cxns(
189 cxns => $new_nodes,
194 foreach my $node (@$new_nodes) {
217 my @autodetected_nodes = ( @$new_nodes, @$new_slaves, @$slaves_of_slaves );
/dports/www/firefox/firefox-99.0/third_party/python/taskcluster_taskgraph/taskgraph/
H A Dgraph.py58 new_nodes, new_edges = nodes, set()
60 while (new_nodes, new_edges) != (nodes, edges):
61 nodes, edges = new_nodes, new_edges
68 new_nodes = nodes | add_nodes
70 return Graph(new_nodes, new_edges)
/dports/www/firefox/firefox-99.0/taskcluster/gecko_taskgraph/
H A Dgraph.py59 new_nodes, new_edges = nodes, set()
61 while (new_nodes, new_edges) != (nodes, edges):
62 nodes, edges = new_nodes, new_edges
69 new_nodes = nodes | add_nodes
71 return Graph(new_nodes, new_edges)
/dports/www/firefox-legacy/firefox-52.8.0esr/taskcluster/taskgraph/
H A Dgraph.py54 new_nodes, new_edges = nodes, set()
56 while (new_nodes, new_edges) != (nodes, edges):
57 nodes, edges = new_nodes, new_edges
62 new_nodes = nodes | add_nodes
64 return Graph(new_nodes, new_edges)
/dports/german/BBBike/BBBike-3.18/
H A DWay.pm115 my @new_nodes;
118 push @new_nodes, pop @{ $self->{Nodes} };
119 ($new_nodes[-1]->{NextEdge}, $new_nodes[-1]->{PrevEdge}) =
120 ($new_nodes[-1]->{PrevEdge}, $new_nodes[-1]->{NextEdge});
128 @{ $self->{Nodes} } = @new_nodes;
/dports/math/cvc4/CVC4-1.7/src/theory/strings/
H A Dtheory_strings_preprocess.cpp98 new_nodes.push_back( lemma ); in simplify()
114 new_nodes.push_back( krange ); in simplify()
117 new_nodes.push_back( krange ); in simplify()
174 new_nodes.push_back( rr ); in simplify()
241 new_nodes.push_back(lem); in simplify()
334 new_nodes.push_back(lem); in simplify()
409 new_nodes.push_back( rr ); in simplify()
485 new_nodes.push_back(assert); in simplify()
551 new_nodes.push_back(assert); in simplify()
559 if(!new_nodes.empty()) { in simplify()
[all …]
/dports/science/py-dlib/dlib-19.22/dlib/lz77_buffer/
H A Dlz77_buffer_kernel_2.h295 unsigned long new_nodes; // the number of nodes to pull from the nodes array in shift_buffer() local
303 new_nodes = 0; in shift_buffer()
305 new_nodes = N - (3-history_size); in shift_buffer()
309 new_nodes = N; in shift_buffer()
319 new_nodes = history_limit - history_size; in shift_buffer()
325 new_nodes = 0; in shift_buffer()
333 if (new_nodes != 0) in shift_buffer()
335 unsigned long stop = i - new_nodes; in shift_buffer()

12345678910>>...20