min_of_heap/5

Did you know ... Search Documentation:

SWI-Prolog owl logo Predicate min_of_heap/5

HOME
DOWNLOAD
DOCUMENTATION
- Manual
- Packages
- FAQ
- Command line
- PlDoc
- Bluffers▶
- License
- Publications
- Rev 7 Extensions
TUTORIALS
- Beginner▶
- Advanced▶
- Web applications▶
- Semantic web▶
  - ClioPatriaExternal
  - RDF namespaces
- Graphics▶
  - XPCE
  - GUI options
- Machine learning▶
  - Probabilistic Logic ProgrammingExternal
- External collections▶
  - Meta level tutorialsExternal
- For packagers▶
  - Linux packages
COMMUNITY
COMMERCIAL
WIKI
- Login
- View changes
- Sandbox
- Wiki help
- All tags

Documentation
- Reference manual
  - The SWI-Prolog library
    - library(heaps): heaps/priority queues
- Packages

Availability::- use_module(library(heaps)).(can be autoloaded)

Source [semidet]min_of_heap(+Heap, ?Key1, ?Value1, ?Key2, ?Value2)

Gets the two minimum-priority elements from Heap. Complexity: logarithmic (amortized).

bug: This predicate is extremely inefficient and exists for compatibility with earlier implementations of this library and SICStus compatibility. It performs a linear amount of work in the worst case that a following get_from_heap has to re-do.

Tags are associated to your profile if you are logged in

Tags:

login to add a new annotation post.