Hcy2c-0.1.1.0: Generate C code for cycle algorithms

Safe HaskellNone
LanguageHaskell2010

Cycles.Reap

Synopsis

Documentation

trimResult :: FilePath -> IO ()

This function trims a single result (removes all non-optimal values and saves the file)

justThat :: Maybe t -> t

collectBy :: (a -> Bool) -> [a] -> ([a], [a])

collectBy takes a checking function and a list and returns ([x | f x], [x | not f x])

onlyJustFst :: Maybe (a, b) -> a

collectMatchingGraphs :: FilePath -> [FilePath] -> ([FilePath], [FilePath])

This function takes a maxcy filename and a list of files and outputs (matching graphs, non-matching graphs) Note: This function throws out files that are part of an incomplete series. For example, if we input graphNum_..._0_2_out.txt but don't have graphNum_..._1_2_out.txt, the output will be of the form: ([], [leftovers])

groupMatchingGraphs :: [FilePath] -> [[FilePath]]

This will group results into a lists of matching results

allEq :: Eq a => [a] -> Bool

xyMap :: (a -> b) -> [a] -> [(a, b)]

"xyMap f list" is equivalent to "zip (map f list) list". Example: "xyMap (*2) [1,2,3] = [(1,2),(2,4),(3,6)]"

onlyJust :: Maybe (a, b) -> a

gList :: [(String, [[Int]])]