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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#define POOL_CAP 512
typedef struct node {
bool is_char;
char ch;
size_t references;
int direction; // 0 - left; 1 - right
struct node *parent;
} node_t;
// void liner_insert(void base[.size * .nmemb + 1],
// size_t nmemb, size_t size, void *el,
// int (*compar)(const void [.size], const void [.size]));
void liner_insert(void *base, size_t nmemb, size_t size, void *el, int (*compar)(const void *, const void *));
int compare_nodes(const void *p1, const void *p2);
void node_char_init(node_t *node, size_t ref, char ch);
void node_link_init(node_t *node, node_t* left, node_t* right);
void node_print(node_t *node, int indent);
node_t pool[POOL_CAP];
size_t pool_sz;
node_t *encoding_table[256];
int main(int argc, char **argv)
{
if(argc != 2) {
fprintf(stderr, "ERROR: Not enough command line arguments\n");
exit(1);
}
//-------------------------------------------------//
pool_sz = 0;
for(int i = 0; i < 256; i++)
encoding_table[i] = NULL;
//-------------------------------------------------//
// Load the file data
int times_seen[256] = {0};
FILE *fp = fopen(argv[1], "rb");
if(!fp) {
fprintf(stderr, "ERROR: Could not open file %s\n", argv[1]);
exit(1);
}
char mem[1024];
size_t sz;
while((sz = fread(mem, sizeof(char), 1024, fp)) != 0)
{
for(size_t i = 0; i < sz; i++) {
times_seen[(size_t)mem[i]]++;
}
memset(mem, '\0', sizeof(char) * 1024);
}
rewind(fp);
//-------------------------------------------------//
// Load everything into nodes array and sort
node_t *nodes[256];
size_t nodes_sz = 0;
for(int i = 0; i < 256; i++) {
if(times_seen[i] <= 0) {
continue;
}
nodes[nodes_sz] = malloc(sizeof(node_t));
node_char_init(nodes[nodes_sz], times_seen[i], (char)i);
encoding_table[i] = nodes[nodes_sz];
nodes_sz++;
}
qsort(nodes, nodes_sz, sizeof(node_t *), compare_nodes);
//-------------------------------------------------//
// Continuously sort and build the tree
while(nodes_sz != 1)
{
nodes_sz--;
node_link_init(&pool[pool_sz], nodes[nodes_sz], nodes[nodes_sz-1]);
liner_insert(nodes, nodes_sz-1, sizeof(node_t *), &pool[pool_sz++], compare_nodes);
for(size_t i = 0; i < nodes_sz; i++)
node_print(nodes[i], 0);
}
//-------------------------------------------------//
for(int i = 0; i < 256; i++)
if(encoding_table[i] != NULL) free(encoding_table[i]);
fclose(fp);
return 0;
}
void liner_insert(void *base, size_t nmemb, size_t size, void *el, int (*compar)(const void *, const void *))
{
for(size_t i = 0; i < nmemb; i++)
{
void *cur = base + (i * size);
if(compar(cur, &el) < 0) continue;
for(size_t j = nmemb; j >= i; j--) {
void *src = base + (j * size);
void *dest = src + size;
memcpy(dest, src, size);
}
memcpy(cur, &el, size);
break;
}
}
int compare_nodes(const void *p1, const void *p2)
{
// printf("ff\t%d %d\n", (*(node_t **)p2)->references, (*(node_t **)p1)->references);
return (*(node_t **)p2)->references - (*(node_t **)p1)->references;
}
void node_char_init(node_t *node, size_t ref, char ch)
{
node->is_char = true;
node->ch = ch;
node->references = ref;
node->parent = NULL;
}
void node_link_init(node_t *node, node_t* left, node_t* right)
{
node->is_char = false;
node->references = left->references + right->references;
node->parent = NULL;
left->parent = node;
right->parent = node;
left->direction = 0;
right->direction = 1;
}
void node_print(node_t *node, int indent)
{
for(int i = 0; i < indent; i++) printf(" ");
printf("ref: %ld\n", node->references);
if(node->is_char) {
for(int i = 0; i < indent; i++) printf(" ");
printf("char: %c\n", node->ch);
} else {
for(int i = 0; i < indent; i++) printf(" ");
printf("link thing\n");
}
if(node->parent != NULL) {
for(int i = 0; i < indent; i++) printf(" ");
printf("dir: %d\n", node->direction); node_print(node->parent, indent + 4);
}
}
|
