huffify 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4df9b4e3fb3efbca2989c0d0ea76d4428bb89b71c190e00df54e27460d7ebb20
-  data.tar.gz: 95778bb52ef2f9fa1469757cd9d387a33ffaa985f35d04f36a9d240de4201364
+  metadata.gz: 845609542a9ee0c5c71059d998828ab7b6d88f2f50c1b9be019c4dd53eff2bea
+  data.tar.gz: 0a5b18ee7ca29489c9bda0e83858207e86eb24aea1e2524e1f6ff3f37fb68998
 SHA512:
-  metadata.gz: e299c274cdfbe5cc5924ed97c7e586f0f7a93ff5aa7804d4ec4bf12c83e08e56d0d2132dfbd9aa39cc2b91acc7986091c590c4da9ec3302b277e0932e4b2bc67
-  data.tar.gz: 22dd620abb1ba5aa379852a2f840c449613228c6158a9d74aca3e430befcf4d5e5684b72f7450fb00c2878e390d748bd937ea3fdb40d8dd750e77f3fe4eb4f62
+  metadata.gz: 042cb5b5c293462af59d837ffa680b82761590ffb5cc2afd4938d88bec14afa7fa86214c9aacee0d91cc0669790f424e7263066f8947b41a74f001739f4f0cf4
+  data.tar.gz: 1dae9271c9da5dc6503d5259e518055e0be643e45bf469493a4abfbaeb4011a433c3c230f9ff457b8e882b59898966168461749a7c8973baf68432a96209bd54

data/lib/huffify/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Huffify
-  VERSION = "0.1.1"
+  VERSION = "0.1.2"
 end

data/lib/huffify.rb

@@ -14,13 +14,13 @@ module Huffify
     end
   end
 
-  def encode(text)
+  def self.encode(text)
     huffman_tree = build_huffman_tree(text)
     codes = get_char_codes(huffman_tree)
     { encoded_text: text.each_char.map { |char| codes[char] }.join, huffman_tree: huffman_tree }
   end
 
-  def decode(bits, huffman_tree)
+  def self.decode(bits, huffman_tree)
     text = ""
     cur_node = huffman_tree
     bits.each_char do |bit|
@@ -33,15 +33,13 @@ module Huffify
     text
   end
 
-  private
-
-  def create_occurrences_map(text)
+  private_class_method def self.create_occurrences_map(text)
     occurrences_map = Hash.new(0)
     text.each_char { |char| occurrences_map[char] += 1 }
     occurrences_map
   end
 
-  def build_huffman_tree(text)
+  private_class_method def self.build_huffman_tree(text)
     occurrences_map = create_occurrences_map(text)
     pq = PQueue.new { |a, b| a.frequency < b.frequency }
     occurrences_map.each { |char, count| pq.push(HuffNode.new(char, count)) }
@@ -52,7 +50,7 @@ module Huffify
     pq.pop
   end
 
-  def get_char_codes(node, code = '', codes = {})
+  private_class_method def self.get_char_codes(node, code = '', codes = {})
     if node.char
       codes[node.char] = code
     else

data/sig/huffify.rbs

@@ -1,14 +1,14 @@
 module Huffify
   VERSION: String
 
-  def encode: (String text) -> Hash[Symbol, HuffNode | String]
-  def decode: (String bits, HuffNode tree) -> String
+  def self.encode: (String text) -> Hash[Symbol, HuffNode | String]
+  def self.decode: (String bits, HuffNode tree) -> String
 
   private
 
-  def build_huffman_tree: (String text) -> HuffNode
+  def self.build_huffman_tree: (String text) -> HuffNode
 
-  def create_occurrences_map: (String text) -> Hash[String, Integer]
+  def self.create_occurrences_map: (String text) -> Hash[String, Integer]
 
-  def get_char_codes: (HuffNode node, String code, Hash[String, String]) -> Hash[String, String]
+  def self.get_char_codes: (HuffNode node, String code, Hash[String, String]) -> Hash[String, String]
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: huffify
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.2
 platform: ruby
 authors:
 - Ivan Mihun