reg-alloc-graph-color-0.0.0.0: Register allocation by graph colorization
RegAlloc.UGraph
data Node where Source #
Bundled Patterns
Defined in RegAlloc.Nodes.Private
Methods
(==) :: Node -> Node -> Bool #
(/=) :: Node -> Node -> Bool #
showsPrec :: Int -> Node -> ShowS #
show :: Node -> String #
showList :: [Node] -> ShowS #
data UGraph Source #
Defined in RegAlloc.UGraph.Private
(==) :: UGraph -> UGraph -> Bool #
(/=) :: UGraph -> UGraph -> Bool #
showsPrec :: Int -> UGraph -> ShowS #
show :: UGraph -> String #
showList :: [UGraph] -> ShowS #
(<>) :: UGraph -> UGraph -> UGraph #
sconcat :: NonEmpty UGraph -> UGraph #
stimes :: Integral b => b -> UGraph -> UGraph #
mempty :: UGraph #
mappend :: UGraph -> UGraph -> UGraph #
mconcat :: [UGraph] -> UGraph #
data Nodes Source #
(==) :: Nodes -> Nodes -> Bool #
(/=) :: Nodes -> Nodes -> Bool #
showsPrec :: Int -> Nodes -> ShowS #
show :: Nodes -> String #
showList :: [Nodes] -> ShowS #
nbrsOf :: Int -> UGraph -> Nodes Source #
coalesce :: Node -> Int -> UGraph -> UGraph Source #
coalesceIfNoEdge :: Node -> Int -> UGraph -> UGraph Source #
(!) :: UGraph -> Int -> Nodes Source #
(∈) :: Node -> Nodes -> Bool Source #
hasEdge :: Node -> Int -> UGraph -> Bool Source #
toAscList :: UGraph -> [(Int, Nodes)] Source #
deleteNode :: Int -> UGraph -> UGraph Source #
deleteNodes :: IntSet -> UGraph -> UGraph Source #
nullEdges :: UGraph -> Bool Source #
insertEdge :: Node -> Int -> UGraph -> UGraph Source #
insertEdges :: [(Node, Int)] -> UGraph -> UGraph Source #
empty :: Int -> UGraph Source #
null :: UGraph -> Bool Source #
edges :: UGraph -> [(Int, Node)] Source #