Priority queue: Difference between revisions

Content added Content deleted

Inline

@@ Line 5,295: / Line 5,295: @@
 ====Advanced version====
 {{works with|FPC}}
-A maximizing priority queue based on a binary heap with the ability to update keys using a special handle. User is responsible for keeping track of when the handle becomes invalid.
+A maximizing priority queue based on a binary heap with the ability to update keys using a special handle. User is responsible for keeping track of when the handle becomes invalid. Comparing elements requires a regular boolean function of the form:
-Comparing elements requires a regular boolean function of the form:
 <syntaxhighlight lang="pascal">
 type
   TComparer<T> = function(const L, R: T): Boolean;
 </syntaxhighlight>
-which should return True if the first argument is less than the second.
+which should return True if the first argument is less than the second. It seems that all operations should be performed in O(NLogN).
 <syntaxhighlight lang="pascal">
 unit PQueue;
@@ Line 5,541: / Line 5,540: @@
 <syntaxhighlight lang="pascal">
 program PqDemo;
-{$mode delphi}{$j-}
+{$mode delphi}
 uses
   SysUtils, PQueue;