Safe Haskell	Safe-Inferred
Language	Haskell98

Data.Zip

Synopsis

Documentation

newtype T (f :: Type -> Type) a Source #

Wrap a container such that its Applicative instance is based on zip.

Constructors

Cons
Fields decons :: f a

Instances details

(Zip f, Repeat f) => Applicative (T f) Source #
Instance details Defined in Data.Zip Methods pure :: a -> T f a # (<>) :: T f (a -> b) -> T f a -> T f b # liftA2 :: (a -> b -> c) -> T f a -> T f b -> T f c # (>) :: T f a -> T f b -> T f b # (<*) :: T f a -> T f b -> T f a #
Functor f => Functor (T f) Source #
Instance details Defined in Data.Zip Methods fmap :: (a -> b) -> T f a -> T f b # (<$) :: a -> T f b -> T f a #
NFData f => NFData (T f) Source #
Instance details Defined in Data.Zip Methods rnf :: NFData a => T f a -> () Source #
(NFData f, NFData a) => NFData (T f a) Source #
Instance details Defined in Data.Zip Methods rnf :: T f a -> () #

Always returns a rectangular list by clipping all dimensions to the shortest slice. Be aware that transpose [] == repeat [].