Hoogle Search

Within LTS Haskell 24.49 (ghc-9.10.3)

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

Exact lookup

1. prMapMaybeName :: (a -> Maybe b) -> PeriodicReport a c -> PeriodicReport b c

   hledger-lib	Hledger.Reports.ReportTypes

   Map a function over the row names, possibly discarding some.

2. indexMapMapWithKey :: (a -> b -> c) -> Map (ToOrd a) b -> Map (ToOrd a) c

   numeric-prelude	MathObj.PartialFraction

   No documentation available.

3. unsafeMapMonotonic :: (k -> p -> v -> (q, w)) -> HashPSQ k p v -> HashPSQ k q w

   psqueues	Data.HashPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

4. unsafeMapMonotonic :: (Key -> p -> v -> (q, w)) -> IntPSQ p v -> IntPSQ q w

   psqueues	Data.IntPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

5. unsafeMapMonotonic :: forall k p q v w . (k -> p -> v -> (q, w)) -> OrdPSQ k p v -> OrdPSQ k q w

   psqueues	Data.OrdPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

6. rigidMapM :: (ListLike full item, Monad m) => (item -> m item) -> full -> m full

   ListLike	Data.ListLike

   Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.

7. rigidMapM :: (ListLike full item, Monad m) => (item -> m item) -> full -> m full

   ListLike	Data.ListLike.Base

   Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.

8. fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB b

   ghc-lib-parser	GHC.Data.Unboxed

   No documentation available.

9. concatMapM :: (Monad m, Traversable f) => (a -> m [b]) -> f a -> m [b]

   ghc-lib-parser	GHC.Utils.Monad

   Monadic version of concatMap

10. foldMapM :: (Applicative m, Foldable t, Monoid b) => (a -> m b) -> t a -> m b

    ghc-lib-parser	GHC.Utils.Monad

    Monadic version of foldMap

Page 81 of many | Previous | Next