algorithmable 0.10.0 → 0.11.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e0f425945316b488e5f78067168f54dd56415392
-  data.tar.gz: c9dd9353cf0883de156a9860472d18233c227ea2
+  metadata.gz: 23dff715f8d8ae5e91a4e738ec6fe52f9da12fe7
+  data.tar.gz: dbfa9eb077c85ba9957f10edbb99513e793ca495
 SHA512:
-  metadata.gz: 6fd0bb3ef1d1f3fe956aaa0fce478fcd1dc474d54b02ea86619802873ab620d181f3e49c7fefaf86c805fdd917f69e00d5a2e6f50f5971d97afb2462a91d62af
-  data.tar.gz: 5bdbf61cfb48f980c4d3d3721b7fc48a3f2c6aa26a249753b27bae965e83b41886855cbdae5e5b5904cbc621a3ee03456b826ee0e9345c1b59e338340dee923e
+  metadata.gz: d5a1aedb5222032d612c3037a91c94c303a1f4cfe955d752b97d6e4543d210f444fc5d01a203fe60c91dd969f4ed453a8e7bc5055264906bbbc062fc51f6ab4d
+  data.tar.gz: 784476ad38e96e828f2360f6272ab4d7b2b9d176446183257592d9595cdf769c85f59994a6ce23437537acd9ad1620f7c02b299fea43fcda3a7a648916d4ec6d

data/README.md

@@ -2,8 +2,8 @@
 
 # Algorithmable
 
-Useful algorithms such as Sorting Strategies, Searches and Data Structures such as symbol tables, binary search tree BST, red black tree RBT, 
-hash tables, bag, linked list, deque, queue FIFO, stack LIFO, graphs & Graph Traversal strategies for everyday usage. 
+Useful algorithms such as Sorting Strategies, Searches and Data Structures such as Priority Queues, Symbol Tables, Binary Search Tree BST, Red Black tree RBT,
+Hash Tables, Bag, Linked List, Deque, Queue (FIFO), Stack (LIFO), Graphs & Graph Traversal strategies for everyday usage.
 
 Algorithms and Data Structures implemented using Ruby, for fun.
 
@@ -17,6 +17,8 @@ Library also contains solutions for several puzzles solved by implemented algori
 - Queue (FIFO)
 - Stack (LIFO)
 - Ordered Symbol Table BST. Implementation using Unbalanced Binary Search Tree.
+- Minimum Priority Queue
+- Maximum Priority Queue
 
 ## Graphs
 
@@ -35,11 +37,16 @@ Library also contains solutions for several puzzles solved by implemented algori
 
 - Bubble sort
 - Merge sort
-- Heapsort ( Binary Heap )
+- Heaport ( Binary Heap )
+
+## Algorithms
+
+- Levenshtein Distance algorithm (http://www.levenshtein.net)
+- Lawrence Philips' Metaphone Algorithm (http://aspell.net/metaphone)
 
 # Usage
 
-It is always better to check unit tests in order to understand how things going on. 
+It is always better to check unit tests in order to understand how things going on.
 Most of the components are encapsulated through the factory methods, so the are could be mixed to other objects.
 
 ## Installation
@@ -65,4 +72,3 @@ Bug reports and pull requests are welcome on GitHub at https://github.com/rlisht
 ## License
 
 The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
-

data/lib/algorithmable/data_structs/heap/imp.rb

@@ -0,0 +1,87 @@
+module Algorithmable
+  module DataStructs
+    module Heap
+      class Imp
+        attr_reader :size
+
+        def initialize(collection = [], &block)
+          @comparison_function = block || -> (this, other) { (this <=> other) < 0 }
+          @queue = []
+          @size = 0
+          collection.each do |item|
+            enqueue item
+          end
+        end
+
+        def empty?
+          !@size.nonzero?
+        end
+
+        def enqueue(key)
+          @size = @size.next
+          @queue[@size] = key
+          swim @size
+          maintain_heap_invariant!
+        end
+
+        def dequeue
+          return if empty?
+          maximum = @queue[1]
+          exchange 1, @size
+          @size = @size.pred
+          sink 1
+          @queue[@size.next] = nil
+          maintain_heap_invariant!
+          maximum
+        end
+
+        def peek
+          return if empty?
+          @queue[1]
+        end
+
+        private
+
+        def exchange(this, other)
+          swap = @queue[this]
+          @queue[this] = @queue[other]
+          @queue[other] = swap
+        end
+
+        def maintain_heap_invariant!
+          fail "Heap is not invariant now: #{inspect}!" unless assert_heap_invariant(1)
+        end
+
+        def assert_heap_invariant(index)
+          return true if index > @size
+          left = 2 * index
+          right = 2 * index + 1
+          return false if left <= @size && agreed(index, left)
+          return false if right <= @size && agreed(index, right)
+          assert_heap_invariant(left) && assert_heap_invariant(right)
+        end
+
+        def swim(index)
+          while index > 1 && agreed(index / 2, index)
+            exchange(index, index / 2)
+            index /= 2
+          end
+        end
+
+        def agreed(this, that)
+          @comparison_function.call(@queue[this], @queue[that])
+        end
+
+        def sink(index)
+          while 2 * index <= @size
+            temp_index = 2 * index
+            temp_index = temp_index.next if temp_index < @size && agreed(temp_index, temp_index.next)
+            break unless agreed(index, temp_index)
+            exchange(index, temp_index)
+            index = temp_index
+          end
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/data_structs/heap/max.rb

@@ -0,0 +1,13 @@
+module Algorithmable
+  module DataStructs
+    module Heap
+      class Max < Imp
+        def initialize(collection = [])
+          super(collection) do |this, other|
+            (this <=> other) < 0
+          end
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/data_structs/heap/min.rb

@@ -0,0 +1,13 @@
+module Algorithmable
+  module DataStructs
+    module Heap
+      class Min < Imp
+        def initialize(collection = [])
+          super(collection) do |this, other|
+            (this <=> other) > 0
+          end
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/data_structs/heap.rb

@@ -0,0 +1,10 @@
+module Algorithmable
+  module DataStructs
+    module Heap
+      autoload :Imp, 'algorithmable/data_structs/heap/imp'
+      autoload :Max, 'algorithmable/data_structs/heap/max'
+      autoload :Min, 'algorithmable/data_structs/heap/min'
+      private_constant :Imp
+    end
+  end
+end

data/lib/algorithmable/data_structs.rb

@@ -6,6 +6,7 @@ module Algorithmable
     autoload :Queue, 'algorithmable/data_structs/queue'
     autoload :Stack, 'algorithmable/data_structs/stack'
     autoload :OrderedSymbolTable, 'algorithmable/data_structs/ordered_symbol_table'
+    autoload :Heap, 'algorithmable/data_structs/heap'
 
     def new_bag
       Bag.new
@@ -26,5 +27,17 @@ module Algorithmable
     def new_ordered_symbol_table(key_type, value_type)
       OrderedSymbolTable.new(key_type, value_type)
     end
+
+    def new_max_priority_heap(collection = [])
+      Heap::Max.new(collection)
+    end
+
+    alias_method :new_max_priority_queue, :new_max_priority_heap
+
+    def new_min_priority_heap(collection = [])
+      Heap::Min.new(collection)
+    end
+
+    alias_method :new_min_priority_queue, :new_min_priority_heap
   end
 end

data/lib/algorithmable/sort/binary_heap.rb

@@ -1,22 +1,20 @@
 module Algorithmable
   module Sort
     class BinaryHeap
-      def self.sort(collection)
-        new.sort(collection)
-      end
+      include Algorithmable::DataStructs
 
-      def sort(collection)
-        fail NotImplementedError, collection
+      def self.sort(collection)
+        new(collection).sort
       end
 
-      private
-
-      def swim(node)
-        fail NotImplementedError, node
+      def initialize(collection = [])
+        @heap = new_min_priority_heap collection
       end
 
-      def sink(node)
-        fail NotImplementedError, node
+      def sort
+        [].tap do |result|
+          result << @heap.dequeue until @heap.empty?
+        end
       end
     end
   end

data/lib/algorithmable/sort.rb

@@ -12,6 +12,10 @@ module Algorithmable
       def bubble(collection)
         Bubble.sort(collection)
       end
+
+      def binary_heap(collection)
+        BinaryHeap.sort(collection)
+      end
     end
   end
 end

data/lib/algorithmable/version.rb

@@ -1,3 +1,3 @@
 module Algorithmable
-  VERSION = '0.10.0'
+  VERSION = '0.11.0'
 end

data/lib/algorithmable.rb

@@ -11,6 +11,7 @@ module Algorithmable
   autoload :DataStructs, 'algorithmable/data_structs'
   autoload :Graphs, 'algorithmable/graphs'
   autoload :Puzzles, 'algorithmable/puzzles'
+  autoload :LevenshteinDistance, 'algorithmable/levenshtein_distance'
 
   class << self
     def logger

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithmable
 version: !ruby/object:Gem::Version
-  version: 0.10.0
+  version: 0.11.0
 platform: ruby
 authors:
 - Roman Lishtaba
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-01-10 00:00:00.000000000 Z
+date: 2016-01-11 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -143,6 +143,10 @@ files:
 - lib/algorithmable/data_structs.rb
 - lib/algorithmable/data_structs/bag.rb
 - lib/algorithmable/data_structs/deque.rb
+- lib/algorithmable/data_structs/heap.rb
+- lib/algorithmable/data_structs/heap/imp.rb
+- lib/algorithmable/data_structs/heap/max.rb
+- lib/algorithmable/data_structs/heap/min.rb
 - lib/algorithmable/data_structs/linked_list.rb
 - lib/algorithmable/data_structs/ordered_symbol_table.rb
 - lib/algorithmable/data_structs/queue.rb