Data.Data

mkT :: forall a b. Typeable a => Typeable b => (b -> b) -> a -> a

mkQ :: forall a b r. Typeable a => Typeable b => r -> (b -> r) -> a -> r

mkM :: forall a b m. Typeable a => Typeable b => Typeable (m a) => Typeable (m b) => Applicative m => (b -> m b) -> a -> m a

newtype DataDict a

Constructors

• DataDict (forall c. (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> a -> c a)

gfoldl :: forall a c. Data a => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> a -> c a

class (Typeable a) <= Data a  where

Members

• dataDict :: DataDict a

Instances

• (Data a) => Data (Array a)

  Left-associative fold operation for constructor applications.

• (Data a) => Data (Maybe a)
• (Data a, Data b) => Data (Either a b)
• Data Boolean
• Data Int
• Data Number
• Data Char
• Data String
• Data Unit
• Data Ordering

gmapT :: forall a. Data a => (forall b. Data b => b -> b) -> a -> a

A generic transformation that maps over the immediate subterms

gmapQl :: forall a r r'. Data a => (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r

A generic query with a left-associative binary operator

gmapQr :: forall a r r'. Data a => (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r

A generic query with a right-associative binary operator

gmapQ :: forall a u. Data a => (forall d. Data d => d -> u) -> a -> Array u

A generic query that processes the immediate subterms and returns a list

gmapQi :: forall u a. Data a => Int -> (forall d. Data d => d -> u) -> a -> u

A generic query that processes one child by index (zero-based)

gmapM :: forall m a. Data a => Monad m => (forall d. Data d => d -> m d) -> a -> m a

A generic monadic transformation that maps over the immediate subterms

gmapMp :: forall m a. Data a => MonadPlus m => (forall d. Data d => d -> m d) -> a -> m a

Transformation of at least one immediate subterm does not fail

gmapMo :: forall m a. Data a => MonadPlus m => (forall d. Data d => d -> m d) -> a -> m a

Transformation of one immediate subterm with success

data Qi :: forall k. Type -> k -> Typedata Qi q a

Type constructor for adding counters to queries

Constructors

• Qi Int (Maybe q)

newtype Qr :: forall k. Type -> k -> Typenewtype Qr r a

The type constructor used in definition of gmapQr

Constructors

• Qr (r -> r)

unQr :: forall r a. Qr r a -> r -> r

newtype Mp :: (Type -> Type) -> Type -> Typenewtype Mp m x

The type constructor used in definition of gmapMp

Constructors

• Mp (m (Tuple x Boolean))

unMp :: forall m x. Mp m x -> m (Tuple x Boolean)

everywhere :: forall a. Data a => (forall b. Data b => b -> b) -> a -> a

Apply a transformation everywhere, bottom-up

everywhere' :: forall a. Data a => (forall b. Data b => b -> b) -> a -> a

Apply a transformation everywhere, top-down

everything :: forall a r. Data a => (r -> r -> r) -> (forall b. Data b => b -> r) -> a -> r

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

everywhereM :: forall m a. Monad m => Data a => (forall b. Data b => b -> m b) -> a -> m a

Apply a monadic transformation everywhere, bottom-up