Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Tuple.Compat

Description

This uses the OneTuple compatibility library to backport Solo to old versions of GHC. Note that OneTuple makes use of pattern synonyms, which cannot be defined on pre-7.8 versions of GHC. As such, it is not feasible to backport the Solo data constructor on pre-7.8 versions of GHC, as OneTuple defines this as a pattern synonym.

Documentation

data Solo a #

Constructors

MkSolo a

Bundled Patterns

pattern Solo :: a -> (a)

Instances

Instances details

Foldable Solo
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Solo m -> m foldMap :: Monoid m => (a -> m) -> Solo a -> m foldMap' :: Monoid m => (a -> m) -> Solo a -> m foldr :: (a -> b -> b) -> b -> Solo a -> b foldr' :: (a -> b -> b) -> b -> Solo a -> b foldl :: (b -> a -> b) -> b -> Solo a -> b foldl' :: (b -> a -> b) -> b -> Solo a -> b foldr1 :: (a -> a -> a) -> Solo a -> a foldl1 :: (a -> a -> a) -> Solo a -> a toList :: Solo a -> [a] null :: Solo a -> Bool length :: Solo a -> Int elem :: Eq a => a -> Solo a -> Bool maximum :: Ord a => Solo a -> a minimum :: Ord a => Solo a -> a sum :: Num a => Solo a -> a product :: Num a => Solo a -> a
Foldable1 Solo
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Solo m -> m foldMap1 :: Semigroup m => (a -> m) -> Solo a -> m foldMap1' :: Semigroup m => (a -> m) -> Solo a -> m toNonEmpty :: Solo a -> NonEmpty a maximum :: Ord a => Solo a -> a minimum :: Ord a => Solo a -> a head :: Solo a -> a last :: Solo a -> a foldrMap1 :: (a -> b) -> (a -> b -> b) -> Solo a -> b foldlMap1' :: (a -> b) -> (b -> a -> b) -> Solo a -> b foldlMap1 :: (a -> b) -> (b -> a -> b) -> Solo a -> b foldrMap1' :: (a -> b) -> (a -> b -> b) -> Solo a -> b
Traversable Solo
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Solo a -> f (Solo b) sequenceA :: Applicative f => Solo (f a) -> f (Solo a) mapM :: Monad m => (a -> m b) -> Solo a -> m (Solo b) # sequence :: Monad m => Solo (m a) -> m (Solo a) #
Applicative Solo
Instance details Defined in GHC.Base Methods pure :: a -> Solo a (<>) :: Solo (a -> b) -> Solo a -> Solo b liftA2 :: (a -> b -> c) -> Solo a -> Solo b -> Solo c (>) :: Solo a -> Solo b -> Solo b (<*) :: Solo a -> Solo b -> Solo a
Functor Solo
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Solo a -> Solo b # (<$) :: a -> Solo b -> Solo a #
Monad Solo
Instance details Defined in GHC.Base Methods (>>=) :: Solo a -> (a -> Solo b) -> Solo b # (>>) :: Solo a -> Solo b -> Solo b # return :: a -> Solo a #
Monoid a => Monoid (a)
Instance details Defined in GHC.Base Methods mempty :: (a) # mappend :: (a) -> (a) -> (a) # mconcat :: [(a)] -> (a) #
Semigroup a => Semigroup (a)
Instance details Defined in GHC.Base Methods (<>) :: (a) -> (a) -> (a) # sconcat :: NonEmpty (a) -> (a) # stimes :: Integral b => b -> (a) -> (a) #
Bounded a => Bounded (a)
Instance details Defined in GHC.Enum Methods minBound :: (a) maxBound :: (a)
Enum a => Enum (a)
Instance details Defined in GHC.Enum Methods succ :: (a) -> (a) pred :: (a) -> (a) toEnum :: Int -> (a) fromEnum :: (a) -> Int enumFrom :: (a) -> [(a)] enumFromThen :: (a) -> (a) -> [(a)] enumFromTo :: (a) -> (a) -> [(a)] enumFromThenTo :: (a) -> (a) -> (a) -> [(a)]
Read a => Read (a)
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a) readList :: ReadS [(a)] readPrec :: ReadPrec (a) readListPrec :: ReadPrec [(a)]
Show a => Show (a)
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a) -> ShowS show :: (a) -> String showList :: [(a)] -> ShowS
Eq a => Eq (a)
Instance details Defined in GHC.Classes Methods (==) :: (a) -> (a) -> Bool (/=) :: (a) -> (a) -> Bool
Ord a => Ord (a)
Instance details Defined in GHC.Classes Methods compare :: (a) -> (a) -> Ordering (<) :: (a) -> (a) -> Bool (<=) :: (a) -> (a) -> Bool (>) :: (a) -> (a) -> Bool (>=) :: (a) -> (a) -> Bool max :: (a) -> (a) -> (a) min :: (a) -> (a) -> (a)

getSolo :: (a) -> a #

fst :: (a, b) -> a #

snd :: (a, b) -> b #

curry :: ((a, b) -> c) -> a -> b -> c #

uncurry :: (a -> b -> c) -> (a, b) -> c #

swap :: (a, b) -> (b, a) #