.. index:: single: heap(Order) .. _heap/1:

.. rst-class:: right

object

heap(Order)

• Order - Either < for a min heap or > for a max heap. Heap implementation, parameterized by the order to be used to compare keys (< or >). Deprecated. Use the binary_heap/1 object instead.

  | Availability: | logtalk_load(heaps(loader))

  | Author: Paulo Moura | Version: 1:0:0 | Date: 2026-01-28

  | Compilation flags: | static, context_switching_calls

  | Extends: | public :ref:`binary_heap(Order) <binary_heap/1>`

  | Remarks: | (none)

  | Inherited public predicates: | Â :ref:`comparingp/0::(<)/2` Â :ref:`comparingp/0::(=:=)/2` Â :ref:`comparingp/0::(=<)/2` Â :ref:`comparingp/0::(=\=)/2` Â :ref:`comparingp/0::(>)/2` Â :ref:`comparingp/0::(>=)/2` Â :ref:`heap_protocol/0::as_heap/2` Â :ref:`heap_protocol/0::as_list/2` Â :ref:`termp/0::check/1` Â :ref:`heap_protocol/0::delete/4` Â :ref:`termp/0::depth/2` Â :ref:`heap_protocol/0::empty/1` Â :ref:`termp/0::ground/1` Â :ref:`heap_protocol/0::insert/4` Â :ref:`heap_protocol/0::insert_all/3` Â :ref:`heap_protocol/0::merge/3` Â :ref:`termp/0::new/1` Â :ref:`termp/0::numbervars/1` Â :ref:`termp/0::numbervars/3` Â :ref:`termp/0::occurs/2` Â :ref:`termp/0::singletons/2` Â :ref:`heap_protocol/0::size/2` Â :ref:`termp/0::subsumes/2` Â :ref:`termp/0::subterm/2` Â :ref:`heap_protocol/0::top/3` Â :ref:`heap_protocol/0::top_next/5` Â :ref:`termp/0::valid/1` Â :ref:`termp/0::variables/2` Â :ref:`termp/0::variant/2` Â :ref:`termp/0::varnumbers/2` Â :ref:`termp/0::varnumbers/3` Â

  .. contents:: :local: :backlinks: top

Public predicates

(no local declarations; see entity ancestors if any)

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)

.. seealso::

:ref:`binary_heap(Order) <binary_heap/1>`