| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | split.c | 195 int in_nextleaf) /* next free leaf idx */ in updatesplit_split() argument
256 int in_nextleaf, /* next free leaf idx */ in updatetreesplits_split() argument
278 = permut[in_nextleaf]; in updatetreesplits_split()
283 for (n=0; n < in_nextleaf; n++) { in updatetreesplits_split()
286 (edge[in_nextedge+1]).upsize = in_nextleaf; in updatetreesplits_split()
289 (edge[in_nextedge+1]).split[Maxspc-1] = permut[in_nextleaf]; in updatetreesplits_split()
303 in_nextedge, in_nextleaf); in updatetreesplits_split()
309 in_nextedge, in_nextleaf); in updatetreesplits_split()
325 int *in_nextleaf, /* next free leaf idx */ in addnextleaf_split() argument
332 nextleaf=*in_nextleaf; in addnextleaf_split()
[all …]
|
| H A D | mrca.c | 188 in_nextedge, in_nextleaf, mrcamatrix); in updatecluster_mrca()
245 in_nextedge, in_nextleaf, mrcamatrix); in updatetreeclusters_mrca()
345 = permut[in_nextleaf];
350 for (n=0; n < in_nextleaf; n++) {
353 (edge[in_nextedge+1]).upsize = in_nextleaf;
356 (edge[in_nextedge+1]).split[Maxspc-1] = permut[in_nextleaf];
370 in_nextedge, in_nextleaf);
376 in_nextedge, in_nextleaf);
393 int *in_nextleaf, /* next free leaf idx */ in addnextleaf_mrca() argument
401 nextleaf=*in_nextleaf; in addnextleaf_mrca()
[all …]
|
| H A D | recur.c | 138 int in_nextleaf) /* next free leaf idx */ in updatecluster_recur() argument
145 in_nextedge, in_nextleaf); in updatecluster_recur()
192 in_nextedge, in_nextleaf); in updatetreeclusters_recur()
340 = permut[in_nextleaf];
345 for (n=0; n < in_nextleaf; n++) {
348 (edge[in_nextedge+1]).upsize = in_nextleaf;
351 (edge[in_nextedge+1]).split[Maxspc-1] = permut[in_nextleaf];
365 in_nextedge, in_nextleaf);
371 in_nextedge, in_nextleaf);
395 nextleaf=*in_nextleaf; in addnextleaf_recur()
[all …]
|
| H A D | pstep-split.c | 188 int *in_nextleaf) /* next free leaf idx */ in updatesplit_split() argument
198 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
201 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
213 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
215 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
224 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
230 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
241 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
265 int *in_nextleaf) /* next free leaf idx */ in addnextleaf_split() argument
272 nextleaf=*in_nextleaf; in addnextleaf_split()
[all …]
|
| H A D | recur-old.c | 197 int in_nextleaf) /* next free leaf idx */
261 int in_nextleaf, /* next free leaf idx */
283 = permut[in_nextleaf];
288 for (n=0; n < in_nextleaf; n++) {
291 (edge[in_nextedge+1]).upsize = in_nextleaf;
294 (edge[in_nextedge+1]).split[Maxspc-1] = permut[in_nextleaf];
308 in_nextedge, in_nextleaf);
314 in_nextedge, in_nextleaf);
331 int *in_nextleaf, /* next free leaf idx */ in addnextleaf_recur() argument
338 nextleaf=*in_nextleaf; in addnextleaf_recur()
[all …]
|
| H A D | pstep.h | 293 int *in_nextleaf, /* next free leaf idx */
348 int *in_nextleaf, /* next free leaf idx */
|
| H A D | pstep-deglob.c | 129 int *in_nextleaf) /* next free leaf idx */ in addnextleaf_orig() argument
136 nextleaf=*in_nextleaf; in addnextleaf_orig()
267 *in_nextleaf=nextleaf; in addnextleaf_orig()
|
| H A D | pstep-mrca.c | 133 int *in_nextleaf) /* next free leaf idx */ in addnextleaf_orig() argument
140 nextleaf=*in_nextleaf; in addnextleaf_orig()
270 *in_nextleaf=nextleaf; in addnextleaf_orig()
|
| H A D | pstep-recursive.c | 133 int *in_nextleaf) /* next free leaf idx */ in addnextleaf_orig() argument
140 nextleaf=*in_nextleaf; in addnextleaf_orig()
270 *in_nextleaf=nextleaf; in addnextleaf_orig()
|
| H A D | pstep-trueID.c | 137 int *in_nextleaf) /* next free leaf idx */ in addnextleaf_orig() argument
144 nextleaf=*in_nextleaf; in addnextleaf_orig()
274 *in_nextleaf=nextleaf; in addnextleaf_orig()
|
| H A D | pstep.c | 319 int *in_nextleaf, /* next free leaf idx */ in addnextleaf_orig() argument
326 nextleaf=*in_nextleaf; in addnextleaf_orig()
377 *in_nextleaf=nextleaf; in addnextleaf_orig()
|