Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
IntervalMap :: FingerTree (IntInterval v) (Node v a) -> IntervalMap v atrifecta Text.Trifecta.Util.IntervalMap No documentation available.
runIntervalMap :: IntervalMap v a -> FingerTree (IntInterval v) (Node v a)trifecta Text.Trifecta.Util.IntervalMap No documentation available.
ffmap :: Functor (Flip t c) => (a -> b) -> t a c -> t b ctype-flip Data.Type.Flip No documentation available.
foldMap :: (Recursive (->) t (XNor a), Monoid m) => (a -> m) -> t -> myaya Yaya.Experimental.Foldable No documentation available.
dmap :: DFunctor d => (forall x . () => f x -> g x) -> d f -> d gyaya Yaya.Functor No documentation available.
-
yaya Yaya.Functor This isn’t a Functor instance because of the position of the a, but you can use it like: > newtype List a = List (Mu (XNor a)) > instance Functor List where > fmap f (List mu) = List (firstMap f mu)
hmap :: HFunctor h => (forall x . () => f x -> g x) -> h f a -> h g ayaya Yaya.Functor No documentation available.
-
yaya Yaya.Zoo No documentation available.
-
yaya Yaya.Zoo A version of map that applies to Corecursive structures.
-
yaya Yaya.Zoo A more general implementation of contramap, because it can also work to, from, or within monomorphic structures.