Safe Haskell	Safe
Language	Haskell2010

Data.Text.PgpWordlist.Internal.AltList

Contents

Description

A type of list that contains two alternating element types.

Synopsis

data AltList a b
- = Nil
- | a :<> (AltList b a)
fromList :: [a] -> AltList a a
toList :: AltList a a -> [a]
first :: (a -> a') -> AltList a b -> AltList a' b
second :: (b -> b') -> AltList a b -> AltList a b'
bimap :: (a -> a') -> (b -> b') -> AltList a b -> AltList a' b'
bisequence :: Applicative f => AltList (f a) (f b) -> f (AltList a b)
bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> AltList a b -> f (AltList c d)

Documentation

List of elements of alternating element types.

Constructors

Nil
a :<> (AltList b a) infixr 5

Instances

Bifunctor AltList Source #
Instance details Defined in Data.Text.PgpWordlist.Internal.AltList Methods bimap :: (a -> b) -> (c -> d) -> AltList a c -> AltList b d # first :: (a -> b) -> AltList a c -> AltList b c # second :: (b -> c) -> AltList a b -> AltList a c #
(Eq a, Eq b) => Eq (AltList a b) Source #
Instance details Defined in Data.Text.PgpWordlist.Internal.AltList Methods (==) :: AltList a b -> AltList a b -> Bool # (/=) :: AltList a b -> AltList a b -> Bool #
(Ord a, Ord b) => Ord (AltList a b) Source #
Instance details Defined in Data.Text.PgpWordlist.Internal.AltList Methods compare :: AltList a b -> AltList a b -> Ordering # (<) :: AltList a b -> AltList a b -> Bool # (<=) :: AltList a b -> AltList a b -> Bool # (>) :: AltList a b -> AltList a b -> Bool # (>=) :: AltList a b -> AltList a b -> Bool # max :: AltList a b -> AltList a b -> AltList a b # min :: AltList a b -> AltList a b -> AltList a b #
(Show a, Show b) => Show (AltList a b) Source #
Instance details Defined in Data.Text.PgpWordlist.Internal.AltList Methods showsPrec :: Int -> AltList a b -> ShowS # show :: AltList a b -> String # showList :: [AltList a b] -> ShowS #