Data.Functor.Base

Base Functors for standard types not already expressed as a fixed point.

Documentation

data NonEmptyF a b

Base Functor for NonEmpty

Constructors

NonEmptyF

Fields

• head :: a
• tail :: Maybe b

Instances

Eq2 NonEmptyF

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> NonEmptyF a c -> NonEmptyF b d -> Bool

Ord2 NonEmptyF

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> NonEmptyF a c -> NonEmptyF b d -> Ordering

Read2 NonEmptyF

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (NonEmptyF a b)

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [NonEmptyF a b]

Show2 NonEmptyF

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> NonEmptyF a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [NonEmptyF a b] -> ShowS

Bifunctor NonEmptyF

Methods

bimap :: (a -> b) -> (c -> d) -> NonEmptyF a c -> NonEmptyF b d

first :: (a -> b) -> NonEmptyF a c -> NonEmptyF b c

second :: (b -> c) -> NonEmptyF a b -> NonEmptyF a c

Bitraversable NonEmptyF

Methods

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

Bifoldable NonEmptyF

Methods

bifold :: Monoid m => NonEmptyF m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> NonEmptyF a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> NonEmptyF a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> NonEmptyF a b -> c

Functor (NonEmptyF a)

Methods

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

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

Foldable (NonEmptyF a)

Methods

fold :: Monoid m => NonEmptyF a m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> NonEmptyF a a -> a

foldl1 :: (a -> a -> a) -> NonEmptyF a a -> a

toList :: NonEmptyF a a -> [a]

null :: NonEmptyF a a -> Bool

length :: NonEmptyF a a -> Int

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

maximum :: Ord a => NonEmptyF a a -> a

minimum :: Ord a => NonEmptyF a a -> a

sum :: Num a => NonEmptyF a a -> a

product :: Num a => NonEmptyF a a -> a

Traversable (NonEmptyF a)

Methods

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

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

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

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

Generic1 (NonEmptyF a)

Associated Types

type Rep1 (NonEmptyF a :: * -> *) :: * -> *

Methods

from1 :: NonEmptyF a a -> Rep1 (NonEmptyF a) a

to1 :: Rep1 (NonEmptyF a) a -> NonEmptyF a a

Eq a => Eq1 (NonEmptyF a)

Methods

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

Ord a => Ord1 (NonEmptyF a)

Methods

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

Read a => Read1 (NonEmptyF a)

Methods

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

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

Show a => Show1 (NonEmptyF a)

Methods

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

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

(Eq b, Eq a) => Eq (NonEmptyF a b)

Methods

(==) :: NonEmptyF a b -> NonEmptyF a b -> Bool

(/=) :: NonEmptyF a b -> NonEmptyF a b -> Bool

(Ord b, Ord a) => Ord (NonEmptyF a b)

Methods

compare :: NonEmptyF a b -> NonEmptyF a b -> Ordering

(<) :: NonEmptyF a b -> NonEmptyF a b -> Bool

(<=) :: NonEmptyF a b -> NonEmptyF a b -> Bool

(>) :: NonEmptyF a b -> NonEmptyF a b -> Bool

(>=) :: NonEmptyF a b -> NonEmptyF a b -> Bool

max :: NonEmptyF a b -> NonEmptyF a b -> NonEmptyF a b

min :: NonEmptyF a b -> NonEmptyF a b -> NonEmptyF a b

(Read b, Read a) => Read (NonEmptyF a b)

Methods

readsPrec :: Int -> ReadS (NonEmptyF a b)

readList :: ReadS [NonEmptyF a b]

readPrec :: ReadPrec (NonEmptyF a b)

readListPrec :: ReadPrec [NonEmptyF a b]

(Show b, Show a) => Show (NonEmptyF a b)

Methods

showsPrec :: Int -> NonEmptyF a b -> ShowS

show :: NonEmptyF a b -> String

showList :: [NonEmptyF a b] -> ShowS

Generic (NonEmptyF a b)

Associated Types

type Rep (NonEmptyF a b) :: * -> *

Methods

from :: NonEmptyF a b -> Rep (NonEmptyF a b) x

to :: Rep (NonEmptyF a b) x -> NonEmptyF a b

type Rep1 (NonEmptyF a)

type Rep1 (NonEmptyF a) = D1 (MetaData "NonEmptyF" "Data.Functor.Base" "recursion-schemes-5.0.2-HSIBLYBwgfJHnWxEt5tPKC" False) (C1 (MetaCons "NonEmptyF" PrefixI True) ((:*:) (S1 (MetaSel (Just Symbol "head") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) (S1 (MetaSel (Just Symbol "tail") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Maybe))))

type Rep (NonEmptyF a b)

type Rep (NonEmptyF a b) = D1 (MetaData "NonEmptyF" "Data.Functor.Base" "recursion-schemes-5.0.2-HSIBLYBwgfJHnWxEt5tPKC" False) (C1 (MetaCons "NonEmptyF" PrefixI True) ((:*:) (S1 (MetaSel (Just Symbol "head") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) (S1 (MetaSel (Just Symbol "tail") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe b)))))