Okasaki.Implementations.AmortizedDeque (Okasaki v1.0.1) View Source

The standard implementation of a deque as a pair of lists.

This implementation is somewhat simpler than the guaranteed constant-time implementation in Queue, but any particular remove might take O(n).

Link to this section Summary

t()

Callback implementation for FunLand.Mappable.map/2.

(opaque)

t()

empty(opts :: keyword()) :: t()

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

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

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

map(t(), (any() -> any())) :: t()

Callback implementation for FunLand.Mappable.map/2.

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

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

size(t()) :: non_neg_integer()