Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

  1. mapFsEnv :: (elt1 -> elt2) -> FastStringEnv elt1 -> FastStringEnv elt2

    ghc GHC.Data.FastString.Env

    No documentation available.

  2. mapMaybeFsEnv :: (elt1 -> Maybe elt2) -> FastStringEnv elt1 -> FastStringEnv elt2

    ghc GHC.Data.FastString.Env

    No documentation available.

  3. mappendFlatBag :: FlatBag a -> FlatBag a -> FlatBag a

    ghc GHC.Data.FlatBag

    Combine two FlatBags. The new FlatBag contains all elements from both FlatBags. If one of the FlatBags is empty, the old FlatBag is reused.

  4. mapLabels :: PureSupernode node => (Label -> Label) -> node -> node

    ghc GHC.Data.Graph.Collapse

    No documentation available.

  5. mapOL :: (a -> b) -> OrdList a -> OrdList b

    ghc GHC.Data.OrdList

    No documentation available.

  6. mapOL' :: (a -> b) -> OrdList a -> OrdList b

    ghc GHC.Data.OrdList

    No documentation available.

  7. mapSmallArray :: (a -> b) -> SmallArray a -> SmallArray b

    ghc GHC.Data.SmallArray

    Map a function over the elements of a SmallArray

  8. mapAccumL_ :: forall m a b c r . Monad m => (c -> a -> m (c, b)) -> c -> Stream m a r -> Stream m b (c, r)

    ghc GHC.Data.Stream

    Note this is not very efficient because it traverses the whole stream before rebuilding it, avoid using it if you can. mapAccumL used to implemented but it wasn't used anywhere in the compiler and has similar efficiency problems.

  9. mapM :: Monad m => (a -> m b) -> Stream m a x -> Stream m b x

    ghc GHC.Data.Stream

    Apply a monadic operation to each element of a Stream, lazily

  10. mapG :: forall (m :: Type -> Type) a b . Functor m => (a -> b) -> GenMap m a -> GenMap m b

    ghc GHC.Data.TrieMap

    No documentation available.

Page 97 of many | Previous | Next