Control.Applicative.Backwards

Making functors with an Applicative instance that performs actions in the reverse order.

Documentation

newtype Backwards f a

The same functor, but with an Applicative instance that performs actions in the reverse order.

Constructors

Backwards

Fields

• forwards :: f a

Instances

Generic1 (Backwards f :: k -> Type)

Defined in Control.Applicative.Backwards

Associated Types

type Rep1 (Backwards f) :: k -> Type

Methods

from1 :: forall (a :: k0). Backwards f a -> Rep1 (Backwards f) a

to1 :: forall (a :: k0). Rep1 (Backwards f) a -> Backwards f a

Functor f => Functor (Backwards f)

Derived instance.

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b

(<$) :: a -> Backwards f b -> Backwards f a

Applicative f => Applicative (Backwards f)

Apply f-actions in the reverse order.

Defined in Control.Applicative.Backwards

Methods

pure :: a -> Backwards f a

(<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b

liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c

(*>) :: Backwards f a -> Backwards f b -> Backwards f b

(<*) :: Backwards f a -> Backwards f b -> Backwards f a

Foldable f => Foldable (Backwards f)

Derived instance.

Defined in Control.Applicative.Backwards

Methods

fold :: Monoid m => Backwards f m -> m

foldMap :: Monoid m => (a -> m) -> Backwards f a -> m

foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m

foldr :: (a -> b -> b) -> b -> Backwards f a -> b

foldr' :: (a -> b -> b) -> b -> Backwards f a -> b

foldl :: (b -> a -> b) -> b -> Backwards f a -> b

foldl' :: (b -> a -> b) -> b -> Backwards f a -> b

foldr1 :: (a -> a -> a) -> Backwards f a -> a

foldl1 :: (a -> a -> a) -> Backwards f a -> a

toList :: Backwards f a -> [a]

null :: Backwards f a -> Bool

length :: Backwards f a -> Int

elem :: Eq a => a -> Backwards f a -> Bool

maximum :: Ord a => Backwards f a -> a

minimum :: Ord a => Backwards f a -> a

sum :: Num a => Backwards f a -> a

product :: Num a => Backwards f a -> a

Traversable f => Traversable (Backwards f)

Derived instance.

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b)

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a)

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b)

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a)

Contravariant f => Contravariant (Backwards f)

Derived instance.

Defined in Control.Applicative.Backwards

Methods

contramap :: (a -> b) -> Backwards f b -> Backwards f a

(>$) :: b -> Backwards f b -> Backwards f a

Eq1 f => Eq1 (Backwards f)

Defined in Control.Applicative.Backwards

Methods

liftEq :: (a -> b -> Bool) -> Backwards f a -> Backwards f b -> Bool

Ord1 f => Ord1 (Backwards f)

Defined in Control.Applicative.Backwards

Methods

liftCompare :: (a -> b -> Ordering) -> Backwards f a -> Backwards f b -> Ordering

Read1 f => Read1 (Backwards f)

Defined in Control.Applicative.Backwards

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Backwards f a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Backwards f a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Backwards f a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Backwards f a]

Show1 f => Show1 (Backwards f)

Defined in Control.Applicative.Backwards

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Backwards f a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Backwards f a] -> ShowS

Alternative f => Alternative (Backwards f)

Try alternatives in the same order as f.

Defined in Control.Applicative.Backwards

Methods

empty :: Backwards f a

(<|>) :: Backwards f a -> Backwards f a -> Backwards f a

some :: Backwards f a -> Backwards f [a]

many :: Backwards f a -> Backwards f [a]

(Eq1 f, Eq a) => Eq (Backwards f a)

Defined in Control.Applicative.Backwards

Methods

(==) :: Backwards f a -> Backwards f a -> Bool

(/=) :: Backwards f a -> Backwards f a -> Bool

(Ord1 f, Ord a) => Ord (Backwards f a)

Defined in Control.Applicative.Backwards

Methods

compare :: Backwards f a -> Backwards f a -> Ordering

(<) :: Backwards f a -> Backwards f a -> Bool

(<=) :: Backwards f a -> Backwards f a -> Bool

(>) :: Backwards f a -> Backwards f a -> Bool

(>=) :: Backwards f a -> Backwards f a -> Bool

max :: Backwards f a -> Backwards f a -> Backwards f a

min :: Backwards f a -> Backwards f a -> Backwards f a

(Read1 f, Read a) => Read (Backwards f a)

Defined in Control.Applicative.Backwards

Methods

readsPrec :: Int -> ReadS (Backwards f a)

readList :: ReadS [Backwards f a]

readPrec :: ReadPrec (Backwards f a)

readListPrec :: ReadPrec [Backwards f a]

(Show1 f, Show a) => Show (Backwards f a)

Defined in Control.Applicative.Backwards

Methods

showsPrec :: Int -> Backwards f a -> ShowS

show :: Backwards f a -> String

showList :: [Backwards f a] -> ShowS

Generic (Backwards f a)

Defined in Control.Applicative.Backwards

Associated Types

type Rep (Backwards f a) :: Type -> Type

Methods

from :: Backwards f a -> Rep (Backwards f a) x

to :: Rep (Backwards f a) x -> Backwards f a

type Rep1 (Backwards f :: k -> Type)

Defined in Control.Applicative.Backwards

type Rep1 (Backwards f :: k -> Type) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.0.0-50sL81tKXgl5c1TJIgkN4z" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)))

type Rep (Backwards f a)

Defined in Control.Applicative.Backwards

type Rep (Backwards f a) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.0.0-50sL81tKXgl5c1TJIgkN4z" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))