Huffman.hpp

Go to the documentation of this file.

// Header Guards to prevent header files from being included multiple times
#ifndef HUFFMAN_HPP
#define HUFFMAN_HPP
#include <bitset>
#include <iostream>
#include <memory>
#include <queue>
#include <stdint.h>
#include <unordered_map>
#include <vector>
#include <fstream>
using namespace std;

struct HuffmanNode
{
    uint8_t ch;

    uint64_t fr;

    unique_ptr<HuffmanNode> left;

    unique_ptr<HuffmanNode> right;

    HuffmanNode(uint8_t character, uint64_t frecuency);

    HuffmanNode(uint8_t character, uint64_t frecuency, unique_ptr<HuffmanNode> lft, unique_ptr<HuffmanNode> rght);

    struct CompareNodes
    {
        bool operator()(const unique_ptr<HuffmanNode> &a, const unique_ptr<HuffmanNode> &b) const
        {
            return a->fr > b->fr;
        }
    };
};

class HuffmanTree
{
    unordered_map<uint8_t, uint64_t> frecuencies;

    unordered_map<uint8_t, uint64_t> count_characters(const vector<uint8_t> &str);

    unique_ptr<HuffmanNode> create_tree(priority_queue<unique_ptr<HuffmanNode>, vector<unique_ptr<HuffmanNode>>, HuffmanNode::CompareNodes> &pq);

    priority_queue<unique_ptr<HuffmanNode>, vector<unique_ptr<HuffmanNode>>, HuffmanNode::CompareNodes> create_min_heap();

    void create_code(const unique_ptr<HuffmanNode> &p, bitset<32> unique_code);

    void create_codes();

    void print_codes();
 
public:
    unique_ptr<HuffmanNode> root;

    unordered_map<uint8_t, bitset<32>> code8b;

    unordered_map<uint8_t, bitset<32>> code16b;

    unordered_map<uint8_t, bitset<32>> code32b;

    void encode_vec(vector<uint8_t> &vec);

    void encodeFile(const string &filename);
};
#endif