Data.Generics.ClassyPlate.Common

Wrappers and common functionality for classyplates

Documentation

class MonoMatch a b where

A class for the simple case when the applied function is monomorphic.

Minimal complete definition

monoApp

Methods

monoApp :: (a -> a) -> b -> b

Apply a monomorphic function on a polymorphic data structure.

Instances

MonoMatch a a

Methods

monoApp :: (a -> a) -> a -> a

type AppSelector (MonoMatch a) b

type AppSelector (MonoMatch a) b = TypEq a b

type family TypEq a b :: Bool where ...

Equations

TypEq a a = True

TypEq a b = False

descend :: forall c b. ClassyPlate c b => (forall a. (ClassyPlate c a, c a) => a -> a) -> b -> b

Go down one level in the data structure and apply the given polymorphic function

descendM :: forall c b m. (ClassyPlate c b, Monad m) => (forall a. (ClassyPlate c a, c a) => a -> m a) -> b -> m b

topDown :: forall c b. ClassyPlate c b => (forall a. (ClassyPlate c a, c a) => a -> a) -> b -> b

Traverse the data structure in a top-down fashion with a polymorphic function.

topDownM :: forall c b m. (ClassyPlate c b, Monad m) => (forall a. (ClassyPlate c a, c a) => a -> m a) -> b -> m b

bottomUp :: forall c b. ClassyPlate c b => (forall a. (ClassyPlate c a, c a) => a -> a) -> b -> b

Traverse the data structure with a polymorphic function.

bottomUpM :: forall c b m. (ClassyPlate c b, Monad m) => (forall a. (ClassyPlate c a, c a) => a -> m a) -> b -> m b

Traverse the data structure with a polymorphic monadic function.

selectiveTraverse :: forall c b. ClassyPlate c b => (forall a. (ClassyPlate c a, c a) => a -> (a, Bool)) -> b -> b

Traverse the data structure selectively with a function specifying if need to go down on the subtrees.

selectiveTraverseM :: forall c b m. (Monad m, ClassyPlate c b) => (forall a. (ClassyPlate c a, c a) => a -> m (a, Bool)) -> b -> m b

Traverse the data structure selectively with a monadic function specifying if need to go down on the subtrees.

smartTraverse :: forall c b. SmartClassyPlate c (ClassIgnoresSubtree c b) b => (forall a. (ClassyPlate c a, c a) => a -> a) -> b -> b

Traverse only those parts of the data structure that could possibly contain elements that the given function can be applied on

smartTraverseM :: forall c b m. (SmartClassyPlate c (ClassIgnoresSubtree c b) b, Monad m) => (forall a. (ClassyPlate c a, c a) => a -> m a) -> b -> m b

Traverse only those parts of the data structure that could possibly contain elements that the given monadic function can be applied on