dlist-0.7.1.2: Difference lists

Copyright | (c) 2006-2009 Don Stewart, 2013-2014 Sean Leather
License | See LICENSE file
Maintainer | sean.leather@gmail.com
Stability | stable
Portability | portable
Safe Haskell | None
Language | Haskell98

Data.DList

Contents

- Construction
- Basic functions

Description

Difference lists: a data structure for O(1) append on lists.

Synopsis

- data DList a
- fromList :: [a] -> DList a
- toList :: DList a -> [a]
- apply :: DList a -> [a] -> [a]
- empty :: DList a
- singleton :: a -> DList a
- cons :: a -> DList a -> DList a
- snoc :: DList a -> a -> DList a
- append :: DList a -> DList a -> DList a
- concat :: [DList a] -> DList a
- replicate :: Int -> a -> DList a
- list :: b -> (a -> DList a -> b) -> DList a -> b
- head :: DList a -> a
- tail :: DList a -> DList a
- unfoldr :: (b -> Maybe (a, b)) -> b -> DList a
- foldr :: (a -> b -> b) -> b -> DList a -> b
- map :: (a -> b) -> DList a -> DList b

# Documentation

data DList a Source

A difference list is a function that, given a list, returns the original contents of the difference list prepended to the given list.

This structure supports O(1) append and snoc operations on lists, making it very useful for append-heavy uses (esp. left-nested uses of `++`), such as logging and pretty printing.

Here is an example using DList as the state type when printing a tree with the Writer monad:

    import Control.Monad.Writer
    import Data.DList

    data Tree a = Leaf a | Branch (Tree a) (Tree a)

    flatten_writer :: Tree x -> DList x
    flatten_writer = snd . runWriter . flatten
        where
          flatten (Leaf x)     = tell (singleton x)
          flatten (Branch x y) = flatten x >> flatten y

Instances

Monad DList Source |
Functor DList Source |
Applicative DList Source |
Foldable DList Source |
Alternative DList Source |
MonadPlus DList Source |
IsList (DList a) Source |
Eq a => Eq (DList a) Source |
Ord a => Ord (DList a) Source |
Read a => Read (DList a) Source |
Show a => Show (DList a) Source |
IsString (DList Char) Source |
Monoid (DList a) Source |
NFData a => NFData (DList a) Source |
type Item (DList a) = a Source |

# Construction

fromList :: [a] -> DList a Source

Convert a list to a dlist

toList :: DList a -> [a] Source

Convert a dlist to a list

apply :: DList a -> [a] -> [a] Source

Apply a dlist to a list to get the underlying list with an extension

    apply (fromList xs) ys = xs ++ ys

# Basic functions

empty :: DList a Source

Create a dlist containing no elements

singleton :: a -> DList a Source

Create dlist with a single element

cons :: a -> DList a -> DList a infixr 9 Source

O(1). Prepend a single element to a dlist

snoc :: DList a -> a -> DList a infixl 9 Source

O(1). Append a single element to a dlist

append :: DList a -> DList a -> DList a Source

O(1). Append dlists

concat :: [DList a] -> DList a Source

O(spine). Concatenate dlists

replicate :: Int -> a -> DList a Source

O(n). Create a dlist of the given number of elements

list :: b -> (a -> DList a -> b) -> DList a -> b Source

O(n). List elimination for dlists

head :: DList a -> a Source

O(n). Return the head of the dlist

tail :: DList a -> DList a Source

O(n). Return the tail of the dlist

unfoldr :: (b -> Maybe (a, b)) -> b -> DList a Source

O(n). Unfoldr for dlists

foldr :: (a -> b -> b) -> b -> DList a -> b Source

O(n). Foldr over difference lists

map :: (a -> b) -> DList a -> DList b Source

O(n). Map over difference lists.