Copyright | (c) The University of Glasgow 2001 |
---|---|
License | BSD-style (see the file libraries/base/LICENSE) |
Maintainer | libraries@haskell.org |
Stability | stable |
Portability | portable |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
Functions associated with the tuple data types.
Documentation
Solo
is the canonical lifted 1-tuple, just like (,)
is the canonical
lifted 2-tuple (pair) and (,,)
is the canonical lifted 3-tuple (triple).
The most important feature of Solo
is that it is possible to force its
"outside" (usually by pattern matching) without forcing its "inside",
because it is defined as a datatype rather than a newtype. One situation
where this can be useful is when writing a function to extract a value from
a data structure. Suppose you write an implementation of arrays and offer
only this function to index into them:
index :: Array a -> Int -> a
Now imagine that someone wants to extract a value from an array and store it in a lazy-valued finite map/dictionary:
insert "hello" (arr index
12) m
This can actually lead to a space leak. The value is not actually extracted from the array until that value (now buried in a map) is forced. That means the entire array may be kept live by just that value! Often, the solution is to use a strict map, or to force the value before storing it, but for some purposes that's undesirable.
One common solution is to include an indexing function that can produce its
result in an arbitrary Applicative
context:
indexA :: Applicative f => Array a -> Int -> f a
When using indexA
in a pure context, Solo
serves as a handy
Applicative
functor to hold the result. You could write a non-leaky
version of the above example thus:
case arr indexA
12 of
Solo a -> insert "hello" a m
While such simple extraction functions are the most common uses for unary tuples, they can also be useful for fine-grained control of strict-spined data structure traversals, and for unifying the implementations of lazy and strict mapping functions.
Solo a |
Instances
MonadFix Solo Source # | Since: base-4.15 |
MonadZip Solo Source # | Since: base-4.15.0.0 |
Foldable Solo Source # | Since: base-4.15 |
Defined in Data.Foldable 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 # | |
Eq1 Solo Source # | Since: base-4.15 |
Ord1 Solo Source # | Since: base-4.15 |
Defined in Data.Functor.Classes | |
Read1 Solo Source # | Since: base-4.15 |
Defined in Data.Functor.Classes 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 # | Since: base-4.15 |
Traversable Solo Source # | Since: base-4.15 |
Applicative Solo Source # | Since: base-4.15 |
Functor Solo Source # | Since: base-4.15 |
Monad Solo Source # | Since: base-4.15 |
Generic1 Solo Source # | |
Data a => Data (a) Source # | Since: base-4.15 |
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> (a) -> c (a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (a) Source # toConstr :: (a) -> Constr Source # dataTypeOf :: (a) -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (a)) Source # gmapT :: (forall b. Data b => b -> b) -> (a) -> (a) Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> (a) -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> (a) -> r Source # gmapQ :: (forall d. Data d => d -> u) -> (a) -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> (a) -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> (a) -> m (a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> (a) -> m (a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> (a) -> m (a) Source # | |
Monoid a => Monoid (a) Source # | Since: base-4.15 |
Semigroup a => Semigroup (a) Source # | Since: base-4.15 |
Bounded a => Bounded (a) Source # | |
Enum a => Enum (a) Source # | |
Defined in GHC.Enum | |
Generic (a) Source # | |
Ix a => Ix (a) Source # | |
Read a => Read (a) Source # | Since: base-4.15 |
Show a => Show (a) Source # | Since: base-4.15 |
Eq a => Eq (a) | |
Ord a => Ord (a) | |
type Rep1 Solo Source # | Since: base-4.15 |
Defined in GHC.Generics | |
type Rep (a) Source # | Since: base-4.15 |
Defined in GHC.Generics |