Safe Haskell | None |
---|---|
Language | Haskell2010 |
Data.Functor.Indexed.Const
Description
Documentation
newtype Const κ a b z Source #
Instances
Semigroupoid κ => Apply (Const κ :: k -> k -> Type -> Type) Source # | |
Defined in Data.Functor.Indexed.Const Methods (<*>) :: forall (i :: k0) (j :: k0) a b (k1 :: k0). Const κ i j (a -> b) -> Const κ j k1 a -> Const κ i k1 b Source # (*>) :: forall (i :: k0) (j :: k0) a (k1 :: k0) b. Const κ i j a -> Const κ j k1 b -> Const κ i k1 b Source # (<*) :: forall (i :: k0) (j :: k0) a (k1 :: k0) b. Const κ i j a -> Const κ j k1 b -> Const κ i k1 a Source # liftA2 :: forall a b c (i :: k0) (j :: k0) (k1 :: k0). (a -> b -> c) -> Const κ i j a -> Const κ j k1 b -> Const κ i k1 c Source # | |
Functor (Const κ a b :: Type -> Type) Source # | |
Category κ => Applicative (Const κ a a :: Type -> Type) Source # | |
Defined in Data.Functor.Indexed.Const | |
Foldable (Const κ a b :: Type -> Type) Source # | |
Defined in Data.Functor.Indexed.Const Methods fold :: Monoid m => Const κ a b m -> m # foldMap :: Monoid m => (a0 -> m) -> Const κ a b a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Const κ a b a0 -> m # foldr :: (a0 -> b0 -> b0) -> b0 -> Const κ a b a0 -> b0 # foldr' :: (a0 -> b0 -> b0) -> b0 -> Const κ a b a0 -> b0 # foldl :: (b0 -> a0 -> b0) -> b0 -> Const κ a b a0 -> b0 # foldl' :: (b0 -> a0 -> b0) -> b0 -> Const κ a b a0 -> b0 # foldr1 :: (a0 -> a0 -> a0) -> Const κ a b a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Const κ a b a0 -> a0 # toList :: Const κ a b a0 -> [a0] # null :: Const κ a b a0 -> Bool # length :: Const κ a b a0 -> Int # elem :: Eq a0 => a0 -> Const κ a b a0 -> Bool # maximum :: Ord a0 => Const κ a b a0 -> a0 # minimum :: Ord a0 => Const κ a b a0 -> a0 # | |
Traversable (Const κ a b :: Type -> Type) Source # | |
Defined in Data.Functor.Indexed.Const Methods traverse :: Applicative f => (a0 -> f b0) -> Const κ a b a0 -> f (Const κ a b b0) # sequenceA :: Applicative f => Const κ a b (f a0) -> f (Const κ a b a0) # mapM :: Monad m => (a0 -> m b0) -> Const κ a b a0 -> m (Const κ a b b0) # sequence :: Monad m => Const κ a b (m a0) -> m (Const κ a b a0) # | |
Eq (κ a b) => Eq (Const κ a b z) Source # | |
Ord (κ a b) => Ord (Const κ a b z) Source # | |
Defined in Data.Functor.Indexed.Const Methods compare :: Const κ a b z -> Const κ a b z -> Ordering # (<) :: Const κ a b z -> Const κ a b z -> Bool # (<=) :: Const κ a b z -> Const κ a b z -> Bool # (>) :: Const κ a b z -> Const κ a b z -> Bool # (>=) :: Const κ a b z -> Const κ a b z -> Bool # | |
Show (κ a b) => Show (Const κ a b z) Source # | |