Node -hunit

Node :: Int -> (FiniteMap a b) -> (a, b) -> (FiniteMap a b) -> FiniteMap a b
fgl Data.Graph.Inductive.Internal.FiniteMap
Node :: a -> Forest a -> Tree a
containers Data.Tree
Node :: a -> b -> [Heap a b] -> Heap a b
fgl Data.Graph.Inductive.Internal.Heap
type Node = Int
fgl Data.Graph.Inductive.Graph
Unlabeled node
module Data.Graph.Inductive.NodeMap
fgl Data.Graph.Inductive.NodeMap
Utility methods to automatically generate and keep track of a mapping between node labels and Nodes.
data Ord a => NodeMap a
fgl Data.Graph.Inductive.NodeMap
type NodeMapM a b g r = State (NodeMap a, g a b) r
fgl Data.Graph.Inductive.NodeMap
Graph construction monad; handles passing both the NodeMap and the Graph.
node' :: Context a b -> Node
fgl Data.Graph.Inductive.Graph
The Node in a Context.
NoDelay :: SocketOption
network Network.Socket
TCP_NODELAY
nodeName :: SystemID -> String
unix System.Posix.Unistd
nodeRange :: Graph gr => gr a b -> (Node, Node)
fgl Data.Graph.Inductive.Graph
nodeRangeM :: GraphM m gr => m (gr a b) -> m (Node, Node)
fgl Data.Graph.Inductive.Monad
nodes :: Graph gr => gr a b -> [Node]
fgl Data.Graph.Inductive.Graph
List all Nodes in the Graph.
nodesM :: GraphM m gr => m (gr a b) -> m [Node]
fgl Data.Graph.Inductive.Monad
eNODEV :: Errno
base Foreign.C.Error
delMapNode :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> g a b
fgl Data.Graph.Inductive.NodeMap
delMapNodeM :: (Ord a, DynGraph g) => a -> NodeMapM a b g ()
fgl Data.Graph.Inductive.NodeMap
delMapNodes :: (Ord a, DynGraph g) => NodeMap a -> [a] -> g a b -> g a b
fgl Data.Graph.Inductive.NodeMap
delMapNodesM :: (Ord a, DynGraph g) => [a] -> NodeMapM a b g ()
fgl Data.Graph.Inductive.NodeMap
delNode :: Graph gr => Node -> gr a b -> gr a b
fgl Data.Graph.Inductive.Graph
Remove a Node from the Graph.

Show more results