Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

  1. nmap :: DynGraph gr => (a -> c) -> gr a b -> gr c b

    ghc GHC.Data.Graph.Inductive.Graph

    Map a function over the Node labels in a graph.

  2. concatMap :: Foldable f => (a -> f b) -> Infinite a -> Infinite b

    ghc GHC.Data.List.Infinite

    No documentation available.

  3. foldMapSmallArray :: Monoid m => (a -> m) -> SmallArray a -> m

    ghc GHC.Data.SmallArray

    Fold the values of a SmallArray into a 'Monoid m' of choice

  4. module GHC.Data.TrieMap

    No documentation available.

  5. data GenMap (m :: Type -> Type) a

    ghc GHC.Data.TrieMap

    No documentation available.

  6. data ListMap (m :: Type -> Type) a

    ghc GHC.Data.TrieMap

    No documentation available.

  7. type LiteralMap a = Map Literal a

    ghc GHC.Data.TrieMap

    No documentation available.

  8. data MaybeMap (m :: Type -> Type) a

    ghc GHC.Data.TrieMap

    No documentation available.

  9. class Functor m => TrieMap (m :: Type -> Type)

    ghc GHC.Data.TrieMap

    No documentation available.

  10. foldMapTM :: (TrieMap m, Monoid r) => (a -> r) -> m a -> r

    ghc GHC.Data.TrieMap

    No documentation available.

Page 450 of many | Previous | Next