Huffman编码译码算法的C++实现

2019独角兽企业重金招聘Python工程师标准>>>

头文件：

 

/*****************************************************************************
 *                               huffmancode.h
 *
 * Huffman coding algorighm implemented by C++ template.
 *
 * This class is designed for Huffman codeing and decoding algorighm. The
 * priority queue is used in building Huffman tree. For comparing pointers
 * of Huffman Tree Node by their pointing contents, I use the smart pointer
 * replacing nomal pointer. And for saving memory, the coded word is stored
 * bit-by-bit in an unsigned char array.
 *
 * Zhang Ming, 20010-07, Xi'an Jiaotong University.
 *****************************************************************************/


#ifndef HUFFMANCODE_H
#define HUFFMANCODE_H


#include 
#include 


using namespace std;


namespace itlab
{

    /**
     * Object node to be coded
     */
    template 
    struct CodeObject
    {
        Object data;
        Weight cost;
    };
    // struct CodeObject


    /**
     * Huffman codeword node
     */
    const int CODESIZE = 2;
    template 
    struct HCNode
    {
        Object data;
        unsigned char bits[CODESIZE];
        unsigned int length;
    };
    // struct HCNode


    /**
     * Huffman tree node
     */
    template 
    struct HTNode
    {
        Object data;
        Weight cost;
        HTNode *left,
                              *right;

        HTNode() : data(Object()), cost(Weight(0)), left(NULL), right(NULL)
        { }
        HTNode( const Object &x, const Weight w,
                HTNode *lp=NULL, HTNode *rp=NULL )
        {   data = x; cost = w; left = lp; right = rp;    }

        operator Weight() const
        {   return cost;    }

    };
    // struct HTNode


    /**
     * Smart pointer for Huffman tree bode
     */
    template 
    class HTNSmartPtr
    {

    public:

        HTNSmartPtr( HTNode *p = NULL )
        {   ptr = p;    }

        HTNode operator*()
        {   return *ptr;    }
        HTNode* operator->()
        {   return ptr;    }

        operator HTNode *()
        {   return ptr;    }
        bool operator<( HTNSmartPtr p )
        {   return ptr->cost < p->cost;    }
        bool operator>( HTNSmartPtr p )
        {   return ptr->cost > p->cost;    }

    private:

        HTNode *ptr;

    };
    // class HTNSmartPtr


    /**
     * Huffman tree
     */
    template 
    class HuffmanTree
    {

    public:

        HuffmanTree();
        ~HuffmanTree();

//        HuffmanTree( const HuffmanTree &rhs );
//        HuffmanTree & operator=( const HuffmanTree &rhs );

        void code( CodeObject *codeArray, int length );
        bool decode( unsigned char bits[CODESIZE], unsigned int length, Object &decodeword );
        void printCode( unsigned char bits[CODESIZE], unsigned int length );
        void printCodeTable();

    private:

        HTNSmartPtr root;
        int arraySize;
        HCNode