Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. mapIndices :: (Ix i, Ix j) => (i, i) -> (i -> j) -> STBitArray s j -> ST s (STBitArray s i)

   bitwise	Data.Array.BitArray.ST

   Create a new array by reading from another.

2. mapHandle :: forall (e :: Effects) (es :: Effects) . (Handle h, e :> es) => h e -> h es

   bluefin-internal	Bluefin.Internal

   Used to create compound effects, i.e. handles that contain other handles.

3. mapHandleReader :: forall (h :: Effects -> Type) (e :: Effects) (es :: Effects) . (Handle h, e :> es) => HandleReader h e -> HandleReader h es

   bluefin-internal	Bluefin.Internal

   No documentation available.

4. mapOut :: forall outa outb (f :: Type -> Type) a . (outa -> outb) -> CmdParser f outa a -> CmdParser f outb a

   butcher	UI.Butcher.Monadic

   map over the out type argument

5. mapMaybe :: (a -> Maybe b) -> [a] -> [b]

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   The mapMaybe function is a version of map which can throw out elements. In particular, the functional argument returns something of type Maybe b. If this is Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.

   Examples

   Using mapMaybe f x is a shortcut for catMaybes $ map f x in most cases:

   >>> import GHC.Internal.Text.Read ( readMaybe )
   
   >>> let readMaybeInt = readMaybe :: String -> Maybe Int
   
   >>> mapMaybe readMaybeInt ["1", "Foo", "3"]
   [1,3]
   
   >>> catMaybes $ map readMaybeInt ["1", "Foo", "3"]
   [1,3]
   

   If we map the Just constructor, the entire list should be returned:

   >>> mapMaybe Just [1,2,3]
   [1,2,3]
   

6. mappend :: Monoid a => a -> a -> a

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

7. mapKeys :: (k1 -> k2) -> PSQ k1 v -> PSQ k2 v

   cabal-install-solver	Distribution.Solver.Modular.PSQ

   No documentation available.

8. mapWithKey :: (k -> a -> b) -> PSQ k a -> PSQ k b

   cabal-install-solver	Distribution.Solver.Modular.PSQ

   No documentation available.

9. mapFailure :: (fail1 -> fail2) -> RetryLog step fail1 done -> RetryLog step fail2 done

   cabal-install-solver	Distribution.Solver.Modular.RetryLog

   O(1). Apply a function to the failure value in a log.

10. mapWeightsWithKey :: Ord w2 => (k -> w1 -> w2) -> WeightedPSQ w1 k v -> WeightedPSQ w2 k v

    cabal-install-solver	Distribution.Solver.Modular.WeightedPSQ

    O(N log N). Update the weights.

Page 236 of many | Previous | Next