Did you know ...
Search Documentation:
Predicate min_of_heap/3
HOME
DOWNLOAD
SWI-Prolog
Sources/building
Docker images
Add-ons
Browse GIT
DOCUMENTATION
Manual
Packages
FAQ
Command line
PlDoc
Bluffers
▶
Prolog syntax
PceEmacs
HTML generation
License
Publications
Rev 7 Extensions
TUTORIALS
Beginner
▶
Getting started
Learn Prolog Now!
Simply Logical
Debugger
Development tools
Advanced
▶
Modules
Grammars (DCGs)
clp(fd)
Printing messages
PlDoc
Web applications
▶
Web applications
Let's Encrypt!
Pengines
Semantic web
▶
ClioPatria
RDF namespaces
Graphics
▶
XPCE
GUI options
Machine learning
▶
Probabilistic Logic Programming
External collections
▶
Meta level tutorials
For packagers
▶
Linux packages
COMMUNITY
IRC
Forum & mailing list
Blog
News
Report a bug
Submit a patch
Submit an add-on
Roadmap (on GitHub)
External links
Contributing
Code of Conduct
Contributors
SWI-Prolog items
COMMERCIAL
WIKI
Login
View changes
Sandbox
Wiki help
All tags
Documentation
Reference manual
The SWI-Prolog library
library(heaps): heaps/priority queues
add_to_heap/4
delete_from_heap/4
empty_heap/1
singleton_heap/3
get_from_heap/4
heap_size/2
heap_to_list/2
is_heap/1
list_to_heap/2
min_of_heap/3
min_of_heap/5
merge_heaps/3
Packages
Availability:
:- use_module(
library(heaps)
).
(can be autoloaded)
[semidet]
min_of_heap
(
+Heap, ?Priority, ?Key
)
Unifies
Key
with the minimum-priority element of
Heap
and
Priority
with its priority value. Complexity: constant.