Safe Haskell	Safe
Language	Haskell2010

Data.Text.PgpWordlist.Internal.AltList

Contents

Description

A type of list that contains two alternating element types.

Synopsis

Documentation

data AltList a b #

List of elements of alternating element types.

Constructors

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

Instances

Bifunctor 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 b, Eq a) => Eq (AltList a b) #
Methods (==) :: AltList a b -> AltList a b -> Bool # (/=) :: AltList a b -> AltList a b -> Bool #
(Ord b, Ord a) => Ord (AltList a b) #
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 b, Show a) => Show (AltList a b) #
Methods showsPrec :: Int -> AltList a b -> ShowS # show :: AltList a b -> String # showList :: [AltList a b] -> ShowS #

Construction, deconstruction

Simple conversion function. Inverse of toList.

toList :: AltList a a -> [a] #

Simple conversion function. Inverse of fromList.

first :: (a -> a') -> AltList a b -> AltList a' b #

Map over every other element of an AltList, starting with the first entry.

first f ≡ bimap f id

second :: (b -> b') -> AltList a b -> AltList a b' #

Map over every other element of an AltList, starting with the second entry.

second g ≡ bimap id g

bimap :: (a -> a') -> (b -> b') -> AltList a b -> AltList a' b' #

Map over the both types of entries of an AltList.

bimap f g ≡ second g . first f

The Bifunctor analogon to sequenceA.

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> AltList a b -> f (AltList c d) #

The Bifunctor analogon to traverse.