data_structures_101 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: d0d92b27cd70fa2884b0dd6079a3a88581438604
+  data.tar.gz: 174e6747d82bde23b1951693a9d4e66d7e677293
+SHA512:
+  metadata.gz: 34d2614a243cd65c97215ed7013b22db6b37b88f75203bbaeaf3ac4401bc109d9a92282f6bae1beda5114586fb6d8ee58cedecd537c9f04342cd1d3b35980c53
+  data.tar.gz: bff1fb5af12eb3441061517b34a102213a273beb4ba727d54170413d0359d895ebdc8db17ff950e9326d00bf6f2f9760ec6cba98b2e5e965c039a6ea6ba9f67c

data/.gitignore

@@ -0,0 +1,23 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status
+
+# RVM files
+.ruby-gemset
+.ruby-version
+
+# Sublime files
+*.sublime-project
+*.sublime-workspace
+
+# Gem files
+*.gem

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

@@ -0,0 +1,6 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.4.0
+before_install: gem install bundler -v 1.14.6
+script: bundle exec rspec

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 aegis
+
+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,46 @@
+# DataStructures101 [![Build Status](https://travis-ci.org/renehernandez/bok-data_structures_101.svg?branch=master)](https://travis-ci.org/renehernandez/bok-data_structures_101)
+
+DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses. The overall goal of the gem is to provide easy to use functionality (trying to match the behavior of existent structures in Ruby) while providing the user with a framework to test and compare their implementations against.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'data_structures_101'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install data_structures_101
+
+## Usage
+
+```ruby
+require 'data_structures_101'
+```
+
+### LinkedList
+
+To create a LinkedList
+
+```ruby
+list = DataStructures101::LinkedList.new
+```
+
+For more information in the `LinkedList` class, check [this post](https://bitsofknowledge.net/data-structures-101-linked-list) and read the documentation.
+
+## Contributing
+
+In lieu of a formal styleguide, take care to maintain the existing coding style. Add specs for any new or changed functionality and tests it using RSpec.
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/renehernandez/data_structures_101.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "data_structures_101"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/data_structures_101.gemspec

@@ -0,0 +1,26 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'data_structures_101/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "data_structures_101"
+  spec.version       = DataStructures101::VERSION
+  spec.authors       = ["aegis"]
+  spec.email         = ["renehr9102@gmail.com"]
+
+  spec.summary       = %q{DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses.}
+  spec.homepage      = "https://github.com/renehernandez/bok-data_structures_101"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.14"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.5"
+end

data/lib/data_structures_101.rb

@@ -0,0 +1,6 @@
+require "data_structures_101/version"
+require "data_structures_101/linked_list"
+
+module DataStructures101
+  # Your code goes here...
+end

data/lib/data_structures_101/linked_list.rb

@@ -0,0 +1,164 @@
+module DataStructures101
+
+  class LinkedList
+    include Enumerable
+
+    class Node
+      attr_accessor :value, :prev, :next
+
+      def initialize(value, prev = nil, _next = nil)
+        @value = value
+        @next = _next
+        @prev = prev
+      end
+
+      def to_s
+        "<value=#{value}>"
+      end
+    end
+
+    attr_reader :size
+
+    def initialize(*values)
+      @size = 0
+      @head = Node.new(nil)
+      @tail = Node.new(nil, @head)
+      @head.next = @tail
+
+      push(*values)
+    end
+
+    def <<(value)
+      push(value)
+    end
+
+    def delete(value)
+      curr = @head.next
+      return_value = nil
+      until curr == @tail
+        if curr.value == value
+          remove_node(curr)
+          return_value = curr.value
+        end
+        curr = curr.next
+      end
+
+      return_value
+    end
+
+    def each(&block)
+      curr = head.next
+      until curr.nil?
+        block.call(value)
+        curr = curr.next
+      end
+    end
+
+    def fetch(index)
+      fetch_node(index).value
+    end
+
+    def insert(index, *values)
+      curr = fetch_node(index)
+
+      curr = index < 0 ? curr : curr.prev
+
+      values.each do |value|
+        curr = add_node(value, curr.next)
+      end
+      self
+    end
+
+    def first(*args)
+      if args.size == 0
+        return @head.next.value
+      end
+
+      if args.size > 1
+        raise ArgumentError, "wrong number of arguments (given #{args.size}, expected 1)"
+      end
+
+      if args.first < 0
+        raise ArgumentError, "negative array size"
+      end
+
+      return new_list_from_range(0, args.first - 1)
+    end
+
+    def last(*args)
+      if args.size == 0
+        return @tail.prev.value
+      end
+
+      if args.size > 1
+        raise ArgumentError, "wrong number of arguments (given #{args.size}, expected 1)"
+      end
+
+      if args.first < 0
+        raise ArgumentError, "negative array size"
+      end
+
+      return new_list_from_range(size - args.first, size - 1)
+    end
+
+    def push(*values)
+      values.each do |value|
+        add_node(value, @tail)
+      end
+      self # Allows to concatenate consecutive calls to push
+    end
+
+    private
+
+    def fetch_node(index)
+      index += size if index < 0
+      if index < 0 || index >= size
+        raise IndexError, "index #{index} outside of array bounds: #{-size}...#{size}"
+      end
+
+      pos = 0
+      curr = @head.next
+      while pos < index
+        curr = curr.next
+        pos += 1
+      end
+
+      curr
+    end
+
+    def add_node(value, next_node)
+      node = Node.new(value, next_node.prev, next_node)
+      node.prev.next = node
+      node.next.prev = node
+      @size += 1
+      node
+    end
+
+    def remove_node(node)
+      node.prev.next = node.next
+      node.next.prev = node.prev
+      @size -= 1
+    end
+
+    def new_list_from_range(start_index, finish_index)
+      new_list = LinkedList.new
+
+      return new_list if size == 0 || start_index == size || finish_index == -1
+
+      start_index = 0 if start_index < 0
+      finish_index = size - 1 if finish_index >= size
+
+      start_node = fetch_node(start_index)
+      finish_node = fetch_node(finish_index)
+
+      until start_node == finish_node.next
+        new_list << start_node.value
+        start_node = start_node.next
+      end
+
+      new_list
+    end
+
+  end
+
+end

data/lib/data_structures_101/version.rb

@@ -0,0 +1,3 @@
+module DataStructures101
+  VERSION = "0.1.0"
+end

metadata

@@ -0,0 +1,100 @@
+--- !ruby/object:Gem::Specification
+name: data_structures_101
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- aegis
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-03-11 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+- !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'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.5'
+description: 
+email:
+- renehr9102@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- data_structures_101.gemspec
+- lib/data_structures_101.rb
+- lib/data_structures_101/linked_list.rb
+- lib/data_structures_101/version.rb
+homepage: https://github.com/renehernandez/bok-data_structures_101
+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.6.8
+signing_key: 
+specification_version: 4
+summary: DataStructures101 is a simple gem that groups several implementations of
+  common data structures usually taught in Computer Science courses.
+test_files: []