Repository navigation
Expand file tree
/
Copy pathcode.hpp
More file actions
70 lines (55 loc) · 1.83 KB
/
Copy pathcode.hpp
File metadata and controls
70 lines (55 loc) · 1.83 KB
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
/*
Project name: Huffman Coding
Project version: 1.0
File name: code.hpp
Project description: David Huffman algorithm based text files encoding/decoding as a command line utility.
Created by Michał Grochowski on 20 Feb 2022.
Copyright © 2022 Michał Grochowski. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#pragma once
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <array>
#include <vector>
//
#include "node.hpp"
#include "queue.hpp"
#include "vector.hpp"
class HuffCode {
public:
HuffCode();
void fileEncode(const std::string &input, const std::string &output);
void fileDecode(const std::string &input, const std::string &output);
private:
// encoding part
void calculateFrequencies();
void createTree();
void generateHuffCode(const Node *node, const HuffVector<bool> &code);
void encode(const Node *node, HuffVector<bool> &v);
void bitsToBytes();
void appendEncodedBits();
// decoding part
Node *rebuildTree();
bool getBit();
uint8_t getByte();
char getCharacter(const Node *n);
size_t decodingIndex = 0;
std::string stringToEncode;
// in need of room for 256 values, where UINT8_MAX is 255
std::array<HuffVector<bool>, UINT8_MAX + 1> codes;
std::array<uint64_t, UINT8_MAX + 1> frequencies = {{0}};
HuffVector<bool> bits;
HuffVector<uint8_t> bytes;
Node *root = 0;
};