Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. module GHC.Data.FiniteMap

   No documentation available.

2. graphMap :: Graph k cls color -> UniqFM k (Node k cls color)

   ghc	GHC.Data.Graph.Base

   All active nodes in the graph.

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

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

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

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

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

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

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

   ghc	GHC.Data.List.Infinite

   No documentation available.

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

    ghc	GHC.Data.SmallArray

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

Page 448 of many | Previous | Next