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.

Exact lookup

1. MkInitDeclarationListOptJust :: [InitDeclarator] -> InitDeclarationListOpt

   ogma-language-c	Language.C.AbsC

   No documentation available.

2. MkPointerOptJust :: Pointer -> PointerOpt

   ogma-language-c	Language.C.AbsC

   No documentation available.

3. MkTypeQualifierListOptJust :: TypeQualifierList -> TypeQualifierListOpt

   ogma-language-c	Language.C.AbsC

   No documentation available.

4. onJust :: Maybe a -> b -> (a -> b) -> b

   overhang	Overhang

   Hang on the Just case of a Maybe.

   onJust m d j = maybe d j m
   

5. adjust :: forall s k a . Hashable k => (a -> a) -> Key s k -> HashMap s k a -> HashMap s k a

   refined-containers	Data.HashMap.Refined

   Update the value at a specific key known the be in the map using the given function. The set of keys remains the same.

   reinsert k v = 'adjust (const v) k'
   

6. adjust' :: forall s k a . Hashable k => (a -> a) -> k -> HashMap s k a -> HashMap s k a

   refined-containers	Data.HashMap.Refined

   If the given key is in the map, update the value at that key using the given function. In any case, the set of keys remains the same.

7. adjustWithKey :: forall s k a . Hashable k => (Key s k -> a -> a) -> k -> HashMap s k a -> HashMap s k a

   refined-containers	Data.HashMap.Refined

   If the given key is in the map, update the associated value using the given function with a proof that the key was in the map; otherwise return the map unchanged. In any case the set of keys remains the same.

8. adjust :: forall s k a . Hashable k => (a -> a) -> Key s k -> HashMap s k a -> HashMap s k a

   refined-containers	Data.HashMap.Strict.Refined

   Update the value at a specific key known the be in the map using the given function. The set of keys remains the same.

9. adjust' :: forall s k a . Hashable k => (a -> a) -> k -> HashMap s k a -> HashMap s k a

   refined-containers	Data.HashMap.Strict.Refined

   If the given key is in the map, update the value at that key using the given function. In any case, the set of keys remains the same.

10. adjustWithKey :: forall s k a . Hashable k => (Key s k -> a -> a) -> k -> HashMap s k a -> HashMap s k a

    refined-containers	Data.HashMap.Strict.Refined

    If the given key is in the map, update the associated value using the given function with a proof that the key was in the map; otherwise return the map unchanged. In any case the set of keys remains the same.

Page 162 of many | Previous | Next