
Generics.Regular.Rewriting.Strategies  Portability  nonportable  Stability  experimental  Maintainer  generics@haskell.org 





Description 
Summary: Generic functions for traversal strategies.


Synopsis 

once :: (Regular a, GMap (PF a), Functor m, MonadPlus m) => (a > m a) > a > m a   one :: (Regular a, GMap (PF a), Functor m, MonadPlus m) => (a > m a) > a > m a   topdownM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a > m a) > a > m a   topdown :: Regular a => (a > a) > a > a   bottomupM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a > m a) > a > m a   bottomup :: Regular a => (a > a) > a > a   composM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a > m a) > a > m a   compos :: Regular a => (a > a) > a > a 



Apply a function to the children of a value



Applies a function to the first subtree (possibly the tree itself) on which
it succeeds, using a preorder traversal.



Applies a function to the first immediate child of a value on which it succeeds.


Apply a (monadic) function exhaustively topdown



Applies a monadic function exhaustively in a topdown fashion.



Applies a function exhaustively in a topdown fashion


Apply a (monadic) function exhaustively bottomup



Applies a monadic function exhaustively in a bottomup fashion.



Applies a function exhaustively in a bottomup fashion


Apply a (monadic) function to immediate children



Applies a monadic function to all the immediate children of a value.



Applies a function to all the immediate children of a value.


Produced by Haddock version 2.4.2 