Safe Haskell | Safe |
---|---|
Language | Haskell98 |
Data.Core.Graph.NodeManager
Documentation
data NodeManager k #
Instances
Eq k => Eq (NodeManager k) # | |
Show k => Show (NodeManager k) # | |
initNodeManager :: (Hashable k, Eq k) => NodeMap k -> NodeManager k #
emptyNodeManager :: forall k. NodeManager k #
getNodeMap :: (Hashable k, Eq k) => NodeManager k -> NodeMap k #
getNodeHandle :: (Hashable k, Eq k, MonadState (NodeManager k) m) => k -> m Node #
getExistingNodeHandle :: (Hashable k, Eq k) => k -> NodeManager k -> Maybe Node #
lookupNode :: Node -> NodeManager k -> Maybe k #
unsafeLookupNode :: Node -> NodeManager k -> k #
removeNodeHandle :: (Hashable k, Eq k) => Node -> NodeManager k -> NodeManager k #
getNewNodesSince :: Node -> NodeManager k -> NodeMap k #
keys :: NodeManager k -> [k] #
nodes :: NodeManager k -> [Node] #
toList :: NodeManager k -> [(k, Node)] #
isConsistent :: Ord k => NodeManager k -> Bool #