Okasaki.Protocols.Deque protocol (Okasaki v1.0.1) View Source

Link to this section Summary

Types

t()

Functions

True if the deque is empty.

insert_left(deque, item)

Inserts a new item to the left end of the deque.

insert_right(deque, item)

Inserts a new item to the right end of the deque.

member?(queue, item)

Checks if a certain element is part of the deque.

remove_left(deque)

Removes an item from the left side of the deque.

remove_right(deque)

Removes an item from the right side of the deque.

Returns the number of elements currently in the queue.

Converts the deque to a list.

Link to this section Types

t()

Specs

t() :: term()

Link to this section Functions

empty?(deque)

Specs

empty?(t()) :: boolean()

True if the deque is empty.

insert_left(deque, item)

Specs

insert_left(t(), item :: any()) :: t()

Inserts a new item to the left end of the deque.

insert_right(deque, item)

Specs

insert_right(t(), item :: any()) :: t()

Inserts a new item to the right end of the deque.

member?(queue, item)

Specs

member?(t(), item :: any()) :: boolean()

Checks if a certain element is part of the deque.

remove_left(deque)

Specs

remove_left(t()) :: {:ok, {item :: any(), t()}} | {:error, :empty}

Removes an item from the left side of the deque.

remove_right(deque)

Specs

remove_right(t()) :: {:ok, {item :: any(), t()}} | {:error, :empty}

Removes an item from the right side of the deque.

size(deque)

Specs

size(t()) :: non_neg_integer()

Returns the number of elements currently in the queue.

to_list(deque)

Specs

to_list(t()) :: list()

Converts the deque to a list.