| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | mrca.c | 222 mrcamatrix[rootleaf][n] = in_nextedge; in updatetreeclusters_mrca()
223 mrcamatrix[n][rootleaf] = in_nextedge; in updatetreeclusters_mrca()
232 (edge[in_nextedge + 1]).clsize = 1; in updatetreeclusters_mrca()
234 curredge = &(edge[in_nextedge+1]); in updatetreeclusters_mrca()
344 (edge[in_nextedge]).split[Maxspc - ++((edge[in_nextedge]).downsize)]
357 (edge[in_nextedge+1]).downsize = 1;
359 curredge = &(edge[in_nextedge]);
370 in_nextedge, in_nextleaf);
376 in_nextedge, in_nextleaf);
400 nextedge=*in_nextedge; in addnextleaf_mrca()
[all …]
|
| H A D | recur.c | 171 (edge[in_nextedge]).cluster[n] = newleaf; in updatetreeclusters_recur()
177 (edge[in_nextedge + 1]).clsize = 1; in updatetreeclusters_recur()
179 curredge = &(edge[in_nextedge]); in updatetreeclusters_recur()
192 in_nextedge, in_nextleaf); in updatetreeclusters_recur()
339 (edge[in_nextedge]).split[Maxspc - ++((edge[in_nextedge]).downsize)]
352 (edge[in_nextedge+1]).downsize = 1;
354 curredge = &(edge[in_nextedge]);
365 in_nextedge, in_nextleaf);
371 in_nextedge, in_nextleaf);
394 nextedge=*in_nextedge; in addnextleaf_recur()
[all …]
|
| H A D | split.c | 268 (edge[in_nextedge]).upsize = (edge[dockedge]).upsize; in updatetreesplits_split()
274 (edge[in_nextedge]).downsize = (edge[dockedge]).downsize; in updatetreesplits_split()
277 (edge[in_nextedge]).split[Maxspc - ++((edge[in_nextedge]).downsize)] in updatetreesplits_split()
284 (edge[in_nextedge+1]).split[n] = permut[n]; in updatetreesplits_split()
286 (edge[in_nextedge+1]).upsize = in_nextleaf; in updatetreesplits_split()
290 (edge[in_nextedge+1]).downsize = 1; in updatetreesplits_split()
292 curredge = &(edge[in_nextedge]); in updatetreesplits_split()
303 in_nextedge, in_nextleaf); in updatetreesplits_split()
309 in_nextedge, in_nextleaf); in updatetreesplits_split()
331 nextedge=*in_nextedge; in addnextleaf_split()
[all …]
|
| H A D | recur-old.c | 273 (edge[in_nextedge]).upsize = (edge[dockedge]).upsize;
279 (edge[in_nextedge]).downsize = (edge[dockedge]).downsize;
282 (edge[in_nextedge]).split[Maxspc - ++((edge[in_nextedge]).downsize)]
289 (edge[in_nextedge+1]).split[n] = permut[n];
291 (edge[in_nextedge+1]).upsize = in_nextleaf;
295 (edge[in_nextedge+1]).downsize = 1;
297 curredge = &(edge[in_nextedge]);
308 in_nextedge, in_nextleaf);
314 in_nextedge, in_nextleaf);
337 nextedge=*in_nextedge; in addnextleaf_recur()
[all …]
|
| H A D | pstep-split.c | 187 int *in_nextedge, /* next free edge 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()
204 for (n=0; n<*in_nextedge; n++) { 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()
241 edge, Maxspc, Maxbrnch, edgeofleaf, in_nextedge, in_nextleaf); in updatesplit_split()
264 int *in_nextedge, /* next free edge idx */ in addnextleaf_split() argument
271 nextedge=*in_nextedge; in addnextleaf_split()
[all …]
|
| H A D | pstep.h | 292 int *in_nextedge, /* next free edge idx */
347 int *in_nextedge, /* next free edge idx */
|
| H A D | pstep-deglob.c | 128 int *in_nextedge, /* next free edge idx */ in addnextleaf_orig() argument
135 nextedge=*in_nextedge; in addnextleaf_orig()
266 *in_nextedge=nextedge; in addnextleaf_orig()
|
| H A D | pstep-mrca.c | 132 int *in_nextedge, /* next free edge idx */ in addnextleaf_orig() argument
139 nextedge=*in_nextedge; in addnextleaf_orig()
269 *in_nextedge=nextedge; in addnextleaf_orig()
|
| H A D | pstep-recursive.c | 132 int *in_nextedge, /* next free edge idx */ in addnextleaf_orig() argument
139 nextedge=*in_nextedge; in addnextleaf_orig()
269 *in_nextedge=nextedge; in addnextleaf_orig()
|
| H A D | pstep-trueID.c | 136 int *in_nextedge, /* next free edge idx */ in addnextleaf_orig() argument
143 nextedge=*in_nextedge; in addnextleaf_orig()
273 *in_nextedge=nextedge; in addnextleaf_orig()
|
| H A D | pstep.c | 318 int *in_nextedge, /* next free edge idx */ in addnextleaf_orig() argument
325 nextedge=*in_nextedge; in addnextleaf_orig()
376 *in_nextedge=nextedge; in addnextleaf_orig()
|