iterate -bytestring

iterate :: (a -> a) -> a -> [a]
base Prelude, base Data.List
iterate f x returns an infinite list of repeated applications of f to x: > iterate f x == [x, f x, f (f x), ...]
package iteratee
The Iteratee monad provides strict, safe, and functional I/O. In addition to pure Iteratee processors, file IO and combinator functions are provided. See Data.Iteratee for full documentation. Version
package iteratee-compress
Enumeratees for compressing and decompressing streams Version
package iteratee-mtl
The Iteratee monad provides strict, safe, and functional I/O. In addition to pure Iteratee processors, file IO and combinator functions are provided. Version
package iteratee-parsec
Package providing instances of Stream in Iteratee monad. Version 0.0.6
package iteratee-stm
Enumerators and iteratees which read from/write to STM channels. This allows for processes with dedicated IO threads. Version 0.1.2
iterateN :: Int -> (a -> a) -> a -> Seq a
containers Data.Sequence
O(n). Constructs a sequence by repeated application of a function to a seed value. > iterateN n f x = fromList (Prelude.take n (Prelude.iterate f x))
package attoparsec-iteratee
An adapter to convert attoparsec Parsers into blazing-fast Iteratees Version 0.4.0
package BlogLiterately
Write blog posts in Markdown format, then use BlogLiterately to do syntax highlighting, format ghci sessions, and upload to any blog supporting the metaWeblog API (such as Wordpress): To get started, use the provided executable BlogLiterately; see for complete documentation. To make further customization possible, the internals of the executable are made available as a library.  In particular, it is easy to create your own executable which adds extra custom transformations; see Text.BlogLiterately.Run. Version
package BlogLiterately-diagrams
A plugin for BlogLiterately ( which turns inline diagrams code into images. This library also provides an executable, BlogLiteratelyD, providing a standard instance of BlogLiterately extended with support for inline diagrams code.  For most users it should suffice to simply use BlogLiteratelyD in place of BlogLiterately. To use it, include code blocks with the dia or dia-def class (using pandoc's special extended Markdown syntax (, or BlogLiterately's extended syntax for tagged code blocks (, like so: > [dia-def] > -- This block produces no output but its > -- declarations will be in scope in all the > -- rest of the diagram blocks. > gSq = square 1 # fc green > NOTE: Square brackets below should be replaced > by curly braces.  Haddock chokes on curly > braces. > Here is a green square: > ```[.dia width='200'] > dia = gSq > ``` > Green squares like `gSq`[.dia height='16'] > and blue circles like `circle 1 # fc blue`[.dia height='16'] > are extremely important. Note that attributes like width and height can also be specified, but be sure to put the numbers in quotes or else they will not parse properly. Running this through BlogLiteratelyD (after replacing square brackets with curly braces) should result in HTML that looks something like this: Tag "</a" [Char '>',Char '\n',Char '\n',Char 'V',Char 'e',Char 'r',Char 's',Char 'i',Char 'o',Char 'n',Char ' ',Char '0',Char '.',Char '1',Char '.',Char '3',Char '.',Char '1',Char '\n']
package coroutine-iteratee
This package acts as a bidirectional bridge between two monad transformers: the Data.Iteratee.Base.Iteratee in the iteratee package, and the Control.Monad.Coroutine.Coroutine in the monad-coroutine package. Version 0.1.1
package hexpat-iteratee
This package provides chunked XML parsing using iteratees.  It is especially suited to implementing XML-based socket protocols, but is useful wherever lazy parsing is needed on production systems where you can't tolerate the problems that come with Haskell's lazy I/O. The XML is presented as a lazy tree, and is processed by a handler implemented using a monad transformer called XMLT.  The resulting monad is suspended whenever it tries to read a part of the tree that hasn't been parsed yet, and continued as soon as it is available. The resulting code looks and functions very much as if you were using lazy I/O, only without the associated problems. Your handlers can have effects, yet they come out in quite a functional style. Background:  Haskell's lazy I/O can be problematic in some applications because it doesn't handle I/O errors properly, and you can't predict when it will clean up its resources, which could result in file handles running out. Version 0.6
package samtools-iteratee
Iteratee interface to SamTools library Version 0.2.2
package snappy-iteratee
package usb-iteratee
This packages provides iteratee enumerators for the usb package. Version 0.5