linked_list_sourav 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 173f30574433c08a8dfbab1f4118cd78826830d0
+  data.tar.gz: 95bbb800fe469579efb56f0abb8fb837ffbec7d9
+SHA512:
+  metadata.gz: 6bc70d07aa80158e780f49bdc613d5ae0c74e2cc9a4e43e782064ead858d7087939a651c0ada84d8ada496dc543be8fcec70eb7ea06197d2928e4c1c66cfc385
+  data.tar.gz: 624467a6d655e87959ff0de7f18ac4c6bc9ff927c1a5c295291230174244271fdca27ecf074ce2008fd4ebc98a1ab4853a7708ddd68e20558906ae7d42142fdb

data/lib/linked_list.rb

@@ -0,0 +1,73 @@
+require_relative 'node'
+
+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])
+    end
+    self
+  end
+
+  def head #returns head
+    @head
+  end
+
+  def parse # parses all the members
+    node = @head
+    while (node != nil)
+      puts node.get_data
+      node = node.get_pointer
+    end
+  end
+
+  def add(data)  # adds new members
+    node = @head
+    while (node.get_pointer != nil)
+      node = node.get_pointer
+    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
+    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
+    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
+      node = @head
+      while( node != nil && node.get_pointer != nil && (node.get_pointer).get_data != data)
+        node = node.get_pointer
+      end
+      if (node != nil) && (node.get_pointer != nil)
+        node.set_pointer((node.get_pointer).get_pointer)
+      end
+      deleted_node = node.get_pointer
+    end
+    deleted_node = nil
+  end
+end

data/lib/node.rb

@@ -0,0 +1,24 @@
+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

metadata

@@ -0,0 +1,45 @@
+--- !ruby/object:Gem::Specification
+name: linked_list_sourav
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Sourav Moitra
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-02-14 00:00:00.000000000 Z
+dependencies: []
+description: A simple linked list gem
+email: sourav.moitr@gmail.con
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/linked_list.rb
+- lib/node.rb
+homepage: https://github.com/xw19/linked_list
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.5
+signing_key: 
+specification_version: 4
+summary: Linked list library for ruby
+test_files: []