/dports/devel/serd/serd-0.30.10/waflib/extras/ |
H A D | protoc.py | 104 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 D | protoc.py | 104 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 D | search_nodes.py | 17 D = t.search_nodes(name="D") 19 nodes = t.search_nodes(dist=0.5)
|
H A D | add_features.py | 9 A = t.search_nodes(name="A")[0] 29 print "This tree has", len(t.search_nodes(vowel=True)), "vowel nodes"
|
H A D | custom_tree_traversing.py | 4 node = t.search_nodes(name="C")[0]
|
H A D | copy_and_paste_trees.py | 31 A = t1.search_nodes(name='A')[0]
|
/dports/games/crafty/crafty-25.2_1/ |
H A D | iterate.c | 67 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 D | quiesce.c | 57 if (search_nodes && --temp_search_nodes <= 0) { in Quiesce() 302 if (search_nodes && --temp_search_nodes <= 0) { in QuiesceEvasions()
|
H A D | data.h | 124 extern uint64_t search_nodes;
|
H A D | data.c | 514 uint64_t search_nodes = 0; variable
|
H A D | search.c | 41 if (search_nodes && --temp_search_nodes <= 0) { in Search()
|
H A D | option.c | 3495 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 D | protoc.py | 97 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 D | orthology_and_paralogy_prediction.py | 31 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 D | test_tree.py | 314 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 D | test_phylotree.py | 201 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 D | registry-search.vala | 183 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 D | reconciliation.py | 116 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 D | clustering_tree.py | 51 A = t.search_nodes(name='A')[0]
|
/dports/biology/py-ete3/ete3-3.1.2/ete3/evol/ |
H A D | utils.py | 96 node = tol.search_nodes (name=seed_species)[0]
|
/dports/biology/py-ete3/ete3-3.1.2/ete3/tools/ |
H A D | ete_evol.py | 320 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 D | common.py | 617 target_node = main_tree.search_nodes(cladeid=cladeid)[0]
|
/dports/biology/py-ete3/ete3-3.1.2/ete3/coretype/ |
H A D | tree.py | 951 def search_nodes(self, **conditions): member in TreeNode 971 return self.search_nodes(name=name, children=[])
|