Safe Haskell	Safe
Language	Haskell2010

Control.NumericalApplicative.Backwards

Synopsis

newtype Backwards f a = Backwards {
- forwards :: f a
}
(<**>) :: Applicative f => f a -> f (a -> b) -> f b
liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

Documentation

newtype Backwards f a Source #

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

Constructors

Backwards
Fields forwards :: f a

Instances

Functor f => Functor (Backwards f) Source #	Derived instance.
Instance details Defined in Control.NumericalApplicative.Backwards Methods fmap :: (a -> b) -> Backwards f a -> Backwards f b # (<$) :: a -> Backwards f b -> Backwards f a #
Applicative f => Applicative (Backwards f) Source #	Apply `f`-actions in the reverse order.
Instance details Defined in Control.NumericalApplicative.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) Source #	Derived instance.
Instance details Defined in Control.NumericalApplicative.Backwards Methods fold :: Monoid m => Backwards f m -> 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) Source #	Derived instance.
Instance details Defined in Control.NumericalApplicative.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) #
Alternative f => Alternative (Backwards f) Source #	Try alternatives in the same order as `f`.
Instance details Defined in Control.NumericalApplicative.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] #

(<**>) :: Applicative f => f a -> f (a -> b) -> f b Source #

liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c Source #