BNFC.Utils.Decoration

Documentation

class Functor t => Decoration t where

A decoration is a functor that is traversable into any functor.

The Functor superclass is given because of the limitations of the Haskell class system. traverseF actually implies functoriality.

Minimal complete definition: traverseF or distributeF.

Minimal complete definition

(traverseF | distributeF), (traverseF2 | distributeF2)

Methods

traverseF :: Functor m => (a -> m b) -> t a -> m (t b)

traverseF is the defining property.

distributeF :: Functor m => t (m a) -> m (t a)

Decorations commute into any functor.

traverseF2 :: Bifunctor m => (a -> m b c) -> t a -> m (t b) (t c)

distributeF2 :: Bifunctor m => t (m a b) -> m (t a) (t b)

Decorations commute into any bifunctor.

Instances

Decoration Identity

The identity functor is a decoration.

Defined in BNFC.Utils.Decoration

Methods

traverseF :: Functor m => (a -> m b) -> Identity a -> m (Identity b)

distributeF :: Functor m => Identity (m a) -> m (Identity a)

traverseF2 :: Bifunctor m => (a -> m b c) -> Identity a -> m (Identity b) (Identity c)

distributeF2 :: Bifunctor m => Identity (m a b) -> m (Identity a) (Identity b)

Decoration WithPosition'

Defined in BNFC.Types.Position

Methods

traverseF :: Functor m => (a -> m b) -> WithPosition' a -> m (WithPosition' b)

distributeF :: Functor m => WithPosition' (m a) -> m (WithPosition' a)

traverseF2 :: Bifunctor m => (a -> m b c) -> WithPosition' a -> m (WithPosition' b) (WithPosition' c)

distributeF2 :: Bifunctor m => WithPosition' (m a b) -> m (WithPosition' a) (WithPosition' b)

Decoration WithPosition

Defined in BNFC.Types.Position

Methods

traverseF :: Functor m => (a -> m b) -> WithPosition a -> m (WithPosition b)

distributeF :: Functor m => WithPosition (m a) -> m (WithPosition a)

traverseF2 :: Bifunctor m => (a -> m b c) -> WithPosition a -> m (WithPosition b) (WithPosition c)

distributeF2 :: Bifunctor m => WithPosition (m a b) -> m (WithPosition a) (WithPosition b)

Decoration ((,) a)

A typical decoration is pairing with some stuff.

Defined in BNFC.Utils.Decoration

Methods

traverseF :: Functor m => (a0 -> m b) -> (a, a0) -> m (a, b)

distributeF :: Functor m => (a, m a0) -> m (a, a0)

traverseF2 :: Bifunctor m => (a0 -> m b c) -> (a, a0) -> m (a, b) (a, c)

distributeF2 :: Bifunctor m => (a, m a0 b) -> m (a, a0) (a, b)

Decoration (DecorationT d)

Defined in BNFC.Utils.Decoration

Methods

traverseF :: Functor m => (a -> m b) -> DecorationT d a -> m (DecorationT d b)

distributeF :: Functor m => DecorationT d (m a) -> m (DecorationT d a)

traverseF2 :: Bifunctor m => (a -> m b c) -> DecorationT d a -> m (DecorationT d b) (DecorationT d c)

distributeF2 :: Bifunctor m => DecorationT d (m a b) -> m (DecorationT d a) (DecorationT d b)

(Decoration d, Decoration t) => Decoration (Compose d t)

Decorations compose. (Thus, they form a category.)

Defined in BNFC.Utils.Decoration

Methods

traverseF :: Functor m => (a -> m b) -> Compose d t a -> m (Compose d t b)

distributeF :: Functor m => Compose d t (m a) -> m (Compose d t a)

traverseF2 :: Bifunctor m => (a -> m b c) -> Compose d t a -> m (Compose d t b) (Compose d t c)

distributeF2 :: Bifunctor m => Compose d t (m a b) -> m (Compose d t a) (Compose d t b)

dmap :: Decoration t => (a -> b) -> t a -> t b

Any decoration is traversable with traverse = traverseF. Just like any Traversable is a functor, so is any decoration, given by just traverseF, a functor.

dget :: Decoration t => t a -> a

Any decoration is a lens. set is a special case of dmap.

The constant functor.

Maybe. Can only be traversed into pointed functors.

Other disjoint sum types, like lists etc.

data DecorationT d a

A proper name for a generic decoration.

Constructors

DecorationT

Fields

• decoration :: d
• decorated :: a

Instances

Functor (DecorationT d)

Defined in BNFC.Utils.Decoration

Methods

fmap :: (a -> b) -> DecorationT d a -> DecorationT d b

(<$) :: a -> DecorationT d b -> DecorationT d a

Foldable (DecorationT d)

Defined in BNFC.Utils.Decoration

Methods

fold :: Monoid m => DecorationT d m -> m

foldMap :: Monoid m => (a -> m) -> DecorationT d a -> m

foldMap' :: Monoid m => (a -> m) -> DecorationT d a -> m

foldr :: (a -> b -> b) -> b -> DecorationT d a -> b

foldr' :: (a -> b -> b) -> b -> DecorationT d a -> b

foldl :: (b -> a -> b) -> b -> DecorationT d a -> b

foldl' :: (b -> a -> b) -> b -> DecorationT d a -> b

foldr1 :: (a -> a -> a) -> DecorationT d a -> a

foldl1 :: (a -> a -> a) -> DecorationT d a -> a

toList :: DecorationT d a -> [a]

null :: DecorationT d a -> Bool

length :: DecorationT d a -> Int

elem :: Eq a => a -> DecorationT d a -> Bool

maximum :: Ord a => DecorationT d a -> a

minimum :: Ord a => DecorationT d a -> a

sum :: Num a => DecorationT d a -> a

product :: Num a => DecorationT d a -> a

Traversable (DecorationT d)

Defined in BNFC.Utils.Decoration

Methods

traverse :: Applicative f => (a -> f b) -> DecorationT d a -> f (DecorationT d b)

sequenceA :: Applicative f => DecorationT d (f a) -> f (DecorationT d a)

mapM :: Monad m => (a -> m b) -> DecorationT d a -> m (DecorationT d b)

sequence :: Monad m => DecorationT d (m a) -> m (DecorationT d a)

Decoration (DecorationT d)

Defined in BNFC.Utils.Decoration

Methods

traverseF :: Functor m => (a -> m b) -> DecorationT d a -> m (DecorationT d b)

distributeF :: Functor m => DecorationT d (m a) -> m (DecorationT d a)

traverseF2 :: Bifunctor m => (a -> m b c) -> DecorationT d a -> m (DecorationT d b) (DecorationT d c)

distributeF2 :: Bifunctor m => DecorationT d (m a b) -> m (DecorationT d a) (DecorationT d b)

(Eq d, Eq a) => Eq (DecorationT d a)

Defined in BNFC.Utils.Decoration

Methods

(==) :: DecorationT d a -> DecorationT d a -> Bool

(/=) :: DecorationT d a -> DecorationT d a -> Bool

(Ord d, Ord a) => Ord (DecorationT d a)

Defined in BNFC.Utils.Decoration

Methods

compare :: DecorationT d a -> DecorationT d a -> Ordering

(<) :: DecorationT d a -> DecorationT d a -> Bool

(<=) :: DecorationT d a -> DecorationT d a -> Bool

(>) :: DecorationT d a -> DecorationT d a -> Bool

(>=) :: DecorationT d a -> DecorationT d a -> Bool

max :: DecorationT d a -> DecorationT d a -> DecorationT d a

min :: DecorationT d a -> DecorationT d a -> DecorationT d a

(Show d, Show a) => Show (DecorationT d a)

Defined in BNFC.Utils.Decoration

Methods

showsPrec :: Int -> DecorationT d a -> ShowS

show :: DecorationT d a -> String

showList :: [DecorationT d a] -> ShowS