ruby_structures 1.0.0 → 2.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 35b0dcb999c08a0859b304a79c02e1ce5934d217
-  data.tar.gz: b49e0522296bac17123c7210088eb994b4b28370
+  metadata.gz: 6782ad1fced1c7fb1843ea6d4c768f19398c4bfc
+  data.tar.gz: 8c4c4c5cffc4a05184b38076032b18f7916ceb82
 SHA512:
-  metadata.gz: 35a961e74e9a699f1ae412c4b8134b6ca258a6ca701200011766268a4846a09090c2b2fdca54dfa5f87d773aff6cdf5480d41b32c348979687a9e2f79556e0b4
-  data.tar.gz: dc354ac04338961aba568926ae9df562be7c39ada587fc7dce8c91e456c6dfc90a1234d1c37c1cc8748467cc673fdad6c680ac00b89f9311a93fb873393cfa62
+  metadata.gz: 94a8daae5487dc44c589b3f2e2b0083e93758508c5a502b9da6ce7df9b67da44d35dd0e7d951a0d9abfb7332433a3da66f12504db62959450ba5dcce1a57001c
+  data.tar.gz: d880a0579d69066e63e1be514dc1718d2cf3d341ad404e52ff653deb544a537cfbc23b128bad425f81cde638ae0b436076350065d40875cddf7d423655756771

data/lib/data_structures/binary_tree.rb

@@ -0,0 +1,89 @@
+class BinaryTree
+  def self.from_array(array)
+    binary_tree = BinaryTree.new
+    return binary_tree if array.empty?
+
+    head_node = BinaryTreeNode.new(array.first)
+    binary_tree.send(:head=, head_node)
+    return binary_tree if array.length == 1
+
+    current_node = head_node
+    node_arr = []
+    array[1..-1].each do |el|
+      node = BinaryTreeNode.new(el, current_node)
+      node_arr << node
+      binary_tree.send(:leaves) << node
+      current_node.send(:left_child).nil? ? current_node.send(:left_child=, node) : current_node.send(:right_child=, node)
+      binary_tree.send(:leaves).delete(current_node)
+      current_node = node_arr.shift if current_node.send(:right_child)
+    end
+
+    binary_tree
+  end
+
+  def initialize
+    @head = nil
+    @leaves = []
+  end
+
+  def depth_first_search(target=nil, &prc)
+    raise ArgumentError.new('Must pass either a target value or a block') unless (target || prc) && !(target && prc)
+    prc ||= Proc.new { |node| node.send(:val) == target }
+
+    return nil if @head.nil?
+    @head.send(:depth_first_search, &prc)
+  end
+
+  def breadth_first_search(target=nil, &prc)
+    raise ArgumentError.new('Must pass either a target value or a block') unless (target || prc) && !(target && prc)
+    prc ||= Proc.new { |node| node.send(:val) == target }
+
+    nodes = [@head]
+    until nodes.empty?
+      node = nodes.shift
+      next if node.nil?
+      return node if prc.call(node)
+      nodes.concat([node.send(:left_child), node.send(:right_child)])
+    end
+
+    nil
+  end
+
+  private
+
+  attr_accessor :head
+  attr_reader :leaves
+end
+
+class BinaryTreeNode
+  def initialize(val=nil, parent=nil, left_child=nil, right_child=nil)
+    @val = val
+    @parent = parent
+    @left_child = left_child
+    @right_child = right_child
+  end
+
+  def to_s
+    @val
+  end
+
+  def inspect
+    @val
+  end
+
+  private
+
+  def depth_first_search(&prc)
+    return self if prc.call(self)
+
+    [@left_child, @right_child].each do |child|
+      next if child.nil?
+      result = child.send(:depth_first_search, &prc)
+      return result unless result.nil?
+    end
+
+    nil
+  end
+
+  attr_accessor :val, :parent, :left_child, :right_child
+end

data/lib/data_structures/linked_list.rb

@@ -16,14 +16,14 @@ class LinkedList
     return "-" if self.empty?
 
     vals = self.to_a { |n| n.send(:val) }
-    vals.join(' -> ')
+    vals.join(' <=> ')
   end
 
   def inspect
     return "-" if self.empty?
 
     vals = self.to_a { |n| n.send(:val) }
-    vals.join(' -> ')
+    vals.join(' <=> ')
   end
 
   def empty?
@@ -40,8 +40,8 @@ class LinkedList
     last == @head ? nil : last
   end
 
-  def append(val=nil)
-    node = LinkedListNode.new(val)
+  def append(key=nil, val=nil)
+    node = LinkedListNode.new(key, val)
     last = @tail.send(:prev)
 
     last.send(:next=, node)
@@ -53,8 +53,8 @@ class LinkedList
     node
   end
 
-  def prepend(val=nil)
-    node = LinkedListNode.new(val)
+  def prepend(key=nil, val=nil)
+    node = LinkedListNode.new(key, val)
     first = @head.send(:next)
 
     first.send(:prev=, node)
@@ -66,18 +66,28 @@ class LinkedList
     node
   end
 
-  def find(val)
+  def find_by_key(key)
+    self.each { |node| return node if node.send(:key) == key }
+    nil
+  end
+
+  def find_by_val(val)
     self.each { |node| return node if node.send(:val) == val }
     nil
   end
 
-  def include?(val)
+  def include_key?(key)
+    self.each { |node| return true if node.send(:key) == key }
+    false
+  end
+
+  def include_val?(val)
     self.each { |node| return true if node.send(:val) == val }
     false
   end
 
-  def remove(val)
-    node = self.find(val)
+  def remove(key)
+    node = self.find_by_key(key)
     return nil if node.nil?
 
     prev_node = node.send(:prev)
@@ -89,9 +99,9 @@ class LinkedList
     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?
+  def update(key, new_val)
+    node = self.find_by_key(key)
+    raise ArgumentError.new("Couldn't find Node with key=#{key}") if node.nil?
 
     node.send(:val=, new_val)
     node
@@ -108,38 +118,25 @@ 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 LinkedListNode
-  def initialize(val=nil, next_node=nil, prev_node=nil)
+  def initialize(key=nil, val=nil, next_node=nil, prev_node=nil)
+    @key = key
     @val = val
     @next = next_node
     @prev = prev_node
   end
 
   def to_s
-    val
+    @val
   end
 
   def inspect
-    val
+    @val
   end
 
   private
 
-  attr_accessor :val, :next, :prev
+  attr_accessor :key, :val, :next, :prev
 end

data/lib/data_structures/lru_cache.rb

@@ -0,0 +1,80 @@
+require_relative 'linked_list'
+
+class LRUCache
+  def initialize(max_size)
+    @max_size = max_size
+    @size = 0
+    @hash = {}
+    @linked_list = LinkedList.new
+  end
+
+  def to_a
+    @linked_list.to_a
+  end
+
+  def empty?
+    @size == 0
+  end
+
+  def first
+    @linked_list.first
+  end
+
+  def last
+    @linked_list.last
+  end
+
+  def find(key)
+    @hash[key]
+  end
+
+  def include?(key)
+    @hash.has_key?(key)
+  end
+
+  def append(key, val)
+    node = @linked_list.append(key, val)
+    @hash[key] = node
+
+    @size += 1
+    if @size > @max_size
+      first_node_key = @linked_list.first.send(:key)
+      @linked_list.remove(first_node_key)
+      @hash.delete(first_node_key)
+      @size -= 1
+    end
+
+    node
+  end
+
+  def prepend(key, val)
+    node = @linked_list.prepend(key, val)
+    @hash[key] = node
+
+    @size += 1
+    if @size > @max_size
+      last_node_key = @linked_list.last.send(:key)
+      @linked_list.remove(last_node_key)
+      @hash.delete(last_node_key)
+      @size -= 1
+    end
+
+    node
+  end
+
+  def remove(key)
+    node = self.find(key)
+    return nil if node.nil?
+
+    @linked_list.remove(key)
+    @hash.delete(key)
+    @size -= 1
+
+    node
+  end
+
+  private
+
+  attr_accessor :max_size, :size
+  attr_reader :hash, :linked_list
+end

data/lib/ruby_structures.rb

@@ -1,3 +1,5 @@
 require 'data_structures/stack'
 require 'data_structures/queue'
 require 'data_structures/linked_list'
+require 'data_structures/binary_tree'
+require 'data_structures/lru_cache'

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: ruby_structures
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 2.0.0
 platform: ruby
 authors:
 - Jason Numeroff
@@ -10,17 +10,20 @@ bindir: bin
 cert_chain: []
 date: 2018-05-08 00:00:00.000000000 Z
 dependencies: []
-description: Ruby implementations of a Stack, Queue and Linked List. More to come!
+description: Ruby implementations of a Stack, Queue, Linked List, Binary Tree and
+  LRU Cache. More to come!
 email: jnumeroff@hotmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- lib/data_structures/binary_tree.rb
 - lib/data_structures/linked_list.rb
+- lib/data_structures/lru_cache.rb
 - lib/data_structures/queue.rb
 - lib/data_structures/stack.rb
 - lib/ruby_structures.rb
-homepage: https://github.com/Numie/DataStructures
+homepage: https://github.com/Numie/RubyStructures
 licenses:
 - MIT
 metadata: {}