Copyright | (c) Atze van der Ploeg 2013 |
---|---|
License | BSD-style |
Maintainer | atzeus@gmail.org |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell98 |
A purely functional catenable queue representation with that turns takes a purely functional queue and turns in it into a catenable queue, i.e. with the same complexity for (>as for (|) Based on Purely functional data structures by Chris Okasaki section 7.2: Catenable lists
- data ToCatQueue q c x y
Documentation
data ToCatQueue q c x y Source
The catenable queue type. The first type argument is the type of the queue we use (|>)
TASequence q => TASequence (ToCatQueue q) |