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. delMapEdges :: (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.

2. delMapEdgesM :: (Ord a, DynGraph g) => [(a, a)] -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

3. delMapNode :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

4. delMapNodeM :: (Ord a, DynGraph g) => a -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

5. delMapNodes :: (Ord a, DynGraph g) => NodeMap a -> [a] -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

6. delMapNodesM :: (Ord a, DynGraph g) => [a] -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

7. insMapEdge :: (Ord a, DynGraph g) => NodeMap a -> (a, a, b) -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

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

8. insMapEdgeM :: (Ord a, DynGraph g) => (a, a, b) -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

9. insMapEdges :: (Ord a, DynGraph g) => NodeMap a -> [(a, a, b)] -> 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. insMapEdgesM :: (Ord a, DynGraph g) => [(a, a, b)] -> NodeMapM a b g ()

    fgl	Data.Graph.Inductive.NodeMap

    No documentation available.

Page 509 of many | Previous | Next