-
Notifications
You must be signed in to change notification settings - Fork 0
/
HuffmanDecoding.c
180 lines (162 loc) · 5.05 KB
/
HuffmanDecoding.c
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
// (*APOKWDIKOPOIHSH KWDIKWN Huffman*)
// filename : HuffmanDecoding;
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
typedef char BinTreeElementType; /*ÔÕÐÏÓ ÄÅÄÏÌÅÍÙÍ ÐÏÕ ÁÐÏÈÇÊÅÕÏÍÔÁÉ ÓÔÏÕò
ÊÏÌÂÏÕÓ ÔÏÕ ÄÅÍÄÑÏÕ Huffman */
typedef struct BinTreeNode *BinTreePointer;
struct BinTreeNode {
BinTreeElementType Data;
BinTreePointer LChild, RChild;
} ;
typedef enum {
FALSE, TRUE
} boolean;
void AddToTree(char ch, char code[10], int codelen, BinTreePointer *Root);
void BuildDecodingTree(BinTreePointer *Root, FILE *CodeFile);
void Decode(BinTreePointer Root, FILE* MessageFile);
void PrintTree(FILE *t, BinTreePointer Root, int indent);
main()
{
FILE *t, *CodeFile, *MessageFile;
BinTreePointer Root;
BuildDecodingTree(&Root, CodeFile);
t = fopen("HUFF.TXT", "w+");
if (t == NULL)
printf("Can't open HUFF.TXT\n");
else
{
PrintTree(t, Root, 8);
Decode(Root, MessageFile);
}
system("PAUSE");
}
void AddToTree(char ch, char code[10], int codelen, BinTreePointer *Root)
/* ÄÅ×ÅÔÁÉ: ÅÍÁ ×ÁÑÁÊÔÇÑÁ ch, ÅÍÁ string code, ÅÍÁ ÁÊÅÑÁÉÏ codelen (ÌÇÊÏÓ ÔÏÕ
string code) ÊÁÉ ÔÏ ÄÅÉÊÔÇ Root ÐÏÕ ÄÅÉ×ÍÅÉ ÔÇ ÑÉÆÁ ÔÏÕ ÄÅÍÄÑÏÕ Huffman
ËÅÉÔÏÕÑÃÉÁ: ÄÇÌÉÏÕÑÃÅÉ ÅÍÁÍ ÊÏÌÂÏ ÌÅ ÐÅÑÉÅ×ÏÌÅÍÏ ÔÏ ×ÁÑÁÊÔÇÑÁ ch
ÔÏÕ ÏÐÏÉÏÕ Ï ÊÙÄÉÊÏÓ ÅÉÍÁÉ code ÌÇÊÏÕÓ codelen ÊÁÉ ÔÏÍ
ÐÑÏÓÈÅÔÅÉ ÓÔÏ ÄÅÍÄÑÏ Huffman
ÅÐÉÓÔÑÅÖÅÉ: ÔÏ ÔÑÏÐÏÐÏÉÇÌÅÍÏ ÄÅÍÄÑÏ Huffman, ÐÏÕ ÄÅÉÊÔÏÄÏÔÅÉÔÁÉ ÁÐÏ ÔÏ ÄÅÉÊÔÇ Root
*/
{
int i;
BinTreePointer TempPtr,p;
i =0;
p =*Root;
while (i<codelen)
if (code[i]=='0')
{
if (p->LChild==NULL)
{
TempPtr = (BinTreePointer)malloc(sizeof (struct BinTreeNode));
TempPtr->Data='*';
TempPtr->LChild=NULL;
TempPtr->RChild=NULL;
p->LChild=TempPtr;
}
i=i+1;
p=p->LChild;
}
else
if (code[i]='1')
{
if (p->RChild==NULL)
{
TempPtr = (BinTreePointer)malloc(sizeof (struct BinTreeNode));
TempPtr->Data='*';
TempPtr->LChild=NULL;
TempPtr->RChild=NULL;
p->RChild=TempPtr;
}
i=i+1;
p=p->RChild;
}
p->Data=ch;
}
void BuildDecodingTree(BinTreePointer *Root, FILE *CodeFile)
/* ÄÅ×ÅÔÁÉ: ÔÏ ÁÑ×ÅÉÏ CodeFile
ËÅÉÔÏÕÑÃÈÁ: ÄÉÁÂÁÆÅÉ ÔÏÕÓ ×ÁÑÁÊÔÇÑÅÓ ÊÁÉ ÔÏÕÓ ÊÙÄÉÊÏÕÓ ÔÏÕÓ ÁÐÏ ÔÏ ÁÑ×ÅÉÏ
CodeFile ÊÁÉ ÊÁÔÁÓÊÅÕÁÆÅÉ ÔÏ ÄÅÍÄÑÏ Huffman.
ÅÐÉÓÔÑÅÖÅÉ: ÔÏ ÄÅÉÊÔÇ Root ÐÏÕ ÄÅÉ×ÍÅÉ ÓÔÇ ÑÉÆÁ ÔÏÕ ÄÅÍÄÑÏÕ Huffman.
*/
{
char ch,termch, blank;
char code[80];
int nscan;
(*Root) = (BinTreePointer)malloc(sizeof (struct BinTreeNode));
(*Root)->Data='*';
(*Root)->LChild=NULL;
(*Root)->RChild=NULL;
CodeFile = fopen("CODES.TXT", "r");
if (CodeFile == NULL)
printf("Can't open CODES.TXT\n");
else
{
while (TRUE)
{ "%15[^,], %2[^,], %d, %lf%c",
nscan = fscanf(CodeFile, "%c %10[^\n]%c",&ch, code,&termch);
if (nscan == EOF) break;
if (nscan != 3 || termch != '\n')
{
printf("Improper file format\n");
break;
}
else
AddToTree(ch, code, strlen(code), &(*Root));
}
}
}
void Decode(BinTreePointer Root, FILE* MessageFile)
/* ÄÝ÷åôáé: ¸íá äÝíôñï Huffman êáé ìéá áêïëïõèßá áðü bits ðïõ áíáðáñéóôÜ Ýíá ìÞíõìá,
ôï ïðïßï Ý÷åé êùäéêïðïçèåß ìå ÷ñÞóç ôïõ äÝíôñïõ Huffman.
Ëåéôïõñãßá: Áðïêùäéêïðïéåß ôï ìÞíõìá.
ÅðéóôñÝöåé: Ôï áðïêùäéêïðïéçìÝíï ìÞíõìá.*)
*/
{
char bit;
BinTreePointer p;
MessageFile = fopen("MESSAGES.TXT", "r");
if (MessageFile == NULL)
printf("Can't open MESSAGES.TXT\n");
else
{
while (bit != EOF)
{
p=Root;
while (p->LChild!=NULL || p->RChild!=NULL)
{
bit=fgetc(MessageFile);
if (bit != EOF)
{
printf("%c",bit);
if (bit=='0')
p=p->LChild;
else
if (bit=='1')
p=p->RChild;
else
if (bit!='\n')
printf("MH APODEKTO bit: \n", bit);
}
else break;
}
if (bit != EOF) printf("---%c\n",p->Data);
}
}
}
void PrintTree(FILE *t, BinTreePointer Root, int indent)
/* Ó×ÅÄÉÁÆÅÉ ÓÔÏ ÁÑ×ÅÉÏ HUFF.TXT ÔÏ ÄÅÍÄÑÏ Huffman
*/
{
int i;
if (Root!=NULL)
{
PrintTree(t, Root->RChild, indent+8);
for (i=1;i<=indent;i++) fprintf(t," ");
fprintf(t,"%c\n", Root->Data);
PrintTree(t, Root->LChild, indent+8);
}
}