Legofit
infers population history from nucleotide site patterns.
Data Structures
Here are the data structures with brief descriptions:
[detail level 12]
 Naxt2raf
 CAlignment
 CBootContains the all data involved in a moving blocks bootstrap
 CBounds
 CBranchTab
 CCombDat
 CCostParParameters of cost function–that which is minimized
 CDAFReader
 CDiffEvPar
 CElA single key-value pair, with a pointer to the next one
 CEventLstThis structure handles bookkeeping associated with events of two types: (1) partitions of the set of descendants into a set of ancestors, and (2) migration events
 CGene
 CGPTreeGPTree stands for Gene-Population tree
 CHash
 CHessian
 CIdSet
 CIdSetSetThe hash table
 CItem
 CJobA single job in the queue
 CJobQueueAll data used by job queue
 CLblNdx
 CLblNdxBranchTab
 CLineReader
 CLongVec
 CMapping
 CMatCoal
 CMCdat
 CMCTreeMCTree stands for Gene-Population tree
 CMigDat
 CModPar
 CModSelCrit
 CMpfrMatCoal
 CMSSample
 CNameList
 CNetwork
 CParam
 CParNameLst
 CParStore
 CPoint
 CPointBuff
 CPopNode
 CPtrLst
 CPtrLstElA linked list of pointers
 CPtrPair
 CPtrQueue
 CPtrVec
 CRAFReader
 CRational
 CSampNdx
 CScrmReader
 CSegment
 CSetPartDat
 CSILinkA single element of a linked list
 CSimReader
 CSimSchedHolds a linked list of Stages and a mutex lock
 CStackTreat a vector of tipId_t values as a push-down stack
 CStageA single stage in the optimization process
 CState
 Cstate
 CStrDbl
 CStrDblMapThe hash table
 CStrDblQueue
 CStrIntHash table
 CStrPtrMapThe hash table
 CStrStrMapThe hash table
 CTaskArg
 Cte_expr
 Cte_variable
 CThreadArgData structure used by each thread
 CThreadData
 CToken
 CTokenizer
 CUINTqueue