lazy_priority_queue 0.0.0 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0fd645a3f0b657b9d5f8d406e3d1c36e88d4e9f0
-  data.tar.gz: 805c1d6fdc15a7604b05457c896009e6e4af17de
+  metadata.gz: ad75f66fb343a6f9ccf9f3d531172bf550c47901
+  data.tar.gz: 454b6fed5f8e191d41c50a35ba90668ef44fe2c5
 SHA512:
-  metadata.gz: 34178a91738b2884553b73555f9e1a5daaa4a60deb6735ff26fad10704aaf417bc8f244384256dec41eae70ca6343aeac2833581f4e5c8aca89d88e1904132b6
-  data.tar.gz: c963785af0360405e04a0bf0b6b4ce3cfd23e70f8c59a7c7eb710bc5b2bd2ab40f000dc603ea39757c5e1d124ce13b2fcfb7e345d3bc756992ceaa2aabce84a0
+  metadata.gz: 6375ce0f1ed00787843eaf642489d069e9f799c331b638b424b5c4c1494c79cc553a71be0a61fa63a706bf17fa810c4da653d73cc6614dc2e2fa9e4cfc7c9c7b
+  data.tar.gz: 07c52e047784873415bc5a1e1d7e47c77d72e32ebcfe4855699002548527489602f05b163a4555a00a1d2eb54a13f2eba52948fee8e1f8ab72687c55cac53a39

data/lib/lazy_priority_queue.rb

@@ -25,6 +25,8 @@ class LazyPriorityQueue
 
     element
   end
+  alias_method :push, :enqueue
+  alias_method :insert, :enqueue
 
   def change_priority element, new_key
     node = @references[element]
@@ -68,6 +70,7 @@ class LazyPriorityQueue
 
     element
   end
+  alias_method :pop, :dequeue
 
   def delete element
     change_priority element, @top_condition
@@ -76,6 +79,7 @@ class LazyPriorityQueue
 
   def empty?; @references.empty? end
   def size; @references.size end
+  alias_method :length, :size
 
   private
 
@@ -135,10 +139,18 @@ class MinPriorityQueue < LazyPriorityQueue
   def initialize
     super(-Float::INFINITY) { |parent_node, child_node| parent_node.key <= child_node.key }
   end
+
+  alias_method :decrease_key, :change_priority
+  alias_method :min, :peek
+  alias_method :extract_min, :dequeue
 end
 
 class MaxPriorityQueue < LazyPriorityQueue
   def initialize
     super( Float::INFINITY) { |parent_node, child_node| parent_node.key >= child_node.key }
   end
+
+  alias_method :increase_key, :change_priority
+  alias_method :max, :peek
+  alias_method :extract_max, :dequeue
 end

metadata

@@ -1,19 +1,19 @@
 --- !ruby/object:Gem::Specification
 name: lazy_priority_queue
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.1.0
 platform: ruby
 authors:
 - Matías Battocchia
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-01-11 00:00:00.000000000 Z
+date: 2016-01-12 00:00:00.000000000 Z
 dependencies: []
-description: Lazy priority queue is a priority queue which implements a lazy binomial
-  heap. It supports the change priority operation, being suitable for algorithms like
-  Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated
-  as a min-priority queue as well as a max-priority queue.
+description: Lazy priority queue is a pure Ruby priority queue which implements a
+  lazy binomial heap. It supports the change priority operation, being suitable for
+  algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can
+  be instantiated as a min-priority queue as well as a max-priority queue.
 email: matias@riseup.net
 executables: []
 extensions: []
@@ -43,5 +43,7 @@ rubyforge_project:
 rubygems_version: 2.4.5.1
 signing_key: 
 specification_version: 4
-summary: A priority queue which implements a lazy binomial heap.
+summary: A priority queue implemented using a lazy binomial heap. It allows change
+  priority operation.
 test_files: []
+has_rdoc: