Data.Strict.These · strict-0.5.1

datadata These a b

Source#

The strict these type.

Constructors

This !a
That !b
These !a !b

Instances36Bifoldable, Bifunctor, Bitraversable, Eq2, Ord2, Read2, …

Bifoldable TheseDefined in strict-0.5.1 · Data.Strict.These
Bifunctor TheseDefined in strict-0.5.1 · Data.Strict.These
Bitraversable TheseDefined in strict-0.5.1 · Data.Strict.These
Eq2 TheseDefined in strict-0.5.1 · Data.Strict.These
Ord2 TheseDefined in strict-0.5.1 · Data.Strict.These
Read2 TheseDefined in strict-0.5.1 · Data.Strict.These
Show2 TheseDefined in strict-0.5.1 · Data.Strict.These
NFData2 TheseDefined in strict-0.5.1 · Data.Strict.These
Hashable2 TheseDefined in strict-0.5.1 · Data.Strict.These
Assoc TheseDefined in strict-0.5.1 · Data.Strict.These
Swap TheseDefined in strict-0.5.1 · Data.Strict.These
Generic1 (These a)Defined in strict-0.5.1 · Data.Strict.These
Semigroup a => Monad (These a)Defined in strict-0.5.1 · Data.Strict.These
Functor (These a)Defined in strict-0.5.1 · Data.Strict.These
Semigroup a => Applicative (These a)Defined in strict-0.5.1 · Data.Strict.These
Foldable (These a)Defined in strict-0.5.1 · Data.Strict.These
Traversable (These a)Defined in strict-0.5.1 · Data.Strict.These
Eq a => Eq1 (These a)Defined in strict-0.5.1 · Data.Strict.These
Ord a => Ord1 (These a)Defined in strict-0.5.1 · Data.Strict.These
Read a => Read1 (These a)Defined in strict-0.5.1 · Data.Strict.These
Show a => Show1 (These a)Defined in strict-0.5.1 · Data.Strict.These
NFData a => NFData1 (These a)Defined in strict-0.5.1 · Data.Strict.These
Hashable a => Hashable1 (These a)Defined in strict-0.5.1 · Data.Strict.These
(Eq a, Eq b) => Eq (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Data a, Data b) => Data (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Ord a, Ord b) => Ord (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Read a, Read b) => Read (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Show a, Show b) => Show (These a b)Defined in strict-0.5.1 · Data.Strict.These
Generic (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Semigroup a, Semigroup b) => Semigroup (These a b)Defined in strict-0.5.1 · Data.Strict.These
(NFData a, NFData b) => NFData (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Binary a, Binary b) => Binary (These a b)Defined in strict-0.5.1 · Data.Strict.These
(Hashable a, Hashable b) => Hashable (These a b)Defined in strict-0.5.1 · Data.Strict.These
Strict (These a b) (These a b)Defined in strict-0.5.1 · Data.Strict.Classes
type Rep (These a b) = D1 ('MetaData "These" "Data.Strict.These" "strict-0.5.1-2EKiSPxMpF9Czn8Nici9Sg" 'False) (C1 ('MetaCons "This" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)) :+: (C1 ('MetaCons "That" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 b)) :+: C1 ('MetaCons "These" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 b))))Defined in strict-0.5.1 · Data.Strict.These
type Rep1 (These a) = D1 ('MetaData "These" "Data.Strict.These" "strict-0.5.1-2EKiSPxMpF9Czn8Nici9Sg" 'False) (C1 ('MetaCons "This" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)) :+: (C1 ('MetaCons "That" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1) :+: C1 ('MetaCons "These" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1)))Defined in strict-0.5.1 · Data.Strict.These

Functions to get rid of These

valuethese :: (a -> c) -> (b -> c) -> (a -> b -> c) -> These a b -> c

Source#

Case analysis for the These type.

valuefromThese :: a -> b -> These a b -> (a, b)

Source#

Takes two default values and produces a tuple.

valuemergeThese :: (a -> a -> a) -> These a a -> a

Source#

Coalesce with the provided operation.

valuemergeTheseWith :: (a -> c) -> (b -> c) -> (c -> c -> c) -> These a b -> c

Source#

bimap and coalesce results with the provided operation.

Partition

valuepartitionThese :: [These a b] -> ([a], [b], [(a, b)])

Source#

Select each constructor and partition them into separate lists.

valuepartitionHereThere :: [These a b] -> ([a], [b])

Source#

Select here and there elements and partition them into separate lists.

valuepartitionEithersNE

:: NonEmpty (Either a b)
-> These (NonEmpty a) (NonEmpty b)

Source#

Like partitionEithers but for NonEmpty types.

either all are Left
either all are Right
or there is both Left and Right stuff

Note: this is not online algorithm. In the worst case it will traverse the whole list before deciding the result constructor.

Example1 expression

>>> partitionEithersNE $ Left 'x' :| [Right 'y']These ('x' :| "") ('y' :| "")

Example1 expression

>>> partitionEithersNE $ Left 'x' :| map Left "yz"This ('x' :| "yz")

Distributivity

This distributivity combinators aren't isomorphisms!

valuedistrThesePair :: These (a, b) c -> (These a c, These b c)

#

valueundistrThesePair :: (These a c, These b c) -> These (a, b) c

#

valuedistrPairThese :: (These a b, c) -> These (a, c) (b, c)

#

valueundistrPairThese :: These (a, c) (b, c) -> (These a b, c)

#