| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Lorentz.Prelude
Description
Commonly used parts of regular Prelude.
Synopsis
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- (&) :: a -> (a -> b) -> b
- type ($) (f :: k1 -> k) (a :: k1) = f a
- class Eq a
- class Eq a => Ord a
- class Bounded a where
- class Semigroup a where
- class Semigroup a => Monoid a where
- class Generic a
- data Text
- data Either a b
- data Maybe a
- data Proxy (t :: k) = Proxy
- fromString :: IsString a => String -> a
- undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a
- (!) :: WithParam p fn fn' => fn -> Param p -> fn'
- class a ~# b => (a :: k) ~ (b :: k)
Documentation
($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b infixr 0 #
Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f . However, $ x)$ has
low, right-associative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xszipWith ($) fs xs
Note that ( is representation-polymorphic in its result type, so that
$)foo where $ Truefoo :: Bool -> Int# is well-typed.
type ($) (f :: k1 -> k) (a :: k1) = f a infixr 2 #
Infix application.
f :: Either String $ Maybe Int = f :: Either String (Maybe Int)
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, instances are
encouraged to follow these properties:
Instances
| Eq CabalSpecVersion | |
Defined in Distribution.CabalSpecVersion Methods (==) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (/=) :: CabalSpecVersion -> CabalSpecVersion -> Bool # | |
| Eq HasCommonStanzas | |
Defined in Distribution.CabalSpecVersion Methods (==) :: HasCommonStanzas -> HasCommonStanzas -> Bool # (/=) :: HasCommonStanzas -> HasCommonStanzas -> Bool # | |
| Eq HasElif | |
| Eq Position | |
| Eq PWarnType | |
| Eq Structure | |
| Eq Extension | |
| Eq KnownExtension | |
Defined in Language.Haskell.Extension Methods (==) :: KnownExtension -> KnownExtension -> Bool # (/=) :: KnownExtension -> KnownExtension -> Bool # | |
| Eq Language | |
| Eq Key | |
| Eq DotNetTime | |
Defined in Data.Aeson.Types.Internal | |
| Eq JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool # (/=) :: JSONPathElement -> JSONPathElement -> Bool # | |
| Eq SumEncoding | |
Defined in Data.Aeson.Types.Internal | |
| Eq Value | |
| Eq More | |
| Eq Pos | |
| Eq ByteArray | Since: base-4.17.0.0 |
| Eq Constr | Equality of constructors Since: base-4.0.0.0 |
| Eq ConstrRep | Since: base-4.0.0.0 |
| Eq DataRep | Since: base-4.0.0.0 |
| Eq Fixity | Since: base-4.0.0.0 |
| Eq All | Since: base-2.1 |
| Eq Any | Since: base-2.1 |
| Eq SomeTypeRep | |
Defined in Data.Typeable.Internal | |
| Eq Version | Since: base-2.1 |
| Eq Void | Since: base-4.8.0.0 |
| Eq BlockReason | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync | |
| Eq ThreadId | Since: base-4.2.0.0 |
| Eq ThreadStatus | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync | |
| Eq ErrorCall | Since: base-4.7.0.0 |
| Eq ArithException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool # | |
| Eq Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool # | |
| Eq DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool # | |
| Eq Fixity | Since: base-4.6.0.0 |
| Eq SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool # | |
| Eq SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # | |
| Eq MaskingState | Since: base-4.3.0.0 |
Defined in GHC.IO | |
| Eq ArrayException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool # | |
| Eq AsyncException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool # | |
| Eq ExitCode | |
| Eq IOErrorType | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Eq IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Eq BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types | |
| Eq Handle | Since: base-4.1.0.0 |
| Eq Newline | Since: base-4.2.0.0 |
| Eq NewlineMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types | |
| Eq IOMode | Since: base-4.2.0.0 |
| Eq Int16 | Since: base-2.1 |
| Eq Int32 | Since: base-2.1 |
| Eq Int64 | Since: base-2.1 |
| Eq Int8 | Since: base-2.1 |
| Eq IoSubSystem | |
Defined in GHC.RTS.Flags | |
| Eq SrcLoc | Since: base-4.9.0.0 |
| Eq SomeChar | |
| Eq SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits | |
| Eq SomeNat | Since: base-4.7.0.0 |
| Eq GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool # | |
| Eq Word16 | Since: base-2.1 |
| Eq Word32 | Since: base-2.1 |
| Eq Word64 | Since: base-2.1 |
| Eq Word8 | Since: base-2.1 |
| Eq Lexeme | Since: base-2.1 |
| Eq Number | Since: base-4.6.0.0 |
| Eq Alphabet | |
| Eq Encoding | |
| Eq ASCII7_Invalid | |
| Eq ISO_8859_1_Invalid | |
| Eq UTF16_Invalid | |
| Eq UTF32_Invalid | |
| Eq AsciiString | |
Defined in Basement.Types.AsciiString | |
| Eq Char7 | |
| Eq FileSize | |
| Eq String | |
| Eq BimapException | |
| Eq F2Poly | |
| Eq Bit | |
| Eq ByteString | |
Defined in Data.ByteString.Internal.Type | |
| Eq ByteString | |
Defined in Data.ByteString.Lazy.Internal | |
| Eq ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods (==) :: ShortByteString -> ShortByteString -> Bool # (/=) :: ShortByteString -> ShortByteString -> Bool # | |
| Eq IntSet | |
| Eq CryptoError | |
Defined in Crypto.Error.Types | |
| Eq BigNat | |
| Eq ForeignSrcLang | |
Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool # | |
| Eq Extension | |
| Eq Module | |
| Eq Ordering | |
| Eq TrName | |
| Eq TyCon | |
| Eq BlstError | |
| Eq EncodeMethod | |
Defined in Crypto.BLST.Internal.Bindings.Types | |
| Eq Scalar | |
| Eq SecretKey | |
| Eq DefName | |
| Eq DHashAlgorithm Source # | |
Defined in Lorentz.Bytes Methods (==) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (/=) :: DHashAlgorithm -> DHashAlgorithm -> Bool # | |
| Eq NRational Source # | |
| Eq Rational Source # | |
| Eq DViewDesc Source # | |
| Eq EpCallingStep Source # | |
Defined in Lorentz.Entrypoints.Core Methods (==) :: EpCallingStep -> EpCallingStep -> Bool # (/=) :: EpCallingStep -> EpCallingStep -> Bool # | |
| Eq DError Source # | |
| Eq DThrows Source # | |
| Eq SomeError Source # | |
| Eq DDescribeErrorTagMap Source # | |
Defined in Lorentz.Errors.Numeric.Doc Methods (==) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (/=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # | |
| Eq ExtConversionError Source # | |
Defined in Lorentz.Extensible Methods (==) :: ExtConversionError -> ExtConversionError -> Bool # (/=) :: ExtConversionError -> ExtConversionError -> Bool # | |
| Eq EntrypointLookupError Source # | |
Defined in Lorentz.UParam Methods (==) :: EntrypointLookupError -> EntrypointLookupError -> Bool # (/=) :: EntrypointLookupError -> EntrypointLookupError -> Bool # | |
| Eq Never Source # | |
| Eq OpenChest Source # | |
| Eq ViewInterfaceMatchError Source # | |
Defined in Lorentz.ViewBase Methods (==) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool # (/=) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool # | |
| Eq ZSNil Source # | |
| Eq InvalidPosException | |
Defined in Text.Megaparsec.Pos Methods (==) :: InvalidPosException -> InvalidPosException -> Bool # (/=) :: InvalidPosException -> InvalidPosException -> Bool # | |
| Eq Pos | |
| Eq SourcePos | |
| Eq FromExpErrorReason | |
| Eq Annotation | |
| Eq MichelinePrimitive | |
| Eq MichelinePrimitiveTag | |
| Eq TezosMutez | |
| Eq AnalyzerRes | |
| Eq DocItemId | |
| Eq DocItemPos | |
Defined in Morley.Michelson.Doc | |
| Eq SomeDocDefinitionItem | |
Defined in Morley.Michelson.Doc Methods (==) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (/=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # | |
| Eq ErrorSrcPos | |
| Eq Pos | |
| Eq SrcPos | |
| Eq BadViewNameError | |
| Eq ViewName | |
| Eq ViewsSetError | |
| Eq MorleyLogs | |
| Eq RemainingSteps | |
| Eq CadrStruct | |
| Eq Macro | |
| Eq PairStruct | |
| Eq ParsedOp | |
| Eq UnpairStruct | |
| Eq OptimizationStage | |
| Eq CustomParserException | |
| Eq ParserException | |
| Eq StringLiteralParserException | |
| Eq MichelsonSource | |
| Eq ParserOptions | |
| Eq BigMapCounter | |
| Eq ContractState | |
| Eq GState | |
| Eq ImplicitState | |
| Eq TicketKey | |
| Eq VotingPowers | |
| Eq MText | |
| Eq ExtError | |
| Eq StackSize | |
| Eq TcTypeError | |
| Eq TopLevelType | |
| Eq TypeContext | |
| Eq SomeParamType | |
| Eq Nesting | |
| Eq SomeSingInstr | |
| Eq SomeHST | |
| Eq SomeAnnotatedValue | |
| Eq MutezArithErrorType | |
| Eq ShiftArithErrorType | |
| Eq UntypingOptions | |
| Eq ArmCoord | |
| Eq EpAddress | |
| Eq ParamEpError | |
| Eq ParseEpAddressError | |
| Eq DStorageType | |
| Eq DType | |
| Eq OperationHash | |
| Eq BadTypeForScope | |
| Eq T | |
| Eq SetDelegate | |
| Eq AnnotationSet | |
| Eq AnyAnn | |
| Eq ContractBlockError | |
| Eq EntriesOrder | |
| Eq Entry | |
| Eq EpName | |
| Eq EpNameFromRefAnnError | |
| Eq HandleImplicitDefaultEp | |
| Eq PrintComment | |
| Eq StackRef | |
| Eq StackTypePattern | |
| Eq TyVar | |
| Eq Var | |
| Eq ExpandedOp | |
| Eq ParameterType | |
| Eq T | |
| Eq Ty | |
| Eq InternalByteString | |
| Eq GlobalCounter | |
| Eq ParseAddressError | |
| Eq ParseAddressRawError | |
| Eq AddressKind | |
| Eq ChainId | |
| Eq Mutez | |
| Eq ParseChainIdError | |
| Eq Timestamp | |
| Eq KeyType | |
| Eq ParseSignatureRawError | |
| Eq PublicKey | |
| Eq SecretKey | |
| Eq Signature | |
| Eq PublicKey | |
| Eq SecretKey | |
| Eq Signature | |
| Eq Bls12381Fr | |
Defined in Morley.Tezos.Crypto.BLS12381 | |
| Eq Bls12381G1 | |
Defined in Morley.Tezos.Crypto.BLS12381 | |
| Eq Bls12381G2 | |
Defined in Morley.Tezos.Crypto.BLS12381 | |
| Eq DeserializationError | |
| Eq PublicKey | |
| Eq SecretKey | |
| Eq Signature | |
| Eq PublicKey | |
| Eq SecretKey | |
| Eq Signature | |
| Eq PublicKey | |
| Eq SecretKey | |
| Eq Signature | |
| Eq Chest | |
| Eq ChestKey | |
| Eq Ciphertext | |
| Eq Locked | |
| Eq Nonce | |
| Eq OpeningResult | |
| Eq Proof | |
| Eq PublicModulus | |
| Eq TLTime | |
| Eq Unlocked | |
| Eq CryptoParseError | |
| Eq UnpackError | |
| Eq HexJSONByteString | |
| Eq Word62 | |
| Eq Word63 | |
| Eq AltNodeType | |
Defined in Options.Applicative.Types | |
| Eq ArgPolicy | |
| Eq ArgumentReachability | |
Defined in Options.Applicative.Types Methods (==) :: ArgumentReachability -> ArgumentReachability -> Bool # (/=) :: ArgumentReachability -> ArgumentReachability -> Bool # | |
| Eq Backtracking | |
Defined in Options.Applicative.Types | |
| Eq OptName | |
| Eq OptVisibility | |
Defined in Options.Applicative.Types Methods (==) :: OptVisibility -> OptVisibility -> Bool # (/=) :: OptVisibility -> OptVisibility -> Bool # | |
| Eq ParserPrefs | |
Defined in Options.Applicative.Types | |
| Eq Mode | |
| Eq Style | |
| Eq TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ | |
| Eq Doc | |
| Eq FusionDepth | |
Defined in Prettyprinter.Internal | |
| Eq LayoutOptions | |
Defined in Prettyprinter.Internal Methods (==) :: LayoutOptions -> LayoutOptions -> Bool # (/=) :: LayoutOptions -> LayoutOptions -> Bool # | |
| Eq PageWidth | |
| Eq ByteArray | Since: primitive-0.6.3.0 |
| Eq StdGen | |
| Eq Scientific | Scientific numbers can be safely compared for equality. No magnitude |
Defined in Data.Scientific | |
| Eq Mod2 | |
| Eq DependencyType | |
Defined in Test.Tasty.Core Methods (==) :: DependencyType -> DependencyType -> Bool # (/=) :: DependencyType -> DependencyType -> Bool # | |
| Eq Expr | |
| Eq AnnLookup | |
| Eq AnnTarget | |
| Eq Bang | |
| Eq Body | |
| Eq Bytes | |
| Eq Callconv | |
| Eq Clause | |
| Eq Con | |
| Eq Dec | |
| Eq DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool # | |
| Eq DerivClause | |
Defined in Language.Haskell.TH.Syntax | |
| Eq DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool # (/=) :: DerivStrategy -> DerivStrategy -> Bool # | |
| Eq DocLoc | |
| Eq Exp | |
| Eq FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool # | |
| Eq Fixity | |
| Eq FixityDirection | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool # (/=) :: FixityDirection -> FixityDirection -> Bool # | |
| Eq Foreign | |
| Eq FunDep | |
| Eq Guard | |
| Eq Info | |
| Eq InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool # | |
| Eq Inline | |
| Eq Lit | |
| Eq Loc | |
| Eq Match | |
| Eq ModName | |
| Eq Module | |
| Eq ModuleInfo | |
Defined in Language.Haskell.TH.Syntax | |
| Eq Name | |
| Eq NameFlavour | |
Defined in Language.Haskell.TH.Syntax | |
| Eq NameSpace | |
| Eq OccName | |
| Eq Overlap | |
| Eq Pat | |
| Eq PatSynArgs | |
Defined in Language.Haskell.TH.Syntax | |
| Eq PatSynDir | |
| Eq Phases | |
| Eq PkgName | |
| Eq Pragma | |
| Eq Range | |
| Eq Role | |
| Eq RuleBndr | |
| Eq RuleMatch | |
| Eq Safety | |
| Eq SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool # | |
| Eq SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # | |
| Eq Specificity | |
Defined in Language.Haskell.TH.Syntax | |
| Eq Stmt | |
| Eq TyLit | |
| Eq TySynEqn | |
| Eq Type | |
| Eq TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # | |
| Eq UnicodeException | |
Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool # | |
| Eq Builder | |
| Eq B | |
| Eq ShortText | |
| Eq ConstructorInfo | |
Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorInfo -> ConstructorInfo -> Bool # (/=) :: ConstructorInfo -> ConstructorInfo -> Bool # | |
| Eq ConstructorVariant | |
Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorVariant -> ConstructorVariant -> Bool # (/=) :: ConstructorVariant -> ConstructorVariant -> Bool # | |
| Eq DatatypeInfo | |
Defined in Language.Haskell.TH.Datatype | |
| Eq DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeVariant -> DatatypeVariant -> Bool # (/=) :: DatatypeVariant -> DatatypeVariant -> Bool # | |
| Eq FieldStrictness | |
Defined in Language.Haskell.TH.Datatype Methods (==) :: FieldStrictness -> FieldStrictness -> Bool # (/=) :: FieldStrictness -> FieldStrictness -> Bool # | |
| Eq Strictness | |
Defined in Language.Haskell.TH.Datatype | |
| Eq Unpackedness | |
Defined in Language.Haskell.TH.Datatype | |
| Eq DClause | |
| Eq DCon | |
| Eq DConFields | |
Defined in Language.Haskell.TH.Desugar.AST | |
| Eq DDec | |
| Eq DDerivClause | |
Defined in Language.Haskell.TH.Desugar.AST | |
| Eq DDerivStrategy | |
Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDerivStrategy -> DDerivStrategy -> Bool # (/=) :: DDerivStrategy -> DDerivStrategy -> Bool # | |
| Eq DExp | |
| Eq DFamilyResultSig | |
Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DFamilyResultSig -> DFamilyResultSig -> Bool # (/=) :: DFamilyResultSig -> DFamilyResultSig -> Bool # | |
| Eq DForallTelescope | |
Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DForallTelescope -> DForallTelescope -> Bool # (/=) :: DForallTelescope -> DForallTelescope -> Bool # | |
| Eq DForeign | |
| Eq DInfo | |
| Eq DLetDec | |
| Eq DMatch | |
| Eq DPat | |
| Eq DPatSynDir | |
Defined in Language.Haskell.TH.Desugar.AST | |
| Eq DPragma | |
| Eq DRuleBndr | |
| Eq DTySynEqn | |
| Eq DType | |
| Eq DTypeFamilyHead | |
Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool # (/=) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool # | |
| Eq NewOrData | |
| Eq DFunArgs | |
| Eq DTypeArg | |
| Eq DVisFunArg | |
Defined in Language.Haskell.TH.Desugar.Core | |
| Eq UTCTime | |
| Eq LocalTime | |
| Eq Undefined | |
| Eq UUID | |
| Eq UnpackedUUID | |
| Eq Integer | |
| Eq Natural | |
| Eq () | |
| Eq Bool | |
| Eq Char | |
| Eq Double | Note that due to the presence of
Also note that
|
| Eq Float | Note that due to the presence of
Also note that
|
| Eq Int | |
| Eq Word | |
| () :=> (Eq (a :- b)) | |
| () :=> (Eq (Dict a)) | |
| () :=> (Eq Integer) | |
| () :=> (Eq Natural) | |
| () :=> (Eq ()) | |
Defined in Data.Constraint | |
| () :=> (Eq Bool) | |
| () :=> (Eq Double) | |
| () :=> (Eq Float) | |
| () :=> (Eq Int) | |
| () :=> (Eq Word) | |
| Class () (Eq a) | |
Defined in Data.Constraint | |
| Eq a => Eq (First' a) | |
| Eq a => Eq (Last' a) | |
| Eq a => Eq (Option' a) | |
| Eq a => Eq (Only a) | |
| Eq v => Eq (KeyMap v) | |
| Eq a => Eq (IResult a) | |
| Eq a => Eq (Result a) | |
| Eq a => Eq (ZipList a) | Since: base-4.7.0.0 |
| Eq (MutableByteArray s) | Since: base-4.17.0.0 |
Defined in Data.Array.Byte Methods (==) :: MutableByteArray s -> MutableByteArray s -> Bool # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool # | |
| Eq a => Eq (Complex a) | Since: base-2.1 |
| Eq a => Eq (Identity a) | Since: base-4.8.0.0 |
| Eq a => Eq (First a) | Since: base-2.1 |
| Eq a => Eq (Last a) | Since: base-2.1 |
| Eq a => Eq (Down a) | Since: base-4.6.0.0 |
| Eq a => Eq (First a) | Since: base-4.9.0.0 |
| Eq a => Eq (Last a) | Since: base-4.9.0.0 |
| Eq a => Eq (Max a) | Since: base-4.9.0.0 |
| Eq a => Eq (Min a) | Since: base-4.9.0.0 |
| Eq m => Eq (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
| Eq a => Eq (Dual a) | Since: base-2.1 |
| Eq a => Eq (Product a) | Since: base-2.1 |
| Eq a => Eq (Sum a) | Since: base-2.1 |
| Eq (TVar a) | Since: base-4.8.0.0 |
| Eq p => Eq (Par1 p) | Since: base-4.7.0.0 |
| Eq (IORef a) | Pointer equality. Since: base-4.0.0.0 |
| Eq (MVar a) | Since: base-4.1.0.0 |
| Eq (FunPtr a) | |
| Eq (Ptr a) | Since: base-2.1 |
| Eq a => Eq (Ratio a) | Since: base-2.1 |
| Eq (Bits n) | |
| (PrimType ty, Eq ty) => Eq (Block ty) | |
| Eq (Zn n) | |
| Eq (Zn64 n) | |
| Eq a => Eq (Array a) | |
| Eq a => Eq (NonEmpty a) | |
| Eq (CountOf ty) | |
| Eq (Offset ty) | |
| (PrimType ty, Eq ty) => Eq (UArray ty) | |
| Eq (Dict a) | |
| Eq vertex => Eq (SCC vertex) | Since: containers-0.5.9 |
| Eq a => Eq (IntMap a) | |
| Eq a => Eq (Seq a) | |
| Eq a => Eq (ViewL a) | |
| Eq a => Eq (ViewR a) | |
| Eq a => Eq (Intersection a) | |
Defined in Data.Set.Internal Methods (==) :: Intersection a -> Intersection a -> Bool # (/=) :: Intersection a -> Intersection a -> Bool # | |
| Eq a => Eq (Set a) | |
| Eq a => Eq (Tree a) | |
| Eq a => Eq (CryptoFailable a) | |
Defined in Crypto.Error.Types Methods (==) :: CryptoFailable a -> CryptoFailable a -> Bool # (/=) :: CryptoFailable a -> CryptoFailable a -> Bool # | |
| Eq (Digest a) | |
| Eq1 f => Eq (Fix f) | |
| (Functor f, Eq1 f) => Eq (Mu f) | |
| (Functor f, Eq1 f) => Eq (Nu f) | |
| Eq a => Eq (DNonEmpty a) | |
| Eq a => Eq (DList a) | |
| Eq (Finite n) | |
| Eq (Binary p) | |
| Eq (Prime p) | |
| Eq a => Eq (Hashed a) | Uses precomputed hash to detect inequality faster |
| Eq (Affine a) | |
| Eq (Point a) | |
| Eq (PublicKey c) | |
| Eq a => Eq (OpenChestT a) Source # | |
Defined in Lorentz.Bytes | |
| Eq (Packed a) Source # | |
| Eq (CustomErrorRep tag) => Eq (CustomError tag) Source # | |
Defined in Lorentz.Errors Methods (==) :: CustomError tag -> CustomError tag -> Bool # (/=) :: CustomError tag -> CustomError tag -> Bool # | |
| Eq r => Eq (VoidResult r) Source # | |
Defined in Lorentz.Macro | |
| Eq a => Eq (Range a) Source # | |
| Eq a => Eq (RangeEE a) Source # | |
| Eq a => Eq (RangeEI a) Source # | |
| Eq a => Eq (RangeIE a) Source # | |
| Eq (UParam entries) Source # | |
| Eq a => Eq (ReadTicket a) Source # | |
Defined in Lorentz.Value | |
| Eq e => Eq (ErrorFancy e) | |
Defined in Text.Megaparsec.Error | |
| Eq t => Eq (ErrorItem t) | |
| Eq s => Eq (PosState s) | |
| Eq (Mod m) | |
| Eq (Exp x) => Eq (FromExpError x) | |
| ExpAllExtrasConstrainted Eq x => Eq (Exp x) | |
| Eq (Exp x) => Eq (MichelinePrimAp x) | |
| Eq a => Eq (StringEncode a) | |
| Eq a => Eq (ViewsSetF a) | |
| Eq ext => Eq (MichelsonFailed ext) | |
| Eq ext => Eq (MichelsonFailureWithStack ext) | |
| Eq op => Eq (ParsedSeq op) | |
| Eq op => Eq (TCOpSeq op) | |
| Eq op => Eq (TcError' op) | |
| Eq op => Eq (IllTypedInstr op) | |
| Eq op => Eq (TypeCheckedOp op) | |
| Eq (HST ts) | |
| Eq (AnnotatedValue v) | |
| (Eq r, Eq (Anns rs)) => Eq (Anns (r ': rs)) | |
| Eq (Anns ('[] :: [Type])) | |
| Eq (Notes t) | |
| Eq (ParamNotes t) | |
| Eq (SomeEntrypointCallT arg) | |
| Eq (ContractRef arg) | |
Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool # | |
| Eq arg => Eq (Ticket arg) | |
| Eq (PrintComment st) | |
| Eq (StackRef st) | |
| Eq (SingT x) | |
| Eq (Operation' instr) | |
| (forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (SomeViewsSet' instr) | |
| Eq op => Eq (Contract' op) | |
| Eq op => Eq (ContractBlock op) | |
| Eq op => Eq (View' op) | |
| Eq instr => Eq (ViewsSet instr) | |
| Eq (KindedAddress kind) | |
| Eq (Hash kind) | |
| Eq (HashTag kind) | |
| Eq (Label name) | |
| Eq a => Eq (MismatchError a) | |
| Eq (SingNat n) | |
| Eq (PeanoNatural n) | |
| Eq a => Eq (All a) | |
| Eq a => Eq (Any a) | |
| Eq a => Eq (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool # | |
| Eq (Doc a) | |
| Eq a => Eq (Span a) | |
| Eq ann => Eq (SimpleDocStream ann) | |
Defined in Prettyprinter.Internal Methods (==) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (/=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # | |
| Eq a => Eq (Array a) | |
| Eq (MutableByteArray s) | |
Defined in Data.Primitive.ByteArray Methods (==) :: MutableByteArray s -> MutableByteArray s -> Bool # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool # | |
| (Eq a, Prim a) => Eq (PrimArray a) | Since: primitive-0.6.4.0 |
| Eq a => Eq (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
| Eq g => Eq (StateGen g) | |
| Eq g => Eq (AtomicGen g) | |
| Eq g => Eq (IOGen g) | |
| Eq g => Eq (STGen g) | |
| Eq g => Eq (TGen g) | |
| Eq a => Eq (Add a) | |
| Eq (IntSetOf a) | |
| Eq a => Eq (Mul a) | |
| Eq a => Eq (WrappedNum a) | |
Defined in Data.Semiring | |
| Eq a => Eq (Maybe a) | |
| Eq flag => Eq (TyVarBndr flag) | |
| Eq flag => Eq (DTyVarBndr flag) | |
Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTyVarBndr flag -> DTyVarBndr flag -> Bool # (/=) :: DTyVarBndr flag -> DTyVarBndr flag -> Bool # | |
| Eq a => Eq (HashSet a) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| Eq a => Eq (Vector a) | |
| (Prim a, Eq a) => Eq (Vector a) | |
| (Storable a, Eq a) => Eq (Vector a) | |
| Eq t => Eq (ElField '(s, t)) | |
| Eq a => Eq (Identity a) | |
| Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0 |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Eq a => Eq (a) | |
| Eq a => Eq [a] | |
| (Eq a) :=> (Eq (Complex a)) | |
| (Eq a) :=> (Eq (Const a b)) | |
| (Eq a) :=> (Eq (Identity a)) | |
| (Eq a) :=> (Eq (Ratio a)) | |
| (Eq a) :=> (Eq (Maybe a)) | |
| (Eq a) :=> (Eq [a]) | |
| Class (Eq a) (Bits a) | |
| Class (Eq a) (Ord a) | |
| Eq a => Eq (WrapWord a n) | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| Eq (Fixed a) | Since: base-2.1 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Eq a => Eq (Arg a b) | Since: base-4.9.0.0 |
| Eq (TypeRep a) | Since: base-2.1 |
| Eq (U1 p) | Since: base-4.9.0.0 |
| Eq (V1 p) | Since: base-4.9.0.0 |
| Eq a => Eq (ListN n a) | |
| (Eq a, Eq b) => Eq (Bimap a b) | |
| Eq (a :- b) | Assumes |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Eq1 f, Eq a) => Eq (Cofree f a) | |
| (Eq1 f, Eq a) => Eq (Free f a) | |
| Eq k => Eq (Extension p k) | |
| Eq k => Eq (RootsOfUnity n k) | |
Defined in Data.Field.Galois.Unity Methods (==) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (/=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # | |
| Eq (Signature c m) | |
| (Eq1 f, Eq a) => Eq (Yoneda f a) | |
| Eq (TAddress p vd) Source # | |
| Eq (inp :-> out) Source # | |
| Eq (ContractCode cp st) Source # | |
Defined in Lorentz.Base Methods (==) :: ContractCode cp st -> ContractCode cp st -> Bool # (/=) :: ContractCode cp st -> ContractCode cp st -> Bool # | |
| Eq (Hash alg a) Source # | |
| Eq (NFixed p) Source # | |
| Eq (Extensible x) Source # | |
Defined in Lorentz.Extensible | |
| Eq (WrappedLambda i o) Source # | |
Defined in Lorentz.Lambda Methods (==) :: WrappedLambda i o -> WrappedLambda i o -> Bool # (/=) :: WrappedLambda i o -> WrappedLambda i o -> Bool # | |
| Eq a => Eq (View_ a r) Source # | |
| (Eq a, Eq b) => Eq (ZippedStackRepr a b) Source # | |
Defined in Lorentz.Zip Methods (==) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool # (/=) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool # | |
| (Eq (Token s), Eq e) => Eq (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods (==) :: ParseError s e -> ParseError s e -> Bool # (/=) :: ParseError s e -> ParseError s e -> Bool # | |
| (Eq s, Eq (Token s), Eq e) => Eq (ParseErrorBundle s e) | |
Defined in Text.Megaparsec.Error Methods (==) :: ParseErrorBundle s e -> ParseErrorBundle s e -> Bool # (/=) :: ParseErrorBundle s e -> ParseErrorBundle s e -> Bool # | |
| (Eq (ParseError s e), Eq s) => Eq (State s e) | |
| Eq (NoStkElMeta t) | |
| Eq (meta t) => Eq (StkEl meta t) | |
| (Eq n, Eq m) => Eq (ArithError n m) | |
| Eq (EntrypointCallT param arg) | |
| Eq (EpLiftSequence arg param) | |
| Eq (Emit instr t) | |
| Eq (TransferTokens instr p) | |
| Eq (Value' instr t) | |
| (forall (arg :: T) (ret :: T). Eq (ViewCode' instr arg st ret)) => Eq (SomeView' instr st) | |
| (forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (ViewsSet' instr st) | |
| Eq (Annotation tag) | |
| (Eq e, Eq a) => Eq (Validation e a) | |
| Eq (f op) => Eq (ExtInstrAbstract f op) | |
| Eq (f op) => Eq (TestAssert f op) | |
| (Eq op, Eq (f op)) => Eq (InstrAbstract f op) | |
| (Eq a, Eq b) => Eq (Bimap a b) | |
| Eq a => Eq (SizedList' n a) | |
| Eq (v a) => Eq (Poly v a) | |
| Eq (MutableArray s a) | |
Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool # (/=) :: MutableArray s a -> MutableArray s a -> Bool # | |
| Eq (MutablePrimArray s a) | |
Defined in Data.Primitive.PrimArray Methods (==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # (/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # | |
| Eq (SmallMutableArray s a) | |
Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # | |
| Eq v => Eq (IntMapOf k v) | |
| GEq tag => Eq (Some tag) | |
| (Eq a, Eq b) => Eq (Either a b) | |
| (Eq a, Eq b) => Eq (These a b) | |
| (Eq a, Eq b) => Eq (Pair a b) | |
| (Eq a, Eq b) => Eq (These a b) | |
| (Eq1 m, Eq a) => Eq (MaybeT m a) | |
| (Eq k, Eq v) => Eq (HashMap k v) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| (Eq k, Eq v) => Eq (Leaf k v) | |
| (Eq a, Eq b) => Eq (a, b) | |
| (Eq a, Eq b) :=> (Eq (Either a b)) | |
| (Eq a, Eq b) :=> (Eq (a, b)) | |
| Eq a => Eq (Const a b) | Since: base-4.9.0.0 |
| Eq (f a) => Eq (Ap f a) | Since: base-4.12.0.0 |
| Eq (f a) => Eq (Alt f a) | Since: base-4.8.0.0 |
| Eq (a :~: b) | Since: base-4.7.0.0 |
| Eq (OrderingI a b) | |
| Eq (f p) => Eq (Rec1 f p) | Since: base-4.7.0.0 |
| Eq (URec (Ptr ()) p) | Since: base-4.9.0.0 |
| Eq (URec Char p) | Since: base-4.9.0.0 |
| Eq (URec Double p) | Since: base-4.9.0.0 |
| Eq (URec Float p) | |
| Eq (URec Int p) | Since: base-4.9.0.0 |
| Eq (URec Word p) | Since: base-4.9.0.0 |
| Eq (p (Fix p a) a) => Eq (Fix p a) | |
| Eq (p a a) => Eq (Join p a) | |
| (Eq a, Eq (f b)) => Eq (CofreeF f a b) | |
| Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a) | |
| (Eq a, Eq (f b)) => Eq (FreeF f a b) | |
| (Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a) | |
| Eq (Contract cp st vd) Source # | |
| (forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (Contract' instr cp st) | |
| Eq (instr (ContractInp cp st) (ContractOut st)) => Eq (ContractCode' instr cp st) | |
| Eq (CreateContract instr cp st) | |
| Eq (LambdaCode' instr inp out) | |
| Eq (f op) => Eq (Elt f op) | |
| Eq (f op) => Eq (Value' f op) | |
| GEq f => Eq (Constrained c f) | |
| Eq (v (Vector n Word, a)) => Eq (MultiPoly v n a) | |
| Eq (GOrdering a b) | |
| Eq b => Eq (Tagged s b) | |
| (Eq (f a), Eq (g a), Eq a) => Eq (These1 f g a) | |
| (Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) | |
| (Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) | |
| (Eq1 f, Eq a) => Eq (IdentityT f a) | |
| (RPureConstrained (IndexableField rs) rs, RecApplicative rs, Eq (Rec f rs)) => Eq (ARec f rs) | |
| (Eq (f r), Eq (Rec f rs)) => Eq (Rec f (r ': rs)) | |
| Eq (Rec f ('[] :: [u])) | |
| Eq a => Eq (Const a b) | |
| (Eq a, Eq b, Eq c) => Eq (a, b, c) | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Product f g a) | Since: base-4.9.0.0 |
| (Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a) | Since: base-4.9.0.0 |
| Eq (a :~~: b) | Since: base-4.10.0.0 |
| (Eq (f p), Eq (g p)) => Eq ((f :*: g) p) | Since: base-4.7.0.0 |
| (Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | Since: base-4.7.0.0 |
| Eq c => Eq (K1 i c p) | Since: base-4.7.0.0 |
| Eq (instr i o) => Eq (RemFail instr i o) | |
| Eq (ViewCode' instr arg st ret) => Eq (View' instr arg st ret) | |
| (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a) | Since: base-4.9.0.0 |
| Eq (f (g p)) => Eq ((f :.: g) p) | Since: base-4.7.0.0 |
| Eq (f p) => Eq (M1 i c f p) | Since: base-4.7.0.0 |
| Eq (f a) => Eq (Clown f a b) | |
| Eq (p b a) => Eq (Flip p a b) | |
| Eq (g b) => Eq (Joker g a b) | |
| Eq (p a b) => Eq (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods (==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # | |
| (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) | |
| (Eq (f a b), Eq (g a b)) => Eq (Product f g a b) | |
| (Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) | |
| Eq (f (p a b)) => Eq (Tannen f p a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) | |
| Eq (p (f a) (g b)) => Eq (Biff p f g a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
Ord, as defined by the Haskell report, implements a total order and has the
following properties:
- Comparability
x <= y || y <= x=True- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
The following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Note that (7.) and (8.) do not require min and max to return either of
their arguments. The result is merely required to equal one of the
arguments in terms of (==).
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Instances
| Ord CabalSpecVersion | |
Defined in Distribution.CabalSpecVersion Methods compare :: CabalSpecVersion -> CabalSpecVersion -> Ordering # (<) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (<=) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (>) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (>=) :: CabalSpecVersion -> CabalSpecVersion -> Bool # max :: CabalSpecVersion -> CabalSpecVersion -> CabalSpecVersion # min :: CabalSpecVersion -> CabalSpecVersion -> CabalSpecVersion # | |
| Ord Position | |
Defined in Distribution.Parsec.Position | |
| Ord PWarnType | |
| Ord Structure | |
| Ord Extension | |
| Ord KnownExtension | |
Defined in Language.Haskell.Extension Methods compare :: KnownExtension -> KnownExtension -> Ordering # (<) :: KnownExtension -> KnownExtension -> Bool # (<=) :: KnownExtension -> KnownExtension -> Bool # (>) :: KnownExtension -> KnownExtension -> Bool # (>=) :: KnownExtension -> KnownExtension -> Bool # max :: KnownExtension -> KnownExtension -> KnownExtension # min :: KnownExtension -> KnownExtension -> KnownExtension # | |
| Ord Key | |
| Ord DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods compare :: DotNetTime -> DotNetTime -> Ordering # (<) :: DotNetTime -> DotNetTime -> Bool # (<=) :: DotNetTime -> DotNetTime -> Bool # (>) :: DotNetTime -> DotNetTime -> Bool # (>=) :: DotNetTime -> DotNetTime -> Bool # max :: DotNetTime -> DotNetTime -> DotNetTime # min :: DotNetTime -> DotNetTime -> DotNetTime # | |
| Ord JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods compare :: JSONPathElement -> JSONPathElement -> Ordering # (<) :: JSONPathElement -> JSONPathElement -> Bool # (<=) :: JSONPathElement -> JSONPathElement -> Bool # (>) :: JSONPathElement -> JSONPathElement -> Bool # (>=) :: JSONPathElement -> JSONPathElement -> Bool # max :: JSONPathElement -> JSONPathElement -> JSONPathElement # min :: JSONPathElement -> JSONPathElement -> JSONPathElement # | |
| Ord Value | The ordering is total, consistent with Since: aeson-1.5.2.0 |
| Ord Pos | |
| Ord ByteArray | Non-lexicographic ordering. This compares the lengths of the byte arrays first and uses a lexicographic ordering if the lengths are equal. Subject to change between major versions. @since 4.17.0.0 |
| Ord All | Since: base-2.1 |
| Ord Any | Since: base-2.1 |
| Ord SomeTypeRep | |
Defined in Data.Typeable.Internal Methods compare :: SomeTypeRep -> SomeTypeRep -> Ordering # (<) :: SomeTypeRep -> SomeTypeRep -> Bool # (<=) :: SomeTypeRep -> SomeTypeRep -> Bool # (>) :: SomeTypeRep -> SomeTypeRep -> Bool # (>=) :: SomeTypeRep -> SomeTypeRep -> Bool # max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep # min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep # | |
| Ord Version | Since: base-2.1 |
| Ord Void | Since: base-4.8.0.0 |
| Ord BlockReason | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync Methods compare :: BlockReason -> BlockReason -> Ordering # (<) :: BlockReason -> BlockReason -> Bool # (<=) :: BlockReason -> BlockReason -> Bool # (>) :: BlockReason -> BlockReason -> Bool # (>=) :: BlockReason -> BlockReason -> Bool # max :: BlockReason -> BlockReason -> BlockReason # min :: BlockReason -> BlockReason -> BlockReason # | |
| Ord ThreadId | Since: base-4.2.0.0 |
Defined in GHC.Conc.Sync | |
| Ord ThreadStatus | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync Methods compare :: ThreadStatus -> ThreadStatus -> Ordering # (<) :: ThreadStatus -> ThreadStatus -> Bool # (<=) :: ThreadStatus -> ThreadStatus -> Bool # (>) :: ThreadStatus -> ThreadStatus -> Bool # (>=) :: ThreadStatus -> ThreadStatus -> Bool # max :: ThreadStatus -> ThreadStatus -> ThreadStatus # min :: ThreadStatus -> ThreadStatus -> ThreadStatus # | |
| Ord ErrorCall | Since: base-4.7.0.0 |
| Ord ArithException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods compare :: ArithException -> ArithException -> Ordering # (<) :: ArithException -> ArithException -> Bool # (<=) :: ArithException -> ArithException -> Bool # (>) :: ArithException -> ArithException -> Bool # (>=) :: ArithException -> ArithException -> Bool # max :: ArithException -> ArithException -> ArithException # min :: ArithException -> ArithException -> ArithException # | |
| Ord Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # max :: Associativity -> Associativity -> Associativity # min :: Associativity -> Associativity -> Associativity # | |
| Ord DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
| Ord Fixity | Since: base-4.6.0.0 |
| Ord SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
| Ord SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
| Ord ArrayException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # max :: ArrayException -> ArrayException -> ArrayException # min :: ArrayException -> ArrayException -> ArrayException # | |
| Ord AsyncException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # max :: AsyncException -> AsyncException -> AsyncException # min :: AsyncException -> AsyncException -> AsyncException # | |
| Ord ExitCode | |
Defined in GHC.IO.Exception | |
| Ord BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
| Ord Newline | Since: base-4.3.0.0 |
| Ord NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types Methods compare :: NewlineMode -> NewlineMode -> Ordering # (<) :: NewlineMode -> NewlineMode -> Bool # (<=) :: NewlineMode -> NewlineMode -> Bool # (>) :: NewlineMode -> NewlineMode -> Bool # (>=) :: NewlineMode -> NewlineMode -> Bool # max :: NewlineMode -> NewlineMode -> NewlineMode # min :: NewlineMode -> NewlineMode -> NewlineMode # | |
| Ord IOMode | Since: base-4.2.0.0 |
| Ord Int16 | Since: base-2.1 |
| Ord Int32 | Since: base-2.1 |
| Ord Int64 | Since: base-2.1 |
| Ord Int8 | Since: base-2.1 |
| Ord SomeChar | |
Defined in GHC.TypeLits | |
| Ord SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits Methods compare :: SomeSymbol -> SomeSymbol -> Ordering # (<) :: SomeSymbol -> SomeSymbol -> Bool # (<=) :: SomeSymbol -> SomeSymbol -> Bool # (>) :: SomeSymbol -> SomeSymbol -> Bool # (>=) :: SomeSymbol -> SomeSymbol -> Bool # max :: SomeSymbol -> SomeSymbol -> SomeSymbol # min :: SomeSymbol -> SomeSymbol -> SomeSymbol # | |
| Ord SomeNat | Since: base-4.7.0.0 |
| Ord GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode Methods compare :: GeneralCategory -> GeneralCategory -> Ordering # (<) :: GeneralCategory -> GeneralCategory -> Bool # (<=) :: GeneralCategory -> GeneralCategory -> Bool # (>) :: GeneralCategory -> GeneralCategory -> Bool # (>=) :: GeneralCategory -> GeneralCategory -> Bool # max :: GeneralCategory -> GeneralCategory -> GeneralCategory # min :: GeneralCategory -> GeneralCategory -> GeneralCategory # | |
| Ord Word16 | Since: base-2.1 |
| Ord Word32 | Since: base-2.1 |
| Ord Word64 | Since: base-2.1 |
| Ord Word8 | Since: base-2.1 |
| Ord Alphabet | |
Defined in Data.ByteString.Base58.Internal | |
| Ord Encoding | |
Defined in Basement.String | |
| Ord UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 Methods compare :: UTF32_Invalid -> UTF32_Invalid -> Ordering # (<) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (<=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # | |
| Ord AsciiString | |
Defined in Basement.Types.AsciiString Methods compare :: AsciiString -> AsciiString -> Ordering # (<) :: AsciiString -> AsciiString -> Bool # (<=) :: AsciiString -> AsciiString -> Bool # (>) :: AsciiString -> AsciiString -> Bool # (>=) :: AsciiString -> AsciiString -> Bool # max :: AsciiString -> AsciiString -> AsciiString # min :: AsciiString -> AsciiString -> AsciiString # | |
| Ord Char7 | |
| Ord FileSize | |
Defined in Basement.Types.OffsetSize | |
| Ord String | |
| Ord F2Poly | |
| Ord Bit | |
| Ord ByteString | |
Defined in Data.ByteString.Internal.Type Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString # | |
| Ord ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString # | |
| Ord ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods compare :: ShortByteString -> ShortByteString -> Ordering # (<) :: ShortByteString -> ShortByteString -> Bool # (<=) :: ShortByteString -> ShortByteString -> Bool # (>) :: ShortByteString -> ShortByteString -> Bool # (>=) :: ShortByteString -> ShortByteString -> Bool # max :: ShortByteString -> ShortByteString -> ShortByteString # min :: ShortByteString -> ShortByteString -> ShortByteString # | |
| Ord IntSet | |
| Ord BigNat | |
| Ord Extension | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Ord TyCon | |
| Ord DefName | |
Defined in Control.Lens.Internal.FieldTH | |
| Ord DHashAlgorithm Source # | |
Defined in Lorentz.Bytes Methods compare :: DHashAlgorithm -> DHashAlgorithm -> Ordering # (<) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (<=) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (>) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (>=) :: DHashAlgorithm -> DHashAlgorithm -> Bool # max :: DHashAlgorithm -> DHashAlgorithm -> DHashAlgorithm # min :: DHashAlgorithm -> DHashAlgorithm -> DHashAlgorithm # | |
| Ord DViewDesc Source # | |
| Ord DError Source # | |
| Ord DDescribeErrorTagMap Source # | |
Defined in Lorentz.Errors.Numeric.Doc Methods compare :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Ordering # (<) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (<=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (>) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (>=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # max :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> DDescribeErrorTagMap # min :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> DDescribeErrorTagMap # | |
| Ord Never Source # | |
| Ord Pos | |
| Ord SourcePos | |
| Ord MichelinePrimitive | |
Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods compare :: MichelinePrimitive -> MichelinePrimitive -> Ordering # (<) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (<=) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (>) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (>=) :: MichelinePrimitive -> MichelinePrimitive -> Bool # max :: MichelinePrimitive -> MichelinePrimitive -> MichelinePrimitive # min :: MichelinePrimitive -> MichelinePrimitive -> MichelinePrimitive # | |
| Ord TezosMutez | |
Defined in Morley.Micheline.Json | |
| Ord DocItemId | |
| Ord DocItemPos | |
Defined in Morley.Michelson.Doc Methods compare :: DocItemPos -> DocItemPos -> Ordering # (<) :: DocItemPos -> DocItemPos -> Bool # (<=) :: DocItemPos -> DocItemPos -> Bool # (>) :: DocItemPos -> DocItemPos -> Bool # (>=) :: DocItemPos -> DocItemPos -> Bool # max :: DocItemPos -> DocItemPos -> DocItemPos # min :: DocItemPos -> DocItemPos -> DocItemPos # | |
| Ord SomeDocDefinitionItem | |
Defined in Morley.Michelson.Doc Methods compare :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Ordering # (<) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (<=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (>) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (>=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # max :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> SomeDocDefinitionItem # min :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> SomeDocDefinitionItem # | |
| Ord ErrorSrcPos | |
Defined in Morley.Michelson.ErrorPos | |
| Ord Pos | |
| Ord SrcPos | |
| Ord BadViewNameError | |
Defined in Morley.Michelson.Internal.ViewName Methods compare :: BadViewNameError -> BadViewNameError -> Ordering # (<) :: BadViewNameError -> BadViewNameError -> Bool # (<=) :: BadViewNameError -> BadViewNameError -> Bool # (>) :: BadViewNameError -> BadViewNameError -> Bool # (>=) :: BadViewNameError -> BadViewNameError -> Bool # max :: BadViewNameError -> BadViewNameError -> BadViewNameError # min :: BadViewNameError -> BadViewNameError -> BadViewNameError # | |
| Ord ViewName | |
Defined in Morley.Michelson.Internal.ViewName | |
| Ord RemainingSteps | |
Defined in Morley.Michelson.Interpret Methods compare :: RemainingSteps -> RemainingSteps -> Ordering # (<) :: RemainingSteps -> RemainingSteps -> Bool # (<=) :: RemainingSteps -> RemainingSteps -> Bool # (>) :: RemainingSteps -> RemainingSteps -> Bool # (>=) :: RemainingSteps -> RemainingSteps -> Bool # | |
| Ord OptimizationStage | |
Defined in Morley.Michelson.Optimizer.Internal.Ruleset Methods compare :: OptimizationStage -> OptimizationStage -> Ordering # (<) :: OptimizationStage -> OptimizationStage -> Bool # (<=) :: OptimizationStage -> OptimizationStage -> Bool # (>) :: OptimizationStage -> OptimizationStage -> Bool # (>=) :: OptimizationStage -> OptimizationStage -> Bool # max :: OptimizationStage -> OptimizationStage -> OptimizationStage # min :: OptimizationStage -> OptimizationStage -> OptimizationStage # | |
| Ord CustomParserException | |
Defined in Morley.Michelson.Parser.Error Methods compare :: CustomParserException -> CustomParserException -> Ordering # (<) :: CustomParserException -> CustomParserException -> Bool # (<=) :: CustomParserException -> CustomParserException -> Bool # (>) :: CustomParserException -> CustomParserException -> Bool # (>=) :: CustomParserException -> CustomParserException -> Bool # max :: CustomParserException -> CustomParserException -> CustomParserException # min :: CustomParserException -> CustomParserException -> CustomParserException # | |
| Ord StringLiteralParserException | |
Defined in Morley.Michelson.Parser.Error Methods compare :: StringLiteralParserException -> StringLiteralParserException -> Ordering # (<) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (<=) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (>) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (>=) :: StringLiteralParserException -> StringLiteralParserException -> Bool # max :: StringLiteralParserException -> StringLiteralParserException -> StringLiteralParserException # min :: StringLiteralParserException -> StringLiteralParserException -> StringLiteralParserException # | |
| Ord MText | |
| Ord Nesting | |
Defined in Morley.Michelson.TypeCheck.TypeCheckedOp | |
| Ord MutezArithErrorType | |
Defined in Morley.Michelson.Typed.Arith Methods compare :: MutezArithErrorType -> MutezArithErrorType -> Ordering # (<) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (<=) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (>) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (>=) :: MutezArithErrorType -> MutezArithErrorType -> Bool # max :: MutezArithErrorType -> MutezArithErrorType -> MutezArithErrorType # min :: MutezArithErrorType -> MutezArithErrorType -> MutezArithErrorType # | |
| Ord ShiftArithErrorType | |
Defined in Morley.Michelson.Typed.Arith Methods compare :: ShiftArithErrorType -> ShiftArithErrorType -> Ordering # (<) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (<=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (>) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (>=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # max :: ShiftArithErrorType -> ShiftArithErrorType -> ShiftArithErrorType # min :: ShiftArithErrorType -> ShiftArithErrorType -> ShiftArithErrorType # | |
| Ord EpAddress | |
Defined in Morley.Michelson.Typed.Entrypoints | |
| Ord DStorageType | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| Ord DType | |
| Ord OperationHash | |
Defined in Morley.Michelson.Typed.Operation Methods compare :: OperationHash -> OperationHash -> Ordering # (<) :: OperationHash -> OperationHash -> Bool # (<=) :: OperationHash -> OperationHash -> Bool # (>) :: OperationHash -> OperationHash -> Bool # (>=) :: OperationHash -> OperationHash -> Bool # | |
| Ord EntriesOrder | |
Defined in Morley.Michelson.Untyped.Contract | |
| Ord Entry | |
| Ord EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints | |
| Ord HandleImplicitDefaultEp | |
Defined in Morley.Michelson.Untyped.Entrypoints Methods compare :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Ordering # (<) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool # (<=) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool # (>) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool # (>=) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool # max :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> HandleImplicitDefaultEp # min :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> HandleImplicitDefaultEp # | |
| Ord Var | |
| Ord AddressKind | |
Defined in Morley.Tezos.Address.Kinds | |
| Ord ChainId | |
| Ord Mutez | |
| Ord Timestamp | |
| Ord KeyType | |
| Ord PublicKey | |
| Ord Signature | |
| Ord PublicKey | |
| Ord Bls12381Fr | |
Defined in Morley.Tezos.Crypto.BLS12381 Methods compare :: Bls12381Fr -> Bls12381Fr -> Ordering # (<) :: Bls12381Fr -> Bls12381Fr -> Bool # (<=) :: Bls12381Fr -> Bls12381Fr -> Bool # (>) :: Bls12381Fr -> Bls12381Fr -> Bool # (>=) :: Bls12381Fr -> Bls12381Fr -> Bool # max :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # min :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # | |
| Ord PublicKey | |
| Ord PublicKey | |
| Ord PublicKey | |
| Ord HexJSONByteString | |
Defined in Morley.Util.ByteString Methods compare :: HexJSONByteString -> HexJSONByteString -> Ordering # (<) :: HexJSONByteString -> HexJSONByteString -> Bool # (<=) :: HexJSONByteString -> HexJSONByteString -> Bool # (>) :: HexJSONByteString -> HexJSONByteString -> Bool # (>=) :: HexJSONByteString -> HexJSONByteString -> Bool # max :: HexJSONByteString -> HexJSONByteString -> HexJSONByteString # min :: HexJSONByteString -> HexJSONByteString -> HexJSONByteString # | |
| Ord Word62 | |
| Ord Word63 | |
| Ord ArgPolicy | |
| Ord OptName | |
Defined in Options.Applicative.Types | |
| Ord OptVisibility | |
Defined in Options.Applicative.Types Methods compare :: OptVisibility -> OptVisibility -> Ordering # (<) :: OptVisibility -> OptVisibility -> Bool # (<=) :: OptVisibility -> OptVisibility -> Bool # (>) :: OptVisibility -> OptVisibility -> Bool # (>=) :: OptVisibility -> OptVisibility -> Bool # max :: OptVisibility -> OptVisibility -> OptVisibility # min :: OptVisibility -> OptVisibility -> OptVisibility # | |
| Ord FusionDepth | |
Defined in Prettyprinter.Internal Methods compare :: FusionDepth -> FusionDepth -> Ordering # (<) :: FusionDepth -> FusionDepth -> Bool # (<=) :: FusionDepth -> FusionDepth -> Bool # (>) :: FusionDepth -> FusionDepth -> Bool # (>=) :: FusionDepth -> FusionDepth -> Bool # max :: FusionDepth -> FusionDepth -> FusionDepth # min :: FusionDepth -> FusionDepth -> FusionDepth # | |
| Ord LayoutOptions | |
Defined in Prettyprinter.Internal Methods compare :: LayoutOptions -> LayoutOptions -> Ordering # (<) :: LayoutOptions -> LayoutOptions -> Bool # (<=) :: LayoutOptions -> LayoutOptions -> Bool # (>) :: LayoutOptions -> LayoutOptions -> Bool # (>=) :: LayoutOptions -> LayoutOptions -> Bool # max :: LayoutOptions -> LayoutOptions -> LayoutOptions # min :: LayoutOptions -> LayoutOptions -> LayoutOptions # | |
| Ord PageWidth | |
| Ord ByteArray | Non-lexicographic ordering. This compares the lengths of the byte arrays first and uses a lexicographic ordering if the lengths are equal. Subject to change between major versions. Since: primitive-0.6.3.0 |
| Ord Scientific | Scientific numbers can be safely compared for ordering. No magnitude |
Defined in Data.Scientific Methods compare :: Scientific -> Scientific -> Ordering # (<) :: Scientific -> Scientific -> Bool # (<=) :: Scientific -> Scientific -> Bool # (>) :: Scientific -> Scientific -> Bool # (>=) :: Scientific -> Scientific -> Bool # max :: Scientific -> Scientific -> Scientific # min :: Scientific -> Scientific -> Scientific # | |
| Ord Mod2 | |
| Ord AnnLookup | |
| Ord AnnTarget | |
| Ord Bang | |
| Ord Body | |
| Ord Bytes | |
| Ord Callconv | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Clause | |
| Ord Con | |
| Ord Dec | |
| Ord DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
| Ord DerivClause | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DerivClause -> DerivClause -> Ordering # (<) :: DerivClause -> DerivClause -> Bool # (<=) :: DerivClause -> DerivClause -> Bool # (>) :: DerivClause -> DerivClause -> Bool # (>=) :: DerivClause -> DerivClause -> Bool # max :: DerivClause -> DerivClause -> DerivClause # min :: DerivClause -> DerivClause -> DerivClause # | |
| Ord DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # max :: DerivStrategy -> DerivStrategy -> DerivStrategy # min :: DerivStrategy -> DerivStrategy -> DerivStrategy # | |
| Ord DocLoc | |
| Ord Exp | |
| Ord FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Methods compare :: FamilyResultSig -> FamilyResultSig -> Ordering # (<) :: FamilyResultSig -> FamilyResultSig -> Bool # (<=) :: FamilyResultSig -> FamilyResultSig -> Bool # (>) :: FamilyResultSig -> FamilyResultSig -> Bool # (>=) :: FamilyResultSig -> FamilyResultSig -> Bool # max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # | |
| Ord Fixity | |
| Ord FixityDirection | |
Defined in Language.Haskell.TH.Syntax Methods compare :: FixityDirection -> FixityDirection -> Ordering # (<) :: FixityDirection -> FixityDirection -> Bool # (<=) :: FixityDirection -> FixityDirection -> Bool # (>) :: FixityDirection -> FixityDirection -> Bool # (>=) :: FixityDirection -> FixityDirection -> Bool # max :: FixityDirection -> FixityDirection -> FixityDirection # min :: FixityDirection -> FixityDirection -> FixityDirection # | |
| Ord Foreign | |
Defined in Language.Haskell.TH.Syntax | |
| Ord FunDep | |
| Ord Guard | |
| Ord Info | |
| Ord InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn # min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn # | |
| Ord Inline | |
| Ord Lit | |
| Ord Loc | |
| Ord Match | |
| Ord ModName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Module | |
| Ord ModuleInfo | |
Defined in Language.Haskell.TH.Syntax Methods compare :: ModuleInfo -> ModuleInfo -> Ordering # (<) :: ModuleInfo -> ModuleInfo -> Bool # (<=) :: ModuleInfo -> ModuleInfo -> Bool # (>) :: ModuleInfo -> ModuleInfo -> Bool # (>=) :: ModuleInfo -> ModuleInfo -> Bool # max :: ModuleInfo -> ModuleInfo -> ModuleInfo # min :: ModuleInfo -> ModuleInfo -> ModuleInfo # | |
| Ord Name | |
| Ord NameFlavour | |
Defined in Language.Haskell.TH.Syntax Methods compare :: NameFlavour -> NameFlavour -> Ordering # (<) :: NameFlavour -> NameFlavour -> Bool # (<=) :: NameFlavour -> NameFlavour -> Bool # (>) :: NameFlavour -> NameFlavour -> Bool # (>=) :: NameFlavour -> NameFlavour -> Bool # max :: NameFlavour -> NameFlavour -> NameFlavour # min :: NameFlavour -> NameFlavour -> NameFlavour # | |
| Ord NameSpace | |
| Ord OccName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Overlap | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pat | |
| Ord PatSynArgs | |
Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynArgs -> PatSynArgs -> Ordering # (<) :: PatSynArgs -> PatSynArgs -> Bool # (<=) :: PatSynArgs -> PatSynArgs -> Bool # (>) :: PatSynArgs -> PatSynArgs -> Bool # (>=) :: PatSynArgs -> PatSynArgs -> Bool # max :: PatSynArgs -> PatSynArgs -> PatSynArgs # min :: PatSynArgs -> PatSynArgs -> PatSynArgs # | |
| Ord PatSynDir | |
| Ord Phases | |
| Ord PkgName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pragma | |
| Ord Range | |
| Ord Role | |
| Ord RuleBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Ord RuleMatch | |
| Ord Safety | |
| Ord SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
| Ord SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
| Ord Specificity | |
Defined in Language.Haskell.TH.Syntax Methods compare :: Specificity -> Specificity -> Ordering # (<) :: Specificity -> Specificity -> Bool # (<=) :: Specificity -> Specificity -> Bool # (>) :: Specificity -> Specificity -> Bool # (>=) :: Specificity -> Specificity -> Bool # max :: Specificity -> Specificity -> Specificity # min :: Specificity -> Specificity -> Specificity # | |
| Ord Stmt | |
| Ord TyLit | |
| Ord TySynEqn | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Type | |
| Ord TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead # min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead # | |
| Ord Builder | |
Defined in Data.Text.Internal.Builder | |
| Ord B | |
| Ord ShortText | |
| Ord ConstructorVariant | |
Defined in Language.Haskell.TH.Datatype Methods compare :: ConstructorVariant -> ConstructorVariant -> Ordering # (<) :: ConstructorVariant -> ConstructorVariant -> Bool # (<=) :: ConstructorVariant -> ConstructorVariant -> Bool # (>) :: ConstructorVariant -> ConstructorVariant -> Bool # (>=) :: ConstructorVariant -> ConstructorVariant -> Bool # max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant # min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant # | |
| Ord DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods compare :: DatatypeVariant -> DatatypeVariant -> Ordering # (<) :: DatatypeVariant -> DatatypeVariant -> Bool # (<=) :: DatatypeVariant -> DatatypeVariant -> Bool # (>) :: DatatypeVariant -> DatatypeVariant -> Bool # (>=) :: DatatypeVariant -> DatatypeVariant -> Bool # max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant # min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant # | |
| Ord FieldStrictness | |
Defined in Language.Haskell.TH.Datatype Methods compare :: FieldStrictness -> FieldStrictness -> Ordering # (<) :: FieldStrictness -> FieldStrictness -> Bool # (<=) :: FieldStrictness -> FieldStrictness -> Bool # (>) :: FieldStrictness -> FieldStrictness -> Bool # (>=) :: FieldStrictness -> FieldStrictness -> Bool # max :: FieldStrictness -> FieldStrictness -> FieldStrictness # min :: FieldStrictness -> FieldStrictness -> FieldStrictness # | |
| Ord Strictness | |
Defined in Language.Haskell.TH.Datatype Methods compare :: Strictness -> Strictness -> Ordering # (<) :: Strictness -> Strictness -> Bool # (<=) :: Strictness -> Strictness -> Bool # (>) :: Strictness -> Strictness -> Bool # (>=) :: Strictness -> Strictness -> Bool # max :: Strictness -> Strictness -> Strictness # min :: Strictness -> Strictness -> Strictness # | |
| Ord Unpackedness | |
Defined in Language.Haskell.TH.Datatype Methods compare :: Unpackedness -> Unpackedness -> Ordering # (<) :: Unpackedness -> Unpackedness -> Bool # (<=) :: Unpackedness -> Unpackedness -> Bool # (>) :: Unpackedness -> Unpackedness -> Bool # (>=) :: Unpackedness -> Unpackedness -> Bool # max :: Unpackedness -> Unpackedness -> Unpackedness # min :: Unpackedness -> Unpackedness -> Unpackedness # | |
| Ord UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| Ord LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
| Ord Undefined | |
| Ord UUID | |
| Ord UnpackedUUID | |
Defined in Data.UUID.Types.Internal | |
| Ord Integer | |
| Ord Natural | |
| Ord () | |
| Ord Bool | |
| Ord Char | |
| Ord Double | Note that due to the presence of
Also note that, due to the same,
|
| Ord Float | Note that due to the presence of
Also note that, due to the same,
|
| Ord Int | |
| Ord Word | |
| () :=> (Ord (a :- b)) | |
| () :=> (Ord (Dict a)) | |
| () :=> (Ord Integer) | |
| () :=> (Ord Natural) | |
| () :=> (Ord ()) | |
Defined in Data.Constraint | |
| () :=> (Ord Bool) | |
| () :=> (Ord Char) | |
| () :=> (Ord Double) | |
| () :=> (Ord Float) | |
| () :=> (Ord Int) | |
| () :=> (Ord Word) | |
| Ord a => Ord (First' a) | |
Defined in Distribution.Compat.Semigroup | |
| Ord a => Ord (Last' a) | |
Defined in Distribution.Compat.Semigroup | |
| Ord a => Ord (Option' a) | |
| Ord a => Ord (Only a) | |
| Ord v => Ord (KeyMap v) | |
Defined in Data.Aeson.KeyMap | |
| Ord a => Ord (ZipList a) | Since: base-4.7.0.0 |
| Ord a => Ord (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Ord a => Ord (First a) | Since: base-2.1 |
| Ord a => Ord (Last a) | Since: base-2.1 |
| Ord a => Ord (Down a) | Since: base-4.6.0.0 |
| Ord a => Ord (First a) | Since: base-4.9.0.0 |
| Ord a => Ord (Last a) | Since: base-4.9.0.0 |
| Ord a => Ord (Max a) | Since: base-4.9.0.0 |
| Ord a => Ord (Min a) | Since: base-4.9.0.0 |
| Ord m => Ord (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
| Ord a => Ord (Dual a) | Since: base-2.1 |
| Ord a => Ord (Product a) | Since: base-2.1 |
| Ord a => Ord (Sum a) | Since: base-2.1 |
| Ord p => Ord (Par1 p) | Since: base-4.7.0.0 |
| Ord (FunPtr a) | |
Defined in GHC.Ptr | |
| Ord (Ptr a) | Since: base-2.1 |
| Integral a => Ord (Ratio a) | Since: base-2.0.1 |
| Ord (Bits n) | |
| (PrimType ty, Ord ty) => Ord (Block ty) | |
Defined in Basement.Block.Base | |
| Ord (Zn n) | |
| Ord (Zn64 n) | |
| Ord a => Ord (Array a) | |
| Ord (CountOf ty) | |
Defined in Basement.Types.OffsetSize | |
| Ord (Offset ty) | |
| (PrimType ty, Ord ty) => Ord (UArray ty) | |
| Ord (Dict a) | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Ord a => Ord (Seq a) | |
| Ord a => Ord (ViewL a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (ViewR a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (Intersection a) | |
Defined in Data.Set.Internal Methods compare :: Intersection a -> Intersection a -> Ordering # (<) :: Intersection a -> Intersection a -> Bool # (<=) :: Intersection a -> Intersection a -> Bool # (>) :: Intersection a -> Intersection a -> Bool # (>=) :: Intersection a -> Intersection a -> Bool # max :: Intersection a -> Intersection a -> Intersection a # min :: Intersection a -> Intersection a -> Intersection a # | |
| Ord a => Ord (Set a) | |
| Ord a => Ord (Tree a) | Since: containers-0.6.5 |
| Ord (Digest a) | |
Defined in Crypto.Hash.Types | |
| Ord1 f => Ord (Fix f) | |
| (Functor f, Ord1 f) => Ord (Mu f) | |
| (Functor f, Ord1 f) => Ord (Nu f) | |
| Ord a => Ord (DNonEmpty a) | |
Defined in Data.DList.DNonEmpty.Internal | |
| Ord a => Ord (DList a) | |
| Ord (Finite n) | |
Defined in Data.Finite.Internal | |
| Ord (Binary p) | |
Defined in Data.Field.Galois.Binary | |
| Ord (Prime p) | |
Defined in Data.Field.Galois.Prime | |
| Ord a => Ord (Hashed a) | |
Defined in Data.Hashable.Class | |
| Ord (Packed a) Source # | |
Defined in Lorentz.Bytes | |
| Ord a => Ord (ReadTicket a) Source # | |
Defined in Lorentz.Value Methods compare :: ReadTicket a -> ReadTicket a -> Ordering # (<) :: ReadTicket a -> ReadTicket a -> Bool # (<=) :: ReadTicket a -> ReadTicket a -> Bool # (>) :: ReadTicket a -> ReadTicket a -> Bool # (>=) :: ReadTicket a -> ReadTicket a -> Bool # max :: ReadTicket a -> ReadTicket a -> ReadTicket a # min :: ReadTicket a -> ReadTicket a -> ReadTicket a # | |
| Ord e => Ord (ErrorFancy e) | |
Defined in Text.Megaparsec.Error Methods compare :: ErrorFancy e -> ErrorFancy e -> Ordering # (<) :: ErrorFancy e -> ErrorFancy e -> Bool # (<=) :: ErrorFancy e -> ErrorFancy e -> Bool # (>) :: ErrorFancy e -> ErrorFancy e -> Bool # (>=) :: ErrorFancy e -> ErrorFancy e -> Bool # max :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e # min :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e # | |
| Ord t => Ord (ErrorItem t) | |
Defined in Text.Megaparsec.Error | |
| Ord (Mod m) | |
| Ord a => Ord (StringEncode a) | |
Defined in Morley.Micheline.Json Methods compare :: StringEncode a -> StringEncode a -> Ordering # (<) :: StringEncode a -> StringEncode a -> Bool # (<=) :: StringEncode a -> StringEncode a -> Bool # (>) :: StringEncode a -> StringEncode a -> Bool # (>=) :: StringEncode a -> StringEncode a -> Bool # | |
| Ord (KindedAddress kind) | |
Defined in Morley.Tezos.Address Methods compare :: KindedAddress kind -> KindedAddress kind -> Ordering # (<) :: KindedAddress kind -> KindedAddress kind -> Bool # (<=) :: KindedAddress kind -> KindedAddress kind -> Bool # (>) :: KindedAddress kind -> KindedAddress kind -> Bool # (>=) :: KindedAddress kind -> KindedAddress kind -> Bool # max :: KindedAddress kind -> KindedAddress kind -> KindedAddress kind # min :: KindedAddress kind -> KindedAddress kind -> KindedAddress kind # | |
| Ord (Hash kind) | |
| Ord (HashTag kind) | |
Defined in Morley.Tezos.Crypto | |
| Ord a => Ord (All a) | |
| Ord a => Ord (Any a) | |
| Ord ann => Ord (SimpleDocStream ann) | |
Defined in Prettyprinter.Internal Methods compare :: SimpleDocStream ann -> SimpleDocStream ann -> Ordering # (<) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (<=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (>) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (>=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # max :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann # min :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann # | |
| Ord a => Ord (Array a) | Lexicographic ordering. Subject to change between major versions. |
Defined in Data.Primitive.Array | |
| (Ord a, Prim a) => Ord (PrimArray a) | Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0 |
Defined in Data.Primitive.PrimArray | |
| Ord a => Ord (SmallArray a) | Lexicographic ordering. Subject to change between major versions. |
Defined in Data.Primitive.SmallArray Methods compare :: SmallArray a -> SmallArray a -> Ordering # (<) :: SmallArray a -> SmallArray a -> Bool # (<=) :: SmallArray a -> SmallArray a -> Bool # (>) :: SmallArray a -> SmallArray a -> Bool # (>=) :: SmallArray a -> SmallArray a -> Bool # max :: SmallArray a -> SmallArray a -> SmallArray a # min :: SmallArray a -> SmallArray a -> SmallArray a # | |
| Ord g => Ord (StateGen g) | |
Defined in System.Random.Internal | |
| Ord g => Ord (AtomicGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (IOGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (STGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (TGen g) | |
| Ord a => Ord (Add a) | |
| Ord (IntSetOf a) | |
| Ord a => Ord (Mul a) | |
| Ord a => Ord (WrappedNum a) | |
Defined in Data.Semiring Methods compare :: WrappedNum a -> WrappedNum a -> Ordering # (<) :: WrappedNum a -> WrappedNum a -> Bool # (<=) :: WrappedNum a -> WrappedNum a -> Bool # (>) :: WrappedNum a -> WrappedNum a -> Bool # (>=) :: WrappedNum a -> WrappedNum a -> Bool # max :: WrappedNum a -> WrappedNum a -> WrappedNum a # min :: WrappedNum a -> WrappedNum a -> WrappedNum a # | |
| Ord a => Ord (Maybe a) | |
| Ord flag => Ord (TyVarBndr flag) | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TyVarBndr flag -> TyVarBndr flag -> Ordering # (<) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # | |
| Ord a => Ord (HashSet a) | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| (Prim a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Primitive | |
| (Storable a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Storable | |
| Ord t => Ord (ElField '(s, t)) | |
Defined in Data.Vinyl.Functor Methods compare :: ElField '(s, t) -> ElField '(s, t) -> Ordering # (<) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (<=) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (>) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (>=) :: ElField '(s, t) -> ElField '(s, t) -> Bool # max :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # min :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # | |
| Ord a => Ord (Identity a) | |
| Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0 |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Ord a => Ord (a) | |
| Ord a => Ord [a] | |
| (Integral a) :=> (Ord (Ratio a)) | |
| (Ord a) :=> (Ord (Const a b)) | |
| (Ord a) :=> (Ord (Identity a)) | |
| (Ord a) :=> (Ord (Maybe a)) | |
| (Ord a) :=> (Ord [a]) | |
| Class (Eq a) (Ord a) | |
| Ord a => Ord (WrapWord a n) | |
Defined in Data.Word.Odd | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| Ord (Fixed a) | Since: base-2.1 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Ord a => Ord (Arg a b) | Since: base-4.9.0.0 |
| Ord (TypeRep a) | Since: base-4.4.0.0 |
| Ord (U1 p) | Since: base-4.7.0.0 |
| Ord (V1 p) | Since: base-4.9.0.0 |
| Ord a => Ord (ListN n a) | |
| (Ord a, Ord b) => Ord (Bimap a b) | |
| Ord (a :- b) | Assumes |
Defined in Data.Constraint | |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Ord1 f, Ord a) => Ord (Cofree f a) | |
Defined in Control.Comonad.Cofree | |
| (Ord1 f, Ord a) => Ord (Free f a) | |
Defined in Control.Monad.Free | |
| Ord k => Ord (Extension p k) | |
Defined in Data.Field.Galois.Extension Methods compare :: Extension p k -> Extension p k -> Ordering # (<) :: Extension p k -> Extension p k -> Bool # (<=) :: Extension p k -> Extension p k -> Bool # (>) :: Extension p k -> Extension p k -> Bool # (>=) :: Extension p k -> Extension p k -> Bool # | |
| Ord k => Ord (RootsOfUnity n k) | |
Defined in Data.Field.Galois.Unity Methods compare :: RootsOfUnity n k -> RootsOfUnity n k -> Ordering # (<) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (<=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (>) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (>=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # max :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # min :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # | |
| (Ord1 f, Ord a) => Ord (Yoneda f a) | |
Defined in Data.Functor.Yoneda | |
| Ord (TAddress p vd) Source # | |
Defined in Lorentz.Address Methods compare :: TAddress p vd -> TAddress p vd -> Ordering # (<) :: TAddress p vd -> TAddress p vd -> Bool # (<=) :: TAddress p vd -> TAddress p vd -> Bool # (>) :: TAddress p vd -> TAddress p vd -> Bool # (>=) :: TAddress p vd -> TAddress p vd -> Bool # | |
| Ord (Hash alg a) Source # | |
| Ord (NFixed p) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| (Ord n, Ord m) => Ord (ArithError n m) | |
Defined in Morley.Michelson.Typed.Arith Methods compare :: ArithError n m -> ArithError n m -> Ordering # (<) :: ArithError n m -> ArithError n m -> Bool # (<=) :: ArithError n m -> ArithError n m -> Bool # (>) :: ArithError n m -> ArithError n m -> Bool # (>=) :: ArithError n m -> ArithError n m -> Bool # | |
| Comparable t => Ord (Value' instr t) | |
Defined in Morley.Michelson.Typed.Value Methods compare :: Value' instr t -> Value' instr t -> Ordering # (<) :: Value' instr t -> Value' instr t -> Bool # (<=) :: Value' instr t -> Value' instr t -> Bool # (>) :: Value' instr t -> Value' instr t -> Bool # (>=) :: Value' instr t -> Value' instr t -> Bool # | |
| (Ord a, Ord b) => Ord (Bimap a b) | |
| Ord a => Ord (SizedList' n a) | |
Defined in Morley.Util.SizedList Methods compare :: SizedList' n a -> SizedList' n a -> Ordering # (<) :: SizedList' n a -> SizedList' n a -> Bool # (<=) :: SizedList' n a -> SizedList' n a -> Bool # (>) :: SizedList' n a -> SizedList' n a -> Bool # (>=) :: SizedList' n a -> SizedList' n a -> Bool # | |
| Ord (v a) => Ord (Poly v a) | |
Defined in Data.Poly.Internal.Dense | |
| Ord v => Ord (IntMapOf k v) | |
Defined in Data.Semiring | |
| GCompare tag => Ord (Some tag) | |
Defined in Data.GADT.Internal | |
| (Ord a, Ord b) => Ord (Either a b) | |
| (Ord a, Ord b) => Ord (These a b) | |
| (Ord a, Ord b) => Ord (Pair a b) | |
Defined in Data.Strict.Tuple | |
| (Ord a, Ord b) => Ord (These a b) | |
| (Ord1 m, Ord a) => Ord (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe | |
| (Ord k, Ord v) => Ord (HashMap k v) | The ordering is total and consistent with the |
Defined in Data.HashMap.Internal | |
| (Ord a, Ord b) => Ord (a, b) | |
| (Ord a, Ord b) :=> (Ord (Either a b)) | |
| (Ord a, Ord b) :=> (Ord (a, b)) | |
| Class (Num a, Ord a) (Real a) | |
| Ord a => Ord (Const a b) | Since: base-4.9.0.0 |
| Ord (f a) => Ord (Ap f a) | Since: base-4.12.0.0 |
| Ord (f a) => Ord (Alt f a) | Since: base-4.8.0.0 |
Defined in Data.Semigroup.Internal | |
| Ord (a :~: b) | Since: base-4.7.0.0 |
Defined in Data.Type.Equality | |
| Ord (f p) => Ord (Rec1 f p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord (URec (Ptr ()) p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # | |
| Ord (URec Char p) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Ord (URec Double p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
| Ord (URec Float p) | |
Defined in GHC.Generics | |
| Ord (URec Int p) | Since: base-4.9.0.0 |
| Ord (URec Word p) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Ord (p (Fix p a) a) => Ord (Fix p a) | |
| Ord (p a a) => Ord (Join p a) | |
Defined in Data.Bifunctor.Join | |
| (Ord a, Ord (f b)) => Ord (CofreeF f a b) | |
Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeF f a b -> CofreeF f a b -> Ordering # (<) :: CofreeF f a b -> CofreeF f a b -> Bool # (<=) :: CofreeF f a b -> CofreeF f a b -> Bool # (>) :: CofreeF f a b -> CofreeF f a b -> Bool # (>=) :: CofreeF f a b -> CofreeF f a b -> Bool # | |
| Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a) | |
Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeT f w a -> CofreeT f w a -> Ordering # (<) :: CofreeT f w a -> CofreeT f w a -> Bool # (<=) :: CofreeT f w a -> CofreeT f w a -> Bool # (>) :: CofreeT f w a -> CofreeT f w a -> Bool # (>=) :: CofreeT f w a -> CofreeT f w a -> Bool # | |
| (Ord a, Ord (f b)) => Ord (FreeF f a b) | |
Defined in Control.Monad.Trans.Free | |
| (Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) | |
Defined in Control.Monad.Trans.Free | |
| GCompare f => Ord (Constrained c f) | |
Defined in Morley.Util.Constrained Methods compare :: Constrained c f -> Constrained c f -> Ordering # (<) :: Constrained c f -> Constrained c f -> Bool # (<=) :: Constrained c f -> Constrained c f -> Bool # (>) :: Constrained c f -> Constrained c f -> Bool # (>=) :: Constrained c f -> Constrained c f -> Bool # max :: Constrained c f -> Constrained c f -> Constrained c f # min :: Constrained c f -> Constrained c f -> Constrained c f # | |
| Ord (v (Vector n Word, a)) => Ord (MultiPoly v n a) | |
Defined in Data.Poly.Internal.Multi Methods compare :: MultiPoly v n a -> MultiPoly v n a -> Ordering # (<) :: MultiPoly v n a -> MultiPoly v n a -> Bool # (<=) :: MultiPoly v n a -> MultiPoly v n a -> Bool # (>) :: MultiPoly v n a -> MultiPoly v n a -> Bool # (>=) :: MultiPoly v n a -> MultiPoly v n a -> Bool # max :: MultiPoly v n a -> MultiPoly v n a -> MultiPoly v n a # min :: MultiPoly v n a -> MultiPoly v n a -> MultiPoly v n a # | |
| Ord (GOrdering a b) | |
Defined in Data.GADT.Internal Methods compare :: GOrdering a b -> GOrdering a b -> Ordering # (<) :: GOrdering a b -> GOrdering a b -> Bool # (<=) :: GOrdering a b -> GOrdering a b -> Bool # (>) :: GOrdering a b -> GOrdering a b -> Bool # (>=) :: GOrdering a b -> GOrdering a b -> Bool # | |
| Ord b => Ord (Tagged s b) | |
| (Ord (f a), Ord (g a), Ord a) => Ord (These1 f g a) | |
Defined in Data.Functor.These | |
| (Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a) | |
Defined in Control.Monad.Trans.Error | |
| (Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) | |
Defined in Control.Monad.Trans.Except Methods compare :: ExceptT e m a -> ExceptT e m a -> Ordering # (<) :: ExceptT e m a -> ExceptT e m a -> Bool # (<=) :: ExceptT e m a -> ExceptT e m a -> Bool # (>) :: ExceptT e m a -> ExceptT e m a -> Bool # (>=) :: ExceptT e m a -> ExceptT e m a -> Bool # | |
| (Ord1 f, Ord a) => Ord (IdentityT f a) | |
Defined in Control.Monad.Trans.Identity Methods compare :: IdentityT f a -> IdentityT f a -> Ordering # (<) :: IdentityT f a -> IdentityT f a -> Bool # (<=) :: IdentityT f a -> IdentityT f a -> Bool # (>) :: IdentityT f a -> IdentityT f a -> Bool # (>=) :: IdentityT f a -> IdentityT f a -> Bool # | |
| (RPureConstrained (IndexableField rs) rs, RecApplicative rs, Ord (Rec f rs)) => Ord (ARec f rs) | |
| (Ord (f r), Ord (Rec f rs)) => Ord (Rec f (r ': rs)) | |
Defined in Data.Vinyl.Core Methods compare :: Rec f (r ': rs) -> Rec f (r ': rs) -> Ordering # (<) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (<=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (>) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (>=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # max :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # min :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # | |
| Ord (Rec f ('[] :: [u])) | |
| (Ord a, Ord b, Ord c) => Ord (a, b, c) | |
| (Ord1 f, Ord1 g, Ord a) => Ord (Product f g a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods compare :: Product f g a -> Product f g a -> Ordering # (<) :: Product f g a -> Product f g a -> Bool # (<=) :: Product f g a -> Product f g a -> Bool # (>) :: Product f g a -> Product f g a -> Bool # (>=) :: Product f g a -> Product f g a -> Bool # | |
| (Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a) | Since: base-4.9.0.0 |
| Ord (a :~~: b) | Since: base-4.10.0.0 |
| (Ord (f p), Ord (g p)) => Ord ((f :*: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| (Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord c => Ord (K1 i c p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) | |
Defined in GHC.Classes | |
| (Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |
| Ord (f (g p)) => Ord ((f :.: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord (f p) => Ord (M1 i c f p) | Since: base-4.7.0.0 |
| Ord (f a) => Ord (Clown f a b) | |
Defined in Data.Bifunctor.Clown | |
| Ord (p b a) => Ord (Flip p a b) | |
Defined in Data.Bifunctor.Flip | |
| Ord (g b) => Ord (Joker g a b) | |
Defined in Data.Bifunctor.Joker | |
| Ord (p a b) => Ord (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering # (<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering # (<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # | |
| (Ord (f a b), Ord (g a b)) => Ord (Product f g a b) | |
Defined in Data.Bifunctor.Product Methods compare :: Product f g a b -> Product f g a b -> Ordering # (<) :: Product f g a b -> Product f g a b -> Bool # (<=) :: Product f g a b -> Product f g a b -> Bool # (>) :: Product f g a b -> Product f g a b -> Bool # (>=) :: Product f g a b -> Product f g a b -> Bool # max :: Product f g a b -> Product f g a b -> Product f g a b # min :: Product f g a b -> Product f g a b -> Product f g a b # | |
| (Ord (p a b), Ord (q a b)) => Ord (Sum p q a b) | |
Defined in Data.Bifunctor.Sum | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering # (<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # | |
| Ord (f (p a b)) => Ord (Tannen f p a b) | |
Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f p a b -> Tannen f p a b -> Ordering # (<) :: Tannen f p a b -> Tannen f p a b -> Bool # (<=) :: Tannen f p a b -> Tannen f p a b -> Bool # (>) :: Tannen f p a b -> Tannen f p a b -> Bool # (>=) :: Tannen f p a b -> Tannen f p a b -> Bool # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering # (<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering # (<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # | |
| Ord (p (f a) (g b)) => Ord (Biff p f g a b) | |
Defined in Data.Bifunctor.Biff Methods compare :: Biff p f g a b -> Biff p f g a b -> Ordering # (<) :: Biff p f g a b -> Biff p f g a b -> Bool # (<=) :: Biff p f g a b -> Biff p f g a b -> Bool # (>) :: Biff p f g a b -> Biff p f g a b -> Bool # (>=) :: Biff p f g a b -> Biff p f g a b -> Bool # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
| Bounded CabalSpecVersion | |
Defined in Distribution.CabalSpecVersion | |
| Bounded PWarnType | |
| Bounded KnownExtension | |
Defined in Language.Haskell.Extension | |
| Bounded All | Since: base-2.1 |
| Bounded Any | Since: base-2.1 |
| Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded Int16 | Since: base-2.1 |
| Bounded Int32 | Since: base-2.1 |
| Bounded Int64 | Since: base-2.1 |
| Bounded Int8 | Since: base-2.1 |
| Bounded GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode | |
| Bounded Word16 | Since: base-2.1 |
| Bounded Word32 | Since: base-2.1 |
| Bounded Word64 | Since: base-2.1 |
| Bounded Word8 | Since: base-2.1 |
| Bounded Encoding | |
| Bounded UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 | |
| Bounded Bit | |
| Bounded Extension | |
| Bounded Ordering | Since: base-2.1 |
| Bounded BlstError | |
| Bounded EncodeMethod | |
Defined in Crypto.BLST.Internal.Bindings.Types | |
| Bounded MichelinePrimitive | |
| Bounded MichelinePrimitiveTag | |
| Bounded Nesting | |
Defined in Morley.Michelson.TypeCheck.TypeCheckedOp | |
| Bounded AddressKind | |
Defined in Morley.Tezos.Address.Kinds | |
| Bounded Mutez | |
| Bounded KeyType | |
Defined in Morley.Tezos.Crypto | |
| Bounded Bls12381Fr | |
Defined in Morley.Tezos.Crypto.BLS12381 | |
| Bounded TLTime | |
Defined in Morley.Tezos.Crypto.Timelock | |
| Bounded Word62 | |
Defined in Morley.Prelude.Word | |
| Bounded Word63 | |
Defined in Morley.Prelude.Word | |
| Bounded Mod2 | |
| Bounded Undefined | |
| Bounded () | Since: base-2.1 |
| Bounded Bool | Since: base-2.1 |
| Bounded Char | Since: base-2.1 |
| Bounded Int | Since: base-2.1 |
| Bounded Levity | Since: base-4.16.0.0 |
| Bounded VecCount | Since: base-4.10.0.0 |
| Bounded VecElem | Since: base-4.10.0.0 |
| Bounded Word | Since: base-2.1 |
| () :=> (Bounded Ordering) | |
| () :=> (Bounded ()) | |
Defined in Data.Constraint | |
| () :=> (Bounded Bool) | |
| () :=> (Bounded Char) | |
| () :=> (Bounded Int) | |
| () :=> (Bounded Word) | |
| a :=> (Bounded (Dict a)) | |
| Class () (Bounded a) | |
Defined in Data.Constraint | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Down a) | Swaps Since: base-4.14.0.0 |
| Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| SizeValid n => Bounded (Bits n) | |
| a => Bounded (Dict a) | |
| KnownNat n => Bounded (Finite n) | Throws an error for |
| KnownNat p => Bounded (Binary p) | |
| KnownNat p => Bounded (Prime p) | |
| KnownNat m => Bounded (Mod m) | |
| Bounded a => Bounded (StringEncode a) | |
Defined in Morley.Micheline.Json | |
| Bounded a => Bounded (All a) | |
Defined in Morley.Prelude.Boolean | |
| Bounded a => Bounded (Any a) | |
Defined in Morley.Prelude.Boolean | |
| Bounded a => Bounded (Add a) | |
| Bounded a => Bounded (Mul a) | |
| Bounded a => Bounded (WrappedNum a) | |
Defined in Data.Semiring | |
| Bounded a => Bounded (a) | |
| (Bounded a) :=> (Bounded (Const a b)) | |
| (Bounded a) :=> (Bounded (Identity a)) | |
| (Num a, Bits a, TypeNum n) => Bounded (WrapWord a n) | |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| (Bounded a, Bounded b) => Bounded (Pair a b) | |
| (Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
| (Bounded a, Bounded b) :=> (Bounded (a, b)) | |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
| a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
| Bounded b => Bounded (Tagged s b) | |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
| a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
Since: base-4.9.0.0
Minimal complete definition
Methods
(<>) :: a -> a -> a infixr 6 #
An associative operation.
>>>[1,2,3] <> [4,5,6][1,2,3,4,5,6]
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
>>>import Data.List.NonEmpty (NonEmpty (..))>>>sconcat $ "Hello" :| [" ", "Haskell", "!"]"Hello Haskell!"
stimes :: Integral b => b -> a -> a #
Repeat a value n times.
Given that this works on a Semigroup it is allowed to fail if
you request 0 or fewer repetitions, and the default definition
will do so.
By making this a member of the class, idempotent semigroups
and monoids can upgrade this to execute in \(\mathcal{O}(1)\) by
picking stimes = or stimesIdempotentstimes =
respectively.stimesIdempotentMonoid
>>>stimes 4 [1][1,1,1,1]
Instances
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:
- Right identity
x<>mempty= x- Left identity
mempty<>x = x- Associativity
x(<>(y<>z) = (x<>y)<>zSemigrouplaw)- Concatenation
mconcat=foldr(<>)mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtypes and make those instances
of Monoid, e.g. Sum and Product.
NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
Minimal complete definition
Methods
Identity of mappend
>>>"Hello world" <> mempty"Hello world"
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = (<>)mappend is a synonym for
(<>), it is expected that the two functions are defined the same
way. In a future GHC release mappend will be removed from Monoid.
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
>>>mconcat ["Hello", " ", "Haskell", "!"]"Hello Haskell!"
Instances
| Monoid Key | |
| Monoid More | |
| Monoid ByteArray | Since: base-4.17.0.0 |
| Monoid All | Since: base-2.1 |
| Monoid Any | Since: base-2.1 |
| Monoid AsciiString | |
Defined in Basement.Types.AsciiString Methods mempty :: AsciiString # mappend :: AsciiString -> AsciiString -> AsciiString # mconcat :: [AsciiString] -> AsciiString # | |
| Monoid String | |
| Monoid ByteString | |
Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString # | |
| Monoid IntSet | |
| Monoid Ordering | Since: base-2.1 |
| Monoid AnalyzerRes | |
| Monoid ContractDoc | |
Defined in Morley.Michelson.Doc Methods mempty :: ContractDoc # mappend :: ContractDoc -> ContractDoc -> ContractDoc # mconcat :: [ContractDoc] -> ContractDoc # | |
| Monoid MorleyLogs | |
| Monoid MorleyLogsBuilder | |
| Monoid Ruleset | |
| Monoid MText | |
| Monoid AnnotationSet | |
| Monoid VarAnn | |
| Monoid PrefsMod | |
| Monoid Completer | |
| Monoid ParseError | |
Defined in Options.Applicative.Types Methods mempty :: ParseError # mappend :: ParseError -> ParseError -> ParseError # mconcat :: [ParseError] -> ParseError # | |
| Monoid Doc | |
| Monoid ByteArray | |
| Monoid PromDPatInfos | |
| Monoid ULetDecEnv | |
| Monoid Builder | |
| Monoid ShortText | |
| Monoid () | Since: base-2.1 |
| () :=> (Monoid Ordering) | |
| () :=> (Monoid ()) | |
Defined in Data.Constraint | |
| () :=> (Monoid [a]) | |
Defined in Data.Constraint | |
| a :=> (Monoid (Dict a)) | |
| Semigroup a => Monoid (Option' a) | |
| Monoid (KeyMap v) | |
| Monoid (IResult a) | |
| Monoid (Parser a) | |
| Monoid (Result a) | |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| Monoid (First a) | Since: base-2.1 |
| Monoid (Last a) | Since: base-2.1 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| (Ord a, Bounded a) => Monoid (Max a) | Since: base-4.9.0.0 |
| (Ord a, Bounded a) => Monoid (Min a) | Since: base-4.9.0.0 |
| Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
| Monoid a => Monoid (Dual a) | Since: base-2.1 |
| Monoid (Endo a) | Since: base-2.1 |
| Num a => Monoid (Product a) | Since: base-2.1 |
| Num a => Monoid (Sum a) | Since: base-2.1 |
| Monoid a => Monoid (STM a) | Since: base-4.17.0.0 |
| (Generic a, Monoid (Rep a ())) => Monoid (Generically a) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods mempty :: Generically a # mappend :: Generically a -> Generically a -> Generically a # mconcat :: [Generically a] -> Generically a # | |
| Monoid p => Monoid (Par1 p) | Since: base-4.12.0.0 |
| PrimType ty => Monoid (Block ty) | |
| Monoid (Array a) | |
| Monoid (CountOf ty) | |
| PrimType ty => Monoid (UArray ty) | |
| a => Monoid (Dict a) | |
| Monoid (IntMap a) | |
| Monoid (Seq a) | |
| Monoid (MergeSet a) | |
| Ord a => Monoid (Set a) | |
| Monoid (DList a) | |
| KnownNat p => Monoid (Binary p) | |
| KnownNat p => Monoid (Prime p) | |
| Monoid a => Monoid (IO a) | Since: base-4.9.0.0 |
| Monoid a => Monoid (May a) | |
| Monoid (ComposeResult a) | |
| Monoid (PrintComment st) | |
| Monoid (SomeSizedList a) | |
| BooleanMonoid a => Monoid (All a) | |
| BooleanMonoid a => Monoid (Any a) | |
| Monoid (InfoMod a) | |
| Monoid (DefaultProp a) | |
Defined in Options.Applicative.Builder.Internal Methods mempty :: DefaultProp a # mappend :: DefaultProp a -> DefaultProp a -> DefaultProp a # mconcat :: [DefaultProp a] -> DefaultProp a # | |
| Monoid (Doc a) | |
| Monoid (Doc ann) |
|
| Monoid (Array a) | |
| Monoid (PrimArray a) | Since: primitive-0.6.4.0 |
| Monoid (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a # mappend :: SmallArray a -> SmallArray a -> SmallArray a # mconcat :: [SmallArray a] -> SmallArray a # | |
| Semiring a => Monoid (Add a) | |
| Monoid (IntSetOf a) | |
| Semiring a => Monoid (Mul a) | |
| Semigroup a => Monoid (Maybe a) | |
| Monoid a => Monoid (Q a) | Since: template-haskell-2.17.0.0 |
| (Hashable a, Eq a) => Monoid (HashSet a) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| Monoid (Vector a) | |
| Prim a => Monoid (Vector a) | |
| Storable a => Monoid (Vector a) | |
| (KnownSymbol s, Monoid t) => Monoid (ElField '(s, t)) | |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Monoid a => Monoid (a) | Since: base-4.15 |
| Monoid [a] | Since: base-2.1 |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Applicative ((,) a)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Monoid (Const a b)) | |
| (Monoid a) :=> (Monoid (Identity a)) | |
| (Monoid a) :=> (Monoid (IO a)) | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| Class (Semigroup a) (Monoid a) | |
| Monoid (Parser i a) | |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Monoid (U1 p) | Since: base-4.12.0.0 |
| Monoid a => Monoid (ST s a) | Since: base-4.11.0.0 |
| Ord k => Monoid (Map k v) | |
| IrreducibleMonic p k => Monoid (Extension p k) | |
| (KnownNat n, GaloisField k) => Monoid (RootsOfUnity n k) | |
Defined in Data.Field.Galois.Unity Methods mempty :: RootsOfUnity n k # mappend :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # mconcat :: [RootsOfUnity n k] -> RootsOfUnity n k # | |
| Monoid (f a) => Monoid (Indexing f a) |
|
| Monoid (ReifiedFold s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # mconcat :: [ReifiedFold s a] -> ReifiedFold s a # | |
| Monoid (s :-> s) Source # | |
| (Stream s, Ord e) => Monoid (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods mempty :: ParseError s e # mappend :: ParseError s e -> ParseError s e -> ParseError s e # mconcat :: [ParseError s e] -> ParseError s e # | |
| Monoid a => Monoid (Err e a) | |
| Monoid (Instr s s) | |
| Monoid (Mod f a) | |
| Monoid (IntMapOf k v) | |
| Applicative m => Monoid (Some m) | |
| (Monoid a, Monoid b) => Monoid (Pair a b) | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| Monoid b => Monoid (a -> b) | Since: base-2.1 |
| (Monoid a, Monoid b) => Monoid (a, b) | Since: base-2.1 |
| (Monoid a, Monoid b) :=> (Monoid (a, b)) | |
| Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Monoid a) => Monoid (Ap f a) | Since: base-4.12.0.0 |
| Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
| Monoid (f p) => Monoid (Rec1 f p) | Since: base-4.12.0.0 |
| Monoid (ReifiedIndexedFold i s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a # | |
| (Monad m, Monoid r) => Monoid (Effect m r a) | |
| Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) | |
Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s # | |
| (Semigroup a, Monoid a) => Monoid (Tagged s a) | |
| (Monoid (f r), Monoid (Rec f rs)) => Monoid (Rec f (r ': rs)) | |
| Monoid (Rec f ('[] :: [u])) | |
| (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | Since: base-2.1 |
| (Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | Since: base-4.16.0.0 |
| (Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | Since: base-4.12.0.0 |
| Monoid c => Monoid (K1 i c p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | Since: base-2.1 |
| Monoid (f (g a)) => Monoid (Compose f g a) | Since: base-4.16.0.0 |
| Monoid (f (g p)) => Monoid ((f :.: g) p) | Since: base-4.12.0.0 |
| Monoid (f p) => Monoid (M1 i c f p) | Since: base-4.12.0.0 |
| Monoid (f (g a)) => Monoid (Compose f g a) | |
| (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | Since: base-2.1 |
| Curve f c e q r => Monoid (Point f c e q r) | |
Representable types of kind *.
This class is derivable in GHC with the DeriveGeneric flag on.
A Generic instance must satisfy the following laws:
from.to≡idto.from≡id
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight b
The Either type is sometimes used to represent a value which is
either correct or an error; by convention, the Left constructor is
used to hold an error value and the Right constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: Either String Int
The fmap from our Functor instance will ignore Left values, but
will apply the supplied function to values contained in a Right:
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>fmap (*2) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 3
But the following should fail overall, since the first operation where
we attempt to parse 'm' as an Int will fail:
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| ToJSON2 Either | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Either a b -> Value # liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Either a b] -> Value # liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Either a b -> Encoding # liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Either a b] -> Encoding # | |
| Bifunctor Either | Since: base-4.8.0.0 |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| (CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) Source # | |
| Generic1 (Either a :: Type -> Type) | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| () :=> (Functor (Either a)) | |
| () :=> (Monad (Either a)) | |
| MonadError e (Either e) | |
Defined in Control.Monad.Error.Class | |
| IsoHKD (Either a :: Type -> Type) (b :: Type) | |
| (Lift a, Lift b) => Lift (Either a b :: Type) | |
| ToJSON a => ToJSON1 (Either a) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Either a a0 -> Value # liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Either a a0] -> Value # liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Either a a0 -> Encoding # liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Either a a0] -> Encoding # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Applicative (Either e) | Since: base-3.0 |
| Functor (Either a) | Since: base-3.0 |
| Monad (Either e) | Since: base-4.4.0.0 |
| MonadFailure (Either a) | |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| PApplicative (Either e) | |
| PFunctor (Either a) | |
Defined in Control.Monad.Singletons.Internal | |
| PMonad (Either e) | |
| SApplicative (Either e) | |
Defined in Control.Monad.Singletons.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Either e a) (t3 :: Either e b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SFunctor (Either a) | |
| SMonad (Either e) | |
Defined in Control.Monad.Singletons.Internal Methods (%>>=) :: forall a b (t1 :: Either e a) (t2 :: a ~> Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Traversable.Singletons Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Either a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: Either a (f a0)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: Either a a0). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a0 (t1 :: Either a (m a0)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| KnownValue a => LorentzFunctor (Either a) a b Source # | |
Defined in Lorentz.Instr | |
| (Structured a, Structured b) => Structured (Either a b) | |
Defined in Distribution.Utils.Structured | |
| (ToJSON a, ToJSON b) => ToJSON (Either a b) | |
Defined in Data.Aeson.Types.ToJSON | |
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| Generic (Either a b) | |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| (HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) Source # | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) Source # | |
| (HasRPCRepr l, HasRPCRepr r) => HasRPCRepr (Either l r) | |
Defined in Morley.AsRPC Associated Types type AsRPC (Either l r) | |
| PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r) | |
Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Either l r) :: FieldDescriptions # Methods typeDocName :: Proxy (Either l r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Either l r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Either l r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Either l r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Either l r) # | |
| (IsoValue l, IsoValue r) => IsoValue (Either l r) | |
| (Buildable a, Buildable b) => Buildable (Either a b) | |
Defined in Fmt.Buildable | |
| PEq (Either a b) | |
| (SEq a, SEq b) => SEq (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Ord.Singletons Methods sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| PSemigroup (Either a b) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup (Either a b) | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
Defined in Text.Show.Singletons Methods sShowsPrec :: forall (t1 :: Natural) (t2 :: Either a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Either a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| (TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b) | |
Defined in Universum.Container.Class Methods toList :: Either a b -> [Element (Either a b)] # foldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldl :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # foldl' :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # elem :: Element (Either a b) -> Either a b -> Bool # foldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # fold :: Either a b -> Element (Either a b) # foldr' :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # notElem :: Element (Either a b) -> Either a b -> Bool # all :: (Element (Either a b) -> Bool) -> Either a b -> Bool # any :: (Element (Either a b) -> Bool) -> Either a b -> Bool # find :: (Element (Either a b) -> Bool) -> Either a b -> Maybe (Element (Either a b)) # safeHead :: Either a b -> Maybe (Element (Either a b)) # safeMaximum :: Either a b -> Maybe (Element (Either a b)) # safeMinimum :: Either a b -> Maybe (Element (Either a b)) # safeFoldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) # safeFoldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) # | |
| (Read a, Read b) :=> (Read (Either a b)) | |
| (Show a, Show b) :=> (Show (Either a b)) | |
| (Eq a, Eq b) :=> (Eq (Either a b)) | |
| (Ord a, Ord b) :=> (Ord (Either a b)) | |
| (SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| (SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 # | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Either.Singletons | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Either.Singletons | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing RightsSym0 # | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (TFHelper_6989586621679625174Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679189276Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679378549Sym0 :: TyFun a (Either e a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679625183ASym0 :: TyFun k1 (Either a k1) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| (a ~ a', b ~ b') => Each (Either a a') (Either b b') a b | Since: microlens-0.4.11 |
| SingI2 (Either_Sym2 :: (a ~> c) -> (b ~> c) -> TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons | |
| SingI1 (Either_Sym1 :: (a ~> c) -> TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Either.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Either_Sym1 x) # | |
| SingI d => SingI1 (Either_Sym2 d :: (b ~> c) -> TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Either_Sym2 d x) # | |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621679625174Sym1 a6989586621679625179 :: TyFun (Either a b) (Either a b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679189276Sym1 a6989586621679189281 :: TyFun (Either a b) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378377Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym1 d) # | |
| SuppressUnusedWarnings (Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378559Sym1 a6989586621679378564 :: TyFun (Either e a) (Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621679289090 a6989586621679289091 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| (Functor f, Functor g) => Functor (Lift Either f g) | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1) | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1) | |
| type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1) | |
| type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1) | |
| type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type HKD (Either a :: Type -> Type) (b :: Type) | |
| type Elem (arg1 :: a1) (arg2 :: Either a2 a1) | |
| type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b) | |
| type Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127514 :: Natural) | |
| type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679028412 :: a) | |
| type Apply (Pure_6989586621679378549Sym0 :: TyFun a (Either e a) -> Type) (a6989586621679378555 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679028414 :: b) | |
| type Apply (Let6989586621679625183ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216796248716989586621679625182 :: k1) | |
| type Apply (TFHelper_6989586621679378377Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621679378382 :: a1) | |
| type Apply (Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680261569 :: b) | |
| type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type) | |
| type Failure (Either a) | |
Defined in Basement.Monad | |
| type Fold (arg :: Either a m) | |
| type Length (a3 :: Either a1 a2) | |
| type Maximum (arg :: Either a1 a2) | |
| type Minimum (arg :: Either a1 a2) | |
| type Null (a3 :: Either a1 a2) | |
| type Product (arg :: Either a1 a2) | |
| type Sum (arg :: Either a1 a2) | |
| type ToList (arg :: Either a1 a2) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1) | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b) | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679291393 :: [Either a b]) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679291387 :: [Either a b]) | |
Defined in Data.Either.Singletons | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679291370 :: [Either a b]) | |
Defined in Data.Either.Singletons | |
| type Rep (Either a b) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) | |
| type AsRPC (Either l r) | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions (Either l r) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT (Either l r) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (Either a b) | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Element (Either a b) | |
Defined in Universum.Container.Class | |
| type Sconcat (arg :: NonEmpty (Either a b)) | |
| type Show_ (arg :: Either a b) | |
| type (arg1 :: Either a b) /= (arg2 :: Either a b) | |
| type (a2 :: Either a1 b) == (a3 :: Either a1 b) | |
| type (arg1 :: Either a b) < (arg2 :: Either a b) | |
| type (arg1 :: Either a b) <= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) > (arg2 :: Either a b) | |
| type (arg1 :: Either a b) >= (arg2 :: Either a b) | |
| type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) | |
| type Max (arg1 :: Either a b) (arg2 :: Either a b) | |
| type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
| type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
| type ShowList (arg1 :: [Either a b]) arg2 | |
| type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291365 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291362 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) (a6989586621680261580 :: Either a1 a2) | |
| type Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680261588 :: Either a1 a2) | |
| type Apply (Compare_6989586621679189276Sym1 a6989586621679189281 :: TyFun (Either a b) Ordering -> Type) (a6989586621679189282 :: Either a b) | |
| type Apply (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) (a6989586621679136294 :: Either a b) | |
| type Apply (FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type) (a6989586621680261556 :: Either a2 a1) | |
| type Apply (Either_Sym2 a6989586621679289090 a6989586621679289091 :: TyFun (Either a b) c -> Type) (a6989586621679289092 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type) (a6989586621680261570 :: Either a2 a1) | |
| type Apply (Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680543665 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621679625174Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621679625179 :: Either a b) | |
| type Apply (Compare_6989586621679189276Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679189281 :: Either a b) | |
| type Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679136293 :: Either a b) | |
| type Apply (TFHelper_6989586621679625174Sym1 a6989586621679625179 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621679625180 :: Either a b) | |
| type Apply (ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680127515 :: Either a b) | |
| type Apply (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621679378564 :: Either e (a ~> b)) | |
| type Apply (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621679378648 :: Either e a) | |
| type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679289090 :: a ~> c) | |
| type Apply (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680261568 :: a1 ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621679378365 :: a1 ~> b) | |
| type Apply (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680261555 :: a1 ~> m) | |
| type Apply (Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621679378366 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621679378383 :: Either a2 b) | |
| type Apply (TFHelper_6989586621679378559Sym1 a6989586621679378564 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621679378565 :: Either e a) | |
| type Apply (TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621679378649 :: a ~> Either e b) | |
| type Apply (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621680543664 :: a1 ~> f b) | |
| type Apply (Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679289091 :: b ~> c) | |
Defined in Data.Either.Singletons type Apply (Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679289091 :: b ~> c) = Either_Sym2 a6989586621679289090 a6989586621679289091 | |
| type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type) | |
| type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type) | |
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding # | |
| MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Traversable Maybe | Since: base-2.1 |
| Alternative Maybe | Since: base-2.1 |
| Applicative Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| Monad Maybe | Since: base-2.1 |
| MonadPlus Maybe | Since: base-2.1 |
| MonadFailure Maybe | |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| KnownNamedFunctor Maybe | |
| InjValue Maybe | |
Defined in Named.Internal | |
| SMonadFail Maybe | |
| PApplicative Maybe | |
| PFunctor Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| PMonad Maybe | |
| SAlternative Maybe | |
| SApplicative Maybe | |
Defined in Control.Monad.Singletons.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SFunctor Maybe | |
| SMonad Maybe | |
Defined in Control.Monad.Singletons.Internal Methods (%>>=) :: forall a b (t1 :: Maybe a) (t2 :: a ~> Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| SMonadPlus Maybe | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Generic1 Maybe | |
| MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class | |
| PMonadFail Maybe | |
Defined in Control.Monad.Fail.Singletons | |
| PAlternative Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| PMonadPlus Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| LorentzFunctor Maybe a b Source # | |
Defined in Lorentz.Instr | |
| IsoHKD Maybe (a :: Type) | |
| DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| ArithOpHs Div Integer Integer (Maybe Rational) Source # | |
Defined in Lorentz.CustomArith.RationalArith | |
| DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| ArithOpHs Div Integer Natural (Maybe Rational) Source # | |
Defined in Lorentz.CustomArith.RationalArith | |
| DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| ArithOpHs Div Natural Integer (Maybe Rational) Source # | |
Defined in Lorentz.CustomArith.RationalArith | |
| DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source # | |
Defined in Lorentz.CustomArith.FixedArith | |
| ArithOpHs Div Natural Natural (Maybe NRational) Source # | |
Defined in Lorentz.CustomArith.RationalArith | |
| (Selector s, GToJSON' enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.ToJSON | |
| CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source # | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Functor Maybe) | |
| () :=> (MonadPlus Maybe) | |
| Lift a => Lift (Maybe a :: Type) | |
| SingI1 (FromMaybeSym1 :: a -> TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (FromMaybeSym1 x) # | |
| SEq a => SingI1 (ElemIndexSym1 :: a -> TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (ElemIndexSym1 x) # | |
| SEq a => SingI1 (LookupSym1 :: a -> TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (LookupSym1 x) # | |
| SingI1 (Maybe_Sym1 :: b -> TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Maybe.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Maybe_Sym1 x) # | |
| SingI2 (Maybe_Sym2 :: b -> (a ~> b) -> TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons | |
| Structured a => Structured (Maybe a) | |
Defined in Distribution.Utils.Structured | |
| ToJSON a => ToJSON (Maybe a) | |
Defined in Data.Aeson.Types.ToJSON | |
| Data a => Data (Maybe a) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Generic (Maybe a) | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) | |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| At (Maybe a) | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| HasAnnotation a => HasAnnotation (Maybe a) Source # | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # | |
| MapOpHs (Maybe e) Source # | |
Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Maybe e) Source # | |
| HasRPCRepr a => HasRPCRepr (Maybe a) | |
Defined in Morley.AsRPC Associated Types type AsRPC (Maybe a) | |
| PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) # | |
| IsoValue a => IsoValue (Maybe a) | |
| Buildable a => Buildable (Maybe a) | |
Defined in Fmt.Buildable | |
| Pretty a => Pretty (Maybe a) | Ignore
|
Defined in Prettyprinter.Internal | |
| Semiring a => Semiring (Maybe a) | |
| PEq (Maybe a) | |
| SEq a => SEq (Maybe a) | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Ord.Singletons Methods sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| PSemigroup (Maybe a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
Defined in Text.Show.Singletons Methods sShowsPrec :: forall (t1 :: Natural) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| (TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class Methods toList :: Maybe a -> [Element (Maybe a)] # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # elem :: Element (Maybe a) -> Maybe a -> Bool # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) # safeMaximum :: Maybe a -> Maybe (Element (Maybe a)) # safeMinimum :: Maybe a -> Maybe (Element (Maybe a)) # safeFoldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # safeFoldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # | |
| SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SDecide a => TestEquality (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| (Semigroup a) :=> (Semigroup (Maybe a)) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Show a) :=> (Show (Maybe a)) | |
| (Eq a) :=> (Eq (Maybe a)) | |
| (Ord a) :=> (Ord (Maybe a)) | |
| Each (Maybe a) (Maybe b) a b | |
| SingI1 ('MaxInternal :: Maybe a -> MaxInternal a) | |
Defined in Data.Foldable.Singletons | |
| SingI1 ('MinInternal :: Maybe a -> MinInternal a) | |
Defined in Data.Foldable.Singletons | |
| SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI UnconsSymbolSym0 | |
Defined in GHC.TypeLits.Singletons Methods | |
| SuppressUnusedWarnings UnconsSymbolSym0 | |
Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetFirstSym0 # | |
| SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetLastSym0 # | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing MaybeToListSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing FromJustSym0 # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679188560Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120043Scrutinee_6989586621680119971Sym0 :: TyFun Symbol (TyFun k (Maybe (Char, Symbol)) -> Type) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a) -> Type) | |
Defined in Control.Monad.Fail.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679378397Sym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679378667LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing MapMaybeSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (FromMaybeSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing LookupSym0 # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing Maybe_Sym0 # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Control.Applicative.Singletons Methods sing :: Sing OptionalSym0 # | |
| SuppressUnusedWarnings (Foldr_6989586621680261256Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679378274Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261240Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261272Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679188560Sym1 a6989586621679188565 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378658Sym1 a6989586621679378663 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679625161Sym1 a6989586621679625166 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621679524064 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621679923128 :: TyFun [a] (Maybe [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621679765972 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378286Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261199MkJustSym0 :: TyFun k (TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261214MkJustSym0 :: TyFun k (TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251456NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251480NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251456MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251480MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI1 (FindIndexSym1 :: (a ~> Bool) -> TyFun [a] (Maybe Natural) -> Type) | |
Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindIndexSym1 x) # | |
| SingI1 (FindSym1 :: (a ~> Bool) -> TyFun [a] (Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI1 (MapMaybeSym1 :: (a ~> Maybe b) -> TyFun [a] [b] -> Type) | |
Defined in Data.Maybe.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (MapMaybeSym1 x) # | |
| SFoldable t => SingI1 (FindSym1 :: (a ~> Bool) -> TyFun (t a) (Maybe a) -> Type) | |
| SingI1 (UnfoldrSym1 :: (b ~> Maybe (a, b)) -> TyFun b [a] -> Type) | |
Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (UnfoldrSym1 x) # | |
| SingI d => SingI1 (Maybe_Sym2 d :: (a ~> b) -> TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Maybe_Sym2 d x) # | |
| SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym1 d) # | |
| (SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (LookupSym1 d) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SuppressUnusedWarnings (LiftA2_6989586621679378420Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679524039RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543622Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261100MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261121MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679378274Sym1 a6989586621679378279 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378407Sym1 a6989586621679378412 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261240Sym1 a6989586621680261249 :: TyFun (Maybe a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym0 :: TyFun Symbol (TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261272Sym1 a6989586621680261278 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261256Sym1 a6989586621680261262 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680186007Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680186243Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Lambda_6989586621680186007Sym1 a6989586621680186005 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679378420Sym1 a6989586621679378426 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621679521908 a6989586621679521909 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543622Sym1 a6989586621680543627 :: TyFun (Maybe a) (f (Maybe b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427 :: TyFun (Maybe b) (Maybe c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261100MfSym2 f6989586621680261098 xs6989586621680261099 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680261121MfSym3 f6989586621680261119 xs6989586621680261120 a6989586621680261122 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source # | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # | |
| Unwrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) Source # | |
| Wrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable | |
| HasRPCRepr a => HasRPCRepr (NamedF Maybe a name) | |
Defined in Morley.AsRPC | |
| IsoValue a => IsoValue (NamedF Maybe a name) | |
| type Failure Maybe | |
Defined in Basement.Monad | |
| type Rep1 Maybe | Since: base-4.6.0.0 |
| type Empty | |
Defined in Control.Monad.Singletons.Internal | |
| type Mzero | |
Defined in Control.Monad.Singletons.Internal | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Maybe m) | |
| type Length (arg :: Maybe a) | |
| type Maximum (arg :: Maybe a) | |
| type Minimum (arg :: Maybe a) | |
| type Null (arg :: Maybe a) | |
| type Product (arg :: Maybe a) | |
| type Sum (arg :: Maybe a) | |
| type ToList (arg :: Maybe a) | |
| type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type Fail a2 | |
| type Elem (arg1 :: a) (arg2 :: Maybe a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Sequence (arg :: Maybe (m a)) | |
| type SequenceA (arg :: Maybe (f a)) | |
| type (a2 :: Maybe a1) *> (a3 :: Maybe b) | |
| type (a1 :: k1) <$ (a2 :: Maybe b) | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) | |
| type (a2 :: Maybe a1) <|> (a3 :: Maybe a1) | |
| type (a2 :: Maybe a1) >> (a3 :: Maybe b) | |
| type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) | |
| type Apply UnconsSymbolSym0 (a6989586621679512089 :: Symbol) | |
Defined in GHC.TypeLits.Singletons | |
| type Apply (Pure_6989586621679378397Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679378403 :: a) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679028340 :: a) | |
| type Apply (Let6989586621679378667LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216793775176989586621679378666 :: k1) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type) (s6989586621680120042 :: k) | |
| type Apply (Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a (Maybe a) -> Type) (a6989586621680261202 :: a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a (Maybe a) -> Type) (a6989586621680261217 :: a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type) (y6989586621680251455 :: k) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type) (y6989586621680251479 :: k) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251455 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251479 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186009 :: k1) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186245 :: k1) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type) (a_69895866216801200046989586621680120015 :: k3) | |
Defined in Text.Show.Singletons type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type) (a_69895866216801200046989586621680120015 :: k3) = Let6989586621680120020Scrutinee_6989586621680119979 s6989586621680120019 p6989586621680120013 f6989586621680120014 a_69895866216801200046989586621680120015 | |
| type Apply (Let6989586621680261121MfSym3 f6989586621680261119 xs6989586621680261120 a6989586621680261122 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680261123 :: k3) | |
Defined in Data.Foldable.Singletons | |
| type Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127464 :: Natural) | |
| type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym0 :: TyFun Symbol (TyFun k (Maybe (Char, Symbol)) -> Type) -> Type) (sym6989586621680120041 :: Symbol) | |
Defined in Text.Show.Singletons | |
| type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679524064 :: a) | |
Defined in Data.Maybe.Singletons type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679524064 :: a) = FromMaybeSym1 a6989586621679524064 | |
| type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) (a6989586621679765963 :: a) | |
Defined in Data.List.Singletons.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) (a6989586621679765963 :: a) = ElemIndexSym1 a6989586621679765963 | |
| type Apply (TFHelper_6989586621679378286Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621679378291 :: a) | |
| type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679765670 :: a) | |
Defined in Data.List.Singletons.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679765670 :: a) = LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type | |
| type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679521908 :: b) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Let6989586621680261199MkJustSym0 :: TyFun k (TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) -> Type) (a_69895866216802611936989586621680261198 :: k) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680261199MkJustSym0 :: TyFun k (TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) -> Type) (a_69895866216802611936989586621680261198 :: k) = Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type | |
| type Apply (Let6989586621680261214MkJustSym0 :: TyFun k (TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type) -> Type) (a_69895866216802612086989586621680261213 :: k) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680261214MkJustSym0 :: TyFun k (TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type) -> Type) (a_69895866216802612086989586621680261213 :: k) = Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type | |
| type Apply (Let6989586621680251456NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680251454 :: k) | |
| type Apply (Let6989586621680251480NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k) | |
| type Apply (Let6989586621680251456MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251454 :: k1) | |
| type Apply (Let6989586621680251480MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k1) | |
| type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym0 :: TyFun Symbol (TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) -> Type) (s6989586621680120019 :: Symbol) | |
Defined in Text.Show.Singletons type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym0 :: TyFun Symbol (TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) -> Type) (s6989586621680120019 :: Symbol) = Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type | |
| type Apply (Foldl_6989586621680261272Sym1 a6989586621680261278 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680261279 :: b) | |
| type Apply (Foldr_6989586621680261256Sym1 a6989586621680261262 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680261263 :: b) | |
| type Apply (Lambda_6989586621680186007Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186005 :: k) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680186243Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186241 :: k) | |
| type Apply (Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680261120 :: k) | |
| type Apply (Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680261099 :: k) | |
| type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) (p6989586621680120013 :: k1) | |
Defined in Text.Show.Singletons type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) (p6989586621680120013 :: k1) = Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type | |
| type Apply (Let6989586621680261100MfSym2 f6989586621680261098 xs6989586621680261099 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680261101 :: k2) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) (f6989586621680120014 :: k2) | |
Defined in Text.Show.Singletons type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) (f6989586621680120014 :: k2) = Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type | |
| type Eval (FoldMap f ('Just x) :: a2 -> Type) | |
| type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Just x) :: a2 -> Type) | |
| type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Rep (Maybe a) | Since: base-4.6.0.0 |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type MapOpInpHs (Maybe e) Source # | |
Defined in Lorentz.Polymorphic | |
| type MapOpResHs (Maybe e) Source # | |
Defined in Lorentz.Polymorphic | |
| type AsRPC (Maybe a) | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type Element (Maybe a) | |
Defined in Universum.Container.Class | |
| type Mconcat (arg :: [Maybe a]) | |
| type Sconcat (arg :: NonEmpty (Maybe a)) | |
| type Show_ (arg :: Maybe a) | |
| type (arg1 :: Maybe a) /= (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) == (a3 :: Maybe a1) | |
| type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
| type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
| type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524081 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524078 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679524074 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Compare_6989586621679188560Sym1 a6989586621679188565 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679188566 :: Maybe a) | |
| type Apply (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) (a6989586621679136216 :: Maybe a) | |
| type Apply (FromMaybeSym1 a6989586621679524064 :: TyFun (Maybe a) a -> Type) (a6989586621679524065 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (FoldMap_6989586621680261240Sym1 a6989586621680261249 :: TyFun (Maybe a) m -> Type) (a6989586621680261250 :: Maybe a) | |
| type Apply (Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279 :: TyFun (Maybe a) b -> Type) (a6989586621680261280 :: Maybe a) | |
| type Apply (Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263 :: TyFun (Maybe a) b -> Type) (a6989586621680261264 :: Maybe a) | |
| type Apply (Maybe_Sym2 a6989586621679521908 a6989586621679521909 :: TyFun (Maybe a) b -> Type) (a6989586621679521910 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type ('Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680175058 :: First a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680175082 :: Last a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680249487 :: MaxInternal a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680249483 :: MinInternal a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680175055 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680175079 :: Maybe a) | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680249477 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680249480 :: Maybe a) | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679524059 :: Maybe a) | |
Defined in Data.Maybe.Singletons type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679524059 :: Maybe a) = MaybeToList a6989586621679524059 | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679524049 :: [Maybe a]) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621679481551 :: [Char]) | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679524055 :: [a]) | |
Defined in Data.Maybe.Singletons type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679524055 :: [a]) = ListToMaybe a6989586621679524055 | |
| type Apply (TFHelper_6989586621679378658Sym1 a6989586621679378663 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679378664 :: Maybe a) | |
| type Apply (TFHelper_6989586621679625161Sym1 a6989586621679625166 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679625167 :: Maybe a) | |
| type Apply (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765964 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765946 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (StripPrefixSym1 a6989586621679923128 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621679923129 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (StripPrefixSym1 a6989586621679923128 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621679923129 :: [a]) = StripPrefix a6989586621679923128 a6989586621679923129 | |
| type Apply (FindSym1 a6989586621679765972 :: TyFun [a] (Maybe a) -> Type) (a6989586621679765973 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680962105 :: f a) | |
Defined in Control.Applicative.Singletons | |
| type Apply (Fmap_6989586621679378274Sym1 a6989586621679378279 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378280 :: Maybe a) | |
| type Apply (TFHelper_6989586621679378407Sym1 a6989586621679378412 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378413 :: Maybe a) | |
| type Apply (TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679378292 :: Maybe b) | |
| type Apply (TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378440 :: Maybe b) | |
| type Apply (TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378592 :: Maybe b) | |
| type Apply (LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679765671 :: [(a, b)]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680260707 :: t a) | |
| type Apply (Traverse_6989586621680543622Sym1 a6989586621680543627 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680543628 :: Maybe a) | |
| type Apply (LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679378428 :: Maybe b) | |
| type Apply (Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680261102 :: Maybe k3) | |
Defined in Data.Foldable.Singletons | |
| type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
| type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
| type Eval (Init '[a2] :: Maybe [a1] -> Type) | |
| type Eval (Head ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Last ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
| type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) | |
| type Eval (Last '[a2] :: Maybe a1 -> Type) | |
| type Apply (Compare_6989586621679188560Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679188565 :: Maybe a) | |
| type Apply (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679378663 :: Maybe a) | |
| type Apply (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679625166 :: Maybe a) | |
| type Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679136215 :: Maybe a) | |
| type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621679923128 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621679923128 :: [a]) = StripPrefixSym1 a6989586621679923128 | |
| type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) | |
| type Apply (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621679378412 :: Maybe (a ~> b)) | |
| type Apply (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621679378576 :: Maybe a) | |
| type Apply (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378439 :: Maybe a) | |
| type Apply (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378591 :: Maybe a) | |
| type Apply (ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680127465 :: Maybe a) | |
| type Apply (LiftA2_6989586621679378420Sym1 a6989586621679378426 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621679378427 :: Maybe a) | |
| type Apply (Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680261122 :: Maybe k2) | |
Defined in Data.Foldable.Singletons | |
| type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) | |
| type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
| type Eval (NumIter a s :: Maybe (k, Nat) -> Type) | |
| type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
| type Eval (Lookup a as :: Maybe b -> Type) | |
| type Eval ('Just x <|> _1 :: Maybe a -> Type) | |
| type Eval (('Nothing :: Maybe a) <|> m :: Maybe a -> Type) | |
| type Eval (Map f ('Just a3) :: Maybe a2 -> Type) | |
| type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) | |
| type Apply (TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679378577 :: a ~> Maybe b) | |
| type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679765972 :: a ~> Bool) | |
| type Apply (Foldr_6989586621680261256Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261262 :: a ~> (b ~> b)) | |
| type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679524034 :: a ~> Maybe b) | |
Defined in Data.Maybe.Singletons type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679524034 :: a ~> Maybe b) = MapMaybeSym1 a6989586621679524034 | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680260706 :: a ~> Bool) | |
| type Apply (Fmap_6989586621679378274Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621679378279 :: a ~> b) | |
| type Apply (FoldMap_6989586621680261240Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680261249 :: a ~> m) | |
| type Apply (Foldl_6989586621680261272Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261278 :: b ~> (a ~> b)) | |
| type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621679766362 :: b ~> Maybe (a, b)) | |
Defined in Data.List.Singletons.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621679766362 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621679766362 | |
| type Apply (LiftA2_6989586621679378420Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621679378426 :: a ~> (b ~> c)) | |
| type Apply (Let6989586621679524039RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679524036 :: a ~> Maybe k1) | |
| type Apply (Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679521909 :: a ~> b) | |
Defined in Data.Maybe.Singletons type Apply (Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679521909 :: a ~> b) = Maybe_Sym2 a6989586621679521908 a6989586621679521909 | |
| type Apply (Traverse_6989586621680543622Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621680543627 :: a ~> f b) | |
| type Apply (Let6989586621680261100MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680261098 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680261100MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680261098 :: k2 ~> (k3 ~> k2)) = Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680261121MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680261119 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680261121MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680261119 :: k2 ~> (k3 ~> k3)) = Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680186007Sym1 a6989586621680186005 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680186006 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680186242 :: k1 ~> Last a) | |
| type Unwrappabled (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable | |
| type AsRPC (NamedF Maybe a name) | |
Defined in Morley.AsRPC | |
| type ToT (NamedF Maybe a name) | |
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy aundefined :: a
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| Proxy |
Instances
| Generic1 (Proxy :: k -> Type) | |
| Representable (Proxy :: Type -> Type) | |
| ToJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Proxy a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Proxy a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Proxy a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Proxy a] -> Encoding # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| NFData1 (Proxy :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 (Proxy :: Type -> Type) | |
Defined in Data.Hashable.Class | |
| PFoldable (Proxy :: Type -> Type) | |
| SFoldable (Proxy :: Type -> Type) | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable (Proxy :: Type -> Type) | |
| STraversable (Proxy :: Type -> Type) | |
Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Proxy a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Proxy (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Proxy a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Proxy (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| ToJSON (Proxy a) | |
Defined in Data.Aeson.Types.ToJSON | |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Generic (Proxy t) | |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| Semiring (Proxy a) | |
| SuppressUnusedWarnings (Product_6989586621680261677Sym0 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680261671Sym0 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fold_6989586621680261600Sym0 :: TyFun (Proxy m) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680261633Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680261642Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680230948Sym0 :: TyFun a (Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| TestCoercion (SProxy :: Proxy t -> Type) | |
Defined in Data.Proxy.Singletons | |
| TestEquality (SProxy :: Proxy t -> Type) | |
Defined in Data.Proxy.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680261633Sym1 a6989586621680261638 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680261642Sym1 a6989586621680261647 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261608Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680230880Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261592Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261621Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680230880Sym1 a6989586621680230885 :: TyFun (Proxy a) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230955Sym1 a6989586621680230960 :: TyFun (Proxy a) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680261592Sym1 a6989586621680261597 :: TyFun (Proxy a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230983Sym1 a6989586621680230988 :: TyFun (Proxy a) (Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230604Sym1 a6989586621680230609 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680230432Sym1 a6989586621680230437 :: TyFun (Proxy s) Ordering -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680230573Sym1 a6989586621680230578 :: TyFun (Proxy s) [Proxy s] -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543684Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapM_6989586621680543699Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261621Sym1 a6989586621680261627 :: TyFun b (Proxy a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261608Sym1 a6989586621680261614 :: TyFun b (Proxy a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628 :: TyFun (Proxy a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615 :: TyFun (Proxy a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680543684Sym1 a6989586621680543689 :: TyFun (Proxy a) (f (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapM_6989586621680543699Sym1 a6989586621680543704 :: TyFun (Proxy a) (m (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569 :: TyFun (Proxy s) [Proxy s] -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Proxy a) (arg2 :: Proxy b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a) | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Empty | |
Defined in Data.Proxy.Singletons | |
| type Mzero | |
Defined in Data.Proxy.Singletons | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Elem (a1 :: k1) (a2 :: Proxy k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) | |
| type (arg :: a) <$ (arg1 :: Proxy b) | |
| type (a2 :: Proxy a1) <|> (a3 :: Proxy a1) | |
| type Mplus (arg :: Proxy a) (arg1 :: Proxy a) | |
| type Apply (Pure_6989586621680230948Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680230952 :: a) | |
Defined in Data.Proxy.Singletons | |
| type Apply (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680261668 :: a) | |
| type Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) (a6989586621680230552 :: Natural) | |
| type Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680230480 :: Natural) | |
| type Apply (Foldl_6989586621680261621Sym1 a6989586621680261627 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261628 :: b) | |
| type Apply (Foldr_6989586621680261608Sym1 a6989586621680261614 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261615 :: b) | |
| type Rep (Proxy :: Type -> Type) | |
| type Fold (a :: Proxy k2) | |
| type Length (a2 :: Proxy a1) | |
| type Maximum (arg :: Proxy a) | |
| type Minimum (arg :: Proxy a) | |
| type Null (a2 :: Proxy a1) | |
| type Product (a :: Proxy k2) | |
| type Sum (a :: Proxy k2) | |
| type ToList (arg :: Proxy a) | |
| type Sequence (a2 :: Proxy (m a1)) | |
| type SequenceA (a2 :: Proxy (f a1)) | |
| type (arg :: Proxy a) *> (arg1 :: Proxy b) | |
| type (arg :: Proxy a) <* (arg1 :: Proxy b) | |
| type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1) | |
| type (arg :: Proxy a) >> (arg1 :: Proxy b) | |
| type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b) | |
| type Apply (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680230616 :: NonEmpty (Proxy s)) | |
| type Apply (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680230837 :: [Proxy s]) | |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
| type Demote (Proxy t) | |
Defined in Data.Proxy.Singletons | |
| type Sing | |
Defined in Data.Proxy.Singletons | |
| type Mempty | |
Defined in Data.Proxy.Singletons | |
| type MaxBound | |
Defined in Data.Proxy.Singletons | |
| type MinBound | |
Defined in Data.Proxy.Singletons | |
| type Mconcat (a :: [Proxy s]) | |
| type Sconcat (a :: NonEmpty (Proxy s)) | |
| type FromEnum (a :: Proxy s) | |
| type Pred (a :: Proxy s) | |
| type Succ (a :: Proxy s) | |
| type ToEnum a | |
| type Show_ (arg :: Proxy s) | |
| type (arg :: Proxy s) /= (arg1 :: Proxy s) | |
| type (a1 :: Proxy s) == (a2 :: Proxy s) | |
| type Mappend (arg :: Proxy s) (arg1 :: Proxy s) | |
| type (arg :: Proxy s) < (arg1 :: Proxy s) | |
| type (arg :: Proxy s) <= (arg1 :: Proxy s) | |
| type (arg :: Proxy s) > (arg1 :: Proxy s) | |
| type (arg :: Proxy s) >= (arg1 :: Proxy s) | |
| type Compare (a1 :: Proxy s) (a2 :: Proxy s) | |
| type Max (arg :: Proxy s) (arg1 :: Proxy s) | |
| type Min (arg :: Proxy s) (arg1 :: Proxy s) | |
| type (a1 :: Proxy s) <> (a2 :: Proxy s) | |
| type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s) | |
| type ShowList (arg :: [Proxy s]) arg1 | |
| type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s) | |
| type ShowsPrec a1 (a2 :: Proxy s) a3 | |
| type Apply (Product_6989586621680261677Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261681 :: Proxy a) | |
| type Apply (Sum_6989586621680261671Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261675 :: Proxy a) | |
| type Apply (Fold_6989586621680261600Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680261604 :: Proxy m) | |
| type Apply (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261669 :: Proxy a) | |
| type Apply (Foldl1_6989586621680261633Sym1 a6989586621680261638 :: TyFun (Proxy a) a -> Type) (a6989586621680261639 :: Proxy a) | |
| type Apply (Foldr1_6989586621680261642Sym1 a6989586621680261647 :: TyFun (Proxy a) a -> Type) (a6989586621680261648 :: Proxy a) | |
| type Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) (a6989586621680261654 :: Proxy a) | |
| type Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261660 :: Proxy a) | |
| type Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) (a6989586621680230546 :: Proxy s) | |
| type Apply (FoldMap_6989586621680261592Sym1 a6989586621680261597 :: TyFun (Proxy a) m -> Type) (a6989586621680261598 :: Proxy a) | |
| type Apply (Compare_6989586621680230432Sym1 a6989586621680230437 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680230438 :: Proxy s) | |
| type Apply (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) (a6989586621680230375 :: Proxy s) | |
| type Apply (Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628 :: TyFun (Proxy a) b -> Type) (a6989586621680261629 :: Proxy a) | |
| type Apply (Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615 :: TyFun (Proxy a) b -> Type) (a6989586621680261616 :: Proxy a) | |
| type Apply (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621680543696 :: Proxy (f a)) | |
| type Apply (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621680543711 :: Proxy (m a)) | |
| type Apply (EnumFromTo_6989586621680230573Sym1 a6989586621680230578 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230579 :: Proxy s) | |
| type Apply (Traverse_6989586621680543684Sym1 a6989586621680543689 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621680543690 :: Proxy a) | |
| type Apply (MapM_6989586621680543699Sym1 a6989586621680543704 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621680543705 :: Proxy a) | |
| type Apply (EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230570 :: Proxy s) | |
| type Apply (Foldl1_6989586621680261633Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261638 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680261642Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261647 :: a ~> (a ~> a)) | |
| type Apply (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680230960 :: Proxy (a ~> b)) | |
| type Apply (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680230988 :: Proxy a) | |
| type Apply (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230540 :: Proxy s) | |
| type Apply (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230534 :: Proxy s) | |
| type Apply (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680230609 :: Proxy s) | |
| type Apply (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680230437 :: Proxy s) | |
| type Apply (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680230568 :: Proxy s) | |
| type Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680230374 :: Proxy s) | |
| type Apply (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230578 :: Proxy s) | |
| type Apply (Foldr_6989586621680261608Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261614 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621680230880Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680230885 :: a ~> b) | |
| type Apply (FoldMap_6989586621680261592Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680261597 :: a ~> m) | |
| type Apply (Foldl_6989586621680261621Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261627 :: b ~> (a ~> b)) | |
| type Apply (Fmap_6989586621680230880Sym1 a6989586621680230885 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230886 :: Proxy a) | |
| type Apply (TFHelper_6989586621680230955Sym1 a6989586621680230960 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230961 :: Proxy a) | |
| type Apply (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680231029 :: Proxy a) | |
| type Apply (TFHelper_6989586621680230983Sym1 a6989586621680230988 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680230989 :: Proxy a) | |
| type Apply (TFHelper_6989586621680230604Sym1 a6989586621680230609 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230610 :: Proxy s) | |
| type Apply (EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230569 :: Proxy s) | |
| type Apply (ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680230481 :: Proxy s) | |
| type Apply (Traverse_6989586621680543684Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621680543689 :: a ~> f b) | |
| type Apply (MapM_6989586621680543699Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621680543704 :: a ~> m b) | |
| type Apply (TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680231030 :: a ~> Proxy b) | |
fromString :: IsString a => String -> a #
undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a #
undefined that leaves a warning in code on every usage.
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a #