Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

9. insMapLookupNode :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> (Bool, g a b, NodeMap a, LNode a)

   fgl	Data.Graph.Inductive.NodeMap

   Act as insMapNode, but return also a boolean set as True if the node was already in the map.

10. insMapNode :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> (g a b, NodeMap a, LNode a)

    fgl	Data.Graph.Inductive.NodeMap

    No documentation available.

Page 508 of many | Previous | Next