Safe HaskellNone

LSC.NetGraph

Description

Pure morphisms on the netgraph model

Documentation

boundingBox :: Foldable f => f (Component' l Int) -> Component' l Int Source #

coarseBoundingBox :: Foldable f => f (Component' l Int) -> Component' l Int Source #

hpwl :: Net -> Int Source #

hpwlDelta :: Foldable f => NetGraph -> f Gate -> Int Source #

optimalRegion :: (Foldable f, Foldable g) => f (g Gate) -> Component' l Int Source #

hyperedges :: Foldable f => NetGraph -> f Gate -> [Net] Source #

hpwlMatrix :: Vector (Int, Int) -> Net -> Int Source #

coordsVector :: Matrix Gate -> Vector (Int, Int) Source #

flattenGateMatrix :: Matrix Gate -> Vector Gate Source #

sumOfHpwlMatrix :: Matrix Gate -> Int Source #

getSegments :: Vector Gate -> [Vector Gate] Source #

getRows :: Vector Gate -> [Vector Gate] Source #

getRow :: NetGraph -> Gate -> Maybe Row Source #

generateHyperedges :: Foldable f => f Gate -> HashMap Identifier Net Source #

region :: (Int -> Int) -> (Int -> Int) -> NetGraph -> NetGraph Source #

clock :: Getter Net Bool Source #

gateOverlap :: Gate -> Gate -> Bool Source #

flatten :: Foldable f => Getter a (f a) -> a -> [a] Source #