Data.Functor.Join

Documentation

newtype Join p a

Constructors

Join

Fields

• unJoin :: p a a

Instances

Bifunctor p => Functor (Join * p)

Methods

fmap :: (a -> b) -> Join * p a -> Join * p b

(<$) :: a -> Join * p b -> Join * p a

Bifoldable p => Foldable (Join * p)

Methods

fold :: Monoid m => Join * p m -> m

foldMap :: Monoid m => (a -> m) -> Join * p a -> m

foldr :: (a -> b -> b) -> b -> Join * p a -> b

foldr' :: (a -> b -> b) -> b -> Join * p a -> b

foldl :: (b -> a -> b) -> b -> Join * p a -> b

foldl' :: (b -> a -> b) -> b -> Join * p a -> b

foldr1 :: (a -> a -> a) -> Join * p a -> a

foldl1 :: (a -> a -> a) -> Join * p a -> a

toList :: Join * p a -> [a]

null :: Join * p a -> Bool

length :: Join * p a -> Int

elem :: Eq a => a -> Join * p a -> Bool

maximum :: Ord a => Join * p a -> a

minimum :: Ord a => Join * p a -> a

sum :: Num a => Join * p a -> a

product :: Num a => Join * p a -> a

Bitraversable p => Traversable (Join * p)

Methods

traverse :: Applicative f => (a -> f b) -> Join * p a -> f (Join * p b)

sequenceA :: Applicative f => Join * p (f a) -> f (Join * p a)

mapM :: Monad m => (a -> m b) -> Join * p a -> m (Join * p b)

sequence :: Monad m => Join * p (m a) -> m (Join * p a)

Eq2 p => Eq1 (Join * p)

Methods

liftEq :: (a -> b -> Bool) -> Join * p a -> Join * p b -> Bool

Ord2 p => Ord1 (Join * p)

Methods

liftCompare :: (a -> b -> Ordering) -> Join * p a -> Join * p b -> Ordering

Read2 p => Read1 (Join * p)

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Join * p a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Join * p a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Join * p a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Join * p a]

Show2 p => Show1 (Join * p)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Join * p a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Join * p a] -> ShowS

Bicotraversable p => Cotraversable (Join * p)

Methods

collect :: Functor g => (a -> Join * p b) -> g a -> Join * p (g b)

cosequence :: Functor g => g (Join * p a) -> Join * p (g a)

cotraverse :: Functor g => (g a -> b) -> g (Join * p a) -> Join * p b

(Eq2 p, Eq a) => Eq (Join * p a)

Methods

(==) :: Join * p a -> Join * p a -> Bool

(/=) :: Join * p a -> Join * p a -> Bool

(Ord2 p, Ord a) => Ord (Join * p a)

Methods

compare :: Join * p a -> Join * p a -> Ordering

(<) :: Join * p a -> Join * p a -> Bool

(<=) :: Join * p a -> Join * p a -> Bool

(>) :: Join * p a -> Join * p a -> Bool

(>=) :: Join * p a -> Join * p a -> Bool

max :: Join * p a -> Join * p a -> Join * p a

min :: Join * p a -> Join * p a -> Join * p a

(Read2 p, Read a) => Read (Join * p a)

Methods

readsPrec :: Int -> ReadS (Join * p a)

readList :: ReadS [Join * p a]

readPrec :: ReadPrec (Join * p a)

readListPrec :: ReadPrec [Join * p a]

(Show2 p, Show a) => Show (Join * p a)

Methods

showsPrec :: Int -> Join * p a -> ShowS

show :: Join * p a -> String

showList :: [Join * p a] -> ShowS