reg-alloc-graph-color-0.0.0.0: Register allocation by graph colorization

Safe HaskellSafe
LanguageHaskell2010

RegAlloc.UGraph

Documentation

data Node where Source #

Bundled Patterns

pattern Precolored :: Int -> Node 
pattern Node :: Int -> Node 
Instances
Eq Node Source # 
Instance details

Defined in RegAlloc.Nodes.Private

Methods

(==) :: Node -> Node -> Bool #

(/=) :: Node -> Node -> Bool #

Show Node Source # 
Instance details

Defined in RegAlloc.Nodes.Private

Methods

showsPrec :: Int -> Node -> ShowS #

show :: Node -> String #

showList :: [Node] -> ShowS #

data UGraph Source #

Instances
Eq UGraph Source # 
Instance details

Defined in RegAlloc.UGraph.Private

Methods

(==) :: UGraph -> UGraph -> Bool #

(/=) :: UGraph -> UGraph -> Bool #

Show UGraph Source # 
Instance details

Defined in RegAlloc.UGraph.Private

Semigroup UGraph Source # 
Instance details

Defined in RegAlloc.UGraph.Private

Monoid UGraph Source # 
Instance details

Defined in RegAlloc.UGraph.Private

data Nodes Source #

Instances
Eq Nodes Source # 
Instance details

Defined in RegAlloc.Nodes.Private

Methods

(==) :: Nodes -> Nodes -> Bool #

(/=) :: Nodes -> Nodes -> Bool #

Show Nodes Source # 
Instance details

Defined in RegAlloc.Nodes.Private

Methods

showsPrec :: Int -> Nodes -> ShowS #

show :: Nodes -> String #

showList :: [Nodes] -> ShowS #