linked_list_sourav 0.0.7 → 0.0.8

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: bda592acfd297e23be8184a753f0827f2a710bcc
-  data.tar.gz: 87937108038e98f019938939d50039ae939db847
+  metadata.gz: 97c3315a6b053758f70046f9b41f7763a81caf2e
+  data.tar.gz: 217b7391d54e4a031267a256014424dc5762ed8f
 SHA512:
-  metadata.gz: feed531a4eaabc6ea648cf162b2272167edf40719610240a5b10e0faf1cbae6d83cc439ee75520386b8438d2fa490cdc788ef072201361d164bf9a2775588413
-  data.tar.gz: c637dbf5ce5e9506dd326e568ab2ff469ee90023e976b3dc590af2a99ca0081f5d9bd6d5939be397e0c4aec4c8b09ff2ad1d90d5d256248873cc5c52a0724a0d
+  metadata.gz: 38f4e7db8d6da9aea93e5f5e3135851270cdf410cb1d0d424d6175d556efc68abde1ec9e0819d389f81df1f95fe0afa151c7b71fd0e3695a2964d124975dd650
+  data.tar.gz: 42655e960b8bf10fc9bcf1365825acfdf174b82718f52cb271824500730b06b563511b22cdd37e4ac57b2c25ba144510e6a0ff2ac5d3c9a09cdd896753bfe8ce

data/lib/linked_list.rb

@@ -1,15 +1,15 @@
 class LinkedList
 
   class Node # this class defines one node the basic building blog of linked list
-    attr_accessor :data, :pointer # data for holding data and pointers refers to next node
+    attr_accessor :data, :forward # data for holding data and forwards refers to next node
 
-    def initialize(data, pointer = nil) #intializes when new is invoked
+    def initialize(data, forward = nil) #intializes when new is invoked
       @data = data
-      @pointer = pointer
+      @forward = forward
     end
 
     def to_s
-      puts "Data: #{data} Points to: #{self.pointer.data}"
+      puts "Data: #{data} Points to: #{self.forward.data}"
     end
   end
 
@@ -41,31 +41,31 @@ class LinkedList
       node = @head
       while (node != nil)
         puts node.data
-        node = node.pointer
+        node = node.forward
       end
     end
 
     def find(data)
       node = @head
       while (node != nil && node.data != data )
-        node = node.pointer
+        node = node.forward
       end
       node
     end
 
     def add(data)  # adds new members
       node = @head
-      while (node.pointer != nil)
-        node = node.pointer
+      while (node.forward != nil)
+        node = node.forward
       end
-      node.pointer = Node.new(data)
+      node.forward = Node.new(data)
       self
     end
 
     def add_a(data) # adds array members to the list
       node = @head
-      while (node.pointer != nil)
-        node = node.pointer
+      while (node.forward != nil)
+        node = node.forward
       end
       if data.respond_to? :each
         data.each { |datum| self.add(datum)}
@@ -85,7 +85,7 @@ class LinkedList
       array = Array.new
       while (node != nil)
         array << node.data
-        node = node.pointer
+        node = node.forward
       end
       array
     end
@@ -93,10 +93,10 @@ class LinkedList
     def to_s # returns all data in form of string
       node = @head
       string = String.new(@head.data.to_s)
-      node = node.pointer
+      node = node.forward
       while (node != nil)
         string << ", " << node.data.to_s
-        node = node.pointer
+        node = node.forward
       end
       string
     end
@@ -105,24 +105,24 @@ class LinkedList
       node = @head
       deleted_node = ''
       if node.data === data
-        @head = node.pointer
+        @head = node.forward
         deleted_node = node
       else
         node = @head
-        while( node != nil && node.pointer != nil && (node.pointer).data != data)
-          node = node.pointer
+        while( node != nil && node.forward != nil && (node.forward).data != data)
+          node = node.forward
         end
-        if (node != nil) && (node.pointer != nil)
-          node.pointer = (node.pointer).pointer
+        if (node != nil) && (node.forward != nil)
+          node.forward = (node.forward).forward
         end
-        deleted_node = node.pointer
+        deleted_node = node.forward
       end
       deleted_node = nil
     end
   end
 
-  class Doubly
-    def initialize(data)
+  class Doubly < Singly
+    def initialize(data) # intializes
       if data.respond_to? :each
         @head = DoublyNode.new(data[0])
         data.each.with_index { |datum, index| self.add(datum) if index > 0}
@@ -141,56 +141,18 @@ class LinkedList
       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)
+    def delete(data) # deletes a node
       dnode = find(data)
-      if dnode
-        dnode1 = dnode.backward
-        dnode2 = dnode.forward
-        dnode1.forward = dnode2
-        dnode2.backward = dnode1
+      if dnode === @head
+        @head = dnode.forward
+      elsif dnode.forward == nil
+        prev_dnode = dnode.backward
+        prev_dnode.forward = nil
+      else
+        prev_dnode, next_dnode = dnode.backward, dnode.forward
+        prev_dnode.forward, next_dnode.backward = next_dnode, prev_dnode
       end
+      dnode = nil
     end
-
   end
 end

metadata

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