Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapCursorSelection :: MapCursor kc vc k v -> Int

   cursor	Cursor.Simple.Map

   No documentation available.

2. mapCursorToggleSelected :: MapCursor k v -> MapCursor k v

   cursor	Cursor.Simple.Map

   No documentation available.

3. mapMapCursor :: (k -> l) -> (v -> w) -> MapCursor k v -> MapCursor l w

   cursor	Cursor.Simple.Map

   No documentation available.

4. mapKeyValueCursor :: (k -> l) -> (v -> w) -> KeyValueCursor k v -> KeyValueCursor l w

   cursor	Cursor.Simple.Map.KeyValue

   No documentation available.

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

   cursor	Cursor.Simple.Tree

   No documentation available.

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

   cursor	Cursor.Tree.Base

   No documentation available.

7. 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.

8. 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.

9. 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.

10. 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)

Page 218 of many | Previous | Next