Safe Haskell	None

LSC.FastDP

Synopsis

wt1 :: Penalty
wt2 :: Penalty
sufficientBenefit :: Maybe Double
globalSwap :: NetGraph -> LSC NetGraph
verticalSwap :: NetGraph -> LSC NetGraph
swapRoutine :: Double -> Bool -> NetGraph -> ST s NetGraph
type Penalty = Int
type Benefit = Int
benefit :: NetGraph -> Gate -> Penalty -> Either Area Gate -> Benefit
findSwaps :: Bool -> Gate -> Area -> Layout -> [(Penalty, Either Area Gate)]
verticalSwapSegments :: Gate -> Layout -> [(Segment, Segment)]
globalSwapSegments :: Area -> Layout -> [(Segment, Segment)]
penaltyForSpace :: Gate -> Segment -> Area -> Penalty
penaltyForCell :: Segment -> Gate -> Segment -> Gate -> Penalty
localReordering :: NetGraph -> LSC NetGraph
localReorderSegment :: Int -> NetGraph -> Vector Gate -> ST s (Vector Gate)
singleSegmentClustering :: NetGraph -> LSC NetGraph
clusterSegment :: NetGraph -> Vector Gate -> ST s (Vector Gate)
type Cluster = [Gate]
type Order = Int -> Maybe Int
clusterIndex :: Order -> Cluster -> Int
centerCluster :: (Int, Cluster) -> Gate -> Gate
clusterOverlap :: (Int, Cluster) -> (Int, Cluster) -> Bool
generateBoundsList :: NetGraph -> Vector Gate -> Order -> Cluster -> [Int]

Documentation

wt1 :: Penalty Source #

wt1 and wt2 penalize overlaps resulting from swapping cells. wt1: Penalty on shifting the closest two cells to resolve overlaps wt2: Penalty on shifting cells other than the closest two cells

wt2 :: Penalty Source #

wt1 and wt2 penalize overlaps resulting from swapping cells. wt1: Penalty on shifting the closest two cells to resolve overlaps wt2: Penalty on shifting cells other than the closest two cells

sufficientBenefit :: Maybe Double Source #

Choose the first swap that yields some benefit or the best possible swap when sufficientBenefit or the former is Nothing

globalSwap :: NetGraph -> LSC NetGraph Source #

verticalSwap :: NetGraph -> LSC NetGraph Source #

swapRoutine :: Double -> Bool -> NetGraph -> ST s NetGraph Source #

type Penalty = Int Source #

type Benefit = Int Source #

benefit :: NetGraph -> Gate -> Penalty -> Either Area Gate -> Benefit Source #

findSwaps :: Bool -> Gate -> Area -> Layout -> [(Penalty, Either Area Gate)] Source #

verticalSwapSegments :: Gate -> Layout -> [(Segment, Segment)] Source #

globalSwapSegments :: Area -> Layout -> [(Segment, Segment)] Source #

penaltyForSpace :: Gate -> Segment -> Area -> Penalty Source #

penaltyForCell :: Segment -> Gate -> Segment -> Gate -> Penalty Source #

localReordering :: NetGraph -> LSC NetGraph Source #

localReorderSegment :: Int -> NetGraph -> Vector Gate -> ST s (Vector Gate) Source #

singleSegmentClustering :: NetGraph -> LSC NetGraph Source #

clusterSegment :: NetGraph -> Vector Gate -> ST s (Vector Gate) Source #

type Cluster = [Gate] Source #

type Order = Int -> Maybe Int Source #

clusterIndex :: Order -> Cluster -> Int Source #

centerCluster :: (Int, Cluster) -> Gate -> Gate Source #

clusterOverlap :: (Int, Cluster) -> (Int, Cluster) -> Bool Source #

generateBoundsList :: NetGraph -> Vector Gate -> Order -> Cluster -> [Int] Source #