Modulesyb-0.7.3Haskell98

Data.Generics.Schemes

"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.

18 values

Packagesyb-0.7.3
Exports18
LanguageHaskell98
LicenceBSD-3-Clause
SourceSchemes.hs

valueeverywhere :: (forall a. Data a => a -> a) -> forall a. Data a => a -> a

Apply a transformation everywhere in bottom-up manner

valueeverywhere' :: (forall a. Data a => a -> a) -> forall a. Data a => a -> a

Apply a transformation everywhere in top-down manner

valueeverywhereBut :: GenericQ Bool -> GenericT -> GenericT

Variation on everywhere with an extra stop condition

valueeverywhereM :: Monad m => GenericM m -> GenericM m

Monadic variation on everywhere

valuesomewhere :: MonadPlus m => GenericM m -> GenericM m

Apply a monadic transformation at least somewhere

valueeverything :: (r -> r -> r) -> GenericQ r -> GenericQ r

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

valueeverythingBut :: (r -> r -> r) -> GenericQ (r, Bool) -> GenericQ r

Variation of "everything" with an added stop condition

valueeverythingWithContext

:: s
-> r -> r -> r
-> GenericQ (s -> (r, s))
-> GenericQ r

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.

valuelistify :: Typeable r => (r -> Bool) -> GenericQ [r]

Get a list of all entities that meet a predicate

valuesomething :: GenericQ (Maybe u) -> GenericQ (Maybe u)

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

valuesynthesize :: s -> (t -> s -> s) -> GenericQ (s -> t) -> GenericQ t

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

valuegsize :: Data a => a -> Int

Compute size of an arbitrary data structure

valueglength :: GenericQ Int

Count the number of immediate subterms of the given term

valuegdepth :: GenericQ Int

Determine depth of the given term

valuegcount :: GenericQ Bool -> GenericQ Int

Determine the number of all suitable nodes in a given term

valuegnodecount :: GenericQ Int

Determine the number of all nodes in a given term

valuegtypecount :: Typeable a => a -> GenericQ Int

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

valuegfindtype :: (Data x, Typeable y) => x -> Maybe y

Find (unambiguously) an immediate subterm of a given type