Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. mapTreeCursor :: (a -> b) -> TreeCursor a -> TreeCursor b

    cursor Cursor.Simple.Tree

    No documentation available.

  2. mapTreeCursor :: (a -> c) -> (b -> d) -> TreeCursor a b -> TreeCursor c d

    cursor Cursor.Tree.Base

    No documentation available.

  3. mapUnion :: forall (es :: [Effect]) (es' :: [Effect]) (f :: Type -> Type) a . (forall (e :: Effect) . () => Membership e es -> Membership e es') -> Union es f a -> Union es' f a

    data-effects-core Data.Effect.OpenUnion

    No documentation available.

  4. mapDeRef :: (MuRef a, Applicative f) => (forall b . (MuRef b, DeRef a ~ DeRef b) => b -> f u) -> a -> f (DeRef a u)

    data-reify Data.Reify

    No documentation available.

  5. mapEDNS :: EDNSheader -> (EDNS -> a) -> a -> a

    dns Network.DNS.Types

    Return the output of a function applied to the EDNS pseudo-header if EDNS is enabled, otherwise return a default value.

  6. mapU :: (u -> u') -> DUALTree d u a l -> DUALTree d u' a l

    dual-tree Data.Tree.DUAL

    Map a function over all the u annotations in a DUAL-tree. The function must be a monoid homomorphism, and must commute with the action of d on u. That is, to use mapU f safely it must be the case that 

    • f mempty == mempty
    • f (u1 <> u2) == f u1 <> f u2
    • f (act d u) == act d (f u)

  7. mapU :: (u -> u') -> DUALTree d u a l -> DUALTree d u' a l

    dual-tree Data.Tree.DUAL.Internal

    Map a function over all the u annotations in a DUAL-tree. The function must be a monoid homomorphism, and must commute with the action of d on u. That is, to use mapU f safely it must be the case that 

    • f mempty == mempty
    • f (u1 <> u2) == f u1 <> f u2
    • f (act d u) == act d (f u)

  8. mapUNE :: (u -> u') -> DUALTreeNE d u a l -> DUALTreeNE d u' a l

    dual-tree Data.Tree.DUAL.Internal

    Map a function (which must be a monoid homomorphism, and commute with the action of d) over all the u annotations in a non-empty DUAL-tree.

  9. mapUU :: (u -> u') -> DUALTreeU d u a l -> DUALTreeU d u' a l

    dual-tree Data.Tree.DUAL.Internal

    Map a function (which must be a monoid homomorphism, and commute with the action of d) over all the u annotations in a non-empty DUAL-tree paired with its cached u value.

  10. mapConcurrently :: forall f (es :: [Effect]) a b . (HasCallStack, Traversable f, Concurrent :> es) => (a -> Eff es b) -> f a -> Eff es (f b)

    effectful Effectful.Concurrent.Async

    Lifted mapConcurrently.

Page 219 of many | Previous | Next