Priority queue: Difference between revisions

Logtalk comes with a [https://github.com/LogtalkDotOrg/logtalk3/tree/master/library/heaps heap implementation] out of the box. As such it by definition also has a priority queue. It can be used at the toplevel like this (with some formatting changes for clarity, and '<code>%'</code> marking comments that would not be in the output):

Since `<code>heap`(Ordering)</code> is a parametrized object in Logtalk, with the parameter being the ordering predicate, we actually use `<code>heap(<)`</code> object to get min ordering. There are two objects provided in Logtalk that eliminate the unnecessary replication of the two most common orderings:

Given the presence of these two objects, all of the example code above could have `<code>heap(<)`</code> replaced with `<code>minheap`</code> for identical results (including identical performance). It also illustrates how quickly and easily other orderings could be provided at need.