Safe Haskell	None
Language	Haskell2010

Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap

Contents

Orphan instances

Synopsis

type ExtMap = Map (LogicalRelation Extension) [Occurence SrcSpan]
data Occurence a
- = Hint {
  - unOcc :: a
  }
- | Evidence {
  - unOcc :: a
  }
- | MissingInformation {
  - unOcc :: a
  }
type LogicalRelation a = Formula a
prettyPrintFormula :: Show a => LogicalRelation a -> String
lVar :: a -> LogicalRelation a
lNot :: a -> LogicalRelation a
lAnd :: a -> a -> LogicalRelation a
lOr :: a -> a -> LogicalRelation a
lImplies :: a -> a -> LogicalRelation a
lAll :: [LogicalRelation a] -> LogicalRelation a
complexity :: Extension -> Int
expandExtension' :: Extension -> [Extension]
findFixedPoint :: Eq a => (a -> a) -> a -> a
determineExtensions :: Map (LogicalRelation Extension) v -> [Extension]
rmImplied :: Extension -> [Extension] -> [Extension]
mergeImplied :: [Extension] -> [Extension]
data Extension
- = Cpp
- | OverlappingInstances
- | UndecidableInstances
- | IncoherentInstances
- | UndecidableSuperClasses
- | MonomorphismRestriction
- | MonoPatBinds
- | MonoLocalBinds
- | RelaxedPolyRec
- | ExtendedDefaultRules
- | ForeignFunctionInterface
- | UnliftedFFITypes
- | InterruptibleFFI
- | CApiFFI
- | GHCForeignImportPrim
- | JavaScriptFFI
- | ParallelArrays
- | Arrows
- | TemplateHaskell
- | TemplateHaskellQuotes
- | QuasiQuotes
- | ImplicitParams
- | ImplicitPrelude
- | ScopedTypeVariables
- | AllowAmbiguousTypes
- | UnboxedTuples
- | UnboxedSums
- | BangPatterns
- | TypeFamilies
- | TypeFamilyDependencies
- | TypeInType
- | OverloadedStrings
- | OverloadedLists
- | NumDecimals
- | DisambiguateRecordFields
- | RecordWildCards
- | RecordPuns
- | ViewPatterns
- | GADTs
- | GADTSyntax
- | NPlusKPatterns
- | DoAndIfThenElse
- | BlockArguments
- | RebindableSyntax
- | ConstraintKinds
- | PolyKinds
- | DataKinds
- | InstanceSigs
- | ApplicativeDo
- | StandaloneDeriving
- | DeriveDataTypeable
- | AutoDeriveTypeable
- | DeriveFunctor
- | DeriveTraversable
- | DeriveFoldable
- | DeriveGeneric
- | DefaultSignatures
- | DeriveAnyClass
- | DeriveLift
- | DerivingStrategies
- | DerivingVia
- | TypeSynonymInstances
- | FlexibleContexts
- | FlexibleInstances
- | ConstrainedClassMethods
- | MultiParamTypeClasses
- | NullaryTypeClasses
- | FunctionalDependencies
- | UnicodeSyntax
- | ExistentialQuantification
- | MagicHash
- | EmptyDataDecls
- | KindSignatures
- | RoleAnnotations
- | ParallelListComp
- | TransformListComp
- | MonadComprehensions
- | GeneralizedNewtypeDeriving
- | RecursiveDo
- | PostfixOperators
- | TupleSections
- | PatternGuards
- | LiberalTypeSynonyms
- | RankNTypes
- | ImpredicativeTypes
- | TypeOperators
- | ExplicitNamespaces
- | PackageImports
- | ExplicitForAll
- | AlternativeLayoutRule
- | AlternativeLayoutRuleTransitional
- | DatatypeContexts
- | NondecreasingIndentation
- | RelaxedLayout
- | TraditionalRecordSyntax
- | LambdaCase
- | MultiWayIf
- | BinaryLiterals
- | NegativeLiterals
- | HexFloatLiterals
- | DuplicateRecordFields
- | OverloadedLabels
- | EmptyCase
- | PatternSynonyms
- | PartialTypeSignatures
- | NamedWildCards
- | StaticPointers
- | TypeApplications
- | Strict
- | StrictData
- | MonadFailDesugaring
- | EmptyDataDeriving
- | NumericUnderscores
- | QuantifiedConstraints
- | StarIsType
data Formula v
- = Var v
- | Yes
- | No
- | Not (Formula v)
- | (Formula v) :&&: (Formula v)
- | (Formula v) :||: (Formula v)
- | (Formula v) :++: (Formula v)
- | (Formula v) :->: (Formula v)
- | (Formula v) :<->: (Formula v)
- | All [Formula v]
- | Some [Formula v]
- | None [Formula v]
- | ExactlyOne [Formula v]
- | AtMostOne [Formula v]
- | Let (Formula v) (Formula v -> Formula v)
- | Bound Integer

Documentation

type ExtMap = Map (LogicalRelation Extension) [Occurence SrcSpan] Source #

data Occurence a Source #

Constructors

Hint
Fields unOcc :: a
Evidence
Fields unOcc :: a
MissingInformation
Fields unOcc :: a

Instances

Functor Occurence Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods fmap :: (a -> b) -> Occurence a -> Occurence b # (<$) :: a -> Occurence b -> Occurence a #
Eq a => Eq (Occurence a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods (==) :: Occurence a -> Occurence a -> Bool # (/=) :: Occurence a -> Occurence a -> Bool #
Ord a => Ord (Occurence a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods compare :: Occurence a -> Occurence a -> Ordering # (<) :: Occurence a -> Occurence a -> Bool # (<=) :: Occurence a -> Occurence a -> Bool # (>) :: Occurence a -> Occurence a -> Bool # (>=) :: Occurence a -> Occurence a -> Bool # max :: Occurence a -> Occurence a -> Occurence a # min :: Occurence a -> Occurence a -> Occurence a #
Show a => Show (Occurence a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods showsPrec :: Int -> Occurence a -> ShowS # show :: Occurence a -> String # showList :: [Occurence a] -> ShowS #

type LogicalRelation a = Formula a Source #

prettyPrintFormula :: Show a => LogicalRelation a -> String Source #

lVar :: a -> LogicalRelation a Source #

lNot :: a -> LogicalRelation a Source #

lAnd :: a -> a -> LogicalRelation a Source #

lOr :: a -> a -> LogicalRelation a Source #

lImplies :: a -> a -> LogicalRelation a Source #

lAll :: [LogicalRelation a] -> LogicalRelation a Source #

complexity :: Extension -> Int Source #

expandExtension' :: Extension -> [Extension] Source #

Completely expand extension

findFixedPoint :: Eq a => (a -> a) -> a -> a Source #

Terminating variant of Control.Monad.Fix.fix It tries to find the fixpoint of a function with a given starting value. It terminates if a value repeats itself.

determineExtensions :: Map (LogicalRelation Extension) v -> [Extension] Source #

rmImplied :: Extension -> [Extension] -> [Extension] Source #

mergeImplied :: [Extension] -> [Extension] Source #

data Extension #

The language extensions known to GHC.

Note that there is an orphan Binary instance for this type supplied by the GHC.LanguageExtensions module provided by ghc-boot. We can't provide here as this would require adding transitive dependencies to the template-haskell package, which must have a minimal dependency set.

Constructors

Cpp
OverlappingInstances
UndecidableInstances
IncoherentInstances
UndecidableSuperClasses
MonomorphismRestriction
MonoPatBinds
MonoLocalBinds
RelaxedPolyRec
ExtendedDefaultRules
ForeignFunctionInterface
UnliftedFFITypes
InterruptibleFFI
CApiFFI
GHCForeignImportPrim
JavaScriptFFI
ParallelArrays
Arrows
TemplateHaskell
TemplateHaskellQuotes
QuasiQuotes
ImplicitParams
ImplicitPrelude
ScopedTypeVariables
AllowAmbiguousTypes
UnboxedTuples
UnboxedSums
BangPatterns
TypeFamilies
TypeFamilyDependencies
TypeInType
OverloadedStrings
OverloadedLists
NumDecimals
DisambiguateRecordFields
RecordWildCards
RecordPuns
ViewPatterns
GADTs
GADTSyntax
NPlusKPatterns
DoAndIfThenElse
BlockArguments
RebindableSyntax
ConstraintKinds
PolyKinds
DataKinds
InstanceSigs
ApplicativeDo
StandaloneDeriving
DeriveDataTypeable
AutoDeriveTypeable
DeriveFunctor
DeriveTraversable
DeriveFoldable
DeriveGeneric
DefaultSignatures
DeriveAnyClass
DeriveLift
DerivingStrategies
DerivingVia
TypeSynonymInstances
FlexibleContexts
FlexibleInstances
ConstrainedClassMethods
MultiParamTypeClasses
NullaryTypeClasses
FunctionalDependencies
UnicodeSyntax
ExistentialQuantification
MagicHash
EmptyDataDecls
KindSignatures
RoleAnnotations
ParallelListComp
TransformListComp
MonadComprehensions
GeneralizedNewtypeDeriving
RecursiveDo
PostfixOperators
TupleSections
PatternGuards
LiberalTypeSynonyms
RankNTypes
ImpredicativeTypes
TypeOperators
ExplicitNamespaces
PackageImports
ExplicitForAll
AlternativeLayoutRule
AlternativeLayoutRuleTransitional
DatatypeContexts
NondecreasingIndentation
RelaxedLayout
TraditionalRecordSyntax
LambdaCase
MultiWayIf
BinaryLiterals
NegativeLiterals
HexFloatLiterals
DuplicateRecordFields
OverloadedLabels
EmptyCase
PatternSynonyms
PartialTypeSignatures
NamedWildCards
StaticPointers
TypeApplications
Strict
StrictData
MonadFailDesugaring
EmptyDataDeriving
NumericUnderscores
QuantifiedConstraints
StarIsType

Instances

Enum Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods succ :: Extension -> Extension # pred :: Extension -> Extension # toEnum :: Int -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #
Eq Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Ord Extension Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Read Extension Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods readsPrec :: Int -> ReadS Extension # readList :: ReadS [Extension] # readPrec :: ReadPrec Extension # readListPrec :: ReadPrec [Extension] #
Show Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Generic Extension
Instance details Defined in GHC.LanguageExtensions.Type Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
NFData Extension Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods rnf :: Extension -> () #
Outputable Extension
Instance details Defined in Outputable Methods ppr :: Extension -> SDoc # pprPrec :: Rational -> Extension -> SDoc #
type Rep Extension
Instance details Defined in GHC.LanguageExtensions.Type type Rep Extension = D1 (MetaData "Extension" "GHC.LanguageExtensions.Type" "ghc-boot-th-8.6.2" False) ((((((C1 (MetaCons "Cpp" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "OverlappingInstances" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "UndecidableInstances" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "IncoherentInstances" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "UndecidableSuperClasses" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "MonomorphismRestriction" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "MonoPatBinds" PrefixI False) (U1 :: Type -> Type)))) :+: ((C1 (MetaCons "MonoLocalBinds" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "RelaxedPolyRec" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ExtendedDefaultRules" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "ForeignFunctionInterface" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "UnliftedFFITypes" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "InterruptibleFFI" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "CApiFFI" PrefixI False) (U1 :: Type -> Type))))) :+: (((C1 (MetaCons "GHCForeignImportPrim" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "JavaScriptFFI" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ParallelArrays" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "Arrows" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "TemplateHaskell" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "TemplateHaskellQuotes" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "QuasiQuotes" PrefixI False) (U1 :: Type -> Type)))) :+: ((C1 (MetaCons "ImplicitParams" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "ImplicitPrelude" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ScopedTypeVariables" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "AllowAmbiguousTypes" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "UnboxedTuples" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "UnboxedSums" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "BangPatterns" PrefixI False) (U1 :: Type -> Type)))))) :+: ((((C1 (MetaCons "TypeFamilies" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "TypeFamilyDependencies" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "TypeInType" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "OverloadedStrings" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "OverloadedLists" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "NumDecimals" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DisambiguateRecordFields" PrefixI False) (U1 :: Type -> Type)))) :+: ((C1 (MetaCons "RecordWildCards" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "RecordPuns" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ViewPatterns" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "GADTs" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "GADTSyntax" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "NPlusKPatterns" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DoAndIfThenElse" PrefixI False) (U1 :: Type -> Type))))) :+: (((C1 (MetaCons "BlockArguments" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "RebindableSyntax" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ConstraintKinds" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "PolyKinds" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DataKinds" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "InstanceSigs" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ApplicativeDo" PrefixI False) (U1 :: Type -> Type)))) :+: (((C1 (MetaCons "StandaloneDeriving" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DeriveDataTypeable" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "AutoDeriveTypeable" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DeriveFunctor" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "DeriveTraversable" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DeriveFoldable" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "DeriveGeneric" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DefaultSignatures" PrefixI False) (U1 :: Type -> Type))))))) :+: (((((C1 (MetaCons "DeriveAnyClass" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "DeriveLift" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "DerivingStrategies" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "DerivingVia" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "TypeSynonymInstances" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "FlexibleContexts" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "FlexibleInstances" PrefixI False) (U1 :: Type -> Type)))) :+: ((C1 (MetaCons "ConstrainedClassMethods" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "MultiParamTypeClasses" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "NullaryTypeClasses" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "FunctionalDependencies" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "UnicodeSyntax" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "ExistentialQuantification" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "MagicHash" PrefixI False) (U1 :: Type -> Type))))) :+: (((C1 (MetaCons "EmptyDataDecls" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "KindSignatures" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "RoleAnnotations" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "ParallelListComp" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "TransformListComp" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "MonadComprehensions" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "GeneralizedNewtypeDeriving" PrefixI False) (U1 :: Type -> Type)))) :+: (((C1 (MetaCons "RecursiveDo" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "PostfixOperators" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "TupleSections" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "PatternGuards" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "LiberalTypeSynonyms" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "RankNTypes" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "ImpredicativeTypes" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "TypeOperators" PrefixI False) (U1 :: Type -> Type)))))) :+: ((((C1 (MetaCons "ExplicitNamespaces" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "PackageImports" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "ExplicitForAll" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "AlternativeLayoutRule" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "AlternativeLayoutRuleTransitional" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "DatatypeContexts" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "NondecreasingIndentation" PrefixI False) (U1 :: Type -> Type)))) :+: ((C1 (MetaCons "RelaxedLayout" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "TraditionalRecordSyntax" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "LambdaCase" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "MultiWayIf" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "BinaryLiterals" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "NegativeLiterals" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "HexFloatLiterals" PrefixI False) (U1 :: Type -> Type))))) :+: (((C1 (MetaCons "DuplicateRecordFields" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "OverloadedLabels" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "EmptyCase" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "PatternSynonyms" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "PartialTypeSignatures" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "NamedWildCards" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "StaticPointers" PrefixI False) (U1 :: Type -> Type)))) :+: (((C1 (MetaCons "TypeApplications" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Strict" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "StrictData" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "MonadFailDesugaring" PrefixI False) (U1 :: Type -> Type))) :+: ((C1 (MetaCons "EmptyDataDeriving" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "NumericUnderscores" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "QuantifiedConstraints" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "StarIsType" PrefixI False) (U1 :: Type -> Type))))))))

data Formula v #

Constructors

Var v
Yes
No
Not (Formula v)
(Formula v) :&&: (Formula v)
(Formula v) :\|\|: (Formula v)
(Formula v) :++: (Formula v)
(Formula v) :->: (Formula v)
(Formula v) :<->: (Formula v)
All [Formula v]
Some [Formula v]
None [Formula v]
ExactlyOne [Formula v]
AtMostOne [Formula v]
Let (Formula v) (Formula v -> Formula v)
Bound Integer

Instances

Eq v => Eq (Formula v)
Instance details Defined in SAT.MiniSat.Formula Methods (==) :: Formula v -> Formula v -> Bool # (/=) :: Formula v -> Formula v -> Bool #
Ord v => Ord (Formula v)
Instance details Defined in SAT.MiniSat.Formula Methods compare :: Formula v -> Formula v -> Ordering # (<) :: Formula v -> Formula v -> Bool # (<=) :: Formula v -> Formula v -> Bool # (>) :: Formula v -> Formula v -> Bool # (>=) :: Formula v -> Formula v -> Bool # max :: Formula v -> Formula v -> Formula v # min :: Formula v -> Formula v -> Formula v #
Show v => Show (Formula v)
Instance details Defined in SAT.MiniSat.Formula Methods showsPrec :: Int -> Formula v -> ShowS # show :: Formula v -> String # showList :: [Formula v] -> ShowS #
Generic a => Generic (Formula a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Associated Types type Rep (Formula a) :: Type -> Type # Methods from :: Formula a -> Rep (Formula a) x # to :: Rep (Formula a) x -> Formula a #
(Generic a, NFData a) => NFData (Formula a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap Methods rnf :: Formula a -> () #
type Rep (Formula a) Source #
Instance details Defined in Language.Haskell.Tools.Refactor.Builtin.ExtensionOrganizer.ExtMap type Rep (Formula a) = D1 (MetaData "Formula" "SAT.MiniSat.Formula" "minisat-solver-0.1-5dk7oL6zSYPLVRG9Cr6lB4" False) ((((C1 (MetaCons "Var" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Yes" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "No" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Not" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a))))) :+: ((C1 (MetaCons ":&&:" (InfixI LeftAssociative 9) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a))) :+: C1 (MetaCons ":\|\|:" (InfixI LeftAssociative 9) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)))) :+: (C1 (MetaCons ":++:" (InfixI LeftAssociative 9) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a))) :+: C1 (MetaCons ":->:" (InfixI LeftAssociative 9) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)))))) :+: (((C1 (MetaCons ":<->:" (InfixI LeftAssociative 9) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a))) :+: C1 (MetaCons "All" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Formula a]))) :+: (C1 (MetaCons "Some" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Formula a])) :+: C1 (MetaCons "None" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Formula a])))) :+: ((C1 (MetaCons "ExactlyOne" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Formula a])) :+: C1 (MetaCons "AtMostOne" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Formula a]))) :+: (C1 (MetaCons "Let" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Formula a -> Formula a))) :+: C1 (MetaCons "Bound" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Integer))))))

Orphan instances

Ord Extension Source #
Instance details Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Read Extension Source #
Instance details Methods readsPrec :: Int -> ReadS Extension # readList :: ReadS [Extension] # readPrec :: ReadPrec Extension # readListPrec :: ReadPrec [Extension] #
NFData Extension Source #
Instance details Methods rnf :: Extension -> () #
Generic a => Generic (Formula a) Source #
Instance details Associated Types type Rep (Formula a) :: Type -> Type # Methods from :: Formula a -> Rep (Formula a) x # to :: Rep (Formula a) x -> Formula a #
(Generic a, NFData a) => NFData (Formula a) Source #
Instance details Methods rnf :: Formula a -> () #