Safe Haskell | None |
---|---|
Language | Haskell2010 |
Data.PolyMap
Documentation
data PolyMap (c :: Type -> Constraint) (f :: Type -> Type) a Source #
lookup :: forall p (c :: Type -> Constraint) f a. Typeable p => PolyMap c f a -> Maybe (f (p -> a)) Source #
lookupApply :: forall p f (c :: Type -> Constraint) a. (Typeable p, Functor f) => p -> PolyMap c f a -> Maybe (f a) Source #
lookupConcat :: (Monoid m, Functor f) => (forall p. c p => Maybe p) -> (forall p. c p => p -> f (p -> a) -> m) -> PolyMap c f a -> m Source #
alter :: forall p (c :: Type -> Constraint) f a. (Typeable p, c p) => (Maybe (f (p -> a)) -> Maybe (f (p -> a))) -> PolyMap c f a -> PolyMap c f a Source #
insertWith :: forall p (c :: Type -> Constraint) f a. (Typeable p, c p) => (f (p -> a) -> f (p -> a) -> f (p -> a)) -> f (p -> a) -> PolyMap c f a -> PolyMap c f a Source #
unionWith :: (forall p. c p => f (p -> a) -> f (p -> a) -> f (p -> a)) -> PolyMap c f a -> PolyMap c f a -> PolyMap c f a Source #
union :: forall (f :: Type -> Type) (c :: Type -> Constraint) a. Alternative f => PolyMap c f a -> PolyMap c f a -> PolyMap c f a Source #
zipWith' :: (forall p. c p => Maybe (f (p -> a)) -> Maybe (f (p -> b)) -> Maybe (f (p -> d))) -> PolyMap c f a -> PolyMap c f b -> PolyMap c f d Source #
zipWith :: forall (f :: Type -> Type) a b d (c :: Type -> Constraint). Applicative f => (a -> b -> d) -> PolyMap c f a -> PolyMap c f b -> PolyMap c f d Source #