File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -17,13 +17,14 @@ comparison block given at instantiation time. Also, retrieving an element
1717from the queue will always return the one with the highest priority
1818(see #pop and #top).
1919
20- The default is to compare the elements in repect to their #> method.
20+ The default is to compare the elements in repect to their #<= > method.
2121For example, Numeric elements with higher values will have higher
2222priorities.
2323
24- This library is based off the original PQueue.rb by K.Kodama and
24+ This library is a rewrite of the original PQueue.rb by K. Kodama and
2525Heap.rb by Ronald Butler. The two libraries were later merged
26- and generally improved by Olivier Renaud.
26+ and generally improved by Olivier Renaud. Then the whole library
27+ rewritten by Trans using the orginal as a functional reference.
2728
2829
2930== SYNOPSIS
@@ -44,14 +45,13 @@ contributors.
4445* Olivier Renaud (2007)
4546* Rick Bradley (2003)
4647* Ronald Butler (2002)
47- * K. Kodama (2001, original library)
48+ * K Kodama (2001, original library)
4849
4950
5051== COPYRIGHTS
5152
52- Copyright (c) 2011 Rubyworks.
53+ Copyright (c) 2011 Rubyworks
5354
5455PQueue is distributable in accordance with the *FreeBSD* license.
5556
5657See the COPYING.rdoc file for details.
57-
You can’t perform that action at this time.
0 commit comments