simple_huffman 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 5255ece9e12754b57eb4438695d3322956a72992
+  data.tar.gz: e571960c4429e5070e022ce8c07ca4c147dd1836
+SHA512:
+  metadata.gz: 4c2d86be3525cdc7b2ec1e1e12287f1370ab6323705e70b80155cc9ab56f58e7baa4f44f45b10b51b242eb2cea8e7f64d4fb07a3bd2b951e9a5cb55afd16c8de
+  data.tar.gz: c35a6e624273c8be709c06f19fc3b981ac73e8bf485072f3b43a4c55a0a1c2604eadbc2cc660fa625cbccd90a5a84eb50806e5e9da199b6a2c3c74f6148c922b

data/lib/huffman.rb

@@ -0,0 +1,95 @@
+class Node
+  attr_accessor :value, :weight, :left, :right, :order
+  def initialize(value, weight, order=0, left=nil, right=nil)
+    @value = value
+    @weight = weight
+    @left = left
+    @right = right
+    @order = order #actuality of the node
+  end
+
+  def traverse(code, hash)
+    if leaf?
+      hash[@value] = code
+    else
+      @left.traverse(code + '1', hash)
+      @right.traverse(code + '0', hash)
+    end
+  end
+
+  #the sorting order should be defined by weight and order of the internal node
+  #for obtaining Huffman code with minimum variance the most recent internal node should be later in the list
+  def <=>(other)
+    if @weight < other.weight
+      -1
+    elsif  @weight > other.weight
+      1
+    else
+      if @order < other.order
+        return -1
+      elsif @order > other.order
+        return 1
+      end
+      0
+    end
+  end
+
+  def leaf?
+    @left.nil? && @right.nil?
+  end
+end
+
+class Huffman
+  # frequencies should be a hash containing the occuring letters of the text and their corresponding frequency
+  # i.e. {'a' => 5, 'b' => 3}
+  def self.encode(text, frequencies=nil)
+    frequencies = get_frequencies(text) unless frequencies
+    tree = build_tree(frequencies)
+    code_table = {}
+    frequencies.size > 1 ? tree.traverse('', code_table) : code_table = {frequencies.keys[0] => '0'}
+    {encoded_text: text.chars.map{|char| code_table[char]}.join, code_table: code_table}
+  end
+
+  def self.decode(encoded_text, code_table)
+    text = []
+    code_table = code_table.invert
+    previous = ''
+    encoded_text.each_char do |char|
+      if code_table[previous + char]
+        text << code_table[previous + char]
+        previous = ''
+      else
+        previous += char
+      end
+    end
+    text.join
+  end
+
+  private
+  def self.get_frequencies(text)
+    frequencies = Hash.new(0)
+    text.each_char do |char|
+      frequencies[char] += 1
+    end
+    frequencies
+  end
+
+  def self.build_tree(frequencies)
+    nodes = []
+    frequencies.each_pair do |letter, frequency|
+      nodes << Node.new(letter, frequency)
+    end
+
+    order = 1
+    while nodes.length > 1 do
+      nodes.sort!
+      left = nodes.shift
+      right = nodes.shift
+      combined = Node.new('', left.weight + right.weight, order, left, right)
+      nodes << combined
+      order += 1
+    end
+    nodes.shift
+  end
+
+end

metadata

@@ -0,0 +1,58 @@
+--- !ruby/object:Gem::Specification
+name: simple_huffman
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Jiayi Zheng
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-11-03 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: A simple implementation of huffman algorithm
+email: ''
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/huffman.rb
+homepage: https://github.com/thebluber
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.0
+signing_key: 
+specification_version: 4
+summary: Huffman encoder/decoder
+test_files: []