ruby_structures 2.0.0 → 2.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 6782ad1fced1c7fb1843ea6d4c768f19398c4bfc
-  data.tar.gz: 8c4c4c5cffc4a05184b38076032b18f7916ceb82
+  metadata.gz: f84ec7afcc16ae06a9e385352868871144f62937
+  data.tar.gz: 44ede61cd4466ccd6e54bc06b67231ecd7a3a293
 SHA512:
-  metadata.gz: 94a8daae5487dc44c589b3f2e2b0083e93758508c5a502b9da6ce7df9b67da44d35dd0e7d951a0d9abfb7332433a3da66f12504db62959450ba5dcce1a57001c
-  data.tar.gz: d880a0579d69066e63e1be514dc1718d2cf3d341ad404e52ff653deb544a537cfbc23b128bad425f81cde638ae0b436076350065d40875cddf7d423655756771
+  metadata.gz: fccf6655d1f80ecf8d285e2b9598348d5d52ebee5d65170726d959daf08389ab93f19b3a951b279dd767424ead2cb55fd4e709654deb6af1c17f632496c89cb4
+  data.tar.gz: 080193de352085e39b1054a18080cb34d6692747910f6392c3210bed15701d9645754d4ae056b2e09411c00310f854c38cc19d3c7502d1222c7884fcd6470ad0

data/lib/data_structures/linked_list.rb

@@ -9,7 +9,7 @@ class LinkedList
   end
 
   def to_a
-    self.reduce([]) {|arr, n| arr << n.send(:val)}
+    self.reduce([]) { |arr, n| arr << n.send(:val) }
   end
 
   def to_s
@@ -66,6 +66,38 @@ class LinkedList
     node
   end
 
+  def add_after_key(ref_key, key, val)
+    ref_node = self.find_by_key(ref_key)
+    raise ArgumentError.new("No Node found with key=#{ref_key}") if ref_node.nil?
+
+    node = LinkedListNode.new(key, val)
+    next_node = ref_node.send(:next)
+
+    node.send(:next=, next_node)
+    node.send(:prev=, ref_node)
+
+    ref_node.send(:next=, node)
+    next_node.send(:prev=, node)
+
+    node
+  end
+
+  def add_before_key(ref_key, key, val)
+    ref_node = self.find_by_key(ref_key)
+    raise ArgumentError.new("No Node found with key=#{ref_key}") if ref_node.nil?
+
+    node = LinkedListNode.new(key, val)
+    prev_node = ref_node.send(:prev)
+
+    node.send(:next=, ref_node)
+    node.send(:prev=, prev_node)
+
+    ref_node.send(:prev=, node)
+    prev_node.send(:next=, node)
+
+    node
+  end
+
   def find_by_key(key)
     self.each { |node| return node if node.send(:key) == key }
     nil

data/lib/data_structures/lru_cache.rb

@@ -36,12 +36,12 @@ class LRUCache
     node = @linked_list.append(key, val)
     @hash[key] = node
 
-    @size += 1
-    if @size > @max_size
+    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
+    else
+      @size += 1
     end
 
     node
@@ -51,12 +51,42 @@ class LRUCache
     node = @linked_list.prepend(key, val)
     @hash[key] = node
 
-    @size += 1
-    if @size > @max_size
+    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
+    else
+      @size += 1
+    end
+
+    node
+  end
+
+  def add_after_key(ref_key, key, val)
+    node = @linked_list.add_after_key(ref_key, key, val)
+    @hash[key] = node
+
+    if @size == @max_size
+      first_node_key = @linked_list.first.send(:key)
+      @linked_list.remove(first_node_key)
+      @hash.delete(first_node_key)
+    else
+      @size += 1
+    end
+
+    node
+  end
+
+  def add_before_key(ref_key, key, val)
+    node = @linked_list.add_before_key(ref_key, key, val)
+    @hash[key] = node
+
+    if @size == @max_size
+      last_node_key = @linked_list.last.send(:key)
+      @linked_list.remove(last_node_key)
+      @hash.delete(last_node_key)
+    else
+      @size += 1
     end
 
     node

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby_structures
 version: !ruby/object:Gem::Version
-  version: 2.0.0
+  version: 2.1.0
 platform: ruby
 authors:
 - Jason Numeroff
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-05-08 00:00:00.000000000 Z
+date: 2018-05-09 00:00:00.000000000 Z
 dependencies: []
 description: Ruby implementations of a Stack, Queue, Linked List, Binary Tree and
   LRU Cache. More to come!