ruby_structures 0.0.0 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3010a5b7d4654d61386dc05018e491f62c5bd0aa
-  data.tar.gz: 7e9bab4d78a0ba383eec40ba4600d5429eaab75f
+  metadata.gz: 35b0dcb999c08a0859b304a79c02e1ce5934d217
+  data.tar.gz: b49e0522296bac17123c7210088eb994b4b28370
 SHA512:
-  metadata.gz: 1faeaa2b732a4d0f05939c7e92bff5bb81d90e7941ebf6c00fc29e26157efcb848fc3bea643a92c785f4e6f5e7ef374bb915802de0e53bbae8d84d4144948ea0
-  data.tar.gz: f4a2e6d6885b2c5bc165cd7817913f94e677eddb69eec6bccee072403d0250d0728703ae2df24c415104fbea3b0bd18f889df2bef608d529983deb1f6c358b9d
+  metadata.gz: 35a961e74e9a699f1ae412c4b8134b6ca258a6ca701200011766268a4846a09090c2b2fdca54dfa5f87d773aff6cdf5480d41b32c348979687a9e2f79556e0b4
+  data.tar.gz: dc354ac04338961aba568926ae9df562be7c39ada587fc7dce8c91e456c6dfc90a1234d1c37c1cc8748467cc673fdad6c680ac00b89f9311a93fb873393cfa62

data/lib/data_structures/linked_list.rb

@@ -1,9 +1,9 @@
 class LinkedList
   include Enumerable
 
-  def initialize(head=nil, tail=nil)
-    @head = Node.new
-    @tail = Node.new
+  def initialize
+    @head = LinkedListNode.new
+    @tail = LinkedListNode.new
     @head.send(:next=, @tail)
     @tail.send(:prev=, @head)
   end
@@ -13,16 +13,16 @@ class LinkedList
   end
 
   def to_s
-    return "LinkedList is empty" if self.empty?
+    return "-" if self.empty?
 
-    vals = self.map { |n| n.send(:val) }
+    vals = self.to_a { |n| n.send(:val) }
     vals.join(' -> ')
   end
 
   def inspect
-    return "LinkedList is empty" if self.empty?
+    return "-" if self.empty?
 
-    vals = self.map { |n| n.send(:val) }
+    vals = self.to_a { |n| n.send(:val) }
     vals.join(' -> ')
   end
 
@@ -41,7 +41,7 @@ class LinkedList
   end
 
   def append(val=nil)
-    node = Node.new(val)
+    node = LinkedListNode.new(val)
     last = @tail.send(:prev)
 
     last.send(:next=, node)
@@ -54,7 +54,7 @@ class LinkedList
   end
 
   def prepend(val=nil)
-    node = Node.new(val)
+    node = LinkedListNode.new(val)
     first = @head.send(:next)
 
     first.send(:prev=, node)
@@ -67,12 +67,12 @@ class LinkedList
   end
 
   def find(val)
-    self.each { |n| return node if n.send(:val) == val }
+    self.each { |node| return node if node.send(:val) == val }
     nil
   end
 
-  def include(val)
-    self.each { |n| return true if n.send(:val) == val }
+  def include?(val)
+    self.each { |node| return true if node.send(:val) == val }
     false
   end
 
@@ -108,9 +108,23 @@ class LinkedList
 
     self
   end
+
+  def map(&prc)
+    new_linked_list = LinkedList.new
+    current_node = @head.send(:next)
+    return new_linked_list if current_node.nil?
+
+    while current_node != @tail
+      val = prc.call(current_node)
+      new_linked_list.append(val)
+      current_node = current_node.send(:next)
+    end
+
+    new_linked_list
+  end
 end
 
-class Node
+class LinkedListNode
   def initialize(val=nil, next_node=nil, prev_node=nil)
     @val = val
     @next = next_node

data/lib/data_structures/queue.rb

@@ -16,6 +16,7 @@ class Queue
   end
 
   def ==(other_queue)
+    return false unless other_queue.is_a?(Queue)
     @store == other_queue.send(:store)
   end
 
@@ -25,6 +26,7 @@ class Queue
 
   def enqueue(el)
     @store.push(el)
+    self
   end
 
   def <<(el)

data/lib/data_structures/stack.rb

@@ -16,6 +16,7 @@ class Stack
   end
 
   def ==(other_stack)
+    return false unless other_stack.is_a?(Stack)
     @store == other_stack.send(:store)
   end
 
@@ -25,6 +26,7 @@ class Stack
 
   def push(el)
     @store.push(el)
+    self
   end
 
   def <<(el)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby_structures
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 1.0.0
 platform: ruby
 authors:
 - Jason Numeroff
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-05-07 00:00:00.000000000 Z
+date: 2018-05-08 00:00:00.000000000 Z
 dependencies: []
 description: Ruby implementations of a Stack, Queue and Linked List. More to come!
 email: jnumeroff@hotmail.com