Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. 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.

2. 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.

3. fmapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f b

   reflex	Reflex.Class

   Alias for mapMaybe

4. fmapMaybe :: FunctorMaybe f => (a -> Maybe b) -> f a -> f b

   reflex	Reflex.FunctorMaybe

   Combined mapping and filtering function.

5. 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.

6. 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.

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

   ghc-lib-parser	GHC.Data.Unboxed

   No documentation available.

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

   ghc-lib-parser	GHC.Utils.Monad

   Monadic version of concatMap

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

   ghc-lib-parser	GHC.Utils.Monad

   Monadic version of foldMap

10. imapMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => (Int -> a -> a) -> Mutable arr (PrimState m) a -> m ()

    contiguous	Data.Primitive.Contiguous

    Map over a mutable array with indices, modifying the elements in place.

Page 81 of many | Previous | Next