| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-mrca.c | 95 *nextleaf = 3; in inittree_orig()
137 int nextleaf; in addnextleaf_orig() local
140 nextleaf=*in_nextleaf; in addnextleaf_orig()
151 if (nextleaf >= Maxspc) { in addnextleaf_orig()
180 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf_orig()
266 nextleaf++; in addnextleaf_orig()
270 *in_nextleaf=nextleaf; in addnextleaf_orig()
303 for (i = 1; i < nextleaf; i++) { in writeOTU_orig()
489 for (a = 0; a < nextleaf - 2; a++) in onepstep()
490 for (b = a + 1; b < nextleaf - 1; b++) in onepstep()
[all …]
|
| H A D | pstep-recursive.c | 95 *nextleaf = 3; in inittree_orig()
137 int nextleaf; in addnextleaf_orig() local
140 nextleaf=*in_nextleaf; in addnextleaf_orig()
151 if (nextleaf >= Maxspc) { in addnextleaf_orig()
180 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf_orig()
266 nextleaf++; in addnextleaf_orig()
270 *in_nextleaf=nextleaf; in addnextleaf_orig()
303 for (i = 1; i < nextleaf; i++) { in writeOTU_orig()
489 for (a = 0; a < nextleaf - 2; a++) in onepstep()
490 for (b = a + 1; b < nextleaf - 1; b++) in onepstep()
[all …]
|
| H A D | pstep-trueID.c | 99 *nextleaf = 3; in inittree_orig()
141 int nextleaf; in addnextleaf_orig() local
144 nextleaf=*in_nextleaf; in addnextleaf_orig()
155 if (nextleaf >= Maxspc) { in addnextleaf_orig()
184 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf_orig()
270 nextleaf++; in addnextleaf_orig()
274 *in_nextleaf=nextleaf; in addnextleaf_orig()
308 for (i = 1; i < nextleaf; i++) { in writeOTU_orig()
500 for (a = 0; a < nextleaf - 2; a++) in onepstep()
501 for (b = a + 1; b < nextleaf - 1; b++) in onepstep()
[all …]
|
| H A D | split.c | 60 *nextleaf = 3; in inittree_split()
152 for (m = 0; m<nextleaf; m++) in check_split()
164 nextleaf); in check_split()
178 nextleaf); in check_split()
329 int nextleaf; in addnextleaf_split() local
332 nextleaf=*in_nextleaf; in addnextleaf_split()
343 if (nextleaf >= Maxspc) { in addnextleaf_split()
374 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_split()
375 edgeofleaf[permut[nextleaf]] = nextedge+1; in addnextleaf_split()
378 edgeofleaf, nextedge, nextleaf, permut); in addnextleaf_split()
[all …]
|
| H A D | pstep-deglob.c | 62 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_orig() argument
92 *nextleaf = 3; in inittree_orig()
133 int nextleaf; in addnextleaf_orig() local
136 nextleaf=*in_nextleaf; in addnextleaf_orig()
147 if (nextleaf >= Maxspc) { in addnextleaf_orig()
176 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf_orig()
263 nextleaf++; in addnextleaf_orig()
267 *in_nextleaf=nextleaf; in addnextleaf_orig()
291 int nextleaf, /* next free leaf idx */ in writeOTU_orig() argument
299 for (i = 1; i < nextleaf; i++) { in writeOTU_orig()
[all …]
|
| H A D | recur.c | 60 *nextleaf = 3; in inittree_recur()
213 for (m = 0; m<nextleaf; m++)
225 nextleaf);
239 nextleaf);
392 int nextleaf; in addnextleaf_recur() local
395 nextleaf=*in_nextleaf; in addnextleaf_recur()
406 if (nextleaf >= Maxspc) { in addnextleaf_recur()
437 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_recur()
438 edgeofleaf[permut[nextleaf]] = nextedge+1; in addnextleaf_recur()
442 edgeofleaf, nextedge, nextleaf, permut); in addnextleaf_recur()
[all …]
|
| H A D | pstep-split.c | 125 *nextleaf = 3; in inittree_split()
269 int nextleaf; in addnextleaf_split() local
272 nextleaf=*in_nextleaf; in addnextleaf_split()
283 if (nextleaf >= Maxspc) { in addnextleaf_split()
312 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf_split()
400 nextleaf++; in addnextleaf_split()
404 *in_nextleaf=nextleaf; in addnextleaf_split()
438 for (i = 1; i < nextleaf; i++) { in writeOTU_split()
628 for (a = 0; a < nextleaf - 2; a++) in onepstep_split()
629 for (b = a + 1; b < nextleaf - 1; b++) in onepstep_split()
[all …]
|
| H A D | pstep.c | 267 *nextleaf = 3; in inittree_orig()
323 int nextleaf; in addnextleaf_orig() local
326 nextleaf=*in_nextleaf; in addnextleaf_orig()
337 if (nextleaf >= Maxspc) { in addnextleaf_orig()
367 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_orig()
368 edgeofleaf[permut[nextleaf]] = nextedge+1; in addnextleaf_orig()
373 nextleaf++; in addnextleaf_orig()
377 *in_nextleaf=nextleaf; in addnextleaf_orig()
633 for (a = 0; a < nextleaf - 2; a++) in onepstep_orig()
634 for (b = a + 1; b < nextleaf - 1; b++) in onepstep_orig()
[all …]
|
| H A D | recur-old.c | 61 *nextleaf = 3; in inittree_recur()
158 for (m = 0; m<nextleaf; m++)
170 nextleaf);
184 nextleaf);
335 int nextleaf; in addnextleaf_recur() local
338 nextleaf=*in_nextleaf; in addnextleaf_recur()
350 if (nextleaf >= Maxspc) { in addnextleaf_recur()
381 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_recur()
382 edgeofleaf[permut[nextleaf]] = nextedge+1; in addnextleaf_recur()
562 if ((lmax + rmax) != (nextleaf-1)) { in computepenaltiestree_recur()
[all …]
|
| H A D | pstep-mrca.h | 86 int *nextleaf); /* out: next free leaf index (=3) */
95 int *nextleaf); /* next free leaf idx */
108 int nextleaf, /* next free leaf idx */
117 int nextleaf, /* next free leaf idx */
136 int nextleaf, /* next free leaf idx */
|
| H A D | pstep-recursive.h | 86 int *nextleaf); /* out: next free leaf index (=3) */
95 int *nextleaf); /* next free leaf idx */
108 int nextleaf, /* next free leaf idx */
117 int nextleaf, /* next free leaf idx */
136 int nextleaf, /* next free leaf idx */
|
| H A D | pstep-trueID.h | 86 int *nextleaf); /* out: next free leaf index (=3) */
95 int *nextleaf); /* next free leaf idx */
108 int nextleaf, /* next free leaf idx */
117 int nextleaf, /* next free leaf idx */
136 int nextleaf, /* next free leaf idx */
|
| H A D | mrca.c | 66 *nextleaf = 3; in inittree_mrca()
398 int nextleaf; in addnextleaf_mrca() local
401 nextleaf=*in_nextleaf; in addnextleaf_mrca()
412 if (nextleaf >= Maxspc) { in addnextleaf_mrca()
443 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_mrca()
444 edgeofleaf[permut[nextleaf]] = nextedge+1; in addnextleaf_mrca()
448 edgeofleaf, nextedge, nextleaf, permut); in addnextleaf_mrca()
451 Maxspc, edgeofleaf, nextedge, nextleaf, in addnextleaf_mrca()
584 for (l= 0; l<nextleaf-1; l++) { in computepenaltiestree_mrca()
625 if ((lmax + rmax) != (nextleaf-1)) { in computepenaltiestree_mrca()
[all …]
|
| H A D | pstep-deglob.h | 104 int *nextleaf); /* out: next free leaf index (=3) */
113 int *nextleaf); /* next free leaf idx */
126 int nextleaf, /* next free leaf idx */
135 int nextleaf, /* next free leaf idx */
154 int nextleaf, /* next free leaf idx */
|
| H A D | pstep-split.h | 112 int *nextleaf); /* out: next free leaf index (=3) */
121 int *nextleaf); /* next free leaf idx */
134 int nextleaf, /* next free leaf idx */
143 int nextleaf, /* next free leaf idx */
162 int nextleaf, /* next free leaf idx */
|
| H A D | pstep.h | 239 int nextleaf, /* next free leaf idx */
247 int nextleaf, /* next free leaf idx */
260 int nextleaf, /* next free leaf idx */
277 int *nextleaf, /* out: next free leaf index (=3) */
330 int *nextleaf, /* out: next free leaf index (=3) */
|
| H A D | pstep-orig.c | 67 nextleaf = 3; in inittree()
111 if (nextleaf >= Maxspc) { in addnextleaf()
140 edgeofleaf[nextleaf] = nextedge+1; in addnextleaf()
227 nextleaf++; in addnextleaf()
250 for (i = 1; i < nextleaf; i++) { in writeOTU()
|
| H A D | pstep-orig.h | 46 EXTERN int nextleaf; /* next leaf to add to tree */ variable
|
| /dports/print/lyx/lyx-2.3.4.2/src/support/ |
| H A D | weighted_btree.h | 299 leaf_node *nextleaf; member
314 prevleaf = nextleaf = NULL; in initialize()
1493 leaf = leaf->nextleaf;
2115 newleaf->nextleaf = leaf->nextleaf;
2116 if (newleaf->nextleaf == NULL) {
2135 leaf->nextleaf = newleaf;
2593 left->nextleaf = right->nextleaf;
2594 if (left->nextleaf)
2915 n = n->nextleaf;
3094 if (n->nextleaf)
[all …]
|
| /dports/devel/tcllib/tcllib-1.20/modules/struct/tree/ |
| H A D | tn.c | 34 n->nextleaf = NULL; in tn_new()
154 if ((t->leaves == n) || n->prevleaf || n->nextleaf) { in tn_leaf()
163 n->nextleaf = first; in tn_leaf()
176 if ((t->leaves == n) || n->prevleaf || n->nextleaf) { in tn_notleaf()
178 t->leaves = n->nextleaf; in tn_notleaf()
181 n->prevleaf->nextleaf = n->nextleaf; in tn_notleaf()
183 if (n->nextleaf) { in tn_notleaf()
184 n->nextleaf->prevleaf = n->prevleaf; in tn_notleaf()
187 n->nextleaf = NULL; in tn_notleaf()
|
| H A D | t.c | 424 fprintf (f, " %p '%s'",n->nextleaf,n->nextleaf?Tcl_GetString(n->nextleaf->name):"");fflush(f); in t_dump()
|
| /dports/devel/tcllibc/tcllib-1.20/modules/struct/tree/ |
| H A D | tn.c | 34 n->nextleaf = NULL; in tn_new()
154 if ((t->leaves == n) || n->prevleaf || n->nextleaf) { in tn_leaf()
163 n->nextleaf = first; in tn_leaf()
176 if ((t->leaves == n) || n->prevleaf || n->nextleaf) { in tn_notleaf()
178 t->leaves = n->nextleaf; in tn_notleaf()
181 n->prevleaf->nextleaf = n->nextleaf; in tn_notleaf()
183 if (n->nextleaf) { in tn_notleaf()
184 n->nextleaf->prevleaf = n->prevleaf; in tn_notleaf()
187 n->nextleaf = NULL; in tn_notleaf()
|
| H A D | t.c | 424 fprintf (f, " %p '%s'",n->nextleaf,n->nextleaf?Tcl_GetString(n->nextleaf->name):"");fflush(f); in t_dump()
|
| /dports/net/tcptrace/tcptrace-508f73a/ |
| H A D | dyncounter.c | 85 struct node *nextleaf; /* linked list of leaves, for NextCounter() */ member
651 pdc->lastleaf->nextleaf = pnode; in FinishTreeRecurse()
675 pnode = pnode->nextleaf; in PrintLeafList()
709 return(NextCounterRecurse(node->nextleaf, 0, pix, pcount)); in NextCounterRecurse()
|
| /dports/biology/mummer/mummer-4.0.0beta2-2-g277dac5/src/kurtz/streesrc/ |
| H A D | iterator.c | 84 /*@null@*/ Lref nextleaf(Suffixtree *stree,Lref lptr) in nextleaf() function
122 lptr = nextleaf(stree,nref->address); in nextnode()
|