Lines Matching refs:qNumber

319         qNumber = (size_t)ti[index + 1],  in newviewParsimonyIterativeFast()  local
343 … left[k] = &(pr->partitionData[model]->parsVect[(width * 2 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
385 … left[k] = &(pr->partitionData[model]->parsVect[(width * 4 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
439 … left[k] = &(pr->partitionData[model]->parsVect[(width * 20 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
484 … left[k] = &(pr->partitionData[model]->parsVect[(width * states * qNumber) + width * k]); in newviewParsimonyIterativeFast()
520 …imonyScore[pNumber] = totalScore + tr->parsimonyScore[rNumber] + tr->parsimonyScore[qNumber]; in newviewParsimonyIterativeFast()
533 qNumber = (size_t)tr->ti[2]; in evaluateParsimonyIterativeFast() local
545 sum = tr->parsimonyScore[pNumber] + tr->parsimonyScore[qNumber]; in evaluateParsimonyIterativeFast()
565 … left[k] = &(pr->partitionData[model]->parsVect[(width * 2 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
593 … left[k] = &(pr->partitionData[model]->parsVect[(width * 4 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
623 … left[k] = &(pr->partitionData[model]->parsVect[(width * 20 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
661 … left[k] = &(pr->partitionData[model]->parsVect[(width * states * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
711 qNumber = (size_t)ti[index + 1], in newviewParsimonyIterativeFast() local
742 … left[k] = &(pr->partitionData[model]->parsVect[(width * 2 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
773 … left[k] = &(pr->partitionData[model]->parsVect[(width * 4 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
826 … left[k] = &(pr->partitionData[model]->parsVect[(width * 20 * qNumber) + width * k]); in newviewParsimonyIterativeFast()
869 … left[k] = &(pr->partitionData[model]->parsVect[(width * states * qNumber) + width * k]); in newviewParsimonyIterativeFast()
896 …imonyScore[pNumber] = totalScore + tr->parsimonyScore[rNumber] + tr->parsimonyScore[qNumber]; in newviewParsimonyIterativeFast()
905 qNumber = (size_t)tr->ti[2]; in evaluateParsimonyIterativeFast() local
917 sum = tr->parsimonyScore[pNumber] + tr->parsimonyScore[qNumber]; in evaluateParsimonyIterativeFast()
940 … left[k] = &(pr->partitionData[model]->parsVect[(width * 2 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
971 … left[k] = &(pr->partitionData[model]->parsVect[(width * 4 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
1001 … left[k] = &(pr->partitionData[model]->parsVect[(width * 20 * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
1036 … left[k] = &(pr->partitionData[model]->parsVect[(width * states * qNumber) + width * k]); in evaluateParsimonyIterativeFast()
1186 qNumber = tr->constraintVector[q->number], in testInsertParsimony() local
1197 if(qNumber == -9) in testInsertParsimony()
1198 qNumber = checkerPars(tr, q); in testInsertParsimony()
1203 if(pNumber == rNumber || pNumber == qNumber) in testInsertParsimony()