Parsley.Internal.Common.Queue.Impl

Implementation of a FIFO queue structure, with amortized operations.

Since: 1.5.0.0

Documentation

data Queue a

Concrete FIFO Queue, with amortized constant operations.

Since: 1.5.0.0

Constructors

Queue

Fields

• outsz :: Int
• outs :: [a]
• insz :: Int
• ins :: [a]

Instances

QueueLike Queue

Defined in Parsley.Internal.Common.Queue

Methods

empty :: Queue a

null :: Queue a -> Bool

size :: Queue a -> Int

enqueue :: a -> Queue a -> Queue a

dequeue :: Queue a -> (a, Queue a)

enqueueAll :: [a] -> Queue a -> Queue a

Eq a => Eq (Queue a)

Defined in Parsley.Internal.Common.Queue.Impl

Methods

(==) :: Queue a -> Queue a -> Bool

(/=) :: Queue a -> Queue a -> Bool

Show a => Show (Queue a)

Defined in Parsley.Internal.Common.Queue.Impl

Methods

showsPrec :: Int -> Queue a -> ShowS

show :: Queue a -> String

showList :: [Queue a] -> ShowS

empty :: Queue a

Construct an empty queue.

Since: 1.5.0.0

enqueue :: a -> Queue a -> Queue a

Adds an element onto the end of the queue.

Since: 1.5.0.0

enqueueAll :: [a] -> Queue a -> Queue a

Adds each of the elements onto the queue, from left-to-right.

Since: 1.5.0.0

dequeue :: Queue a -> (a, Queue a)

Removes an element from the front of the queue.

Since: 1.5.0.0

null :: Queue a -> Bool

Is the queue empty?

Since: 1.5.0.0

size :: Queue a -> Int

Returns how many elements are in the queue.

Since: 1.5.0.0

foldr :: (a -> b -> b) -> b -> Queue a -> b

Folds the values in the queue.

Since: 1.5.0.0

toList :: Queue a -> [a]

Converts this queue into a list.

Since: 1.5.0.0