Learn R Programming

rstackdeque (version 1.1.1)

without_front.rpqueue: Return a version of an rpqueue without the front element

Description

Simply returns a version of the given rpqueue without the front element. Results in an error if the structure is empty. The original rpqueue is left alone.

Usage

"without_front"(x, ...)

Arguments

x
rpqueue to remove elements from.
...
additional arguments to be passed to or from methods (ignored).

Value

version of the rpqueue with the front element removed.

Details

Runs in $O(1)$ worst case time.

References

Okasaki, Chris. Purely Functional Data Structures. Cambridge University Press, 1999.

See Also

peek_front for accessing the front element.

Examples

Run this code
q <- rpqueue()
q <- insert_back(q, "a")
q <- insert_back(q, "b")
q <- insert_back(q, "c")

q2 <- without_front(q)
print(q2)

q3 <- without_front(q)
print(q3)

print(q)

Run the code above in your browser using DataLab