Searched refs:nBitsInALong (Results 1 – 8 of 8) sorted by relevance
56 nLongsNeeded = ((numSpecies - 1) / nBitsInALong) + 1; in AllocateBestChainVariables()258 nLongsNeeded = ((numSpecies -1) / nBitsInALong) + 1; in GetDepthMatrix()318 nLongsNeeded = ((numSpecies -1) / nBitsInALong) + 1; in GetMeanDist()381 …nLongsNeeded = ((numSpecies -1) / nBitsInALong) + 1; // number of longs needed in a bitfield r… in GetMinDepthMatrix()483 nLongsNeeded = ((numSpecies - 1) / nBitsInALong) + 1; in GetSpeciesTreeFromMinDepths()708 nLongsNeeded = (numSpecies - 1) / nBitsInALong + 1; in LineagesIn()966 nLongsNeeded = ((numSpecies -1) / nBitsInALong) + 1; in LnProposalProbSpeciesTree()1031 nLongsNeeded = (numSpecies - 1) / nBitsInALong + 1; in MapGeneTreeToSpeciesTree()
90 int nBitsInALong; /* number of bits in a BitsLong */ variable151 nBitsInALong = sizeof(BitsLong) * 8; in main()152 for (i=0; i<nBitsInALong; i++) in main()557 …nBitsInALong = sizeof(BitsLong) * 8; /* global variable: number of bits in a BitsLong … in InitializeMrBayes()
243 p += n / nBitsInALong; in Bit()244 x = bitsLongOne << (n % nBitsInALong); in Bit()259 bits += i / nBitsInALong; in ClearBit()261 x = bitsLongOne << (i % nBitsInALong); in ClearBit()516 p += n/nBitsInALong; in FlipOneBit()517 x = bitsLongOne << (n % nBitsInALong); in FlipOneBit()785 bits += i / nBitsInALong; in IsBitSet()1227 i = taxon / nBitsInALong; in NextTaxonInPartition()1229 for (j=taxon%nBitsInALong; j<nBitsInALong; j++) in NextTaxonInPartition()1240 for (j=0; j<nBitsInALong; j++) in NextTaxonInPartition()[all …]
1648 extern int nBitsInALong; /* number of bits in a BitsLong …
3428 …Needed)) || (r->x == 1 && (partition[r->index / nBitsInALong] & (bitsLongOne << (r->index % nBitsI… in ConTree()6456 sumtParams.BitsLongsNeeded = ((numLocalTaxa-1) / nBitsInALong) + 1; in DoSumtTree()8277 y = p[i / nBitsInALong]; in ShowParts()8278 x = bitsLongOne << (i % nBitsInALong); in ShowParts()8296 y = p[i / nBitsInALong]; in ShowSomeParts()8297 x = bitsLongOne << (i % nBitsInALong); in ShowSomeParts()
11828 nLongsNeeded = (numLocalTaxa - 1) / nBitsInALong + 1; in PruneConstraintPartitions()11913 nLongsNeeded = (numTaxa - 1) / nBitsInALong + 1; in DoesTreeSatisfyConstraints()15124 nLongsNeeded = ((numLocalTaxa - 1) / nBitsInALong) + 1; in LargestMovableSubtree()15257 nLongsNeeded = ((numLocalTaxa - 1) / nBitsInALong) + 1; in NumInformativeHardConstraints()20036 nLongsNeeded = 1 + (pt->nNodes - pt->nIntNodes - 1) / nBitsInALong; in SetPopSizeParam()20089 nLongsNeeded = 1 + (numLocalTaxa - 1) / nBitsInALong; in SetRelaxedClockParam()
1583 inHMM = (BitsLong *) SafeCalloc (((param->nRelParts/nBitsInALong) + 1), sizeof(BitsLong)); in CalcLikeAdgamma()2151 nLongsNeeded = (int)((nTaxa - 1) / nBitsInALong) + 1; in CopyTrees()6920 m->nParsIntsPerSite = 1 + m->numStates / nBitsInALong; in InitParsSets()18537 nLongsNeeded = 1 + (numLocalTaxa - 1) / nBitsInALong; in SetUpPartitionCounters()
10203 k = NumBits (definedConstraint[i], numTaxa/nBitsInALong + 1); in GetUserHelp()10207 k = NumBits (definedConstraintTwo[i], numTaxa/nBitsInALong + 1); in GetUserHelp()