Copyright | (c) 2006-2007 Roman Leshchinskiy (c) 2013 Simon Meier |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Simon Meier <iridcode@gmail.com> |
Stability | experimental |
Portability | GHC |
Safe Haskell | None |
Language | Haskell98 |
The strict variant of the standard Haskell pairs and the corresponding variants of the functions from Data.Tuple.
Documentation
uncurry :: (a -> b -> c) -> Pair a b -> c #
Convert a curried function to a function on strict pairs.
Orphan instances
Bitraversable Pair Source # | |
Bifoldable Pair Source # | |
Bifunctor Pair Source # | |
Swapped Pair Source # | |
Functor (Pair e) Source # | |
Foldable (Pair e) Source # | |
Traversable (Pair e) Source # | |
(Data a, Data b) => Data (Pair a b) Source # | |
Generic (Pair a b) Source # | |
(Semigroup a, Semigroup b) => Semigroup (Pair a b) Source # | |
(Monoid a, Monoid b) => Monoid (Pair a b) Source # | |
(Arbitrary a, Arbitrary b) => Arbitrary (Pair a b) Source # | |
(Hashable a, Hashable b) => Hashable (Pair a b) Source # | |
(ToJSON a, ToJSON b) => ToJSON (Pair a b) Source # | |
(FromJSON a, FromJSON b) => FromJSON (Pair a b) Source # | |
(Binary a, Binary b) => Binary (Pair a b) Source # | |
(NFData a, NFData b) => NFData (Pair a b) Source # | |
Strict (a, b) (Pair a b) Source # | |
((~) * a a', (~) * b b') => Each (Pair a a') (Pair b b') a b Source # | |
Field1 (Pair a b) (Pair a' b) a a' Source # | |
Field2 (Pair a b) (Pair a b') b b' Source # | |