ruby_structures 2.1.0 → 2.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f84ec7afcc16ae06a9e385352868871144f62937
-  data.tar.gz: 44ede61cd4466ccd6e54bc06b67231ecd7a3a293
+  metadata.gz: 3f90580fdf848a8b70513b2756ea932be5913ca0
+  data.tar.gz: 0bdf1a300665bfa031045f07ab5a01a9b4e17f34
 SHA512:
-  metadata.gz: fccf6655d1f80ecf8d285e2b9598348d5d52ebee5d65170726d959daf08389ab93f19b3a951b279dd767424ead2cb55fd4e709654deb6af1c17f632496c89cb4
-  data.tar.gz: 080193de352085e39b1054a18080cb34d6692747910f6392c3210bed15701d9645754d4ae056b2e09411c00310f854c38cc19d3c7502d1222c7884fcd6470ad0
+  metadata.gz: c9b4072b567a40780c949177e91bf4a26b92af651038e2eb1d39ac04ac3adb88bf0d37bb4bcf7e88f379fa8b72d6893912234c5615b6f5da1b74a1ac7cb330b3
+  data.tar.gz: fbac1d228a0a991f05506bbbca51177582c97612289e82015bd941dd67c9d258feab5fcb2c491c95756edf22ec608238d9d074094385af363e19000ebff4b6c1

data/lib/data_structures/heap.rb

@@ -0,0 +1,76 @@
+class Heap
+  def initialize
+    @store = []
+  end
+
+  def peek
+    raise ArgumentError.new('Heap is empty') if @store.empty?
+    @store.first
+  end
+
+  def insert(el)
+    @store << el
+
+    el_idx = @store.length - 1
+    parent_idx = parent_idx(el_idx)
+
+    heapify_up(el_idx, parent_idx)
+
+    el
+  end
+
+  def extract
+    raise ArgumentError.new('Heap is empty') if @store.empty?
+    return @store.shift if @store.length <= 2
+
+    @store[0], @store[-1] = @store[-1], @store[0]
+    head = @store.pop
+
+    el_idx = 0
+    children_indices = children_indices(el_idx)
+
+    heapify_down(el_idx, children_indices)
+
+    head
+  end
+
+  private
+
+  def heapify_up(el_idx, parent_idx)
+    until el_idx == 0 || @store[el_idx] >= @store[parent_idx]
+      @store[el_idx], @store[parent_idx] = @store[parent_idx], @store[el_idx]
+      el_idx = parent_idx
+      parent_idx = parent_idx(el_idx)
+    end
+  end
+
+  def heapify_down(el_idx, children_indices)
+    return if children_indices.empty?
+    if children_indices.length == 1
+      child_idx = children_indices.first
+      if @store[el_idx] > @store[child_idx]
+        @store[el_idx], @store[child_idx] = @store[child_idx], @store[el_idx]
+      end
+      return
+    elsif @store[el_idx] > @store[children_indices.first] || @store[el_idx] > @store[children_indices.last]
+      child1, child2 = @store[children_indices.first], @store[children_indices.last]
+      lowest_child_idx = child1 <= child2 ? children_indices.first : children_indices.last
+      @store[el_idx], @store[lowest_child_idx] = @store[lowest_child_idx], @store[el_idx]
+
+      children_indices = children_indices(lowest_child_idx)
+      heapify_down(lowest_child_idx, children_indices)
+    end
+  end
+
+  def parent_idx(idx)
+    (idx - 1) / 2
+  end
+
+  def children_indices(idx)
+    idx1 = idx * 2 + 1
+    idx2 = idx * 2 + 2
+    [idx1, idx2].select { |idx| @store[idx] }
+  end
+
+  attr_reader :store
+end

data/lib/data_structures/lru_cache.rb

@@ -37,9 +37,7 @@ class LRUCache
     @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)
+      remove_node(:first)
     else
       @size += 1
     end
@@ -52,9 +50,7 @@ class LRUCache
     @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)
+      remove_node(:last)
     else
       @size += 1
     end
@@ -67,9 +63,7 @@ class LRUCache
     @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)
+      remove_node(:first)
     else
       @size += 1
     end
@@ -82,9 +76,7 @@ class LRUCache
     @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)
+      remove_node(:last)
     else
       @size += 1
     end
@@ -105,6 +97,12 @@ class LRUCache
 
   private
 
+  def remove_node(position)
+    node_key = @linked_list.send(position).send(:key)
+    @linked_list.remove(node_key)
+    @hash.delete(node_key)
+  end
+
   attr_accessor :max_size, :size
   attr_reader :hash, :linked_list
 end

data/lib/ruby_structures.rb

@@ -3,3 +3,4 @@ require 'data_structures/queue'
 require 'data_structures/linked_list'
 require 'data_structures/binary_tree'
 require 'data_structures/lru_cache'
+require 'data_structures/heap'

metadata

@@ -1,23 +1,24 @@
 --- !ruby/object:Gem::Specification
 name: ruby_structures
 version: !ruby/object:Gem::Version
-  version: 2.1.0
+  version: 2.2.0
 platform: ruby
 authors:
 - Jason Numeroff
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-05-09 00:00:00.000000000 Z
+date: 2018-05-10 00:00:00.000000000 Z
 dependencies: []
-description: Ruby implementations of a Stack, Queue, Linked List, Binary Tree and
-  LRU Cache. More to come!
+description: Ruby implementations of a Stack, Queue, Linked List, Binary Tree, LRU
+  Cache and Heap. More to come!
 email: jnumeroff@hotmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/data_structures/binary_tree.rb
+- lib/data_structures/heap.rb
 - lib/data_structures/linked_list.rb
 - lib/data_structures/lru_cache.rb
 - lib/data_structures/queue.rb