-
Notifications
You must be signed in to change notification settings - Fork 0
/
decode_Huffman.cpp
173 lines (135 loc) · 4.22 KB
/
decode_Huffman.cpp
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
/*---------------------------------------------------------
* name : Make text uncompress with Huffman Algoritm(Decode)
* date : th,Dec,26,2019
* write by : Reza Tanaki zade
*---------------------------------------------------------*/
#include <iostream>
#include <string>
#include <sstream>
#include <bitset>
#include <fstream>
using namespace std;
//define functions that they are drfine at the end of file
string TextToBinaryString(string words);
int search(string A[4], string value);
//define bin_letter Global Variable
string bin_letter[4] = {"110","110","110","110"};
int main()
{
int flag;
//read .bin file
fstream myfile;
string binery_file,binery_file1;
myfile.open("../Huffman/Huffman.bin",ios::in | ios::binary);
myfile >> binery_file;
myfile.close();
binery_file1 = TextToBinaryString(binery_file);
cout << binery_file1 << endl;
cout << binery_file1.length() << endl;
//find the end of codec array 0,1
for (int i = binery_file1.length() -1; i >= 0; i--){
if(binery_file1[i] == '1'){
flag = i;
break;
}
}
cout << "flag: " << flag << endl;
int counter,num_counter = 0;
//find decode helper from binery
for(int i = 0; i < flag; i++){
num_counter = i;
int flag1 = 0;
if(binery_file1[i] == '0' && flag1 == 0){
i++;
if (binery_file1[i] == '0'){
bin_letter[counter] = "00";
counter++;
}
else if(binery_file1[i] == '1'){
bin_letter[counter] = "01";
counter++;
}flag1=1;}
if(binery_file1[i] == '1' && flag1 == 0){
i++;
if(binery_file1[i] == '0'){
bin_letter[counter] = "10";
counter++;
}else if(binery_file1[i] == '1'){
i++;
if(binery_file1[i] == '1'){
bin_letter[counter] = "111";
counter++;
}else if(binery_file1[i] == '0'){
bin_letter[counter] = "110";
counter++;
}}flag1=1;}
if(counter == 4){
break;
}
}
cout << bin_letter[0] << " "<< bin_letter[1] << " "<< bin_letter[2] << " "<< bin_letter[3] << " i " << num_counter <<endl;
//find number of decode helper
int n_bin_letter = 0;
int flag2 = 0;
int c = 0;
while (flag2 == 0)
{
if(flag2 == 0){
n_bin_letter += bin_letter[c].length();
c++;
}
if(c == 4){
flag2 = 1;
}
}
cout << "number of dec help 0,1: " << n_bin_letter << search(bin_letter,"01")<< endl ;
string text = "";
string letter[4] = {"a","b","c","d"};
//Decode all binery flie
for (int i = (n_bin_letter); i < flag; i++)
{
cout<< "i = " << i << endl;
int flag1 = 0;
if(binery_file1[i] == '0' && flag1 == 0){
i++;
if (binery_file1[i] == '0'){
text += letter[search(bin_letter,"00")];
}
else if(binery_file1[i] == '1'){
text += letter[search(bin_letter,"01")];
cout << "01" << endl;
}flag1=1;}
if(binery_file1[i] == '1' && flag1 == 0){
i++;
if(binery_file1[i] == '0'){
text += letter[search(bin_letter,"10")];
}else if(binery_file1[i] == '1'){
i++;
if(binery_file1[i] == '1'){
text += letter[search(bin_letter,"111")];
}else if(binery_file1[i] == '0'){
text += letter[search(bin_letter,"110")];
}}flag1=1;}
}
cout << text;
return 0;
}
//function : Text to Binary String
string TextToBinaryString(string words) {
string binaryString = "";
for (char& _char : words) {
binaryString +=bitset<8>(_char).to_string();
}
return binaryString;
}
//function : search in an array
int search(string A[4], string value)
{
int index = 0;
while (index < 4 && A[index] != value)
{
++index;
}
if (index < 4 && A[index] == value)
return index;
}