Data.List.Fair

Documentation

newtype Fair a

Constructors

Fair

Fields

• unFair :: [a]

Instances

Monad Fair

Defined in Data.List.Fair

Methods

(>>=) :: Fair a -> (a -> Fair b) -> Fair b

(>>) :: Fair a -> Fair b -> Fair b

return :: a -> Fair a

fail :: String -> Fair a

Functor Fair

Defined in Data.List.Fair

Methods

fmap :: (a -> b) -> Fair a -> Fair b

(<$) :: a -> Fair b -> Fair a

Applicative Fair

Defined in Data.List.Fair

Methods

pure :: a -> Fair a

(<*>) :: Fair (a -> b) -> Fair a -> Fair b

liftA2 :: (a -> b -> c) -> Fair a -> Fair b -> Fair c

(*>) :: Fair a -> Fair b -> Fair b

(<*) :: Fair a -> Fair b -> Fair a

Foldable Fair

Defined in Data.List.Fair

Methods

fold :: Monoid m => Fair m -> m

foldMap :: Monoid m => (a -> m) -> Fair a -> m

foldr :: (a -> b -> b) -> b -> Fair a -> b

foldr' :: (a -> b -> b) -> b -> Fair a -> b

foldl :: (b -> a -> b) -> b -> Fair a -> b

foldl' :: (b -> a -> b) -> b -> Fair a -> b

foldr1 :: (a -> a -> a) -> Fair a -> a

foldl1 :: (a -> a -> a) -> Fair a -> a

toList :: Fair a -> [a]

null :: Fair a -> Bool

length :: Fair a -> Int

elem :: Eq a => a -> Fair a -> Bool

maximum :: Ord a => Fair a -> a

minimum :: Ord a => Fair a -> a

sum :: Num a => Fair a -> a

product :: Num a => Fair a -> a

Traversable Fair

Defined in Data.List.Fair

Methods

traverse :: Applicative f => (a -> f b) -> Fair a -> f (Fair b)

sequenceA :: Applicative f => Fair (f a) -> f (Fair a)

mapM :: Monad m => (a -> m b) -> Fair a -> m (Fair b)

sequence :: Monad m => Fair (m a) -> m (Fair a)

Eq1 Fair

Defined in Data.List.Fair

Methods

liftEq :: (a -> b -> Bool) -> Fair a -> Fair b -> Bool

Ord1 Fair

Defined in Data.List.Fair

Methods

liftCompare :: (a -> b -> Ordering) -> Fair a -> Fair b -> Ordering

Read1 Fair

Defined in Data.List.Fair

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Fair a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Fair a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Fair a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Fair a]

Show1 Fair

Defined in Data.List.Fair

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Fair a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Fair a] -> ShowS

Eq a => Eq (Fair a)

Defined in Data.List.Fair

Methods

(==) :: Fair a -> Fair a -> Bool

(/=) :: Fair a -> Fair a -> Bool

Ord a => Ord (Fair a)

Defined in Data.List.Fair

Methods

compare :: Fair a -> Fair a -> Ordering

(<) :: Fair a -> Fair a -> Bool

(<=) :: Fair a -> Fair a -> Bool

(>) :: Fair a -> Fair a -> Bool

(>=) :: Fair a -> Fair a -> Bool

max :: Fair a -> Fair a -> Fair a

min :: Fair a -> Fair a -> Fair a

Read a => Read (Fair a)

Defined in Data.List.Fair

Methods

readsPrec :: Int -> ReadS (Fair a)

readList :: ReadS [Fair a]

readPrec :: ReadPrec (Fair a)

readListPrec :: ReadPrec [Fair a]

Show a => Show (Fair a)

Defined in Data.List.Fair

Methods

showsPrec :: Int -> Fair a -> ShowS

show :: Fair a -> String

showList :: [Fair a] -> ShowS

Semigroup a => Semigroup (Fair a)

Defined in Data.List.Fair

Methods

(<>) :: Fair a -> Fair a -> Fair a

sconcat :: NonEmpty (Fair a) -> Fair a

stimes :: Integral b => b -> Fair a -> Fair a

Monoid a => Monoid (Fair a)

Defined in Data.List.Fair

Methods

mempty :: Fair a

mappend :: Fair a -> Fair a -> Fair a

mconcat :: [Fair a] -> Fair a