License | BSD-3-Clause |
---|---|
Maintainer | Jamie Willis |
Stability | experimental |
Safe Haskell | None |
Language | Haskell2010 |
Implementation of a FIFO queue structure, with amortized operations.
Since: 1.5.0.0
Synopsis
- data Queue a = Queue {}
- empty :: Queue a
- enqueue :: a -> Queue a -> Queue a
- enqueueAll :: [a] -> Queue a -> Queue a
- dequeue :: Queue a -> (a, Queue a)
- poke :: (a -> a) -> Queue a -> (a, Queue a)
- null :: Queue a -> Bool
- size :: Queue a -> Int
- foldr :: (a -> b -> b) -> b -> Queue a -> b
- toList :: Queue a -> [a]
Documentation
Concrete FIFO Queue, with amortized constant operations.
Since: 1.5.0.0
enqueueAll :: [a] -> Queue a -> Queue a Source #
Adds each of the elements onto the queue, from left-to-right.
Since: 1.5.0.0
dequeue :: Queue a -> (a, Queue a) Source #
Removes an element from the front of the queue.
Since: 1.5.0.0