Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. graphMapModify :: (UniqFM k (Node k cls color) -> UniqFM k (Node k cls color)) -> Graph k cls color -> Graph k cls color

    ghc GHC.Data.Graph.Base

    Modify the finite map holding the nodes in the graph.

  2. emap :: DynGraph gr => (b -> c) -> gr a b -> gr a c

    ghc GHC.Data.Graph.Inductive.Graph

    Map a function over the Edge labels in a graph.

  3. gfiltermap :: DynGraph gr => (Context a b -> MContext c d) -> gr a b -> gr c d

    ghc GHC.Data.Graph.Inductive.Graph

    Build a graph out of the contexts for which the predicate is satisfied by recursively calling match.

  4. gmap :: DynGraph gr => (Context a b -> Context c d) -> gr a b -> gr c d

    ghc GHC.Data.Graph.Inductive.Graph

    Map a function over the graph by recursively calling match.

  5. nemap :: DynGraph gr => (a -> c) -> (b -> d) -> gr a b -> gr c d

    ghc GHC.Data.Graph.Inductive.Graph

    Map functions over both the Node and Edge labels in a graph.

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

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

    ghc GHC.Data.List.Infinite

    No documentation available.

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

    ghc GHC.Data.SmallArray

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

  9. module GHC.Data.TrieMap

    No documentation available.

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

    ghc GHC.Data.TrieMap

    No documentation available.

Page 448 of many | Previous | Next