syb-0.7.2.4: Scrap Your Boilerplate
Copyright(c) The University of Glasgow CWI 2001--2003
LicenseBSD-style (see the LICENSE file)
Maintainergenerics@haskell.org
Stabilityexperimental
Portabilitynon-portable (local universal quantification)
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Generics.Schemes

Description

"Scrap your boilerplate" --- Generic programming in Haskell See http://www.cs.uu.nl/wiki/GenericProgramming/SYB. The present module provides frequently used generic traversal schemes.

Synopsis

Documentation

everywhere :: (forall a. Data a => a -> a) -> forall a. Data a => a -> a Source #

Apply a transformation everywhere in bottom-up manner

Since: 0.1.0.0

everywhere' :: (forall a. Data a => a -> a) -> forall a. Data a => a -> a Source #

Apply a transformation everywhere in top-down manner

Since: 0.1.0.0

everywhereBut :: GenericQ Bool -> GenericT -> GenericT Source #

Variation on everywhere with an extra stop condition

Since: 0.1.0.0

everywhereM :: forall m. Monad m => GenericM m -> GenericM m Source #

Monadic variation on everywhere

Since: 0.1.0.0

somewhere :: forall m. MonadPlus m => GenericM m -> GenericM m Source #

Apply a monadic transformation at least somewhere

Since: 0.1.0.0

everything :: forall r. (r -> r -> r) -> GenericQ r -> GenericQ r Source #

Summarise all nodes in top-down, left-to-right order

Since: 0.1.0.0

everythingBut :: forall r. (r -> r -> r) -> GenericQ (r, Bool) -> GenericQ r Source #

Variation of "everything" with an added stop condition

Since: 0.3

everythingWithContext :: forall s r. s -> (r -> r -> r) -> GenericQ (s -> (r, s)) -> GenericQ r Source #

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.

Since: 0.3.7

listify :: Typeable r => (r -> Bool) -> GenericQ [r] Source #

Get a list of all entities that meet a predicate

Since: 0.1.0.0

something :: GenericQ (Maybe u) -> GenericQ (Maybe u) Source #

Look up a subterm by means of a maybe-typed filter

Since: 0.1.0.0

synthesize :: forall s t. s -> (t -> s -> s) -> GenericQ (s -> t) -> GenericQ t Source #

Bottom-up synthesis of a data structure; 1st argument z is the initial element for the synthesis; 2nd argument o is for reduction of results from subterms; 3rd argument f updates the synthesised data according to the given term

Since: 0.1.0.0

gsize :: Data a => a -> Int Source #

Compute size of an arbitrary data structure

Since: 0.1.0.0

glength :: GenericQ Int Source #

Count the number of immediate subterms of the given term

Since: 0.1.0.0

gdepth :: GenericQ Int Source #

Determine depth of the given term

Since: 0.1.0.0

gcount :: GenericQ Bool -> GenericQ Int Source #

Determine the number of all suitable nodes in a given term

Since: 0.1.0.0

gnodecount :: GenericQ Int Source #

Determine the number of all nodes in a given term

Since: 0.1.0.0

gtypecount :: Typeable a => a -> GenericQ Int Source #

Determine the number of nodes of a given type in a given term

Since: 0.1.0.0

gfindtype :: (Data x, Typeable y) => x -> Maybe y Source #

Find (unambiguously) an immediate subterm of a given type

Since: 0.1.0.0