linked_list_sourav 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 173f30574433c08a8dfbab1f4118cd78826830d0
-  data.tar.gz: 95bbb800fe469579efb56f0abb8fb837ffbec7d9
+  metadata.gz: 5460857f08a6425d9f801fbfc82e1ae19a5ee042
+  data.tar.gz: 870c04620729d17bc79cb661923412bc6c814d44
 SHA512:
-  metadata.gz: 6bc70d07aa80158e780f49bdc613d5ae0c74e2cc9a4e43e782064ead858d7087939a651c0ada84d8ada496dc543be8fcec70eb7ea06197d2928e4c1c66cfc385
-  data.tar.gz: 624467a6d655e87959ff0de7f18ac4c6bc9ff927c1a5c295291230174244271fdca27ecf074ce2008fd4ebc98a1ab4853a7708ddd68e20558906ae7d42142fdb
+  metadata.gz: 29a5f1a71b68edea60e257287e96c05acd102e799b0de8f406e2ebf2388636edd87267cea75a1662c0ece3f422ecce0edd8c8cf2b52bc0b39929d8c31fb10228
+  data.tar.gz: a703506758a24b32f78a370bb9902756384f7c22c132ac64b8b88079d47a9906b4283bd63101efa7924ab7ae51a854ba9fe9a8b300785c06a0b4d296c941f629

data/lib/linked_list.rb

@@ -1,73 +1,88 @@
-require_relative 'node'
+module LinkedList
 
-class LinkedList
-  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])
+  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
+
+    def initialize(data, pointer = nil) #intializes when new is invoked
+      @data = data
+      @pointer = pointer
     end
-    self
-  end
 
-  def head #returns head
-    @head
+    def to_s
+      puts "Data: #{data} Points to: #{self.pointer.data}"
+    end
   end
 
-  def parse # parses all the members
-    node = @head
-    while (node != nil)
-      puts node.get_data
-      node = node.get_pointer
+  class SinglyLinkedList
+    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])
+      end
+      self
     end
-  end
 
-  def add(data)  # adds new members
-    node = @head
-    while (node.get_pointer != nil)
-      node = node.get_pointer
+    def head #returns head
+      @head
     end
-    node.set_pointer(Node.new(data, nil))
-    self
-  end
 
-  def to_a # returns an array of all data
-    node = @head
-    array = Array.new
-    while (node != nil)
-      array << node.get_data
-      node = node.get_pointer
+    def parse # parses all the members
+      node = @head
+      while (node != nil)
+        puts node.data
+        node = node.pointer
+      end
     end
-    array
-  end
 
-  def to_s # returns all data in form of string
-    node = @head
-    string = String.new
-    while (node != nil)
-      string << ", " << node.get_data.to_s
-      node = node.get_pointer
+    def add(data)  # adds new members
+      node = @head
+      while (node.pointer != nil)
+        node = node.pointer
+      end
+      node.pointer = Node.new(data)
+      self
     end
-    string
-  end
 
-  def delete(data) # deletes a single member
-    node = @head
-    deleted_node = ''
-    if node.get_data === data
-      @head = node.get_pointer
-      deleted_node = node
-    else
+    def to_a # returns an array of all data
       node = @head
-      while( node != nil && node.get_pointer != nil && (node.get_pointer).get_data != data)
-        node = node.get_pointer
+      array = Array.new
+      while (node != nil)
+        array << node.data
+        node = node.pointer
       end
-      if (node != nil) && (node.get_pointer != nil)
-        node.set_pointer((node.get_pointer).get_pointer)
+      array
+    end
+
+    def to_s # returns all data in form of string
+      node = @head
+      string = String.new(@head.data.to_s)
+      node = node.pointer
+      while (node != nil)
+        string << ", " << node.data.to_s
+        node = node.pointer
+      end
+      string
+    end
+
+    def delete(data) # deletes a single member
+      node = @head
+      deleted_node = ''
+      if node.data === data
+        @head = node.pointer
+        deleted_node = node
+      else
+        node = @head
+        while( node != nil && node.pointer != nil && (node.pointer).data != data)
+          node = node.pointer
+        end
+        if (node != nil) && (node.pointer != nil)
+          node.pointer = (node.pointer).pointer
+        end
+        deleted_node = node.pointer
       end
-      deleted_node = node.get_pointer
+      deleted_node = nil
     end
-    deleted_node = nil
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: linked_list_sourav
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
 platform: ruby
 authors:
 - Sourav Moitra
@@ -17,7 +17,6 @@ extensions: []
 extra_rdoc_files: []
 files:
 - lib/linked_list.rb
-- lib/node.rb
 homepage: https://github.com/xw19/linked_list
 licenses:
 - MIT

data/lib/node.rb

@@ -1,24 +0,0 @@
-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
-
-  def initialize(data, pointer = nil) #intializes when new is invoked
-    @data = data
-    @pointer = pointer
-  end
-
-  def get_pointer # returns next node
-    @pointer
-  end
-
-  def set_pointer(pointer) #sets next node
-    @pointer = pointer
-  end
-
-  def set_data data # sets data
-    @data = data
-  end
-
-  def get_data # returns data
-    @data
-  end
-end