rewriting-0.1: Generic rewriting library for regular datatypes. Source code Contents Index

Generics.Regular.Rewriting.Strategies Portability non-portable Stability experimental Maintainer generics@haskell.org

Contents Apply a function to the children of a value Apply a (monadic) function exhaustively top-down Apply a (monadic) function exhaustively bottom-up Apply a (monadic) function to immediate children

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

once :: (Regular a, GMap (PF a), Functor m, MonadPlus m) => (a -> m a) -> a -> m a Source

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

one :: (Regular a, GMap (PF a), Functor m, MonadPlus m) => (a -> m a) -> a -> m a Source

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

Apply a (monadic) function exhaustively top-down

topdownM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a -> m a) -> a -> m a Source

Applies a monadic function exhaustively in a top-down fashion.

topdown :: Regular a => (a -> a) -> a -> a Source

Applies a function exhaustively in a top-down fashion

Apply a (monadic) function exhaustively bottom-up

bottomupM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a -> m a) -> a -> m a Source

Applies a monadic function exhaustively in a bottom-up fashion.

bottomup :: Regular a => (a -> a) -> a -> a Source

Applies a function exhaustively in a bottom-up fashion

Apply a (monadic) function to immediate children

composM :: (Regular a, GMap (PF a), Functor m, Monad m) => (a -> m a) -> a -> m a Source

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

compos :: Regular a => (a -> a) -> a -> a Source

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

Produced by Haddock version 2.4.2