linked_list_sourav 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 250fa17879a124ffde4d0c9929c735935429634f
-  data.tar.gz: b73428291b8d8b7e84835e76fa70a6a9343d09c7
+  metadata.gz: 73798711cb8b3dddf2ccc745a35f01634a4c60e9
+  data.tar.gz: 8da362213deac7a2f8fcc49715182d1c2087d143
 SHA512:
-  metadata.gz: 579307e133e1b39b1504c9446636b1dfb0f8a7626d21464575fd2cd3010976e8ecd1fe1dba82c479820b56ce6fa51d32cae5983fd820ac538d4adc396760bcfd
-  data.tar.gz: 5daaf83963d4960fcf175ca430080b551bb0bb67381538609f6837cc061ce682abfa4acf8538a163c40140e9ad022129d5d3bd4223678dc8956620e8ab353ecf
+  metadata.gz: 3b8dd19371b3ee566c1cf771b8d250c590a03e8364d0050a7302b54a74515822ab1494f235c6a86369e6cf8d662929902989a363b00a59351b9b7360ff90c71a
+  data.tar.gz: 821099f6fdaa2cc1c01fadcdedc1486d27ea9db55fc817f71ab7baab92351a78349a8bb87e82b963293417cbfb18b139caaa212ad2c1fc60cb8a66b20ec89fe3

data/lib/linked_list.rb

@@ -13,13 +13,22 @@ module LinkedList
     end
   end
 
+  class DoublyNode
+    attr_accessor :data, :backward, :forward
+    def initialize(data, backward=nil, forward=nil)
+      @data = data
+      @backward = backward
+      @forward = forward
+    end
+  end
+
   class Singly
     def initialize(data) # constructor
       if data.class == Array
         @head = Node.new(data[0])
         data.each.with_index { |datum, index| self.add(datum) if index > 0}
       else
-        @head = Node.new(data[0])
+        @head = Node.new(data)
       end
       self
     end
@@ -53,7 +62,7 @@ module LinkedList
       self
     end
 
-    def add_a(data)
+    def add_a(data) # adds array members to the list
       node = @head
       while (node.pointer != nil)
         node = node.pointer
@@ -111,4 +120,77 @@ module LinkedList
       deleted_node = nil
     end
   end
+
+  class Doubly
+    def initialize(data)
+      if data.respond_to? :each
+        @head = DoublyNode.new(data[0])
+        data.each.with_index { |datum, index| self.add(datum) if index > 0}
+      else
+        @head = DoublyNode.new(data)
+      end
+      self
+    end
+
+    def add(data) # adds data to list
+      dnode = @head
+      while (dnode.forward != nil)
+        dnode = dnode.forward
+      end
+      dnode.forward = DoublyNode.new(data, dnode)
+      self
+    end
+
+    def head #returns head
+      @head
+    end
+
+    def parse # parses all the members
+      dnode = @head
+      while (dnode != nil)
+        puts dnode.data
+        dnode = dnode.forward
+      end
+    end
+
+    def to_a
+      dnode = @head
+      array = Array.new
+      while (dnode != nil)
+        array << dnode.data
+        dnode = dnode.forward
+      end
+      array
+    end
+
+    def to_s
+      dnode = @head
+      string = String.new(@head.data.to_s)
+      dnode = dnode.forward
+      while (dnode != nil)
+        string << ", " << dnode.data.to_s
+        dnode = dnode.forward
+      end
+      string
+    end
+
+    def find(data)
+      dnode = @head
+      while (dnode != nil && dnode.data != data )
+        dnode = dnode.forward
+      end
+      dnode
+    end
+
+    def delete(data)
+      dnode = find(data)
+      if dnode
+        dnode1 = dnode.backward
+        dnode2 = dnode.forward
+        dnode1.forward = dnode2
+        dnode2.backward = dnode1
+      end
+    end
+
+  end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: linked_list_sourav
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - Sourav Moitra