Copyright	(c) Atze van der Ploeg 2013
License	BSD-style
Maintainer	atzeus@gmail.org
Stability	provisional
Portability	portable
Safe Haskell	Safe-Inferred
Language	Haskell98

Data.Sequence.ToCatQueue

Description

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

Synopsis

Documentation

module Data.SequenceClass

data ToCatQueue q a Source

The catenable queue type. The first type argument is the type of the queue we use (|>)

Instances

Functor q => Functor (ToCatQueue q)
Foldable q => Foldable (ToCatQueue q)
Traversable q => Traversable (ToCatQueue q)
Sequence q => Sequence (ToCatQueue q)