camfort-0.802: CamFort - Cambridge Fortran infrastructure

Safe HaskellNone
LanguageHaskell98

Camfort.Transformation.DerivedTypeIntro

Documentation

type Graph v a = [((v, v), a)] Source #

type WeightedEdge v a = ((v, v), (a, Int)) Source #

vertices :: [((b, b), t)] -> [b] Source #

isVertex :: Eq a => a -> [((a, a), t)] -> Bool Source #

getVertex :: Eq t => t -> [((t, t), a)] -> Maybe a Source #

listToSymmRelation :: [a] -> [(a, a)] Source #

correctManualImpl :: (Data t, Eq p) => [(Variable, (Integer, Integer))] -> t -> [((AccessP p, AccessP p), Variable)] -> Bool Source #

swap :: ((t2, t1), t) -> ((t1, t2), t) Source #

findMatch :: t -> t1 -> [(t2, t3)] -> [((b, b), t4)] -> [b] Source #

decomposeWeightedGraph :: forall v a. (Show v, Ord v, Ord a) => WeightedGraph v a -> [WeightedGraph v a] Source #

binEdge :: (Show v, Ord v, Ord a) => [(Set v, WeightedGraph v a)] -> WeightedEdge v a -> [(Set v, WeightedGraph v a)] Source #