protocol
queuep
¶
Queue protocol.
Author: Paulo Moura
Version: 1:2:1
Date: 2020-03-25
Compilation flags:
static
Dependencies:
(none)
Remarks:
(none)
Inherited public predicates:
(none)
Public predicates¶
empty/1
¶
True if the queue is empty.
Compilation flags:
static
Template:
empty(Queue)
Mode and number of proofs:
empty(@queue)
- zero_or_one
head/2
¶
Unifies Head
with the first element of the queue.
Compilation flags:
static
Template:
head(Queue,Head)
Mode and number of proofs:
head(+queue,?term)
- zero_or_one
join/3
¶
Adds the new element at the end of the queue.
Compilation flags:
static
Template:
join(Element,Queue,NewQueue)
Mode and number of proofs:
join(@term,+queue,-queue)
- zero_or_one
join_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:
static
Template:
join_all(List,Queue,NewQueue)
Mode and number of proofs:
join_all(+list,+queue,-queue)
- zero_or_one
jump/3
¶
Adds the new element at the front of the queue.
Compilation flags:
static
Template:
jump(Element,Queue,NewQueue)
Mode and number of proofs:
jump(@term,+queue,-queue)
- zero_or_one
jump_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:
static
Template:
jump_all(Elements,Queue,NewQueue)
Mode and number of proofs:
jump_all(+list,+queue,-queue)
- zero_or_one
length/2
¶
Queue length.
Compilation flags:
static
Template:
length(Queue,Length)
Mode and number of proofs:
length(+heap,?integer)
- zero_or_one
Protected predicates¶
(none)
Private predicates¶
(none)