Home
last modified time | relevance | path

Searched refs:tmpedgeofleaf (Results 1 – 10 of 10) sorted by relevance

/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dpstep.c238 int *tmpedgeofleaf; in inittree_orig() local
250 for (j = 0; j < Maxspc; j++) tmpedgeofleaf[j]=-1; in inittree_orig()
251 *edgeofleaf = tmpedgeofleaf; in inittree_orig()
301 tmpedgeofleaf[trueID[0]] = 0; in inittree_orig()
302 tmpedgeofleaf[trueID[1]] = 1; in inittree_orig()
303 tmpedgeofleaf[trueID[2]] = 2; in inittree_orig()
767 onepstep_orig(&tmpedgeset, &tmpedgeofleaf, in allpstep()
773 onepstep_split(&tmpedgeset, &tmpedgeofleaf, in allpstep()
779 onepstep_recur(&tmpedgeset, &tmpedgeofleaf, in allpstep()
785 onepstep_mrca(&tmpedgeset, &tmpedgeofleaf, in allpstep()
[all …]
H A Dpstep-mrca.c69 int *tmpedgeofleaf; in inittree_orig() local
79 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_orig()
80 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_orig()
81 *edgeofleaf = tmpedgeofleaf; in inittree_orig()
120 tmpedgeofleaf[0] = 0; in inittree_orig()
121 tmpedgeofleaf[1] = 1; in inittree_orig()
122 tmpedgeofleaf[2] = 2; in inittree_orig()
576 computebiparts(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
584 computebiparts(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
611 copytree(ctree, trueIDtmp, tmpedgeset, tmpedgeofleaf, Maxspc); in allpstep()
[all …]
H A Dpstep-recursive.c69 int *tmpedgeofleaf; in inittree_orig() local
79 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_orig()
80 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_orig()
81 *edgeofleaf = tmpedgeofleaf; in inittree_orig()
120 tmpedgeofleaf[0] = 0; in inittree_orig()
121 tmpedgeofleaf[1] = 1; in inittree_orig()
122 tmpedgeofleaf[2] = 2; in inittree_orig()
576 computebiparts(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
584 computebiparts(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
611 copytree(ctree, trueIDtmp, tmpedgeset, tmpedgeofleaf, Maxspc); in allpstep()
[all …]
H A Dpstep-trueID.c73 int *tmpedgeofleaf; in inittree_orig() local
83 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_orig()
84 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_orig()
85 *edgeofleaf = tmpedgeofleaf; in inittree_orig()
124 tmpedgeofleaf[0] = 0; in inittree_orig()
125 tmpedgeofleaf[1] = 1; in inittree_orig()
126 tmpedgeofleaf[2] = 2; in inittree_orig()
545 int *tmpedgeofleaf; /* array of extern edge pointers */ in allpstep() local
596 computebiparts_trueID(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
605 computebiparts_trueID(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep()
[all …]
H A Dsplit.c31 int *tmpedgeofleaf; in inittree_split() local
41 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_split()
42 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_split()
43 for (j = 0; j < Maxspc; j++) tmpedgeofleaf[j]=-1; in inittree_split()
44 *edgeofleaf = tmpedgeofleaf; in inittree_split()
104 tmpedgeofleaf[trueID[0]] = 0; in inittree_split()
105 tmpedgeofleaf[trueID[1]] = 1; in inittree_split()
106 tmpedgeofleaf[trueID[2]] = 2; in inittree_split()
475 int *tmpedgeofleaf; /* array of extern edge ptrs */ in onepstep_split() local
487 …inittree_split(&tmpedge, &tmpedgeofleaf, &tmprootleaf, Maxspc, Maxbrnch, &nextedge, &nextleaf, per… in onepstep_split()
[all …]
H A Dpstep-split.c91 int *tmpedgeofleaf; in inittree_split() local
101 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_split()
102 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_split()
103 *edgeofleaf = tmpedgeofleaf; in inittree_split()
173 tmpedgeofleaf[0] = 0; in inittree_split()
174 tmpedgeofleaf[1] = 1; in inittree_split()
175 tmpedgeofleaf[2] = 2; in inittree_split()
674 int *tmpedgeofleaf; /* array of extern edge pointers */ in allpstep_split() local
724 computebiparts_trueID(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep_split()
732 computebiparts_trueID(tmpedgeset, tmpedgeofleaf, trueIDtmp, in allpstep_split()
[all …]
H A Dpstep-deglob.c66 int *tmpedgeofleaf; in inittree_orig() local
76 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_orig()
77 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_orig()
78 *edgeofleaf = tmpedgeofleaf; in inittree_orig()
117 tmpedgeofleaf[0] = 0; in inittree_orig()
118 tmpedgeofleaf[1] = 1; in inittree_orig()
119 tmpedgeofleaf[2] = 2; in inittree_orig()
H A Dmrca.c32 int *tmpedgeofleaf; in inittree_mrca() local
42 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_mrca()
43 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_mrca()
44 for (j = 0; j < Maxspc; j++) tmpedgeofleaf[j]=-1; in inittree_mrca()
45 *edgeofleaf = tmpedgeofleaf; in inittree_mrca()
117 tmpedgeofleaf[trueID[0]] = 0; in inittree_mrca()
118 tmpedgeofleaf[trueID[1]] = 1; in inittree_mrca()
119 tmpedgeofleaf[trueID[2]] = 2; in inittree_mrca()
770 int *tmpedgeofleaf; /* array of extern edge ptrs */ in onepstep_mrca() local
868 computepenaltiestree_mrca(tmpedge, tmpedgeofleaf, tmprootleaf, in onepstep_mrca()
[all …]
H A Drecur.c31 int *tmpedgeofleaf; in inittree_recur() local
41 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_recur()
42 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_recur()
43 for (j = 0; j < Maxspc; j++) tmpedgeofleaf[j]=-1; in inittree_recur()
44 *edgeofleaf = tmpedgeofleaf; in inittree_recur()
95 tmpedgeofleaf[trueID[0]] = 0; in inittree_recur()
96 tmpedgeofleaf[trueID[1]] = 1; in inittree_recur()
97 tmpedgeofleaf[trueID[2]] = 2; in inittree_recur()
777 int *tmpedgeofleaf; /* array of extern edge ptrs */ in onepstep_recur() local
856 computepenaltiestree_recur(tmpedge, tmpedgeofleaf, tmprootleaf, in onepstep_recur()
[all …]
H A Drecur-old.c31 int *tmpedgeofleaf; in inittree_recur() local
41 tmpedgeofleaf = (int *) calloc((size_t) Maxspc, sizeof(int) ); in inittree_recur()
42 if (tmpedgeofleaf == NULL) maerror("edgeofleaf in inittree"); in inittree_recur()
43 for (j = 0; j < Maxspc; j++) tmpedgeofleaf[j]=-1; in inittree_recur()
44 *edgeofleaf = tmpedgeofleaf; in inittree_recur()
108 tmpedgeofleaf[trueID[0]] = 0; in inittree_recur()
109 tmpedgeofleaf[trueID[1]] = 1; in inittree_recur()
110 tmpedgeofleaf[trueID[2]] = 2; in inittree_recur()
735 int *tmpedgeofleaf; /* array of extern edge ptrs */ in onepstep_recur() local
852 computepenaltiestree_recur(tmpedge, tmpedgeofleaf, tmprootleaf, in onepstep_recur()
[all …]