| /dports/biology/iqtree/IQ-TREE-2.0.6/pll/ |
| H A D | treeIO.c | 144 sprintf(treestr, "%s", nameptr); in pllTreeToNewickREC()
149 while (*treestr) treestr++; in pllTreeToNewickREC()
153 *treestr++ = '('; in pllTreeToNewickREC()
156 *treestr++ = ','; in pllTreeToNewickREC()
161 *treestr++ = ','; in pllTreeToNewickREC()
171 sprintf(treestr, ":0.0;\n"); in pllTreeToNewickREC()
173 sprintf(treestr, ";\n"); in pllTreeToNewickREC()
209 while (*treestr) treestr++; in pllTreeToNewickREC()
210 return treestr; in pllTreeToNewickREC()
232 while (*treestr) treestr++; in pllTreeToNewick()
[all …]
|
| H A D | treeIO.h | 19 char *pllTreeToNewick(char *treestr, tree *tr, nodeptr p, pllBoolean printBranchLengths, pllBoolean…
|
| H A D | pll.h | 1592 extern char * pllTreeToNewick ( char *treestr, pllInstance *tr, partitionList *pr, nodeptr p,
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/utils/ |
| H A D | pllnni.cpp | 1061 sprintf(treestr, "%s", nameptr); in pllTree2StringREC()
1065 while (*treestr) treestr++; in pllTree2StringREC()
1067 *treestr++ = '('; in pllTree2StringREC()
1070 *treestr++ = ','; in pllTree2StringREC()
1074 *treestr++ = ','; in pllTree2StringREC()
1078 *treestr++ = ')'; in pllTree2StringREC()
1083 sprintf(treestr, ":0.0;\n"); in pllTree2StringREC()
1085 sprintf(treestr, ";\n"); in pllTree2StringREC()
1108 sprintf(treestr, "%s", "\0"); in pllTree2StringREC()
1113 while (*treestr) treestr++; in pllTree2StringREC()
[all …]
|
| H A D | pllnni.h | 270 char *pllTree2StringREC(char *treestr, pllInstance *tr, partitionList *pr, nodeptr p, pllBoolean pr…
|
| /dports/biology/fastdnaml/fastDNAml_1.2.2/source/ |
| H A D | fastDNAml.c | 2999 Free(treestr); in receiveTree()
3609 while (*treestr) treestr++; in treeString()
3613 while (*treestr) treestr++; in treeString()
3616 while (*treestr) treestr++; in treeString()
3619 while (*treestr) treestr++; in treeString()
3622 while (*treestr) treestr++; in treeString()
3625 while (*treestr) treestr++; in treeString()
3642 treestr = treeString(treestr, tr, p->next->back, form); in treeString()
3647 treestr = treeString(treestr, tr, p->back, form); in treeString()
3683 Free(treestr); in treeOut()
[all …]
|
| /dports/biology/hyphy/hyphy-2.5.33/tests/hbltests/UnitTests/HBLCommands/res/SCFG/ |
| H A D | SCFG.ibf | 358 function render_parsetree (treestr)
365 dot_string * dot_recursion(treestr, "root", 0, 0);
376 function dot_recursion (treestr, parent, nt_count, term_count)
388 for (i = 1; i < Abs(treestr)-1; i = i+1)
390 if (treestr[i] == "(")
399 for (j = i+1; j < Abs(treestr)-1; j=j+1)
401 if (treestr[j] == " ")
412 else if (treestr[i] == ")")
422 dot_string * ("\""+parent+"\"->\""+treestr[children[ch]]+nt_count+";\n");
424 dot_recursion(treestr[]);
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | treesort.c | 452 char *treestr, in sprintfctree() local
457 treestr = (char *) calloc((size_t) strglen, sizeof(char)); in sprintfctree()
458 tmpptr = treestr; in sprintfctree()
466 return treestr; in sprintfctree()
669 void fprintffullpstree(FILE *outf, char *treestr) in fprintffullpstree() argument
674 for(n=0; treestr[n] != '\0'; n++){ in fprintffullpstree()
675 while(isdigit((int)treestr[n])){ in fprintffullpstree()
676 idnum = (10 * idnum) + ((int)treestr[n]-48); in fprintffullpstree()
691 fprintf(outf, "%c", treestr[n]); in fprintffullpstree()
|
| H A D | treesort.h | 208 void fprintffullpstree(FILE *outf, char *treestr);
|
| H A D | puzzle.h | 541 void fprintffullpstree(FILE *outf, char *treestr);
|
| /dports/textproc/py-nltk/nltk-3.4.1/nltk/corpus/reader/ |
| H A D | conll.py | 314 treestr = ''
326 treestr += '%s (%s %s) %s' % (left, pos_tag, word, right)
328 tree = self._tree_class.fromstring(treestr)
330 tree = self._tree_class.fromstring('(%s %s)' % (self._root_label, treestr))
|
| /dports/biology/py-biopython/biopython-1.79/Bio/Phylo/ |
| H A D | NewickIO.py | 260 for treestr in self.to_strings(**kwargs):
261 handle.write(treestr + "\n")
|
| /dports/sysutils/openipmi/OpenIPMI-2.0.29/swig/python/openipmigui/ |
| H A D | gui.py | 61 def __init__(self, treestr): argument
62 self.treestr = treestr
|
| /dports/biology/migrate/migrate-3.6.11/src/ |
| H A D | menu.c | 1165 char treestr[4][20] = {"None", "All", "Best", "Last chain"}; in menuInput() local
1302 MI_TREES, treestr[1]); in menuInput()
1306 MI_TREES, treestr[2]); in menuInput()
1310 MI_TREES, treeinc ,treestr[3]); in menuInput()
1315 MI_TREES, treestr[0]); in menuInput()
|