Merge pull request #3 from NoUITeam/new

Basic tasks completed.

Author: Jianxff

Decode.cpp

@@ -0,0 +1,38 @@
+#include"HuffmanCoding.h"
+
+bool Document::Decode(){
+    FILE* reader=fopen(path,"r");
+    FILE *writer=fopen("result.txt","wb");
+    if(!reader||!writer){
+        cout<<"Oops! Something went wrong. Try again later."<<endl;
+        return false;
+    }
+    int num=-1;
+    while(!feof(reader)){
+        if(fscanf(reader,"%d",&num)<=0||num==-1)
+            break;
+    }
+    int flag=top;
+    while(!feof(reader)){
+        char c;
+        if(fscanf(reader,"%c",&c)<=0)  break;
+        if(c=='0'){
+            flag=HuffmanTree[flag][_left];
+        }else if(c=='1'){
+            flag=HuffmanTree[flag][_right];
+        }else if(c=='\n'){
+        }else{
+            cout<<"Oops!\nDecoding failed! Invalid code exists."<<endl;
+            return false;
+        }
+        if(HuffmanTree[flag][_left]==0 && HuffmanTree[flag][_right]==0){
+            fprintf(writer,"%c",(char)flag);
+            flag=top;
+        }
+    }
+    cout<<"Finish. Check 'result.txt'."<<endl;
+    fclose(reader);
+    fclose(writer);
+    return true;
+}
+

Document.cpp

@@ -1,37 +1,30 @@
-#include"HuffmanCoding.hpp"
+#include"HuffmanCoding.h"
 #include"Heap.hpp"
-#include <stdio.h>
-#include<string>
 using namespace std;
 
-Document::Document(const char *Address){
+Document::Document(const char *Address,int mode_chose){
     path=Address;
-    if(!Readin()){
-        cout<<"No such file or failed to open."<<endl;
+    mode=mode_chose;
+    if(!Readin(mode)){
+        cout<<"Oops!\nNo such file or failed to open."<<endl;
     }else{
-        HTreeInit();
-        HTreeCreate();
-        WordsCreate();
-    }
-}
-
-bool Document::Readin(){
-    FILE* reader=fopen(path,"rb");
-    if(reader==NULL)  return false;
-    char buffer[3];
-    if(!reader)  return false;
-    while(!feof(reader)){
-        int count=fread(buffer,1,1,reader);
-        if(count>0)
-            BytecodeArray[(int)*buffer]++;
+        Sleep(500);
+        cout<<"Read-in success.\nCreating codeTree..."<<endl;
+        Sleep(500);
+        if(HTreeInit()&&HTreeCreate()&&WordsCreate()){
+            cout<<"Going to "<<(mode==0?"encoding":"decoding")<<"..."<<endl;
+            Sleep(500);
+            if(mode==0){  Encode();  }
+            else{  Decode();  }    
+        }else{
+            cout<<"Oops! Something went wrong. Try again later."<<endl;
+        }
     }
-    fclose(reader);
-    return true;
 }
 
 bool Document::HTreeInit(){
-    top=0;
     HuffmanTree[0][_parent]=-1;
+    top=0;
     int flag=1;
     for(int i=0;i<=258;i++){
         if(BytecodeArray[i]!=0){
@@ -77,39 +70,29 @@ bool Document::WordsCreate(){
             int cur=i;
             int pre=HuffmanTree[cur][_parent];
             string code="";
-            while(pre!=-1){
+            while(pre!=0){
                 code = HuffmanTree[pre][_left]==cur ? ('0'+code):('1'+code);
                 cur=pre;
                 pre=HuffmanTree[pre][_parent];
             }
             Words[i]=code;
         }
     }
+    return true;
 }
 
-bool Document::Encode(){
-    FILE *reader=fopen(path,"rb");
-    FILE *writer=fopen("out.txt","wb");
-    if(!reader||!writer){
-        printf("Failed to encode. File Error.\n");
-        return false;
+bool Document::watch(){
+    cout<<endl;
+    for(int i=0;i<512;i++){
+        cout<<i<<" "//<<(char)i<<" "
+            <<HuffmanTree[i][_weigth]<<" "
+            <<HuffmanTree[i][_left]<<" "
+            <<HuffmanTree[i][_right]<<" "
+            <<HuffmanTree[i][_parent]<<" "
+            <<(i<=256?Words[i]:" ")<<endl;
     }
-    for(int i=0;i<=256;i++){
-        if(BytecodeArray[i]>0){
-            fprintf(writer,"%d %d ",i,BytecodeArray[i]);
-        }
-    }
-    fprintf(writer,"-1\n");
-    char buffer[3];
-    while(!feof(reader)){
-        int count=fread(buffer,1,1,reader);
-        if(count>0)
-            fprintf(writer,"%s",Words[(int)*buffer].c_str());
-    }
-    fclose(reader);
-    fclose(writer);
-    return true;
 }
 
 
 
+

Encode.cpp

@@ -0,0 +1,30 @@
+#include"HuffmanCoding.h"
+
+bool Document::Encode(){
+    FILE *reader=fopen(path,"rb");
+    FILE *writer=fopen("out.txt","wb");
+    if(!reader||!writer){
+        cout<<"Oops! Something went wrong. Try again later."<<endl;
+        return false;
+    }
+    for(int i=0;i<=256;i++){
+        if(BytecodeArray[i]>0)
+            fprintf(writer,"%d %d ",i,BytecodeArray[i]);
+    }
+    fprintf(writer,"-1\n");
+    char buffer[3];
+    while(!feof(reader)){
+        int count=fread(buffer,1,1,reader);
+        if(count>0)
+            fprintf(writer,"%s",Words[(int)*buffer].c_str());
+    }
+    cout<<"Finish. Check 'out.txt'."<<endl;
+    fclose(reader);
+    fclose(writer);
+    return true;
+}
+
+
+
+
+

HuffmanCoding.h

@@ -0,0 +1,55 @@
+#ifndef _HUFFMANCODING_H
+#define _HUFFMANCODING_H
+#include "Heap.hpp"
+#include <stdio.h>
+#include <iostream>
+#include <string>
+#include <windows.h>
+using namespace std;
+
+#define _weigth 0
+#define _left 1
+#define _right 2
+#define _parent 3
+#define _value 4
+
+struct Node{
+    int val;
+    int weight;
+    int parent;
+    Node(int val,int weight,int parent){
+        this->val=val;
+        this->weight=weight;
+        this->parent=parent;
+    }
+    friend bool operator < (Node a,Node b){
+        return a.weight < b.weight;
+    }
+};
+
+
+class Document{
+private:
+    int BytecodeArray[258];
+    int HuffmanTree[512][5];
+    string Words[258];
+    const char* path;
+    Heap<Node> Nodes;
+    int mode;
+    int top;
+    ///
+    bool Readin(int mode);
+    bool HTreeInit();
+    bool Select(int & node1,int & node2);
+    bool HTreeCreate();
+    bool WordsCreate();
+public:
+    Document(const char *Address,int mode_chose);
+    //~Document();
+    bool Encode();
+    bool Decode();
+    bool watch();
+
+};
+
+#endif

Main.cpp

@@ -0,0 +1,22 @@
+#include"HuffmanCoding.h"
+#include"Document.cpp"
+#include"Readin.cpp"
+#include"Encode.cpp"
+#include"Decode.cpp"
+using namespace std;
+int main(){
+    string address1="in.txt",address2="out.txt";
+    int mode0=0,mode1=1;
+    /*
+    cout<<"Enter name or path of a file:";
+    cin>>filePath;
+    cout<<"Enter mode:";
+    cin>>mode;
+    */
+    const char* path1=address1.c_str();
+    const char* path2=address2.c_str();
+    Document test(path1,mode0);
+    Document test2(path2,mode1);
+    //test.watch();
+    return 0;
+}

Readin.cpp

@@ -0,0 +1,28 @@
+#include"HuffmanCoding.h"
+
+bool Document::Readin(int mode){
+    if(mode==0){
+        FILE* reader=fopen(path,"rb");
+        if(reader==NULL)  return false;
+        char buffer[3];
+        while(!feof(reader)){
+            int count=fread(buffer,1,1,reader);
+            if(count>0)
+                BytecodeArray[(int)*buffer]++;
+        }
+        fclose(reader);
+    }else if(mode==1){
+        FILE* reader=fopen(path,"r");
+        int num,wt;
+        int flag=0;
+        while(!feof(reader)){
+            int count=fscanf(reader,"%d",&num);
+            if(count<=0||num==-1)  break;
+            count=fscanf(reader,"%d",&wt);
+            if(count<=0||num==-1)  break;
+            BytecodeArray[num]=wt;
+        }
+        fclose(reader);
+    }
+    return true;
+}

in.txt

@@ -1 +1,22 @@
-123 000 abcd !@#     test   `;\?
+#include"HuffmanCoding.h"
+#include"Document.cpp"
+#include"Readin.cpp"
+#include"Encode.cpp"
+#include"Decode.cpp"
+using namespace std;
+int main(){
+    string address1="in.txt",address2="out.txt";
+    int mode0=0,mode1=1;
+    /*
+    cout<<"Enter name or path of a file:";
+    cin>>filePath;
+    cout<<"Enter mode:";
+    cin>>mode;
+    */
+    const char* path1=filePath.c_str();
+    const char* path2=filePath.c_str();
+    Document test(path1,mode0);
+    Document test2(path2,mode1);
+    //test.watch();
+    return 0;
+}

out.txt

@@ -1,2 +1,2 @@
-32 11 33 1 35 1 48 3 49 1 50 1 51 1 59 1 63 1 64 1 92 1 96 1 97 1 98 1 99 1 100 1 101 1 115 1 116 2 -1
-11011111000110101111110011001100111111000011001010000101110111110110101001110011111111111111111101101011111101001011011111111110101011010110001101000
+10 22 13 22 32 75 34 18 35 5 40 6 41 6 42 4 44 4 46 10 47 4 48 4 49 6 50 4 58 2 59 13 60 4 61 6 62 4 67 1 68 4 69 3 72 1 80 3 82 1 95 2 97 20 99 26 100 20 101 33 102 7 103 3 104 12 105 19 108 9 109 13 110 27 111 19 112 14 114 12 115 15 116 36 117 14 119 1 120 2 123 1 125 1 -1
+1110010110000011001010000101010110110111100010110111010101001000101000100010110100011011011100110011101111000001111100110111000111110100011110111110111001011000001100101000010101011011011110001100000011001001001010000100111001110011110000010010010100110001111011111011100101100000110010100001010101101101111000101101010101111101011011110000011111000001001001010011000111101111101110010110000011001010000101010110110111100011110011100110010110011101101111110000010010010100110001111011111011100101100000110010100001010101101101111000110000000111001011001110110111111000001001001010011000111101111100101001011110000011111001101010011110100001001110101101001110100010011110101011100111011000111110111110110000011100110100010110101100000110000110000010110001111110111110101101101101010111001111111110000011111001101011101011011110111111110111010110101100000000001010001110000011111000100101101111100110001100000111010110111101111111101110101101011011001100001010001110010101010011110001001011011111001100010001111101111101011011011011100000111001101000101100111011011101100100000100110010100000100010110011101101110000000000100000000001111101111101011011011010110100011000011101111101011011011010010110010101010010100001010000110001111001110011100101111111111010011110100001001111011100111111110101001110101001111110101110010100011011101010101000111000100001011101100010100010001111101111101011011011010010110000011011011001101100100011100010000101110100000110101001111110000111110111110101101101101001011001010101001010000101000011000111100111001110010111111111101000101100111011011101100010100010001111101111101011011011010010110000011011011001101100001011001110110111000111110111110101101101101011000001101001110111110101101101101001011001001101011100110100101111101101011111101100001010100111010100111111000000000001001000111000100001011101000001101010011111101110000010011010110101110011111110000110000010001111101111101011011011010010110010011010111001101001011111011010111111011000010101001110101001111110011001100001001000111000100001011101000001101010011111101110000010011010110101110011111110000110000010001111101111101011011011011000000110010010010100001001110011100110110010111010111001000011010011101010011111100000001000001000101100111011011101100100000010001111101111101011011011011000000110010010010100001001110011100110110010111010111001011001100001101001110101001111110011001110000010001011001110110111000000000001000111110111110101101101101011010001101001001011101011100111100001100011011010100100101111100000110000010001111101111101011011011011111110111100101010111111001110101100100001111101111100110101001110111110

result.txt

@@ -0,0 +1,22 @@
+#include"HuffmanCoding.h"
+#include"Document.cpp"
+#include"Readin.cpp"
+#include"Encode.cpp"
+#include"Decode.cpp"
+using namespace std;
+int main(){
+    string address1="in.txt",address2="out.txt";
+    int mode0=0,mode1=1;
+    /*
+    cout<<"Enter name or path of a file:";
+    cin>>filePath;
+    cout<<"Enter mode:";
+    cin>>mode;
+    */
+    const char* path1=filePath.c_str();
+    const char* path2=filePath.c_str();
+    Document test(path1,mode0);
+    Document test2(path2,mode1);
+    //test.watch();
+    return 0;
+}