uulib-0.9.10: Haskell Utrecht Tools Library Source code Contents Index

UU.DData.Queue

Contents Queue type Operators Query Construction Filter Fold Conversion List

Description

Synopsis

data Queue a (<>) :: Queue a -> Queue a -> Queue a isEmpty :: Queue a -> Bool length :: Queue a -> Int head :: Queue a -> a tail :: Queue a -> Queue a front :: Queue a -> Maybe (a, Queue a) empty :: Queue a single :: a -> Queue a insert :: a -> Queue a -> Queue a append :: Queue a -> Queue a -> Queue a filter :: (a -> Bool) -> Queue a -> Queue a partition :: (a -> Bool) -> Queue a -> (Queue a, Queue a) foldL :: (b -> a -> b) -> b -> Queue a -> b foldR :: (a -> b -> b) -> b -> Queue a -> b elems :: Queue a -> [a] toList :: Queue a -> [a] fromList :: [a] -> Queue a

Queue type

data Queue a Source

Operators

(<>) :: Queue a -> Queue a -> Queue a Source

O(n). Append two queues, see append.

Query

isEmpty :: Queue a -> Bool Source

O(1). Is the queue empty?

length :: Queue a -> Int Source

O(n). The number of elements in the queue.

head :: Queue a -> a Source

O(1). The element in front of the queue. Raises an error when the queue is empty.

tail :: Queue a -> Queue a Source

O(1). The tail of the queue. Raises an error when the queue is empty.

front :: Queue a -> Maybe (a, Queue a) Source

O(1). The head and tail of the queue.

Construction

empty :: Queue a Source

O(1). The empty queue.

single :: a -> Queue a Source

O(1). A queue of one element.

insert :: a -> Queue a -> Queue a Source

O(1). Insert an element at the back of a queue.

append :: Queue a -> Queue a -> Queue a Source

O(n). Append two queues.

Filter

filter :: (a -> Bool) -> Queue a -> Queue a Source

O(n). Filter elements according to some predicate.

partition :: (a -> Bool) -> Queue a -> (Queue a, Queue a) Source

O(n). Partition the elements according to some predicate.

Fold

foldL :: (b -> a -> b) -> b -> Queue a -> b Source

O(n). Fold over the elements from left to right (ie. head to tail).

foldR :: (a -> b -> b) -> b -> Queue a -> b Source

O(n). Fold over the elements from right to left (ie. tail to head).

Conversion

elems :: Queue a -> [a] Source

O(n). The elements of a queue.

List

toList :: Queue a -> [a] Source

O(n). Convert to a list.

fromList :: [a] -> Queue a Source

O(n). Convert from a list.

Produced by Haddock version 2.6.0