linkedlist 0.0.6 → 0.0.8

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3b525c12d9753f530e2c319c8e2c899c38b1e089
-  data.tar.gz: 2ed63443c9df98670eafded4d0f190239c5dab6c
+  metadata.gz: e1e2b07a8e698f00705addaefb003c15864afe03
+  data.tar.gz: aa0cc4a59285f2627926bfb51e43043c0d16ddc6
 SHA512:
-  metadata.gz: 3af87974c55957c7e8082b44148beff135a3d46faa2e99183a0ee1ca3a6e1aebac5451db23288d51af2c2e129f352db45debff41129bc4428f4114077544cbd6
-  data.tar.gz: ebabce6efed40866108147fb9ed7da7948b52b56f20f75956678bd85c7ae0a8b2bb6e518084b2d8f11f0a8f736ae303ee9cfc2811f5e7c0816d160d6208e5874
+  metadata.gz: 88dc5f0824b74a6dfe147586f6fe4eb8db37596b3554ebc1e39bc5fdeaf8ec8fe4e69eaf2f9f83977b31e1c5622a08dc0bdc533f38086577313130eb2ac037fc
+  data.tar.gz: 495c3a63ba671e206f2c1267b2ff77d38543a117e400845574e5bf94b3d2cb7ce8e8d0a9d2f468b2dd7a352538e5d328e7067eb4711b10010fbda5b68d9d90e9

data/lib/linkedlist/version.rb

@@ -1,3 +1,3 @@
 module Linkedlist
-  VERSION = "0.0.6"
+  VERSION = "0.0.8"
 end

data/lib/linkedlist.rb

@@ -55,7 +55,7 @@ class LinkedList
 	#insert an item on end
 	def add(info)
 		_new = Node.new(info, previous: @tail)
-		if @head == nil
+		if @head.nil?
 			@head = _new
 			@tail = @head
 		else
@@ -66,6 +66,25 @@ class LinkedList
 		self
 	end
 
+	#insert at a certain position
+	def insert_at(index, info)
+		curr = get(index)
+		if !curr.nil?
+			_new = Node.new(info, previous: curr.previous, _next: curr)
+			curr.previous.next = _new if !curr.previous.nil?
+			curr.previous = _new
+			@head =  _new if @head == curr
+			@tail = _new if @tail == curr
+			@length += 1
+		else
+			for i in (@length...index)
+				self << nil
+			end
+			add(info)
+		end
+		self
+	end
+
 	#get data from it index starting at 0
 	def get(index)
 		dir = index > @length/2? -1: 1
@@ -76,7 +95,7 @@ class LinkedList
 	def remove(index)
 		dir = index > @length/2? -1: 1
 		curr = go(dir: dir, index: index)
-		if curr != nil
+		if !curr.nil?
 			curr.previous.next = curr.next if !curr.previous.nil?
 			curr.next.previous = curr.previous if !curr.next.nil?
 			@tail = curr.previous if curr == @tail
@@ -84,7 +103,7 @@ class LinkedList
 			curr.previous, curr.next = nil, nil
 			@length -= 1
 		end
-		curr.info if curr != nil
+		curr.info if !curr.nil?
 	end
 
 	#the first item of the list
@@ -100,7 +119,7 @@ class LinkedList
 	#go forward
 	def each
 		curr = @head
-		while curr != nil
+		while !curr.nil?
 			yield(curr.info) if block_given?
 			curr = curr.next
 		end
@@ -109,7 +128,7 @@ class LinkedList
 	#go backwards
 	def reverse_each
 		curr = @tail
-		while curr != nil
+		while !curr.nil?
 			yield(curr.info) if block_given?
 			curr = curr.previous
 		end
@@ -119,7 +138,7 @@ class LinkedList
 	def to_s
 		s = "["
 		curr = @head
-		while curr != nil
+		while !curr.nil?
 			s << curr.to_s
 			curr = curr.next
 		end
@@ -141,19 +160,26 @@ class LinkedList
 	#remove all itens
 	def clear
 		@length = 0
-		@next = nil
-		@previous = nil
+		@head.next.previous = nil if !@head.next.nil?
+		@tail.previous.next = nil if !@head.previous.nil?
+		@head = nil
+		@tail = nil
 		self
 	end
 
 	def [](index)
 		i = get(index)
-		i.info if i != nil
+		i.info if !i.nil?
 	end
 
-	def []=(index, value)
+	def []=(index, info)
 		i = get(index)
-		i.info = value if i != nil
+		if !i.nil?
+			i.info = info
+		else
+			insert_at(index, info)
+		end
+		info
 	end
 
 	def <<(info)
@@ -165,7 +191,7 @@ class LinkedList
 	def go(dir: 1, index: nil)
 		curr, i = @head, 0 if dir == 1
 		curr, i = @tail, (@length-1) if dir == -1
-		while curr != nil
+		while !curr.nil?
 			break if i == index
 			curr = curr.next if dir == 1
 			curr = curr.previous if dir == -1

data/lib/node.rb

@@ -2,7 +2,7 @@ class Node
 
 	attr_accessor :info, :next, :previous
 
-	def initialize(info, _next: nil, previous: nil)
+	def initialize(info, previous: nil, _next: nil)
 		@info = info
 		@next = _next
 		@previous = previous

data/linkedlist.gemspec

@@ -11,7 +11,7 @@ Gem::Specification.new do |spec|
   spec.summary       = %q{An iterable doubly linked list}
   spec.description   = %q{An iterable doubly linked list which can be used as a stack, queue or array list}
   spec.homepage      = "https://github.com/javaboybr/linkedlist-ruby"
-  spec.metadata      = { "issue_tracker" => "https://github.com/javaboybr/linkedlist-ruby/issues"}
+  spec.metadata      = {"issue_tracker" => "https://github.com/javaboybr/linkedlist-ruby/issues"}
   spec.license       = "MIT"
 
   spec.files         = `git ls-files -z`.split("\x0")

data/test/linkedlisttest.rb

@@ -42,4 +42,21 @@ class LinkedListTest < Test::Unit::TestCase
 		assert_equal list.remove(1), "string"
 		@log.info "Removed \"string\" List #{list}"
 	end
+
+	def test_insert_at
+		list = LinkedList.new << 1 << 2 << "string" << false << true << nil
+		assert_not_nil list.insert_at(0, -1)
+		@log.info "List #{list}"
+		assert_equal list[0], -1
+		assert_equal list[1], 1
+		assert_not_nil list.insert_at(3, -1)
+		assert_equal list[3], -1
+		assert_equal list[4], "string"
+		assert_not_nil list.insert_at(8, -1)
+		assert_nil list[7]
+		assert_equal list[8], -1
+		assert_not_nil list.insert_at(15, -1)
+		assert_equal list.length, 16
+		@log.info "List #{list}"
+	end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: linkedlist
 version: !ruby/object:Gem::Version
-  version: 0.0.6
+  version: 0.0.8
 platform: ruby
 authors:
 - Thiago Gonzaga
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-10-12 00:00:00.000000000 Z
+date: 2014-10-13 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler