algorithmable 0.6.0 → 0.7.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 40e70c3fb85f8914dade38055945669ecaf6f950
-  data.tar.gz: 57c983790d111dd5169bdaae1a60070766773808
+  metadata.gz: 2ae7569f2df39cfefa86f0a46fafd1e1b91199d3
+  data.tar.gz: ebb4364c7e699846eef95bd47e09c26b8dc721f2
 SHA512:
-  metadata.gz: 7312c04abd0f47c2ee93bcfd1cbeecb6d96b81f0f7de1ca7c39ed23ab6e7826271bade36144de05c71308db96347807576706283582aa8e97b085e5b19ebc6b8
-  data.tar.gz: 33efeca966f560372813d7397474184cf1be1839e6f4d2a76f7b79bc50fd6e3e3ae993121afc1111f678b28c552c1827ed58ccd104b5c8508900ccc7107f460b
+  metadata.gz: 7cae4039f94a406279f630ece5f363e05f9dd9c406152e9b19fdcf8adedf427a9ad8c21a569ba14a44f0e909c1980249e7d907b25e592c8129db10135f9797b8
+  data.tar.gz: e2827ed66df194ee618724277b55c986c371dd8cd638632ccff264b3a81bb3853c1aa935cf7811ade5fa20aee47c65cbf2060d5a79c215d288f469fd322e4108

data/lib/algorithmable/data_structs/bag.rb

@@ -24,8 +24,6 @@ module Algorithmable
         @head.each(&block) if @head
       end
 
-      private
-
       class Node
         attr_accessor :succ, :item
 

data/lib/algorithmable/data_structs/deque.rb

@@ -0,0 +1,112 @@
+module Algorithmable
+  module DataStructs
+    class Deque
+      include Enumerable
+      include Algorithmable::Errors
+
+      Node = Struct.new(:prev, :next, :item)
+      attr_reader :size
+
+      def initialize(collection = [])
+        @front = nil
+        @back = nil
+        @size = 0
+        collection.each { |item| push_back(item) }
+      end
+
+      def empty?
+        0 == size
+      end
+
+      def clear
+        @front = nil
+        @back = nil
+        @size = 0
+      end
+
+      def peek_front
+        @front && @front.item
+      end
+
+      def peek_back
+        @back && @back.item
+      end
+
+      def push_front(obj)
+        node = Node.new(nil, nil, obj)
+        if @front
+          node.next = @front
+          @front.prev = node
+          @front = node
+        else
+          @front = node
+          @back = @front
+        end
+        @size += 1
+        obj
+      end
+
+      def push_back(obj)
+        node = Node.new(nil, nil, obj)
+        if @back
+          node.prev = @back
+          @back.next = node
+          @back = node
+        else
+          @front = node
+          @back = @front
+        end
+        @size += 1
+        obj
+      end
+
+      def pop_front
+        fail NoSuchElementError unless @front
+        node = @front
+        if 1 == @size
+          clear
+          return node.item
+        else
+          @front.next.prev = nil
+          @front = @front.next
+        end
+        @size -= 1
+        node.item
+      end
+
+      def pop_back
+        fail NoSuchElementError unless @back
+        node = @back
+        if @size == 1
+          clear
+          return node.item
+        else
+          @back.prev.next = nil
+          @back = @back.prev
+        end
+        @size -= 1
+        node.item
+      end
+
+      # represent fifo iterator
+      def each
+        return unless @front
+        node = @front
+        while node
+          yield node.item
+          node = node.next
+        end
+      end
+
+      # represent lifo iterator
+      def reverse_each
+        return unless @back
+        node = @back
+        while node
+          yield node.item
+          node = node.prev
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/data_structs/linked_list.rb

@@ -1,11 +1,99 @@
 module Algorithmable
   module DataStructs
-    module LinkedList
-      autoload :Node, 'algorithmable/data_structs/linked_list/node'
-      autoload :Impl, 'algorithmable/data_structs/linked_list/impl'
+    class LinkedList
+      include Enumerable
+      attr_reader :length
 
-      def self.new
-        Impl.new
+      def initialize
+        @head = nil
+        @tail = nil
+        @length = 0
+        @op_counter = 0
+      end
+
+      def unshift(data)
+        link_head_node data
+      end
+
+      def push(data)
+        link_tail_node data
+      end
+
+      def first
+        @head ? @head.dup : fail_index_error
+      end
+
+      def last
+        @tail ? @tail.dup : fail_index_error
+      end
+
+      def each(&block)
+        next_node = @head
+        nodes = []
+        while next_node
+          nodes << next_node
+          next_node = next_node.succ
+        end
+        nodes.each(&block)
+      end
+
+      private
+
+      def link_head_node(data)
+        prev_head = @head
+        node = make_node data, nil, prev_head
+        @head = node
+
+        if prev_head
+          prev_head.pred = node
+        else
+          @tail = node
+        end
+
+        bump_length!
+        bump_op_counter!
+      end
+
+      def link_tail_node(data)
+        prev_tail = @tail
+        node = make_node data, prev_tail, nil
+        @tail = node
+
+        if prev_tail
+          prev_tail.succ = node
+        else
+          @head = node
+        end
+
+        bump_length!
+        bump_op_counter!
+      end
+
+      def make_node(data, pred = nil, succ = nil)
+        Node.new data, pred, succ
+      end
+
+      def bump_length!
+        @length = @length.next
+      end
+
+      def bump_op_counter!
+        @op_counter = @op_counter.next
+      end
+
+      def fail_index_error(message = nil)
+        fail IndexError, message
+      end
+
+      class Node
+        attr_accessor :pred, :succ
+        attr_reader :data
+
+        def initialize(data, pred = nil, succ = nil)
+          @data = data
+          @pred = pred
+          @succ = succ
+        end
       end
     end
   end

data/lib/algorithmable/data_structs/queue.rb

@@ -1,84 +1,28 @@
-require 'monitor'
-
 module Algorithmable
   module DataStructs
     class Queue
+      include Algorithmable::Errors
       include Enumerable
-      include MonitorMixin
-      attr_reader :size
-
-      SEPARATOR = ':'
+      extend Forwardable
 
-      NoSuchElementError = Class.new(RuntimeError)
-
-      def initialize
-        @first = nil
-        @last = nil
-        @size = 0
-        super
-      end
+      def_delegators :@imp, :empty?, :size, :each
 
-      def empty?
-        !@size.nonzero?
+      def initialize(collection = [])
+        @imp = Deque.new collection
       end
 
       def peek
-        synchronize do
-          fail NoSuchElementError if empty?
-          @first.item
-        end
+        peek_value = @imp.peek_front
+        fail NoSuchElementError unless peek_value
+        peek_value
       end
 
       def enqueue(item)
-        synchronize do
-          old_last = @last
-          @last = Node.new item
-          @last.succ = nil
-          @first = @last if empty?
-          old_last.succ = @last unless empty?
-          @size = @size.next
-        end
+        @imp.push_back(item)
       end
 
       def dequeue
-        synchronize do
-          fail NoSuchElementError if empty?
-          item = @first.item
-          @first = @first.succ
-          @size = @size.pred
-          @last = nil if empty?
-          item
-        end
-      end
-
-      def to_s
-        synchronize do
-          to_a.join SEPARATOR
-        end
-      end
-
-      def each(&block)
-        synchronize do
-          (@first || []).each(&block)
-        end
-      end
-
-      class Node
-        attr_accessor :succ, :item
-
-        def initialize(item)
-          @item = item
-          @succ = nil
-        end
-
-        def to_s
-          @item.to_s
-        end
-
-        def each(&block)
-          yield self
-          @succ.each(&block) if @succ
-        end
+        @imp.pop_front
       end
     end
   end

data/lib/algorithmable/data_structs/stack.rb

@@ -0,0 +1,30 @@
+module Algorithmable
+  module DataStructs
+    class Stack
+      include Algorithmable::Errors
+      include Enumerable
+      extend Forwardable
+
+      def_delegators :@imp, :empty?, :size, :each
+
+      def initialize(collection = [])
+        @imp = Deque.new
+        collection.each { |item| @imp.push_front item }
+      end
+
+      def peek
+        peek_value = @imp.peek_front
+        fail NoSuchElementError unless peek_value
+        peek_value
+      end
+
+      def push(item)
+        @imp.push_front(item)
+      end
+
+      def pop
+        @imp.pop_front
+      end
+    end
+  end
+end

data/lib/algorithmable/data_structs.rb

@@ -1,13 +1,25 @@
 module Algorithmable
   module DataStructs
+    autoload :Deque, 'algorithmable/data_structs/deque'
     autoload :Bag, 'algorithmable/data_structs/bag'
     autoload :LinkedList, 'algorithmable/data_structs/linked_list'
     autoload :Queue, 'algorithmable/data_structs/queue'
+    autoload :Stack, 'algorithmable/data_structs/stack'
 
-    class << self
-      def new_bag
-        Bag.new
-      end
+    def new_bag
+      Bag.new
+    end
+
+    def new_linked_list
+      LinkedList.new
+    end
+
+    def new_fifo_queue
+      Queue.new
+    end
+
+    def new_lifo_queue
+      Stack.new
     end
   end
 end

data/lib/algorithmable/errors.rb

@@ -0,0 +1,5 @@
+module Algorithmable
+  module Errors
+    NoSuchElementError = Class.new(RuntimeError)
+  end
+end

data/lib/algorithmable/graphs/traversals/breadth_first.rb

@@ -38,11 +38,10 @@ module Algorithmable
           until queue.empty?
             next_vertex = queue.deq
             graph.adjacency(next_vertex).each do |neighbour_vertex|
-              unless visited? neighbour_vertex
-                @edge_to[neighbour_vertex] = next_vertex
-                @visited[neighbour_vertex] = true
-                queue.enq neighbour_vertex
-              end
+              next if visited? neighbour_vertex
+              @edge_to[neighbour_vertex] = next_vertex
+              @visited[neighbour_vertex] = true
+              queue.enq neighbour_vertex
             end
           end
         end

data/lib/algorithmable/graphs/undirected.rb

@@ -27,7 +27,7 @@ module Algorithmable
       end
 
       def degree(vertex)
-        raise "Vertex #{vertex} is not valid." unless valid_vertex?(vertex)
+        fail "Vertex #{vertex} is not valid." unless valid_vertex?(vertex)
         adjacency(vertex).size
       end
 

data/lib/algorithmable/puzzles/dijkstras_two_stacks.rb

@@ -0,0 +1,50 @@
+module Algorithmable
+  module Puzzles
+    class DijkstrasTwoStacks
+      include Algorithmable::DataStructs
+
+      MATH_OPS = %w(sqrt cos sin tan atan2 log log2 log10)
+      ARITHMETICAL_OPS = %w(+ - * /)
+      OPS = ARITHMETICAL_OPS + MATH_OPS
+      OPEN_EXP = '('
+      CLOSE_EXP = ')'
+
+      def initialize(expression)
+        @expression = expression
+      end
+
+      def solve
+        operations = new_lifo_queue
+        values = new_lifo_queue
+        parse_expression(operations, values)
+        values.pop
+      end
+
+      private
+
+      def parse_expression(operations, values)
+        @expression.split.each do |char|
+          if OPEN_EXP == char
+            # noop
+          elsif OPS.include?(char)
+            operations.push char
+          elsif CLOSE_EXP == char
+            operation = operations.pop
+            value = values.pop
+            compute operation, value, values
+          else
+            values.push Float(char)
+          end
+        end
+      end
+
+      def compute(operation, value, values_stack)
+        if MATH_OPS.include? operation
+          values_stack.push Math.send(operation, value)
+        else
+          values_stack.push values_stack.pop.send(operation, value)
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/puzzles/josephus_problem.rb

@@ -0,0 +1,25 @@
+module Algorithmable
+  module Puzzles
+    class JosephusProblem
+      include Algorithmable::DataStructs
+
+      def initialize(prisoners, every)
+        @prisoners = prisoners
+        @every = every
+      end
+
+      def solve
+        queue = new_fifo_queue
+        @prisoners.times { |item| queue.enqueue(item) }
+        positions = []
+        until queue.empty?
+          (@every - 1).times do
+            queue.enqueue queue.dequeue
+          end
+          positions << queue.dequeue
+        end
+        positions
+      end
+    end
+  end
+end

data/lib/algorithmable/puzzles.rb

@@ -0,0 +1,10 @@
+module Algorithmable
+  module Puzzles
+    autoload :JosephusProblem, 'algorithmable/puzzles/josephus_problem'
+    autoload :DijkstrasTwoStacks, 'algorithmable/puzzles/dijkstras_two_stacks'
+
+    def new_josephus_problem(prisoners, every)
+      JosephusProblem.new(prisoners, every)
+    end
+  end
+end

data/lib/algorithmable/sort/binary_heap.rb

@@ -0,0 +1,23 @@
+module Algorithmable
+  module Sort
+    class BinaryHeap
+      def self.sort(collection)
+        new.sort(collection)
+      end
+
+      def sort(collection)
+        fail NotImplementedError, collection
+      end
+
+      private
+
+      def swim(node)
+        fail NotImplementedError, node
+      end
+
+      def sink(node)
+        fail NotImplementedError, node
+      end
+    end
+  end
+end

data/lib/algorithmable/sort.rb

@@ -2,6 +2,7 @@ module Algorithmable
   module Sort
     autoload :Merge, 'algorithmable/sort/merge'
     autoload :Bubble, 'algorithmable/sort/bubble'
+    autoload :BinaryHeap, 'algorithmable/sort/binary_heap'
 
     class << self
       def merge(collection)

data/lib/algorithmable/version.rb

@@ -1,3 +1,3 @@
 module Algorithmable
-  VERSION = '0.6.0'
+  VERSION = '0.7.0'
 end

data/lib/algorithmable.rb

@@ -5,9 +5,11 @@ require 'pathname'
 require 'English'
 
 module Algorithmable
+  autoload :Errors, 'algorithmable/errors'
   autoload :Sort, 'algorithmable/sort'
   autoload :DataStructs, 'algorithmable/data_structs'
   autoload :Graphs, 'algorithmable/graphs'
+  autoload :Puzzles, 'algorithmable/puzzles'
 
   class << self
     def logger

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithmable
 version: !ruby/object:Gem::Version
-  version: 0.6.0
+  version: 0.7.0
 platform: ruby
 authors:
 - Roman Lishtaba
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-01-02 00:00:00.000000000 Z
+date: 2016-01-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -142,17 +142,22 @@ files:
 - lib/algorithmable.rb
 - lib/algorithmable/data_structs.rb
 - lib/algorithmable/data_structs/bag.rb
+- lib/algorithmable/data_structs/deque.rb
 - lib/algorithmable/data_structs/linked_list.rb
-- lib/algorithmable/data_structs/linked_list/impl.rb
-- lib/algorithmable/data_structs/linked_list/node.rb
 - lib/algorithmable/data_structs/queue.rb
+- lib/algorithmable/data_structs/stack.rb
+- lib/algorithmable/errors.rb
 - lib/algorithmable/graphs.rb
 - lib/algorithmable/graphs/traversals.rb
 - lib/algorithmable/graphs/traversals/breadth_first.rb
 - lib/algorithmable/graphs/traversals/depth_first.rb
 - lib/algorithmable/graphs/traversals/errors.rb
 - lib/algorithmable/graphs/undirected.rb
+- lib/algorithmable/puzzles.rb
+- lib/algorithmable/puzzles/dijkstras_two_stacks.rb
+- lib/algorithmable/puzzles/josephus_problem.rb
 - lib/algorithmable/sort.rb
+- lib/algorithmable/sort/binary_heap.rb
 - lib/algorithmable/sort/bubble.rb
 - lib/algorithmable/sort/merge.rb
 - lib/algorithmable/version.rb

data/lib/algorithmable/data_structs/linked_list/impl.rb

@@ -1,102 +0,0 @@
-module Algorithmable
-  module DataStructs
-    module LinkedList
-      class Impl
-        include Enumerable
-        attr_reader :length
-
-        def initialize
-          @head = nil
-          @tail = nil
-          @length = 0
-          @op_counter = 0
-        end
-
-        def unshift(data)
-          link_head_node data
-        end
-
-        def push(data)
-          link_tail_node data
-        end
-
-        def first
-          @head ? @head.dup : fail_index_error
-        end
-
-        def last
-          @tail ? @tail.dup : fail_index_error
-        end
-
-        def each(&block)
-          next_node = @head
-          nodes = []
-          while next_node
-            nodes << next_node
-            next_node = next_node.succ
-          end
-          nodes.each(&block)
-        end
-
-        private
-
-        def link_head_node(data)
-          prev_head = @head
-          node = make_node data, nil, prev_head
-          @head = node
-
-          if prev_head
-            prev_head.pred = node
-          else
-            @tail = node
-          end
-
-          bump_length!
-          bump_op_counter!
-        end
-
-        def link_tail_node(data)
-          prev_tail = @tail
-          node = make_node data, prev_tail, nil
-          @tail = node
-
-          if prev_tail
-            prev_tail.succ = node
-          else
-            @head = node
-          end
-
-          bump_length!
-          bump_op_counter!
-        end
-
-        def make_node(data, pred = nil, succ = nil)
-          Node.new data, pred, succ
-        end
-
-        def bump_length!
-          @length = @length.next
-        end
-
-        def bump_op_counter!
-          @op_counter = @op_counter.next
-        end
-
-        def fail_index_error(message = nil)
-          fail IndexError, message
-        end
-
-        class Node
-          attr_accessor :pred, :succ
-          attr_reader :data
-
-          def initialize(data, pred = nil, succ = nil)
-            @data = data
-            @pred = pred
-            @succ = succ
-          end
-        end
-      end
-    end
-  end
-end

data/lib/algorithmable/data_structs/linked_list/node.rb

@@ -1,7 +0,0 @@
-module Algorithmable
-  module DataStructs
-    module LinkedList
-
-    end
-  end
-end