graph-core-0.2.0.1: Fast, memory efficient and persistent graph implementation

Safe Haskell	None

Data.Graph.NodeManager

Documentation

data NodeManager k Source

Instances

Eq k => Eq (NodeManager k)
Show k => Show (NodeManager k)

type Node = Int Source

type NodeMap v = IntMap vSource

type NodeSet = IntSet Source

emptyNode :: Node Source

initNodeManager :: (Hashable k, Eq k) => NodeMap k -> NodeManager kSource

emptyNodeManager :: forall k. NodeManager kSource

getNodeMap :: (Hashable k, Eq k) => NodeManager k -> NodeMap kSource

getNodeHandle :: (Hashable k, Eq k, MonadState (NodeManager k) m) => k -> m Node Source

getExistingNodeHandle :: (Hashable k, Eq k) => k -> NodeManager k -> Maybe Node Source

lookupNode :: Node -> NodeManager k -> Maybe kSource

unsafeLookupNode :: Node -> NodeManager k -> kSource

removeNodeHandle :: (Hashable k, Eq k) => Node -> NodeManager k -> NodeManager kSource

getNewNodesSince :: Node -> NodeManager k -> NodeMap kSource

keys :: NodeManager k -> [k]Source

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

nodes :: NodeManager k -> [Node]Source

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

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