huffman_coding 0.0.1 → 1.0.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/.gitignore +0 -0
- data/.rubocop.yml +0 -0
- data/.travis.yml +0 -0
- data/CHANGELOG.md +4 -1
- data/CODE_OF_CONDUCT.md +0 -0
- data/LICENSE +0 -0
- data/README.md +1 -2
- data/Rakefile +0 -0
- data/bin/console +0 -0
- data/bin/setup +0 -0
- data/gemfiles/Gemfile +0 -0
- data/gemfiles/ruby_1_8_7.gemfile +0 -0
- data/huffman_coding.gemspec +0 -2
- data/lib/huffman_coding/level_nodes.rb +2 -0
- data/lib/huffman_coding/node.rb +2 -0
- data/lib/huffman_coding/utils/tally.rb +17 -15
- data/lib/huffman_coding/utils.rb +2 -0
- data/lib/huffman_coding/version.rb +3 -1
- data/lib/huffman_coding.rb +67 -65
- metadata +2 -16
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: 47e30f42beb607e9a5e7bdd29d4cd838b7ecf4fc927b52b3f2496ac668043092
|
4
|
+
data.tar.gz: 257a61ddd2d6ae5f1886e03ce83b06a09d080e88d25bc5d857544a000c74d4f9
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 061ebc1c0ad93f774fb2ba5d0e73afa056e0d82b8472b8b95c41e63af637ee4bdd009ddbe338270aa7270ed1c5cc3accc72434e5ab1520355f5b53d4c96db4a1
|
7
|
+
data.tar.gz: b76ec5e35b2e13f8ff03c7f6c3acee02e6df6ed7077381a78cec8a7381c5bc869c4b5f6073976d4ebdf765149045f97dab1d85a85bb2dbdd46de19f2310fbefb
|
data/.gitignore
CHANGED
File without changes
|
data/.rubocop.yml
CHANGED
File without changes
|
data/.travis.yml
CHANGED
File without changes
|
data/CHANGELOG.md
CHANGED
data/CODE_OF_CONDUCT.md
CHANGED
File without changes
|
data/LICENSE
CHANGED
File without changes
|
data/README.md
CHANGED
@@ -7,8 +7,7 @@
|
|
7
7
|
[![Test Coverage](https://codeclimate.com/github/khiav223577/huffman_coding/badges/coverage.svg)](https://codeclimate.com/github/khiav223577/huffman_coding/coverage)
|
8
8
|
|
9
9
|
## Supports
|
10
|
-
- Ruby
|
11
|
-
- Rails 3.2, 4.2, 5.0, 5.1, 5.2, 6.0
|
10
|
+
- Ruby 1.8 ~ 2.7
|
12
11
|
|
13
12
|
## Installation
|
14
13
|
|
data/Rakefile
CHANGED
File without changes
|
data/bin/console
CHANGED
File without changes
|
data/bin/setup
CHANGED
File without changes
|
data/gemfiles/Gemfile
CHANGED
File without changes
|
data/gemfiles/ruby_1_8_7.gemfile
CHANGED
File without changes
|
data/huffman_coding.gemspec
CHANGED
data/lib/huffman_coding/node.rb
CHANGED
@@ -1,15 +1,17 @@
|
|
1
|
-
|
2
|
-
|
3
|
-
|
4
|
-
|
5
|
-
|
6
|
-
|
7
|
-
|
8
|
-
|
9
|
-
|
10
|
-
|
11
|
-
|
12
|
-
|
13
|
-
|
14
|
-
|
15
|
-
end
|
1
|
+
# frozen_string_literal: true
|
2
|
+
|
3
|
+
require 'huffman_coding/utils'
|
4
|
+
|
5
|
+
class << HuffmanCoding::Utils
|
6
|
+
if Enumerable.method_defined?(:tally)
|
7
|
+
def tally(enumerable)
|
8
|
+
enumerable.tally
|
9
|
+
end
|
10
|
+
else
|
11
|
+
def tally(enumerable)
|
12
|
+
hash = Hash.new(0)
|
13
|
+
enumerable.each{|key| hash[key] += 1 }
|
14
|
+
return hash
|
15
|
+
end
|
16
|
+
end
|
17
|
+
end
|
data/lib/huffman_coding/utils.rb
CHANGED
data/lib/huffman_coding.rb
CHANGED
@@ -1,65 +1,67 @@
|
|
1
|
-
|
2
|
-
|
3
|
-
require 'huffman_coding/
|
4
|
-
require 'huffman_coding/
|
5
|
-
|
6
|
-
|
7
|
-
|
8
|
-
|
9
|
-
|
10
|
-
|
11
|
-
code_table = {}
|
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
|
-
bytes.
|
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
|
-
|
1
|
+
# frozen_string_literal: true
|
2
|
+
|
3
|
+
require 'huffman_coding/version'
|
4
|
+
require 'huffman_coding/level_nodes'
|
5
|
+
require 'huffman_coding/node'
|
6
|
+
require 'huffman_coding/utils/tally'
|
7
|
+
|
8
|
+
class << HuffmanCoding
|
9
|
+
def encode(input_array, frequencies = HuffmanCoding::Utils.tally(input_array))
|
10
|
+
if frequencies.size == 1
|
11
|
+
code_table = { frequencies.keys[0] => '0' }
|
12
|
+
else
|
13
|
+
code_table = {}
|
14
|
+
build_tree(frequencies).traverse('', code_table)
|
15
|
+
end
|
16
|
+
|
17
|
+
result_binary_string = input_array.map{|char| code_table[char] }.join
|
18
|
+
last_byte_bits = result_binary_string.size % 8
|
19
|
+
last_byte_bits = 8 if last_byte_bits == 0
|
20
|
+
binary = result_binary_string.scan(/.{1,8}/).map{|s| s.to_i(2) }.pack('C*')
|
21
|
+
return binary, last_byte_bits, code_table
|
22
|
+
end
|
23
|
+
|
24
|
+
def decode(binary, last_byte_bits, code_table)
|
25
|
+
text = String.new
|
26
|
+
code_table = code_table.invert
|
27
|
+
previous = String.new
|
28
|
+
|
29
|
+
add_binary_char = proc do |binary_char|
|
30
|
+
previous << binary_char
|
31
|
+
if (char = code_table[previous])
|
32
|
+
text << char
|
33
|
+
previous = String.new
|
34
|
+
end
|
35
|
+
end
|
36
|
+
|
37
|
+
bytes = binary.bytes.map{|s| s.to_s(2) } # bytes = ['101000', '11', '10101111', ...]
|
38
|
+
last_byte = bytes.pop
|
39
|
+
|
40
|
+
bytes.each do |byte|
|
41
|
+
(8 - byte.size).times{ add_binary_char['0'] }
|
42
|
+
byte.each_char{|s| add_binary_char[s] }
|
43
|
+
end
|
44
|
+
|
45
|
+
(last_byte_bits - last_byte.size).times{ add_binary_char['0'] }
|
46
|
+
last_byte.each_char{|s| add_binary_char[s] }
|
47
|
+
|
48
|
+
return text
|
49
|
+
end
|
50
|
+
|
51
|
+
private
|
52
|
+
|
53
|
+
def build_tree(frequencies)
|
54
|
+
level_nodes = LevelNodes.new(frequencies.map{|letter, frequency| Node.new(letter, frequency) })
|
55
|
+
|
56
|
+
while level_nodes.size > 1
|
57
|
+
left_level, left_node = level_nodes.pop_min_node
|
58
|
+
right_level, right_node = level_nodes.pop_min_node
|
59
|
+
next_level = (left_level > right_level ? left_level : right_level) + 1
|
60
|
+
|
61
|
+
new_node = Node.new(nil, left_node.weight + right_node.weight, left_node, right_node)
|
62
|
+
level_nodes.push_node(next_level, new_node)
|
63
|
+
end
|
64
|
+
|
65
|
+
return new_node
|
66
|
+
end
|
67
|
+
end
|
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: huffman_coding
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.0
|
4
|
+
version: 1.0.0
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- khiav reoy
|
@@ -72,20 +72,6 @@ dependencies:
|
|
72
72
|
- - "~>"
|
73
73
|
- !ruby/object:Gem::Version
|
74
74
|
version: 3.17.1
|
75
|
-
- !ruby/object:Gem::Dependency
|
76
|
-
name: activerecord
|
77
|
-
requirement: !ruby/object:Gem::Requirement
|
78
|
-
requirements:
|
79
|
-
- - ">="
|
80
|
-
- !ruby/object:Gem::Version
|
81
|
-
version: '3'
|
82
|
-
type: :runtime
|
83
|
-
prerelease: false
|
84
|
-
version_requirements: !ruby/object:Gem::Requirement
|
85
|
-
requirements:
|
86
|
-
- - ">="
|
87
|
-
- !ruby/object:Gem::Version
|
88
|
-
version: '3'
|
89
75
|
description: A ruby gem that implements Huffman Coding.
|
90
76
|
email:
|
91
77
|
- mrtmrt15xn@yahoo.com.tw
|
@@ -136,7 +122,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
136
122
|
- !ruby/object:Gem::Version
|
137
123
|
version: '0'
|
138
124
|
requirements: []
|
139
|
-
rubygems_version: 3.0.
|
125
|
+
rubygems_version: 3.0.3
|
140
126
|
signing_key:
|
141
127
|
specification_version: 4
|
142
128
|
summary: A ruby gem that implements Huffman Coding.
|