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

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

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

9. type C_SettingsBindGetMapping = Ptr GValue -> Ptr GVariant -> Ptr () -> IO CInt

   gi-gio	GI.Gio.Callbacks

   Type for the callback on the (unwrapped) C side.

10. type C_SettingsBindSetMapping = Ptr GValue -> Ptr VariantType -> Ptr () -> IO Ptr GVariant

    gi-gio	GI.Gio.Callbacks

    Type for the callback on the (unwrapped) C side.

Page 510 of many | Previous | Next