{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE CPP #-}
module Language.Haskell.Exts.Extension (
Language(..),
knownLanguages,
classifyLanguage,
prettyLanguage,
Extension(..), KnownExtension(..),
classifyExtension,
parseExtension, prettyExtension,
ghcDefault, glasgowExts,
knownExtensions, deprecatedExtensions,
impliesExts, toExtensionList
) where
#if __GLASGOW_HASKELL__ < 710
import Control.Applicative ((<$>), (<|>))
#else
import Control.Applicative ((<|>))
#endif
import Data.Array (Array, accumArray, bounds, Ix(inRange), (!))
import Data.List (nub)
import Data.Maybe (fromMaybe)
import Data.Data
data Language =
Haskell98
| Haskell2010
| HaskellAllDisabled
| UnknownLanguage String
deriving (Int -> Language -> ShowS
[Language] -> ShowS
Language -> String
(Int -> Language -> ShowS)
-> (Language -> String) -> ([Language] -> ShowS) -> Show Language
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Language] -> ShowS
$cshowList :: [Language] -> ShowS
show :: Language -> String
$cshow :: Language -> String
showsPrec :: Int -> Language -> ShowS
$cshowsPrec :: Int -> Language -> ShowS
Show, ReadPrec [Language]
ReadPrec Language
Int -> ReadS Language
ReadS [Language]
(Int -> ReadS Language)
-> ReadS [Language]
-> ReadPrec Language
-> ReadPrec [Language]
-> Read Language
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Language]
$creadListPrec :: ReadPrec [Language]
readPrec :: ReadPrec Language
$creadPrec :: ReadPrec Language
readList :: ReadS [Language]
$creadList :: ReadS [Language]
readsPrec :: Int -> ReadS Language
$creadsPrec :: Int -> ReadS Language
Read, Language -> Language -> Bool
(Language -> Language -> Bool)
-> (Language -> Language -> Bool) -> Eq Language
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Language -> Language -> Bool
$c/= :: Language -> Language -> Bool
== :: Language -> Language -> Bool
$c== :: Language -> Language -> Bool
Eq, Eq Language
Eq Language
-> (Language -> Language -> Ordering)
-> (Language -> Language -> Bool)
-> (Language -> Language -> Bool)
-> (Language -> Language -> Bool)
-> (Language -> Language -> Bool)
-> (Language -> Language -> Language)
-> (Language -> Language -> Language)
-> Ord Language
Language -> Language -> Bool
Language -> Language -> Ordering
Language -> Language -> Language
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 :: Language -> Language -> Language
$cmin :: Language -> Language -> Language
max :: Language -> Language -> Language
$cmax :: Language -> Language -> Language
>= :: Language -> Language -> Bool
$c>= :: Language -> Language -> Bool
> :: Language -> Language -> Bool
$c> :: Language -> Language -> Bool
<= :: Language -> Language -> Bool
$c<= :: Language -> Language -> Bool
< :: Language -> Language -> Bool
$c< :: Language -> Language -> Bool
compare :: Language -> Language -> Ordering
$ccompare :: Language -> Language -> Ordering
$cp1Ord :: Eq Language
Ord, Typeable Language
DataType
Constr
Typeable Language
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Language -> c Language)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Language)
-> (Language -> Constr)
-> (Language -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Language))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Language))
-> ((forall b. Data b => b -> b) -> Language -> Language)
-> (forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r)
-> (forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r)
-> (forall u. (forall d. Data d => d -> u) -> Language -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Language -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Language -> m Language)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Language -> m Language)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Language -> m Language)
-> Data Language
Language -> DataType
Language -> Constr
(forall b. Data b => b -> b) -> Language -> Language
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Language -> c Language
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Language
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) -> Language -> u
forall u. (forall d. Data d => d -> u) -> Language -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Language -> m Language
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Language -> m Language
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Language
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Language -> c Language
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Language)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Language)
$cUnknownLanguage :: Constr
$cHaskellAllDisabled :: Constr
$cHaskell2010 :: Constr
$cHaskell98 :: Constr
$tLanguage :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Language -> m Language
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Language -> m Language
gmapMp :: (forall d. Data d => d -> m d) -> Language -> m Language
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Language -> m Language
gmapM :: (forall d. Data d => d -> m d) -> Language -> m Language
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Language -> m Language
gmapQi :: Int -> (forall d. Data d => d -> u) -> Language -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Language -> u
gmapQ :: (forall d. Data d => d -> u) -> Language -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Language -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Language -> r
gmapT :: (forall b. Data b => b -> b) -> Language -> Language
$cgmapT :: (forall b. Data b => b -> b) -> Language -> Language
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Language)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Language)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Language)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Language)
dataTypeOf :: Language -> DataType
$cdataTypeOf :: Language -> DataType
toConstr :: Language -> Constr
$ctoConstr :: Language -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Language
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Language
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Language -> c Language
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Language -> c Language
$cp1Data :: Typeable Language
Data, Typeable)
knownLanguages :: [Language]
knownLanguages :: [Language]
knownLanguages = [Language
Haskell98, Language
Haskell2010]
classifyLanguage :: String -> Language
classifyLanguage :: String -> Language
classifyLanguage String
str = Language -> Maybe Language -> Language
forall a. a -> Maybe a -> a
fromMaybe (String -> Language
UnknownLanguage String
str) (Maybe Language -> Language) -> Maybe Language -> Language
forall a b. (a -> b) -> a -> b
$ String -> [(String, Language)] -> Maybe Language
forall a b. Eq a => a -> [(a, b)] -> Maybe b
lookup String
str [(String, Language)]
langTable
where
langTable :: [(String, Language)]
langTable = [ (Language -> String
forall a. Show a => a -> String
show Language
lang, Language
lang)
| Language
lang <- [Language]
knownLanguages ]
prettyLanguage :: Language -> String
prettyLanguage :: Language -> String
prettyLanguage (UnknownLanguage String
name) = String
name
prettyLanguage Language
lang = Language -> String
forall a. Show a => a -> String
show Language
lang
data Extension =
EnableExtension KnownExtension
| DisableExtension KnownExtension
| UnknownExtension String
deriving (Int -> Extension -> ShowS
[Extension] -> ShowS
Extension -> String
(Int -> Extension -> ShowS)
-> (Extension -> String)
-> ([Extension] -> ShowS)
-> Show Extension
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Extension] -> ShowS
$cshowList :: [Extension] -> ShowS
show :: Extension -> String
$cshow :: Extension -> String
showsPrec :: Int -> Extension -> ShowS
$cshowsPrec :: Int -> Extension -> ShowS
Show, ReadPrec [Extension]
ReadPrec Extension
Int -> ReadS Extension
ReadS [Extension]
(Int -> ReadS Extension)
-> ReadS [Extension]
-> ReadPrec Extension
-> ReadPrec [Extension]
-> Read Extension
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Extension]
$creadListPrec :: ReadPrec [Extension]
readPrec :: ReadPrec Extension
$creadPrec :: ReadPrec Extension
readList :: ReadS [Extension]
$creadList :: ReadS [Extension]
readsPrec :: Int -> ReadS Extension
$creadsPrec :: Int -> ReadS Extension
Read, Extension -> Extension -> Bool
(Extension -> Extension -> Bool)
-> (Extension -> Extension -> Bool) -> Eq Extension
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Extension -> Extension -> Bool
$c/= :: Extension -> Extension -> Bool
== :: Extension -> Extension -> Bool
$c== :: Extension -> Extension -> Bool
Eq, Eq Extension
Eq Extension
-> (Extension -> Extension -> Ordering)
-> (Extension -> Extension -> Bool)
-> (Extension -> Extension -> Bool)
-> (Extension -> Extension -> Bool)
-> (Extension -> Extension -> Bool)
-> (Extension -> Extension -> Extension)
-> (Extension -> Extension -> Extension)
-> Ord Extension
Extension -> Extension -> Bool
Extension -> Extension -> Ordering
Extension -> Extension -> Extension
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 :: Extension -> Extension -> Extension
$cmin :: Extension -> Extension -> Extension
max :: Extension -> Extension -> Extension
$cmax :: Extension -> Extension -> Extension
>= :: Extension -> Extension -> Bool
$c>= :: Extension -> Extension -> Bool
> :: Extension -> Extension -> Bool
$c> :: Extension -> Extension -> Bool
<= :: Extension -> Extension -> Bool
$c<= :: Extension -> Extension -> Bool
< :: Extension -> Extension -> Bool
$c< :: Extension -> Extension -> Bool
compare :: Extension -> Extension -> Ordering
$ccompare :: Extension -> Extension -> Ordering
$cp1Ord :: Eq Extension
Ord)
data KnownExtension =
OverlappingInstances
| UndecidableInstances
| IncoherentInstances
| InstanceSigs
| DoRec
| RecursiveDo
| ParallelListComp
| MultiParamTypeClasses
| MonomorphismRestriction
| FunctionalDependencies
| Rank2Types
| RankNTypes
| PolymorphicComponents
| ExistentialQuantification
| ScopedTypeVariables
| PatternSignatures
| ImplicitParams
| FlexibleContexts
| FlexibleInstances
| EmptyDataDecls
| CPP
| KindSignatures
| BangPatterns
| TypeSynonymInstances
| TemplateHaskell
| ForeignFunctionInterface
| Arrows
| Generics
| ImplicitPrelude
| NamedFieldPuns
| PatternGuards
| GeneralizedNewtypeDeriving
| DeriveAnyClass
| ExtensibleRecords
| RestrictedTypeSynonyms
| HereDocuments
| MagicHash
| BinaryLiterals
| TypeFamilies
| StandaloneDeriving
| UnicodeSyntax
| UnliftedFFITypes
| LiberalTypeSynonyms
| TypeOperators
| ParallelArrays
| RecordWildCards
| RecordPuns
| DisambiguateRecordFields
| OverloadedStrings
| GADTs
| MonoPatBinds
| RelaxedPolyRec
| ExtendedDefaultRules
| UnboxedTuples
| DeriveDataTypeable
| ConstrainedClassMethods
| PackageImports
| LambdaCase
| EmptyCase
| ImpredicativeTypes
| NewQualifiedOperators
| PostfixOperators
| QuasiQuotes
| TransformListComp
| ViewPatterns
| XmlSyntax
| RegularPatterns
| TupleSections
| GHCForeignImportPrim
| NPlusKPatterns
| DoAndIfThenElse
| RebindableSyntax
| ExplicitForAll
| DatatypeContexts
| MonoLocalBinds
| DeriveFunctor
| DeriveGeneric
| DeriveTraversable
| DeriveFoldable
| NondecreasingIndentation
| InterruptibleFFI
| CApiFFI
| JavaScriptFFI
| ExplicitNamespaces
| DataKinds
| PolyKinds
| MultiWayIf
| SafeImports
| Safe
| Trustworthy
| DefaultSignatures
| ConstraintKinds
| RoleAnnotations
| PatternSynonyms
| PartialTypeSignatures
| NamedWildCards
| TypeApplications
| TypeFamilyDependencies
| OverloadedLabels
| DerivingStrategies
| UnboxedSums
| TypeInType
| Strict
| StrictData
| DerivingVia
| QuantifiedConstraints
| BlockArguments
deriving (Int -> KnownExtension -> ShowS
[KnownExtension] -> ShowS
KnownExtension -> String
(Int -> KnownExtension -> ShowS)
-> (KnownExtension -> String)
-> ([KnownExtension] -> ShowS)
-> Show KnownExtension
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [KnownExtension] -> ShowS
$cshowList :: [KnownExtension] -> ShowS
show :: KnownExtension -> String
$cshow :: KnownExtension -> String
showsPrec :: Int -> KnownExtension -> ShowS
$cshowsPrec :: Int -> KnownExtension -> ShowS
Show, ReadPrec [KnownExtension]
ReadPrec KnownExtension
Int -> ReadS KnownExtension
ReadS [KnownExtension]
(Int -> ReadS KnownExtension)
-> ReadS [KnownExtension]
-> ReadPrec KnownExtension
-> ReadPrec [KnownExtension]
-> Read KnownExtension
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [KnownExtension]
$creadListPrec :: ReadPrec [KnownExtension]
readPrec :: ReadPrec KnownExtension
$creadPrec :: ReadPrec KnownExtension
readList :: ReadS [KnownExtension]
$creadList :: ReadS [KnownExtension]
readsPrec :: Int -> ReadS KnownExtension
$creadsPrec :: Int -> ReadS KnownExtension
Read, KnownExtension -> KnownExtension -> Bool
(KnownExtension -> KnownExtension -> Bool)
-> (KnownExtension -> KnownExtension -> Bool) -> Eq KnownExtension
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: KnownExtension -> KnownExtension -> Bool
$c/= :: KnownExtension -> KnownExtension -> Bool
== :: KnownExtension -> KnownExtension -> Bool
$c== :: KnownExtension -> KnownExtension -> Bool
Eq, Eq KnownExtension
Eq KnownExtension
-> (KnownExtension -> KnownExtension -> Ordering)
-> (KnownExtension -> KnownExtension -> Bool)
-> (KnownExtension -> KnownExtension -> Bool)
-> (KnownExtension -> KnownExtension -> Bool)
-> (KnownExtension -> KnownExtension -> Bool)
-> (KnownExtension -> KnownExtension -> KnownExtension)
-> (KnownExtension -> KnownExtension -> KnownExtension)
-> Ord KnownExtension
KnownExtension -> KnownExtension -> Bool
KnownExtension -> KnownExtension -> Ordering
KnownExtension -> KnownExtension -> KnownExtension
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 :: KnownExtension -> KnownExtension -> KnownExtension
$cmin :: KnownExtension -> KnownExtension -> KnownExtension
max :: KnownExtension -> KnownExtension -> KnownExtension
$cmax :: KnownExtension -> KnownExtension -> KnownExtension
>= :: KnownExtension -> KnownExtension -> Bool
$c>= :: KnownExtension -> KnownExtension -> Bool
> :: KnownExtension -> KnownExtension -> Bool
$c> :: KnownExtension -> KnownExtension -> Bool
<= :: KnownExtension -> KnownExtension -> Bool
$c<= :: KnownExtension -> KnownExtension -> Bool
< :: KnownExtension -> KnownExtension -> Bool
$c< :: KnownExtension -> KnownExtension -> Bool
compare :: KnownExtension -> KnownExtension -> Ordering
$ccompare :: KnownExtension -> KnownExtension -> Ordering
$cp1Ord :: Eq KnownExtension
Ord, Int -> KnownExtension
KnownExtension -> Int
KnownExtension -> [KnownExtension]
KnownExtension -> KnownExtension
KnownExtension -> KnownExtension -> [KnownExtension]
KnownExtension
-> KnownExtension -> KnownExtension -> [KnownExtension]
(KnownExtension -> KnownExtension)
-> (KnownExtension -> KnownExtension)
-> (Int -> KnownExtension)
-> (KnownExtension -> Int)
-> (KnownExtension -> [KnownExtension])
-> (KnownExtension -> KnownExtension -> [KnownExtension])
-> (KnownExtension -> KnownExtension -> [KnownExtension])
-> (KnownExtension
-> KnownExtension -> KnownExtension -> [KnownExtension])
-> Enum KnownExtension
forall a.
(a -> a)
-> (a -> a)
-> (Int -> a)
-> (a -> Int)
-> (a -> [a])
-> (a -> a -> [a])
-> (a -> a -> [a])
-> (a -> a -> a -> [a])
-> Enum a
enumFromThenTo :: KnownExtension
-> KnownExtension -> KnownExtension -> [KnownExtension]
$cenumFromThenTo :: KnownExtension
-> KnownExtension -> KnownExtension -> [KnownExtension]
enumFromTo :: KnownExtension -> KnownExtension -> [KnownExtension]
$cenumFromTo :: KnownExtension -> KnownExtension -> [KnownExtension]
enumFromThen :: KnownExtension -> KnownExtension -> [KnownExtension]
$cenumFromThen :: KnownExtension -> KnownExtension -> [KnownExtension]
enumFrom :: KnownExtension -> [KnownExtension]
$cenumFrom :: KnownExtension -> [KnownExtension]
fromEnum :: KnownExtension -> Int
$cfromEnum :: KnownExtension -> Int
toEnum :: Int -> KnownExtension
$ctoEnum :: Int -> KnownExtension
pred :: KnownExtension -> KnownExtension
$cpred :: KnownExtension -> KnownExtension
succ :: KnownExtension -> KnownExtension
$csucc :: KnownExtension -> KnownExtension
Enum, KnownExtension
KnownExtension -> KnownExtension -> Bounded KnownExtension
forall a. a -> a -> Bounded a
maxBound :: KnownExtension
$cmaxBound :: KnownExtension
minBound :: KnownExtension
$cminBound :: KnownExtension
Bounded, Typeable KnownExtension
DataType
Constr
Typeable KnownExtension
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> KnownExtension -> c KnownExtension)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c KnownExtension)
-> (KnownExtension -> Constr)
-> (KnownExtension -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c KnownExtension))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c KnownExtension))
-> ((forall b. Data b => b -> b)
-> KnownExtension -> KnownExtension)
-> (forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r)
-> (forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r)
-> (forall u.
(forall d. Data d => d -> u) -> KnownExtension -> [u])
-> (forall u.
Int -> (forall d. Data d => d -> u) -> KnownExtension -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension)
-> Data KnownExtension
KnownExtension -> DataType
KnownExtension -> Constr
(forall b. Data b => b -> b) -> KnownExtension -> KnownExtension
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> KnownExtension -> c KnownExtension
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c KnownExtension
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) -> KnownExtension -> u
forall u. (forall d. Data d => d -> u) -> KnownExtension -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c KnownExtension
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> KnownExtension -> c KnownExtension
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c KnownExtension)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c KnownExtension)
$cBlockArguments :: Constr
$cQuantifiedConstraints :: Constr
$cDerivingVia :: Constr
$cStrictData :: Constr
$cStrict :: Constr
$cTypeInType :: Constr
$cUnboxedSums :: Constr
$cDerivingStrategies :: Constr
$cOverloadedLabels :: Constr
$cTypeFamilyDependencies :: Constr
$cTypeApplications :: Constr
$cNamedWildCards :: Constr
$cPartialTypeSignatures :: Constr
$cPatternSynonyms :: Constr
$cRoleAnnotations :: Constr
$cConstraintKinds :: Constr
$cDefaultSignatures :: Constr
$cTrustworthy :: Constr
$cSafe :: Constr
$cSafeImports :: Constr
$cMultiWayIf :: Constr
$cPolyKinds :: Constr
$cDataKinds :: Constr
$cExplicitNamespaces :: Constr
$cJavaScriptFFI :: Constr
$cCApiFFI :: Constr
$cInterruptibleFFI :: Constr
$cNondecreasingIndentation :: Constr
$cDeriveFoldable :: Constr
$cDeriveTraversable :: Constr
$cDeriveGeneric :: Constr
$cDeriveFunctor :: Constr
$cMonoLocalBinds :: Constr
$cDatatypeContexts :: Constr
$cExplicitForAll :: Constr
$cRebindableSyntax :: Constr
$cDoAndIfThenElse :: Constr
$cNPlusKPatterns :: Constr
$cGHCForeignImportPrim :: Constr
$cTupleSections :: Constr
$cRegularPatterns :: Constr
$cXmlSyntax :: Constr
$cViewPatterns :: Constr
$cTransformListComp :: Constr
$cQuasiQuotes :: Constr
$cPostfixOperators :: Constr
$cNewQualifiedOperators :: Constr
$cImpredicativeTypes :: Constr
$cEmptyCase :: Constr
$cLambdaCase :: Constr
$cPackageImports :: Constr
$cConstrainedClassMethods :: Constr
$cDeriveDataTypeable :: Constr
$cUnboxedTuples :: Constr
$cExtendedDefaultRules :: Constr
$cRelaxedPolyRec :: Constr
$cMonoPatBinds :: Constr
$cGADTs :: Constr
$cOverloadedStrings :: Constr
$cDisambiguateRecordFields :: Constr
$cRecordPuns :: Constr
$cRecordWildCards :: Constr
$cParallelArrays :: Constr
$cTypeOperators :: Constr
$cLiberalTypeSynonyms :: Constr
$cUnliftedFFITypes :: Constr
$cUnicodeSyntax :: Constr
$cStandaloneDeriving :: Constr
$cTypeFamilies :: Constr
$cBinaryLiterals :: Constr
$cMagicHash :: Constr
$cHereDocuments :: Constr
$cRestrictedTypeSynonyms :: Constr
$cExtensibleRecords :: Constr
$cDeriveAnyClass :: Constr
$cGeneralizedNewtypeDeriving :: Constr
$cPatternGuards :: Constr
$cNamedFieldPuns :: Constr
$cImplicitPrelude :: Constr
$cGenerics :: Constr
$cArrows :: Constr
$cForeignFunctionInterface :: Constr
$cTemplateHaskell :: Constr
$cTypeSynonymInstances :: Constr
$cBangPatterns :: Constr
$cKindSignatures :: Constr
$cCPP :: Constr
$cEmptyDataDecls :: Constr
$cFlexibleInstances :: Constr
$cFlexibleContexts :: Constr
$cImplicitParams :: Constr
$cPatternSignatures :: Constr
$cScopedTypeVariables :: Constr
$cExistentialQuantification :: Constr
$cPolymorphicComponents :: Constr
$cRankNTypes :: Constr
$cRank2Types :: Constr
$cFunctionalDependencies :: Constr
$cMonomorphismRestriction :: Constr
$cMultiParamTypeClasses :: Constr
$cParallelListComp :: Constr
$cRecursiveDo :: Constr
$cDoRec :: Constr
$cInstanceSigs :: Constr
$cIncoherentInstances :: Constr
$cUndecidableInstances :: Constr
$cOverlappingInstances :: Constr
$tKnownExtension :: DataType
gmapMo :: (forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
gmapMp :: (forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
gmapM :: (forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> KnownExtension -> m KnownExtension
gmapQi :: Int -> (forall d. Data d => d -> u) -> KnownExtension -> u
$cgmapQi :: forall u.
Int -> (forall d. Data d => d -> u) -> KnownExtension -> u
gmapQ :: (forall d. Data d => d -> u) -> KnownExtension -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> KnownExtension -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> KnownExtension -> r
gmapT :: (forall b. Data b => b -> b) -> KnownExtension -> KnownExtension
$cgmapT :: (forall b. Data b => b -> b) -> KnownExtension -> KnownExtension
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c KnownExtension)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c KnownExtension)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c KnownExtension)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c KnownExtension)
dataTypeOf :: KnownExtension -> DataType
$cdataTypeOf :: KnownExtension -> DataType
toConstr :: KnownExtension -> Constr
$ctoConstr :: KnownExtension -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c KnownExtension
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c KnownExtension
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> KnownExtension -> c KnownExtension
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> KnownExtension -> c KnownExtension
$cp1Data :: Typeable KnownExtension
Data, Typeable)
impliesExts :: [KnownExtension] -> [KnownExtension]
impliesExts :: [KnownExtension] -> [KnownExtension]
impliesExts = [KnownExtension] -> [KnownExtension]
go
where go :: [KnownExtension] -> [KnownExtension]
go [] = []
go [KnownExtension]
es = let xs :: [KnownExtension]
xs = (KnownExtension -> [KnownExtension])
-> [KnownExtension] -> [KnownExtension]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap KnownExtension -> [KnownExtension]
implE [KnownExtension]
es
ys :: [KnownExtension]
ys = (KnownExtension -> Bool) -> [KnownExtension] -> [KnownExtension]
forall a. (a -> Bool) -> [a] -> [a]
filter (Bool -> Bool
not (Bool -> Bool)
-> (KnownExtension -> Bool) -> KnownExtension -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (KnownExtension -> [KnownExtension] -> Bool)
-> [KnownExtension] -> KnownExtension -> Bool
forall a b c. (a -> b -> c) -> b -> a -> c
flip KnownExtension -> [KnownExtension] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
elem [KnownExtension]
es) [KnownExtension]
xs
in [KnownExtension]
es [KnownExtension] -> [KnownExtension] -> [KnownExtension]
forall a. [a] -> [a] -> [a]
++ [KnownExtension] -> [KnownExtension]
go [KnownExtension]
ys
implE :: KnownExtension -> [KnownExtension]
implE KnownExtension
e = case KnownExtension
e of
KnownExtension
TypeFamilies -> [KnownExtension
KindSignatures]
KnownExtension
ScopedTypeVariables -> [KnownExtension
TypeOperators, KnownExtension
ExplicitForAll]
KnownExtension
XmlSyntax -> [KnownExtension
RegularPatterns]
KnownExtension
RegularPatterns -> [KnownExtension
PatternGuards]
KnownExtension
RankNTypes -> [KnownExtension
Rank2Types, KnownExtension
ExplicitForAll]
KnownExtension
Rank2Types -> [KnownExtension
PolymorphicComponents, KnownExtension
ExplicitForAll]
KnownExtension
PolymorphicComponents -> [KnownExtension
ExplicitForAll]
KnownExtension
LiberalTypeSynonyms -> [KnownExtension
ExplicitForAll]
KnownExtension
ExistentialQuantification -> [KnownExtension
ExplicitForAll]
KnownExtension
ImpredicativeTypes -> [KnownExtension
ExplicitForAll]
KnownExtension
PolyKinds -> [KnownExtension
KindSignatures]
KnownExtension
TypeFamilyDependencies -> [KnownExtension
TypeFamilies]
KnownExtension
TypeInType -> [KnownExtension
PolyKinds, KnownExtension
DataKinds, KnownExtension
KindSignatures]
KnownExtension
TypeOperators -> [KnownExtension
ExplicitNamespaces]
KnownExtension
RecordPuns -> [KnownExtension
NamedFieldPuns]
KnownExtension
PatternSignatures -> [KnownExtension
ScopedTypeVariables]
KnownExtension
DerivingVia -> [KnownExtension
DerivingStrategies]
KnownExtension
_ -> []
glasgowExts :: [Extension]
glasgowExts :: [Extension]
glasgowExts = (KnownExtension -> Extension) -> [KnownExtension] -> [Extension]
forall a b. (a -> b) -> [a] -> [b]
map KnownExtension -> Extension
EnableExtension [
KnownExtension
ForeignFunctionInterface
, KnownExtension
UnliftedFFITypes
, KnownExtension
GADTs
, KnownExtension
ImplicitParams
, KnownExtension
ScopedTypeVariables
, KnownExtension
UnboxedTuples
, KnownExtension
TypeSynonymInstances
, KnownExtension
StandaloneDeriving
, KnownExtension
DeriveDataTypeable
, KnownExtension
FlexibleContexts
, KnownExtension
FlexibleInstances
, KnownExtension
ConstrainedClassMethods
, KnownExtension
MultiParamTypeClasses
, KnownExtension
FunctionalDependencies
, KnownExtension
MagicHash
, KnownExtension
PolymorphicComponents
, KnownExtension
ExistentialQuantification
, KnownExtension
UnicodeSyntax
, KnownExtension
PostfixOperators
, KnownExtension
PatternGuards
, KnownExtension
LiberalTypeSynonyms
, KnownExtension
RankNTypes
, KnownExtension
ImpredicativeTypes
, KnownExtension
TypeOperators
, KnownExtension
RecursiveDo
, KnownExtension
ParallelListComp
, KnownExtension
EmptyDataDecls
, KnownExtension
KindSignatures
, KnownExtension
GeneralizedNewtypeDeriving
, KnownExtension
TypeFamilies
]
allLangDefault :: [KnownExtension]
allLangDefault :: [KnownExtension]
allLangDefault = [KnownExtension
MonomorphismRestriction, KnownExtension
MonoPatBinds, KnownExtension
ImplicitPrelude]
ghcDefault :: [Extension]
ghcDefault :: [Extension]
ghcDefault = (KnownExtension -> Extension) -> [KnownExtension] -> [Extension]
forall a b. (a -> b) -> [a] -> [b]
map KnownExtension -> Extension
EnableExtension (KnownExtension
NondecreasingIndentationKnownExtension -> [KnownExtension] -> [KnownExtension]
forall a. a -> [a] -> [a]
:[KnownExtension]
allLangDefault)
knownExtensions :: [Extension]
knownExtensions :: [Extension]
knownExtensions =
[[Extension]] -> [Extension]
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat [ [KnownExtension -> Extension
EnableExtension KnownExtension
x, KnownExtension -> Extension
DisableExtension KnownExtension
x] | KnownExtension
x <- [KnownExtension
forall a. Bounded a => a
minBound..KnownExtension
forall a. Bounded a => a
maxBound] ]
deprecatedExtensions :: [(Extension, Maybe Extension)]
deprecatedExtensions :: [(Extension, Maybe Extension)]
deprecatedExtensions =
[ (KnownExtension -> Extension
EnableExtension KnownExtension
RecordPuns, Extension -> Maybe Extension
forall a. a -> Maybe a
Just (KnownExtension -> Extension
EnableExtension KnownExtension
NamedFieldPuns))
, (KnownExtension -> Extension
EnableExtension KnownExtension
PatternSignatures, Extension -> Maybe Extension
forall a. a -> Maybe a
Just (KnownExtension -> Extension
EnableExtension KnownExtension
ScopedTypeVariables))
]
classifyExtension :: String -> Extension
classifyExtension :: String -> Extension
classifyExtension String
string
= case String -> Maybe KnownExtension
classifyKnownExtension String
string of
Just KnownExtension
ext -> KnownExtension -> Extension
EnableExtension KnownExtension
ext
Maybe KnownExtension
Nothing ->
case String
string of
Char
'N':Char
'o':String
string' ->
case String -> Maybe KnownExtension
classifyKnownExtension String
string' of
Just KnownExtension
ext -> KnownExtension -> Extension
DisableExtension KnownExtension
ext
Maybe KnownExtension
Nothing -> String -> Extension
UnknownExtension String
string
String
_ -> String -> Extension
UnknownExtension String
string
classifyKnownExtension :: String -> Maybe KnownExtension
classifyKnownExtension :: String -> Maybe KnownExtension
classifyKnownExtension String
"" = Maybe KnownExtension
forall a. Maybe a
Nothing
classifyKnownExtension string :: String
string@(Char
c : String
_)
| (Char, Char) -> Char -> Bool
forall a. Ix a => (a, a) -> a -> Bool
inRange (Array Char [(String, KnownExtension)] -> (Char, Char)
forall i e. Array i e -> (i, i)
bounds Array Char [(String, KnownExtension)]
knownExtensionTable) Char
c
= String -> [(String, KnownExtension)] -> Maybe KnownExtension
forall a b. Eq a => a -> [(a, b)] -> Maybe b
lookup String
string (Array Char [(String, KnownExtension)]
knownExtensionTable Array Char [(String, KnownExtension)]
-> Char -> [(String, KnownExtension)]
forall i e. Ix i => Array i e -> i -> e
! Char
c)
| Bool
otherwise = Maybe KnownExtension
forall a. Maybe a
Nothing
knownExtensionTable :: Array Char [(String, KnownExtension)]
knownExtensionTable :: Array Char [(String, KnownExtension)]
knownExtensionTable =
([(String, KnownExtension)]
-> (String, KnownExtension) -> [(String, KnownExtension)])
-> [(String, KnownExtension)]
-> (Char, Char)
-> [(Char, (String, KnownExtension))]
-> Array Char [(String, KnownExtension)]
forall i e a.
Ix i =>
(e -> a -> e) -> e -> (i, i) -> [(i, a)] -> Array i e
accumArray (((String, KnownExtension)
-> [(String, KnownExtension)] -> [(String, KnownExtension)])
-> [(String, KnownExtension)]
-> (String, KnownExtension)
-> [(String, KnownExtension)]
forall a b c. (a -> b -> c) -> b -> a -> c
flip (:)) [] (Char
'A', Char
'Z')
[ (String -> Char
forall a. [a] -> a
head String
str, (String
str, KnownExtension
extension))
| KnownExtension
extension <- [Int -> KnownExtension
forall a. Enum a => Int -> a
toEnum Int
0 ..]
, let str :: String
str = KnownExtension -> String
forall a. Show a => a -> String
show KnownExtension
extension ]
parseExtension :: String -> Extension
parseExtension :: String -> Extension
parseExtension String
str = Extension -> Maybe Extension -> Extension
forall a. a -> Maybe a -> a
fromMaybe (String -> Extension
UnknownExtension String
str) (Maybe Extension -> Extension) -> Maybe Extension -> Extension
forall a b. (a -> b) -> a -> b
$
KnownExtension -> Extension
EnableExtension (KnownExtension -> Extension)
-> Maybe KnownExtension -> Maybe Extension
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> String -> Maybe KnownExtension
forall a. Read a => String -> Maybe a
readMay String
str
Maybe Extension -> Maybe Extension -> Maybe Extension
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> KnownExtension -> Extension
DisableExtension (KnownExtension -> Extension)
-> Maybe KnownExtension -> Maybe Extension
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (String -> Maybe KnownExtension
forall a. Read a => String -> Maybe a
readMay (String -> Maybe KnownExtension)
-> Maybe String -> Maybe KnownExtension
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< String -> Maybe String
dropNo String
str)
where
dropNo :: String -> Maybe String
dropNo (Char
'N':Char
'o':String
rest) = String -> Maybe String
forall a. a -> Maybe a
Just String
rest
dropNo String
_ = Maybe String
forall a. Maybe a
Nothing
prettyExtension :: Extension -> String
prettyExtension :: Extension -> String
prettyExtension (EnableExtension KnownExtension
ext) = KnownExtension -> String
forall a. Show a => a -> String
show KnownExtension
ext
prettyExtension (DisableExtension KnownExtension
ext) = String
"No" String -> ShowS
forall a. [a] -> [a] -> [a]
++ KnownExtension -> String
forall a. Show a => a -> String
show KnownExtension
ext
prettyExtension (UnknownExtension String
str) = String
str
readMay :: Read a => String -> Maybe a
readMay :: String -> Maybe a
readMay String
s = case [a
x | (a
x,String
t) <- ReadS a
forall a. Read a => ReadS a
reads String
s, (String
"",String
"") <- ReadS String
lex String
t] of
[a
x] -> a -> Maybe a
forall a. a -> Maybe a
Just a
x
[a]
_ -> Maybe a
forall a. Maybe a
Nothing
toExtensionList :: Language -> [Extension] -> [KnownExtension]
toExtensionList :: Language -> [Extension] -> [KnownExtension]
toExtensionList Language
lang [Extension]
exts' =
let langKes :: [KnownExtension]
langKes = case Language
lang of
Language
Haskell98 -> KnownExtension
NPlusKPatternsKnownExtension -> [KnownExtension] -> [KnownExtension]
forall a. a -> [a] -> [a]
:[KnownExtension]
allLangDefault
Language
Haskell2010 -> [KnownExtension
DoAndIfThenElse
, KnownExtension
PatternGuards
, KnownExtension
ForeignFunctionInterface
, KnownExtension
EmptyDataDecls
] [KnownExtension] -> [KnownExtension] -> [KnownExtension]
forall a. [a] -> [a] -> [a]
++ [KnownExtension]
allLangDefault
Language
HaskellAllDisabled -> []
UnknownLanguage String
s ->
String -> [KnownExtension]
forall a. HasCallStack => String -> a
error (String -> [KnownExtension]) -> String -> [KnownExtension]
forall a b. (a -> b) -> a -> b
$ String
"toExtensionList: Unknown language " String -> ShowS
forall a. [a] -> [a] -> [a]
++ String
s
in [KnownExtension] -> [KnownExtension]
impliesExts ([KnownExtension] -> [KnownExtension])
-> [KnownExtension] -> [KnownExtension]
forall a b. (a -> b) -> a -> b
$ [KnownExtension] -> [KnownExtension]
forall a. Eq a => [a] -> [a]
nub ([KnownExtension] -> [KnownExtension])
-> [KnownExtension] -> [KnownExtension]
forall a b. (a -> b) -> a -> b
$ [KnownExtension] -> [Extension] -> [KnownExtension]
go [KnownExtension]
langKes [Extension]
exts'
where go :: [KnownExtension] -> [Extension] -> [KnownExtension]
go :: [KnownExtension] -> [Extension] -> [KnownExtension]
go [KnownExtension]
acc [] = [KnownExtension]
acc
go [KnownExtension]
acc (DisableExtension KnownExtension
x : [Extension]
exts) = [KnownExtension] -> [Extension] -> [KnownExtension]
go ((KnownExtension -> Bool) -> [KnownExtension] -> [KnownExtension]
forall a. (a -> Bool) -> [a] -> [a]
filter (KnownExtension -> KnownExtension -> Bool
forall a. Eq a => a -> a -> Bool
/= KnownExtension
x) [KnownExtension]
acc) [Extension]
exts
go [KnownExtension]
acc (EnableExtension KnownExtension
x : [Extension]
exts) = [KnownExtension] -> [Extension] -> [KnownExtension]
go (KnownExtension
x KnownExtension -> [KnownExtension] -> [KnownExtension]
forall a. a -> [a] -> [a]
: [KnownExtension]
acc) [Extension]
exts
go [KnownExtension]
acc (Extension
_ : [Extension]
exts) = [KnownExtension] -> [Extension] -> [KnownExtension]
go [KnownExtension]
acc [Extension]
exts