Hash
A Poor mans Priority Queue. (Very inefficent but minimal implemention).
# File lib/priority_queue/poor_priority_queue.rb, line 40 def delete(object) return nil unless self.has_key?(object) result = [object, self[object]] super result end
# File lib/priority_queue/poor_priority_queue.rb, line 25 def delete_min return nil if self.empty? min_k, min_p = *min self.delete(min_k) [min_k, min_p] end
# File lib/priority_queue/poor_priority_queue.rb, line 32 def delete_min_return_key delete_min[0] rescue nil end
# File lib/priority_queue/poor_priority_queue.rb, line 36 def delete_min_return_priority delete_min[1] rescue nil end
# File lib/priority_queue/poor_priority_queue.rb, line 7 def min return nil if self.empty? min_k = self.keys.first min_p = self[min_k] self.each do | k, p | min_k, min_p = k, p if p < min_p end [min_k, min_p] end
# File lib/priority_queue/poor_priority_queue.rb, line 17 def min_key min[0] rescue nil end
Generated with the Darkfish Rdoc Generator 2.