-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFour_Way_Cache.java
More file actions
224 lines (165 loc) · 4.71 KB
/
Four_Way_Cache.java
File metadata and controls
224 lines (165 loc) · 4.71 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
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
public class Four_Way_Cache {
ArrayList<Huffman_Node> values;
File f=new File("code_table.txt");
FileWriter fw;
BufferedWriter bw;
HashMap<Integer,String> hmap=new HashMap();
Four_Way_Cache(ArrayList<Huffman_Node> values) throws IOException
{
this.values = new ArrayList(values);
//this.values=values;
fw=new FileWriter(f);
bw=new BufferedWriter(fw);
}
void Initialize()
{
for(int i1=(int) Math.floor((values.size()-1)/4)+2;i1>=3;i1--)
{ //System.out.println("i1 is "+i1);
heapify(i1);
}
}
void heapify(int i)
{
//System.out.println("heapify method");
int l1=4*(i-2);
int l2=4*(i-2)+1;
int l3=4*(i-2)+2;
int l4=4*(i-2)+3;
int smallest=i;
//System.out.println("i is "+i);
if(l1<values.size() && (values.get(l1).frequency < values.get(smallest).frequency))
{
smallest=l1;
}
if(l2<values.size() && (values.get(l2).frequency < values.get(smallest).frequency))
{
smallest=l2;
}
if(l3<values.size() && (values.get(l3).frequency < values.get(smallest).frequency))
{
smallest=l3;
}
if(l4<values.size() && (values.get(l4).frequency < values.get(smallest).frequency))
{
smallest=l4;
}
if(smallest!=i)
{
Huffman_Node temp=values.get(i);
values.set(i,values.get(smallest));
values.set(smallest,temp);
heapify(smallest);
}
}
void insert(Huffman_Node new_node)
{
//Huffman_Node temp=new Huffman_Node(new_node.data,new_node.frequency);
values.add(new_node);
int i=values.size()-1;
while(((i/4)+2)>=3 && values.get((i/4)+2).frequency>values.get(i).frequency)
{
Huffman_Node temp=values.get(i);
values.set(i,values.get((i/4)+2));
values.set((i/4)+2,temp);
i=(i/4)+2;
}
}
Huffman_Node removemin()
{
if(values.size() < 4)
{
System.out.println("error overflow");
}
//System.out.println("size is "+values.size());
Huffman_Node min=values.get(3);
values.set(3, values.get((values.size())-1));
//values.set((values.size())-1, null);
values.remove(values.size()-1);
heapify(3);
return min;
}
public void inOrder(Huffman_Node root,String s) throws IOException {
if((root.left==null) && (root.right==null))
{
bw.write(root.data+" "+s);
bw.newLine();
hmap.put(root.data,s);
return;
}
inOrder(root.left,s+'0');
inOrder(root.right,s+'1');
return;
}
public void generate_tree() throws IOException
{
while(values.size()!=4)
{
Huffman_Node temp1=removemin();
Huffman_Node temp2=removemin();
Huffman_Node new_node=new Huffman_Node(temp1.frequency+temp2.frequency,temp1,temp2);
insert(new_node);
}
inOrder(values.get(3), "");
bw.close();
fw.close();
System.out.println("key is "+values.get(3).data+" values is "+values.get(3).frequency);
}
/*
public static void main(String args[]) throws FileNotFoundException,IOException
{
Generate_Frequency obj=new Generate_Frequency();
System.out.println("args[0] is "+ args[0]);
obj.cal_frequency(args[0]);
long[] freq_table=obj.get_freq_table();
ArrayList<Huffman_Node> huffman_list=new ArrayList();
Four_Way_Cache heap=new Four_Way_Cache();
for(int i=0;i<freq_table.length;i++)
{
if(freq_table[i]!=0){
Huffman_Node node=new Huffman_Node(i,freq_table[i]);
//System.out.println("node val is "+node.frequency+"data is "+node.data
Four_Way_Cache.values.add(node);
}
}
long start_time=System.nanoTime();
heap.Initialize();
while(Four_Way_Cache.values.size()!=1)
{
Huffman_Node temp1=heap.removemin();
Huffman_Node temp2=heap.removemin();
Huffman_Node new_node=new Huffman_Node(temp1.frequency+temp2.frequency,temp1,temp2);
heap.insert(new_node);
}
System.out.println("elapsed time is"+(System.nanoTime()-start_time)*Math.pow(10, -6));
heap.inOrder(Four_Way_Cache.values.get(0),"");
FileReader fr=new FileReader(args[0]);
BufferedReader br=new BufferedReader(fr);
String input_data;
StringBuilder sb=new StringBuilder();
while((input_data=br.readLine())!=null)
{
sb.append(heap.hmap.get(Integer.parseInt(input_data)));
}
int start=0;
int end=0;
BufferedOutputStream w=new BufferedOutputStream(new FileOutputStream("E:/UF/ADS/encoded.bin"));
for(int i=0,len=sb.length();i<len;i+=8)
{
w.write((byte)Integer.parseInt(sb.substring(i, Math.min(i+8, len)),2));
}
w.close();
heap.bw.close();
heap.fw.close();
}*/
}