linked_list_sourav 0.0.13 → 0.0.14

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 40e267bfca7eeb6aab2b6b39ef283dd11c35c6ab
-  data.tar.gz: 31e48251e30853e24c7dc3cc498fe92a9cd32f15
+  metadata.gz: 7d20fe6458b9632734e8ec4247827fd66153bf3f
+  data.tar.gz: 38085eb4af4dc04f999ce2962567b9c3aa667ea0
 SHA512:
-  metadata.gz: 70c632fc3bc7e6b80435937c55e291ca4ca8fdc652fc7029aab6d02f9ad8f4762b4298946c52d1d6424b53ff75436e69c93dba8d04e7328f078e386f2addea3e
-  data.tar.gz: 29f4eb801595c0b8521e7719db2d7fa1cee2548c03580033dc6a0f6eb303ef09fc21c03a788fbaf636109e3c4bd27fc25e5a5127241eba2467dba61ad5e5abe4
+  metadata.gz: b5289719f0a93b692c8d89955696ca69f4bb3ce1bb56ff6f9d3b92a23470abecac41d393cb2ce6a631e52a11377e8b7368faaba7b2852f35fc7c2a34571ac555
+  data.tar.gz: 19a0ce31b8ee157576fb0332f0ebcbfb23d2f3c6e060ced731b116797d3bbee5ec041cf7ad661924538bd7d01660f954936a74562e3de60155b1c14982698eb2

data/lib/linked_list_sourav.rb

@@ -34,13 +34,14 @@ class LinkedList
   end
 
   class Singly
-    def initialize(data) # constructor
+    def initialize(data = nil) # 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)
       end
+      @count = 1
       self
     end
 
@@ -64,12 +65,17 @@ class LinkedList
       node
     end
 
+    def no_of_nodes
+      @count
+    end
+
     def add(data)  # adds new members
       node = @head
       while (node.forward != nil)
         node = node.forward
       end
       node.forward = Node.new(data)
+      @count += 1
       node.forward
     end
 
@@ -118,6 +124,7 @@ class LinkedList
       if node.data === data
         @head = node.forward
         deleted_node = node
+        @count -= 1
       else
         node = @head
         while( node != nil && node.forward != nil && (node.forward).data != data)
@@ -125,6 +132,7 @@ class LinkedList
         end
         if (node != nil) && (node.forward != nil)
           node.forward = (node.forward).forward
+          @count -= 1
         end
         deleted_node = node.forward
       end
@@ -140,6 +148,7 @@ class LinkedList
       else
         @head = DoublyNode.new(data)
       end
+      @count = 1
       self
     end
 
@@ -149,19 +158,23 @@ class LinkedList
         dnode = dnode.forward
       end
       dnode.forward = DoublyNode.new(data, dnode)
+      @count += 1
       self
     end
 
     def delete(data) # deletes a node
       dnode = find(data)
-      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
+      if dnode
+        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
+        @count -= 1
       end
       dnode = nil
     end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: linked_list_sourav
 version: !ruby/object:Gem::Version
-  version: 0.0.13
+  version: 0.0.14
 platform: ruby
 authors:
 - Sourav Moitra
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-02-14 00:00:00.000000000 Z
+date: 2015-03-14 00:00:00.000000000 Z
 dependencies: []
 description: A simple linked list gem
 email: sourav.moitr@gmail.con