Yaya.Containers.Pattern.Set
Contents
data SetF a r Source #
Constructors
Defined in Yaya.Containers.Pattern.Set
Methods
liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> SetF a c -> SetF b d -> Bool #
liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> SetF a c -> SetF b d -> Ordering #
Since: 0.1.2.0
liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (SetF a b) #
liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [SetF a b] #
liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (SetF a b) #
liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [SetF a b] #
liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> SetF a b -> ShowS #
liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [SetF a b] -> ShowS #
project :: Coalgebra (->) (SetF a) (Set a) #
cata :: forall (a0 :: k1). Algebra (->) (SetF a) a0 -> Set a -> a0 #
Associated Types
type Rep1 (SetF a) :: k -> Type #
from1 :: forall (a0 :: k). SetF a a0 -> Rep1 (SetF a) a0 #
to1 :: forall (a0 :: k). Rep1 (SetF a) a0 -> SetF a a0 #
embed :: Algebra (->) (SetF a) (Set a) #
fold :: Monoid m => SetF a m -> m #
foldMap :: Monoid m => (a0 -> m) -> SetF a a0 -> m #
foldMap' :: Monoid m => (a0 -> m) -> SetF a a0 -> m #
foldr :: (a0 -> b -> b) -> b -> SetF a a0 -> b #
foldr' :: (a0 -> b -> b) -> b -> SetF a a0 -> b #
foldl :: (b -> a0 -> b) -> b -> SetF a a0 -> b #
foldl' :: (b -> a0 -> b) -> b -> SetF a a0 -> b #
foldr1 :: (a0 -> a0 -> a0) -> SetF a a0 -> a0 #
foldl1 :: (a0 -> a0 -> a0) -> SetF a a0 -> a0 #
toList :: SetF a a0 -> [a0] #
null :: SetF a a0 -> Bool #
length :: SetF a a0 -> Int #
elem :: Eq a0 => a0 -> SetF a a0 -> Bool #
maximum :: Ord a0 => SetF a a0 -> a0 #
minimum :: Ord a0 => SetF a a0 -> a0 #
sum :: Num a0 => SetF a a0 -> a0 #
product :: Num a0 => SetF a a0 -> a0 #
liftEq :: (a0 -> b -> Bool) -> SetF a a0 -> SetF a b -> Bool #
liftCompare :: (a0 -> b -> Ordering) -> SetF a a0 -> SetF a b -> Ordering #
liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (SetF a a0) #
liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [SetF a a0] #
liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (SetF a a0) #
liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [SetF a a0] #
liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> SetF a a0 -> ShowS #
liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [SetF a a0] -> ShowS #
traverse :: Applicative f => (a0 -> f b) -> SetF a a0 -> f (SetF a b) #
sequenceA :: Applicative f => SetF a (f a0) -> f (SetF a a0) #
mapM :: Monad m => (a0 -> m b) -> SetF a a0 -> m (SetF a b) #
sequence :: Monad m => SetF a (m a0) -> m (SetF a a0) #
fmap :: (a0 -> b) -> SetF a a0 -> SetF a b #
(<$) :: a0 -> SetF a b -> SetF a a0 #
type Rep (SetF a r) :: Type -> Type #
from :: SetF a r -> Rep (SetF a r) x #
to :: Rep (SetF a r) x -> SetF a r #
readsPrec :: Int -> ReadS (SetF a r) #
readList :: ReadS [SetF a r] #
readPrec :: ReadPrec (SetF a r) #
readListPrec :: ReadPrec [SetF a r] #
showsPrec :: Int -> SetF a r -> ShowS #
show :: SetF a r -> String #
showList :: [SetF a r] -> ShowS #
(==) :: SetF a r -> SetF a r -> Bool #
(/=) :: SetF a r -> SetF a r -> Bool #
compare :: SetF a r -> SetF a r -> Ordering #
(<) :: SetF a r -> SetF a r -> Bool #
(<=) :: SetF a r -> SetF a r -> Bool #
(>) :: SetF a r -> SetF a r -> Bool #
(>=) :: SetF a r -> SetF a r -> Bool #
max :: SetF a r -> SetF a r -> SetF a r #
min :: SetF a r -> SetF a r -> SetF a r #