linked_list_sourav 0.0.14 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 7d20fe6458b9632734e8ec4247827fd66153bf3f
-  data.tar.gz: 38085eb4af4dc04f999ce2962567b9c3aa667ea0
+  metadata.gz: f5db64298ddfe099ff10ef887815c85e5442b07b
+  data.tar.gz: 2529b989a7fceded76e6de1b69dc3a996cba1181
 SHA512:
-  metadata.gz: b5289719f0a93b692c8d89955696ca69f4bb3ce1bb56ff6f9d3b92a23470abecac41d393cb2ce6a631e52a11377e8b7368faaba7b2852f35fc7c2a34571ac555
-  data.tar.gz: 19a0ce31b8ee157576fb0332f0ebcbfb23d2f3c6e060ced731b116797d3bbee5ec041cf7ad661924538bd7d01660f954936a74562e3de60155b1c14982698eb2
+  metadata.gz: f995c5a6dac0cce0bdb345aca9c81516a3a09b46e51a4bfbeb74f53690e50f646114244bb0d181849fb256f6f5c1a8c2128795ab34fba26c73da315792961e74
+  data.tar.gz: db979ffea9a6ff5ae85657e1c83fd3858719d31a0d6d72d9c3b044e7b251a8a4a04d90d34ba6a5aa63096a8888fbd31b93ec0c87bfec576abe886c12b73e08c2

data/Gemfile

@@ -0,0 +1,3 @@
+source "https://rubygems.org"
+
+gemspec

data/Gemfile.lock

@@ -0,0 +1,32 @@
+PATH
+  remote: .
+  specs:
+    linked_list_sourav (0.0.14)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    diff-lcs (1.2.5)
+    rspec (3.4.0)
+      rspec-core (~> 3.4.0)
+      rspec-expectations (~> 3.4.0)
+      rspec-mocks (~> 3.4.0)
+    rspec-core (3.4.4)
+      rspec-support (~> 3.4.0)
+    rspec-expectations (3.4.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.4.0)
+    rspec-mocks (3.4.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.4.0)
+    rspec-support (3.4.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  linked_list_sourav!
+  rspec
+
+BUNDLED WITH
+   1.11.2

data/README.md

@@ -0,0 +1,34 @@
+# Linked List
+[![Gem Version](https://badge.fury.io/rb/linked_list_sourav.svg)](http://badge.fury.io/rb/linked_list_sourav)
+This is linked list implementation both singly and doubly in ruby. Its main purpose is demonstration.
+
+## Usage
+
+```ruby
+  require "linked_list_sourav"
+  list = LinkedList::Singly.new(1) # intializes a new list
+  list.head # returns head node
+  list.add(2) # adds a new node
+  3.upto(20) { |data| list.add(data)}
+  list.find(10) # finds and return the node that contains data as 10
+  list.delete(6)  # removes the node that contain 6 as data
+  list.add_a([21, 22, 23, 24]) #adds array members directly
+  list = LinkedList::Singly.new([1, 2, 3, 4]) # intialize with an array
+  list.parse # prints all the data from the list
+  list.to_a # prints an array of all data
+  list.to_s #prints an string of all data
+  list.no_of_nodes # returns no of nodes present in the linked list
+
+  ### The same for Doubly Linked list ###
+
+  list = LinkedList::Doubly.new(1) # intializes a new list
+  list.head # returns head node
+  list.add(2) # adds a new node
+  3.upto(20) { |data| list.add(data)}
+  list.find(10) # finds and return the node that contains data as 10
+  list.delete(6)  # removes the node that contain 6 as data
+  list = LinkedList::Doubly.new([1, 2, 3, 4]) # intialize with an array
+  list.parse # prints all the data from the list
+  list.to_a # prints an array of all data
+  list.to_s #prints an string of all data
+```

data/Rakefile

@@ -0,0 +1,2 @@
+
+require "bundler/gem_tasks"

data/lib/linked_list_sourav.rb

@@ -35,13 +35,13 @@ class LinkedList
 
   class Singly
     def initialize(data = nil) # constructor
+      @count = 1
       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
 
@@ -142,13 +142,13 @@ class LinkedList
 
   class Doubly < Singly
     def initialize(data) # intializes
+      @count = 1
       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
-      @count = 1
       self
     end
 

data/linked_list.gemspec

@@ -0,0 +1,15 @@
+Gem::Specification.new do |s|
+  s.name        = 'linked_list_sourav'
+  s.version     = '0.1.1'
+  s.date        = '2016-05-17'
+  s.required_ruby_version = '>= 2.1.5'
+  s.summary     = "Linked list library for ruby"
+  s.description = "A simple linked list gem"
+  s.authors     = ["Sourav Moitra"]
+  s.email       = 'sourav.moitr@gmail.con'
+  s.homepage    = 'https://github.com/xw19/linked_list'
+  s.license     = 'MIT'
+  s.files         = `git ls-files -z`.split("\x0")
+  s.test_files    = s.files.grep(%r{^(test|spec|features)/})
+  s.add_development_dependency('rspec', '~> 3')
+end

data/spec/linked_list_spec.rb

@@ -0,0 +1,219 @@
+require "spec_helper"
+
+describe LinkedList::Node do
+  describe "init" do
+    let(:node2) { described_class.new(2) }
+    let(:node) { described_class.new(1, node2) }
+
+    it "assigns data" do
+      expect(node.data).to eq 1
+    end
+
+    it "assigns forward" do
+      expect(node.forward).to eq node2
+    end
+
+  end
+
+  describe "#to_s" do
+    context "when single node exit" do
+      it "returns string with data" do
+        node = described_class.new 1
+        expect(node.to_s).to eq "Data: 1 "
+      end
+    end
+
+    context "when next node exist" do
+      it "returns string with forward data when exist" do
+        node = described_class.new(1, described_class.new(2))
+        expect(node.to_s).to eq "Data: 1 Points to: 2"
+      end
+    end
+  end
+end
+
+describe LinkedList::DoublyNode do
+  let(:node1) { described_class.new(1) }
+  let(:node3) { described_class.new(3) }
+  let(:node) { described_class.new(2, node1, node3) }
+
+  describe "init" do
+    it "assigns node data" do
+      expect(node.data).to eq 2
+    end
+
+    it "assigns node forward" do
+      expect(node.backward).to eq node1
+    end
+
+    it "assigns node backward" do
+      expect(node.forward).to eq node3
+    end
+  end
+
+  describe "#to_s" do
+    context "when single node" do
+      it "returns a string with data" do
+        node = described_class.new "single node"
+        expect(node.to_s).to eq "Data: single node "
+      end
+    end
+
+    context "when backward nodes exist" do
+      it "returns a string with forward data when exist" do
+        node = described_class.new(2, node1)
+        expect(node.to_s).to eq "Data: 2  Pointed by: 1"
+      end
+    end
+
+    context "when backward & forward nodes exist" do
+      it "returns a string with all pointer reference" do
+        expect(node.to_s).to eq "Data: 2 Points to: 3 Pointed by: 1"
+      end
+    end
+  end
+end
+
+describe LinkedList::Singly do
+  describe "init" do
+    context "when single node" do
+      it do
+        singly = described_class.new(1)
+        expect(singly.head.data).to eq 1
+      end
+    end
+
+    context "when multiple nodes" do
+      it do
+        arr = [1, 2, 3]
+        singly = described_class.new(arr)
+        expect(singly.head.data).to eq 1
+      end
+    end
+  end
+
+  let(:singly) { described_class.new([1, 2, 3])}
+
+  describe "#head" do
+    it "returns instance of LinkedList::Node" do
+      expect(singly.head).to be_instance_of LinkedList::Node
+    end
+
+    it "returns data" do
+      expect(singly.head.data).to eq 1
+    end
+  end
+
+  describe "#parse" do
+    specify { expect { singly.parse }.to output("1\n2\n3\n").to_stdout }
+  end
+
+  describe "#find" do
+    it do
+      node = singly.find(1)
+      expect(node.data).to eq 1
+      expect(node.forward.data).to eq 2
+    end
+
+    it do
+      node = singly.find(2)
+      expect(node.data).to eq 2
+      expect(node.forward.data).to eq 3
+    end
+
+    it do
+      node = singly.find(3)
+      expect(node.data).to eq 3
+      expect(node.forward).to be nil
+    end
+  end
+
+  describe "#no_of_nodes" do
+    it do
+      expect(singly.no_of_nodes).to eq 3
+    end
+  end
+
+  describe "#add" do
+    it "add no_of_nodes by 1" do
+      expect{ singly.add(4) }.to change { singly.no_of_nodes }.by(1)
+    end
+  end
+
+  describe "#add_a" do
+    it "accepts array and add no_of_nodes by 3" do
+      expect{ singly.add_a([4, 5, 6]) }.to change { singly.no_of_nodes }.by(3)
+    end
+  end
+
+  describe "#edit" do
+    it do
+      expect(singly.find(3).data).to_not be_nil
+      singly.edit(3, 9)
+      expect(singly.find(3)).to be_nil
+      expect(singly.find(9).data).to eq 9
+    end
+  end
+
+  describe "#to_a" do
+    it "returns array" do
+      expect(singly.to_a).to eq([1, 2, 3])
+    end
+  end
+
+  describe "#to_s" do
+    it do
+      expect(singly.to_s).to eq [1, 2, 3].join(", ")
+    end
+  end
+
+  describe "#delete" do
+    it "remove single node" do
+      expect { singly.delete(1) }.to change { singly.no_of_nodes }.by(-1)
+    end
+
+    it "remove any node that match data" do
+      expect(singly.find(2)).to_not be_nil
+      singly.delete(2)
+      expect(singly.find(2)).to be_nil
+    end
+  end
+end
+
+describe LinkedList::Doubly do
+  describe "init" do
+    context "when single node" do
+      it do
+        singly = described_class.new(1)
+        expect(singly.head.data).to eq 1
+      end
+    end
+
+    context "when multiple nodes" do
+      it do
+        arr = [1, 2, 3]
+        singly = described_class.new(arr)
+        expect(singly.head.data).to eq 1
+        expect(singly.head.forward.data).to eq 2
+      end
+    end
+  end
+
+  let(:doubly) { described_class.new([1, 2 ,3]) }
+
+  describe "#add" do
+    it "adds no of nodes" do
+      expect(doubly.no_of_nodes).to eq 3
+      expect { doubly.add(4) }.to change { doubly.no_of_nodes }.by(1)
+      expect(doubly.no_of_nodes).to eq 4
+    end
+  end
+
+  describe "#delete" do
+    it "removes a node" do
+      expect(doubly.find(2)).to_not be_nil
+      doubly.delete(2)
+      expect(doubly.find(2)).to be_nil
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,10 @@
+require 'bundler/setup'
+Bundler.setup
+
+require 'linked_list_sourav'
+
+RSpec.configure do |config|
+  config.color = true
+  config.tty = true
+  config.formatter = :progress
+end

metadata

@@ -1,22 +1,43 @@
 --- !ruby/object:Gem::Specification
 name: linked_list_sourav
 version: !ruby/object:Gem::Version
-  version: 0.0.14
+  version: 0.1.1
 platform: ruby
 authors:
 - Sourav Moitra
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-03-14 00:00:00.000000000 Z
-dependencies: []
+date: 2016-05-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3'
 description: A simple linked list gem
 email: sourav.moitr@gmail.con
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- Gemfile
+- Gemfile.lock
+- README.md
+- Rakefile
 - lib/linked_list_sourav.rb
+- linked_list.gemspec
+- spec/linked_list_spec.rb
+- spec/spec_helper.rb
 homepage: https://github.com/xw19/linked_list
 licenses:
 - MIT
@@ -37,8 +58,10 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.5
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: Linked list library for ruby
-test_files: []
+test_files:
+- spec/linked_list_spec.rb
+- spec/spec_helper.rb