Safe Haskell | None |
---|
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 #
optimalRegion :: (Foldable f, Foldable g) => f (g Gate) -> Component' l Int Source #
adjacentByPin :: NetGraph -> Gate -> HashMap Identifier [Gate] 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 #
significantHpwl :: Comparison NetGraph Source #
getSegments :: Vector Gate -> [Vector Gate] Source #
inlineGeometry :: NetGraph -> NetGraph Source #
assignCellsToRows :: NetGraph -> NetGraph Source #
rebuildHyperedges :: NetGraph -> NetGraph Source #
generateHyperedges :: Foldable f => f Gate -> HashMap Identifier Net Source #
netGraphArea :: NetGraph -> Component' l Int Source #
outerRim :: NetGraph -> HashMap Identifier (Component' Layer Int) Source #
feedthroughGate :: Net -> Gate Source #
gateHeight :: Gate -> Int Source #
gateOverlap :: Gate -> Gate -> Bool Source #
treeStructure :: NetGraph -> NetGraph Source #