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

Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Core.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 v Source

type NodeSet = IntSet Source

emptyNode :: Node Source

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

emptyNodeManager :: forall k. NodeManager k Source

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

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 k Source

unsafeLookupNode :: Node -> NodeManager k -> k Source

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

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

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