1 | |
---|
2 | #define OVER 7 |
---|
3 | #define ADJACENT_PAIRS 1 |
---|
4 | #define CORR_IN_1_AND_2 2 |
---|
5 | #define ALL_IN_1_AND_2 3 |
---|
6 | #define NO_PAIRING 4 |
---|
7 | #define ALL_IN_FIRST 5 |
---|
8 | #define TREE1 8 |
---|
9 | #define TREE2 9 |
---|
10 | |
---|
11 | #define FULL_MATRIX 11 |
---|
12 | #define VERBOSE 22 |
---|
13 | #define SPARSE 33 |
---|
14 | |
---|
15 | #define maxtrees 1000 |
---|
16 | |
---|
17 | /* Number of columns per block in a matrix output */ |
---|
18 | #define COLUMNS_PER_BLOCK 10 |
---|
19 | |
---|
20 | |
---|
21 | typedef struct pattern_elm { |
---|
22 | group_type *apattern; |
---|
23 | long *patternsize; |
---|
24 | } pattern_elm; |
---|
25 | |
---|
26 | #ifndef OLDC |
---|
27 | /* function prototypes */ |
---|
28 | void initconsnode(node **, node **, node *, long, long, long *, long *, |
---|
29 | initops, pointarray, pointarray, Char *, Char *, FILE *); |
---|
30 | void compress(long *); |
---|
31 | void sort(long); |
---|
32 | void eliminate(long *, long *); |
---|
33 | void printset(long); |
---|
34 | void bigsubset(group_type *, long); |
---|
35 | void recontraverse(node **, group_type *, long, long *); |
---|
36 | void reconstruct(long); |
---|
37 | void coordinates(node *, long *); |
---|
38 | void drawline(long i); |
---|
39 | |
---|
40 | void printree(void); |
---|
41 | void consensus(void); |
---|
42 | void rehash(void); |
---|
43 | void enternodeset(node *); |
---|
44 | void enterset(group_type *); |
---|
45 | void accumulate(node *); |
---|
46 | void dupname2(Char *, node *, node *); |
---|
47 | void dupname(node *); |
---|
48 | void gdispose(node *); |
---|
49 | void initreenode(node *); |
---|
50 | void reroot(node *, long *); |
---|
51 | |
---|
52 | void store_pattern (pattern_elm ***, double *, int); |
---|
53 | boolean samename(naym, plotstring); |
---|
54 | void reordertips(void); |
---|
55 | void read_groups (pattern_elm ****, double *, long *, FILE *); |
---|
56 | /* function prototypes */ |
---|
57 | #endif |
---|