Searched refs:iSeqUnique (Results 1 – 1 of 1) sorted by relevance
| /dports/biology/fasttree/FastTree-2.1.10_5/ |
| H A D | FastTree-2.1.10.c | 3225 int iSeqUnique = unique->alnToUniq[iSeqNonunique]; in ReadTreeMaybeAddLeaf() local
3226 assert(iSeqUnique >= 0 && iSeqUnique < unique->nUnique); in ReadTreeMaybeAddLeaf()
3228 if (parents[iSeqUnique] < 0) { in ReadTreeMaybeAddLeaf()
3229 ReadTreeAddChild(parent, iSeqUnique, /*IN/OUT*/parents, /*IN/OUT*/children); in ReadTreeMaybeAddLeaf()
3231 fprintf(stderr, "Found leaf uniq%d name %s child of %d\n", iSeqUnique, name, parent); in ReadTreeMaybeAddLeaf()
3234 fprintf(stderr, "Skipped redundant leaf uniq%d name %s\n", iSeqUnique, name); in ReadTreeMaybeAddLeaf()
3903 int iSeqUnique = unique->alnToUniq[iSeqNonunique]; in AlnToConstraints() local
3904 assert(iSeqUnique >= 0 && iSeqUnique < unique->nUnique); in AlnToConstraints()
3905 if (uniqConstraints[iSeqUnique] != NULL) { in AlnToConstraints()
3908 if (strcmp(uniqConstraints[iSeqUnique],constraintSeq) != 0) { in AlnToConstraints()
[all …]
|