Text +Data -package

module Data.Generics.Text
syb Data.Generics.Text
"Scrap your boilerplate" --- Generic programming in Haskell See http://www.cs.uu.nl/wiki/GenericProgramming/SYB. The present module provides generic operations for text serialisation of terms.
module Data.Text
text Data.Text
A time and space-efficient implementation of Unicode text. Suitable for performance critical use, both in terms of large data quantities and high speed. Note: Read below the synopsis for important notes on the use of this module. This module is intended to be imported qualified, to avoid name clashes with Prelude functions, e.g. > import qualified Data.Text as T To use an extended and very rich family of functions for working with Unicode text (including normalization, regular expressions, non-standard encodings, text breaking, and locales), see the text-icu package: http://hackage.haskell.org/package/text-icu
data Text
text Data.Text.Lazy.Internal, text Data.Text.Lazy
data Text
text Data.Text.Internal, text Data.Text
A space efficient, packed, unboxed Unicode text type.
text :: Array -> Int -> Int -> Text
text Data.Text.Internal
Smart constructor.
textP :: Array -> Int -> Int -> Text
text Data.Text.Internal
Construct a Text without invisibly pinning its byte array in memory if its length has dwindled to zero.
type Context a b = (Adj b, Node, a, Adj b)
fgl Data.Graph.Inductive.Graph
Links to the Node, the Node itself, a label, links from the Node.
context :: Graph gr => gr a b -> Node -> Context a b
fgl Data.Graph.Inductive.Graph
Find the context for the given Node. Causes an error if the Node is not present in the Graph.
type Context' a b = Maybe (Adj b, a, Adj b)
fgl Data.Graph.Inductive.Monad.IOArray
contextM :: GraphM m gr => m (gr a b) -> Node -> m (Context a b)
fgl Data.Graph.Inductive.Monad
everythingWithContext :: s -> (r -> r -> r) -> GenericQ (s -> (r, s)) -> GenericQ r
syb Data.Generics.Schemes
Summarise all nodes in top-down, left-to-right order, carrying some state down the tree during the computation, but not left-to-right to siblings.
fromLazyText :: Text -> Builder
text Data.Text.Lazy.Builder
O(1). A Builder taking a lazy Text, satisfying *  (fromLazyText t) =
fromText :: Text -> Builder
text Data.Text.Lazy.Builder
O(1). A Builder taking a Text, satisfying *  (fromText t) = fromChunks > [
getContext :: GraphM m gr => GT m (gr a b) (Context a b)
fgl Data.Graph.Inductive.Query.Monad
type MContext a b = Maybe (Context a b)
fgl Data.Graph.Inductive.Graph
showText :: Text -> String
text Data.Text.Internal
A useful show-like function for debugging purposes.
toLazyText :: Builder -> Text
text Data.Text.Lazy.Builder
O(n). Extract a lazy Text from a Builder with a default buffer size. The construction work takes place if and when the relevant part of the lazy Text is demanded.
toLazyTextWith :: Int -> Builder -> Text
text Data.Text.Lazy.Builder
O(n). Extract a lazy Text from a Builder, using the given size for the initial buffer. The construction work takes place if and when the relevant part of the lazy Text is demanded. If the initial buffer is too small to hold all data, subsequent buffers will be the default buffer size.
type UContext = ([Node], Node, [Node])
fgl Data.Graph.Inductive.Graph
Unlabeled context.