Safe Haskell	None

LSC.Legalize

Synopsis

legalizeRows :: NetGraph -> LSC NetGraph
rowLegalization :: NetGraph -> Vector Gate -> ST s (Vector Gate)
topologicalShortestPath :: (Edge -> Int) -> Graph -> Int -> ST s [Int]
sortVectorOn :: Ord b => (a -> b) -> Vector a -> ST s (Vector a)
juggleCells :: NetGraph -> LSC NetGraph
rowJuggling :: Double -> NetGraph -> ST s NetGraph
debugRowCapacities :: NetGraph -> LSC ()

Documentation

legalizeRows :: NetGraph -> LSC NetGraph Source #

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

topologicalShortestPath :: (Edge -> Int) -> Graph -> Int -> ST s [Int] Source #

This is here to facilitate the writing of reference implementations

sortVectorOn :: Ord b => (a -> b) -> Vector a -> ST s (Vector a) Source #

juggleCells :: NetGraph -> LSC NetGraph Source #

rowJuggling :: Double -> NetGraph -> ST s NetGraph Source #

debugRowCapacities :: NetGraph -> LSC () Source #