Legofit
infers population history from nucleotide site patterns.
typedefs.h
1#ifndef HAVE_TYPEDEFS
2# define HAVE_TYPEDEFS
3
4#include <stdint.h>
5#define FILENAMESIZE 200
6
7typedef struct AddrParMap AddrParMap;
8typedef struct Boot Boot;
9typedef struct BootChr BootChr;
10typedef struct Bounds Bounds;
11typedef struct BranchTab BranchTab;
12typedef struct Constraint Constraint;
13typedef struct EventLst EventLst;
14typedef struct Gene Gene;
15typedef struct GPTree GPTree;
16typedef struct HashTab HashTab;
17typedef struct HashTabSeq HashTabSeq;
18typedef struct History History;
19typedef struct IdSet IdSet;
20typedef struct IdSetSet IdSetSet;
21typedef struct LblNdx LblNdx;
22typedef struct LineReader LineReader;
23typedef struct LongVec LongVec;
24typedef struct MCTree MCTree;
25typedef struct NameList NameList;
26typedef struct Network Network;
27typedef struct Param Param;
28typedef struct ParStore ParStore;
29typedef struct Point Point;
30typedef struct PointBuff PointBuff;
31typedef struct PopNode PopNode;
32typedef struct PtrPair PtrPair;
33typedef struct PtrPtrMap PtrPtrMap;
34typedef struct PtrU32Map PtrU32Map;
35typedef struct PtrLst PtrLst;
36typedef struct PtrQueue PtrQueue;
37typedef struct PtrVec PtrVec;
38typedef struct ScrmReader ScrmReader;
39typedef struct Segment Segment;
40typedef struct SimReader SimReader;
41typedef struct SimSched SimSched;
42typedef struct SampNdx SampNdx;
43typedef struct SplitLst SplitLst;
44typedef struct State State;
45typedef struct Stirling2 Stirling2;
46typedef struct StrDblQueue StrDblQueue;
47typedef struct StrDblMap StrDblMap;
48typedef struct StrStrMap StrStrMap;
49typedef struct StrInt StrInt;
50typedef struct StrParMap StrParMap;
51typedef struct StrPtrMap StrPtrMap;
52typedef struct Tokenizer Tokenizer;
53typedef struct UINTqueue UINTqueue;
54typedef struct U64U64Map U64U64Map;
55typedef struct U64I64Map U64I64Map;
56typedef struct DAFReader DAFReader;
57typedef struct RAFReader RAFReader;
58
59// For returning a pair of pointers
60struct PtrPair {
61 void *a, *b;
62};
63
64#if 1
65# define TIPID_SIZE 32
66typedef uint32_t tipId_t;
67#else
68# define TIPID_SIZE 64
69typedef uint64_t tipId_t;
70#endif
71
72#define KL_COST 1
73#define LNL_COST 2
74#define COST KL_COST
75
76#define FREE 1
77#define FIXED 2
78#define CONSTRAINED 4
79#define TWON 8
80#define TIME 16
81#define MIXFRAC 32
82#define ARBITRARY 64
83
84#define POPNAMESIZE 30
85#define MAXSAMP ((int)(8*sizeof(tipId_t)))
86
87// silence compiler warning about unused function parameter
88#define UNUSED(x) (void)(x)
89
90enum NetworkType { STOCHASTIC, DETERMINISTIC };
91
92#endif
Contains the all data involved in a moving blocks bootstrap.
Definition: boot.c:34
Definition: parstore.h:10
Definition: branchtab.c:20
Definition: dafreader.h:9
This structure handles bookkeeping associated with events of two types: (1) partitions of the set of ...
Definition: eventlst.h:33
GPTree stands for Gene-Population tree.
Definition: gptree.c:34
Definition: gene.h:7
Definition: idset.c:24
The hash table.
Definition: idsetset.c:53
Definition: lblndx.h:8
Definition: linereader.c:8
Definition: longvec.c:17
MCTree stands for Gene-Population tree.
Definition: mctree.c:33
Definition: state.c:52
Definition: network.c:29
Definition: parstore.c:42
Definition: param.h:12
Definition: pointbuff.c:23
Definition: pointbuff.c:18
Definition: popnode.c:40
Definition: ptrlst.c:16
Definition: typedefs.h:60
Definition: ptrqueue.c:23
Definition: ptrvec.h:7
Definition: rafreader.h:11
Definition: sampndx.h:8
Definition: scrmreader.c:17
Definition: segment.c:79
Definition: simreader.c:57
Holds a linked list of Stages and a mutex lock.
Definition: simsched.c:37
Definition: state.c:57
The hash table.
Definition: strdblmap.c:33
Definition: strdblqueue.h:22
Hash table.
Definition: strint.c:35
The hash table.
Definition: strptrmap.c:38
The hash table.
Definition: strstrmap.c:33
Definition: tokenizer.h:28
Definition: uintqueue.c:11