Safe Haskell	Safe
Language	Haskell98

Data.Tuple.Solo

Description

Solo fills the tuple gap with a singleton tuple.

Solo does not support the usual parenthesized tuple syntax.

Solo

has the expected laziness properties
can be pattern-matched
ships with instances for several standard type classes, including all those supported by H98-standard tuples
requires no language extensions, except for hierarchical modules

Note: on GHC-9.0 getSolo is not a record selector.

Synopsis

data Solo a = Solo a
getSolo :: Solo a -> a

Documentation

data Solo a Source #

Solo is the singleton tuple data type.

Constructors

Solo a

Instances

Instances details

Monad Solo Source #
Instance details Defined in Data.Tuple.Solo Methods (>>=) :: Solo a -> (a -> Solo b) -> Solo b Source # (>>) :: Solo a -> Solo b -> Solo b Source # return :: a -> Solo a Source #
Functor Solo Source #
Instance details Defined in Data.Tuple.Solo Methods fmap :: (a -> b) -> Solo a -> Solo b Source # (<$) :: a -> Solo b -> Solo a Source #
MonadFix Solo Source #
Instance details Defined in Data.Tuple.Solo Methods mfix :: (a -> Solo a) -> Solo a Source #
Applicative Solo Source #
Instance details Defined in Data.Tuple.Solo Methods pure :: a -> Solo a Source # (<>) :: Solo (a -> b) -> Solo a -> Solo b Source # liftA2 :: (a -> b -> c) -> Solo a -> Solo b -> Solo c Source # (>) :: Solo a -> Solo b -> Solo b Source # (<*) :: Solo a -> Solo b -> Solo a Source #
Foldable Solo Source #
Instance details Defined in Data.Tuple.Solo Methods fold :: Monoid m => Solo m -> m Source # foldMap :: Monoid m => (a -> m) -> Solo a -> m Source # foldMap' :: Monoid m => (a -> m) -> Solo a -> m Source # foldr :: (a -> b -> b) -> b -> Solo a -> b Source # foldr' :: (a -> b -> b) -> b -> Solo a -> b Source # foldl :: (b -> a -> b) -> b -> Solo a -> b Source # foldl' :: (b -> a -> b) -> b -> Solo a -> b Source # foldr1 :: (a -> a -> a) -> Solo a -> a Source # foldl1 :: (a -> a -> a) -> Solo a -> a Source # toList :: Solo a -> [a] Source # null :: Solo a -> Bool Source # length :: Solo a -> Int Source # elem :: Eq a => a -> Solo a -> Bool Source # maximum :: Ord a => Solo a -> a Source # minimum :: Ord a => Solo a -> a Source # sum :: Num a => Solo a -> a Source # product :: Num a => Solo a -> a Source #
Traversable Solo Source #
Instance details Defined in Data.Tuple.Solo Methods traverse :: Applicative f => (a -> f b) -> Solo a -> f ( Solo b) Source # sequenceA :: Applicative f => Solo (f a) -> f ( Solo a) Source # mapM :: Monad m => (a -> m b) -> Solo a -> m ( Solo b) Source # sequence :: Monad m => Solo (m a) -> m ( Solo a) Source #
Eq1 Solo Source #
Instance details Defined in Data.Tuple.Solo Methods liftEq :: (a -> b -> Bool ) -> Solo a -> Solo b -> Bool Source #
Ord1 Solo Source #
Instance details Defined in Data.Tuple.Solo Methods liftCompare :: (a -> b -> Ordering ) -> Solo a -> Solo b -> Ordering Source #
Read1 Solo Source #
Instance details Defined in Data.Tuple.Solo Methods liftReadsPrec :: ( Int -> ReadS a) -> ReadS [a] -> Int -> ReadS ( Solo a) Source # liftReadList :: ( Int -> ReadS a) -> ReadS [a] -> ReadS [ Solo a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec ( Solo a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [ Solo a] Source #
Show1 Solo Source #
Instance details Defined in Data.Tuple.Solo Methods liftShowsPrec :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> Int -> Solo a -> ShowS Source # liftShowList :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> [ Solo a] -> ShowS Source #
MonadZip Solo Source #
Instance details Defined in Data.Tuple.Solo Methods mzip :: Solo a -> Solo b -> Solo (a, b) Source # mzipWith :: (a -> b -> c) -> Solo a -> Solo b -> Solo c Source # munzip :: Solo (a, b) -> ( Solo a, Solo b) Source #
Hashable1 Solo Source #	Since: 0.3.1
Instance details Defined in Data.Tuple.Solo Methods liftHashWithSalt :: ( Int -> a -> Int ) -> Int -> Solo a -> Int Source #
Bounded a => Bounded ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods minBound :: Solo a Source # maxBound :: Solo a Source #
Enum a => Enum ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods succ :: Solo a -> Solo a Source # pred :: Solo a -> Solo a Source # toEnum :: Int -> Solo a Source # fromEnum :: Solo a -> Int Source # enumFrom :: Solo a -> [ Solo a] Source # enumFromThen :: Solo a -> Solo a -> [ Solo a] Source # enumFromTo :: Solo a -> Solo a -> [ Solo a] Source # enumFromThenTo :: Solo a -> Solo a -> Solo a -> [ Solo a] Source #
Eq a => Eq ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods (==) :: Solo a -> Solo a -> Bool Source # (/=) :: Solo a -> Solo a -> Bool Source #
Data a => Data ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> Solo a -> c ( Solo a) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( Solo a) Source # toConstr :: Solo a -> Constr Source # dataTypeOf :: Solo a -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( Solo a)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( Solo a)) Source # gmapT :: ( forall b. Data b => b -> b) -> Solo a -> Solo a Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> Solo a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> Solo a -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> Solo a -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> Solo a -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> Solo a -> m ( Solo a) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> Solo a -> m ( Solo a) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> Solo a -> m ( Solo a) Source #
Ord a => Ord ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods compare :: Solo a -> Solo a -> Ordering Source # (<) :: Solo a -> Solo a -> Bool Source # (<=) :: Solo a -> Solo a -> Bool Source # (>) :: Solo a -> Solo a -> Bool Source # (>=) :: Solo a -> Solo a -> Bool Source # max :: Solo a -> Solo a -> Solo a Source # min :: Solo a -> Solo a -> Solo a Source #
Read a => Read ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods readsPrec :: Int -> ReadS ( Solo a) Source # readList :: ReadS [ Solo a] Source # readPrec :: ReadPrec ( Solo a) Source # readListPrec :: ReadPrec [ Solo a] Source #
Show a => Show ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods showsPrec :: Int -> Solo a -> ShowS Source # show :: Solo a -> String Source # showList :: [ Solo a] -> ShowS Source #
Ix a => Ix ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods range :: ( Solo a, Solo a) -> [ Solo a] Source # index :: ( Solo a, Solo a) -> Solo a -> Int Source # unsafeIndex :: ( Solo a, Solo a) -> Solo a -> Int Source # inRange :: ( Solo a, Solo a) -> Solo a -> Bool Source # rangeSize :: ( Solo a, Solo a) -> Int Source # unsafeRangeSize :: ( Solo a, Solo a) -> Int Source #
Generic ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Associated Types type Rep ( Solo a) :: Type -> Type Source # Methods from :: Solo a -> Rep ( Solo a) x Source # to :: Rep ( Solo a) x -> Solo a Source #
Semigroup a => Semigroup ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods (<>) :: Solo a -> Solo a -> Solo a Source # sconcat :: NonEmpty ( Solo a) -> Solo a Source # stimes :: Integral b => b -> Solo a -> Solo a Source #
Monoid a => Monoid ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo Methods mempty :: Solo a Source # mappend :: Solo a -> Solo a -> Solo a Source # mconcat :: [ Solo a] -> Solo a Source #
Hashable a => Hashable ( Solo a) Source #	Since: 0.3.1
Instance details Defined in Data.Tuple.Solo Methods hashWithSalt :: Int -> Solo a -> Int Source # hash :: Solo a -> Int Source #
Generic1 Solo Source #
Instance details Defined in Data.Tuple.Solo Associated Types type Rep1 Solo :: k -> Type Source # Methods from1 :: forall (a :: k). Solo a -> Rep1 Solo a Source # to1 :: forall (a :: k). Rep1 Solo a -> Solo a Source #
type Rep ( Solo a) Source #
Instance details Defined in Data.Tuple.Solo type Rep ( Solo a) = D1 (' MetaData "Solo" "Data.Tuple.Solo" "OneTuple-0.3.1-2dHxJgLo5x9Lj2QijnVAuZ" ' False ) ( C1 (' MetaCons "Solo" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "getSolo") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 a)))
type Rep1 Solo Source #
Instance details Defined in Data.Tuple.Solo type Rep1 Solo = D1 (' MetaData "Solo" "Data.Tuple.Solo" "OneTuple-0.3.1-2dHxJgLo5x9Lj2QijnVAuZ" ' False ) ( C1 (' MetaCons "Solo" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "getSolo") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) Par1 ))

getSolo :: Solo a -> a Source #