Skip to content

Rework C++ implementation for Huffman encoding #264

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

Rework C++ implementation for Huffman encoding #264

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
71c0d42
Rework C++ implementation for Huffman encoding
mika314 Jul 17, 2018
5249dc1
Do not store branch, calculate on runtime
mika314 Aug 7, 2018
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Do not store branch, calculate on runtime
  • Loading branch information
@mika314
mika314 committed Aug 7, 2018
commit 5249dc1a511f6e16d2543e37bae45afd9e2db7b0
11 changes: 6 additions & 5 deletions contents/huffman_encoding/code/c++/huffman.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,9 +12,12 @@ struct node {
: left(std::move(a_left)), right(std::move(a_right)),
weight(left->weight + right->weight) {
left->parent = this;
left->branch = branch::left;
right->parent = this;
right->branch = branch::right;
}

bool branch() const
{
return parent->right.get() == this;
}

// leaf fields
Expand All @@ -26,8 +29,6 @@ struct node {

// common fields
node* parent = nullptr;
enum class branch { left, right };
branch branch = branch::left;
int weight = 0;
};

Expand Down Expand Up @@ -80,7 +81,7 @@ std::vector<bool> encode(const std::string& string_to_encode, codebook& cb) {
auto node = cb.char_map[ch];
std::vector<bool> compressed_char;
while (node->parent != nullptr) {
compressed_char.push_back(node->branch != node::branch::left);
compressed_char.push_back(node->branch());
node = node->parent;
}
res.insert(std::end(res), compressed_char.rbegin(), compressed_char.rend());
Expand Down