-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathbalance.cpp
More file actions
277 lines (228 loc) · 4.28 KB
/
Copy pathbalance.cpp
File metadata and controls
277 lines (228 loc) · 4.28 KB
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
#include "balance.h"
#include "wzip.h"
#include "errProcess.h"
#include "compress.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <memory.h>
int balanceTreeInit(balanceTree tree,bool *charMap){
if (!tree || !charMap)
{
return ERR_MEMORY;
}
int i;
for (i=0;i<CHAR_SET_SIZE;i++)
{
if (charMap[i])
{
tree->set[tree->setSiz]=i;
tree->setSiz++;
}
}
return 0;
}
int recurseCreate(balanceTree root){
int ret=0;
if (!root || root->setSiz==1)
{
return ERR_PARAMETER;
}
balNode_t *leftNode=(balNode_t*)malloc(sizeof(balNode_t));
if (!leftNode)
{
return ERR_MEMORY;
}
balNode_t *righNode=(balNode_t*)malloc(sizeof(balNode_t));
if (!righNode)
{
return ERR_MEMORY;
}
memset(leftNode,0,sizeof(balNode_t));
memset(righNode,0,sizeof(balNode_t));
leftNode->setSiz=root->setSiz/2;
righNode->setSiz=root->setSiz-leftNode->setSiz;
int i;
for (i=0;i<leftNode->setSiz;i++)
{
leftNode->set[i]=root->set[i];
}
for (i=0;i<righNode->setSiz;i++)
{
righNode->set[i]=root->set[i+root->setSiz/2];
}
root->leftChild=leftNode;
root->righChild=righNode;
if (leftNode->setSiz>1)
{
ret=recurseCreate(leftNode);
if (ret<0)
{
return ret;
}
}else{
leftNode->label=leftNode->set[0];
}
if (righNode->setSiz>1)
{
ret=recurseCreate(righNode);
if (ret<0)
{
return ret;
}
}else{
righNode->label=righNode->set[0];
}
return 0;
}
balanceTree createBalanceTree(uchar *buff, u32 len, Stream_t *streamPtr )
{
if (!buff ||!len || !streamPtr)
{
errProcess("craeteBalanceTree",ERR_PARAMETER);
return NULL;
}
int ret;
ret=getBlockDataInfo(buff,len,
streamPtr->charMap,
streamPtr->charFreq,
&streamPtr->setSize
);
if (ret<0)
{
errProcess("getBlockDataInfo",ret);
NULL;
}
balNode_t *root=(balNode_t*)
streamPtr->myAlloc(sizeof(balNode_t));
if (!root)
{
errProcess("myAlloc",ERR_MEMORY);
return NULL;
}
memset(root,0,sizeof(balNode_t));
ret=balanceTreeInit(root,streamPtr->charMap);
if (ret<0)
{
errProcess("balanceTreeInit",ret);
return NULL;
}
if (root->setSiz==1)
{
// single char set
root->label=root->set[0];
return root;
}
ret=recurseCreate(root);
if (ret<0)
{
errProcess("recurseCreate",ret);
return NULL;
}
return root;
}
int sigCharBalCode(balanceTree tree,char (*codeTable)[CODE_MAX_LEN])
{
if (!tree || !codeTable)
{
return ERR_PARAMETER;
}
if (!tree->leftChild || !tree->righChild)
{
return ERR_PARAMETER;
}
codeTable[tree->label][0]='0';
return 0;
}
int multiCharBalCode(balanceTree root,char (*codeTable)[CODE_MAX_LEN])
{
int ret;
if (!root || !codeTable)
{
return ERR_PARAMETER;
}
if (root->leftChild==NULL && root->righChild==NULL)
{
// tree is single char leaf
strcpy(codeTable[root->label],root->code);
return 0;
}
int codeLen=strlen(root->code);
strcpy(root->leftChild->code,root->code);
strcpy(root->righChild->code,root->code);
root->leftChild->code[codeLen]='0';
root->righChild->code[codeLen]='1';
ret=multiCharBalCode(root->leftChild,codeTable);
if (ret<0)
{
return ret;
}
ret=multiCharBalCode(root->righChild,codeTable);
if (ret<0)
{
return ret;
}
return 0;
}
int getBalanceTreeHeight(balanceTree root){
if (!root)
{
return ERR_PARAMETER;
}
if (root->leftChild==NULL && root->righChild==NULL)
{
return 0;
}
int leftHeight;
int righHeight;
leftHeight=righHeight=0;
if (root->leftChild)
{
leftHeight=getBalanceTreeHeight(root->leftChild);
}
if (root->righChild)
{
righHeight=getBalanceTreeHeight(root->righChild);
}
return (leftHeight>righHeight?leftHeight:righHeight)+1;
}
int generateBalCode(balanceTree tree,char (*codeTable)[CODE_MAX_LEN])
{
memset(codeTable,0,CHAR_SET_SIZE*CODE_MAX_LEN);
int ret;
if (!tree || !codeTable)
{
return ERR_MEMORY;
}
if (tree->leftChild==NULL && tree->righChild==NULL)
{
ret=sigCharBalCode(tree,codeTable);
}else
{
int height=getBalanceTreeHeight(tree);
if (height>=CODE_MAX_LEN || height<0)
{
return ERR_MEMORY;
}
ret=multiCharBalCode(tree,codeTable);
}
return ret;
}
int destroyBalTree(balanceTree tree){
if (!tree)
{
return 0;
}
if (tree->leftChild)
{
destroyBalTree(tree->leftChild);
tree->leftChild=NULL;
}
if (tree->righChild)
{
destroyBalTree(tree->righChild);
tree->righChild=NULL;
}
free(tree);
return 0;
}