fortran-src-0.4.0: Parser and anlyses for Fortran standards 66, 77, 90 and 95.

Safe HaskellNone
LanguageHaskell2010

Language.Fortran.Analysis.ModGraph

Description

Generate a module use-graph.

Documentation

data ModGraph Source #

Instances
Eq ModGraph Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph

Data ModGraph Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModGraph -> c ModGraph #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModGraph #

toConstr :: ModGraph -> Constr #

dataTypeOf :: ModGraph -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModGraph) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModGraph) #

gmapT :: (forall b. Data b => b -> b) -> ModGraph -> ModGraph #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModGraph -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModGraph -> r #

gmapQ :: (forall d. Data d => d -> u) -> ModGraph -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModGraph -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModGraph -> m ModGraph #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModGraph -> m ModGraph #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModGraph -> m ModGraph #

data ModOrigin Source #

Instances
Eq ModOrigin Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph

Data ModOrigin Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModOrigin -> c ModOrigin #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModOrigin #

toConstr :: ModOrigin -> Constr #

dataTypeOf :: ModOrigin -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModOrigin) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModOrigin) #

gmapT :: (forall b. Data b => b -> b) -> ModOrigin -> ModOrigin #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModOrigin -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModOrigin -> r #

gmapQ :: (forall d. Data d => d -> u) -> ModOrigin -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModOrigin -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModOrigin -> m ModOrigin #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModOrigin -> m ModOrigin #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModOrigin -> m ModOrigin #

Ord ModOrigin Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph

Show ModOrigin Source # 
Instance details

Defined in Language.Fortran.Analysis.ModGraph