Home
last modified time | relevance | path

Searched refs:search_nodes (Results 26 – 48 of 48) sorted by relevance

12

/dports/devel/serd/serd-0.30.10/waflib/extras/
H A Dprotoc.py104 search_nodes = []
110 search_nodes = self.generator.includes_nodes
116 search_nodes.append(incpath_node)
121 search_nodes.append(incpath_node)
135 for incnode in search_nodes:
/dports/devel/sord/sord-0.16.8/waflib/extras/
H A Dprotoc.py104 search_nodes = []
110 search_nodes = self.generator.includes_nodes
116 search_nodes.append(incpath_node)
121 search_nodes.append(incpath_node)
135 for incnode in search_nodes:
/dports/biology/py-ete3/ete3-3.1.2/examples/general/
H A Dsearch_nodes.py17 D = t.search_nodes(name="D")
19 nodes = t.search_nodes(dist=0.5)
H A Dadd_features.py9 A = t.search_nodes(name="A")[0]
29 print "This tree has", len(t.search_nodes(vowel=True)), "vowel nodes"
H A Dcustom_tree_traversing.py4 node = t.search_nodes(name="C")[0]
H A Dcopy_and_paste_trees.py31 A = t1.search_nodes(name='A')[0]
/dports/games/crafty/crafty-25.2_1/
H A Diterate.c67 temp_search_nodes = search_nodes; in Iterate()
246 if (search_nodes) in Iterate()
247 nodes_between_time_checks = search_nodes; in Iterate()
316 if (search_nodes) in Iterate()
317 nodes_between_time_checks = search_nodes - tree->nodes_searched; in Iterate()
562 if (search_nodes && tree->nodes_searched >= search_nodes) in Iterate()
H A Dquiesce.c57 if (search_nodes && --temp_search_nodes <= 0) { in Quiesce()
302 if (search_nodes && --temp_search_nodes <= 0) { in QuiesceEvasions()
H A Ddata.h124 extern uint64_t search_nodes;
H A Ddata.c514 uint64_t search_nodes = 0; variable
H A Dsearch.c41 if (search_nodes && --temp_search_nodes <= 0) { in Search()
H A Doption.c3495 search_nodes = atoi(args[1]); in Option()
3496 Print(32, "search nodes set to %" PRIu64 ".\n", search_nodes); in Option()
/dports/audio/audacity/audacity-Audacity-3.1.3/lib-src/lv2/lv2/waflib/extras/
H A Dprotoc.py97 search_nodes = []
103 search_nodes = self.generator.includes_nodes
107 search_nodes.append(self.generator.bld.path.find_node(incpath))
118 for incnode in search_nodes:
/dports/biology/py-ete3/ete3-3.1.2/examples/phylogenies/
H A Dorthology_and_paralogy_prediction.py31 matches = t.search_nodes(name="Hsa_001")
73 dups = t.search_nodes(evoltype="D") # Return all duplication nodes
/dports/biology/py-ete3/ete3-3.1.2/ete3/test/
H A Dtest_tree.py314 D = t.search_nodes(name="D")[0]
315 F = t.search_nodes(name="F")[0]
316 J = t.search_nodes(name="J")[0]
345 D = t.search_nodes(name="D")[0]
346 F = t.search_nodes(name="F")[0]
347 J = t.search_nodes(name="J")[0]
478 A = t.search_nodes(name="A")[0]
479 B = t.search_nodes(name="B")[0]
480 C = t.search_nodes(name="C")[0]
556 A = t.search_nodes(name="A")[0]
[all …]
H A Dtest_phylotree.py201 seed = t.search_nodes(name="Hsa_001")[0]
344 expected_root = t.search_nodes(name="Dme_002")[0]
/dports/devel/dconf-editor/dconf-editor-3.38.3/editor/
H A Dregistry-search.vala183 private GLib.Queue<string> search_nodes = new GLib.Queue<string> ();
446 search_nodes.clear ();
453 search_nodes.push_head (ModelUtils.get_base_path (current_path));
455 search_nodes.push_head ("/");
470 if (search_nodes.is_empty ())
484 string next = (!) search_nodes.pop_head ();
504 search_nodes.push_tail (full_name); // we still search local children
/dports/biology/py-ete3/ete3-3.1.2/ete3/phylo/
H A Dreconciliation.py116 subtopo = template.search_nodes(children=[], name=spseed)[0]
135 node = t.search_nodes(children=[], name=list(species)[0])[0]
/dports/biology/py-ete3/ete3-3.1.2/examples/clustering/
H A Dclustering_tree.py51 A = t.search_nodes(name='A')[0]
/dports/biology/py-ete3/ete3-3.1.2/ete3/evol/
H A Dutils.py96 node = tol.search_nodes (name=seed_species)[0]
/dports/biology/py-ete3/ete3-3.1.2/ete3/tools/
H A Dete_evol.py320 res = tree.search_nodes(name=node)
325 res = tree.search_nodes(node_id=int(node))
/dports/biology/py-ete3/ete3-3.1.2/ete3/tools/ete_build_lib/workflow/
H A Dcommon.py617 target_node = main_tree.search_nodes(cladeid=cladeid)[0]
/dports/biology/py-ete3/ete3-3.1.2/ete3/coretype/
H A Dtree.py951 def search_nodes(self, **conditions): member in TreeNode
971 return self.search_nodes(name=name, children=[])

12