Priority queue: Difference between revisions

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

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