(a -> b) -> [a] -> [b] -base -parallel -deepseq

everywhere :: (forall a. Data a => a -> a) -> (forall a. Data a => a -> a)
syb Data.Generics.Schemes
Apply a transformation everywhere in bottom-up manner
everywhere' :: (forall a. Data a => a -> a) -> (forall a. Data a => a -> a)
syb Data.Generics.Schemes
Apply a transformation everywhere in top-down manner
extQ :: (Typeable a, Typeable b) => (a -> q) -> (b -> q) -> a -> q
syb Data.Generics.Aliases
Extend a generic query by a type-specific case
ext1Q :: (Data d, Typeable1 t) => (d -> q) -> (forall e. Data e => t e -> q) -> d -> q
syb Data.Generics.Aliases
Type extension of queries for type constructors
ext2Q :: (Data d, Typeable2 t) => (d -> q) -> (forall d1 d2. (Data d1, Data d2) => t d1 d2 -> q) -> d -> q
syb Data.Generics.Aliases
Type extension of queries for type constructors
(<<) :: HTML a => (Html -> b) -> a -> b
html Text.Html
(<<) :: HTML a => (Html -> b) -> a -> b
xhtml Text.XHtml.Strict, xhtml Text.XHtml.Frameset, xhtml Text.XHtml.Transitional
Put something inside an HTML element.
mkQ :: (Typeable a, Typeable b) => r -> (b -> r) -> a -> r
syb Data.Generics.Aliases
Make a generic query; start from a type-specific case; return a constant otherwise
extT :: (Typeable a, Typeable b) => (a -> a) -> (b -> b) -> a -> a
syb Data.Generics.Aliases
Extend a generic transformation by a type-specific case
(>$<) :: Contravariant f => (b -> a) -> f a -> f b
bytestring Data.ByteString.Builder.Prim
A fmap-like operator for builder primitives, both bounded and fixed size. Builder primitives are contravariant so it's like the normal fmap, but backwards (look at the type). (If it helps to remember, the operator symbol is like ($) but backwards.) We can use it for example to prepend and/or append fixed values to an primitive. > showEncoding ((\x -> ('\'', (x, '\''))) >$< fixed3) 'x' = "'x'" > > fixed3 = char7 >*< char7 >*< char7 Note that the rather verbose syntax for composition stems from the requirement to be able to compute the size / size bound at compile time.
local :: MonadReader r m => (r -> r) -> m a -> m a
mtl Control.Monad.Reader.Class, mtl Control.Monad.Reader
censor :: MonadWriter w m => (w -> w) -> m a -> m a
mtl Control.Monad.Writer.Class, mtl Control.Monad.Writer.Lazy, mtl Control.Monad.Writer.Strict
censor f m is an action that executes the action m and applies the function f to its output, leaving the return value unchanged. *  f m = pass (liftM (\x -> > (x,f))  
mkT :: (Typeable a, Typeable b) => (b -> b) -> a -> a
syb Data.Generics.Aliases
Make a generic transformation; start from a type-specific case; preserve the term otherwise
ext1T :: (Data d, Typeable1 t) => (forall e. Data e => e -> e) -> (forall f. Data f => t f -> t f) -> d -> d
syb Data.Generics.Aliases
Type extension of transformations for unary type constructors
ext2T :: (Data d, Typeable2 t) => (forall e. Data e => e -> e) -> (forall d1 d2. (Data d1, Data d2) => t d1 d2 -> t d1 d2) -> d -> d
syb Data.Generics.Aliases
Type extension of transformations for unary type constructors