update huffman

Author: benaich

HuffmanCode/BitInputStream.java Huffman/BitInputStream.javaHuffmanCode/BitInputStream.java renamed to Huffman/BitInputStream.java

@@ -1,8 +1,9 @@
-package HuffmanCode;
+package Huffman;
 
 import java.io.IOException;
 import java.io.InputStream;
 
+/* BitInputStream using decorator pattern */
 public final class BitInputStream {
 	private InputStream input;
 	private int nextBits;

HuffmanCode/BitOutputStream.java Huffman/BitOutputStream.javaHuffmanCode/BitOutputStream.java renamed to Huffman/BitOutputStream.java

@@ -1,8 +1,9 @@
-package HuffmanCode;
+package Huffman;
 
 import java.io.IOException;
 import java.io.OutputStream;
 
+/* BitOutputStream using decorator pattern */
 public final class BitOutputStream {
 
     private OutputStream output;

HuffmanCode/Data/code Huffman/Data/codeHuffmanCode/Data/code renamed to Huffman/Data/code

@@ -1,27 +1,136 @@
 package Huffman;
 
-import List.ListModule;
-import List.ListModule.List;
+import Heap.LeftistModule;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.io.FileReader;
+import java.io.FileWriter;
+import java.io.IOException;
 
-public class Huffman {
+public class Huffman{
+
+    int[] occ = new int[256];
+    Node aC;
+    LeftistModule.Leftist<Node> tas = LeftistModule.emptyLeftist();
+    String[] code = new String[256];
+
+    public void encodeMessage(File in, File out) {
+        countFrequency(in);
+        buildLeftist();
+        buildCodeTree();
+        generateCodes();
+
+        try {
+            FileReader fr = new FileReader(in);
+            BitOutputStream fw = new BitOutputStream(new FileOutputStream(out));
+            int lu;
+            while ((lu = fr.read()) != -1) {
+                fw.write(code[lu]);
+            }
+            serializeTree();
+            fw.close();
+            fr.close();
+        } catch (IOException e) {
+        }
+    }
+
+    public void decodeMessage(File in, File out) {
+        deserializeTree();
+        try {
+            BitInputStream fr = new BitInputStream(new FileInputStream(in));
+            FileWriter fw = new FileWriter(out, true);
+            int lu, count = aC.p.fr;
+            Node tmp = aC;
+            while ((lu = fr.read()) != -1 && count > 0) {
+                if (tmp.isLeaf()) {
+                    fw.append((char) tmp.p.car);
+                    count--;
+                    tmp = aC;
+                }
+
+                if (lu == 0) {
+                    tmp = tmp.left;
+                } else {
+                    tmp = tmp.right;
+                }
+
+            }
+
+            fw.close();
+            fr.close();
+        } catch (Exception ex) {
+
+        }
+    }
+
+    public void countFrequency(File in) {
+        try {
+            FileReader fr = new FileReader(in);
+            int lu;
+            while (-1 != (lu = fr.read())) {
+                occ[lu]++;
+            }
+            fr.close();
+        } catch (IOException e) {
+            System.out.println("file not found");
+        }
+    }
+
+    public void buildLeftist() {
+        for (int i = 0; i < occ.length; i++) {
+            if (occ[i] != 0) {
+                tas = tas.insert(new Node(new Paire(occ[i], i)));
+            }
+        }
+    }
+
+    public void buildCodeTree() {
+        while (tas.size() > 1) {
+            Node x = tas.min();
+            tas = tas.delete();
+            Node y = tas.min();
+            tas = tas.delete();
+            aC = Node.build(new Paire(x.p.fr + y.p.fr), x, y);
+            tas = tas.insert(aC);
+        }
+        aC = tas.min();
+    }
+
+    public void generateCodes() {
+        construire(aC, "");
+    }
+
+    public void construire(Node x, String s) {
+        if (x.isLeaf()) {
+            this.code[x.p.car] = s;
+        } else {
+            construire(x.left, s + "0");
+            construire(x.right, s + "1");
+        }
+    }
+
+    public void serializeTree() {
+        try {
+            Node.serialaze(aC, "src/Huffman/data/tree");
+        } catch (IOException ex) {
+        }
+    }
+
+    public void deserializeTree() {
+        try {
+            aC = Node.deserialaze("src/Huffman/data/tree");
+        } catch (IOException ex) {
+        }
+    }
 
     public static void main(String[] args) {
-        String text = "There is no patch ...";
-        List<Character> ascii = ListModule.emptyList();
-        for (int i = 0; i < text.length(); i++) {
-            ascii = ListModule.list(text.charAt(i), ascii);
-        }
-        CodeTree cTree = Fork.makeCodeTreeFromText(ascii);
-        System.out.println("-------- CodeTree --------");
-        System.out.println(cTree);
-        
-        List<Integer> code = cTree.encode(ascii, ListModule.emptyList());
-        System.out.println("-------- Binnary Code --------");
-        System.out.println(code);
-        
-        List<Character> plain = cTree.decode(code, ListModule.emptyList());
-        System.out.println("-------- Plain Text --------");
-        String result = plain.reduce("", (x, y) -> y + x);
-        System.out.println(result);
+        Huffman hf = new Huffman();
+
+        File in = new File("src/Huffman/data/plain");
+        File out = new File("src/Huffman/data/code");
+
+        hf.encodeMessage(in, out);
+        //hf.decodeMessage(out, in);
     }
 }

HuffmanCode/Data/plain Huffman/Data/plainHuffmanCode/Data/plain renamed to Huffman/Data/plain

@@ -1,4 +1,4 @@
-package HuffmanCode;
+package Huffman;
 
 import java.io.FileInputStream;
 import java.io.FileOutputStream;

HuffmanCode/Data/tree Huffman/Data/treeHuffmanCode/Data/tree renamed to Huffman/Data/tree

@@ -1,25 +1,15 @@
 package Huffman;
 
-import List.ListModule;
-import List.ListModule.List;
 import java.io.Serializable;
 
 public class Paire implements Comparable<Paire>, Serializable {
 
-    private int fr;
-    private List<Character> chars;
+    int fr;
+    int car;
 
-    public Paire(int fr, List<Character> chars) {
+    public Paire(int fr, int car) {
         this.fr = fr;
-        this.chars = chars;
-    }
-
-    public int getFr() {
-        return fr;
-    }
-
-    public List<Character> getChars() {
-        return chars;
+        this.car = car;
     }
 
     public Paire(int fr) {
@@ -37,12 +27,7 @@ public int compareTo(Paire p) {
 
     @Override
     public String toString() {
-        return "("+chars+fr+")";
+        return car+"("+fr+")";
     }
 
-    public static Paire merge(Paire a, Paire b){
-        return new Paire(a.getFr()+b.getFr(), ListModule.merge(a.getChars(), b.getChars()));
-    }
-    
-    
 }