Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

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

5. insMapNodeM :: (Ord a, DynGraph g) => a -> NodeMapM a b g (LNode a)

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

6. insMapNode_ :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

    fgl	Data.Graph.Inductive.NodeMap

    Partial function: raises exception if passed a node that is not in the graph.

Page 509 of many | Previous | Next