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. mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map b

   ghc-lib-parser	GHC.Data.Word64Map.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"
   

2. mapMissing :: forall (f :: Type -> Type) x y . Applicative f => (Key -> x -> y) -> WhenMissing f x y

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Map over the entries whose keys are missing from the other map.

   mapMissing :: (k -> x -> y) -> SimpleWhenMissing x y
   

   mapMissing f = mapMaybeMissing (\k x -> Just $ f k x)
   

   but mapMissing is somewhat faster.

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

   ghc-lib-parser	GHC.Data.Word64Map.Lazy

   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"
   

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

   ghc-lib-parser	GHC.Data.Word64Map.Lazy

   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"
   

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

   ghc-lib-parser	GHC.Data.Word64Map.Strict

   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"
   

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

   ghc-lib-parser	GHC.Data.Word64Map.Strict

   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"
   

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

   ghc-lib-parser	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"
   

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

   ghc-lib-parser	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"
   

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

   ghc-lib-parser	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
   

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

    ghc-lib-parser	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
    

Page 35 of many | Previous | Next