ruby_structures 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 3010a5b7d4654d61386dc05018e491f62c5bd0aa
+  data.tar.gz: 7e9bab4d78a0ba383eec40ba4600d5429eaab75f
+SHA512:
+  metadata.gz: 1faeaa2b732a4d0f05939c7e92bff5bb81d90e7941ebf6c00fc29e26157efcb848fc3bea643a92c785f4e6f5e7ef374bb915802de0e53bbae8d84d4144948ea0
+  data.tar.gz: f4a2e6d6885b2c5bc165cd7817913f94e677eddb69eec6bccee072403d0250d0728703ae2df24c415104fbea3b0bd18f889df2bef608d529983deb1f6c358b9d

data/lib/data_structures/linked_list.rb

@@ -0,0 +1,131 @@
+class LinkedList
+  include Enumerable
+
+  def initialize(head=nil, tail=nil)
+    @head = Node.new
+    @tail = Node.new
+    @head.send(:next=, @tail)
+    @tail.send(:prev=, @head)
+  end
+
+  def to_a
+    self.reduce([]) {|arr, n| arr << n.send(:val)}
+  end
+
+  def to_s
+    return "LinkedList is empty" if self.empty?
+
+    vals = self.map { |n| n.send(:val) }
+    vals.join(' -> ')
+  end
+
+  def inspect
+    return "LinkedList is empty" if self.empty?
+
+    vals = self.map { |n| n.send(:val) }
+    vals.join(' -> ')
+  end
+
+  def empty?
+    @head.send(:next) == @tail
+  end
+
+  def first
+    first = @head.send(:next)
+    first == @tail ? nil : first
+  end
+
+  def last
+    last = @tail.send(:prev)
+    last == @head ? nil : last
+  end
+
+  def append(val=nil)
+    node = Node.new(val)
+    last = @tail.send(:prev)
+
+    last.send(:next=, node)
+    @tail.send(:prev=, node)
+
+    node.send(:prev=, last)
+    node.send(:next=, @tail)
+
+    node
+  end
+
+  def prepend(val=nil)
+    node = Node.new(val)
+    first = @head.send(:next)
+
+    first.send(:prev=, node)
+    @head.send(:next=, node)
+
+    node.send(:prev=, @head)
+    node.send(:next=, first)
+
+    node
+  end
+
+  def find(val)
+    self.each { |n| return node if n.send(:val) == val }
+    nil
+  end
+
+  def include(val)
+    self.each { |n| return true if n.send(:val) == val }
+    false
+  end
+
+  def remove(val)
+    node = self.find(val)
+    return nil if node.nil?
+
+    prev_node = node.send(:prev)
+    next_node = node.send(:next)
+
+    prev_node.send(:next=, next_node)
+    next_node.send(:prev=, prev_node)
+
+    node
+  end
+
+  def update(old_val, new_val)
+    node = self.find(old_val)
+    raise ArgumentError.new("Couldn't find Node with value=#{old_val}") if node.nil?
+
+    node.send(:val=, new_val)
+    node
+  end
+
+  def each(&prc)
+    current_node = @head.send(:next)
+    return self if current_node.nil?
+
+    while current_node != @tail
+      prc.call(current_node)
+      current_node = current_node.send(:next)
+    end
+
+    self
+  end
+end
+
+class Node
+  def initialize(val=nil, next_node=nil, prev_node=nil)
+    @val = val
+    @next = next_node
+    @prev = prev_node
+  end
+
+  def to_s
+    val
+  end
+
+  def inspect
+    val
+  end
+
+  private
+
+  attr_accessor :val, :next, :prev
+end

data/lib/data_structures/queue.rb

@@ -0,0 +1,53 @@
+class Queue
+  def initialize
+    @store = Array.new
+  end
+
+  def to_a
+    Array.new(@store)
+  end
+
+  def to_s
+    @store
+  end
+
+  def inspect
+    @store
+  end
+
+  def ==(other_queue)
+    @store == other_queue.send(:store)
+  end
+
+  def empty?
+    @store.empty?
+  end
+
+  def enqueue(el)
+    @store.push(el)
+  end
+
+  def <<(el)
+    @store << el
+  end
+
+  def dequeue
+    @store.shift
+  end
+
+  def peek
+    @store.first
+  end
+
+  def length
+    @store.length
+  end
+
+  def include?(el)
+    @store.include?(el)
+  end
+
+  private
+
+  attr_reader :store
+end

data/lib/data_structures/stack.rb

@@ -0,0 +1,53 @@
+class Stack
+  def initialize
+    @store = Array.new
+  end
+
+  def to_a
+    Array.new(@store)
+  end
+
+  def to_s
+    @store
+  end
+
+  def inspect
+    @store
+  end
+
+  def ==(other_stack)
+    @store == other_stack.send(:store)
+  end
+
+  def empty?
+    @store.empty?
+  end
+
+  def push(el)
+    @store.push(el)
+  end
+
+  def <<(el)
+    @store << el
+  end
+
+  def pop
+    @store.pop
+  end
+
+  def peek
+    @store.last
+  end
+
+  def length
+    @store.length
+  end
+
+  def include?(el)
+    @store.include?(el)
+  end
+
+  private
+
+  attr_reader :store
+end

data/lib/ruby_structures.rb

@@ -0,0 +1,3 @@
+require 'data_structures/stack'
+require 'data_structures/queue'
+require 'data_structures/linked_list'

metadata

@@ -0,0 +1,47 @@
+--- !ruby/object:Gem::Specification
+name: ruby_structures
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Jason Numeroff
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2018-05-07 00:00:00.000000000 Z
+dependencies: []
+description: Ruby implementations of a Stack, Queue and Linked List. More to come!
+email: jnumeroff@hotmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/data_structures/linked_list.rb
+- lib/data_structures/queue.rb
+- lib/data_structures/stack.rb
+- lib/ruby_structures.rb
+homepage: https://github.com/Numie/DataStructures
+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.5.1
+signing_key: 
+specification_version: 4
+summary: Ruby Data Structures
+test_files: []