linkedlist 0.0.6

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 3b525c12d9753f530e2c319c8e2c899c38b1e089
+  data.tar.gz: 2ed63443c9df98670eafded4d0f190239c5dab6c
+SHA512:
+  metadata.gz: 3af87974c55957c7e8082b44148beff135a3d46faa2e99183a0ee1ca3a6e1aebac5451db23288d51af2c2e129f352db45debff41129bc4428f4114077544cbd6
+  data.tar.gz: ebabce6efed40866108147fb9ed7da7948b52b56f20f75956678bd85c7ae0a8b2bb6e518084b2d8f11f0a8f736ae303ee9cfc2811f5e7c0816d160d6208e5874

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in linkedlist.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 javaboybr
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,43 @@
+# LinkedList
+
+Simple implementation of doubly linked list data type in ruby
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'linkedlist'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install linkedlist
+
+## Usage
+
+```ruby
+list = LinkedList.new
+#adding some data, it could be whatever you want
+list << "a string" << 1 << nil << false << Time.new
+#it can be a stack, adding at the top
+list.push "top of the stack"
+#removing from the top
+list.pop
+#it can be a queue, adding on end
+list.enq "Last in"
+#removing the first
+list.deq
+```
+
+## Contributing
+
+1. Fork it ( https://github.com/javaboybr/linkedlist-ruby/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,8 @@
+require "bundler/gem_tasks"
+require "rake"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |test|
+	test.libs << 'lib' << 'test'
+	test.pattern = 'test/*.rb'
+end

data/lib/linkedlist/version.rb

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

data/lib/linkedlist.rb

@@ -0,0 +1,178 @@
+require "linkedlist/version"
+require "node"
+
+#A simple implementation of doubly linked list data type
+#
+#Autor:: Thiago Gonzaga
+#License:: MIT
+class LinkedList
+
+	#Creates a new instance of a list
+	# * length
+	# * initial data
+	def initialize(length=0, item=nil)
+		@tail = nil
+		@head = nil
+		@length = 0
+		for i in (1..length)
+			self << item
+			yield(item) if block_given?
+		end
+	end
+
+	#retorna o tamanho da lista
+	def length
+		@length
+	end
+
+	#Alias for length
+	#alias:: length()
+	def size
+		@length
+	end
+
+	#Insert data on end
+	#alias:: add()
+	def push(info)
+		add(info)
+	end
+
+	#remove the last item
+	def pop
+		remove(@length - 1)
+	end
+
+	#enqueue an item on end
+	def enq(info)
+		add(info)
+	end
+
+	#dequeue the first item
+	def deq
+		remove(0)
+	end
+
+	#insert an item on end
+	def add(info)
+		_new = Node.new(info, previous: @tail)
+		if @head == nil
+			@head = _new
+			@tail = @head
+		else
+			@tail.next = _new
+			@tail = _new
+		end
+		@length += 1
+		self
+	end
+
+	#get data from it index starting at 0
+	def get(index)
+		dir = index > @length/2? -1: 1
+		go(dir: dir, index: index)
+	end
+
+	#remove date by it index
+	def remove(index)
+		dir = index > @length/2? -1: 1
+		curr = go(dir: dir, index: index)
+		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
+			@head = curr.next if curr == @head
+			curr.previous, curr.next = nil, nil
+			@length -= 1
+		end
+		curr.info if curr != nil
+	end
+
+	#the first item of the list
+	def first
+		@head.info
+	end
+
+	#the last item of the list
+	def last
+		@tail.info
+	end
+
+	#go forward
+	def each
+		curr = @head
+		while curr != nil
+			yield(curr.info) if block_given?
+			curr = curr.next
+		end
+	end
+
+	#go backwards
+	def reverse_each
+		curr = @tail
+		while curr != nil
+			yield(curr.info) if block_given?
+			curr = curr.previous
+		end
+	end
+
+	#Convert to a string
+	def to_s
+		s = "["
+		curr = @head
+		while curr != nil
+			s << curr.to_s
+			curr = curr.next
+		end
+		s << "]"
+	end
+
+	#Convert to an array
+	def to_a
+		arr = []
+		each {|valor| arr << valor}
+		arr
+	end
+
+	#verify if the list is empty
+	def empty?
+		@length == 0
+	end
+
+	#remove all itens
+	def clear
+		@length = 0
+		@next = nil
+		@previous = nil
+		self
+	end
+
+	def [](index)
+		i = get(index)
+		i.info if i != nil
+	end
+
+	def []=(index, value)
+		i = get(index)
+		i.info = value if i != nil
+	end
+
+	def <<(info)
+		add(info)
+	end
+
+	#go through the list back and fourth
+	private
+	def go(dir: 1, index: nil)
+		curr, i = @head, 0 if dir == 1
+		curr, i = @tail, (@length-1) if dir == -1
+		while curr != nil
+			break if i == index
+			curr = curr.next if dir == 1
+			curr = curr.previous if dir == -1
+			i += 1 if dir == 1
+			i -= 1 if dir == -1
+		end
+		curr
+	end
+
+end

data/lib/node.rb

@@ -0,0 +1,17 @@
+class Node
+
+	attr_accessor :info, :next, :previous
+
+	def initialize(info, _next: nil, previous: nil)
+		@info = info
+		@next = _next
+		@previous = previous
+	end
+
+	def to_s
+		s = (info == nil)? "nil": "#{@info}"
+		s << ", " if @next != nil
+		s
+	end
+
+end

data/linkedlist.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'linkedlist/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "linkedlist"
+  spec.version       = Linkedlist::VERSION
+  spec.authors       = ["Thiago Gonzaga"]
+  spec.email         = ["thi_gonzaga@yahoo.com.br"]
+  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.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+end

data/test/linkedlisttest.rb

@@ -0,0 +1,45 @@
+require 'test/unit'
+require 'logger'
+require_relative '../lib/linkedlist'
+
+class LinkedListTest < Test::Unit::TestCase
+	
+	def setup
+		@log = Logger.new(STDOUT)
+	end
+
+	def test_instance
+		list = LinkedList.new(1,"test")
+		assert_equal 1, list.length
+		assert_not_nil list << 1 << 2 << "string" << false << true << nil
+		for i in list
+			@log.info "Object type: #{i.class}"
+		end
+		@log.info "List length: #{list.length}"
+		assert_nil list[list.length-1]
+	end
+
+	def test_empty
+		list = LinkedList.new
+		assert list.empty?
+	end
+
+	def test_not_found_index
+		list = LinkedList.new
+		assert_nil list[1000]
+	end
+
+	def test_remove
+		list = LinkedList.new << 1 << 2 << "string" << false << true << nil
+		assert_equal list.length, 6
+		@log.info "List length: #{list.length} content: #{list}"
+		assert_nil list.pop
+		@log.info "Removed last from List #{list}"
+		assert list.remove(list.length-1)
+		@log.info "Removed last from List #{list}"
+		assert_equal list.deq, 1
+		@log.info "Removed first from List #{list}"
+		assert_equal list.remove(1), "string"
+		@log.info "Removed \"string\" List #{list}"
+	end
+end

metadata

@@ -0,0 +1,85 @@
+--- !ruby/object:Gem::Specification
+name: linkedlist
+version: !ruby/object:Gem::Version
+  version: 0.0.6
+platform: ruby
+authors:
+- Thiago Gonzaga
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-10-12 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+description: An iterable doubly linked list which can be used as a stack, queue or
+  array list
+email:
+- thi_gonzaga@yahoo.com.br
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/linkedlist.rb
+- lib/linkedlist/version.rb
+- lib/node.rb
+- linkedlist.gemspec
+- test/linkedlisttest.rb
+homepage: https://github.com/javaboybr/linkedlist-ruby
+licenses:
+- MIT
+metadata:
+  issue_tracker: https://github.com/javaboybr/linkedlist-ruby/issues
+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.0.14
+signing_key: 
+specification_version: 4
+summary: An iterable doubly linked list
+test_files:
+- test/linkedlisttest.rb