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