Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

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

   fgl	Data.Graph.Inductive.Graph

   Map a function over the Edge labels in a graph.

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

   fgl	Data.Graph.Inductive.Graph

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

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

   fgl	Data.Graph.Inductive.Graph

   Map a function over the graph by recursively calling match.

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

   fgl	Data.Graph.Inductive.Graph

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

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

   fgl	Data.Graph.Inductive.Graph

   Map a function over the Node labels in a graph.

6. module Data.Graph.Inductive.NodeMap

   Utility methods to automatically generate and keep track of a mapping between node labels and Nodes.

7. data NodeMap a

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

8. type NodeMapM a b (g :: Type -> Type -> Type) r = State (NodeMap a, g a b) r

   fgl	Data.Graph.Inductive.NodeMap

   Graph construction monad; handles passing both the NodeMap and the Graph.

9. delMapEdge :: (Ord a, DynGraph g) => NodeMap a -> (a, a) -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   Partial function: raises exception if passed nodes that are not in the graph.

10. delMapEdgeM :: (Ord a, DynGraph g) => (a, a) -> NodeMapM a b g ()

    fgl	Data.Graph.Inductive.NodeMap

    No documentation available.

Page 508 of many | Previous | Next