huffman_coding 0.0.1 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8866a9b9cab08920b83a3b7fd9d08ff56fe6309ba5501cd883976ffe86c5a197
-  data.tar.gz: 385067bbe91d56e78b5bc278b385219a6bd5b177e0cea057795c05a865c97cf7
+  metadata.gz: 47e30f42beb607e9a5e7bdd29d4cd838b7ecf4fc927b52b3f2496ac668043092
+  data.tar.gz: 257a61ddd2d6ae5f1886e03ce83b06a09d080e88d25bc5d857544a000c74d4f9
 SHA512:
-  metadata.gz: 3cef3df9bc0968df39db9c799eda45f93035e3648672978d0d95779009bc59950ddd9230100d6b53378973fc1a0117a54589e2586f6caa02c7ef87a2aea76371
-  data.tar.gz: 9029091c62d577ab3c3b5b75cb20ce5aa2cb68fb21a8c228f3245a13ab50a395dc61cbc9133238ef88f24d052ea912be6e9ea7e51ea30bd1fc1d3f05115f3b35
+  metadata.gz: 061ebc1c0ad93f774fb2ba5d0e73afa056e0d82b8472b8b95c41e63af637ee4bdd009ddbe338270aa7270ed1c5cc3accc72434e5ab1520355f5b53d4c96db4a1
+  data.tar.gz: b76ec5e35b2e13f8ff03c7f6c3acee02e6df6ed7077381a78cec8a7381c5bc869c4b5f6073976d4ebdf765149045f97dab1d85a85bb2dbdd46de19f2310fbefb

data/CHANGELOG.md

@@ -1 +1,4 @@
-## Change Log
+## Change Log
+
+### v0.0.1 2020/05/16
+- [#1](https://github.com/khiav223577/huffman_coding/pull/1) First implementation (@khiav223577)

data/README.md

@@ -7,8 +7,7 @@
 [![Test Coverage](https://codeclimate.com/github/khiav223577/huffman_coding/badges/coverage.svg)](https://codeclimate.com/github/khiav223577/huffman_coding/coverage)
 
 ## Supports
-- Ruby 2.2 ~ 2.7
-- Rails 3.2, 4.2, 5.0, 5.1, 5.2, 6.0
+- Ruby 1.8 ~ 2.7
 
 ## Installation
 

data/huffman_coding.gemspec

@@ -38,6 +38,4 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'rake', '>= 10.5.0'
   spec.add_development_dependency 'minitest', '~> 5.0'
   spec.add_development_dependency 'backports', '~> 3.17.1'
-
-  spec.add_dependency 'activerecord', '>= 3'
 end

data/lib/huffman_coding/level_nodes.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 class LevelNodes
   attr_reader :size
 

data/lib/huffman_coding/node.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 class Node
   attr_reader :weight
 

data/lib/huffman_coding/utils/tally.rb

@@ -1,15 +1,17 @@
-require 'huffman_coding/utils'
-
-class << HuffmanCoding::Utils
-  if Enumerable.method_defined?(:tally)
-    def tally(enumerable)
-      enumerable.tally
-    end
-  else
-    def tally(enumerable)
-      hash = Hash.new(0)
-      enumerable.each{|key| hash[key] += 1 }
-      return hash
-    end
-  end
-end
+# frozen_string_literal: true
+
+require 'huffman_coding/utils'
+
+class << HuffmanCoding::Utils
+  if Enumerable.method_defined?(:tally)
+    def tally(enumerable)
+      enumerable.tally
+    end
+  else
+    def tally(enumerable)
+      hash = Hash.new(0)
+      enumerable.each{|key| hash[key] += 1 }
+      return hash
+    end
+  end
+end

data/lib/huffman_coding/utils.rb

@@ -1,2 +1,4 @@
+# frozen_string_literal: true
+
 module HuffmanCoding::Utils
 end

data/lib/huffman_coding/version.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 module HuffmanCoding # huffman_coding
-  VERSION = '0.0.1'
+  VERSION = '1.0.0'
 end

data/lib/huffman_coding.rb

@@ -1,65 +1,67 @@
-require 'huffman_coding/version'
-require 'huffman_coding/level_nodes'
-require 'huffman_coding/node'
-require 'huffman_coding/utils/tally'
-
-class << HuffmanCoding
-  def encode(input_array, frequencies = HuffmanCoding::Utils.tally(input_array))
-    if frequencies.size == 1
-      code_table = { frequencies.keys[0] => '0' }
-    else
-      code_table = {}
-      build_tree(frequencies).traverse('', code_table)
-    end
-
-    result_binary_string = input_array.map{|char| code_table[char] }.join
-    last_byte_bits = result_binary_string.size % 8
-    last_byte_bits = 8 if last_byte_bits == 0
-    binary = result_binary_string.scan(/.{1,8}/).map{|s| s.to_i(2) }.pack('C*')
-    return binary, last_byte_bits, code_table
-  end
-
-  def decode(binary, last_byte_bits, code_table)
-    text = ''
-    code_table = code_table.invert
-    previous = ''
-
-    add_binary_char = proc do |binary_char|
-      previous << binary_char
-      if (char = code_table[previous])
-        text << char
-        previous = ''
-      end
-    end
-
-    bytes = binary.bytes.map{|s| s.to_s(2) } # bytes = ['101000', '11', '10101111', ...]
-    last_byte = bytes.pop
-
-    bytes.each do |byte|
-      (8 - byte.size).times{ add_binary_char['0'] }
-      byte.each_char{|s| add_binary_char[s] }
-    end
-
-    (last_byte_bits - last_byte.size).times{ add_binary_char['0'] }
-    last_byte.each_char{|s| add_binary_char[s] }
-
-    return text
-  end
-
-  private
-
-  def build_tree(frequencies)
-    level_nodes = LevelNodes.new(frequencies.map{|letter, frequency| Node.new(letter, frequency) })
-
-    while level_nodes.size > 1
-      left_level, left_node = level_nodes.pop_min_node
-      right_level, right_node = level_nodes.pop_min_node
-      next_level = (left_level > right_level ? left_level : right_level) + 1
-
-      new_node = Node.new(nil, left_node.weight + right_node.weight, left_node, right_node)
-      level_nodes.push_node(next_level, new_node)
-    end
-
-    return new_node
-  end
-end
+# frozen_string_literal: true
+
+require 'huffman_coding/version'
+require 'huffman_coding/level_nodes'
+require 'huffman_coding/node'
+require 'huffman_coding/utils/tally'
+
+class << HuffmanCoding
+  def encode(input_array, frequencies = HuffmanCoding::Utils.tally(input_array))
+    if frequencies.size == 1
+      code_table = { frequencies.keys[0] => '0' }
+    else
+      code_table = {}
+      build_tree(frequencies).traverse('', code_table)
+    end
+
+    result_binary_string = input_array.map{|char| code_table[char] }.join
+    last_byte_bits = result_binary_string.size % 8
+    last_byte_bits = 8 if last_byte_bits == 0
+    binary = result_binary_string.scan(/.{1,8}/).map{|s| s.to_i(2) }.pack('C*')
+    return binary, last_byte_bits, code_table
+  end
+
+  def decode(binary, last_byte_bits, code_table)
+    text = String.new
+    code_table = code_table.invert
+    previous = String.new
+
+    add_binary_char = proc do |binary_char|
+      previous << binary_char
+      if (char = code_table[previous])
+        text << char
+        previous = String.new
+      end
+    end
+
+    bytes = binary.bytes.map{|s| s.to_s(2) } # bytes = ['101000', '11', '10101111', ...]
+    last_byte = bytes.pop
+
+    bytes.each do |byte|
+      (8 - byte.size).times{ add_binary_char['0'] }
+      byte.each_char{|s| add_binary_char[s] }
+    end
+
+    (last_byte_bits - last_byte.size).times{ add_binary_char['0'] }
+    last_byte.each_char{|s| add_binary_char[s] }
+
+    return text
+  end
+
+  private
+
+  def build_tree(frequencies)
+    level_nodes = LevelNodes.new(frequencies.map{|letter, frequency| Node.new(letter, frequency) })
+
+    while level_nodes.size > 1
+      left_level, left_node = level_nodes.pop_min_node
+      right_level, right_node = level_nodes.pop_min_node
+      next_level = (left_level > right_level ? left_level : right_level) + 1
+
+      new_node = Node.new(nil, left_node.weight + right_node.weight, left_node, right_node)
+      level_nodes.push_node(next_level, new_node)
+    end
+
+    return new_node
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: huffman_coding
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 1.0.0
 platform: ruby
 authors:
 - khiav reoy
@@ -72,20 +72,6 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: 3.17.1
-- !ruby/object:Gem::Dependency
-  name: activerecord
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '3'
-  type: :runtime
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '3'
 description: A ruby gem that implements Huffman Coding.
 email:
 - mrtmrt15xn@yahoo.com.tw
@@ -136,7 +122,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.6
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: A ruby gem that implements Huffman Coding.