File: SplitClusterEven.h

package info (click to toggle)
ampliconnoise 1.29-16
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 6,316 kB
  • sloc: ansic: 18,085; sh: 2,901; perl: 2,089; makefile: 240
file content (119 lines) | stat: -rw-r--r-- 2,285 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
typedef struct s_Node
{
  struct s_Node *ptLeft;
  double dLeft;


  struct s_Node *ptRight;
  double dRight;

  int nId;

  double dDepth;

  //struct s_Node *ptUp;

  int nR;

  int nN;

  int nLeaves;

  int *anLeaves;
  
} t_Node;

typedef struct s_Params
{
  char* szDatFile;

  char* szTreeFile;

  char* szMapFile;

  int nSplit;

  int nMinSize;
} t_Params;


typedef struct s_Map
{
  int nU;

  int *anNM;

  int **aanMap;

} t_Map;

typedef struct s_Data
{
  char **aszLines;
  
  int nN;

  int nM;
  
} t_Data;

/* Input Definitions */
#define OPTION  0      /* optional */
#define ALWAYS  1      /* required */

#define MAP_FILE                "-min"
#define TREE_FILE               "-tin"
#define SPLIT                   "-s"
#define DAT_FILE                "-din"
#define MIN_SIZE                "-m"

#define LIST_SUFFIX             ".list"
#define TREE_SUFFIX             ".tree"
#define DAT_SUFFIX              ".dat"

#define INTERNAL        -1
#define MAX_WORD_LENGTH 1024
#define MAX_LINE_LENGTH 1000000
#define MAX_SPLIT       10000
#define DELIM           " "
#define BIG_LINE_LENGTH 400000000
#define DELIM2          ",:"


void getCommandLineParams(t_Params *ptParams,int argc,char *argv[]);

char addElement(t_Node** pptTree, FILE* ifp);

void writeTree(t_Node *ptTree, FILE* ofp);

void treeSplit(t_Node* ptTree, double* pdDepth, double dSplit, t_Node **aptSplit,int* pnSplit);

double maxDepth(t_Node* ptTree, double* pdMaxDepth);

void writeIndices(t_Node* ptTree, FILE* ofp);

void countLeaves(t_Node* ptTree, int *pnLeaves);

void getLeaves(t_Node* ptTree, int* anIDs, int *pnLeaves);

void getLeavesR(t_Node* ptTree, int* anIDs, int *pnLeaves);

int compNode(const void *pvA, const void* pvB);

void readData(t_Data *ptData, char* szDatFile);

void writeData(FILE* ofp, t_Data *ptData, int nEntries, int *anEntries, t_Map *ptMap);

void renumberLeaves(t_Node* ptTree, int* pnCount);

void writeList(FILE* ofp, t_Node *ptTree, double dMaxSplit);

void readMapFile(t_Map *ptMap, char *szMapFile);

//void treeSplit(t_Node* ptTree, double dDepth, double dSplit, t_Node **aptSplit, int Split);

void setLeaves(t_Node* ptTree);

void treeSplitEven(t_Node* ptTree, int nSplit, t_Node **aptSplit,int* pnSplit);

double setDepth(t_Node* ptTree, double dDepth);