ds_algo 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 82c505780e91d3c5d225f980a86ca89b808ee40b69a87e83abcc8f6df49705d3
-  data.tar.gz: a20a2f40bb4379a27f93ba4159e3b4cb50edc0f1a2e607980fb71b3199e0d0f2
+  metadata.gz: e3c1d14669980be5c2cd68fe505c7b3aa8f3e4b8e300bb3ec8d428adaa631529
+  data.tar.gz: 805e016b98d8266edc71b45e4c0d143fbdda494d4df49595cd357d94be391968
 SHA512:
-  metadata.gz: 45c27cdc89faabf7be5361e4fb465c5723744829b2029fc1144197e5fae04f27a922f1492f771b523b94c8f95285ffcdc19fd584d54f17ecae3590294213d832
-  data.tar.gz: 737eef7464aad01d508905a7cadd2185e34483475c8465ac23ae30194dce1d9886d7349ff8fc68318eba76f1a8058fda89d8304c39ecff08ab83946667d4ba27
+  metadata.gz: c4a9064e64336177c063051a46abf14a170f12a066d354ad20f03b9b4bcb2b237439a5261390bd47c683f37a06b098d69b28017f19004dfa26cbf0d0bb58e6da
+  data.tar.gz: 4b77c762d047d4505bfa6f8c0bfd79518d1dfded2a74484df8daaaef781ec0b275a980dd76cc16333a62f2afdfa6e3d4f6d97ac0d79fd097ae8adc106ea09ba4

data/lib/data_struct/linked_list.rb

@@ -1,118 +1,225 @@
 # frozen_string_literal: true
 
 # lib/data_struct/linked_list.rb
-class SNode
-  attr_accessor :data, :next_val
-  def initialize(data, next_val = nil)
-    @data = data
-    @next_val = next_val
-  end
-end
 
-class DNode
-  attr_accessor :data, :next_val, :pre_val
-  def initialize(data, next_val = nil, pre_val = nil)
-    @data = data
-    @next_val = next_val
-    @pre_val = pre_val
+module LinkedList
+  class SinglyNode
+    attr_accessor :data, :next_val
+    def initialize(data, next_val = nil)
+      @data = data
+      @next_val = next_val
+    end
   end
-end
 
-class LinkedList
-  attr_accessor :head, :length
-  def initialize
-    @head = nil
-    @length = 0
+  class DoublyNode
+    attr_accessor :data, :next_val, :pre_val
+    def initialize(data, pre_val = nil, next_val = nil)
+      @data = data
+      @next_val = next_val
+      @pre_val = pre_val
+    end
   end
 
-  def shift(val)
-    in_length
-    @head = SNode.new val, @head
-  end
+  class Singly
+    attr_reader :head, :length
+    def initialize
+      @head = nil
+      @length = 0
+    end
+
+    def shift(val)
+      in_length
+      @head = SinglyNode.new val, @head
+    end
 
-  def push(val)
-    in_length
-    return @head = SNode.new(val) if @head.nil?
+    def push(val)
+      in_length
+      return @head = SinglyNode.new(val) if @head.nil?
 
-    node = @head
-    (@length - 2).times do
-      node = node.next_val
+      node = @head
+      (@length - 2).times do
+        node = node.next_val
+      end
+      node.next_val = SinglyNode.new val
     end
-    node.next_val = SNode.new val
-  end
 
-  def pop
-    node = @head
-    if @length.zero?
-      raise 'Error: List is empty'
-    else
-      de_length
+    def pop
+      node = @head
+      if @length.zero?
+        raise 'Error: List is empty'
+      else
+        de_length
+        (@length - 1).times do
+          node = node.next_val
+        end
+        node.next_val = nil
+      end
+
+      @head
+    end
+
+    def to_s
+      node = @head
+      str = ''
       (@length - 1).times do
+        str += "#{node.data} "
         node = node.next_val
       end
-      node.next_val = nil
+      str
     end
 
-    @head
-  end
+    def to_a
+      node = @head
+      arr = []
+      @length.times do
+        arr << node.data
+        node = node.next_val
+      end
+      arr
+    end
 
-  def to_s
-    node = @head
-    str = ''
-    (@length - 1).times do
-      str += "#{node.data} "
-      node = node.next_val
+    def each
+      node = @head
+      arr = []
+      @length.times do
+        arr << yield(node.data)
+        node = node.next_val
+      end
+      arr
     end
-    str
-  end
 
-  def to_a
-    node = @head
-    arr = []
-    @length.times do
-      arr << node.data
-      node = node.next_val
+    def index(index_val)
+      raise 'index value higher than current length of list' if @length - 1 < index_val
+
+      node = @head
+      index_val.times do
+        node = node.next_val
+      end
+      node.data
     end
-    arr
-  end
 
-  def each
-    node = @head
-    arr = []
-    @length.times do
-      arr << yield(node.data)
-      node = node.next_val
+    def index_of(val)
+      node = @head
+      @length.times do
+        return node.data if node.data == val
+
+        node = node.next_val
+      end
+      raise 'value not found'
     end
-    arr
-  end
 
-  def index(index_val)
-    raise 'index value higher than current length of list' if @length - 1 < index_val
+    private
 
-    node = @head
-    index_val.times do
-      node = node.next_val
+    def in_length
+      @length += 1
+    end
+
+    def de_length
+      @length -= 1
     end
-    node.data
   end
 
-  def index_of(val)
-    node = @head
-    @length.times do
-      return node.data if node.data == val
+  class Doubly
+    attr_reader :head, :length
+    def initialize
+      @head = nil
+      @length = 0
+    end
+
+    def shift(val)
+      in_length
+      return @head = DoublyNode.new(val) if @head.nil?
 
-      node = node.next_val
+      new_head = DoublyNode.new val, nil, @head
+      @head.pre_val = new_head
+      @head = new_head
     end
-    raise 'value not found'
-  end
 
-  private
+    def push(val)
+      in_length
+      return @head = DoublyNode.new(val) if @head.nil?
 
-  def in_length
-    @length += 1
-  end
+      node = @head
+      (@length - 2).times do
+        node = node.next_val
+      end
+      node.next_val = DoublyNode.new val
+      node.next_val.pre_val = node
+    end
+
+    def pop
+      node = @head
+      if @length.zero?
+        raise 'Error: List is empty'
+      else
+        de_length
+        (@length - 1).times do
+          node = node.next_val
+        end
+        node.next_val = nil
+      end
+
+      @head
+    end
+
+    def to_s
+      node = @head
+      str = ''
+      (@length - 1).times do
+        str += "#{node.data} "
+        node = node.next_val
+      end
+      str
+    end
 
-  def de_length
-    @length -= 1
+    def to_a
+      node = @head
+      arr = []
+      @length.times do
+        arr << node.data
+        node = node.next_val
+      end
+      arr
+    end
+
+    def each
+      node = @head
+      arr = []
+      @length.times do
+        arr << yield(node.data)
+        node = node.next_val
+      end
+      arr
+    end
+
+    def index(index_val)
+      raise 'index value higher than current length of list' if @length - 1 < index_val
+
+      node = @head
+      index_val.times do
+        node = node.next_val
+      end
+      node.data
+    end
+
+    def index_of(val)
+      node = @head
+      @length.times do
+        return node.data if node.data == val
+
+        node = node.next_val
+      end
+      raise 'value not found'
+    end
+
+    private
+
+    def in_length
+      @length += 1
+    end
+
+    def de_length
+      @length -= 1
+    end
   end
 end

data/lib/data_struct/queue.rb

@@ -0,0 +1,45 @@
+# frozen_string_literal: true
+
+class Queue
+  attr_reader :length
+  def initialize
+    @queue = []
+    @length = 0
+  end
+
+  def in(val)
+    in_length
+    @queue.push val
+  end
+
+  def out
+    de_length
+    @queue.shift
+  end
+
+  def front
+    @queue[0]
+  end
+
+  def last
+    @queue[-1]
+  end
+
+  def empty?
+    @queue.empty?
+  end
+
+  def to_a
+    @queue
+  end
+
+  private
+
+  def in_length
+    @length += 1
+  end
+
+  def de_length
+    @length -= 1
+  end
+end

data/lib/data_struct/stack.rb

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+class Stack
+  attr_reader :length
+  def initialize
+    @stack = []
+    @length = 0
+  end
+
+  def push(val)
+    in_length
+    @stack.push val
+  end
+
+  def pop
+    de_length
+    @stack.pop
+  end
+
+  def top
+    @stack[-1]
+  end
+
+  def empty?
+    @stack.empty?
+  end
+
+  def to_a
+    @stack
+  end
+
+  private
+
+  def in_length
+    @length += 1
+  end
+
+  def de_length
+    @length -= 1
+  end
+end

data/lib/ds_algo.rb

@@ -0,0 +1,21 @@
+# frozen_string_literal: true
+
+class DsAlgo
+  def ds_eff?
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '|                          Efficency table for DsAlgo                               |'
+    puts '|                                                                                   |'
+    puts '|                        B- Begining, M- Middle,  E- End                            |'
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '| Type         |  Indexing  |  Insert/Delete B|  Insert/Delete E|  Insert/Delete M  |'
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '|Linked list(S)|     O(n)  |       O(1)      |       O(1)      | search time+O(1)   |'
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '|Linked list(D)|     O(n)  |       O(1)      |       O(1)      | search time+O(1)   |'
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '|   Stack      |     nil   |        nil      |       O(1)      |        nil         |'
+    puts '+-----------------------------------------------------------------------------------+'
+    puts '|   Queue      |     nil   |        O(1)     |       O(1)      |        nil         |'
+    puts '+-----------------------------------------------------------------------------------+'
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: ds_algo
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - imhtapm
@@ -11,13 +11,16 @@ cert_chain: []
 date: 2019-07-27 00:00:00.000000000 Z
 dependencies: []
 description: collection of data structures and algorithms for learning and to build
-  (under development
+  (under development)
 email: imhtapm@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/data_struct/linked_list.rb
+- lib/data_struct/queue.rb
+- lib/data_struct/stack.rb
+- lib/ds_algo.rb
 homepage: https://rubygems.org/gems/ds_algo
 licenses:
 - MIT