Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

Exact lookup

1. mapKeysWith :: (a -> a -> a) -> (Key -> Key) -> Word64Map a -> Word64Map a

   ghc	GHC.Data.Word64Map.Strict.Internal

   mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c.

   mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab"
   mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"
   

2. mapMaybe :: (a -> Maybe b) -> Word64Map a -> Word64Map b

   ghc	GHC.Data.Word64Map.Strict.Internal

   Map values and collect the Just results.

   let f x = if x == "a" then Just "new a" else Nothing
   mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
   

3. mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map b

   ghc	GHC.Data.Word64Map.Strict.Internal

   Map keys/values and collect the Just results.

   let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing
   mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"
   

4. mapWithKey :: (Key -> a -> b) -> Word64Map a -> Word64Map b

   ghc	GHC.Data.Word64Map.Strict.Internal

   Map a function over all values in the map.

   let f key x = (show key) ++ ":" ++ x
   mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]
   

5. mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Set

   ghc	GHC.Data.Word64Set

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

6. mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Set

   ghc	GHC.Data.Word64Set.Internal

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

7. mapPlugins :: Plugins -> (Plugin -> [CommandLineOption] -> a) -> [a]

   ghc	GHC.Driver.Plugins

   No documentation available.

8. mapDerivStrategy :: forall p (pass :: Pass) . p ~ GhcPass pass => (XViaStrategy p -> XViaStrategy p) -> DerivStrategy p -> DerivStrategy p

   ghc	GHC.Hs.Decls

   Map over the via type if dealing with ViaStrategy. Otherwise, return the DerivStrategy unchanged.

9. mapHsOuterImplicit :: (XHsOuterImplicit pass -> XHsOuterImplicit pass) -> HsOuterTyVarBndrs flag pass -> HsOuterTyVarBndrs flag pass

   ghc	GHC.Hs.Type

   No documentation available.

10. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

    ghc	GHC.HsToCore.Monad

    No documentation available.

Page 103 of many | Previous | Next