protocol
queuep¶
Queue protocol.
Author: Paulo Moura
Version: 1:2:0
Date: 2019-05-23
Compilation flags:
staticDependencies:
(none)
Remarks:
(none)
Inherited public predicates:
(none)
Public predicates¶
empty/1¶
True if the queue is empty.
Compilation flags:
staticTemplate:
empty(Queue)Mode and number of proofs:
empty(@queue) - zero_or_onehead/2¶
Unifies Head with the first element of the queue.
Compilation flags:
staticTemplate:
head(Queue,Head)Mode and number of proofs:
head(+queue,?term) - zero_or_onejoin/3¶
Adds the new element at the end of the queue.
Compilation flags:
staticTemplate:
join(Element,Queue,NewQueue)Mode and number of proofs:
join(@term,+queue,-queue) - zero_or_onejoin_all/3¶
Adds the new elements at the end of the queue. The elements are added in the same order that they appear in the list.
Compilation flags:
staticTemplate:
join_all(List,Queue,NewQueue)Mode and number of proofs:
join_all(+list,+queue,-queue) - zero_or_onejump/3¶
Adds the new element at the front of the queue.
Compilation flags:
staticTemplate:
jump(Element,Queue,NewQueue)Mode and number of proofs:
jump(@term,+queue,-queue) - zero_or_onejump_all/3¶
Adds the new elements at the front of the queue. The elements are added in the same order that they appear in the list.
Compilation flags:
staticTemplate:
jump_all(Elements,Queue,NewQueue)Mode and number of proofs:
jump_all(+list,+queue,-queue) - zero_or_onelength/2¶
Queue length.
Compilation flags:
staticTemplate:
length(Queue,Length)Mode and number of proofs:
length(+heap,?integer) - zero_or_oneProtected predicates¶
(none)
Private predicates¶
(none)