Documentation

data NodeManager k #

type Node = Int #

type NodeMap v = IntMap v #

type NodeSet = IntSet #

emptyNode :: Node #

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] #

hasKey :: (Eq k, Hashable k) => k -> NodeManager k -> Bool #

nodes :: NodeManager k -> [Node] #

toList :: NodeManager k -> [(k, Node)] #

isConsistent :: Ord k => NodeManager k -> Bool #