Data.Generics.ClassyPlate.Core

Documentation

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

Traverse the data structure with a polymorphic function.

classyTraverseM :: forall c b m. (ClassyPlate c b, Monad m) => (forall 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. c a => a -> a) -> (forall a. c a => a -> Bool) -> b -> b

Traverse only those parts that are selected by the given selector function.

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

Traverse only those parts that are selected by the given monadic selector function.

smartTraverse :: forall c b. SmartClassyPlate c (ClassIgnoresSubtree c b) b => (forall 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. 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

class GoodOperationFor c b => ClassyPlate c b where

A class for traversals that use a polymorphic function to visit all applicable elements.

Minimal complete definition

classyTraverse_, classyTraverseM_, selectiveTraverse_, selectiveTraverseM_

Methods

classyTraverse_ :: ClsToken c -> (forall a. c a => a -> a) -> b -> b

classyTraverseM_ :: Monad m => ClsToken c -> (forall a. c a => a -> m a) -> b -> m b

selectiveTraverse_ :: ClsToken c -> (forall a. c a => a -> a) -> (forall a. c a => a -> Bool) -> b -> b

selectiveTraverseM_ :: Monad m => ClsToken c -> (forall a. c a => a -> m a) -> (forall a. c a => a -> m Bool) -> b -> m b

class GoodOperationForAuto c b => SmartClassyPlate c sel b where

A class for traversals that use a polymorphic function to visit all applicable elements but only visit the parts where the applicable elements could be found.

Minimal complete definition

smartTraverse_, smartTraverseM_

Methods

smartTraverse_ :: FlagToken sel -> ClsToken c -> (forall a. c a => a -> a) -> b -> b

smartTraverseM_ :: Monad m => FlagToken sel -> ClsToken c -> (forall a. c a => a -> m a) -> b -> m b

Instances

GoodOperationForAuto c b => SmartClassyPlate c True b

Methods

smartTraverse_ :: FlagToken True -> ClsToken c -> (forall a. c a => a -> a) -> b -> b

smartTraverseM_ :: Monad m => FlagToken True -> ClsToken c -> (forall a. c a => a -> m a) -> b -> m b

classyTraverse_ :: ClassyPlate c b => ClsToken c -> (forall a. c a => a -> a) -> b -> b

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

selectiveTraverse_ :: ClassyPlate c b => ClsToken c -> (forall a. c a => a -> a) -> (forall a. c a => a -> Bool) -> b -> b

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

smartTraverse_ :: SmartClassyPlate c sel b => FlagToken sel -> ClsToken c -> (forall a. c a => a -> a) -> b -> b

smartTraverseM_ :: (SmartClassyPlate c sel b, Monad m) => FlagToken sel -> ClsToken c -> (forall a. c a => a -> m a) -> b -> m b

app :: App flag c b => FlagToken flag -> ClsToken c -> (forall a. c a => a -> a) -> b -> b

appM :: (App flag c b, Monad m) => FlagToken flag -> ClsToken c -> (forall a. c a => a -> m a) -> b -> m b

appIf :: forall c b. App (AppSelector c b) c b => ClsToken c -> (forall a. c a => a -> a) -> (forall a. c a => a -> Bool) -> b -> b -> b

appIfM :: forall c b m. (App (AppSelector c b) c b, Monad m) => ClsToken c -> (forall a. c a => a -> m a) -> (forall a. c a => a -> m Bool) -> b -> m b -> m b

type GoodOperationFor c e = App (AppSelector c e) c e

type GoodOperationForAuto c e = (GoodOperationFor c e, Generic e)

data FlagToken c

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