    {-# LANGUAGE DeriveDataTypeable #-}
    {-# LANGUAGE DeriveGeneric #-}
    module Distribution.SPDX.License (
        License (..),
        ) where

    import Prelude ()
    import Distribution.Compat.Prelude

    import Distribution.Pretty
    import Distribution.Parsec
    import Distribution.SPDX.LicenseExpression

    import qualified Distribution.Compat.CharParsing as P
    import qualified Text.PrettyPrint as Disp

    -- | Declared license.
    -- See [section 3.15 of SPDX Specification 2.1](https://spdx.org/spdx-specification-21-web-version#h.1hmsyys)
    --
    -- /Note:/ the NOASSERTION case is omitted.
    --
    -- Old 'License' can be migrated using following rules:
    --
    -- * @AllRightsReserved@ and @UnspecifiedLicense@ to 'NONE'.
    --   No license specified which legally defaults to /All Rights Reserved/.
    --   The package may not be legally modified or redistributed by anyone but
    --   the rightsholder.
    --
    -- * @OtherLicense@ can be converted to 'LicenseRef' pointing to the file
    --   in the package.
    --
    -- * @UnknownLicense@ i.e. other licenses of the form @name-x.y@, should be
    --   covered by SPDX license list, otherwise use 'LicenseRef'.
    --
    -- * @PublicDomain@ isn't covered. Consider using CC0.
    --   See <https://wiki.spdx.org/view/Legal_Team/Decisions/Dealing_with_Public_Domain_within_SPDX_Files>
    --   for more information.
    --
    data License
        = NONE
          -- ^ if the package contains no license information whatsoever; or
        | License LicenseExpression
          -- ^ A valid SPDX License Expression as defined in Appendix IV.
      deriving (Int -> License -> ShowS
    [License] -> ShowS
    License -> String
    (Int -> License -> ShowS)
    -> (License -> String) -> ([License] -> ShowS) -> Show License
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    showList :: [License] -> ShowS
    $cshowList :: [License] -> ShowS
    show :: License -> String
    $cshow :: License -> String
    showsPrec :: Int -> License -> ShowS
    $cshowsPrec :: Int -> License -> ShowS
    Show, ReadPrec [License]
    ReadPrec License
    Int -> ReadS License
    ReadS [License]
    (Int -> ReadS License)
    -> ReadS [License]
    -> ReadPrec License
    -> ReadPrec [License]
    -> Read License
    forall a.
    (Int -> ReadS a)
    -> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
    readListPrec :: ReadPrec [License]
    $creadListPrec :: ReadPrec [License]
    readPrec :: ReadPrec License
    $creadPrec :: ReadPrec License
    readList :: ReadS [License]
    $creadList :: ReadS [License]
    readsPrec :: Int -> ReadS License
    $creadsPrec :: Int -> ReadS License
    Read, License -> License -> Bool
    (License -> License -> Bool)
    -> (License -> License -> Bool) -> Eq License
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    /= :: License -> License -> Bool
    $c/= :: License -> License -> Bool
    == :: License -> License -> Bool
    $c== :: License -> License -> Bool
    Eq, Eq License
    Eq License
    -> (License -> License -> Ordering)
    -> (License -> License -> Bool)
    -> (License -> License -> Bool)
    -> (License -> License -> Bool)
    -> (License -> License -> Bool)
    -> (License -> License -> License)
    -> (License -> License -> License)
    -> Ord License
    License -> License -> Bool
    License -> License -> Ordering
    License -> License -> License
    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
    min :: License -> License -> License
    $cmin :: License -> License -> License
    max :: License -> License -> License
    $cmax :: License -> License -> License
    >= :: License -> License -> Bool
    $c>= :: License -> License -> Bool
    > :: License -> License -> Bool
    $c> :: License -> License -> Bool
    <= :: License -> License -> Bool
    $c<= :: License -> License -> Bool
    < :: License -> License -> Bool
    $c< :: License -> License -> Bool
    compare :: License -> License -> Ordering
    $ccompare :: License -> License -> Ordering
    Ord, Typeable, Typeable License
    Typeable License
    -> (forall (c :: * -> *).
        (forall d b. Data d => c (d -> b) -> d -> c b)
        -> (forall g. g -> c g) -> License -> c License)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c License)
    -> (License -> Constr)
    -> (License -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c License))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c License))
    -> ((forall b. Data b => b -> b) -> License -> License)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> License -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> License -> r)
    -> (forall u. (forall d. Data d => d -> u) -> License -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> License -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> License -> m License)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> License -> m License)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> License -> m License)
    -> Data License
    License -> DataType
    License -> Constr
    (forall b. Data b => b -> b) -> License -> License
    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) -> License -> u
    forall u. (forall d. Data d => d -> u) -> License -> [u]
    forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> License -> m License
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> License -> m License
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c License
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> License -> c License
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c License)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c License)
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> License -> m License
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> License -> m License
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> License -> m License
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> License -> m License
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> License -> m License
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> License -> m License
    gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> License -> u
    $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> License -> u
    gmapQ :: forall u. (forall d. Data d => d -> u) -> License -> [u]
    $cgmapQ :: forall u. (forall d. Data d => d -> u) -> License -> [u]
    gmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    gmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    $cgmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> License -> r
    gmapT :: (forall b. Data b => b -> b) -> License -> License
    $cgmapT :: (forall b. Data b => b -> b) -> License -> License
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c License)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c License)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c License)
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c License)
    dataTypeOf :: License -> DataType
    $cdataTypeOf :: License -> DataType
    toConstr :: License -> Constr
    $ctoConstr :: License -> Constr
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c License
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c License
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> License -> c License
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> License -> c License
    Data, (forall x. License -> Rep License x)
    -> (forall x. Rep License x -> License) -> Generic License
    forall x. Rep License x -> License
    forall x. License -> Rep License x
    forall a.
    (forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
    $cto :: forall x. Rep License x -> License
    $cfrom :: forall x. License -> Rep License x
    Generic)

    instance Binary License
    instance Structured License

    instance NFData License where
        rnf :: License -> ()
    rnf License
    NONE        = ()
        rnf (License LicenseExpression
    l) = LicenseExpression -> ()
    forall a. NFData a => a -> ()
    rnf LicenseExpression
    l

    instance Pretty License where
        pretty :: License -> Doc
    pretty License
    NONE        = String -> Doc
    Disp.text String
    "NONE"
        pretty (License LicenseExpression
    l) = LicenseExpression -> Doc
    forall a. Pretty a => a -> Doc
    pretty LicenseExpression
    l

    -- |
    -- >>> eitherParsec "BSD-3-Clause AND MIT" :: Either String License
    -- Right (License (EAnd (ELicense (ELicenseId BSD_3_Clause) Nothing) (ELicense (ELicenseId MIT) Nothing)))
    --
    -- >>> eitherParsec "NONE" :: Either String License
    -- Right NONE
    --
    instance Parsec License where
        parsec :: forall (m :: * -> *). CabalParsing m => m License
    parsec = License
    NONE License -> m String -> m License
    forall (f :: * -> *) a b. Functor f => a -> f b -> f a
    <$ m String -> m String
    forall (m :: * -> *) a. Parsing m => m a -> m a
    P.try (String -> m String
    forall (m :: * -> *). CharParsing m => String -> m String
    P.string String
    "NONE") m License -> m License -> m License
    forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
    <|> LicenseExpression -> License
    License (LicenseExpression -> License) -> m LicenseExpression -> m License
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> m LicenseExpression
    forall a (m :: * -> *). (Parsec a, CabalParsing m) => m a
    parsec