    {-# LANGUAGE DeriveDataTypeable #-}
    {-# LANGUAGE DeriveGeneric #-}
    {-# LANGUAGE GeneralizedNewtypeDeriving #-}

    module Distribution.Types.Module
      ( Module (..)
      ) where

    import Distribution.Compat.Prelude
    import Prelude ()

    import qualified Distribution.Compat.CharParsing as P
    import Distribution.ModuleName
    import Distribution.Parsec
    import Distribution.Pretty
    import Distribution.Types.UnitId
    import qualified Text.PrettyPrint as Disp

    -- | A module identity uniquely identifies a Haskell module by
    -- qualifying a 'ModuleName' with the 'UnitId' which defined
    -- it.  This type distinguishes between two packages
    -- which provide a module with the same name, or a module
    -- from the same package compiled with different dependencies.
    -- There are a few cases where Cabal needs to know about
    -- module identities, e.g., when writing out reexported modules in
    -- the 'InstalledPackageInfo'.
    data Module
      = Module DefUnitId ModuleName
      deriving ((forall x. Module -> Rep Module x)
    -> (forall x. Rep Module x -> Module) -> Generic Module
    forall x. Rep Module x -> Module
    forall x. Module -> Rep Module x
    forall a.
    (forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
    $cfrom :: forall x. Module -> Rep Module x
    from :: forall x. Module -> Rep Module x
    $cto :: forall x. Rep Module x -> Module
    to :: forall x. Rep Module x -> Module
    Generic, ReadPrec [Module]
    ReadPrec Module
    Int -> ReadS Module
    ReadS [Module]
    (Int -> ReadS Module)
    -> ReadS [Module]
    -> ReadPrec Module
    -> ReadPrec [Module]
    -> Read Module
    forall a.
    (Int -> ReadS a)
    -> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
    $creadsPrec :: Int -> ReadS Module
    readsPrec :: Int -> ReadS Module
    $creadList :: ReadS [Module]
    readList :: ReadS [Module]
    $creadPrec :: ReadPrec Module
    readPrec :: ReadPrec Module
    $creadListPrec :: ReadPrec [Module]
    readListPrec :: ReadPrec [Module]
    Read, Int -> Module -> ShowS
    [Module] -> ShowS
    Module -> String
    (Int -> Module -> ShowS)
    -> (Module -> String) -> ([Module] -> ShowS) -> Show Module
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    $cshowsPrec :: Int -> Module -> ShowS
    showsPrec :: Int -> Module -> ShowS
    $cshow :: Module -> String
    show :: Module -> String
    $cshowList :: [Module] -> ShowS
    showList :: [Module] -> ShowS
    Show, Module -> Module -> Bool
    (Module -> Module -> Bool)
    -> (Module -> Module -> Bool) -> Eq Module
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: Module -> Module -> Bool
    == :: Module -> Module -> Bool
    $c/= :: Module -> Module -> Bool
    /= :: Module -> Module -> Bool
    Eq, Eq Module
    Eq Module =>
    (Module -> Module -> Ordering)
    -> (Module -> Module -> Bool)
    -> (Module -> Module -> Bool)
    -> (Module -> Module -> Bool)
    -> (Module -> Module -> Bool)
    -> (Module -> Module -> Module)
    -> (Module -> Module -> Module)
    -> Ord Module
    Module -> Module -> Bool
    Module -> Module -> Ordering
    Module -> Module -> Module
    forall a.
    Eq a =>
    (a -> a -> Ordering)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> a)
    -> (a -> a -> a)
    -> Ord a
    $ccompare :: Module -> Module -> Ordering
    compare :: Module -> Module -> Ordering
    $c< :: Module -> Module -> Bool
    < :: Module -> Module -> Bool
    $c<= :: Module -> Module -> Bool
    <= :: Module -> Module -> Bool
    $c> :: Module -> Module -> Bool
    > :: Module -> Module -> Bool
    $c>= :: Module -> Module -> Bool
    >= :: Module -> Module -> Bool
    $cmax :: Module -> Module -> Module
    max :: Module -> Module -> Module
    $cmin :: Module -> Module -> Module
    min :: Module -> Module -> Module
    Ord, Typeable, Typeable Module
    Typeable Module =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> Module -> c Module)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c Module)
    -> (Module -> Constr)
    -> (Module -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c Module))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Module))
    -> ((forall b. Data b => b -> b) -> Module -> Module)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> Module -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> Module -> r)
    -> (forall u. (forall d. Data d => d -> u) -> Module -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> Module -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> Module -> m Module)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> Module -> m Module)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> Module -> m Module)
    -> Data Module
    Module -> Constr
    Module -> DataType
    (forall b. Data b => b -> b) -> Module -> Module
    forall a.
    Typeable a =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> a -> c a)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c a)
    -> (a -> Constr)
    -> (a -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c a))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
    -> ((forall b. Data b => b -> b) -> a -> a)
    -> (forall r r'.
        (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall r r'.
        (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall u. (forall d. Data d => d -> u) -> a -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> Data a
    forall u. Int -> (forall d. Data d => d -> u) -> Module -> u
    forall u. (forall d. Data d => d -> u) -> Module -> [u]
    forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Module
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Module -> c Module
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Module)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Module)
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Module -> c Module
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Module -> c Module
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Module
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Module
    $ctoConstr :: Module -> Constr
    toConstr :: Module -> Constr
    $cdataTypeOf :: Module -> DataType
    dataTypeOf :: Module -> DataType
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Module)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Module)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Module)
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Module)
    $cgmapT :: (forall b. Data b => b -> b) -> Module -> Module
    gmapT :: (forall b. Data b => b -> b) -> Module -> Module
    $cgmapQl :: forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    gmapQl :: forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    gmapQr :: forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r
    $cgmapQ :: forall u. (forall d. Data d => d -> u) -> Module -> [u]
    gmapQ :: forall u. (forall d. Data d => d -> u) -> Module -> [u]
    $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Module -> u
    gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Module -> u
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Module -> m Module
    Data)

    instance Binary Module
    instance Structured Module

    instance Pretty Module where
      pretty :: Module -> Doc
    pretty (Module DefUnitId
    uid ModuleName
    mod_name) =
        DefUnitId -> Doc
    forall a. Pretty a => a -> Doc
    pretty DefUnitId
    uid Doc -> Doc -> Doc
    <<>> String -> Doc
    Disp.text String
    ":" Doc -> Doc -> Doc
    <<>> ModuleName -> Doc
    forall a. Pretty a => a -> Doc
    pretty ModuleName
    mod_name

    instance Parsec Module where
      parsec :: forall (m :: * -> *). CabalParsing m => m Module
    parsec = do
        uid <- m DefUnitId
    forall a (m :: * -> *). (Parsec a, CabalParsing m) => m a
    forall (m :: * -> *). CabalParsing m => m DefUnitId
    parsec
        _ <- P.char ':'
        mod_name <- parsec
        return (Module uid mod_name)

    instance NFData Module where
      rnf :: Module -> ()
    rnf (Module DefUnitId
    uid ModuleName
    mod_name) = DefUnitId -> ()
    forall a. NFData a => a -> ()
    rnf DefUnitId
    uid () -> () -> ()
    forall a b. a -> b -> b
    `seq` ModuleName -> ()
    forall a. NFData a => a -> ()
    rnf ModuleName
    mod_name