Project3/Hoffman.cpp at master · jeffreydrew/Project3 · GitHub

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
struct Node
{
    char character;
    int frequency;
    Node left, right;

    Node() : frequency(0), character(0), left(nullptr), right(nullptr) {}
    Node(char c, int f) : character(c), frequency(f), left(nullptr), right(nullptr) {};
    Node(int f, char c, Node* lf, Node* rt) : character(c), frequency(f), left(lf), right(rt) {};

};


struct comp
{
    bool operator()(Node* a, Node* b)
    {
        return a->frequency > b->frequency;
    }
};

class HuffMan
{
public:
    string word;

    priority_queue<Node, vector<Node>, comp> queue;
    unordered_map<char, int> map;

    HuffMan(string& str)
    {
        word = str;

        for (char& i : str)
        {
            map[i]++;
        }

        for (auto it = map.begin(); it != map.end(); it++) {
            queue.push(new Node(it->first, it->second));
        }

        while (queue.size() > 1)
        {
            Node* tl, * tr;
            tl = queue.top();
            queue.pop();
            tr = queue.top();
            queue.pop();

            Node* n = new Node(tl->frequency + tr->frequency, ' ', tl, tr);
            queue.push(n);
        }
    }

    Node* get()
    {
        return queue.top();
    }
};
Rafa333 — Today at 7:49 PM
Huffman :
class HuffMan
{
private:
    struct Node
    {
        char character;
        int frequency;
        Node left, right;

        Node() : frequency(0), character(0), left(nullptr), right(nullptr) {}
        Node(char c, int f) : character(c), frequency(f), left(nullptr), right(nullptr) {};
        Node(int f, char c, Node* lf, Node* rt) : character(c), frequency(f), left(lf), right(rt) {};
    };

    struct comp
    {
        bool operator()(Node* a, Node* b)
        {
            return a->frequency > b->frequency;
        }
    };

public:
    string word;

    priority_queue<Node, vector<Node>, comp> queue;
    unordered_map<char, int> map;

    HuffMan(string& str)
    {
        word = str;

        for (char& i : str)
        {
            map[i]++;
        }

        for (auto it = map.begin(); it != map.end(); it++) {
            queue.push(new Node(it->first, it->second));
        }

        while (queue.size() > 1)
        {
            Node* tl, * tr;
            tl = queue.top();
            queue.pop();
            tr = queue.top();
            queue.pop();

            Node* n = new Node(tl->frequency + tr->frequency, ' ', tl, tr);
            queue.push(n);
        }
    }


    vector<int> getRGB()
    {
        vector<int> rgb;
        rgb.push_back(queue.top()->frequency);
        rgb.push_back(queue.top()->left->frequency);
        rgb.push_back(queue.top()->right->frequency);

    }
};