Safe Haskell	Safe-Inferred
Language	Haskell2010

Lorentz

Synopsis

data Never
class Generic a
class Bounded a where
- minBound :: a
- maxBound :: a
class Eq a
class Eq a => Ord a
class Show a
class Semigroup a where
- (<>) :: a -> a -> a
- sconcat :: NonEmpty a -> a
- stimes :: Integral b => b -> a -> a
class Semigroup a => Monoid a where
- mempty :: a
- mappend :: a -> a -> a
- mconcat :: [a] -> a
data Bool
- = False
- | True
data Integer
data Maybe a
- = Nothing
- | Just a
data Rational
class a ~# b => (a :: k) ~ (b :: k)
data Either a b
- = Left a
- | Right b
data Proxy (t :: k) = Proxy
data Set a
data Map k a
type ($) (f :: k1 -> k) (a :: k1) = f a
data Natural
data ByteString
data Condition arg argl argr outb out where
- Holds :: Condition (Bool ': s) s s o o
- IsSome :: Condition (Maybe a ': s) (a ': s) s o o
- IsNone :: Condition (Maybe a ': s) s (a ': s) o o
- IsLeft :: Condition (Either l r ': s) (l ': s) (r ': s) o o
- IsRight :: Condition (Either l r ': s) (r ': s) (l ': s) o o
- IsCons :: Condition ([a] ': s) (a ': ([a] ': s)) s o o
- IsNil :: Condition ([a] ': s) s (a ': ([a] ': s)) o o
- Not :: Condition s s1 s2 ob o -> Condition s s2 s1 ob o
- IsZero :: (UnaryArithOpHs Eq' a, UnaryArithResHs Eq' a ~ Bool) => Condition (a ': s) s s o o
- IsEq :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- IsNeq :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- IsLt :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- IsGt :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- IsLe :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- IsGe :: NiceComparable a => Condition (a ': (a ': s)) s s o o
- NamedBinCondition :: Condition (a ': (a ': s)) s s o o -> Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
- PreserveArgsBinCondition :: (Dupable a, Dupable b) => (forall st o. Condition (a ': (b ': st)) st st o o) -> Condition (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) s
type (&) (a :: Type) (b :: [Type]) = a ': b
data FieldName (n :: Symbol) (p :: FieldRefTag)
type List = []
data PublicKey
data Div
class NonZero t where
- nonZero :: (t : s) :-> (Maybe t : s)
newtype Fixed (a :: k) = MkFixed Integer
newtype (inp :: [Type]) :-> (out :: [Type]) = LorentzInstr {
- unLorentzInstr :: RemFail Instr (ToTs inp) (ToTs out)
}
type Fn a b = '[a] :-> '[b]
type Value = Value' Instr
data Text
type HasField dt fname = (InstrGetFieldC dt fname, InstrSetFieldC dt fname)
type (:>) n ty = 'NamedEp n ty
data Blake2b :: HashAlgorithmKind
data Signature
class Default a where
- def :: a
type (?:) (n :: Symbol) (a :: k) = '(n, a)
newtype Hash (alg :: HashAlgorithmKind) a = UnsafeHash {
- unHash :: ByteString
}
data Label (name :: Symbol) where
- Label :: forall (name :: Symbol). KnownSymbol name => Label name
type (:?) (name :: Symbol) a = NamedF Maybe a name
type (:!) (name :: Symbol) a = NamedF Identity a name
data k ~> v
type (%>) = (:->)
data DType where
- DType :: forall a. TypeHasDoc a => Proxy a -> DType
type Expr inp out res = inp :-> (res : out)
newtype Range a = MkRangeII (Range' 'IncludeBoundary 'IncludeBoundary a)
data Rec (a :: u -> Type) (b :: [u]) where
- RNil :: forall {u} (a :: u -> Type). Rec a ('[] :: [u])
- (:&) :: forall {u} (a :: u -> Type) (r :: u) (rs :: [u]). !(a r) -> !(Rec a rs) -> Rec a (r ': rs)
type Address = Constrained (NullConstraint :: AddressKind -> Constraint) KindedAddress
type Lambda i o = WrappedLambda '[i] '[o]
newtype UParam (entries :: [EntrypointKind]) = UnsafeUParam (MText, ByteString)
newtype TAddress (p :: Type) (vd :: Type) = TAddress {
- unTAddress :: Address
}
newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
}
class ToAddress a where
- toAddress :: a -> Address
class ToTAddress (cp :: Type) (vd :: Type) (a :: Type) where
- toTAddress :: a -> TAddress cp vd
type ToTAddress_ cp vd addr = (ToTAddress cp vd addr, ToT addr ~ ToT Address)
class ToContractRef (cp :: Type) (contract :: Type) where
- toContractRef :: HasCallStack => contract -> ContractRef cp
class FromContractRef (cp :: Type) (contract :: Type) where
- fromContractRef :: ContractRef cp -> contract
class ToT cp ~ totcp => ImplicitContractParameter cp totcp
data EpAddress where
- EpAddress' {
  - eaAddress :: Address
  - eaEntrypoint :: EpName
  }
- pattern EpAddress :: forall (kind :: AddressKind). () => KindedAddress kind -> EpName -> EpAddress
data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
}
class WellTypedToT a => IsoValue a where
- type ToT a :: T
- toVal :: a -> Value (ToT a)
- fromVal :: Value (ToT a) -> a
type HasFieldOfType dt fname fieldTy = (HasField dt fname, GetFieldType dt fname ~ fieldTy)
type family HasFieldsOfType (dt :: Type) (fs :: [NamedField]) :: Constraint where ...
data NamedField = NamedField Symbol Type
type (:=) n ty = 'NamedField n ty
class HasDupableGetters a
type CaseTC dt out inp clauses = (InstrCaseC dt, RMap (CaseClauses dt), RecFromTuple clauses, clauses ~ Rec (CaseClauseL inp out) (CaseClauses dt))
class CaseArrow name body clause | clause -> name, clause -> body where
- (/->) :: Label name -> body -> clause
data CaseClauseL (inp :: [Type]) (out :: [Type]) (param :: CaseClauseParam) where
- CaseClauseL :: (AppendCtorField x inp :-> out) -> CaseClauseL inp out ('CaseClauseParam ctor x)
type InstrConstructC dt = (GenericIsoValue dt, GInstrConstruct (GRep dt) ('[] :: [Type]))
type ConstructorFieldTypes dt = GFieldTypes (GRep dt) ('[] :: [Type])
data AnnOptions = AnnOptions {
- fieldAnnModifier :: Text -> Text
}
data FollowEntrypointFlag
- = FollowEntrypoint
- | NotFollowEntrypoint
data GenerateFieldAnnFlag
- = GenerateFieldAnn
- | NotGenerateFieldAnn
class HasAnnotation a where
- getAnnotation :: FollowEntrypointFlag -> Notes (ToT a)
- annOptions :: Maybe AnnOptions
class GHasAnnotation a where
- gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType a), FieldAnn, VarAnn)
data BigMap k v
newtype BigMapId (k2 :: k) (v :: k1) = BigMapId {
- unBigMapId :: Natural
}
type Operation = Operation' Instr
data Ticket arg = Ticket {
- tTicketer :: Address
- tData :: arg
- tAmount :: Natural
}
type family ToT a :: T
class TypeHasFieldNamingStrategy (a :: k) where
- typeFieldNamingStrategy :: Text -> Text
class ArithOpHs (aop :: Type) (n :: Type) (m :: Type) (r :: Type) where
- evalArithOpHs :: (n : (m : s)) :-> (r : s)
class DefArithOp aop where
- defEvalOpHs :: (ArithOp aop n m, r ~ ArithRes aop n m) => Instr (n : (m : s)) (r : s)
class UnaryArithOpHs (aop :: Type) (n :: Type) where
- type UnaryArithResHs aop n :: Type
- evalUnaryArithOpHs :: (n : s) :-> (UnaryArithResHs aop n : s)
class DefUnaryArithOp aop where
- type DefUnaryArithOpExtraConstraints aop (n :: T) :: Constraint
- defUnaryArithOpHs :: (UnaryArithOp aop n, r ~ UnaryArithRes aop n, DefUnaryArithOpExtraConstraints aop n) => Instr (n : s) (r : s)
class ToIntegerArithOpHs (n :: Type) where
- evalToIntOpHs :: (n : s) :-> (Integer : s)
class ToBytesArithOpHs (n :: Type) where
- evalToBytesOpHs :: BytesLike bs => (n : s) :-> (bs : s)
class (KnownValue bs, ToT bs ~ ToT ByteString) => BytesLike bs where
- toBytes :: bs -> ByteString
class MapLorentzInstr instr where
- mapLorentzInstr :: (forall i o. (i :-> o) -> i :-> o) -> instr -> instr
type ContractOut st = '[([Operation], st)]
newtype ContractCode cp st = ContractCode {
- unContractCode :: '[(cp, st)] :-> ContractOut st
}
class IsNotInView
data SomeContractCode where
- SomeContractCode :: (NiceParameter cp, NiceStorage st) => ContractCode cp st -> SomeContractCode
type ViewCode arg st ret = '[(arg, st)] :-> '[ret]
data Contract cp st vd = (NiceParameter cp, NiceStorage st, NiceViewsDescriptor vd) => Contract {
- cMichelsonContract :: Contract (ToT cp) (ToT st)
- cDocumentedCode :: ~(ContractCode cp st)
}
data MText
newtype Packed a = Packed {
- unPacked :: ByteString
}
newtype TSignature a = TSignature {
- unTSignature :: Signature
}
data DHashAlgorithm
class Typeable alg => KnownHashAlgorithm (alg :: HashAlgorithmKind) where
- hashAlgorithmName :: Proxy alg -> Text
- computeHash :: ByteString -> ByteString
- toHash :: BytesLike bs => (bs : s) :-> (Hash alg bs : s)
data Sha256 :: HashAlgorithmKind
data Sha512 :: HashAlgorithmKind
data Sha3 :: HashAlgorithmKind
data Keccak :: HashAlgorithmKind
newtype ChestT a = ChestT {
- unChestT :: Chest
}
data OpenChestT a
- = ChestContentT a
- | ChestOpenFailedT Bool
type Markdown = Doc
class CanCastTo a b where
- castDummy :: Proxy a -> Proxy b -> ()
type Castable_ a b = (MichelsonCoercible a b, CanCastTo a b)
type Coercible_ a b = (MichelsonCoercible a b, CanCastTo a b, CanCastTo b a)
type MichelsonCoercible a b = ToT a ~ ToT b
class ToT s ~ ToT (Unwrappabled s) => Unwrappable (s :: Type) where
- type Unwrappabled s :: Type
class Unwrappable s => Wrappable (s :: Type)
type Entrypoint param store = '[param, store] :-> ContractOut store
type Entrypoint_ store = '[store] :-> ContractOut store
type NiceParameterFull cp = (Typeable cp, ParameterDeclaresEntrypoints cp)
data DupableDecision a
- = Dupable a => IsDupable
- | IsNotDupable
type NiceViews vs = RequireAllUnique "view" (ViewsNames vs)
type NiceViewsDescriptor vd = NiceViews (RevealViews vd)
class (ComparabilityScopeC (NiceComparable n) (ToT n), KnownValue n) => NiceComparable n
class (ConstantScopeC (NiceConstant a) (ToT a), KnownValue a) => NiceConstant a
class (DupableScopeC (Dupable a) (ToT a), KnownValue a) => Dupable a
type NiceFullPackedValue a = (NicePackedValue a, NiceUnpackedValue a)
class (PackedValScopeC (NicePackedValue a) (ToT a), KnownValue a) => NicePackedValue a
class (ParameterScopeC (NiceParameter a) (ToT a), KnownValue a) => NiceParameter a
class (UntypedValScopeC (NiceUntypedValue a) (ToT a), KnownValue a) => NiceUntypedValue a
class (StorageScopeC (NiceStorage a) (ToT a), KnownValue a) => NiceStorage a
type NiceStorageFull a = (NiceStorage a, HasAnnotation a)
class (UnpackedValScopeC (NiceUnpackedValue a) (ToT a), KnownValue a) => NiceUnpackedValue a
class (ViewableScopeC (NiceViewable a) (ToT a), KnownValue a) => NiceViewable a
class (KnownValue n, ForbidManyT (NiceNoBigMap n) '['PSBigMap] (ToT n)) => NiceNoBigMap n
class (ForbidNestedBigMaps (ToT a), IsoValue a) => CanHaveBigMap a
class (IsoValue a, Typeable a) => KnownValue a
class (ForbidOp (ToT a), IsoValue a) => NoOperation a
class (ForbidContract (ToT a), IsoValue a) => NoContractType a
class (ForbidBigMap (ToT a), IsoValue a) => NoBigMap a
type family (name :: Symbol) ?:: (tys :: (Type, Type)) where ...
class LorentzRounding a b where
- round_ :: (a : s) :-> (b : s)
- ceil_ :: (a : s) :-> (b : s)
- floor_ :: (a : s) :-> (b : s)
newtype NFixed p = MkNFixed Natural
type LorentzFixedBaseKind = LorentzFixedBaseKindTag -> Type
data DecBase :: Nat -> LorentzFixedBaseKind
data BinBase :: Nat -> LorentzFixedBaseKind
class Typeable a => LorentzFixedBase a where
- getBase :: Num b => b
data NRational
class Unwrappable r => LorentzRational r where
- numerator :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (a : s)
- denominator :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (Natural : s)
- deconstructRational :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (a : (Natural : s))
- constructRational :: Unwrappabled r ~ (a, Natural) => (a : (Natural : s)) :-> (r : s)
- unsafePairToRational :: Unwrappabled r ~ (a, Natural) => ((a, Natural) : s) :-> (r : s)
- uncheckedPairToRational :: Unwrappabled r ~ (a, Natural) => ((a, Natural) : s) :-> (r : s)
- pairToRational :: (Unwrappabled r ~ (a, Natural), KnownValue r) => ((a, Natural) : s) :-> (Maybe r : s)
- oppositeRational :: (r : s) :-> (r : s)
- reduce :: (r : s) :-> (r : s)
data DView = DView {
- dvName :: ViewName
- dvSub :: SubDoc
}
data DViewArg = forall a.(NiceViewable a, TypeHasDoc a) => DViewArg (Proxy a)
data DViewRet = forall a.(NiceViewable a, TypeHasDoc a) => DViewRet (Proxy a)
data DViewDesc = forall vd.ViewsDescriptorHasDoc vd => DViewDesc (Proxy vd)
class (Typeable vd, RenderViewsImpl (RevealViews vd)) => ViewsDescriptorHasDoc (vd :: Type) where
- viewsDescriptorName :: Proxy vd -> Text
- renderViewsDescriptorDoc :: Proxy vd -> Doc
data DocElem d = DocElem {
- deItem :: d
- deSub :: Maybe SubDoc
}
class (Typeable d, DOrd d) => DocItem d where
- type DocItemPlacement d :: DocItemPlacementKind
- type DocItemReferenced d :: DocItemReferencedKind
- docItemPos :: Natural
- docItemSectionName :: Maybe Text
- docItemSectionDescription :: Maybe Markdown
- docItemSectionNameStyle :: DocSectionNameStyle
- docItemRef :: d -> DocItemRef (DocItemPlacement d) (DocItemReferenced d)
- docItemToMarkdown :: HeaderLevel -> d -> Markdown
- docItemToToc :: HeaderLevel -> d -> Markdown
- docItemDependencies :: d -> [SomeDocDefinitionItem]
- docItemsOrder :: [d] -> [d]
newtype DocItemId = DocItemId Text
data DocItemPlacementKind
- = DocItemInlined
- | DocItemInDefinitions
newtype DocItemPos = DocItemPos (Natural, Text)
data DocItemRef (p :: DocItemPlacementKind) (r :: DocItemReferencedKind) where
- DocItemRef :: DocItemId -> DocItemRef 'DocItemInDefinitions 'True
- DocItemRefInlined :: DocItemId -> DocItemRef 'DocItemInlined 'True
- DocItemNoRef :: DocItemRef 'DocItemInlined 'False
data DocSection = DocItem d => DocSection (NonEmpty $ DocElem d)
data DocSectionNameStyle
- = DocSectionNameBig
- | DocSectionNameSmall
data SomeDocItem where
- SomeDocItem :: forall d. DocItem d => d -> SomeDocItem
data SomeDocDefinitionItem where
- SomeDocDefinitionItem :: forall d. (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => d -> SomeDocDefinitionItem
newtype SubDoc = SubDoc DocBlock
type DocGrouping = SubDoc -> SomeDocItem
data ContractDoc = ContractDoc {
- cdContents :: DocBlock
- cdDefinitions :: DocBlock
- cdDefinitionsSet :: Set SomeDocDefinitionItem
- cdDefinitionIds :: Set DocItemId
}
newtype DGeneralInfoSection = DGeneralInfoSection SubDoc
data DName = DName Text SubDoc
data DDescription = DDescription Markdown
data DEntrypointExample = forall t.ParameterScope t => DEntrypointExample (Value t)
data DGitRevision
- = DGitRevisionKnown DGitRevisionInfo
- | DGitRevisionUnknown
newtype GitRepoSettings = GitRepoSettings {
- grsMkGitRevision :: Text -> Text
}
data DComment = DComment Text
data DAnchor = DAnchor Anchor
class ContainsDoc a where
- buildDocUnfinalized :: a -> ContractDoc
class ContainsDoc a => ContainsUpdateableDoc a where
- modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> a -> a
data WithFinalizedDoc a
class (Typeable a, SingI (TypeDocFieldDescriptions a), FieldDescriptionsValid (TypeDocFieldDescriptions a) a) => TypeHasDoc a where
- type TypeDocFieldDescriptions a :: FieldDescriptions
- typeDocName :: Proxy a -> Text
- typeDocMdDescription :: Markdown
- typeDocMdReference :: Proxy a -> WithinParens -> Markdown
- typeDocDependencies :: Proxy a -> [SomeDocDefinitionItem]
- typeDocHaskellRep :: TypeDocHaskellRep a
- typeDocMichelsonRep :: TypeDocMichelsonRep a
data SomeTypeWithDoc where
- SomeTypeWithDoc :: forall td. TypeHasDoc td => Proxy td -> SomeTypeWithDoc
type family HaveCommonTypeCtor (a :: k) (b :: k) where ...
class IsHomomorphic (a :: k)
class EntrypointsDerivation deriv cp where
- type EpdAllEntrypoints deriv cp :: [(Symbol, Type)]
- type EpdLookupEntrypoint deriv cp :: Symbol -> Exp (Maybe Type)
- epdNotes :: (Notes (ToT cp), RootAnn)
- epdCall :: ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint deriv cp name))
- epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints deriv cp)
class (EntrypointsDerivation (ParameterEntrypointsDerivation cp) cp, RequireAllUniqueEntrypoints cp) => ParameterHasEntrypoints cp where
- type ParameterEntrypointsDerivation cp :: Type
type ParameterDeclaresEntrypoints cp = (If (CanHaveEntrypoints cp) (ParameterHasEntrypoints cp) (() :: Constraint), NiceParameter cp, EntrypointsDerivation (GetParameterEpDerivation cp) cp)
type family AllParameterEntrypoints (cp :: Type) :: [(Symbol, Type)] where ...
type family LookupParameterEntrypoint (cp :: Type) :: Symbol -> Exp (Maybe Type) where ...
type GetEntrypointArg cp name = Eval (LiftM2 FromMaybe (TError (('Text "Entrypoint not found: " ':<>: 'ShowType name) ':$$: (('Text "In contract parameter `" ':<>: 'ShowType cp) ':<>: 'Text "`"))) (LookupParameterEntrypoint cp name))
type GetDefaultEntrypointArg cp = Eval (LiftM2 FromMaybe (Pure cp) (LookupParameterEntrypoint cp DefaultEpName))
type ForbidExplicitDefaultEntrypoint cp = Eval (LiftM3 UnMaybe (Pure (Pure (() :: Constraint))) (TError ('Text "Parameter used here must have no explicit \"default\" entrypoint" ':$$: (('Text "In parameter type `" ':<>: 'ShowType cp) ':<>: 'Text "`"))) (LookupParameterEntrypoint cp DefaultEpName))
type NoExplicitDefaultEntrypoint cp = Eval (LookupParameterEntrypoint cp DefaultEpName) ~ 'Nothing
data EntrypointRef (mname :: Maybe Symbol) where
- CallDefault :: EntrypointRef 'Nothing
- Call :: NiceEntrypointName name => EntrypointRef ('Just name)
type family GetEntrypointArgCustom cp mname :: Type where ...
class HasEntrypointArg cp name arg where
- useHasEntrypointArg :: name -> (Dict (ParameterScope (ToT arg)), EpName)
type HasDefEntrypointArg cp defEpName defArg = (defEpName ~ EntrypointRef 'Nothing, HasEntrypointArg cp defEpName defArg)
type HasEntrypointOfType param con exp = (GetEntrypointArgCustom param ('Just con) ~ exp, ParameterDeclaresEntrypoints param)
type family ParameterContainsEntrypoints param (fields :: [NamedEp]) :: Constraint where ...
newtype TrustEpName = TrustEpName EpName
type RequireAllUniqueEntrypoints cp = RequireAllUniqueEntrypoints' (ParameterEntrypointsDerivation cp) cp
data EpdNone
data EpdPlain
data EpdRecursive
data EpdDelegate
data EpdWithRoot (r :: Symbol) epd
newtype ParameterWrapper (deriv :: Type) cp = ParameterWrapper {
- unParameterWraper :: cp
}
newtype ShouldHaveEntrypoints a = ShouldHaveEntrypoints {
- unHasEntrypoints :: a
}
data DEntrypoint (kind :: Type) = DEntrypoint {
- depName :: Text
- depSub :: SubDoc
}
class Typeable ep => EntrypointKindHasDoc (ep :: Type) where
- type EntrypointKindOverride ep
- entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride ep == ep) ~ False)
- entrypointKindPos :: Natural
- entrypointKindSectionName :: Text
- entrypointKindSectionDescription :: Maybe Markdown
data DEntrypointReference = DEntrypointReference Text Anchor
class EntryArrow kind name body where
- (#->) :: (Label name, Proxy kind) -> body -> body
data PlainEntrypointsKind
type FlattenedEntrypointsKind = FlattenedEntrypointsKindHiding '[]
data FlattenedEntrypointsKindHiding (hiddenEntrypoints :: [Symbol])
data CommonContractBehaviourKind
data CommonEntrypointsBehaviourKind kind
data SomeEntrypointArg = forall a.(NiceParameter a, TypeHasDoc a) => SomeEntrypointArg (Proxy a)
data DEntrypointArg = DEntrypointArg {
- epaArg :: Maybe SomeEntrypointArg
- epaBuilding :: [ParamBuildingStep]
}
class KnownSymbol con => DeriveCtorFieldDoc con (cf :: CtorField) where
- deriveCtorFieldDoc :: DEntrypointArg
newtype ParamBuilder = ParamBuilder {
- unParamBuilder :: Markdown -> Markdown
}
data ParamBuildingDesc = ParamBuildingDesc {
- pbdEnglish :: Markdown
- pbdHaskell :: ParamBuilder
- pbdMichelson :: ParamBuilder
}
data ParamBuildingStep
- = PbsWrapIn Text ParamBuildingDesc
- | PbsCallEntrypoint EpName
- | PbsCustom ParamBuildingDesc
- | PbsUncallable [ParamBuildingStep]
type DocumentEntrypoints kind a = (Generic a, GDocumentEntrypoints (BuildEPTree' a) kind (GRep a) '[])
type family RequireFlatParamEps cp :: Constraint where ...
type family RequireFlatEpDerivation cp deriv :: Constraint where ...
data EpName
class ErrorHasDoc e => IsError e where
- errorToVal :: e -> (forall t. ErrorScope t => Value t -> r) -> r
- errorFromVal :: SingI t => Value t -> Either Text e
- failUsing :: IsError e => e -> s :-> t
type ErrorScope t = ConstantScope t
class ConstantScopeC (ConstantScope t) t => ConstantScope (t :: T)
class Typeable e => ErrorHasDoc (e :: Type) where
- type ErrorRequirements e :: Constraint
- errorDocName :: Text
- errorDocMdCause :: Markdown
- errorDocMdCauseInEntrypoint :: Markdown
- errorDocHaskellRep :: Markdown
- errorDocClass :: ErrorClass
- errorDocDependencies :: [SomeDocDefinitionItem]
- errorDocRequirements :: Dict (ErrorRequirements e)
data UnspecifiedError = UnspecifiedError
data Impossible (reason :: Symbol) = HasCallStack => Impossible
data SomeError = forall e.(IsError e, Eq e) => SomeError e
data NoErrorArg
data UnitErrorArg
type family ErrorArg (tag :: Symbol) :: Type
data CustomError (tag :: Symbol) = CustomError {
- ceTag :: Label tag
- ceArg :: CustomErrorRep tag
}
type CustomErrorRep tag = CustomErrorArgRep (ErrorArg tag)
class IsCustomErrorArgRep a where
- verifyErrorTag :: MText -> a -> Either Text a
- customErrorRepDocDeps :: [SomeDocDefinitionItem]
- customErrorHaskellRep :: (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown
type MustHaveErrorArg errorTag expectedArgRep = FailUnlessEqual (CustomErrorRep errorTag) expectedArgRep ((('Text "Error argument type is " ':<>: 'ShowType expectedArgRep) ':<>: 'Text " but given error requires argument of type ") ':<>: 'ShowType (CustomErrorRep errorTag))
data ErrorClass
- = ErrClassActionException
- | ErrClassBadArgument
- | ErrClassContractInternal
- | ErrClassUnknown
class (KnownSymbol tag, TypeHasDoc (CustomErrorRep tag), IsError (CustomError tag)) => CustomErrorHasDoc tag where
- customErrDocMdCause :: Markdown
- customErrDocMdCauseInEntrypoint :: Markdown
- customErrClass :: ErrorClass
- customErrArgumentSemantics :: Maybe Markdown
data DError where
- DError :: ErrorHasDoc e => Proxy e -> DError
data DThrows where
- DThrows :: ErrorHasDoc e => Proxy e -> DThrows
type ErrorTagMap = Bimap Natural MText
type ErrorTagExclusions = HashSet MText
data DDescribeErrorTagMap = DDescribeErrorTagMap {
- detmSrcLoc :: Text
}
data NumericErrorDocHandler
data NumericErrorDocHandlerError
data NumericErrorWrapper (numTag :: Nat) (err :: Type)
type ConstraintDUPNLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDUPN n (ToTs inp) (ToTs out) (ToT a), ConstraintDUPN' Type n inp out a, SingI n)
type ConstraintDIGLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDIG n (ToTs inp) (ToTs out) (ToT a), ConstraintDIG' Type n inp out a, SingI n)
type ConstraintDUGLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDUG n (ToTs inp) (ToTs out) (ToT a), ConstraintDUG' Type n inp out a, SingI n)
type ConstraintPairGetLorentz (n :: Nat) (pair :: Type) = (ConstraintGetN (ToPeano n) (ToT pair), ToT (PairGetHs (ToPeano n) pair) ~ GetN (ToPeano n) (ToT pair), SingIPeano n)
type family PairGetHs (ix :: Peano) (pair :: Type) :: Type where ...
type ConstraintPairUpdateLorentz (n :: Nat) (val :: Type) (pair :: Type) = (ConstraintUpdateN (ToPeano n) (ToT pair), ToT (PairUpdateHs (ToPeano n) val pair) ~ UpdateN (ToPeano n) (ToT val) (ToT pair), SingIPeano n)
type family PairUpdateHs (ix :: Peano) (val :: Type) (pair :: Type) :: Type where ...
type ConstraintDIPNLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]) = (ConstraintDIPN n (ToTs inp) (ToTs out) (ToTs s) (ToTs s'), ConstraintDIPN' Type n inp out s s', SingI n)
data ReadTicket a = ReadTicket {
- rtTicketer :: Address
- rtData :: a
- rtAmount :: Natural
}
class LorentzFunctor (c :: Type -> Type) a b where
- lmap :: KnownValue b => ('[a] :-> '[b]) -> (c a : s) :-> (c b : s)
data LIso a b = LIso {
- liTo :: forall s. (a : s) :-> (b : s)
- liFrom :: forall s. (b : s) :-> (a : s)
}
data WrappedLambda i o
- = WrappedLambda (i :-> o)
- | RecLambda ((i ++ '[WrappedLambda i o]) :-> o)
type ErrInstr s = forall serr. s :-> serr
type ConstraintReplaceNLorentz (n :: Peano) (s :: [Type]) (a :: Type) (mid :: [Type]) (tail :: [Type]) = (ReplaceNConstraint' T n (ToTs s) (ToT a) (ToTs mid) (ToTs tail), ReplaceNConstraint' Type n s a mid tail)
type ConstraintUpdateNLorentz (n :: Peano) (s :: [Type]) (a :: Type) (b :: Type) (mid :: [Type]) (tail :: [Type]) = (UpdateNConstraint' T n (ToTs s) (ToT a) (ToT b) (ToTs mid) (ToTs tail), UpdateNConstraint' Type n s a b mid tail)
class ReplaceN (n :: Peano) (s :: [Type]) (a :: Type) mid tail where
- replaceNImpl :: (a ': s) :-> s
class UpdateN (n :: Peano) (s :: [Type]) (a :: Type) (b :: Type) mid tail where
- updateNImpl :: ('[a, b] :-> '[b]) -> (a ': s) :-> s
data View_ (a :: Type) (r :: Type) = View_ {
- viewParam :: a
- viewCallbackTo :: ContractRef r
}
data Void_ (a :: Type) (b :: Type) = Void_ {
- voidParam :: a
- voidResProxy :: Lambda b b
}
newtype VoidResult r = VoidResult {
- unVoidResult :: r
}
data IDiv
data IMod
class (MemOp (ToT c), ToT (MemOpKeyHs c) ~ MemOpKey (ToT c)) => MemOpHs c where
- type MemOpKeyHs c :: Type
class (MapOp (ToT c), ToT (MapOpInpHs c) ~ MapOpInp (ToT c), ToT (MapOpResHs c ()) ~ MapOpRes (ToT c) (ToT ())) => MapOpHs c where
- type MapOpInpHs c :: Type
- type MapOpResHs c :: Type -> Type
class (IterOp (ToT c), ToT (IterOpElHs c) ~ IterOpEl (ToT c)) => IterOpHs c where
- type IterOpElHs c :: Type
class SizeOp (ToT c) => SizeOpHs c
class (UpdOp (ToT c), ToT (UpdOpKeyHs c) ~ UpdOpKey (ToT c), ToT (UpdOpParamsHs c) ~ UpdOpParams (ToT c)) => UpdOpHs c where
- type UpdOpKeyHs c :: Type
- type UpdOpParamsHs c :: Type
class (GetOp (ToT c), ToT (GetOpKeyHs c) ~ GetOpKey (ToT c), ToT (GetOpValHs c) ~ GetOpVal (ToT c)) => GetOpHs c where
- type GetOpKeyHs c :: Type
- type GetOpValHs c :: Type
class ConcatOp (ToT c) => ConcatOpHs c
class SliceOp (ToT c) => SliceOpHs c
type family IsoMapOpRes c b where ...
data RangeBoundaryInclusion
- = IncludeBoundary
- | ExcludeBoundary
newtype RangeIE a = MkRangeIE (Range' 'IncludeBoundary 'ExcludeBoundary a)
newtype RangeEI a = MkRangeEI (Range' 'ExcludeBoundary 'IncludeBoundary a)
newtype RangeEE a = MkRangeEE (Range' 'ExcludeBoundary 'ExcludeBoundary a)
data OnRangeAssertFailure a = OnRangeAssertFailure {
- orafUnderflow :: forall s any. (RangeFailureInfo a : s) :-> any
- orafOverflow :: forall s any. (RangeFailureInfo a : s) :-> any
}
data RangeFailureInfo a = RangeFailureInfo {
- rfiInclusive :: Bool
- rfiBoundary :: a
- rfiValue :: a
}
class (DefaultToInclusive r, Typeable r) => RangeBoundary r where
- isInclusive :: Bool
class (RangeBoundary lower, RangeBoundary upper, ToT (range a) ~ ToT (a, a), KnownValue (range a), Coercible range (Range' lower upper)) => NiceRange range lower upper a | range -> lower upper, lower upper -> range
class CanCheckEmpty l u
class IsCondition cond arg argl argr outb out where
- ifThenElse :: cond -> (argl :-> outb) -> (argr :-> outb) -> arg :-> out
class st ~ (Head st ': Tail st) => DupT (a :: Type) (st :: [Type]) where
- dupT :: st :-> (a : st)
class dipInp ~ (a ': Tail dipInp) => DipT a inp dipInp dipOut out | inp a -> dipInp, dipOut inp a -> out, inp out a -> dipOut where
- dipT :: (dipInp :-> dipOut) -> inp :-> out
class HasNamedVar s name var | s name -> var
type family HasNamedVars s vs where ...
type VarIsUnnamed x = VarName x ~ 'VarUnnamed
data CompilationOptions = CompilationOptions {
- coOptimizerConf :: Maybe OptimizerConf
- coStringTransformer :: (Bool, MText -> MText)
- coBytesTransformer :: (Bool, ByteString -> ByteString)
}
data ContractData cp st vd = (NiceParameterFull cp, NiceStorageFull st, NiceViewsDescriptor vd) => ContractData {
- cdCode :: ContractCode cp st
- cdViews :: Rec (ContractView st) (RevealViews vd)
- cdCompilationOptions :: CompilationOptions
}
data ContractView st (v :: ViewTyInfo) where
- ContractView :: (KnownSymbol name, NiceViewable arg, NiceViewable ret, HasAnnotation arg, HasAnnotation ret) => ViewCode arg st ret -> ContractView st ('ViewTyInfo name arg ret)
data ZippedStackRepr a b = a ::: b
data ZSNil = ZSNil
type FieldRefKind = FieldRefTag -> Type
data FieldRefTag
class KnownFieldRef (ty :: k) where
- type FieldRefObject ty = (fr :: FieldRefKind) | fr -> ty
- mkFieldRef :: FieldRefObject ty p
type FieldRef name = FieldRefObject name 'FieldRefTag
type FieldSymRef name = FieldRef (name :: Symbol)
class FieldRefHasFinalName fr where
- type FieldRefFinalName fr :: Symbol
- fieldRefFinalName :: FieldRef fr -> Label (FieldRefFinalName fr)
class StoreHasField store fname ftype | store fname -> ftype where
- storeFieldOps :: StoreFieldOps store fname ftype
data StoreFieldOps store fname ftype = StoreFieldOps {
- sopToField :: forall s. FieldRef fname -> (store : s) :-> (ftype : s)
- sopGetFieldOpen :: forall res s. HasDupableGetters store => ('[ftype] :-> '[res, ftype]) -> ('[ftype] :-> '[res]) -> FieldRef fname -> (store : s) :-> (res : (store : s))
- sopSetFieldOpen :: forall new s. ('[new, ftype] :-> '[ftype]) -> FieldRef fname -> (new : (store : s)) :-> (store : s)
}
class StoreHasSubmap store mname key value | store mname -> key value where
- storeSubmapOps :: StoreSubmapOps store mname key value
data StoreSubmapOps store mname key value = StoreSubmapOps {
- sopMem :: forall s. FieldRef mname -> (key : (store : s)) :-> (Bool : s)
- sopGet :: forall s. KnownValue value => FieldRef mname -> (key : (store : s)) :-> (Maybe value : s)
- sopUpdate :: forall s. FieldRef mname -> (key : (Maybe value : (store : s))) :-> (store : s)
- sopGetAndUpdate :: forall s. FieldRef mname -> (key : (Maybe value : (store : s))) :-> (Maybe value : (store : s))
- sopDelete :: forall s. FieldRef mname -> (key : (store : s)) :-> (store : s)
- sopInsert :: forall s. FieldRef mname -> (key : (value : (store : s))) :-> (store : s)
}
class StoreHasEntrypoint store epName epParam epStore | store epName -> epParam epStore where
- storeEpOps :: StoreEntrypointOps store epName epParam epStore
data StoreEntrypointOps store epName epParam epStore = StoreEntrypointOps {
- sopToEpLambda :: forall s. Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : s)
- sopSetEpLambda :: forall s. HasDupableGetters store => Label epName -> (EntrypointLambda epParam epStore : (store : s)) :-> (store : s)
- sopToEpStore :: forall s. Label epName -> (store : s) :-> (epStore : s)
- sopSetEpStore :: forall s. Label epName -> (epStore : (store : s)) :-> (store : s)
}
type EntrypointLambda param store = Lambda (param, store) ([Operation], store)
type EntrypointsField param store = BigMap MText (EntrypointLambda param store)
data param ::-> store
type family StorageContains store (content :: [NamedField]) :: Constraint where ...
data ((l :: k1) :-| (r :: k2)) (p :: FieldRefTag) = (FieldRef l) :-| (FieldRef r)
data SelfRef (p :: FieldRefTag) = SelfRef
data FieldAlias (alias :: k) (p :: FieldRefTag)
type FieldNickname alias = FieldAlias (alias :: Symbol)
type EntrypointKind = (Symbol, Type)
data ConstrainedSome (c :: Type -> Constraint) where
- ConstrainedSome :: c a => a -> ConstrainedSome c
class UnpackUParam (c :: Type -> Constraint) entries where
- unpackUParam :: UParam entries -> Either EntrypointLookupError (MText, ConstrainedSome c)
type SomeInterface = '['("SomeEntrypoints", Void)]
type UParam_ = UParam SomeInterface
type EntrypointsImpl inp out entries = Rec (CaseClauseU inp out) entries
type UParamFallback inp out = ((MText, ByteString) : inp) :-> out
data EntrypointLookupError
- = NoSuchEntrypoint MText
- | ArgumentUnpackFailed
class CaseUParam (entries :: [EntrypointKind])
type family LookupEntrypoint (name :: Symbol) (entries :: [EntrypointKind]) :: Type where ...
type family RequireUniqueEntrypoints (entries :: [EntrypointKind]) :: Constraint where ...
type UParamLinearize p = (NiceGeneric p, GUParamLinearize (GRep p))
type UParamLinearized p = GUParamLinearized (GRep p)
type WellTypedToT a = (IsoValue a, WellTyped (ToT a))
data Mutez
data Timestamp
data ChainId
type KeyHash = Hash 'HashKindPublicKey
data Bls12381Fr
data Bls12381G1
data Bls12381G2
data Chest
data ChestKey
data OpenChest
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)
newtype PrintAsValue a = PrintAsValue a
data ViewTyInfo = ViewTyInfo Symbol Type Type
type (>->) arg ret = '(arg, ret)
data ViewsList (vl :: [ViewTyInfo])
type family RevealViews (desc :: Type) :: [ViewTyInfo]
type family LookupView (name :: Symbol) (views :: [ViewTyInfo]) :: (Type, Type) where ...
type LookupRevealView name viewRef = LookupView name (RevealViews viewRef)
type HasView vd name arg ret = LookupRevealView name vd ~ '(arg, ret)
type family ViewsNames (vs :: [ViewTyInfo]) :: [Symbol] where ...
newtype ViewName where
- UnsafeViewName {
  - unViewName :: Text
  }
- pattern ViewName :: Text -> ViewName
data ViewInterface = ViewInterface {
- viName :: ViewName
- viArg :: T
- viRet :: T
}
type DemoteViewsDescriptor vd = DemoteViewTyInfo (RevealViews vd)
data ViewInterfaceMatchError
- = VIMViewNotFound ViewName
- | VIMViewArgMismatch (MismatchError T)
- | VIMViewRetMismatch (MismatchError T)
type family TypeDocFieldDescriptions a :: FieldDescriptions
type family DocItemPlacement d :: DocItemPlacementKind
type family DocItemReferenced d :: DocItemReferencedKind
data GenericStrategy
pattern I :: Instr (ToTs inp) (ToTs out) -> inp :-> out
pattern FI :: (forall out'. Instr (ToTs inp) out') -> inp :-> out
pattern DEntrypointDocItem :: DEntrypoint kind -> SomeDocItem
pattern DefEpName :: EpName
some :: (a : s) :-> (Maybe a : s)
div :: forall r n m s. ArithOpHs Div n m r => (n : (m : s)) :-> (r : s)
return :: Monad m => a -> m a
(>>) :: (a :-> b) -> (b :-> c) -> a :-> c
abs :: UnaryArithOpHs Abs n => (n : s) :-> (UnaryArithResHs Abs n : s)
negate :: Num a => a -> a
fromInteger :: (HasCallStack, Integral a) => Integer -> a
compare :: NiceComparable n => (n : (n : s)) :-> (Integer : s)
fromString :: IsString a => String -> a
pure :: Applicative f => a -> f a
get :: (GetOpHs c, KnownValue (GetOpValHs c)) => (GetOpKeyHs c : (c : s)) :-> (Maybe (GetOpValHs c) : s)
map :: (MapOpHs c, IsoMapOpRes c b, KnownValue b, HasCallStack) => ((MapOpInpHs c : s) :-> (b : s)) -> (c : s) :-> (MapOpResHs c b : s)
($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
not :: UnaryArithOpHs Not n => (n : s) :-> (UnaryArithResHs Not n : s)
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a
undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
(.) :: (b -> c) -> (a -> b) -> a -> c
take :: Expr (a : s) s a
drop :: (a : s) :-> s
concat :: ConcatOpHs c => (c : (c : s)) :-> (c : s)
and :: ArithOpHs And n m r => (n : (m : s)) :-> (r : s)
or :: ArithOpHs Or n m r => (n : (m : s)) :-> (r : s)
failWith :: forall a s t. NiceConstant a => (a : s) :-> t
assert :: IsError err => err -> (Bool : s) :-> s
loop :: (s :-> (Bool : s)) -> (Bool : s) :-> s
(|||) :: ArithOpHs Or a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
pack :: forall a s. NicePackedValue a => (a : s) :-> (Packed a : s)
unpack :: forall a s. NiceUnpackedValue a => (Packed a : s) :-> (Maybe a : s)
view :: forall name arg ret p vd s. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret, HasView vd name arg ret) => (arg : (TAddress p vd : s)) :-> (ret : s)
(&) :: a -> (a -> b) -> b
size :: SizeOpHs c => (c : s) :-> (Natural : s)
sha256 :: BytesLike bs => (bs : s) :-> (Hash Sha256 bs : s)
sha512 :: BytesLike bs => (bs : s) :-> (Hash Sha512 bs : s)
xor :: ArithOpHs Xor n m r => (n : (m : s)) :-> (r : s)
eq :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
apply :: forall a b c s. (NiceConstant a, KnownValue b) => (a : (Lambda (a, b) c : s)) :-> (Lambda b c : s)
right :: forall a b s. KnownValue a => (b : s) :-> (Either a b : s)
left :: forall a b s. KnownValue b => (a : s) :-> (Either a b : s)
unit :: s :-> (() : s)
pair :: (a : (b : s)) :-> ((a, b) : s)
int :: ToIntegerArithOpHs i => (i : s) :-> (Integer : s)
pairE :: (Expr s0 s1 a, Expr s1 s2 b) -> Expr s0 s2 (a, b)
(!) :: WithParam p fn fn' => fn -> Param p -> fn'
inRange :: (NiceRange range lower upper a, Ord a) => range a -> a -> Bool
swap :: (a : (b : s)) :-> (b : (a : s))
fromLabel :: IsLabel x a => a
getField :: forall dt name st. (InstrGetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (dt : st) :-> (GetFieldType dt name : (dt ': st))
withDict :: HasDict c e => e -> (c => r) -> r
cast :: KnownValue a => (a : s) :-> (a : s)
dup :: forall a s. Dupable a => (a : s) :-> (a : (a : s))
cons :: (a : (List a : s)) :-> (List a : s)
setField :: forall dt name st. InstrSetFieldC dt name => Label name -> (GetFieldType dt name ': (dt ': st)) :-> (dt ': st)
sub :: ArithOpHs Sub n m r => (n : (m : s)) :-> (r : s)
update :: UpdOpHs c => (UpdOpKeyHs c : (UpdOpParamsHs c : (c : s))) :-> (c : s)
emit :: forall t s. (NicePackedValue t, HasAnnotation t) => FieldAnn -> (t : s) :-> (Operation : s)
add :: ArithOpHs Add n m r => (n : (m : s)) :-> (r : s)
mul :: ArithOpHs Mul n m r => (n : (m : s)) :-> (r : s)
isEmpty :: SizeOpHs c => (c : s) :-> (Bool : s)
contract :: forall p vd addr s. (NiceParameterFull p, ForbidExplicitDefaultEntrypoint p, ToTAddress_ p vd addr) => (addr : s) :-> (Maybe (ContractRef p) : s)
balance :: s :-> (Mutez : s)
bytes :: (BytesLike bs, ToBytesArithOpHs i) => (i : s) :-> (bs : s)
iter :: (IterOpHs c, HasCallStack) => ((IterOpElHs c : s) :-> s) -> (c : s) :-> s
never :: (Never : s) :-> s'
push :: forall t s. NiceConstant t => t -> s :-> (t : s)
none :: forall a s. KnownValue a => s :-> (Maybe a : s)
(#) :: (a :-> b) -> (b :-> c) -> a :-> c
(<.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
non :: (NiceConstant a, NiceComparable a) => a -> (a : s) :-> (Maybe a : s)
non' :: NiceConstant a => ('[a] :-> '[Bool]) -> (a : s) :-> (Maybe a : s)
listE :: KnownValue a => [Expr s s a] -> Expr s s [a]
ge :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
nat :: BytesLike bs => (bs : s) :-> (Natural : s)
nil :: KnownValue p => s :-> (List p : s)
toCamel :: Text -> Text
toPascal :: Text -> Text
toSnake :: Text -> Text
slice :: (SliceOpHs c, KnownValue c) => (Natural : (Natural : (c : s))) :-> (Maybe c : s)
asAddressOf :: contract cp st vd -> Address -> TAddress cp vd
asAddressOf_ :: contract cp st vd -> (Address : s) :-> (TAddress cp vd : s)
callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp)
toTAddress_ :: forall cp addr vd s. ToTAddress_ cp vd addr => (addr : s) :-> (TAddress cp vd : s)
convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
toField :: forall dt name st. InstrGetFieldC dt name => Label name -> (dt : st) :-> (GetFieldType dt name : st)
toFieldNamed :: forall dt name st. InstrGetFieldC dt name => Label name -> (dt : st) :-> ((name :! GetFieldType dt name) : st)
getFieldNamed :: forall dt name st. (InstrGetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (dt : st) :-> ((name :! GetFieldType dt name) : (dt ': st))
modifyField :: forall dt name st. (InstrGetFieldC dt name, InstrSetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (forall st0. (GetFieldType dt name ': st0) :-> (GetFieldType dt name ': st0)) -> (dt : st) :-> (dt : st)
construct :: forall dt st. (InstrConstructC dt, RMap (ConstructorFieldTypes dt)) => Rec (FieldConstructor st) (ConstructorFieldTypes dt) -> st :-> (dt : st)
constructT :: forall dt fctors st. (InstrConstructC dt, RMap (ConstructorFieldTypes dt), fctors ~ Rec (FieldConstructor st) (ConstructorFieldTypes dt), RecFromTuple fctors) => IsoRecTuple fctors -> st :-> (dt : st)
constructStack :: forall dt fields st. (InstrConstructC dt, fields ~ ConstructorFieldTypes dt, (ToTs fields ++ ToTs st) ~ ToTs (fields ++ st)) => (fields ++ st) :-> (dt : st)
deconstruct :: forall dt fields st. (InstrDeconstructC dt (ToTs st), fields ~ GFieldTypes (GRep dt) '[], (ToTs fields ++ ToTs st) ~ ToTs (fields ++ st)) => (dt : st) :-> (fields ++ st)
fieldCtor :: HasCallStack => (st :-> (f : st)) -> FieldConstructor st f
wrap_ :: forall dt name st. InstrWrapC dt name => Label name -> AppendCtorField (GetCtorField dt name) st :-> (dt : st)
wrapOne :: forall dt name st. InstrWrapOneC dt name => Label name -> (CtorOnlyField name dt ': st) :-> (dt : st)
case_ :: forall dt out inp. (InstrCaseC dt, RMap (CaseClauses dt)) => Rec (CaseClauseL inp out) (CaseClauses dt) -> (dt : inp) :-> out
caseT :: forall dt out inp clauses. CaseTC dt out inp clauses => IsoRecTuple clauses -> (dt : inp) :-> out
unsafeUnwrap_ :: forall dt name st. InstrUnwrapC dt name => Label name -> (dt : st) :-> (CtorOnlyField name dt ': st)
getFieldOpen :: forall dt name res st. (InstrGetFieldC dt name, HasDupableGetters dt) => ('[GetFieldType dt name] :-> '[res, GetFieldType dt name]) -> ('[GetFieldType dt name] :-> '[res]) -> Label name -> (dt : st) :-> (res : (dt ': st))
setFieldOpen :: forall dt name new st. InstrSetFieldC dt name => ('[new, GetFieldType dt name] :-> '[GetFieldType dt name]) -> Label name -> (new ': (dt ': st)) :-> (dt ': st)
dropPrefix :: Text -> Text
appendTo :: Text -> [Text] -> Text -> Text
stripFieldPrefix :: Text -> Text
ctorNameToAnnWithOptions :: forall ctor. (KnownSymbol ctor, HasCallStack) => AnnOptions -> FieldAnn
gGetAnnotationNoField :: forall a. (GHasAnnotation (GRep a), GValueType (GRep a) ~ ToT a) => FollowEntrypointFlag -> Notes (ToT a)
insertTypeAnn :: forall (b :: T). TypeAnn -> Notes b -> Notes b
iGenericIf :: (forall s'. Instr (ToTs a) s' -> Instr (ToTs b) s' -> Instr (ToTs c) s') -> (a :-> s) -> (b :-> s) -> c :-> s
iAnyCode :: (inp :-> out) -> Instr (ToTs inp) (ToTs out)
iNonFailingCode :: HasCallStack => (inp :-> out) -> Instr (ToTs inp) (ToTs out)
iMapAnyCode :: (forall o'. Instr (ToTs i1) o' -> Instr (ToTs i2) o') -> (i1 :-> o) -> i2 :-> o
iForceNotFail :: (i :-> o) -> i :-> o
parseLorentzValue :: forall v. KnownValue v => MichelsonSource -> Text -> Either ParseLorentzError v
transformStringsLorentz :: Bool -> (MText -> MText) -> (inp :-> out) -> inp :-> out
transformBytesLorentz :: Bool -> (ByteString -> ByteString) -> (inp :-> out) -> inp :-> out
optimizeLorentz :: (inp :-> out) -> inp :-> out
optimizeLorentzWithConf :: OptimizerConf -> (inp :-> out) -> inp :-> out
mkContractCode :: (IsNotInView => '[(cp, st)] :-> ContractOut st) -> ContractCode cp st
toMichelsonContract :: Contract cp st vd -> Contract (ToT cp) (ToT st)
lSign :: (MonadRandom m, BytesLike a) => SecretKey -> a -> m (TSignature a)
toHashHs :: forall alg bs. (BytesLike bs, KnownHashAlgorithm alg) => bs -> Hash alg bs
openChestT :: BytesLike a => (ChestKey : (ChestT a : (Natural : s))) :-> (OpenChestT a : s)
castDummyG :: (Generic a, Generic b, GCanCastTo (GRep a) (GRep b)) => Proxy a -> Proxy b -> ()
checkedCoerce :: forall a b. (CanCastTo a b, Coercible a b) => a -> b
checkedCoerce_ :: forall a b s. Castable_ a b => (a : s) :-> (b : s)
checkedCoercing_ :: forall a b s. Coercible_ a b => ((b ': s) :-> (b ': s)) -> (a ': s) :-> (a ': s)
allowCheckedCoerceTo :: forall b a. Dict (CanCastTo a b)
allowCheckedCoerce :: forall a b. Dict (CanCastTo a b, CanCastTo b a)
coerceUnwrap :: forall a s. Unwrappable a => (a : s) :-> (Unwrappabled a : s)
unsafeCoerceWrap :: forall a s. Unwrappable a => (Unwrappabled a : s) :-> (a : s)
coerceWrap :: forall a s. Wrappable a => (Unwrappabled a : s) :-> (a : s)
toNamed :: Label name -> (a : s) :-> ((name :! a) : s)
fromNamed :: Label name -> ((name :! a) : s) :-> (a : s)
forcedCoerce :: Coercible a b => a -> b
forcedCoerce_ :: MichelsonCoercible a b => (a : s) :-> (b : s)
gForcedCoerce_ :: MichelsonCoercible (t a) (t b) => (t a : s) :-> (t b : s)
fakeCoerce :: s1 :-> s2
fakeCoercing :: (s1 :-> s2) -> s1' :-> s2'
decideOnDupable :: forall a. KnownValue a => DupableDecision a
convertFixedToRational :: forall a s. HasResolution a => (Fixed a : s) :-> (Rational : s)
convertNFixedToRational :: forall a s. HasResolution a => (NFixed a : s) :-> (Rational : s)
convertRationalToFixed :: forall a s. HasResolution a => (Rational : s) :-> (Fixed a : s)
convertRationalToNFixed :: forall a s. HasResolution a => (Rational : s) :-> (Maybe (NFixed a) : s)
unsafeConvertRationalToNFixed :: forall a s. HasResolution a => (Rational : s) :-> (NFixed a : s)
convertFixedToNRational :: forall a s. HasResolution a => (Fixed a : s) :-> (Maybe NRational : s)
unsafeConvertFixedToNRational :: forall a s. HasResolution a => (Fixed a : s) :-> (NRational : s)
convertNFixedToNRational :: forall a s. HasResolution a => (NFixed a : s) :-> (NRational : s)
convertNRationalToFixed :: forall a s. HasResolution a => (NRational : s) :-> (Fixed a : s)
convertNRationalToNFixed :: forall a s. HasResolution a => (NRational : s) :-> (NFixed a : s)
castNFixedToFixed :: (NFixed p : s) :-> (Fixed p : s)
castFixedToNFixed :: (Fixed p : s) :-> (Maybe (NFixed p) : s)
unsafeCastFixedToNFixed :: (Fixed p : s) :-> (NFixed p : s)
resolution_ :: forall a. HasResolution a => Natural
toFixed :: forall a f base t s. (a ~ f (base t), LorentzFixedBase base, Unwrappable a, KnownNat t, ArithOpHs Mul Natural (Unwrappabled a) (Unwrappabled a)) => (Unwrappabled a : s) :-> (a : s)
fromFixed :: forall a f base t s. (a ~ f (base t), ToT (f (base 0)) ~ ToT (Unwrappabled a), LorentzRounding a (f (base 0))) => (a : s) :-> (Unwrappabled a : s)
gcdEuclid :: (Natural : (Natural : s)) :-> (Natural : s)
euclidExtendedNormalization :: forall s. (Rational : s) :-> (Rational : s)
tripleMul :: forall r a s. (ArithOpHs Mul a a a, Unwrappabled r ~ (a, Natural), LorentzRational r) => (r : (r : (r : s))) :-> (r : s)
mkRational :: (Integer, Natural) -> Either Text Rational
(%!) :: Integer -> Natural -> Rational
mkNRational :: (Natural, Natural) -> Either Text NRational
(%%!) :: Natural -> Natural -> NRational
mkRational_ :: (forall s0. ErrInstr (("numerator" :! Integer, "denominator" :! Natural) : s0)) -> (Integer : (Natural : s)) :-> (Rational : s)
doc :: DocItem di => di -> s :-> s
docGroup :: DocItem di => (SubDoc -> di) -> (inp :-> out) -> inp :-> out
dStorage :: TypeHasDoc store => DStorageType
contractGeneralDefault :: s :-> s
cutLorentzNonDoc :: (inp :-> out) -> s :-> s
docItemPosition :: DocItem d => DocItemPos
mkDEntrypointExample :: forall a. NiceParameter a => a -> DEntrypointExample
mkDGitRevision :: ExpQ
morleyRepoSettings :: GitRepoSettings
dTypeDep :: TypeHasDoc t => SomeDocDefinitionItem
docDefinitionRef :: (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => Markdown -> d -> Markdown
contractDocToMarkdown :: ContractDoc -> LText
subDocToMarkdown :: HeaderLevel -> SubDoc -> Markdown
docItemSectionRef :: DocItem di => Maybe Markdown
finalizedAsIs :: a -> WithFinalizedDoc a
buildDoc :: ContainsDoc a => WithFinalizedDoc a -> ContractDoc
buildMarkdownDoc :: ContainsDoc a => WithFinalizedDoc a -> LText
modifyDoc :: (ContainsUpdateableDoc a, DocItem i1, DocItem i2) => (i1 -> Maybe i2) -> a -> a
attachDocCommons :: ContainsUpdateableDoc a => DGitRevision -> a -> WithFinalizedDoc a
typeDocBuiltMichelsonRep :: TypeHasDoc a => Proxy a -> Doc
genericTypeDocDependencies :: (Generic a, GTypeHasDoc (GRep a)) => Proxy a -> [SomeDocDefinitionItem]
customTypeDocMdReference :: (Text, DType) -> [DType] -> WithinParens -> Markdown
homomorphicTypeDocMdReference :: (Typeable t, TypeHasDoc t, IsHomomorphic t) => Proxy t -> WithinParens -> Markdown
poly1TypeDocMdReference :: forall (t :: Type -> Type) r a. (r ~ t a, Typeable t, Each '[TypeHasDoc] '[r, a], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown
poly2TypeDocMdReference :: forall (t :: Type -> Type -> Type) r a b. (r ~ t a b, Typeable t, Each '[TypeHasDoc] '[r, a, b], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown
homomorphicTypeDocHaskellRep :: (Generic a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep a
concreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a), HaveCommonTypeCtor b a) => TypeDocHaskellRep b
unsafeConcreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep b
haskellAddNewtypeField :: Text -> TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepNoFields :: TypeDocHaskellRep a -> TypeDocHaskellRep a
homomorphicTypeDocMichelsonRep :: KnownIsoT a => TypeDocMichelsonRep a
concreteTypeDocMichelsonRep :: (Typeable a, KnownIsoT a, HaveCommonTypeCtor b a) => TypeDocMichelsonRep b
unsafeConcreteTypeDocMichelsonRep :: forall {k} a (b :: k). (Typeable a, KnownIsoT a) => TypeDocMichelsonRep b
mdTocFromRef :: (DocItem d, DocItemReferenced d ~ 'True) => HeaderLevel -> Markdown -> d -> Markdown
parameterEntrypointsToNotes :: forall cp. ParameterDeclaresEntrypoints cp => ParamNotes (ToT cp)
parameterEntrypointCall :: forall cp name. ParameterDeclaresEntrypoints cp => Label name -> EntrypointCall cp (GetEntrypointArg cp name)
parameterEntrypointCallDefault :: forall cp. ParameterDeclaresEntrypoints cp => EntrypointCall cp (GetDefaultEntrypointArg cp)
sepcCallRootChecked :: forall cp. (NiceParameter cp, ForbidExplicitDefaultEntrypoint cp) => SomeEntrypointCall cp
eprName :: forall mname. EntrypointRef mname -> EpName
parameterEntrypointCallCustom :: forall cp mname. ParameterDeclaresEntrypoints cp => EntrypointRef mname -> EntrypointCall cp (GetEntrypointArgCustom cp mname)
entrypointSection :: EntrypointKindHasDoc kind => Text -> Proxy kind -> (i :-> o) -> i :-> o
diEntrypointToMarkdown :: HeaderLevel -> DEntrypoint level -> Markdown
mkPbsWrapIn :: Text -> ParamBuilder -> ParamBuildingStep
clarifyParamBuildingSteps :: ParamBuildingStep -> (inp :-> out) -> inp :-> out
emptyDEpArg :: DEntrypointArg
mkUType :: forall (x :: T). Notes x -> Ty
mkDEpUType :: forall t. HasAnnotation t => Ty
mkDEntrypointArgSimple :: forall t. (NiceParameter t, TypeHasDoc t) => DEntrypointArg
documentEntrypoint :: forall kind epName param s out. (KnownSymbol epName, DocItem (DEntrypoint kind), NiceParameter param, TypeHasDoc param) => ((param : s) :-> out) -> (param : s) :-> out
entryCase :: forall dt entrypointKind out inp clauses. (CaseTC dt out inp clauses, DocumentEntrypoints entrypointKind dt) => Proxy entrypointKind -> IsoRecTuple clauses -> (dt : inp) :-> out
entryCase_ :: forall dt entrypointKind out inp. (InstrCaseC dt, RMap (CaseClauses dt), DocumentEntrypoints entrypointKind dt) => Proxy entrypointKind -> Rec (CaseClauseL inp out) (CaseClauses dt) -> (dt : inp) :-> out
finalizeParamCallingDoc :: forall cp inp out. (NiceParameterFull cp, RequireSumType cp, HasCallStack) => ((cp : inp) :-> out) -> (cp : inp) :-> out
finalizeParamCallingDoc' :: forall cp inp out. (NiceParameterFull cp, HasCallStack) => Proxy cp -> (inp :-> out) -> inp :-> out
areFinalizedParamBuildingSteps :: [ParamBuildingStep] -> Bool
entryCaseSimple_ :: forall cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints PlainEntrypointsKind cp, RequireFlatParamEps cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out
entryCaseSimple :: forall cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints PlainEntrypointsKind cp, RequireFlatParamEps cp) => IsoRecTuple clauses -> (cp : inp) :-> out
entryCaseFlattened_ :: forall cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints FlattenedEntrypointsKind cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out
entryCaseFlattened :: forall cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints FlattenedEntrypointsKind cp) => IsoRecTuple clauses -> (cp : inp) :-> out
entryCaseFlattenedHiding_ :: forall heps cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints (FlattenedEntrypointsKindHiding heps) cp, HasEntrypoints (ParameterEntrypointsDerivation cp) cp heps) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out
entryCaseFlattenedHiding :: forall heps cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints (FlattenedEntrypointsKindHiding heps) cp, HasEntrypoints (ParameterEntrypointsDerivation cp) cp heps) => IsoRecTuple clauses -> (cp : inp) :-> out
isoErrorToVal :: (KnownError e, IsoValue e) => e -> (forall t. ErrorScope t => Value t -> r) -> r
isoErrorFromVal :: (SingI t, KnownIsoT e, IsoValue e) => Value t -> Either Text e
simpleFailUsing :: forall e s t. IsError e => e -> s :-> t
typeDocMdDescriptionReferToError :: forall e. IsError e => Markdown
isInternalErrorClass :: ErrorClass -> Bool
failUnexpected :: MText -> s :-> t
failCustom :: forall tag err s any. (MustHaveErrorArg tag (MText, err), CustomErrorHasDoc tag, KnownError err) => Label tag -> (err : s) :-> any
failCustom_ :: forall tag s any. (MustHaveErrorArg tag (MText, ()), CustomErrorHasDoc tag) => Label tag -> s :-> any
failCustomNoArg :: forall tag s any. (MustHaveErrorArg tag MText, CustomErrorHasDoc tag) => Label tag -> s :-> any
errorTagToText :: forall tag. KnownSymbol tag => Text
errorTagToMText :: Label tag -> MText
gatherErrorTags :: (inp :-> out) -> HashSet MText
addNewErrorTags :: ErrorTagMap -> HashSet MText -> ErrorTagMap
buildErrorTagMap :: HashSet MText -> ErrorTagMap
excludeErrorTags :: HasCallStack => ErrorTagExclusions -> ErrorTagMap -> ErrorTagMap
applyErrorTagMap :: HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out
applyErrorTagMapWithExclusions :: HasCallStack => ErrorTagMap -> ErrorTagExclusions -> (inp :-> out) -> inp :-> out
useNumericErrors :: HasCallStack => (inp :-> out) -> (inp :-> out, ErrorTagMap)
errorFromValNumeric :: (SingI t, IsError e) => ErrorTagMap -> Value t -> Either Text e
errorToValNumeric :: IsError e => ErrorTagMap -> e -> (forall t. ConstantScope t => Value t -> r) -> r
applyErrorTagToErrorsDoc :: HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out
applyErrorTagToErrorsDocWith :: HasCallStack => [NumericErrorDocHandler] -> ErrorTagMap -> (inp :-> out) -> inp :-> out
customErrorDocHandler :: NumericErrorDocHandler
voidResultDocHandler :: NumericErrorDocHandler
baseErrorDocHandlers :: [NumericErrorDocHandler]
unaryExpr :: (forall s. (a : s) :-> (r : s)) -> Expr s0 s1 a -> Expr s0 s1 r
($:) :: (forall s. (a : s) :-> (r : s)) -> Expr s0 s1 a -> Expr s0 s1 r
binaryExpr :: (forall s. (a : (b : s)) :-> (r : s)) -> Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|+|) :: ArithOpHs Add a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|-|) :: ArithOpHs Sub a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|*|) :: ArithOpHs Mul a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|==|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|/=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|<|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|>|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|<=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|>=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool
(|&|) :: ArithOpHs And a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|.|.|) :: ArithOpHs Or a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|^|) :: ArithOpHs Xor a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|<<|) :: ArithOpHs Lsl a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|>>|) :: ArithOpHs Lsr a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r
(|:|) :: Expr s0 s1 a -> Expr s1 s2 [a] -> Expr s0 s2 [a]
(|@|) :: Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 (a, b)
(|%!|) :: Expr s0 s1 Integer -> Expr s1 s2 Natural -> Expr s0 s2 Rational
transferTokensE :: (NiceParameter p, IsNotInView) => ("arg" :! Expr s0 s1 p) -> ("amount" :! Expr s1 s2 Mutez) -> ("contract" :! Expr s2 s3 (ContractRef p)) -> Expr s0 s3 Operation
createContractE :: IsNotInView => ("delegate" :! Expr s0 s1 (Maybe KeyHash)) -> ("balance" :! Expr s1 s2 Mutez) -> ("storage" :! Expr s2 s3 st) -> ("contract" :! Contract p st vd) -> Expr s0 (TAddress p vd : s3) Operation
viewE :: forall name arg ret p vd s0 s1 s2. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret, HasView vd name arg ret) => ("arg" :! Expr s0 s1 arg) -> ("address" :! Expr s1 s2 (TAddress p vd)) -> Expr s0 s2 ret
stackRef :: forall (gn :: Nat) st n. (n ~ ToPeano gn, SingI n, RequireLongerThan st n) => PrintComment st
printComment :: PrintComment (ToTs s) -> s :-> s
justComment :: Text -> s :-> s
comment :: CommentType -> s :-> s
commentAroundFun :: Text -> (i :-> o) -> i :-> o
commentAroundStmt :: Text -> (i :-> o) -> i :-> o
testAssert :: HasCallStack => Text -> PrintComment (ToTs inp) -> (inp :-> (Bool : out)) -> inp :-> inp
stackType :: forall s. s :-> s
nop :: s :-> s
dropN :: forall (n :: Nat) (s :: [Type]). (SingIPeano n, RequireLongerOrSameLength (ToTs s) (ToPeano n), Drop (ToPeano n) (ToTs s) ~ ToTs (Drop (ToPeano n) s)) => s :-> Drop (ToPeano n) s
dupNPeano :: forall (n :: Peano) a inp out. (ConstraintDUPNLorentz n inp out a, Dupable a) => inp :-> out
dupN :: forall (n :: Nat) a inp out. (ConstraintDUPNLorentz (ToPeano n) inp out a, Dupable a) => inp :-> out
digPeano :: forall (n :: Peano) inp out a. ConstraintDIGLorentz n inp out a => inp :-> out
dig :: forall (n :: Nat) inp out a. ConstraintDIGLorentz (ToPeano n) inp out a => inp :-> out
dugPeano :: forall (n :: Peano) inp out a. ConstraintDUGLorentz n inp out a => inp :-> out
dug :: forall (n :: Nat) inp out a. ConstraintDUGLorentz (ToPeano n) inp out a => inp :-> out
ifNone :: (s :-> s') -> ((a : s) :-> s') -> (Maybe a : s) :-> s'
car :: ((a, b) : s) :-> (a : s)
cdr :: ((a, b) : s) :-> (b : s)
unpair :: ((a, b) : s) :-> (a : (b : s))
ifLeft :: ((a : s) :-> s') -> ((b : s) :-> s') -> (Either a b : s) :-> s'
emptySet :: NiceComparable e => s :-> (Set e : s)
emptyMap :: (NiceComparable k, KnownValue v) => s :-> (Map k v : s)
emptyBigMap :: (NiceComparable k, NiceNoBigMap v) => s :-> (BigMap k v : s)
mem :: MemOpHs c => (MemOpKeyHs c : (c : s)) :-> (Bool : s)
pairGet :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz n pair => (pair : s) :-> (PairGetHs (ToPeano n) pair : s)
getAndUpdate :: (GetOpHs c, UpdOpHs c, KnownValue (GetOpValHs c), UpdOpKeyHs c ~ GetOpKeyHs c) => (UpdOpKeyHs c : (UpdOpParamsHs c : (c : s))) :-> (Maybe (GetOpValHs c) : (c : s))
pairUpdate :: forall (n :: Nat) (val :: Type) (pair :: Type) (s :: [Type]). ConstraintPairUpdateLorentz n val pair => (val : (pair : s)) :-> (PairUpdateHs (ToPeano n) val pair : s)
failingWhenPresent :: forall c k s v st e. (MemOpHs c, k ~ MemOpKeyHs c, NiceConstant e, Dupable c, Dupable (MemOpKeyHs c), st ~ (k : (v : (c : s)))) => (forall s0. (k : s0) :-> (e : s0)) -> st :-> st
updateNew :: forall c k s e. (UpdOpHs c, GetOpHs c, k ~ UpdOpKeyHs c, k ~ GetOpKeyHs c, KnownValue (GetOpValHs c), NiceConstant e, Dupable k) => (forall s0. (k : s0) :-> (e : s0)) -> (k : (UpdOpParamsHs c : (c : s))) :-> (c : s)
if_ :: (s :-> s') -> (s :-> s') -> (Bool : s) :-> s'
ifCons :: ((a : (List a : s)) :-> s') -> (s :-> s') -> (List a : s) :-> s'
loopLeft :: ((a : s) :-> (Either a b : s)) -> (Either a b : s) :-> (b : s)
lambda :: ZipInstrs [i, o] => (IsNotInView => i :-> o) -> s :-> (WrappedLambda i o : s)
lambdaRec :: forall i o s. (ZipInstrs [i, o], KnownList i) => (IsNotInView => (i ++ '[WrappedLambda i o]) :-> o) -> s :-> (WrappedLambda i o : s)
exec :: (a : (Lambda a b : s)) :-> (b : s)
execute :: forall i o s. Each [KnownList, ZipInstr] [i, o] => (WrappedLambda i o : (i ++ s)) :-> (o ++ s)
applicate :: forall a b c inp2nd inpTail s. (NiceConstant a, ZipInstr b, b ~ (inp2nd : inpTail)) => (a : (WrappedLambda (a : b) c : s)) :-> (WrappedLambda b c : s)
dip :: forall a s s'. HasCallStack => (s :-> s') -> (a : s) :-> (a : s')
dipNPeano :: forall (n :: Peano) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]). ConstraintDIPNLorentz n inp out s s' => (s :-> s') -> inp :-> out
dipN :: forall (n :: Nat) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]). ConstraintDIPNLorentz (ToPeano n) inp out s s' => (s :-> s') -> inp :-> out
packRaw :: forall a s. NicePackedValue a => (a : s) :-> (ByteString : s)
unpackRaw :: forall a s. NiceUnpackedValue a => (ByteString : s) :-> (Maybe a : s)
concat' :: ConcatOpHs c => (List c : s) :-> (c : s)
isNat :: (Integer : s) :-> (Maybe Natural : s)
rsub :: ArithOpHs Sub n m r => (m : (n : s)) :-> (r : s)
ediv :: ArithOpHs EDiv n m r => (n : (m : s)) :-> (r : s)
subMutez :: (Mutez : (Mutez : s)) :-> (Maybe Mutez : s)
rsubMutez :: (Mutez : (Mutez : s)) :-> (Maybe Mutez : s)
neg :: UnaryArithOpHs Neg n => (n : s) :-> (UnaryArithResHs Neg n : s)
lsl :: ArithOpHs Lsl n m r => (n : (m : s)) :-> (r : s)
lsr :: ArithOpHs Lsr n m r => (n : (m : s)) :-> (r : s)
eq0 :: UnaryArithOpHs Eq' n => (n : s) :-> (UnaryArithResHs Eq' n : s)
neq0 :: UnaryArithOpHs Neq n => (n : s) :-> (UnaryArithResHs Neq n : s)
lt0 :: UnaryArithOpHs Lt n => (n : s) :-> (UnaryArithResHs Lt n : s)
gt0 :: UnaryArithOpHs Gt n => (n : s) :-> (UnaryArithResHs Gt n : s)
le0 :: UnaryArithOpHs Le n => (n : s) :-> (UnaryArithResHs Le n : s)
ge0 :: UnaryArithOpHs Ge n => (n : s) :-> (UnaryArithResHs Ge n : s)
view' :: forall name ret arg s. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret) => (arg : (Address : s)) :-> (Maybe ret : s)
self :: forall p s. (NiceParameterFull p, ForbidExplicitDefaultEntrypoint p, IsNotInView) => s :-> (ContractRef p : s)
selfCalling :: forall p mname s. (NiceParameterFull p, IsNotInView) => EntrypointRef mname -> s :-> (ContractRef (GetEntrypointArgCustom p mname) : s)
contractCalling :: forall cp epRef epArg addr vd s. (HasEntrypointArg cp epRef epArg, ToTAddress_ cp vd addr) => epRef -> (addr : s) :-> (Maybe (ContractRef epArg) : s)
unsafeContractCalling :: forall arg s. NiceParameter arg => EpName -> (Address : s) :-> (Maybe (ContractRef arg) : s)
runFutureContract :: forall p s. NiceParameter p => (FutureContract p : s) :-> (Maybe (ContractRef p) : s)
epAddressToContract :: forall p s. NiceParameter p => (EpAddress : s) :-> (Maybe (ContractRef p) : s)
transferTokens :: forall p s. (NiceParameter p, IsNotInView) => (p : (Mutez : (ContractRef p : s))) :-> (Operation : s)
setDelegate :: IsNotInView => (Maybe KeyHash : s) :-> (Operation : s)
createContract :: forall p g vd s. IsNotInView => Contract p g vd -> (Maybe KeyHash : (Mutez : (g : s))) :-> (Operation : (TAddress p vd : s))
implicitAccount :: (KeyHash : s) :-> (ContractRef () : s)
now :: s :-> (Timestamp : s)
minBlockTime :: s :-> (Natural : s)
amount :: s :-> (Mutez : s)
votingPower :: (KeyHash : s) :-> (Natural : s)
totalVotingPower :: s :-> (Natural : s)
checkSignature :: BytesLike bs => (PublicKey : (TSignature bs : (bs : s))) :-> (Bool : s)
blake2B :: BytesLike bs => (bs : s) :-> (Hash Blake2b bs : s)
sha3 :: BytesLike bs => (bs : s) :-> (Hash Sha3 bs : s)
keccak :: BytesLike bs => (bs : s) :-> (Hash Keccak bs : s)
hashKey :: (PublicKey : s) :-> (KeyHash : s)
pairingCheck :: ([(Bls12381G1, Bls12381G2)] : s) :-> (Bool : s)
source :: s :-> (Address : s)
sender :: s :-> (Address : s)
address :: (ContractRef a : s) :-> (Address : s)
selfAddress :: s :-> (Address : s)
ticket :: NiceComparable a => (a : (Natural : s)) :-> (Maybe (Ticket a) : s)
readTicket :: (Ticket a : s) :-> (ReadTicket a : (Ticket a : s))
splitTicket :: (Ticket a : ((Natural, Natural) : s)) :-> (Maybe (Ticket a, Ticket a) : s)
splitTicketNamed :: forall n1 n2 a s. (Ticket a : ((n1 :! Natural, n2 :! Natural) : s)) :-> (Maybe (n1 :! Ticket a, n2 :! Ticket a) : s)
joinTickets :: ((Ticket a, Ticket a) : s) :-> (Maybe (Ticket a) : s)
openChest :: (ChestKey : (Chest : (Natural : s))) :-> (OpenChest : s)
chainId :: s :-> (ChainId : s)
level :: s :-> (Natural : s)
framed :: forall s i o. (KnownList i, KnownList o) => (i :-> o) -> (i ++ s) :-> (o ++ s)
emit' :: forall t s. NicePackedValue t => FieldAnn -> Maybe (Notes (ToT t)) -> (t : s) :-> (Operation : s)
emitAuto :: forall t s. NicePackedValue t => FieldAnn -> (t : s) :-> (Operation : s)
invertIso :: LIso a b -> LIso b a
involutedIso :: Fn a a -> LIso a a
checkedCoerceIso :: Coercible_ a b => LIso a b
forcedCoerceIso :: MichelsonCoercible a b => LIso a b
namedIso :: Label n -> LIso a (n :! a)
nonIso :: (NiceConstant a, NiceComparable a) => a -> LIso (Maybe a) a
nonDefIso :: (LDefault a, NiceConstant a) => LIso (Maybe a) a
mkLambda :: (IsNotInView => i :-> o) -> WrappedLambda i o
mkLambdaRec :: (IsNotInView => (i ++ '[WrappedLambda i o]) :-> o) -> WrappedLambda i o
neq :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
lt :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
gt :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
le :: NiceComparable n => (n : (n : s)) :-> (Bool : s)
ifEq0 :: IfCmp0Constraints a Eq' => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifGe0 :: IfCmp0Constraints a Ge => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifGt0 :: IfCmp0Constraints a Gt => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifLe0 :: IfCmp0Constraints a Le => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifLt0 :: IfCmp0Constraints a Lt => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifNeq0 :: IfCmp0Constraints a Neq => (s :-> s') -> (s :-> s') -> (a : s) :-> s'
ifEq :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
ifGe :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
ifGt :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
ifLe :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
ifLt :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
ifNeq :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s'
fail_ :: a :-> c
assertEq0 :: (IfCmp0Constraints a Eq', IsError err) => err -> (a : s) :-> s
assertNeq0 :: (IfCmp0Constraints a Neq, IsError err) => err -> (a : s) :-> s
assertLt0 :: (IfCmp0Constraints a Lt, IsError err) => err -> (a : s) :-> s
assertGt0 :: (IfCmp0Constraints a Gt, IsError err) => err -> (a : s) :-> s
assertLe0 :: (IfCmp0Constraints a Le, IsError err) => err -> (a : s) :-> s
assertGe0 :: (IfCmp0Constraints a Ge, IsError err) => err -> (a : s) :-> s
assertEq :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertNeq :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertLt :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertGt :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertLe :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertGe :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s
assertNone :: IsError err => err -> (Maybe a : s) :-> s
assertSome :: IsError err => err -> (Maybe a : s) :-> (a : s)
assertLeft :: IsError err => err -> (Either a b : s) :-> (a : s)
assertRight :: IsError err => err -> (Either a b : s) :-> (b : s)
assertUsing :: IsError a => a -> (Bool : s) :-> s
dropX :: forall (n :: Nat) a inp out s s'. (ConstraintDIPNLorentz (ToPeano n) inp out s s', s ~ (a ': s'), SingIPeano n) => inp :-> out
cloneX :: forall (n :: Nat) a s. CloneX (ToPeano n) a s => (a : s) :-> (a : CloneXT (ToPeano n) a s)
duupX :: forall (n :: Nat) a s s'. (ConstraintDUPNLorentz (ToPeano n) s s' a, Dupable a) => s :-> (a ': s)
framedN :: forall n nNat s i i' o o'. (nNat ~ ToPeano n, i' ~ Take nNat i, s ~ Drop nNat i, i ~ (i' ++ s), o ~ (o' ++ s), KnownList i', KnownList o') => (i' :-> o') -> i :-> o
carN :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz ((2 * n) + 1) pair => (pair : s) :-> (PairGetHs (ToPeano ((2 * n) + 1)) pair : s)
cdrN :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz (2 * n) pair => (pair : s) :-> (PairGetHs (ToPeano (2 * n)) pair : s)
caar :: (((a, b1), b2) : s) :-> (a : s)
cadr :: (((a, b1), b2) : s) :-> (b1 : s)
cdar :: ((a1, (a2, b)) : s) :-> (a2 : s)
cddr :: ((a1, (a2, b)) : s) :-> (b : s)
ifRight :: ((b : s) :-> s') -> ((a : s) :-> s') -> (Either a b : s) :-> s'
ifSome :: ((a : s) :-> s') -> (s :-> s') -> (Maybe a : s) :-> s'
when_ :: (s :-> s) -> (Bool : s) :-> s
unless_ :: (s :-> s) -> (Bool : s) :-> s
whenSome :: ((a : s) :-> s) -> (Maybe a : s) :-> s
whenNone :: (s :-> (a : s)) -> (Maybe a : s) :-> (a : s)
mapCar :: (forall s0. (a : s0) :-> (a1 : s0)) -> ((a, b) : s) :-> ((a1, b) : s)
mapCdr :: (forall s0. (b : s0) :-> (b1 : s0)) -> ((a, b) : s) :-> ((a, b1) : s)
papair :: (a : (b : (c : s))) :-> (((a, b), c) : s)
ppaiir :: (a : (b : (c : s))) :-> ((a, (b, c)) : s)
setCar :: ((a, b1) : (b2 : s)) :-> ((b2, b1) : s)
setCdr :: ((a, b1) : (b2 : s)) :-> ((a, b2) : s)
setInsert :: NiceComparable e => (e : (Set e : s)) :-> (Set e : s)
deleteMap :: forall k v s. (MapInstrs map, NiceComparable k, KnownValue v) => (k : (map k v : s)) :-> (map k v : s)
mapInsert :: (MapInstrs map, NiceComparable k) => (k : (v : (map k v : s))) :-> (map k v : s)
mapInsertNew :: (MapInstrs map, IsoValue (map k v), NiceComparable k, NiceConstant e, Dupable k, KnownValue v) => (forall s0. (k : s0) :-> (e : s0)) -> (k : (v : (map k v : s))) :-> (map k v : s)
setInsertNew :: (NiceConstant err, NiceComparable e, Dupable e, Dupable (Set e)) => (forall s0. (e : s0) :-> (err : s0)) -> (e : (Set e : s)) :-> (Set e : s)
setDelete :: NiceComparable e => (e : (Set e : s)) :-> (Set e : s)
replaceN :: forall (n :: Nat) a (s :: [Type]) (s1 :: [Type]) (tail :: [Type]). (ConstraintReplaceNLorentz (ToPeano (n - 1)) s a s1 tail, ReplaceN (ToPeano n) s a s1 tail) => (a ': s) :-> s
updateN :: forall (n :: Nat) a b (s :: [Type]) (mid :: [Type]) (tail :: [Type]). (ConstraintUpdateNLorentz (ToPeano (n - 1)) s a b mid tail, UpdateN (ToPeano n) s a b mid tail) => ('[a, b] :-> '[b]) -> (a ': s) :-> s
view_ :: (NiceParameter r, Dupable storage, IsNotInView) => (forall s0. (a : (storage : s0)) :-> (r : s0)) -> (View_ a r : (storage : s)) :-> ((List Operation, storage) : s)
mkView_ :: ToContractRef r contract => a -> contract -> View_ a r
wrapView_ :: ((a, ContractRef r) : s) :-> (View_ a r : s)
unwrapView_ :: (View_ a r : s) :-> ((a, ContractRef r) : s)
void_ :: forall a b s s' anything. (IsError (VoidResult b), NiceConstant b) => ((a : s) :-> (b : s')) -> (Void_ a b : s) :-> anything
mkVoid :: forall b a. a -> Void_ a b
wrapVoid :: ((a, Lambda b b) : s) :-> (Void_ a b : s)
unwrapVoid :: (Void_ a b : s) :-> ((a, Lambda b b) : s)
voidResultTag :: MText
dupTop2 :: forall (a :: Type) (b :: Type) (s :: [Type]). (Dupable a, Dupable b) => (a ': (b ': s)) :-> (a ': (b ': (a ': (b ': s))))
fromOption :: NiceConstant a => a -> (Maybe a : s) :-> (a : s)
isSome :: (Maybe a : s) :-> (Bool : s)
buildView_ :: (HasNoOpToT r, ForbidNestedBigMaps (ToT r)) => (a -> Doc) -> View_ a r -> Doc
buildViewTuple_ :: (HasNoOpToT r, ForbidNestedBigMaps (ToT r), TupleF a) => View_ a r -> Doc
addressToEpAddress :: (Address : s) :-> (EpAddress : s)
pushContractRef :: NiceParameter arg => (forall s0. (FutureContract arg : s) :-> s0) -> ContractRef arg -> s :-> (ContractRef arg : s)
idiv :: ArithOpHs IDiv n d q => (n : (d : s)) :-> (q : s)
imod :: ArithOpHs IMod n d r => (n : (d : s)) :-> (r : s)
lPackValueRaw :: forall a. NicePackedValue a => a -> ByteString
lUnpackValueRaw :: forall a. NiceUnpackedValue a => ByteString -> Either UnpackError a
lPackValue :: forall a. NicePackedValue a => a -> Packed a
lUnpackValue :: forall a. NiceUnpackedValue a => Packed a -> Either UnpackError a
lEncodeValue :: forall a. NiceUntypedValue a => a -> ByteString
valueToScriptExpr :: forall t. NicePackedValue t => t -> ByteString
expressionToScriptExpr :: Expression -> ByteString
printLorentzValue :: forall v. NiceUntypedValue v => Bool -> v -> LText
printLorentzContract :: Bool -> Contract cp st vd -> LText
mkRange :: forall range lower upper a. NiceRange range lower upper a => a -> a -> range a
mkRange_ :: NiceRange range lower upper a => (("min" :! a) : (("max" :! a) : s)) :-> (range a : s)
mkRangeFor :: (NiceRange range lower upper a, Num a) => a -> a -> range a
mkRangeFor_ :: (NiceRange range lower upper a, Dupable a, ArithOpHs Add a b a) => (("start" :! a) : (("length" :! b) : s)) :-> (range a : s)
mkRangeForSafe_ :: forall a b s. (Dupable a, ArithOpHs Add a b a, ToT b ~ 'TNat) => (("start" :! a) : (("length" :! b) : s)) :-> (Range a : s)
fromRange_ :: NiceRange range lower upper a => (range a : s) :-> ((a, a) : s)
toRange_ :: NiceRange range lower upper a => ((a, a) : s) :-> (range a : s)
rangeLower :: forall range lower upper a. NiceRange range lower upper a => range a -> a
rangeUpper :: forall range lower upper a. NiceRange range lower upper a => range a -> a
rangeLower_ :: NiceRange range lower upper a => (range a : s) :-> (a : s)
rangeUpper_ :: NiceRange range lower upper a => (range a : s) :-> (a : s)
inRange_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (range a : (a : s)) :-> (Bool : s)
inRangeCmp :: forall range lower upper a. (NiceRange range lower upper a, Ord a) => range a -> a -> Ordering
inRangeCmp_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (range a : (a : s)) :-> (Integer : s)
assertInRange_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => OnRangeAssertFailure a -> (range a : (a : s)) :-> s
assertInRangeSimple_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (forall s' any. s' :-> any) -> (range a : (a : s)) :-> s
isRangeEmpty :: forall range lower upper a. (NiceRange range lower upper a, Ord a, CanCheckEmpty lower upper) => range a -> Bool
isRangeEmpty_ :: forall range lower upper a s. (NiceRange range lower upper a, CanCheckEmpty lower upper, NiceComparable a) => (range a : s) :-> (Bool : s)
assertRangeNonEmpty_ :: (NiceRange range lower upper a, CanCheckEmpty lower upper, NiceComparable a, Dupable (range a)) => (forall s' any. (range a : s') :-> any) -> (range a : s) :-> (range a : s)
mkOnRangeAssertFailureSimple :: (forall s any. (RangeFailureInfo a : s) :-> any) -> OnRangeAssertFailure a
customErrorORAF :: (NiceConstant a, ErrorArg underflow ~ RangeFailureInfo a, ErrorArg overflow ~ RangeFailureInfo a, CustomErrorHasDoc underflow, CustomErrorHasDoc overflow) => ("underflow" :! Label underflow) -> ("overflow" :! Label overflow) -> OnRangeAssertFailure a
customErrorORAFSimple :: (NiceConstant a, ErrorArg err ~ RangeFailureInfo a, CustomErrorHasDoc err) => Label err -> OnRangeAssertFailure a
(>.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
(<=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
(>=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
(==.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
(/=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o
keepIfArgs :: (Dupable a, Dupable b) => (forall st o. Condition (a ': (b ': st)) st st o o) -> Condition (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) s
dropT :: forall a inp dinp dout out. (DipT a inp dinp dout out, dinp ~ (a ': dout)) => inp :-> out
dupL :: forall var name s. (HasNamedVar s name var, Dupable var) => Label name -> s :-> (var : s)
dupLNamed :: forall var name s. (HasNamedVar s name var, Dupable var) => Label name -> s :-> ((name :! var) : s)
defaultContract :: (NiceParameterFull cp, NiceStorageFull st) => (IsNotInView => '[(cp, st)] :-> ContractOut st) -> Contract cp st ()
defaultCompilationOptions :: CompilationOptions
intactCompilationOptions :: CompilationOptions
coBytesTransformerL :: Lens' CompilationOptions (Bool, ByteString -> ByteString)
coOptimizerConfL :: Lens' CompilationOptions (Maybe OptimizerConf)
coStringTransformerL :: Lens' CompilationOptions (Bool, MText -> MText)
compileLorentz :: (inp :-> out) -> Instr (ToTs inp) (ToTs out)
compileLorentzWithOptions :: CompilationOptions -> (inp :-> out) -> Instr (ToTs inp) (ToTs out)
mkContract :: (NiceParameterFull cp, NiceStorageFull st) => ContractCode cp st -> Contract cp st ()
mkContractWith :: (NiceParameterFull cp, NiceStorageFull st) => CompilationOptions -> ContractCode cp st -> Contract cp st ()
defaultContractData :: forall cp st. (NiceParameterFull cp, NiceStorageFull st) => (IsNotInView => '[(cp, st)] :-> ContractOut st) -> ContractData cp st ()
compileLorentzContract :: forall cp st vd. ContractData cp st vd -> Contract cp st vd
mkView :: forall name arg ret st. (KnownSymbol name, NiceViewable arg, NiceViewable ret, HasAnnotation arg, HasAnnotation ret, TypeHasDoc arg, TypeHasDoc ret) => ViewCode arg st ret -> ContractView st ('ViewTyInfo name arg ret)
setViews :: forall vd cp st. (RecFromTuple (Rec (ContractView st) (RevealViews vd)), NiceViewsDescriptor vd) => IsoRecTuple (Rec (ContractView st) (RevealViews vd)) -> ContractData cp st () -> ContractData cp st vd
setViewsRec :: forall vd cp st. NiceViewsDescriptor vd => Rec (ContractView st) (RevealViews vd) -> ContractData cp st () -> ContractData cp st vd
noViews :: contract cp st () -> contract cp st ()
cdCodeL :: forall cp st vd cp1. NiceParameterFull cp1 => Lens (ContractData cp st vd) (ContractData cp1 st vd) (ContractCode cp st) (ContractCode cp1 st)
cdCompilationOptionsL :: forall cp st vd. Lens' (ContractData cp st vd) CompilationOptions
interpretLorentzInstr :: (IsoValuesStack inp, IsoValuesStack out) => ContractEnv -> (IsNotInView => inp :-> out) -> Rec Identity inp -> Either (MichelsonFailureWithStack Void) (Rec Identity out)
interpretLorentzLambda :: (IsoValue inp, IsoValue out) => ContractEnv -> (IsNotInView => Fn inp out) -> inp -> Either (MichelsonFailureWithStack Void) out
analyzeLorentz :: (inp :-> out) -> AnalyzerRes
(-$?) :: (ZipInstr inps, IsoValue out) => (IsNotInView => inps :-> '[out]) -> ZippedStack inps -> Either (MichelsonFailureWithStack Void) out
(-$) :: (ZipInstr inps, IsoValue out, HasCallStack) => (IsNotInView => inps :-> '[out]) -> ZippedStack inps -> out
(&?-) :: (ZipInstr inps, IsoValue out) => ZippedStack inps -> (IsNotInView => inps :-> '[out]) -> Either (MichelsonFailureWithStack Void) out
(&-) :: (ZipInstr inps, IsoValue out, HasCallStack) => ZippedStack inps -> (IsNotInView => inps :-> '[out]) -> out
(<-$>) :: (ZipInstr inps, IsoValue out, HasCallStack) => (inps :-> '[out]) -> [ZippedStack inps] -> [out]
fieldNameToLabel :: FieldSymRef n -> Label n
fieldNameFromLabel :: Label n -> FieldSymRef n
stToField :: StoreHasField store fname ftype => FieldRef fname -> (store : s) :-> (ftype : s)
stGetField :: (StoreHasField store fname ftype, Dupable ftype, HasDupableGetters store) => FieldRef fname -> (store : s) :-> (ftype : (store : s))
stToFieldNamed :: (StoreHasField store fname ftype, FieldRefHasFinalName fname) => FieldRef fname -> (store : s) :-> ((FieldRefFinalName fname :! ftype) : s)
stGetFieldNamed :: (StoreHasField store fname ftype, FieldRefHasFinalName fname, Dupable ftype, HasDupableGetters store) => FieldRef fname -> (store : s) :-> ((FieldRefFinalName fname :! ftype) : (store : s))
stSetField :: StoreHasField store fname ftype => FieldRef fname -> (ftype : (store : s)) :-> (store : s)
stMem :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (store : s)) :-> (Bool : s)
stGet :: (StoreHasSubmap store mname key value, KnownValue value) => FieldRef mname -> (key : (store : s)) :-> (Maybe value : s)
stUpdate :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (Maybe value : (store : s))) :-> (store : s)
stGetAndUpdate :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (Maybe value : (store : s))) :-> (Maybe value : (store : s))
stDelete :: forall store mname key value s. StoreHasSubmap store mname key value => FieldRef mname -> (key : (store : s)) :-> (store : s)
stInsert :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (value : (store : s))) :-> (store : s)
stInsertNew :: (StoreHasSubmap store mname key value, Dupable key) => FieldRef mname -> (forall s0 any. (key : s0) :-> any) -> (key : (value : (store : s))) :-> (store : s)
stEntrypoint :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (epParam : (store : s)) :-> (([Operation], store) : s)
stToEpLambda :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : s)
stGetEpLambda :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : (store : s))
stSetEpLambda :: (StoreHasEntrypoint store epName epParam epStore, HasDupableGetters store) => Label epName -> (EntrypointLambda epParam epStore : (store : s)) :-> (store : s)
stToEpStore :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (store : s) :-> (epStore : s)
stGetEpStore :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (store : s) :-> (epStore : (store : s))
stSetEpStore :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (epStore : (store : s)) :-> (store : s)
sopGetField :: (Dupable ftype, HasDupableGetters store) => StoreFieldOps store fname ftype -> FieldRef fname -> (store : s) :-> (ftype : (store : s))
sopSetField :: StoreFieldOps store fname ftype -> FieldRef fname -> (ftype : (store : s)) :-> (store : s)
storeFieldOpsADT :: HasFieldOfType dt fname ftype => StoreFieldOps dt (fname :: Symbol) ftype
storeEntrypointOpsADT :: (HasFieldOfType store epmName (EntrypointsField epParam epStore), HasFieldOfType store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeEntrypointOpsFields :: (StoreHasField store epmName (EntrypointsField epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeEntrypointOpsSubmapField :: (StoreHasSubmap store epmName MText (EntrypointLambda epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeFieldOpsDeeper :: (HasFieldOfType storage fieldsPartName fields, StoreHasField fields fname ftype, HasDupableGetters fields) => FieldRef fieldsPartName -> StoreFieldOps storage fname ftype
storeSubmapOpsDeeper :: (HasFieldOfType storage bigMapPartName fields, StoreHasSubmap fields SelfRef key value, HasDupableGetters storage, Dupable fields) => FieldRef bigMapPartName -> StoreSubmapOps storage mname key value
storeEntrypointOpsDeeper :: (HasFieldOfType store nameInStore substore, StoreHasEntrypoint substore epName epParam epStore, HasDupableGetters store, Dupable substore) => FieldRef nameInStore -> StoreEntrypointOps store epName epParam epStore
storeFieldOpsReferTo :: FieldRef name -> StoreFieldOps storage name field -> StoreFieldOps storage desiredName field
storeSubmapOpsReferTo :: FieldRef name -> StoreSubmapOps storage name key value -> StoreSubmapOps storage desiredName key value
mapStoreFieldOps :: forall field1 field2 store name. KnownValue field1 => LIso field1 field2 -> StoreFieldOps store name field1 -> StoreFieldOps store name field2
mapStoreSubmapOpsKey :: Fn key2 key1 -> StoreSubmapOps store name key1 value -> StoreSubmapOps store name key2 value
mapStoreSubmapOpsValue :: (KnownValue value1, KnownValue value2) => LIso value1 value2 -> StoreSubmapOps store name key value1 -> StoreSubmapOps store name key value2
storeEntrypointOpsReferTo :: Label epName -> StoreEntrypointOps store epName epParam epStore -> StoreEntrypointOps store desiredName epParam epStore
composeStoreFieldOps :: HasDupableGetters substore => FieldRef nameInStore -> StoreFieldOps store nameInStore substore -> StoreFieldOps substore nameInSubstore field -> StoreFieldOps store nameInSubstore field
composeStoreSubmapOps :: (HasDupableGetters store, Dupable substore) => FieldRef nameInStore -> StoreFieldOps store nameInStore substore -> StoreSubmapOps substore mname key value -> StoreSubmapOps store mname key value
sequenceStoreSubmapOps :: forall store substore value name subName key1 key2. (NiceConstant substore, KnownValue value, Dupable (key1, key2), Dupable store) => FieldRef name -> LIso (Maybe substore) substore -> StoreSubmapOps store name key1 substore -> StoreSubmapOps substore subName key2 value -> StoreSubmapOps store subName (key1, key2) value
composeStoreEntrypointOps :: (HasDupableGetters store, Dupable substore) => FieldRef nameInStore -> StoreFieldOps store nameInStore substore -> StoreEntrypointOps substore epName epParam epStore -> StoreEntrypointOps store epName epParam epStore
zoomStoreSubmapOps :: forall store submapName nameInSubmap key value subvalue. (NiceConstant value, NiceConstant subvalue, Dupable key, Dupable store) => FieldRef submapName -> LIso (Maybe value) value -> LIso (Maybe subvalue) subvalue -> StoreSubmapOps store submapName key value -> StoreFieldOps value nameInSubmap subvalue -> StoreSubmapOps store nameInSubmap key subvalue
mkStoreEp :: Label epName -> EntrypointLambda epParam epStore -> EntrypointsField epParam epStore
this :: SelfRef p
stNested :: StNestedImpl f SelfRef => f
stAlias :: forall alias. FieldRef (FieldAlias alias)
stNickname :: Label name -> FieldRef (FieldAlias name)
mkUParam :: (NicePackedValue a, LookupEntrypoint name entries ~ a, RequireUniqueEntrypoints entries) => Label name -> a -> UParam entries
caseUParam :: (CaseUParam entries, RequireUniqueEntrypoints entries) => Rec (CaseClauseU inp out) entries -> UParamFallback inp out -> (UParam entries : inp) :-> out
caseUParamT :: forall entries inp out clauses. (clauses ~ Rec (CaseClauseU inp out) entries, RecFromTuple clauses, CaseUParam entries) => IsoRecTuple clauses -> UParamFallback inp out -> (UParam entries : inp) :-> out
uparamFallbackFail :: UParamFallback inp out
uparamFromAdt :: UParamLinearize up => up -> UParam (UParamLinearized up)
pbsUParam :: forall ctorName. KnownSymbol ctorName => ParamBuildingStep
unwrapUParam :: (UParam entries : s) :-> ((MText, ByteString) : s)
entrypointDoc :: QuasiQuoter
errorDocArg :: QuasiQuoter
typeDoc :: QuasiQuoter
mkBigMap :: ToBigMap m => m -> BigMap (ToBigMapKey m) (ToBigMapValue m)
tz :: QuasiQuoter
toMutez :: (Integral a, CheckIntSubType a Word63) => a -> Mutez
zeroMutez :: Mutez
oneMutez :: Mutez
mt :: QuasiQuoter
timestampFromSeconds :: Integer -> Timestamp
timestampFromUTCTime :: UTCTime -> Timestamp
timestampQuote :: QuasiQuoter
demoteViewName :: forall name. (KnownSymbol name, HasCallStack) => ViewName
demoteViewTyInfos :: forall (vs :: [ViewTyInfo]). DemoteViewTyInfo vs => [ViewInterface]
demoteViewsDescriptor :: forall (vd :: Type). DemoteViewTyInfo (RevealViews vd) => [ViewInterface]
checkViewsCoverInterface :: forall st. [ViewInterface] -> ViewsSet st -> Either ViewInterfaceMatchError ()
ligoCombLayout :: GenericStrategy
ligoLayout :: GenericStrategy
customGeneric' :: Maybe Type -> Name -> Type -> [Con] -> GenericStrategy -> Q [Dec]
deriveFullType :: Name -> Maybe Kind -> [TyVarBndr flag] -> TypeQ
haskellBalanced :: GenericStrategy
mangleGenericStrategyConstructors :: (Text -> Text) -> GenericStrategy -> GenericStrategy
mangleGenericStrategyFields :: (Text -> Text) -> GenericStrategy -> GenericStrategy
reifyDataType :: Name -> Q (Name, Cxt, Maybe Kind, [TyVarBndr ()], [Con])
cstr :: forall (n :: Nat). KnownNat n => [Natural] -> CstrDepth
customGeneric :: String -> GenericStrategy -> Q [Dec]
rightComb :: GenericStrategy
alphabetically :: EntriesReorder
forbidUnnamedFields :: UnnamedEntriesReorder
fromDepthsStrategy :: (Int -> [Natural]) -> GenericStrategy
reorderingData :: UnnamedEntriesReorder -> EntriesReorder -> GenericStrategy -> GenericStrategy
fld :: forall (n :: Nat). KnownNat n => Natural
fromDepthsStrategy' :: (Int -> [Natural]) -> (Int -> [Natural]) -> GenericStrategy
leaveUnnamedFields :: UnnamedEntriesReorder
leftBalanced :: GenericStrategy
leftComb :: GenericStrategy
makeRightBalDepths :: Int -> [Natural]
reorderingConstrs :: EntriesReorder -> GenericStrategy -> GenericStrategy
reorderingFields :: UnnamedEntriesReorder -> EntriesReorder -> GenericStrategy -> GenericStrategy
rightBalanced :: GenericStrategy
withDepths :: [CstrDepth] -> GenericStrategy

Documentation

data Never Source #

Instances

Instances details

Generic Never Source #
Instance details Defined in Lorentz.Value Associated Types type Rep Never :: Type -> Type # Methods from :: Never -> Rep Never x # to :: Rep Never x -> Never #
Show Never Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> Never -> ShowS # show :: Never -> String # showList :: [Never] -> ShowS #
NFData Never Source #
Instance details Defined in Lorentz.Value Methods rnf :: Never -> () #
Eq Never Source #
Instance details Defined in Lorentz.Value Methods (==) :: Never -> Never -> Bool # (/=) :: Never -> Never -> Bool #
Ord Never Source #
Instance details Defined in Lorentz.Value Methods compare :: Never -> Never -> Ordering # (<) :: Never -> Never -> Bool # (<=) :: Never -> Never -> Bool # (>) :: Never -> Never -> Bool # (>=) :: Never -> Never -> Bool # max :: Never -> Never -> Never # min :: Never -> Never -> Never #
HasAnnotation Never Source #
Instance details Defined in Lorentz.Value Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Never) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Never Source #
Instance details Defined in Lorentz.Value Associated Types type AsRPC Never
TypeHasDoc Never Source #
Instance details Defined in Lorentz.Value Associated Types type TypeDocFieldDescriptions Never :: FieldDescriptions # Methods typeDocName :: Proxy Never -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Never -> WithinParens -> Markdown # typeDocDependencies :: Proxy Never -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Never # typeDocMichelsonRep :: TypeDocMichelsonRep Never #
IsoValue Never Source #
Instance details Defined in Lorentz.Value Associated Types type ToT Never :: T # Methods toVal :: Never -> Value (ToT Never) # fromVal :: Value (ToT Never) -> Never #
Buildable Never Source #
Instance details Defined in Lorentz.Value Methods build :: Never -> Doc buildList :: [Never] -> Doc
type Rep Never Source #
Instance details Defined in Lorentz.Value type Rep Never = D1 ('MetaData "Never" "Lorentz.Value" "lorentz-0.16.0-inplace" 'False) (V1 :: Type -> Type)
type AsRPC Never Source #
Instance details Defined in Lorentz.Value type AsRPC Never = Never
type TypeDocFieldDescriptions Never Source #
Instance details Defined in Lorentz.Value type TypeDocFieldDescriptions Never = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Never Source #
Instance details Defined in Lorentz.Value type ToT Never = GValueType (GRep Never)

class Generic a #

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 ≡ id
to . from ≡ id

Minimal complete definition

from, to

Instances

Instances details

Generic CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Associated Types type Rep CabalSpecVersion :: Type -> Type # Methods from :: CabalSpecVersion -> Rep CabalSpecVersion x # to :: Rep CabalSpecVersion x -> CabalSpecVersion #
Generic PError
Instance details Defined in Distribution.Parsec.Error Associated Types type Rep PError :: Type -> Type # Methods from :: PError -> Rep PError x # to :: Rep PError x -> PError #
Generic Position
Instance details Defined in Distribution.Parsec.Position Associated Types type Rep Position :: Type -> Type # Methods from :: Position -> Rep Position x # to :: Rep Position x -> Position #
Generic PWarnType
Instance details Defined in Distribution.Parsec.Warning Associated Types type Rep PWarnType :: Type -> Type # Methods from :: PWarnType -> Rep PWarnType x # to :: Rep PWarnType x -> PWarnType #
Generic PWarning
Instance details Defined in Distribution.Parsec.Warning Associated Types type Rep PWarning :: Type -> Type # Methods from :: PWarning -> Rep PWarning x # to :: Rep PWarning x -> PWarning #
Generic Structure
Instance details Defined in Distribution.Utils.Structured Associated Types type Rep Structure :: Type -> Type # Methods from :: Structure -> Rep Structure x # to :: Rep Structure x -> Structure #
Generic Extension
Instance details Defined in Language.Haskell.Extension Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Generic KnownExtension
Instance details Defined in Language.Haskell.Extension Associated Types type Rep KnownExtension :: Type -> Type # Methods from :: KnownExtension -> Rep KnownExtension x # to :: Rep KnownExtension x -> KnownExtension #
Generic Language
Instance details Defined in Language.Haskell.Extension Associated Types type Rep Language :: Type -> Type # Methods from :: Language -> Rep Language x # to :: Rep Language x -> Language #
Generic Value
Instance details Defined in Data.Aeson.Types.Internal Associated Types type Rep Value :: Type -> Type # Methods from :: Value -> Rep Value x # to :: Rep Value x -> Value #
Generic All
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep All :: Type -> Type # Methods from :: All -> Rep All x # to :: Rep All x -> All #
Generic Any
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep Any :: Type -> Type # Methods from :: Any -> Rep Any x # to :: Rep Any x -> Any #
Generic Version
Instance details Defined in Data.Version Associated Types type Rep Version :: Type -> Type # Methods from :: Version -> Rep Version x # to :: Rep Version x -> Version #
Generic Void
Instance details Defined in Data.Void Associated Types type Rep Void :: Type -> Type # Methods from :: Void -> Rep Void x # to :: Rep Void x -> Void #
Generic Fingerprint
Instance details Defined in GHC.Generics Associated Types type Rep Fingerprint :: Type -> Type # Methods from :: Fingerprint -> Rep Fingerprint x # to :: Rep Fingerprint x -> Fingerprint #
Generic Associativity
Instance details Defined in GHC.Generics Associated Types type Rep Associativity :: Type -> Type # Methods from :: Associativity -> Rep Associativity x # to :: Rep Associativity x -> Associativity #
Generic DecidedStrictness
Instance details Defined in GHC.Generics Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic Fixity
Instance details Defined in GHC.Generics Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic SourceStrictness
Instance details Defined in GHC.Generics Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic SourceUnpackedness
Instance details Defined in GHC.Generics Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic ExitCode
Instance details Defined in GHC.IO.Exception Associated Types type Rep ExitCode :: Type -> Type # Methods from :: ExitCode -> Rep ExitCode x # to :: Rep ExitCode x -> ExitCode #
Generic CCFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep CCFlags :: Type -> Type # Methods from :: CCFlags -> Rep CCFlags x # to :: Rep CCFlags x -> CCFlags #
Generic ConcFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep ConcFlags :: Type -> Type # Methods from :: ConcFlags -> Rep ConcFlags x # to :: Rep ConcFlags x -> ConcFlags #
Generic DebugFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep DebugFlags :: Type -> Type # Methods from :: DebugFlags -> Rep DebugFlags x # to :: Rep DebugFlags x -> DebugFlags #
Generic DoCostCentres
Instance details Defined in GHC.RTS.Flags Associated Types type Rep DoCostCentres :: Type -> Type # Methods from :: DoCostCentres -> Rep DoCostCentres x # to :: Rep DoCostCentres x -> DoCostCentres #
Generic DoHeapProfile
Instance details Defined in GHC.RTS.Flags Associated Types type Rep DoHeapProfile :: Type -> Type # Methods from :: DoHeapProfile -> Rep DoHeapProfile x # to :: Rep DoHeapProfile x -> DoHeapProfile #
Generic DoTrace
Instance details Defined in GHC.RTS.Flags Associated Types type Rep DoTrace :: Type -> Type # Methods from :: DoTrace -> Rep DoTrace x # to :: Rep DoTrace x -> DoTrace #
Generic GCFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep GCFlags :: Type -> Type # Methods from :: GCFlags -> Rep GCFlags x # to :: Rep GCFlags x -> GCFlags #
Generic GiveGCStats
Instance details Defined in GHC.RTS.Flags Associated Types type Rep GiveGCStats :: Type -> Type # Methods from :: GiveGCStats -> Rep GiveGCStats x # to :: Rep GiveGCStats x -> GiveGCStats #
Generic MiscFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep MiscFlags :: Type -> Type # Methods from :: MiscFlags -> Rep MiscFlags x # to :: Rep MiscFlags x -> MiscFlags #
Generic ParFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep ParFlags :: Type -> Type # Methods from :: ParFlags -> Rep ParFlags x # to :: Rep ParFlags x -> ParFlags #
Generic ProfFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep ProfFlags :: Type -> Type # Methods from :: ProfFlags -> Rep ProfFlags x # to :: Rep ProfFlags x -> ProfFlags #
Generic RTSFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep RTSFlags :: Type -> Type # Methods from :: RTSFlags -> Rep RTSFlags x # to :: Rep RTSFlags x -> RTSFlags #
Generic TickyFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep TickyFlags :: Type -> Type # Methods from :: TickyFlags -> Rep TickyFlags x # to :: Rep TickyFlags x -> TickyFlags #
Generic TraceFlags
Instance details Defined in GHC.RTS.Flags Associated Types type Rep TraceFlags :: Type -> Type # Methods from :: TraceFlags -> Rep TraceFlags x # to :: Rep TraceFlags x -> TraceFlags #
Generic SrcLoc
Instance details Defined in GHC.Generics Associated Types type Rep SrcLoc :: Type -> Type # Methods from :: SrcLoc -> Rep SrcLoc x # to :: Rep SrcLoc x -> SrcLoc #
Generic GCDetails
Instance details Defined in GHC.Stats Associated Types type Rep GCDetails :: Type -> Type # Methods from :: GCDetails -> Rep GCDetails x # to :: Rep GCDetails x -> GCDetails #
Generic RTSStats
Instance details Defined in GHC.Stats Associated Types type Rep RTSStats :: Type -> Type # Methods from :: RTSStats -> Rep RTSStats x # to :: Rep RTSStats x -> RTSStats #
Generic GeneralCategory
Instance details Defined in GHC.Generics Associated Types type Rep GeneralCategory :: Type -> Type # Methods from :: GeneralCategory -> Rep GeneralCategory x # to :: Rep GeneralCategory x -> GeneralCategory #
Generic Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Associated Types type Rep Alphabet :: Type -> Type # Methods from :: Alphabet -> Rep Alphabet x # to :: Rep Alphabet x -> Alphabet #
Generic F2Poly
Instance details Defined in Data.Bit.F2Poly Associated Types type Rep F2Poly :: Type -> Type # Methods from :: F2Poly -> Rep F2Poly x # to :: Rep F2Poly x -> F2Poly #
Generic Bit
Instance details Defined in Data.Bit.Internal Associated Types type Rep Bit :: Type -> Type # Methods from :: Bit -> Rep Bit x # to :: Rep Bit x -> Bit #
Generic ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Associated Types type Rep ForeignSrcLang :: Type -> Type # Methods from :: ForeignSrcLang -> Rep ForeignSrcLang x # to :: Rep ForeignSrcLang x -> ForeignSrcLang #
Generic Extension
Instance details Defined in GHC.LanguageExtensions.Type Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Generic Ordering
Instance details Defined in GHC.Generics Associated Types type Rep Ordering :: Type -> Type # Methods from :: Ordering -> Rep Ordering x # to :: Rep Ordering x -> Ordering #
Generic UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type Rep UnspecifiedError :: Type -> Type # Methods from :: UnspecifiedError -> Rep UnspecifiedError x # to :: Rep UnspecifiedError x -> UnspecifiedError #
Generic EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep EntrypointLookupError :: Type -> Type # Methods from :: EntrypointLookupError -> Rep EntrypointLookupError x # to :: Rep EntrypointLookupError x -> EntrypointLookupError #
Generic Never Source #
Instance details Defined in Lorentz.Value Associated Types type Rep Never :: Type -> Type # Methods from :: Never -> Rep Never x # to :: Rep Never x -> Never #
Generic OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type Rep OpenChest :: Type -> Type # Methods from :: OpenChest -> Rep OpenChest x # to :: Rep OpenChest x -> OpenChest #
Generic ZSNil Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep ZSNil :: Type -> Type # Methods from :: ZSNil -> Rep ZSNil x # to :: Rep ZSNil x -> ZSNil #
Generic InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep InvalidPosException :: Type -> Type # Methods from :: InvalidPosException -> Rep InvalidPosException x # to :: Rep InvalidPosException x -> InvalidPosException #
Generic Pos
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep Pos :: Type -> Type # Methods from :: Pos -> Rep Pos x # to :: Rep Pos x -> Pos #
Generic SourcePos
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep SourcePos :: Type -> Type # Methods from :: SourcePos -> Rep SourcePos x # to :: Rep SourcePos x -> SourcePos #
Generic ErrorSrcPos
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep ErrorSrcPos :: Type -> Type # Methods from :: ErrorSrcPos -> Rep ErrorSrcPos x # to :: Rep ErrorSrcPos x -> ErrorSrcPos #
Generic Pos
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep Pos :: Type -> Type # Methods from :: Pos -> Rep Pos x # to :: Rep Pos x -> Pos #
Generic SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep SrcPos :: Type -> Type # Methods from :: SrcPos -> Rep SrcPos x # to :: Rep SrcPos x -> SrcPos #
Generic BadViewNameError
Instance details Defined in Morley.Michelson.Internal.ViewName Associated Types type Rep BadViewNameError :: Type -> Type # Methods from :: BadViewNameError -> Rep BadViewNameError x # to :: Rep BadViewNameError x -> BadViewNameError #
Generic ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Associated Types type Rep ViewName :: Type -> Type # Methods from :: ViewName -> Rep ViewName x # to :: Rep ViewName x -> ViewName #
Generic InterpreterState
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep InterpreterState :: Type -> Type # Methods from :: InterpreterState -> Rep InterpreterState x # to :: Rep InterpreterState x -> InterpreterState #
Generic MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep MorleyLogs :: Type -> Type # Methods from :: MorleyLogs -> Rep MorleyLogs x # to :: Rep MorleyLogs x -> MorleyLogs #
Generic MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep MorleyLogsBuilder :: Type -> Type # Methods from :: MorleyLogsBuilder -> Rep MorleyLogsBuilder x # to :: Rep MorleyLogsBuilder x -> MorleyLogsBuilder #
Generic RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep RemainingSteps :: Type -> Type # Methods from :: RemainingSteps -> Rep RemainingSteps x # to :: Rep RemainingSteps x -> RemainingSteps #
Generic CadrStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep CadrStruct :: Type -> Type # Methods from :: CadrStruct -> Rep CadrStruct x # to :: Rep CadrStruct x -> CadrStruct #
Generic Macro
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep Macro :: Type -> Type # Methods from :: Macro -> Rep Macro x # to :: Rep Macro x -> Macro #
Generic PairStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep PairStruct :: Type -> Type # Methods from :: PairStruct -> Rep PairStruct x # to :: Rep PairStruct x -> PairStruct #
Generic ParsedOp
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep ParsedOp :: Type -> Type # Methods from :: ParsedOp -> Rep ParsedOp x # to :: Rep ParsedOp x -> ParsedOp #
Generic UnpairStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep UnpairStruct :: Type -> Type # Methods from :: UnpairStruct -> Rep UnpairStruct x # to :: Rep UnpairStruct x -> UnpairStruct #
Generic CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Associated Types type Rep CustomParserException :: Type -> Type # Methods from :: CustomParserException -> Rep CustomParserException x # to :: Rep CustomParserException x -> CustomParserException #
Generic StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Associated Types type Rep StringLiteralParserException :: Type -> Type # Methods from :: StringLiteralParserException -> Rep StringLiteralParserException x # to :: Rep StringLiteralParserException x -> StringLiteralParserException #
Generic BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Associated Types type Rep BigMapCounter :: Type -> Type # Methods from :: BigMapCounter -> Rep BigMapCounter x # to :: Rep BigMapCounter x -> BigMapCounter #
Generic MText
Instance details Defined in Morley.Michelson.Text Associated Types type Rep MText :: Type -> Type # Methods from :: MText -> Rep MText x # to :: Rep MText x -> MText #
Generic ExtError
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep ExtError :: Type -> Type # Methods from :: ExtError -> Rep ExtError x # to :: Rep ExtError x -> ExtError #
Generic StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep StackSize :: Type -> Type # Methods from :: StackSize -> Rep StackSize x # to :: Rep StackSize x -> StackSize #
Generic TcTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TcTypeError :: Type -> Type # Methods from :: TcTypeError -> Rep TcTypeError x # to :: Rep TcTypeError x -> TcTypeError #
Generic TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TopLevelType :: Type -> Type # Methods from :: TopLevelType -> Rep TopLevelType x # to :: Rep TopLevelType x -> TopLevelType #
Generic TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TypeContext :: Type -> Type # Methods from :: TypeContext -> Rep TypeContext x # to :: Rep TypeContext x -> TypeContext #
Generic MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep MutezArithErrorType :: Type -> Type # Methods from :: MutezArithErrorType -> Rep MutezArithErrorType x # to :: Rep MutezArithErrorType x -> MutezArithErrorType #
Generic ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep ShiftArithErrorType :: Type -> Type # Methods from :: ShiftArithErrorType -> Rep ShiftArithErrorType x # to :: Rep ShiftArithErrorType x -> ShiftArithErrorType #
Generic ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ArmCoord :: Type -> Type # Methods from :: ArmCoord -> Rep ArmCoord x # to :: Rep ArmCoord x -> ArmCoord #
Generic EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep EpAddress :: Type -> Type # Methods from :: EpAddress -> Rep EpAddress x # to :: Rep EpAddress x -> EpAddress #
Generic ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ParamEpError :: Type -> Type # Methods from :: ParamEpError -> Rep ParamEpError x # to :: Rep ParamEpError x -> ParamEpError #
Generic ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ParseEpAddressError :: Type -> Type # Methods from :: ParseEpAddressError -> Rep ParseEpAddressError x # to :: Rep ParseEpAddressError x -> ParseEpAddressError #
Generic DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type Rep DStorageType :: Type -> Type # Methods from :: DStorageType -> Rep DStorageType x # to :: Rep DStorageType x -> DStorageType #
Generic MyType2
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Product Associated Types type Rep MyType2 :: Type -> Type # Methods from :: MyType2 -> Rep MyType2 x # to :: Rep MyType2 x -> MyType2 #
Generic MyCompoundType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyCompoundType :: Type -> Type # Methods from :: MyCompoundType -> Rep MyCompoundType x # to :: Rep MyCompoundType x -> MyCompoundType #
Generic MyEnum
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyEnum :: Type -> Type # Methods from :: MyEnum -> Rep MyEnum x # to :: Rep MyEnum x -> MyEnum #
Generic MyType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyType :: Type -> Type # Methods from :: MyType -> Rep MyType x # to :: Rep MyType x -> MyType #
Generic MyType'
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyType' :: Type -> Type # Methods from :: MyType' -> Rep MyType' x # to :: Rep MyType' x -> MyType' #
Generic MyTypeWithNamedField
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyTypeWithNamedField :: Type -> Type # Methods from :: MyTypeWithNamedField -> Rep MyTypeWithNamedField x # to :: Rep MyTypeWithNamedField x -> MyTypeWithNamedField #
Generic CommentType
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep CommentType :: Type -> Type # Methods from :: CommentType -> Rep CommentType x # to :: Rep CommentType x -> CommentType #
Generic OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Associated Types type Rep OperationHash :: Type -> Type # Methods from :: OperationHash -> Rep OperationHash x # to :: Rep OperationHash x -> OperationHash #
Generic BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.WellTyped Associated Types type Rep BadTypeForScope :: Type -> Type # Methods from :: BadTypeForScope -> Rep BadTypeForScope x # to :: Rep BadTypeForScope x -> BadTypeForScope #
Generic T
Instance details Defined in Morley.Michelson.Typed.T Associated Types type Rep T :: Type -> Type # Methods from :: T -> Rep T x # to :: Rep T x -> T #
Generic SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Associated Types type Rep SetDelegate :: Type -> Type # Methods from :: SetDelegate -> Rep SetDelegate x # to :: Rep SetDelegate x -> SetDelegate #
Generic AnyAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Associated Types type Rep AnyAnn :: Type -> Type # Methods from :: AnyAnn -> Rep AnyAnn x # to :: Rep AnyAnn x -> AnyAnn #
Generic VarAnns
Instance details Defined in Morley.Michelson.Untyped.Annotation Associated Types type Rep VarAnns :: Type -> Type # Methods from :: VarAnns -> Rep VarAnns x # to :: Rep VarAnns x -> VarAnns #
Generic Entry
Instance details Defined in Morley.Michelson.Untyped.Contract Associated Types type Rep Entry :: Type -> Type # Methods from :: Entry -> Rep Entry x # to :: Rep Entry x -> Entry #
Generic EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpName :: Type -> Type # Methods from :: EpName -> Rep EpName x # to :: Rep EpName x -> EpName #
Generic EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpNameFromRefAnnError :: Type -> Type # Methods from :: EpNameFromRefAnnError -> Rep EpNameFromRefAnnError x # to :: Rep EpNameFromRefAnnError x -> EpNameFromRefAnnError #
Generic PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep PrintComment :: Type -> Type # Methods from :: PrintComment -> Rep PrintComment x # to :: Rep PrintComment x -> PrintComment #
Generic StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep StackRef :: Type -> Type # Methods from :: StackRef -> Rep StackRef x # to :: Rep StackRef x -> StackRef #
Generic StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep StackTypePattern :: Type -> Type # Methods from :: StackTypePattern -> Rep StackTypePattern x # to :: Rep StackTypePattern x -> StackTypePattern #
Generic TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep TyVar :: Type -> Type # Methods from :: TyVar -> Rep TyVar x # to :: Rep TyVar x -> TyVar #
Generic Var
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep Var :: Type -> Type # Methods from :: Var -> Rep Var x # to :: Rep Var x -> Var #
Generic ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Associated Types type Rep ExpandedOp :: Type -> Type # Methods from :: ExpandedOp -> Rep ExpandedOp x # to :: Rep ExpandedOp x -> ExpandedOp #
Generic ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep ParameterType :: Type -> Type # Methods from :: ParameterType -> Rep ParameterType x # to :: Rep ParameterType x -> ParameterType #
Generic T
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep T :: Type -> Type # Methods from :: T -> Rep T x # to :: Rep T x -> T #
Generic Ty
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep Ty :: Type -> Type # Methods from :: Ty -> Rep Ty x # to :: Rep Ty x -> Ty #
Generic InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep InternalByteString :: Type -> Type # Methods from :: InternalByteString -> Rep InternalByteString x # to :: Rep InternalByteString x -> InternalByteString #
Generic GlobalCounter
Instance details Defined in Morley.Tezos.Address Associated Types type Rep GlobalCounter :: Type -> Type # Methods from :: GlobalCounter -> Rep GlobalCounter x # to :: Rep GlobalCounter x -> GlobalCounter #
Generic ParseAddressError
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ParseAddressError :: Type -> Type # Methods from :: ParseAddressError -> Rep ParseAddressError x # to :: Rep ParseAddressError x -> ParseAddressError #
Generic ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ParseAddressRawError :: Type -> Type # Methods from :: ParseAddressRawError -> Rep ParseAddressRawError x # to :: Rep ParseAddressRawError x -> ParseAddressRawError #
Generic AddressKind
Instance details Defined in Morley.Tezos.Address.Kinds Associated Types type Rep AddressKind :: Type -> Type # Methods from :: AddressKind -> Rep AddressKind x # to :: Rep AddressKind x -> AddressKind #
Generic ChainId
Instance details Defined in Morley.Tezos.Core Associated Types type Rep ChainId :: Type -> Type # Methods from :: ChainId -> Rep ChainId x # to :: Rep ChainId x -> ChainId #
Generic Mutez
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Mutez :: Type -> Type # Methods from :: Mutez -> Rep Mutez x # to :: Rep Mutez x -> Mutez #
Generic Timestamp
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Timestamp :: Type -> Type # Methods from :: Timestamp -> Rep Timestamp x # to :: Rep Timestamp x -> Timestamp #
Generic KeyType
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep KeyType :: Type -> Type # Methods from :: KeyType -> Rep KeyType x # to :: Rep KeyType x -> KeyType #
Generic ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep ParseSignatureRawError :: Type -> Type # Methods from :: ParseSignatureRawError -> Rep ParseSignatureRawError x # to :: Rep ParseSignatureRawError x -> ParseSignatureRawError #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.BLS Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.BLS Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.BLS Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Associated Types type Rep DeserializationError :: Type -> Type # Methods from :: DeserializationError -> Rep DeserializationError x # to :: Rep DeserializationError x -> DeserializationError #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep Chest :: Type -> Type # Methods from :: Chest -> Rep Chest x # to :: Rep Chest x -> Chest #
Generic ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep ChestKey :: Type -> Type # Methods from :: ChestKey -> Rep ChestKey x # to :: Rep ChestKey x -> ChestKey #
Generic Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep Ciphertext :: Type -> Type # Methods from :: Ciphertext -> Rep Ciphertext x # to :: Rep Ciphertext x -> Ciphertext #
Generic HexJSONByteString
Instance details Defined in Morley.Util.ByteString Associated Types type Rep HexJSONByteString :: Type -> Type # Methods from :: HexJSONByteString -> Rep HexJSONByteString x # to :: Rep HexJSONByteString x -> HexJSONByteString #
Generic Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Mode :: Type -> Type # Methods from :: Mode -> Rep Mode x # to :: Rep Mode x -> Mode #
Generic Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Style :: Type -> Type # Methods from :: Style -> Rep Style x # to :: Rep Style x -> Style #
Generic TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep TextDetails :: Type -> Type # Methods from :: TextDetails -> Rep TextDetails x # to :: Rep TextDetails x -> TextDetails #
Generic Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Associated Types type Rep Doc :: Type -> Type # Methods from :: Doc -> Rep Doc x # to :: Rep Doc x -> Doc #
Generic Mod2
Instance details Defined in Data.Semiring Associated Types type Rep Mod2 :: Type -> Type # Methods from :: Mod2 -> Rep Mod2 x # to :: Rep Mod2 x -> Mod2 #
Generic Outcome
Instance details Defined in Test.Tasty.Core Associated Types type Rep Outcome :: Type -> Type # Methods from :: Outcome -> Rep Outcome x # to :: Rep Outcome x -> Outcome #
Generic Expr
Instance details Defined in Test.Tasty.Patterns.Types Associated Types type Rep Expr :: Type -> Type # Methods from :: Expr -> Rep Expr x # to :: Rep Expr x -> Expr #
Generic AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnLookup :: Type -> Type # Methods from :: AnnLookup -> Rep AnnLookup x # to :: Rep AnnLookup x -> AnnLookup #
Generic AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnTarget :: Type -> Type # Methods from :: AnnTarget -> Rep AnnTarget x # to :: Rep AnnTarget x -> AnnTarget #
Generic Bang
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bang :: Type -> Type # Methods from :: Bang -> Rep Bang x # to :: Rep Bang x -> Bang #
Generic Body
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Body :: Type -> Type # Methods from :: Body -> Rep Body x # to :: Rep Body x -> Body #
Generic Bytes
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bytes :: Type -> Type # Methods from :: Bytes -> Rep Bytes x # to :: Rep Bytes x -> Bytes #
Generic Callconv
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Callconv :: Type -> Type # Methods from :: Callconv -> Rep Callconv x # to :: Rep Callconv x -> Callconv #
Generic Clause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Clause :: Type -> Type # Methods from :: Clause -> Rep Clause x # to :: Rep Clause x -> Clause #
Generic Con
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Con :: Type -> Type # Methods from :: Con -> Rep Con x # to :: Rep Con x -> Con #
Generic Dec
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Dec :: Type -> Type # Methods from :: Dec -> Rep Dec x # to :: Rep Dec x -> Dec #
Generic DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivClause :: Type -> Type # Methods from :: DerivClause -> Rep DerivClause x # to :: Rep DerivClause x -> DerivClause #
Generic DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivStrategy :: Type -> Type # Methods from :: DerivStrategy -> Rep DerivStrategy x # to :: Rep DerivStrategy x -> DerivStrategy #
Generic DocLoc
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DocLoc :: Type -> Type # Methods from :: DocLoc -> Rep DocLoc x # to :: Rep DocLoc x -> DocLoc #
Generic Exp
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Exp :: Type -> Type # Methods from :: Exp -> Rep Exp x # to :: Rep Exp x -> Exp #
Generic FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FamilyResultSig :: Type -> Type # Methods from :: FamilyResultSig -> Rep FamilyResultSig x # to :: Rep FamilyResultSig x -> FamilyResultSig #
Generic Fixity
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FixityDirection :: Type -> Type # Methods from :: FixityDirection -> Rep FixityDirection x # to :: Rep FixityDirection x -> FixityDirection #
Generic Foreign
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Foreign :: Type -> Type # Methods from :: Foreign -> Rep Foreign x # to :: Rep Foreign x -> Foreign #
Generic FunDep
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FunDep :: Type -> Type # Methods from :: FunDep -> Rep FunDep x # to :: Rep FunDep x -> FunDep #
Generic Guard
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Guard :: Type -> Type # Methods from :: Guard -> Rep Guard x # to :: Rep Guard x -> Guard #
Generic Info
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Info :: Type -> Type # Methods from :: Info -> Rep Info x # to :: Rep Info x -> Info #
Generic InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep InjectivityAnn :: Type -> Type # Methods from :: InjectivityAnn -> Rep InjectivityAnn x # to :: Rep InjectivityAnn x -> InjectivityAnn #
Generic Inline
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Inline :: Type -> Type # Methods from :: Inline -> Rep Inline x # to :: Rep Inline x -> Inline #
Generic Lit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Lit :: Type -> Type # Methods from :: Lit -> Rep Lit x # to :: Rep Lit x -> Lit #
Generic Loc
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Loc :: Type -> Type # Methods from :: Loc -> Rep Loc x # to :: Rep Loc x -> Loc #
Generic Match
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Match :: Type -> Type # Methods from :: Match -> Rep Match x # to :: Rep Match x -> Match #
Generic ModName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModName :: Type -> Type # Methods from :: ModName -> Rep ModName x # to :: Rep ModName x -> ModName #
Generic Module
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Module :: Type -> Type # Methods from :: Module -> Rep Module x # to :: Rep Module x -> Module #
Generic ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModuleInfo :: Type -> Type # Methods from :: ModuleInfo -> Rep ModuleInfo x # to :: Rep ModuleInfo x -> ModuleInfo #
Generic Name
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Name :: Type -> Type # Methods from :: Name -> Rep Name x # to :: Rep Name x -> Name #
Generic NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameFlavour :: Type -> Type # Methods from :: NameFlavour -> Rep NameFlavour x # to :: Rep NameFlavour x -> NameFlavour #
Generic NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameSpace :: Type -> Type # Methods from :: NameSpace -> Rep NameSpace x # to :: Rep NameSpace x -> NameSpace #
Generic OccName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep OccName :: Type -> Type # Methods from :: OccName -> Rep OccName x # to :: Rep OccName x -> OccName #
Generic Overlap
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Overlap :: Type -> Type # Methods from :: Overlap -> Rep Overlap x # to :: Rep Overlap x -> Overlap #
Generic Pat
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pat :: Type -> Type # Methods from :: Pat -> Rep Pat x # to :: Rep Pat x -> Pat #
Generic PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynArgs :: Type -> Type # Methods from :: PatSynArgs -> Rep PatSynArgs x # to :: Rep PatSynArgs x -> PatSynArgs #
Generic PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynDir :: Type -> Type # Methods from :: PatSynDir -> Rep PatSynDir x # to :: Rep PatSynDir x -> PatSynDir #
Generic Phases
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Phases :: Type -> Type # Methods from :: Phases -> Rep Phases x # to :: Rep Phases x -> Phases #
Generic PkgName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PkgName :: Type -> Type # Methods from :: PkgName -> Rep PkgName x # to :: Rep PkgName x -> PkgName #
Generic Pragma
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pragma :: Type -> Type # Methods from :: Pragma -> Rep Pragma x # to :: Rep Pragma x -> Pragma #
Generic Range
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Range :: Type -> Type # Methods from :: Range -> Rep Range x # to :: Rep Range x -> Range #
Generic Role
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Role :: Type -> Type # Methods from :: Role -> Rep Role x # to :: Rep Role x -> Role #
Generic RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleBndr :: Type -> Type # Methods from :: RuleBndr -> Rep RuleBndr x # to :: Rep RuleBndr x -> RuleBndr #
Generic RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleMatch :: Type -> Type # Methods from :: RuleMatch -> Rep RuleMatch x # to :: Rep RuleMatch x -> RuleMatch #
Generic Safety
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Safety :: Type -> Type # Methods from :: Safety -> Rep Safety x # to :: Rep Safety x -> Safety #
Generic SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic Specificity
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Specificity :: Type -> Type # Methods from :: Specificity -> Rep Specificity x # to :: Rep Specificity x -> Specificity #
Generic Stmt
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Stmt :: Type -> Type # Methods from :: Stmt -> Rep Stmt x # to :: Rep Stmt x -> Stmt #
Generic TyLit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyLit :: Type -> Type # Methods from :: TyLit -> Rep TyLit x # to :: Rep TyLit x -> TyLit #
Generic TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TySynEqn :: Type -> Type # Methods from :: TySynEqn -> Rep TySynEqn x # to :: Rep TySynEqn x -> TySynEqn #
Generic Type
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Type :: Type -> Type # Methods from :: Type -> Rep Type x # to :: Rep Type x -> Type #
Generic TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TypeFamilyHead :: Type -> Type # Methods from :: TypeFamilyHead -> Rep TypeFamilyHead x # to :: Rep TypeFamilyHead x -> TypeFamilyHead #
Generic ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorInfo :: Type -> Type # Methods from :: ConstructorInfo -> Rep ConstructorInfo x # to :: Rep ConstructorInfo x -> ConstructorInfo #
Generic ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorVariant :: Type -> Type # Methods from :: ConstructorVariant -> Rep ConstructorVariant x # to :: Rep ConstructorVariant x -> ConstructorVariant #
Generic DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeInfo :: Type -> Type # Methods from :: DatatypeInfo -> Rep DatatypeInfo x # to :: Rep DatatypeInfo x -> DatatypeInfo #
Generic DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeVariant :: Type -> Type # Methods from :: DatatypeVariant -> Rep DatatypeVariant x # to :: Rep DatatypeVariant x -> DatatypeVariant #
Generic FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep FieldStrictness :: Type -> Type # Methods from :: FieldStrictness -> Rep FieldStrictness x # to :: Rep FieldStrictness x -> FieldStrictness #
Generic Strictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Strictness :: Type -> Type # Methods from :: Strictness -> Rep Strictness x # to :: Rep Strictness x -> Strictness #
Generic Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Unpackedness :: Type -> Type # Methods from :: Unpackedness -> Rep Unpackedness x # to :: Rep Unpackedness x -> Unpackedness #
Generic DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DClause :: Type -> Type # Methods from :: DClause -> Rep DClause x # to :: Rep DClause x -> DClause #
Generic DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DCon :: Type -> Type # Methods from :: DCon -> Rep DCon x # to :: Rep DCon x -> DCon #
Generic DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DConFields :: Type -> Type # Methods from :: DConFields -> Rep DConFields x # to :: Rep DConFields x -> DConFields #
Generic DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDec :: Type -> Type # Methods from :: DDec -> Rep DDec x # to :: Rep DDec x -> DDec #
Generic DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivClause :: Type -> Type # Methods from :: DDerivClause -> Rep DDerivClause x # to :: Rep DDerivClause x -> DDerivClause #
Generic DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivStrategy :: Type -> Type # Methods from :: DDerivStrategy -> Rep DDerivStrategy x # to :: Rep DDerivStrategy x -> DDerivStrategy #
Generic DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DExp :: Type -> Type # Methods from :: DExp -> Rep DExp x # to :: Rep DExp x -> DExp #
Generic DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DFamilyResultSig :: Type -> Type # Methods from :: DFamilyResultSig -> Rep DFamilyResultSig x # to :: Rep DFamilyResultSig x -> DFamilyResultSig #
Generic DForallTelescope
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DForallTelescope :: Type -> Type # Methods from :: DForallTelescope -> Rep DForallTelescope x # to :: Rep DForallTelescope x -> DForallTelescope #
Generic DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DForeign :: Type -> Type # Methods from :: DForeign -> Rep DForeign x # to :: Rep DForeign x -> DForeign #
Generic DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DInfo :: Type -> Type # Methods from :: DInfo -> Rep DInfo x # to :: Rep DInfo x -> DInfo #
Generic DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DLetDec :: Type -> Type # Methods from :: DLetDec -> Rep DLetDec x # to :: Rep DLetDec x -> DLetDec #
Generic DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DMatch :: Type -> Type # Methods from :: DMatch -> Rep DMatch x # to :: Rep DMatch x -> DMatch #
Generic DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPat :: Type -> Type # Methods from :: DPat -> Rep DPat x # to :: Rep DPat x -> DPat #
Generic DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPatSynDir :: Type -> Type # Methods from :: DPatSynDir -> Rep DPatSynDir x # to :: Rep DPatSynDir x -> DPatSynDir #
Generic DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPragma :: Type -> Type # Methods from :: DPragma -> Rep DPragma x # to :: Rep DPragma x -> DPragma #
Generic DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DRuleBndr :: Type -> Type # Methods from :: DRuleBndr -> Rep DRuleBndr x # to :: Rep DRuleBndr x -> DRuleBndr #
Generic DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTySynEqn :: Type -> Type # Methods from :: DTySynEqn -> Rep DTySynEqn x # to :: Rep DTySynEqn x -> DTySynEqn #
Generic DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DType :: Type -> Type # Methods from :: DType -> Rep DType x # to :: Rep DType x -> DType #
Generic DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTypeFamilyHead :: Type -> Type # Methods from :: DTypeFamilyHead -> Rep DTypeFamilyHead x # to :: Rep DTypeFamilyHead x -> DTypeFamilyHead #
Generic NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep NewOrData :: Type -> Type # Methods from :: NewOrData -> Rep NewOrData x # to :: Rep NewOrData x -> NewOrData #
Generic DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DFunArgs :: Type -> Type # Methods from :: DFunArgs -> Rep DFunArgs x # to :: Rep DFunArgs x -> DFunArgs #
Generic DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DTypeArg :: Type -> Type # Methods from :: DTypeArg -> Rep DTypeArg x # to :: Rep DTypeArg x -> DTypeArg #
Generic DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DVisFunArg :: Type -> Type # Methods from :: DVisFunArg -> Rep DVisFunArg x # to :: Rep DVisFunArg x -> DVisFunArg #
Generic Undefined
Instance details Defined in Universum.Debug Associated Types type Rep Undefined :: Type -> Type # Methods from :: Undefined -> Rep Undefined x # to :: Rep Undefined x -> Undefined #
Generic ()
Instance details Defined in GHC.Generics Associated Types type Rep () :: Type -> Type # Methods from :: () -> Rep () x # to :: Rep () x -> () #
Generic Bool
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Generic (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Associated Types type Rep (Last' a) :: Type -> Type # Methods from :: Last' a -> Rep (Last' a) x # to :: Rep (Last' a) x -> Last' a #
Generic (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Associated Types type Rep (Option' a) :: Type -> Type # Methods from :: Option' a -> Rep (Option' a) x # to :: Rep (Option' a) x -> Option' a #
Generic (Only a)
Instance details Defined in Data.Tuple.Only Associated Types type Rep (Only a) :: Type -> Type # Methods from :: Only a -> Rep (Only a) x # to :: Rep (Only a) x -> Only a #
Generic (ZipList a)
Instance details Defined in Control.Applicative Associated Types type Rep (ZipList a) :: Type -> Type # Methods from :: ZipList a -> Rep (ZipList a) x # to :: Rep (ZipList a) x -> ZipList a #
Generic (Complex a)
Instance details Defined in Data.Complex Associated Types type Rep (Complex a) :: Type -> Type # Methods from :: Complex a -> Rep (Complex a) x # to :: Rep (Complex a) x -> Complex a #
Generic (Identity a)
Instance details Defined in Data.Functor.Identity Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Generic (First a)
Instance details Defined in Data.Monoid Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (Last a)
Instance details Defined in Data.Monoid Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (Down a)
Instance details Defined in GHC.Generics Associated Types type Rep (Down a) :: Type -> Type # Methods from :: Down a -> Rep (Down a) x # to :: Rep (Down a) x -> Down a #
Generic (First a)
Instance details Defined in Data.Semigroup Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (Last a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (Max a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Max a) :: Type -> Type # Methods from :: Max a -> Rep (Max a) x # to :: Rep (Max a) x -> Max a #
Generic (Min a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Min a) :: Type -> Type # Methods from :: Min a -> Rep (Min a) x # to :: Rep (Min a) x -> Min a #
Generic (WrappedMonoid m)
Instance details Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m #
Generic (Dual a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Dual a) :: Type -> Type # Methods from :: Dual a -> Rep (Dual a) x # to :: Rep (Dual a) x -> Dual a #
Generic (Endo a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Endo a) :: Type -> Type # Methods from :: Endo a -> Rep (Endo a) x # to :: Rep (Endo a) x -> Endo a #
Generic (Product a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Product a) :: Type -> Type # Methods from :: Product a -> Rep (Product a) x # to :: Rep (Product a) x -> Product a #
Generic (Sum a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Sum a) :: Type -> Type # Methods from :: Sum a -> Rep (Sum a) x # to :: Rep (Sum a) x -> Sum a #
Generic (Par1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (Par1 p) :: Type -> Type # Methods from :: Par1 p -> Rep (Par1 p) x # to :: Rep (Par1 p) x -> Par1 p #
Generic (SCC vertex)
Instance details Defined in Data.Graph Associated Types type Rep (SCC vertex) :: Type -> Type # Methods from :: SCC vertex -> Rep (SCC vertex) x # to :: Rep (SCC vertex) x -> SCC vertex #
Generic (Digit a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Digit a) :: Type -> Type # Methods from :: Digit a -> Rep (Digit a) x # to :: Rep (Digit a) x -> Digit a #
Generic (Elem a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Elem a) :: Type -> Type # Methods from :: Elem a -> Rep (Elem a) x # to :: Rep (Elem a) x -> Elem a #
Generic (FingerTree a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (FingerTree a) :: Type -> Type # Methods from :: FingerTree a -> Rep (FingerTree a) x # to :: Rep (FingerTree a) x -> FingerTree a #
Generic (Node a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Node a) :: Type -> Type # Methods from :: Node a -> Rep (Node a) x # to :: Rep (Node a) x -> Node a #
Generic (ViewL a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewL a) :: Type -> Type # Methods from :: ViewL a -> Rep (ViewL a) x # to :: Rep (ViewL a) x -> ViewL a #
Generic (ViewR a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewR a) :: Type -> Type # Methods from :: ViewR a -> Rep (ViewR a) x # to :: Rep (ViewR a) x -> ViewR a #
Generic (Tree a)
Instance details Defined in Data.Tree Associated Types type Rep (Tree a) :: Type -> Type # Methods from :: Tree a -> Rep (Tree a) x # to :: Rep (Tree a) x -> Tree a #
Generic (Fix f)
Instance details Defined in Data.Fix Associated Types type Rep (Fix f) :: Type -> Type # Methods from :: Fix f -> Rep (Fix f) x # to :: Rep (Fix f) x -> Fix f #
Generic (Finite n)
Instance details Defined in Data.Finite.Internal Associated Types type Rep (Finite n) :: Type -> Type # Methods from :: Finite n -> Rep (Finite n) x # to :: Rep (Finite n) x -> Finite n #
Generic (Binary p)
Instance details Defined in Data.Field.Galois.Binary Associated Types type Rep (Binary p) :: Type -> Type # Methods from :: Binary p -> Rep (Binary p) x # to :: Rep (Binary p) x -> Binary p #
Generic (Prime p)
Instance details Defined in Data.Field.Galois.Prime Associated Types type Rep (Prime p) :: Type -> Type # Methods from :: Prime p -> Rep (Prime p) x # to :: Rep (Prime p) x -> Prime p #
Generic (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (ChestT a) :: Type -> Type # Methods from :: ChestT a -> Rep (ChestT a) x # to :: Rep (ChestT a) x -> ChestT a #
Generic (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (OpenChestT a) :: Type -> Type # Methods from :: OpenChestT a -> Rep (OpenChestT a) x # to :: Rep (OpenChestT a) x -> OpenChestT a #
Generic (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Packed a) :: Type -> Type # Methods from :: Packed a -> Rep (Packed a) x # to :: Rep (Packed a) x -> Packed a #
Generic (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (TSignature a) :: Type -> Type # Methods from :: TSignature a -> Rep (TSignature a) x # to :: Rep (TSignature a) x -> TSignature a #
Generic (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type Rep (ShouldHaveEntrypoints a) :: Type -> Type # Methods from :: ShouldHaveEntrypoints a -> Rep (ShouldHaveEntrypoints a) x # to :: Rep (ShouldHaveEntrypoints a) x -> ShouldHaveEntrypoints a #
Generic (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (VoidResult r) :: Type -> Type # Methods from :: VoidResult r -> Rep (VoidResult r) x # to :: Rep (VoidResult r) x -> VoidResult r #
Generic (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (Range a) :: Type -> Type # Methods from :: Range a -> Rep (Range a) x # to :: Rep (Range a) x -> Range a #
Generic (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeEE a) :: Type -> Type # Methods from :: RangeEE a -> Rep (RangeEE a) x # to :: Rep (RangeEE a) x -> RangeEE a #
Generic (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeEI a) :: Type -> Type # Methods from :: RangeEI a -> Rep (RangeEI a) x # to :: Rep (RangeEI a) x -> RangeEI a #
Generic (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeFailureInfo a) :: Type -> Type # Methods from :: RangeFailureInfo a -> Rep (RangeFailureInfo a) x # to :: Rep (RangeFailureInfo a) x -> RangeFailureInfo a #
Generic (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeIE a) :: Type -> Type # Methods from :: RangeIE a -> Rep (RangeIE a) x # to :: Rep (RangeIE a) x -> RangeIE a #
Generic (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep (UParam entries) :: Type -> Type # Methods from :: UParam entries -> Rep (UParam entries) x # to :: Rep (UParam entries) x -> UParam entries #
Generic (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type Rep (ReadTicket a) :: Type -> Type # Methods from :: ReadTicket a -> Rep (ReadTicket a) x # to :: Rep (ReadTicket a) x -> ReadTicket a #
Generic (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ErrorFancy e) :: Type -> Type # Methods from :: ErrorFancy e -> Rep (ErrorFancy e) x # to :: Rep (ErrorFancy e) x -> ErrorFancy e #
Generic (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ErrorItem t) :: Type -> Type # Methods from :: ErrorItem t -> Rep (ErrorItem t) x # to :: Rep (ErrorItem t) x -> ErrorItem t #
Generic (PosState s)
Instance details Defined in Text.Megaparsec.State Associated Types type Rep (PosState s) :: Type -> Type # Methods from :: PosState s -> Rep (PosState s) x # to :: Rep (PosState s) x -> PosState s #
Generic (Mod m)
Instance details Defined in Data.Mod Associated Types type Rep (Mod m) :: Type -> Type # Methods from :: Mod m -> Rep (Mod m) x # to :: Rep (Mod m) x -> Mod m #
Generic (StringEncode a)
Instance details Defined in Morley.Micheline.Json Associated Types type Rep (StringEncode a) :: Type -> Type # Methods from :: StringEncode a -> Rep (StringEncode a) x # to :: Rep (StringEncode a) x -> StringEncode a #
Generic (InterpretError ext)
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep (InterpretError ext) :: Type -> Type # Methods from :: InterpretError ext -> Rep (InterpretError ext) x # to :: Rep (InterpretError ext) x -> InterpretError ext #
Generic (MichelsonFailureWithStack ext)
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep (MichelsonFailureWithStack ext) :: Type -> Type # Methods from :: MichelsonFailureWithStack ext -> Rep (MichelsonFailureWithStack ext) x # to :: Rep (MichelsonFailureWithStack ext) x -> MichelsonFailureWithStack ext #
Generic (ResultStateLogs res)
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep (ResultStateLogs res) :: Type -> Type # Methods from :: ResultStateLogs res -> Rep (ResultStateLogs res) x # to :: Rep (ResultStateLogs res) x -> ResultStateLogs res #
Generic (ParsedSeq op)
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep (ParsedSeq op) :: Type -> Type # Methods from :: ParsedSeq op -> Rep (ParsedSeq op) x # to :: Rep (ParsedSeq op) x -> ParsedSeq op #
Generic (TCOpSeq op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep (TCOpSeq op) :: Type -> Type # Methods from :: TCOpSeq op -> Rep (TCOpSeq op) x # to :: Rep (TCOpSeq op) x -> TCOpSeq op #
Generic (TcError' op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep (TcError' op) :: Type -> Type # Methods from :: TcError' op -> Rep (TcError' op) x # to :: Rep (TcError' op) x -> TcError' op #
Generic (IllTypedInstr op)
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Associated Types type Rep (IllTypedInstr op) :: Type -> Type # Methods from :: IllTypedInstr op -> Rep (IllTypedInstr op) x # to :: Rep (IllTypedInstr op) x -> IllTypedInstr op #
Generic (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep (ParamNotes t) :: Type -> Type # Methods from :: ParamNotes t -> Rep (ParamNotes t) x # to :: Rep (ParamNotes t) x -> ParamNotes t #
Generic (ExtInstr s)
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep (ExtInstr s) :: Type -> Type # Methods from :: ExtInstr s -> Rep (ExtInstr s) x # to :: Rep (ExtInstr s) x -> ExtInstr s #
Generic (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep (PrintComment st) :: Type -> Type # Methods from :: PrintComment st -> Rep (PrintComment st) x # to :: Rep (PrintComment st) x -> PrintComment st #
Generic (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Associated Types type Rep (Contract' op) :: Type -> Type # Methods from :: Contract' op -> Rep (Contract' op) x # to :: Rep (Contract' op) x -> Contract' op #
Generic (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Associated Types type Rep (View' op) :: Type -> Type # Methods from :: View' op -> Rep (View' op) x # to :: Rep (View' op) x -> View' op #
Generic (Hash kind)
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep (Hash kind) :: Type -> Type # Methods from :: Hash kind -> Rep (Hash kind) x # to :: Rep (Hash kind) x -> Hash kind #
Generic (MismatchError a)
Instance details Defined in Morley.Util.MismatchError Associated Types type Rep (MismatchError a) :: Type -> Type # Methods from :: MismatchError a -> Rep (MismatchError a) x # to :: Rep (MismatchError a) x -> MismatchError a #
Generic (All a)
Instance details Defined in Morley.Prelude.Boolean Associated Types type Rep (All a) :: Type -> Type # Methods from :: All a -> Rep (All a) x # to :: Rep (All a) x -> All a #
Generic (Any a)
Instance details Defined in Morley.Prelude.Boolean Associated Types type Rep (Any a) :: Type -> Type # Methods from :: Any a -> Rep (Any a) x # to :: Rep (Any a) x -> Any a #
Generic (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep (Doc a) :: Type -> Type # Methods from :: Doc a -> Rep (Doc a) x # to :: Rep (Doc a) x -> Doc a #
Generic (Doc ann)
Instance details Defined in Prettyprinter.Internal Associated Types type Rep (Doc ann) :: Type -> Type # Methods from :: Doc ann -> Rep (Doc ann) x # to :: Rep (Doc ann) x -> Doc ann #
Generic (SimpleDocStream ann)
Instance details Defined in Prettyprinter.Internal Associated Types type Rep (SimpleDocStream ann) :: Type -> Type # Methods from :: SimpleDocStream ann -> Rep (SimpleDocStream ann) x # to :: Rep (SimpleDocStream ann) x -> SimpleDocStream ann #
Generic (Add a)
Instance details Defined in Data.Semiring Associated Types type Rep (Add a) :: Type -> Type # Methods from :: Add a -> Rep (Add a) x # to :: Rep (Add a) x -> Add a #
Generic (IntSetOf a)
Instance details Defined in Data.Semiring Associated Types type Rep (IntSetOf a) :: Type -> Type # Methods from :: IntSetOf a -> Rep (IntSetOf a) x # to :: Rep (IntSetOf a) x -> IntSetOf a #
Generic (Mul a)
Instance details Defined in Data.Semiring Associated Types type Rep (Mul a) :: Type -> Type # Methods from :: Mul a -> Rep (Mul a) x # to :: Rep (Mul a) x -> Mul a #
Generic (WrappedNum a)
Instance details Defined in Data.Semiring Associated Types type Rep (WrappedNum a) :: Type -> Type # Methods from :: WrappedNum a -> Rep (WrappedNum a) x # to :: Rep (WrappedNum a) x -> WrappedNum a #
Generic (Maybe a)
Instance details Defined in Data.Strict.Maybe Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Generic (TyVarBndr flag)
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep (TyVarBndr flag) :: Type -> Type # Methods from :: TyVarBndr flag -> Rep (TyVarBndr flag) x # to :: Rep (TyVarBndr flag) x -> TyVarBndr flag #
Generic (DTyVarBndr flag)
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep (DTyVarBndr flag) :: Type -> Type # Methods from :: DTyVarBndr flag -> Rep (DTyVarBndr flag) x # to :: Rep (DTyVarBndr flag) x -> DTyVarBndr flag #
KnownSymbol s => Generic (ElField '(s, a))
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (ElField '(s, a)) :: Type -> Type # Methods from :: ElField '(s, a) -> Rep (ElField '(s, a)) x # to :: Rep (ElField '(s, a)) x -> ElField '(s, a) #
Generic (Identity a)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Generic (NonEmpty a)
Instance details Defined in GHC.Generics Associated Types type Rep (NonEmpty a) :: Type -> Type # Methods from :: NonEmpty a -> Rep (NonEmpty a) x # to :: Rep (NonEmpty a) x -> NonEmpty a #
Generic (Maybe a)
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Generic (a)
Instance details Defined in GHC.Generics Associated Types type Rep (a) :: Type -> Type # Methods from :: (a) -> Rep (a) x # to :: Rep (a) x -> (a) #
Generic [a]
Instance details Defined in GHC.Generics Associated Types type Rep [a] :: Type -> Type # Methods from :: [a] -> Rep [a] x # to :: Rep [a] x -> [a] #
Generic (WrappedMonad m a)
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedMonad m a) :: Type -> Type # Methods from :: WrappedMonad m a -> Rep (WrappedMonad m a) x # to :: Rep (WrappedMonad m a) x -> WrappedMonad m a #
Generic (Either a b)
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Generic (Arg a b)
Instance details Defined in Data.Semigroup Associated Types type Rep (Arg a b) :: Type -> Type # Methods from :: Arg a b -> Rep (Arg a b) x # to :: Rep (Arg a b) x -> Arg a b #
Generic (U1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (U1 p) :: Type -> Type # Methods from :: U1 p -> Rep (U1 p) x # to :: Rep (U1 p) x -> U1 p #
Generic (V1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (V1 p) :: Type -> Type # Methods from :: V1 p -> Rep (V1 p) x # to :: Rep (V1 p) x -> V1 p #
Generic (ListN n a)
Instance details Defined in Basement.Sized.List Associated Types type Rep (ListN n a) :: Type -> Type # Methods from :: ListN n a -> Rep (ListN n a) x # to :: Rep (ListN n a) x -> ListN n a #
Generic (Bimap a b)
Instance details Defined in Data.Bimap Associated Types type Rep (Bimap a b) :: Type -> Type # Methods from :: Bimap a b -> Rep (Bimap a b) x # to :: Rep (Bimap a b) x -> Bimap a b #
Generic (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Associated Types type Rep (Cofree f a) :: Type -> Type # Methods from :: Cofree f a -> Rep (Cofree f a) x # to :: Rep (Cofree f a) x -> Cofree f a #
Generic (Free f a)
Instance details Defined in Control.Monad.Free Associated Types type Rep (Free f a) :: Type -> Type # Methods from :: Free f a -> Rep (Free f a) x # to :: Rep (Free f a) x -> Free f a #
Generic (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Associated Types type Rep (Extension p k) :: Type -> Type # Methods from :: Extension p k -> Rep (Extension p k) x # to :: Rep (Extension p k) x -> Extension p k #
Generic (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Associated Types type Rep (RootsOfUnity n k) :: Type -> Type # Methods from :: RootsOfUnity n k -> Rep (RootsOfUnity n k) x # to :: Rep (RootsOfUnity n k) x -> RootsOfUnity n k #
Generic (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Associated Types type Rep (TAddress p vd) :: Type -> Type # Methods from :: TAddress p vd -> Rep (TAddress p vd) x # to :: Rep (TAddress p vd) x -> TAddress p vd #
Generic (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Hash alg a) :: Type -> Type # Methods from :: Hash alg a -> Rep (Hash alg a) x # to :: Rep (Hash alg a) x -> Hash alg a #
Generic (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Rep (ParameterWrapper deriv cp) :: Type -> Type # Methods from :: ParameterWrapper deriv cp -> Rep (ParameterWrapper deriv cp) x # to :: Rep (ParameterWrapper deriv cp) x -> ParameterWrapper deriv cp #
Generic (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type Rep (Extensible x) :: Type -> Type # Methods from :: Extensible x -> Rep (Extensible x) x0 # to :: Rep (Extensible x) x0 -> Extensible x #
Generic (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type Rep (WrappedLambda i o) :: Type -> Type # Methods from :: WrappedLambda i o -> Rep (WrappedLambda i o) x # to :: Rep (WrappedLambda i o) x -> WrappedLambda i o #
Generic (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (View_ a r) :: Type -> Type # Methods from :: View_ a r -> Rep (View_ a r) x # to :: Rep (View_ a r) x -> View_ a r #
Generic (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (Void_ a b) :: Type -> Type # Methods from :: Void_ a b -> Rep (Void_ a b) x # to :: Rep (Void_ a b) x -> Void_ a b #
Generic (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep (ZippedStackRepr a b) :: Type -> Type # Methods from :: ZippedStackRepr a b -> Rep (ZippedStackRepr a b) x # to :: Rep (ZippedStackRepr a b) x -> ZippedStackRepr a b #
Generic (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ParseError s e) :: Type -> Type # Methods from :: ParseError s e -> Rep (ParseError s e) x # to :: Rep (ParseError s e) x -> ParseError s e #
Generic (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ParseErrorBundle s e) :: Type -> Type # Methods from :: ParseErrorBundle s e -> Rep (ParseErrorBundle s e) x # to :: Rep (ParseErrorBundle s e) x -> ParseErrorBundle s e #
Generic (State s e)
Instance details Defined in Text.Megaparsec.State Associated Types type Rep (State s e) :: Type -> Type # Methods from :: State s e -> Rep (State s e) x # to :: Rep (State s e) x -> State s e #
Generic (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep (ArithError n m) :: Type -> Type # Methods from :: ArithError n m -> Rep (ArithError n m) x # to :: Rep (ArithError n m) x -> ArithError n m #
Generic (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type Rep (BigMap k v) :: Type -> Type # Methods from :: BigMap k v -> Rep (BigMap k v) x # to :: Rep (BigMap k v) x -> BigMap k v #
Generic (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Associated Types type Rep (TransferTokens instr p) :: Type -> Type # Methods from :: TransferTokens instr p -> Rep (TransferTokens instr p) x # to :: Rep (TransferTokens instr p) x -> TransferTokens instr p #
Generic (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Associated Types type Rep (Annotation tag) :: Type -> Type # Methods from :: Annotation tag -> Rep (Annotation tag) x # to :: Rep (Annotation tag) x -> Annotation tag #
Generic (ExtInstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep (ExtInstrAbstract f op) :: Type -> Type # Methods from :: ExtInstrAbstract f op -> Rep (ExtInstrAbstract f op) x # to :: Rep (ExtInstrAbstract f op) x -> ExtInstrAbstract f op #
Generic (TestAssert f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep (TestAssert f op) :: Type -> Type # Methods from :: TestAssert f op -> Rep (TestAssert f op) x # to :: Rep (TestAssert f op) x -> TestAssert f op #
Generic (InstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Instr Associated Types type Rep (InstrAbstract f op) :: Type -> Type # Methods from :: InstrAbstract f op -> Rep (InstrAbstract f op) x # to :: Rep (InstrAbstract f op) x -> InstrAbstract f op #
Generic (IntMapOf k v)
Instance details Defined in Data.Semiring Associated Types type Rep (IntMapOf k v) :: Type -> Type # Methods from :: IntMapOf k v -> Rep (IntMapOf k v) x # to :: Rep (IntMapOf k v) x -> IntMapOf k v #
Generic (Either a b)
Instance details Defined in Data.Strict.Either Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Generic (These a b)
Instance details Defined in Data.Strict.These Associated Types type Rep (These a b) :: Type -> Type # Methods from :: These a b -> Rep (These a b) x # to :: Rep (These a b) x -> These a b #
Generic (Pair a b)
Instance details Defined in Data.Strict.Tuple Associated Types type Rep (Pair a b) :: Type -> Type # Methods from :: Pair a b -> Rep (Pair a b) x # to :: Rep (Pair a b) x -> Pair a b #
Generic (These a b)
Instance details Defined in Data.These Associated Types type Rep (These a b) :: Type -> Type # Methods from :: These a b -> Rep (These a b) x # to :: Rep (These a b) x -> These a b #
Generic (a, b)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b) :: Type -> Type # Methods from :: (a, b) -> Rep (a, b) x # to :: Rep (a, b) x -> (a, b) #
Generic (WrappedArrow a b c)
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedArrow a b c) :: Type -> Type # Methods from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x # to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c #
Generic (Kleisli m a b)
Instance details Defined in Control.Arrow Associated Types type Rep (Kleisli m a b) :: Type -> Type # Methods from :: Kleisli m a b -> Rep (Kleisli m a b) x # to :: Rep (Kleisli m a b) x -> Kleisli m a b #
Generic (Const a b)
Instance details Defined in Data.Functor.Const Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Generic (Ap f a)
Instance details Defined in Data.Monoid Associated Types type Rep (Ap f a) :: Type -> Type # Methods from :: Ap f a -> Rep (Ap f a) x # to :: Rep (Ap f a) x -> Ap f a #
Generic (Alt f a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Alt f a) :: Type -> Type # Methods from :: Alt f a -> Rep (Alt f a) x # to :: Rep (Alt f a) x -> Alt f a #
Generic (Rec1 f p)
Instance details Defined in GHC.Generics Associated Types type Rep (Rec1 f p) :: Type -> Type # Methods from :: Rec1 f p -> Rep (Rec1 f p) x # to :: Rep (Rec1 f p) x -> Rec1 f p #
Generic (URec (Ptr ()) p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec (Ptr ()) p) :: Type -> Type # Methods from :: URec (Ptr ()) p -> Rep (URec (Ptr ()) p) x # to :: Rep (URec (Ptr ()) p) x -> URec (Ptr ()) p #
Generic (URec Char p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Char p) :: Type -> Type # Methods from :: URec Char p -> Rep (URec Char p) x # to :: Rep (URec Char p) x -> URec Char p #
Generic (URec Double p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Double p) :: Type -> Type # Methods from :: URec Double p -> Rep (URec Double p) x # to :: Rep (URec Double p) x -> URec Double p #
Generic (URec Float p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Float p) :: Type -> Type # Methods from :: URec Float p -> Rep (URec Float p) x # to :: Rep (URec Float p) x -> URec Float p #
Generic (URec Int p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Int p) :: Type -> Type # Methods from :: URec Int p -> Rep (URec Int p) x # to :: Rep (URec Int p) x -> URec Int p #
Generic (URec Word p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Word p) :: Type -> Type # Methods from :: URec Word p -> Rep (URec Word p) x # to :: Rep (URec Word p) x -> URec Word p #
Generic (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Associated Types type Rep (Fix p a) :: Type -> Type # Methods from :: Fix p a -> Rep (Fix p a) x # to :: Rep (Fix p a) x -> Fix p a #
Generic (Join p a)
Instance details Defined in Data.Bifunctor.Join Associated Types type Rep (Join p a) :: Type -> Type # Methods from :: Join p a -> Rep (Join p a) x # to :: Rep (Join p a) x -> Join p a #
Generic (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Associated Types type Rep (CofreeF f a b) :: Type -> Type # Methods from :: CofreeF f a b -> Rep (CofreeF f a b) x # to :: Rep (CofreeF f a b) x -> CofreeF f a b #
Generic (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Associated Types type Rep (FreeF f a b) :: Type -> Type # Methods from :: FreeF f a b -> Rep (FreeF f a b) x # to :: Rep (FreeF f a b) x -> FreeF f a b #
Generic (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type Rep (STicket action td) :: Type -> Type # Methods from :: STicket action td -> Rep (STicket action td) x # to :: Rep (STicket action td) x -> STicket action td #
Generic (Elt f op)
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep (Elt f op) :: Type -> Type # Methods from :: Elt f op -> Rep (Elt f op) x # to :: Rep (Elt f op) x -> Elt f op #
Generic (Value' f op)
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep (Value' f op) :: Type -> Type # Methods from :: Value' f op -> Rep (Value' f op) x # to :: Rep (Value' f op) x -> Value' f op #
Generic (Tagged s b)
Instance details Defined in Data.Tagged Associated Types type Rep (Tagged s b) :: Type -> Type # Methods from :: Tagged s b -> Rep (Tagged s b) x # to :: Rep (Tagged s b) x -> Tagged s b #
Generic (These1 f g a)
Instance details Defined in Data.Functor.These Associated Types type Rep (These1 f g a) :: Type -> Type # Methods from :: These1 f g a -> Rep (These1 f g a) x # to :: Rep (These1 f g a) x -> These1 f g a #
Generic (Rec f rs) => Generic (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f (r ': rs)) :: Type -> Type # Methods from :: Rec f (r ': rs) -> Rep (Rec f (r ': rs)) x # to :: Rep (Rec f (r ': rs)) x -> Rec f (r ': rs) #
Generic (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f '[]) :: Type -> Type # Methods from :: Rec f '[] -> Rep (Rec f '[]) x # to :: Rep (Rec f '[]) x -> Rec f '[] #
Generic (Const a b)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Generic (a, b, c)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c) :: Type -> Type # Methods from :: (a, b, c) -> Rep (a, b, c) x # to :: Rep (a, b, c) x -> (a, b, c) #
Generic (Product f g a)
Instance details Defined in Data.Functor.Product Associated Types type Rep (Product f g a) :: Type -> Type # Methods from :: Product f g a -> Rep (Product f g a) x # to :: Rep (Product f g a) x -> Product f g a #
Generic (Sum f g a)
Instance details Defined in Data.Functor.Sum Associated Types type Rep (Sum f g a) :: Type -> Type # Methods from :: Sum f g a -> Rep (Sum f g a) x # to :: Rep (Sum f g a) x -> Sum f g a #
Generic ((f :*: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :: g) p) :: Type -> Type # Methods from :: (f :: g) p -> Rep ((f :: g) p) x # to :: Rep ((f :: g) p) x -> (f :*: g) p #
Generic ((f :+: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :+: g) p) :: Type -> Type # Methods from :: (f :+: g) p -> Rep ((f :+: g) p) x # to :: Rep ((f :+: g) p) x -> (f :+: g) p #
Generic (K1 i c p)
Instance details Defined in GHC.Generics Associated Types type Rep (K1 i c p) :: Type -> Type # Methods from :: K1 i c p -> Rep (K1 i c p) x # to :: Rep (K1 i c p) x -> K1 i c p #
Generic (a, b, c, d)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d) :: Type -> Type # Methods from :: (a, b, c, d) -> Rep (a, b, c, d) x # to :: Rep (a, b, c, d) x -> (a, b, c, d) #
Generic (Compose f g a)
Instance details Defined in Data.Functor.Compose Associated Types type Rep (Compose f g a) :: Type -> Type # Methods from :: Compose f g a -> Rep (Compose f g a) x # to :: Rep (Compose f g a) x -> Compose f g a #
Generic ((f :.: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :.: g) p) :: Type -> Type # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) x # to :: Rep ((f :.: g) p) x -> (f :.: g) p #
Generic (M1 i c f p)
Instance details Defined in GHC.Generics Associated Types type Rep (M1 i c f p) :: Type -> Type # Methods from :: M1 i c f p -> Rep (M1 i c f p) x # to :: Rep (M1 i c f p) x -> M1 i c f p #
Generic (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Associated Types type Rep (Clown f a b) :: Type -> Type # Methods from :: Clown f a b -> Rep (Clown f a b) x # to :: Rep (Clown f a b) x -> Clown f a b #
Generic (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Associated Types type Rep (Flip p a b) :: Type -> Type # Methods from :: Flip p a b -> Rep (Flip p a b) x # to :: Rep (Flip p a b) x -> Flip p a b #
Generic (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Associated Types type Rep (Joker g a b) :: Type -> Type # Methods from :: Joker g a b -> Rep (Joker g a b) x # to :: Rep (Joker g a b) x -> Joker g a b #
Generic (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Associated Types type Rep (WrappedBifunctor p a b) :: Type -> Type # Methods from :: WrappedBifunctor p a b -> Rep (WrappedBifunctor p a b) x # to :: Rep (WrappedBifunctor p a b) x -> WrappedBifunctor p a b #
Generic (Compose f g x)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Compose f g x) :: Type -> Type # Methods from :: Compose f g x -> Rep (Compose f g x) x0 # to :: Rep (Compose f g x) x0 -> Compose f g x #
Generic (a, b, c, d, e)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e) :: Type -> Type # Methods from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) x # to :: Rep (a, b, c, d, e) x -> (a, b, c, d, e) #
Generic (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Associated Types type Rep (Product f g a b) :: Type -> Type # Methods from :: Product f g a b -> Rep (Product f g a b) x # to :: Rep (Product f g a b) x -> Product f g a b #
Generic (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Associated Types type Rep (Sum p q a b) :: Type -> Type # Methods from :: Sum p q a b -> Rep (Sum p q a b) x # to :: Rep (Sum p q a b) x -> Sum p q a b #
Generic (a, b, c, d, e, f)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f) :: Type -> Type # Methods from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) x # to :: Rep (a, b, c, d, e, f) x -> (a, b, c, d, e, f) #
Generic (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Associated Types type Rep (Tannen f p a b) :: Type -> Type # Methods from :: Tannen f p a b -> Rep (Tannen f p a b) x # to :: Rep (Tannen f p a b) x -> Tannen f p a b #
Generic (a, b, c, d, e, f, g)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) x # to :: Rep (a, b, c, d, e, f, g) x -> (a, b, c, d, e, f, g) #
Generic (a, b, c, d, e, f, g, h)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h) -> Rep (a, b, c, d, e, f, g, h) x # to :: Rep (a, b, c, d, e, f, g, h) x -> (a, b, c, d, e, f, g, h) #
Generic (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Associated Types type Rep (Biff p f g a b) :: Type -> Type # Methods from :: Biff p f g a b -> Rep (Biff p f g a b) x # to :: Rep (Biff p f g a b) x -> Biff p f g a b #
Generic (a, b, c, d, e, f, g, h, i)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i) -> Rep (a, b, c, d, e, f, g, h, i) x # to :: Rep (a, b, c, d, e, f, g, h, i) x -> (a, b, c, d, e, f, g, h, i) #
Generic (a, b, c, d, e, f, g, h, i, j)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j) -> Rep (a, b, c, d, e, f, g, h, i, j) x # to :: Rep (a, b, c, d, e, f, g, h, i, j) x -> (a, b, c, d, e, f, g, h, i, j) #
Generic (a, b, c, d, e, f, g, h, i, j, k)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j, k) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j, k) -> Rep (a, b, c, d, e, f, g, h, i, j, k) x # to :: Rep (a, b, c, d, e, f, g, h, i, j, k) x -> (a, b, c, d, e, f, g, h, i, j, k) #
Generic (a, b, c, d, e, f, g, h, i, j, k, l)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j, k, l) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l) x # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l) x -> (a, b, c, d, e, f, g, h, i, j, k, l) #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j, k, l, m) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m) x # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m) x -> (a, b, c, d, e, f, g, h, i, j, k, l, m) #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n) x # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n) x -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) x # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) x -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Bounded a where #

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.

Methods

minBound :: a #

maxBound :: a #

Instances

Instances details

Bounded CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods minBound :: CabalSpecVersion # maxBound :: CabalSpecVersion #
Bounded PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods minBound :: PWarnType # maxBound :: PWarnType #
Bounded KnownExtension
Instance details Defined in Language.Haskell.Extension Methods minBound :: KnownExtension # maxBound :: KnownExtension #
Bounded All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: All # maxBound :: All #
Bounded Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Any # maxBound :: Any #
Bounded Associativity	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: Associativity # maxBound :: Associativity #
Bounded DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: DecidedStrictness # maxBound :: DecidedStrictness #
Bounded SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceStrictness # maxBound :: SourceStrictness #
Bounded SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceUnpackedness # maxBound :: SourceUnpackedness #
Bounded Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int16 # maxBound :: Int16 #
Bounded Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int32 # maxBound :: Int32 #
Bounded Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int64 # maxBound :: Int64 #
Bounded Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int8 # maxBound :: Int8 #
Bounded GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods minBound :: GeneralCategory # maxBound :: GeneralCategory #
Bounded Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word16 # maxBound :: Word16 #
Bounded Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word32 # maxBound :: Word32 #
Bounded Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word64 # maxBound :: Word64 #
Bounded Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word8 # maxBound :: Word8 #
Bounded Encoding
Instance details Defined in Basement.String Methods minBound :: Encoding # maxBound :: Encoding #
Bounded UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods minBound :: UTF32_Invalid # maxBound :: UTF32_Invalid #
Bounded Bit
Instance details Defined in Data.Bit.Internal Methods minBound :: Bit # maxBound :: Bit #
Bounded Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods minBound :: Extension # maxBound :: Extension #
Bounded Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Ordering # maxBound :: Ordering #
Bounded BlstError
Instance details Defined in Crypto.BLST.Internal.Bindings Methods minBound :: BlstError # maxBound :: BlstError #
Bounded EncodeMethod
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods minBound :: EncodeMethod # maxBound :: EncodeMethod #
Bounded MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods minBound :: MichelinePrimitive # maxBound :: MichelinePrimitive #
Bounded MichelinePrimitiveTag
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods minBound :: MichelinePrimitiveTag # maxBound :: MichelinePrimitiveTag #
Bounded Nesting
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods minBound :: Nesting # maxBound :: Nesting #
Bounded AddressKind
Instance details Defined in Morley.Tezos.Address.Kinds Methods minBound :: AddressKind # maxBound :: AddressKind #
Bounded Mutez
Instance details Defined in Morley.Tezos.Core Methods minBound :: Mutez # maxBound :: Mutez #
Bounded KeyType
Instance details Defined in Morley.Tezos.Crypto Methods minBound :: KeyType # maxBound :: KeyType #
Bounded Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods minBound :: Bls12381Fr # maxBound :: Bls12381Fr #
Bounded TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods minBound :: TLTime # maxBound :: TLTime #
Bounded Word62
Instance details Defined in Morley.Prelude.Word Methods minBound :: Word62 # maxBound :: Word62 #
Bounded Word63
Instance details Defined in Morley.Prelude.Word Methods minBound :: Word63 # maxBound :: Word63 #
Bounded Mod2
Instance details Defined in Data.Semiring Methods minBound :: Mod2 # maxBound :: Mod2 #
Bounded Undefined
Instance details Defined in Universum.Debug Methods minBound :: Undefined # maxBound :: Undefined #
Bounded ()	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: () # maxBound :: () #
Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Bounded Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Char # maxBound :: Char #
Bounded Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Int # maxBound :: Int #
Bounded Levity	Since: base-4.16.0.0
Instance details Defined in GHC.Enum Methods minBound :: Levity # maxBound :: Levity #
Bounded VecCount	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecCount # maxBound :: VecCount #
Bounded VecElem	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecElem # maxBound :: VecElem #
Bounded Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Word # maxBound :: Word #
() :=> (Bounded Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Ordering #
() :=> (Bounded ())
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded () #
() :=> (Bounded Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Bool #
() :=> (Bounded Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Char #
() :=> (Bounded Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Int #
() :=> (Bounded Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Word #
a :=> (Bounded (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Bounded (Dict a) #
Class () (Bounded a)
Instance details Defined in Data.Constraint Methods cls :: Bounded a :- () #
Bounded a => Bounded (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods minBound :: Identity a # maxBound :: Identity a #
Bounded a => Bounded (Down a)	Swaps `minBound` and `maxBound` of the underlying type. Since: base-4.14.0.0
Instance details Defined in Data.Ord Methods minBound :: Down a # maxBound :: Down a #
Bounded a => Bounded (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: First a # maxBound :: First a #
Bounded a => Bounded (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Last a # maxBound :: Last a #
Bounded a => Bounded (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Max a # maxBound :: Max a #
Bounded a => Bounded (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Min a # maxBound :: Min a #
Bounded m => Bounded (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m #
Bounded a => Bounded (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Dual a # maxBound :: Dual a #
Bounded a => Bounded (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Product a # maxBound :: Product a #
Bounded a => Bounded (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Sum a # maxBound :: Sum a #
SizeValid n => Bounded (Bits n)
Instance details Defined in Basement.Bits Methods minBound :: Bits n # maxBound :: Bits n #
a => Bounded (Dict a)
Instance details Defined in Data.Constraint Methods minBound :: Dict a # maxBound :: Dict a #
KnownNat n => Bounded (Finite n)	Throws an error for `Finite 0`
Instance details Defined in Data.Finite.Internal Methods minBound :: Finite n # maxBound :: Finite n #
KnownNat p => Bounded (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods minBound :: Binary p # maxBound :: Binary p #
KnownNat p => Bounded (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods minBound :: Prime p # maxBound :: Prime p #
KnownNat m => Bounded (Mod m)
Instance details Defined in Data.Mod Methods minBound :: Mod m # maxBound :: Mod m #
Bounded a => Bounded (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods minBound :: StringEncode a # maxBound :: StringEncode a #
Bounded a => Bounded (All a)
Instance details Defined in Morley.Prelude.Boolean Methods minBound :: All a # maxBound :: All a #
Bounded a => Bounded (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods minBound :: Any a # maxBound :: Any a #
Bounded a => Bounded (Add a)
Instance details Defined in Data.Semiring Methods minBound :: Add a # maxBound :: Add a #
Bounded a => Bounded (Mul a)
Instance details Defined in Data.Semiring Methods minBound :: Mul a # maxBound :: Mul a #
Bounded a => Bounded (WrappedNum a)
Instance details Defined in Data.Semiring Methods minBound :: WrappedNum a # maxBound :: WrappedNum a #
Bounded a => Bounded (a)
Instance details Defined in GHC.Enum Methods minBound :: (a) # maxBound :: (a) #
(Bounded a) :=> (Bounded (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Bounded a :- Bounded (Const a b) #
(Bounded a) :=> (Bounded (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Bounded a :- Bounded (Identity a) #
(Num a, Bits a, TypeNum n) => Bounded (WrapWord a n)
Instance details Defined in Data.Word.Odd Methods minBound :: WrapWord a n # maxBound :: WrapWord a n #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
(Bounded a, Bounded b) => Bounded (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods minBound :: Pair a b # maxBound :: Pair a b #
(Bounded a, Bounded b) => Bounded (a, b)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b) # maxBound :: (a, b) #
(Bounded a, Bounded b) :=> (Bounded (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Bounded a, Bounded b) :- Bounded (a, b) #
Bounded a => Bounded (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods minBound :: Const a b # maxBound :: Const a b #
(Applicative f, Bounded a) => Bounded (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods minBound :: Ap f a # maxBound :: Ap f a #
a ~ b => Bounded (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~: b # maxBound :: a :~: b #
Bounded b => Bounded (Tagged s b)
Instance details Defined in Data.Tagged Methods minBound :: Tagged s b # maxBound :: Tagged s b #
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c) # maxBound :: (a, b, c) #
a ~~ b => Bounded (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~~: b # maxBound :: a :~~: b #
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d) # maxBound :: (a, b, c, d) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e) # maxBound :: (a, b, c, d, e) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f) # maxBound :: (a, b, c, d, e, f) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g) # maxBound :: (a, b, c, d, e, f, g) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h) # maxBound :: (a, b, c, d, e, f, g, h) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i) # maxBound :: (a, b, c, d, e, f, g, h, i) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j) # maxBound :: (a, b, c, d, e, f, g, h, i, j) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Eq a #

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:

Reflexivity: x == x = True
Symmetry: x == y = y == x
Transitivity: if x == y && y == z = True, then x == z = True
Extensionality: if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
Negation: x /= y = not (x == y)

Minimal complete definition: either == or /=.

Minimal complete definition

(==) | (/=)

Instances

Instances details

Eq CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (/=) :: CabalSpecVersion -> CabalSpecVersion -> Bool #
Eq HasCommonStanzas
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: HasCommonStanzas -> HasCommonStanzas -> Bool # (/=) :: HasCommonStanzas -> HasCommonStanzas -> Bool #
Eq HasElif
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: HasElif -> HasElif -> Bool # (/=) :: HasElif -> HasElif -> Bool #
Eq Position
Instance details Defined in Distribution.Parsec.Position Methods (==) :: Position -> Position -> Bool # (/=) :: Position -> Position -> Bool #
Eq PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods (==) :: PWarnType -> PWarnType -> Bool # (/=) :: PWarnType -> PWarnType -> Bool #
Eq Structure
Instance details Defined in Distribution.Utils.Structured Methods (==) :: Structure -> Structure -> Bool # (/=) :: Structure -> Structure -> Bool #
Eq Extension
Instance details Defined in Language.Haskell.Extension Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Eq KnownExtension
Instance details Defined in Language.Haskell.Extension Methods (==) :: KnownExtension -> KnownExtension -> Bool # (/=) :: KnownExtension -> KnownExtension -> Bool #
Eq Language
Instance details Defined in Language.Haskell.Extension Methods (==) :: Language -> Language -> Bool # (/=) :: Language -> Language -> Bool #
Eq Key
Instance details Defined in Data.Aeson.Key Methods (==) :: Key -> Key -> Bool # (/=) :: Key -> Key -> Bool #
Eq DotNetTime
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: DotNetTime -> DotNetTime -> Bool # (/=) :: DotNetTime -> DotNetTime -> Bool #
Eq JSONPathElement
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool # (/=) :: JSONPathElement -> JSONPathElement -> Bool #
Eq SumEncoding
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: SumEncoding -> SumEncoding -> Bool # (/=) :: SumEncoding -> SumEncoding -> Bool #
Eq Value
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Value -> Value -> Bool # (/=) :: Value -> Value -> Bool #
Eq More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: More -> More -> Bool # (/=) :: More -> More -> Bool #
Eq Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq ByteArray	Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (==) :: ByteArray -> ByteArray -> Bool # (/=) :: ByteArray -> ByteArray -> Bool #
Eq Constr	Equality of constructors Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: Constr -> Constr -> Bool # (/=) :: Constr -> Constr -> Bool #
Eq ConstrRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: ConstrRep -> ConstrRep -> Bool # (/=) :: ConstrRep -> ConstrRep -> Bool #
Eq DataRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: DataRep -> DataRep -> Bool # (/=) :: DataRep -> DataRep -> Bool #
Eq Fixity	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: All -> All -> Bool # (/=) :: All -> All -> Bool #
Eq Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Any -> Any -> Bool # (/=) :: Any -> Any -> Bool #
Eq SomeTypeRep
Instance details Defined in Data.Typeable.Internal Methods (==) :: SomeTypeRep -> SomeTypeRep -> Bool # (/=) :: SomeTypeRep -> SomeTypeRep -> Bool #
Eq Version	Since: base-2.1
Instance details Defined in Data.Version Methods (==) :: Version -> Version -> Bool # (/=) :: Version -> Version -> Bool #
Eq Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods (==) :: Void -> Void -> Bool # (/=) :: Void -> Void -> Bool #
Eq BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: BlockReason -> BlockReason -> Bool # (/=) :: BlockReason -> BlockReason -> Bool #
Eq ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadId -> ThreadId -> Bool # (/=) :: ThreadId -> ThreadId -> Bool #
Eq ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadStatus -> ThreadStatus -> Bool # (/=) :: ThreadStatus -> ThreadStatus -> Bool #
Eq ErrorCall	Since: base-4.7.0.0
Instance details Defined in GHC.Exception Methods (==) :: ErrorCall -> ErrorCall -> Bool # (/=) :: ErrorCall -> ErrorCall -> Bool #
Eq ArithException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool #
Eq Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool #
Eq DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods (==) :: MaskingState -> MaskingState -> Bool # (/=) :: MaskingState -> MaskingState -> Bool #
Eq ArrayException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool #
Eq AsyncException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool #
Eq ExitCode
Instance details Defined in GHC.IO.Exception Methods (==) :: ExitCode -> ExitCode -> Bool # (/=) :: ExitCode -> ExitCode -> Bool #
Eq IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOErrorType -> IOErrorType -> Bool # (/=) :: IOErrorType -> IOErrorType -> Bool #
Eq IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOException -> IOException -> Bool # (/=) :: IOException -> IOException -> Bool #
Eq BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: BufferMode -> BufferMode -> Bool # (/=) :: BufferMode -> BufferMode -> Bool #
Eq Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Handle -> Handle -> Bool # (/=) :: Handle -> Handle -> Bool #
Eq Newline	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Newline -> Newline -> Bool # (/=) :: Newline -> Newline -> Bool #
Eq NewlineMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: NewlineMode -> NewlineMode -> Bool # (/=) :: NewlineMode -> NewlineMode -> Bool #
Eq IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods (==) :: IOMode -> IOMode -> Bool # (/=) :: IOMode -> IOMode -> Bool #
Eq Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int16 -> Int16 -> Bool # (/=) :: Int16 -> Int16 -> Bool #
Eq Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int32 -> Int32 -> Bool # (/=) :: Int32 -> Int32 -> Bool #
Eq Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int64 -> Int64 -> Bool # (/=) :: Int64 -> Int64 -> Bool #
Eq Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int8 -> Int8 -> Bool # (/=) :: Int8 -> Int8 -> Bool #
Eq IoSubSystem
Instance details Defined in GHC.RTS.Flags Methods (==) :: IoSubSystem -> IoSubSystem -> Bool # (/=) :: IoSubSystem -> IoSubSystem -> Bool #
Eq SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Stack.Types Methods (==) :: SrcLoc -> SrcLoc -> Bool # (/=) :: SrcLoc -> SrcLoc -> Bool #
Eq SomeChar
Instance details Defined in GHC.TypeLits Methods (==) :: SomeChar -> SomeChar -> Bool # (/=) :: SomeChar -> SomeChar -> Bool #
Eq SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods (==) :: SomeSymbol -> SomeSymbol -> Bool # (/=) :: SomeSymbol -> SomeSymbol -> Bool #
Eq SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods (==) :: SomeNat -> SomeNat -> Bool # (/=) :: SomeNat -> SomeNat -> Bool #
Eq GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool #
Eq Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word16 -> Word16 -> Bool # (/=) :: Word16 -> Word16 -> Bool #
Eq Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word32 -> Word32 -> Bool # (/=) :: Word32 -> Word32 -> Bool #
Eq Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word64 -> Word64 -> Bool # (/=) :: Word64 -> Word64 -> Bool #
Eq Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word8 -> Word8 -> Bool # (/=) :: Word8 -> Word8 -> Bool #
Eq Lexeme	Since: base-2.1
Instance details Defined in Text.Read.Lex Methods (==) :: Lexeme -> Lexeme -> Bool # (/=) :: Lexeme -> Lexeme -> Bool #
Eq Number	Since: base-4.6.0.0
Instance details Defined in Text.Read.Lex Methods (==) :: Number -> Number -> Bool # (/=) :: Number -> Number -> Bool #
Eq Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods (==) :: Alphabet -> Alphabet -> Bool # (/=) :: Alphabet -> Alphabet -> Bool #
Eq Encoding
Instance details Defined in Basement.String Methods (==) :: Encoding -> Encoding -> Bool # (/=) :: Encoding -> Encoding -> Bool #
Eq ASCII7_Invalid
Instance details Defined in Basement.String.Encoding.ASCII7 Methods (==) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool # (/=) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #
Eq ISO_8859_1_Invalid
Instance details Defined in Basement.String.Encoding.ISO_8859_1 Methods (==) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool # (/=) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #
Eq UTF16_Invalid
Instance details Defined in Basement.String.Encoding.UTF16 Methods (==) :: UTF16_Invalid -> UTF16_Invalid -> Bool # (/=) :: UTF16_Invalid -> UTF16_Invalid -> Bool #
Eq UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods (==) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (/=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #
Eq AsciiString
Instance details Defined in Basement.Types.AsciiString Methods (==) :: AsciiString -> AsciiString -> Bool # (/=) :: AsciiString -> AsciiString -> Bool #
Eq Char7
Instance details Defined in Basement.Types.Char7 Methods (==) :: Char7 -> Char7 -> Bool # (/=) :: Char7 -> Char7 -> Bool #
Eq FileSize
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: FileSize -> FileSize -> Bool # (/=) :: FileSize -> FileSize -> Bool #
Eq String
Instance details Defined in Basement.UTF8.Base Methods (==) :: String -> String -> Bool # (/=) :: String -> String -> Bool #
Eq BimapException
Instance details Defined in Data.Bimap Methods (==) :: BimapException -> BimapException -> Bool # (/=) :: BimapException -> BimapException -> Bool #
Eq F2Poly
Instance details Defined in Data.Bit.F2Poly Methods (==) :: F2Poly -> F2Poly -> Bool # (/=) :: F2Poly -> F2Poly -> Bool #
Eq Bit
Instance details Defined in Data.Bit.Internal Methods (==) :: Bit -> Bit -> Bool # (/=) :: Bit -> Bit -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods (==) :: ShortByteString -> ShortByteString -> Bool # (/=) :: ShortByteString -> ShortByteString -> Bool #
Eq IntSet
Instance details Defined in Data.IntSet.Internal Methods (==) :: IntSet -> IntSet -> Bool # (/=) :: IntSet -> IntSet -> Bool #
Eq CryptoError
Instance details Defined in Crypto.Error.Types Methods (==) :: CryptoError -> CryptoError -> Bool # (/=) :: CryptoError -> CryptoError -> Bool #
Eq BigNat
Instance details Defined in GHC.Num.BigNat Methods (==) :: BigNat -> BigNat -> Bool # (/=) :: BigNat -> BigNat -> Bool #
Eq ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #
Eq Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Eq Module
Instance details Defined in GHC.Classes Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq Ordering
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool # (/=) :: Ordering -> Ordering -> Bool #
Eq TrName
Instance details Defined in GHC.Classes Methods (==) :: TrName -> TrName -> Bool # (/=) :: TrName -> TrName -> Bool #
Eq TyCon
Instance details Defined in GHC.Classes Methods (==) :: TyCon -> TyCon -> Bool # (/=) :: TyCon -> TyCon -> Bool #
Eq BlstError
Instance details Defined in Crypto.BLST.Internal.Bindings Methods (==) :: BlstError -> BlstError -> Bool # (/=) :: BlstError -> BlstError -> Bool #
Eq EncodeMethod
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods (==) :: EncodeMethod -> EncodeMethod -> Bool # (/=) :: EncodeMethod -> EncodeMethod -> Bool #
Eq Scalar
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods (==) :: Scalar -> Scalar -> Bool # (/=) :: Scalar -> Scalar -> Bool #
Eq SecretKey
Instance details Defined in Crypto.BLST.Internal.Types Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods (==) :: DefName -> DefName -> Bool # (/=) :: DefName -> DefName -> Bool #
Eq DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (/=) :: DHashAlgorithm -> DHashAlgorithm -> Bool #
Eq NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods (==) :: NRational -> NRational -> Bool # (/=) :: NRational -> NRational -> Bool #
Eq Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods (==) :: Rational -> Rational -> Bool # (/=) :: Rational -> Rational -> Bool #
Eq DViewDesc Source #
Instance details Defined in Lorentz.Doc Methods (==) :: DViewDesc -> DViewDesc -> Bool # (/=) :: DViewDesc -> DViewDesc -> Bool #
Eq EpCallingStep Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods (==) :: EpCallingStep -> EpCallingStep -> Bool # (/=) :: EpCallingStep -> EpCallingStep -> Bool #
Eq DError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DError -> DError -> Bool # (/=) :: DError -> DError -> Bool #
Eq DThrows Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DThrows -> DThrows -> Bool # (/=) :: DThrows -> DThrows -> Bool #
Eq SomeError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: SomeError -> SomeError -> Bool # (/=) :: SomeError -> SomeError -> Bool #
Eq DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods (==) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (/=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool #
Eq ExtConversionError Source #
Instance details Defined in Lorentz.Extensible Methods (==) :: ExtConversionError -> ExtConversionError -> Bool # (/=) :: ExtConversionError -> ExtConversionError -> Bool #
Eq EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods (==) :: EntrypointLookupError -> EntrypointLookupError -> Bool # (/=) :: EntrypointLookupError -> EntrypointLookupError -> Bool #
Eq Never Source #
Instance details Defined in Lorentz.Value Methods (==) :: Never -> Never -> Bool # (/=) :: Never -> Never -> Bool #
Eq OpenChest Source #
Instance details Defined in Lorentz.Value Methods (==) :: OpenChest -> OpenChest -> Bool # (/=) :: OpenChest -> OpenChest -> Bool #
Eq ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods (==) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool # (/=) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool #
Eq ZSNil Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZSNil -> ZSNil -> Bool # (/=) :: ZSNil -> ZSNil -> Bool #
Eq InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: InvalidPosException -> InvalidPosException -> Bool # (/=) :: InvalidPosException -> InvalidPosException -> Bool #
Eq Pos
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: SourcePos -> SourcePos -> Bool # (/=) :: SourcePos -> SourcePos -> Bool #
Eq FromExpErrorReason
Instance details Defined in Morley.Micheline.Class Methods (==) :: FromExpErrorReason -> FromExpErrorReason -> Bool # (/=) :: FromExpErrorReason -> FromExpErrorReason -> Bool #
Eq Annotation
Instance details Defined in Morley.Micheline.Expression Methods (==) :: Annotation -> Annotation -> Bool # (/=) :: Annotation -> Annotation -> Bool #
Eq MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods (==) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (/=) :: MichelinePrimitive -> MichelinePrimitive -> Bool #
Eq MichelinePrimitiveTag
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods (==) :: MichelinePrimitiveTag -> MichelinePrimitiveTag -> Bool # (/=) :: MichelinePrimitiveTag -> MichelinePrimitiveTag -> Bool #
Eq TezosMutez
Instance details Defined in Morley.Micheline.Json Methods (==) :: TezosMutez -> TezosMutez -> Bool # (/=) :: TezosMutez -> TezosMutez -> Bool #
Eq AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods (==) :: AnalyzerRes -> AnalyzerRes -> Bool # (/=) :: AnalyzerRes -> AnalyzerRes -> Bool #
Eq DocItemId
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemId -> DocItemId -> Bool # (/=) :: DocItemId -> DocItemId -> Bool #
Eq DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemPos -> DocItemPos -> Bool # (/=) :: DocItemPos -> DocItemPos -> Bool #
Eq SomeDocDefinitionItem
Instance details Defined in Morley.Michelson.Doc Methods (==) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (/=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool #
Eq ErrorSrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: ErrorSrcPos -> ErrorSrcPos -> Bool # (/=) :: ErrorSrcPos -> ErrorSrcPos -> Bool #
Eq Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: SrcPos -> SrcPos -> Bool # (/=) :: SrcPos -> SrcPos -> Bool #
Eq BadViewNameError
Instance details Defined in Morley.Michelson.Internal.ViewName Methods (==) :: BadViewNameError -> BadViewNameError -> Bool # (/=) :: BadViewNameError -> BadViewNameError -> Bool #
Eq ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods (==) :: ViewName -> ViewName -> Bool # (/=) :: ViewName -> ViewName -> Bool #
Eq ViewsSetError
Instance details Defined in Morley.Michelson.Internal.ViewsSet Methods (==) :: ViewsSetError -> ViewsSetError -> Bool # (/=) :: ViewsSetError -> ViewsSetError -> Bool #
Eq MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MorleyLogs -> MorleyLogs -> Bool # (/=) :: MorleyLogs -> MorleyLogs -> Bool #
Eq RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: RemainingSteps -> RemainingSteps -> Bool # (/=) :: RemainingSteps -> RemainingSteps -> Bool #
Eq CadrStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: CadrStruct -> CadrStruct -> Bool # (/=) :: CadrStruct -> CadrStruct -> Bool #
Eq Macro
Instance details Defined in Morley.Michelson.Macro Methods (==) :: Macro -> Macro -> Bool # (/=) :: Macro -> Macro -> Bool #
Eq PairStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: PairStruct -> PairStruct -> Bool # (/=) :: PairStruct -> PairStruct -> Bool #
Eq ParsedOp
Instance details Defined in Morley.Michelson.Macro Methods (==) :: ParsedOp -> ParsedOp -> Bool # (/=) :: ParsedOp -> ParsedOp -> Bool #
Eq UnpairStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: UnpairStruct -> UnpairStruct -> Bool # (/=) :: UnpairStruct -> UnpairStruct -> Bool #
Eq OptimizationStage
Instance details Defined in Morley.Michelson.Optimizer.Internal.Ruleset Methods (==) :: OptimizationStage -> OptimizationStage -> Bool # (/=) :: OptimizationStage -> OptimizationStage -> Bool #
Eq CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: CustomParserException -> CustomParserException -> Bool # (/=) :: CustomParserException -> CustomParserException -> Bool #
Eq ParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: ParserException -> ParserException -> Bool # (/=) :: ParserException -> ParserException -> Bool #
Eq StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (/=) :: StringLiteralParserException -> StringLiteralParserException -> Bool #
Eq MichelsonSource
Instance details Defined in Morley.Michelson.Parser.Types Methods (==) :: MichelsonSource -> MichelsonSource -> Bool # (/=) :: MichelsonSource -> MichelsonSource -> Bool #
Eq ParserOptions
Instance details Defined in Morley.Michelson.Parser.Types Methods (==) :: ParserOptions -> ParserOptions -> Bool # (/=) :: ParserOptions -> ParserOptions -> Bool #
Eq BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: BigMapCounter -> BigMapCounter -> Bool # (/=) :: BigMapCounter -> BigMapCounter -> Bool #
Eq ContractState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: ContractState -> ContractState -> Bool # (/=) :: ContractState -> ContractState -> Bool #
Eq GState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: GState -> GState -> Bool # (/=) :: GState -> GState -> Bool #
Eq ImplicitState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: ImplicitState -> ImplicitState -> Bool # (/=) :: ImplicitState -> ImplicitState -> Bool #
Eq TicketKey
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: TicketKey -> TicketKey -> Bool # (/=) :: TicketKey -> TicketKey -> Bool #
Eq VotingPowers
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: VotingPowers -> VotingPowers -> Bool # (/=) :: VotingPowers -> VotingPowers -> Bool #
Eq MText
Instance details Defined in Morley.Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Eq ExtError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: ExtError -> ExtError -> Bool # (/=) :: ExtError -> ExtError -> Bool #
Eq StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: StackSize -> StackSize -> Bool # (/=) :: StackSize -> StackSize -> Bool #
Eq TcTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TcTypeError -> TcTypeError -> Bool # (/=) :: TcTypeError -> TcTypeError -> Bool #
Eq TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TopLevelType -> TopLevelType -> Bool # (/=) :: TopLevelType -> TopLevelType -> Bool #
Eq TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TypeContext -> TypeContext -> Bool # (/=) :: TypeContext -> TypeContext -> Bool #
Eq SomeParamType
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods (==) :: SomeParamType -> SomeParamType -> Bool # (/=) :: SomeParamType -> SomeParamType -> Bool #
Eq Nesting
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: Nesting -> Nesting -> Bool # (/=) :: Nesting -> Nesting -> Bool #
Eq SomeSingInstr
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: SomeSingInstr -> SomeSingInstr -> Bool # (/=) :: SomeSingInstr -> SomeSingInstr -> Bool #
Eq SomeHST
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods (==) :: SomeHST -> SomeHST -> Bool # (/=) :: SomeHST -> SomeHST -> Bool #
Eq SomeAnnotatedValue
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods (==) :: SomeAnnotatedValue -> SomeAnnotatedValue -> Bool # (/=) :: SomeAnnotatedValue -> SomeAnnotatedValue -> Bool #
Eq MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (/=) :: MutezArithErrorType -> MutezArithErrorType -> Bool #
Eq ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (/=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool #
Eq UntypingOptions
Instance details Defined in Morley.Michelson.Typed.Convert Methods (==) :: UntypingOptions -> UntypingOptions -> Bool # (/=) :: UntypingOptions -> UntypingOptions -> Bool #
Eq ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ArmCoord -> ArmCoord -> Bool # (/=) :: ArmCoord -> ArmCoord -> Bool #
Eq EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Eq ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParamEpError -> ParamEpError -> Bool # (/=) :: ParamEpError -> ParamEpError -> Bool #
Eq ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParseEpAddressError -> ParseEpAddressError -> Bool # (/=) :: ParseEpAddressError -> ParseEpAddressError -> Bool #
Eq DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods (==) :: DStorageType -> DStorageType -> Bool # (/=) :: DStorageType -> DStorageType -> Bool #
Eq DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Eq OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods (==) :: OperationHash -> OperationHash -> Bool # (/=) :: OperationHash -> OperationHash -> Bool #
Eq BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.WellTyped Methods (==) :: BadTypeForScope -> BadTypeForScope -> Bool # (/=) :: BadTypeForScope -> BadTypeForScope -> Bool #
Eq T
Instance details Defined in Morley.Michelson.Typed.T Methods (==) :: T -> T -> Bool # (/=) :: T -> T -> Bool #
Eq SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: SetDelegate -> SetDelegate -> Bool # (/=) :: SetDelegate -> SetDelegate -> Bool #
Eq AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (==) :: AnnotationSet -> AnnotationSet -> Bool # (/=) :: AnnotationSet -> AnnotationSet -> Bool #
Eq AnyAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (==) :: AnyAnn -> AnyAnn -> Bool # (/=) :: AnyAnn -> AnyAnn -> Bool #
Eq ContractBlockError
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: ContractBlockError -> ContractBlockError -> Bool # (/=) :: ContractBlockError -> ContractBlockError -> Bool #
Eq EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: EntriesOrder -> EntriesOrder -> Bool # (/=) :: EntriesOrder -> EntriesOrder -> Bool #
Eq Entry
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: Entry -> Entry -> Bool # (/=) :: Entry -> Entry -> Bool #
Eq EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Eq EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpNameFromRefAnnError -> EpNameFromRefAnnError -> Bool # (/=) :: EpNameFromRefAnnError -> EpNameFromRefAnnError -> Bool #
Eq HandleImplicitDefaultEp
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool # (/=) :: HandleImplicitDefaultEp -> HandleImplicitDefaultEp -> Bool #
Eq PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: PrintComment -> PrintComment -> Bool # (/=) :: PrintComment -> PrintComment -> Bool #
Eq StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: StackRef -> StackRef -> Bool # (/=) :: StackRef -> StackRef -> Bool #
Eq StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: StackTypePattern -> StackTypePattern -> Bool # (/=) :: StackTypePattern -> StackTypePattern -> Bool #
Eq TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: TyVar -> TyVar -> Bool # (/=) :: TyVar -> TyVar -> Bool #
Eq Var
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: Var -> Var -> Bool # (/=) :: Var -> Var -> Bool #
Eq ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Methods (==) :: ExpandedOp -> ExpandedOp -> Bool # (/=) :: ExpandedOp -> ExpandedOp -> Bool #
Eq ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: ParameterType -> ParameterType -> Bool # (/=) :: ParameterType -> ParameterType -> Bool #
Eq T
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: T -> T -> Bool # (/=) :: T -> T -> Bool #
Eq Ty
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: Ty -> Ty -> Bool # (/=) :: Ty -> Ty -> Bool #
Eq InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: InternalByteString -> InternalByteString -> Bool # (/=) :: InternalByteString -> InternalByteString -> Bool #
Eq GlobalCounter
Instance details Defined in Morley.Tezos.Address Methods (==) :: GlobalCounter -> GlobalCounter -> Bool # (/=) :: GlobalCounter -> GlobalCounter -> Bool #
Eq ParseAddressError
Instance details Defined in Morley.Tezos.Address Methods (==) :: ParseAddressError -> ParseAddressError -> Bool # (/=) :: ParseAddressError -> ParseAddressError -> Bool #
Eq ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Methods (==) :: ParseAddressRawError -> ParseAddressRawError -> Bool # (/=) :: ParseAddressRawError -> ParseAddressRawError -> Bool #
Eq AddressKind
Instance details Defined in Morley.Tezos.Address.Kinds Methods (==) :: AddressKind -> AddressKind -> Bool # (/=) :: AddressKind -> AddressKind -> Bool #
Eq ChainId
Instance details Defined in Morley.Tezos.Core Methods (==) :: ChainId -> ChainId -> Bool # (/=) :: ChainId -> ChainId -> Bool #
Eq Mutez
Instance details Defined in Morley.Tezos.Core Methods (==) :: Mutez -> Mutez -> Bool # (/=) :: Mutez -> Mutez -> Bool #
Eq ParseChainIdError
Instance details Defined in Morley.Tezos.Core Methods (==) :: ParseChainIdError -> ParseChainIdError -> Bool # (/=) :: ParseChainIdError -> ParseChainIdError -> Bool #
Eq Timestamp
Instance details Defined in Morley.Tezos.Core Methods (==) :: Timestamp -> Timestamp -> Bool # (/=) :: Timestamp -> Timestamp -> Bool #
Eq KeyType
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: KeyType -> KeyType -> Bool # (/=) :: KeyType -> KeyType -> Bool #
Eq ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: ParseSignatureRawError -> ParseSignatureRawError -> Bool # (/=) :: ParseSignatureRawError -> ParseSignatureRawError -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.BLS Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.BLS Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.BLS Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381Fr -> Bls12381Fr -> Bool # (/=) :: Bls12381Fr -> Bls12381Fr -> Bool #
Eq Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G1 -> Bls12381G1 -> Bool # (/=) :: Bls12381G1 -> Bls12381G1 -> Bool #
Eq Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G2 -> Bls12381G2 -> Bool # (/=) :: Bls12381G2 -> Bls12381G2 -> Bool #
Eq DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: DeserializationError -> DeserializationError -> Bool # (/=) :: DeserializationError -> DeserializationError -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Chest -> Chest -> Bool # (/=) :: Chest -> Chest -> Bool #
Eq ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: ChestKey -> ChestKey -> Bool # (/=) :: ChestKey -> ChestKey -> Bool #
Eq Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Ciphertext -> Ciphertext -> Bool # (/=) :: Ciphertext -> Ciphertext -> Bool #
Eq Locked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Locked -> Locked -> Bool # (/=) :: Locked -> Locked -> Bool #
Eq Nonce
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Nonce -> Nonce -> Bool # (/=) :: Nonce -> Nonce -> Bool #
Eq OpeningResult
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: OpeningResult -> OpeningResult -> Bool # (/=) :: OpeningResult -> OpeningResult -> Bool #
Eq Proof
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Proof -> Proof -> Bool # (/=) :: Proof -> Proof -> Bool #
Eq PublicModulus
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: PublicModulus -> PublicModulus -> Bool # (/=) :: PublicModulus -> PublicModulus -> Bool #
Eq TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: TLTime -> TLTime -> Bool # (/=) :: TLTime -> TLTime -> Bool #
Eq Unlocked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Unlocked -> Unlocked -> Bool # (/=) :: Unlocked -> Unlocked -> Bool #
Eq CryptoParseError
Instance details Defined in Morley.Tezos.Crypto.Util Methods (==) :: CryptoParseError -> CryptoParseError -> Bool # (/=) :: CryptoParseError -> CryptoParseError -> Bool #
Eq UnpackError
Instance details Defined in Morley.Util.Binary Methods (==) :: UnpackError -> UnpackError -> Bool # (/=) :: UnpackError -> UnpackError -> Bool #
Eq HexJSONByteString
Instance details Defined in Morley.Util.ByteString Methods (==) :: HexJSONByteString -> HexJSONByteString -> Bool # (/=) :: HexJSONByteString -> HexJSONByteString -> Bool #
Eq Word62
Instance details Defined in Morley.Prelude.Word Methods (==) :: Word62 -> Word62 -> Bool # (/=) :: Word62 -> Word62 -> Bool #
Eq Word63
Instance details Defined in Morley.Prelude.Word Methods (==) :: Word63 -> Word63 -> Bool # (/=) :: Word63 -> Word63 -> Bool #
Eq AltNodeType
Instance details Defined in Options.Applicative.Types Methods (==) :: AltNodeType -> AltNodeType -> Bool # (/=) :: AltNodeType -> AltNodeType -> Bool #
Eq ArgPolicy
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgPolicy -> ArgPolicy -> Bool # (/=) :: ArgPolicy -> ArgPolicy -> Bool #
Eq ArgumentReachability
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgumentReachability -> ArgumentReachability -> Bool # (/=) :: ArgumentReachability -> ArgumentReachability -> Bool #
Eq Backtracking
Instance details Defined in Options.Applicative.Types Methods (==) :: Backtracking -> Backtracking -> Bool # (/=) :: Backtracking -> Backtracking -> Bool #
Eq OptName
Instance details Defined in Options.Applicative.Types Methods (==) :: OptName -> OptName -> Bool # (/=) :: OptName -> OptName -> Bool #
Eq OptVisibility
Instance details Defined in Options.Applicative.Types Methods (==) :: OptVisibility -> OptVisibility -> Bool # (/=) :: OptVisibility -> OptVisibility -> Bool #
Eq ParserPrefs
Instance details Defined in Options.Applicative.Types Methods (==) :: ParserPrefs -> ParserPrefs -> Bool # (/=) :: ParserPrefs -> ParserPrefs -> Bool #
Eq Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Mode -> Mode -> Bool # (/=) :: Mode -> Mode -> Bool #
Eq Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Style -> Style -> Bool # (/=) :: Style -> Style -> Bool #
Eq TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: TextDetails -> TextDetails -> Bool # (/=) :: TextDetails -> TextDetails -> Bool #
Eq Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (==) :: Doc -> Doc -> Bool # (/=) :: Doc -> Doc -> Bool #
Eq FusionDepth
Instance details Defined in Prettyprinter.Internal Methods (==) :: FusionDepth -> FusionDepth -> Bool # (/=) :: FusionDepth -> FusionDepth -> Bool #
Eq LayoutOptions
Instance details Defined in Prettyprinter.Internal Methods (==) :: LayoutOptions -> LayoutOptions -> Bool # (/=) :: LayoutOptions -> LayoutOptions -> Bool #
Eq PageWidth
Instance details Defined in Prettyprinter.Internal Methods (==) :: PageWidth -> PageWidth -> Bool # (/=) :: PageWidth -> PageWidth -> Bool #
Eq ByteArray	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods (==) :: ByteArray -> ByteArray -> Bool # (/=) :: ByteArray -> ByteArray -> Bool #
Eq StdGen
Instance details Defined in System.Random.Internal Methods (==) :: StdGen -> StdGen -> Bool # (/=) :: StdGen -> StdGen -> Bool #
Eq Scientific	Scientific numbers can be safely compared for equality. No magnitude `10^e` is calculated so there's no risk of a blowup in space or time when comparing scientific numbers coming from untrusted sources.
Instance details Defined in Data.Scientific Methods (==) :: Scientific -> Scientific -> Bool # (/=) :: Scientific -> Scientific -> Bool #
Eq Mod2
Instance details Defined in Data.Semiring Methods (==) :: Mod2 -> Mod2 -> Bool # (/=) :: Mod2 -> Mod2 -> Bool #
Eq DependencyType
Instance details Defined in Test.Tasty.Core Methods (==) :: DependencyType -> DependencyType -> Bool # (/=) :: DependencyType -> DependencyType -> Bool #
Eq Expr
Instance details Defined in Test.Tasty.Patterns.Types Methods (==) :: Expr -> Expr -> Bool # (/=) :: Expr -> Expr -> Bool #
Eq AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnLookup -> AnnLookup -> Bool # (/=) :: AnnLookup -> AnnLookup -> Bool #
Eq AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnTarget -> AnnTarget -> Bool # (/=) :: AnnTarget -> AnnTarget -> Bool #
Eq Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bang -> Bang -> Bool # (/=) :: Bang -> Bang -> Bool #
Eq Body
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Body -> Body -> Bool # (/=) :: Body -> Body -> Bool #
Eq Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bytes -> Bytes -> Bool # (/=) :: Bytes -> Bytes -> Bool #
Eq Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Callconv -> Callconv -> Bool # (/=) :: Callconv -> Callconv -> Bool #
Eq Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Clause -> Clause -> Bool # (/=) :: Clause -> Clause -> Bool #
Eq Con
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Con -> Con -> Bool # (/=) :: Con -> Con -> Bool #
Eq Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Dec -> Dec -> Bool # (/=) :: Dec -> Dec -> Bool #
Eq DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivClause -> DerivClause -> Bool # (/=) :: DerivClause -> DerivClause -> Bool #
Eq DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool # (/=) :: DerivStrategy -> DerivStrategy -> Bool #
Eq DocLoc
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DocLoc -> DocLoc -> Bool # (/=) :: DocLoc -> DocLoc -> Bool #
Eq Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Exp -> Exp -> Bool # (/=) :: Exp -> Exp -> Bool #
Eq FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool #
Eq Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool # (/=) :: FixityDirection -> FixityDirection -> Bool #
Eq Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Foreign -> Foreign -> Bool # (/=) :: Foreign -> Foreign -> Bool #
Eq FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FunDep -> FunDep -> Bool # (/=) :: FunDep -> FunDep -> Bool #
Eq Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Guard -> Guard -> Bool # (/=) :: Guard -> Guard -> Bool #
Eq Info
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Info -> Info -> Bool # (/=) :: Info -> Info -> Bool #
Eq InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool #
Eq Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Inline -> Inline -> Bool # (/=) :: Inline -> Inline -> Bool #
Eq Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Lit -> Lit -> Bool # (/=) :: Lit -> Lit -> Bool #
Eq Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Loc -> Loc -> Bool # (/=) :: Loc -> Loc -> Bool #
Eq Match
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Match -> Match -> Bool # (/=) :: Match -> Match -> Bool #
Eq ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModName -> ModName -> Bool # (/=) :: ModName -> ModName -> Bool #
Eq Module
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModuleInfo -> ModuleInfo -> Bool # (/=) :: ModuleInfo -> ModuleInfo -> Bool #
Eq Name
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Eq NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameFlavour -> NameFlavour -> Bool # (/=) :: NameFlavour -> NameFlavour -> Bool #
Eq NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameSpace -> NameSpace -> Bool # (/=) :: NameSpace -> NameSpace -> Bool #
Eq OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: OccName -> OccName -> Bool # (/=) :: OccName -> OccName -> Bool #
Eq Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Overlap -> Overlap -> Bool # (/=) :: Overlap -> Overlap -> Bool #
Eq Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pat -> Pat -> Bool # (/=) :: Pat -> Pat -> Bool #
Eq PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynArgs -> PatSynArgs -> Bool # (/=) :: PatSynArgs -> PatSynArgs -> Bool #
Eq PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynDir -> PatSynDir -> Bool # (/=) :: PatSynDir -> PatSynDir -> Bool #
Eq Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Phases -> Phases -> Bool # (/=) :: Phases -> Phases -> Bool #
Eq PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PkgName -> PkgName -> Bool # (/=) :: PkgName -> PkgName -> Bool #
Eq Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pragma -> Pragma -> Bool # (/=) :: Pragma -> Pragma -> Bool #
Eq Range
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Range -> Range -> Bool # (/=) :: Range -> Range -> Bool #
Eq Role
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Role -> Role -> Bool # (/=) :: Role -> Role -> Bool #
Eq RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleBndr -> RuleBndr -> Bool # (/=) :: RuleBndr -> RuleBndr -> Bool #
Eq RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleMatch -> RuleMatch -> Bool # (/=) :: RuleMatch -> RuleMatch -> Bool #
Eq Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Safety -> Safety -> Bool # (/=) :: Safety -> Safety -> Bool #
Eq SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq Specificity
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Specificity -> Specificity -> Bool # (/=) :: Specificity -> Specificity -> Bool #
Eq Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Stmt -> Stmt -> Bool # (/=) :: Stmt -> Stmt -> Bool #
Eq TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyLit -> TyLit -> Bool # (/=) :: TyLit -> TyLit -> Bool #
Eq TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TySynEqn -> TySynEqn -> Bool # (/=) :: TySynEqn -> TySynEqn -> Bool #
Eq Type
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Type -> Type -> Bool # (/=) :: Type -> Type -> Bool #
Eq TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #
Eq UnicodeException
Instance details Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool #
Eq Builder
Instance details Defined in Data.Text.Internal.Builder Methods (==) :: Builder -> Builder -> Bool # (/=) :: Builder -> Builder -> Bool #
Eq B
Instance details Defined in Data.Text.Short.Internal Methods (==) :: B -> B -> Bool # (/=) :: B -> B -> Bool #
Eq ShortText
Instance details Defined in Data.Text.Short.Internal Methods (==) :: ShortText -> ShortText -> Bool # (/=) :: ShortText -> ShortText -> Bool #
Eq ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorInfo -> ConstructorInfo -> Bool # (/=) :: ConstructorInfo -> ConstructorInfo -> Bool #
Eq ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorVariant -> ConstructorVariant -> Bool # (/=) :: ConstructorVariant -> ConstructorVariant -> Bool #
Eq DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeInfo -> DatatypeInfo -> Bool # (/=) :: DatatypeInfo -> DatatypeInfo -> Bool #
Eq DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeVariant -> DatatypeVariant -> Bool # (/=) :: DatatypeVariant -> DatatypeVariant -> Bool #
Eq FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: FieldStrictness -> FieldStrictness -> Bool # (/=) :: FieldStrictness -> FieldStrictness -> Bool #
Eq Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Strictness -> Strictness -> Bool # (/=) :: Strictness -> Strictness -> Bool #
Eq Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Unpackedness -> Unpackedness -> Bool # (/=) :: Unpackedness -> Unpackedness -> Bool #
Eq DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DClause -> DClause -> Bool # (/=) :: DClause -> DClause -> Bool #
Eq DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DCon -> DCon -> Bool # (/=) :: DCon -> DCon -> Bool #
Eq DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DConFields -> DConFields -> Bool # (/=) :: DConFields -> DConFields -> Bool #
Eq DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDec -> DDec -> Bool # (/=) :: DDec -> DDec -> Bool #
Eq DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDerivClause -> DDerivClause -> Bool # (/=) :: DDerivClause -> DDerivClause -> Bool #
Eq DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDerivStrategy -> DDerivStrategy -> Bool # (/=) :: DDerivStrategy -> DDerivStrategy -> Bool #
Eq DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DExp -> DExp -> Bool # (/=) :: DExp -> DExp -> Bool #
Eq DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DFamilyResultSig -> DFamilyResultSig -> Bool # (/=) :: DFamilyResultSig -> DFamilyResultSig -> Bool #
Eq DForallTelescope
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DForallTelescope -> DForallTelescope -> Bool # (/=) :: DForallTelescope -> DForallTelescope -> Bool #
Eq DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DForeign -> DForeign -> Bool # (/=) :: DForeign -> DForeign -> Bool #
Eq DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DInfo -> DInfo -> Bool # (/=) :: DInfo -> DInfo -> Bool #
Eq DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DLetDec -> DLetDec -> Bool # (/=) :: DLetDec -> DLetDec -> Bool #
Eq DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DMatch -> DMatch -> Bool # (/=) :: DMatch -> DMatch -> Bool #
Eq DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPat -> DPat -> Bool # (/=) :: DPat -> DPat -> Bool #
Eq DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPatSynDir -> DPatSynDir -> Bool # (/=) :: DPatSynDir -> DPatSynDir -> Bool #
Eq DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPragma -> DPragma -> Bool # (/=) :: DPragma -> DPragma -> Bool #
Eq DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DRuleBndr -> DRuleBndr -> Bool # (/=) :: DRuleBndr -> DRuleBndr -> Bool #
Eq DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTySynEqn -> DTySynEqn -> Bool # (/=) :: DTySynEqn -> DTySynEqn -> Bool #
Eq DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Eq DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool # (/=) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool #
Eq NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: NewOrData -> NewOrData -> Bool # (/=) :: NewOrData -> NewOrData -> Bool #
Eq DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DFunArgs -> DFunArgs -> Bool # (/=) :: DFunArgs -> DFunArgs -> Bool #
Eq DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DTypeArg -> DTypeArg -> Bool # (/=) :: DTypeArg -> DTypeArg -> Bool #
Eq DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DVisFunArg -> DVisFunArg -> Bool # (/=) :: DVisFunArg -> DVisFunArg -> Bool #
Eq UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods (==) :: UTCTime -> UTCTime -> Bool # (/=) :: UTCTime -> UTCTime -> Bool #
Eq LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods (==) :: LocalTime -> LocalTime -> Bool # (/=) :: LocalTime -> LocalTime -> Bool #
Eq Undefined
Instance details Defined in Universum.Debug Methods (==) :: Undefined -> Undefined -> Bool # (/=) :: Undefined -> Undefined -> Bool #
Eq UUID
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UUID -> UUID -> Bool # (/=) :: UUID -> UUID -> Bool #
Eq UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UnpackedUUID -> UnpackedUUID -> Bool # (/=) :: UnpackedUUID -> UnpackedUUID -> Bool #
Eq Integer
Instance details Defined in GHC.Num.Integer Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Eq Natural
Instance details Defined in GHC.Num.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
Eq ()
Instance details Defined in GHC.Classes Methods (==) :: () -> () -> Bool # (/=) :: () -> () -> Bool #
Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Eq Char
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool # (/=) :: Char -> Char -> Bool #
Eq Double	Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Double)`False Also note that `Double`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Double)`True `>>>` `recip 0 == recip (-0 :: Double)`False
Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool # (/=) :: Double -> Double -> Bool #
Eq Float	Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Float)`False Also note that `Float`'s `Eq` instance does not satisfy extensionality: `>>>` `0 == (-0 :: Float)`True `>>>` `recip 0 == recip (-0 :: Float)`False
Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool # (/=) :: Float -> Float -> Bool #
Eq Int
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool # (/=) :: Int -> Int -> Bool #
Eq Word
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool # (/=) :: Word -> Word -> Bool #
() :=> (Eq (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (a :- b) #
() :=> (Eq (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (Dict a) #
() :=> (Eq Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Integer #
() :=> (Eq Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Natural #
() :=> (Eq ())
Instance details Defined in Data.Constraint Methods ins :: () :- Eq () #
() :=> (Eq Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Bool #
() :=> (Eq Double)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Double #
() :=> (Eq Float)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Float #
() :=> (Eq Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Int #
() :=> (Eq Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Word #
Class () (Eq a)
Instance details Defined in Data.Constraint Methods cls :: Eq a :- () #
Eq a => Eq (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: First' a -> First' a -> Bool # (/=) :: First' a -> First' a -> Bool #
Eq a => Eq (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: Last' a -> Last' a -> Bool # (/=) :: Last' a -> Last' a -> Bool #
Eq a => Eq (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: Option' a -> Option' a -> Bool # (/=) :: Option' a -> Option' a -> Bool #
Eq a => Eq (Only a)
Instance details Defined in Data.Tuple.Only Methods (==) :: Only a -> Only a -> Bool # (/=) :: Only a -> Only a -> Bool #
Eq v => Eq (KeyMap v)
Instance details Defined in Data.Aeson.KeyMap Methods (==) :: KeyMap v -> KeyMap v -> Bool # (/=) :: KeyMap v -> KeyMap v -> Bool #
Eq a => Eq (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: IResult a -> IResult a -> Bool # (/=) :: IResult a -> IResult a -> Bool #
Eq a => Eq (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Result a -> Result a -> Bool # (/=) :: Result a -> Result a -> Bool #
Eq a => Eq (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods (==) :: ZipList a -> ZipList a -> Bool # (/=) :: ZipList a -> ZipList a -> Bool #
Eq (MutableByteArray s)	Since: base-4.17.0.0
Instance details 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
Instance details Defined in Data.Complex Methods (==) :: Complex a -> Complex a -> Bool # (/=) :: Complex a -> Complex a -> Bool #
Eq a => Eq (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Eq a => Eq (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Eq a => Eq (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq a => Eq (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods (==) :: Down a -> Down a -> Bool # (/=) :: Down a -> Down a -> Bool #
Eq a => Eq (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Eq a => Eq (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq a => Eq (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Max a -> Max a -> Bool # (/=) :: Max a -> Max a -> Bool #
Eq a => Eq (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Min a -> Min a -> Bool # (/=) :: Min a -> Min a -> Bool #
Eq m => Eq (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #
Eq a => Eq (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Dual a -> Dual a -> Bool # (/=) :: Dual a -> Dual a -> Bool #
Eq a => Eq (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Product a -> Product a -> Bool # (/=) :: Product a -> Product a -> Bool #
Eq a => Eq (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Sum a -> Sum a -> Bool # (/=) :: Sum a -> Sum a -> Bool #
Eq (TVar a)	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: TVar a -> TVar a -> Bool # (/=) :: TVar a -> TVar a -> Bool #
Eq p => Eq (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: Par1 p -> Par1 p -> Bool # (/=) :: Par1 p -> Par1 p -> Bool #
Eq (IORef a)	Pointer equality. Since: base-4.0.0.0
Instance details Defined in GHC.IORef Methods (==) :: IORef a -> IORef a -> Bool # (/=) :: IORef a -> IORef a -> Bool #
Eq (MVar a)	Since: base-4.1.0.0
Instance details Defined in GHC.MVar Methods (==) :: MVar a -> MVar a -> Bool # (/=) :: MVar a -> MVar a -> Bool #
Eq (FunPtr a)
Instance details Defined in GHC.Ptr Methods (==) :: FunPtr a -> FunPtr a -> Bool # (/=) :: FunPtr a -> FunPtr a -> Bool #
Eq (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods (==) :: Ptr a -> Ptr a -> Bool # (/=) :: Ptr a -> Ptr a -> Bool #
Eq a => Eq (Ratio a)	Since: base-2.1
Instance details Defined in GHC.Real Methods (==) :: Ratio a -> Ratio a -> Bool # (/=) :: Ratio a -> Ratio a -> Bool #
Eq (Bits n)
Instance details Defined in Basement.Bits Methods (==) :: Bits n -> Bits n -> Bool # (/=) :: Bits n -> Bits n -> Bool #
(PrimType ty, Eq ty) => Eq (Block ty)
Instance details Defined in Basement.Block.Base Methods (==) :: Block ty -> Block ty -> Bool # (/=) :: Block ty -> Block ty -> Bool #
Eq (Zn n)
Instance details Defined in Basement.Bounded Methods (==) :: Zn n -> Zn n -> Bool # (/=) :: Zn n -> Zn n -> Bool #
Eq (Zn64 n)
Instance details Defined in Basement.Bounded Methods (==) :: Zn64 n -> Zn64 n -> Bool # (/=) :: Zn64 n -> Zn64 n -> Bool #
Eq a => Eq (Array a)
Instance details Defined in Basement.BoxedArray Methods (==) :: Array a -> Array a -> Bool # (/=) :: Array a -> Array a -> Bool #
Eq a => Eq (NonEmpty a)
Instance details Defined in Basement.NonEmpty Methods (==) :: NonEmpty a -> NonEmpty a -> Bool # (/=) :: NonEmpty a -> NonEmpty a -> Bool #
Eq (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: CountOf ty -> CountOf ty -> Bool # (/=) :: CountOf ty -> CountOf ty -> Bool #
Eq (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: Offset ty -> Offset ty -> Bool # (/=) :: Offset ty -> Offset ty -> Bool #
(PrimType ty, Eq ty) => Eq (UArray ty)
Instance details Defined in Basement.UArray.Base Methods (==) :: UArray ty -> UArray ty -> Bool # (/=) :: UArray ty -> UArray ty -> Bool #
Eq (Dict a)
Instance details Defined in Data.Constraint Methods (==) :: Dict a -> Dict a -> Bool # (/=) :: Dict a -> Dict a -> Bool #
Eq vertex => Eq (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods (==) :: SCC vertex -> SCC vertex -> Bool # (/=) :: SCC vertex -> SCC vertex -> Bool #
Eq a => Eq (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods (==) :: IntMap a -> IntMap a -> Bool # (/=) :: IntMap a -> IntMap a -> Bool #
Eq a => Eq (Seq a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: Seq a -> Seq a -> Bool # (/=) :: Seq a -> Seq a -> Bool #
Eq a => Eq (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewL a -> ViewL a -> Bool # (/=) :: ViewL a -> ViewL a -> Bool #
Eq a => Eq (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewR a -> ViewR a -> Bool # (/=) :: ViewR a -> ViewR a -> Bool #
Eq a => Eq (Intersection a)
Instance details Defined in Data.Set.Internal Methods (==) :: Intersection a -> Intersection a -> Bool # (/=) :: Intersection a -> Intersection a -> Bool #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
Eq a => Eq (Tree a)
Instance details Defined in Data.Tree Methods (==) :: Tree a -> Tree a -> Bool # (/=) :: Tree a -> Tree a -> Bool #
Eq a => Eq (CryptoFailable a)
Instance details Defined in Crypto.Error.Types Methods (==) :: CryptoFailable a -> CryptoFailable a -> Bool # (/=) :: CryptoFailable a -> CryptoFailable a -> Bool #
Eq (Digest a)
Instance details Defined in Crypto.Hash.Types Methods (==) :: Digest a -> Digest a -> Bool # (/=) :: Digest a -> Digest a -> Bool #
Eq1 f => Eq (Fix f)
Instance details Defined in Data.Fix Methods (==) :: Fix f -> Fix f -> Bool # (/=) :: Fix f -> Fix f -> Bool #
(Functor f, Eq1 f) => Eq (Mu f)
Instance details Defined in Data.Fix Methods (==) :: Mu f -> Mu f -> Bool # (/=) :: Mu f -> Mu f -> Bool #
(Functor f, Eq1 f) => Eq (Nu f)
Instance details Defined in Data.Fix Methods (==) :: Nu f -> Nu f -> Bool # (/=) :: Nu f -> Nu f -> Bool #
Eq a => Eq (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (==) :: DNonEmpty a -> DNonEmpty a -> Bool # (/=) :: DNonEmpty a -> DNonEmpty a -> Bool #
Eq a => Eq (DList a)
Instance details Defined in Data.DList.Internal Methods (==) :: DList a -> DList a -> Bool # (/=) :: DList a -> DList a -> Bool #
Eq (Finite n)
Instance details Defined in Data.Finite.Internal Methods (==) :: Finite n -> Finite n -> Bool # (/=) :: Finite n -> Finite n -> Bool #
Eq (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods (==) :: Binary p -> Binary p -> Bool # (/=) :: Binary p -> Binary p -> Bool #
Eq (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods (==) :: Prime p -> Prime p -> Bool # (/=) :: Prime p -> Prime p -> Bool #
Eq a => Eq (Hashed a)	Uses precomputed hash to detect inequality faster
Instance details Defined in Data.Hashable.Class Methods (==) :: Hashed a -> Hashed a -> Bool # (/=) :: Hashed a -> Hashed a -> Bool #
Eq (Affine a)
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods (==) :: Affine a -> Affine a -> Bool # (/=) :: Affine a -> Affine a -> Bool #
Eq (Point a)
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods (==) :: Point a -> Point a -> Bool # (/=) :: Point a -> Point a -> Bool #
Eq (PublicKey c)
Instance details Defined in Crypto.BLST.Internal.Types Methods (==) :: PublicKey c -> PublicKey c -> Bool # (/=) :: PublicKey c -> PublicKey c -> Bool #
Eq a => Eq (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: OpenChestT a -> OpenChestT a -> Bool # (/=) :: OpenChestT a -> OpenChestT a -> Bool #
Eq (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Packed a -> Packed a -> Bool # (/=) :: Packed a -> Packed a -> Bool #
Eq (CustomErrorRep tag) => Eq (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods (==) :: CustomError tag -> CustomError tag -> Bool # (/=) :: CustomError tag -> CustomError tag -> Bool #
Eq r => Eq (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Methods (==) :: VoidResult r -> VoidResult r -> Bool # (/=) :: VoidResult r -> VoidResult r -> Bool #
Eq a => Eq (Range a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: Range a -> Range a -> Bool # (/=) :: Range a -> Range a -> Bool #
Eq a => Eq (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeEE a -> RangeEE a -> Bool # (/=) :: RangeEE a -> RangeEE a -> Bool #
Eq a => Eq (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeEI a -> RangeEI a -> Bool # (/=) :: RangeEI a -> RangeEI a -> Bool #
Eq a => Eq (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeIE a -> RangeIE a -> Bool # (/=) :: RangeIE a -> RangeIE a -> Bool #
Eq (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods (==) :: UParam entries -> UParam entries -> Bool # (/=) :: UParam entries -> UParam entries -> Bool #
Eq a => Eq (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods (==) :: ReadTicket a -> ReadTicket a -> Bool # (/=) :: ReadTicket a -> ReadTicket a -> Bool #
Eq e => Eq (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ErrorFancy e -> ErrorFancy e -> Bool # (/=) :: ErrorFancy e -> ErrorFancy e -> Bool #
Eq t => Eq (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ErrorItem t -> ErrorItem t -> Bool # (/=) :: ErrorItem t -> ErrorItem t -> Bool #
Eq s => Eq (PosState s)
Instance details Defined in Text.Megaparsec.State Methods (==) :: PosState s -> PosState s -> Bool # (/=) :: PosState s -> PosState s -> Bool #
Eq (Mod m)
Instance details Defined in Data.Mod Methods (==) :: Mod m -> Mod m -> Bool # (/=) :: Mod m -> Mod m -> Bool #
Eq (Exp x) => Eq (FromExpError x)
Instance details Defined in Morley.Micheline.Class Methods (==) :: FromExpError x -> FromExpError x -> Bool # (/=) :: FromExpError x -> FromExpError x -> Bool #
ExpAllExtrasConstrainted Eq x => Eq (Exp x)
Instance details Defined in Morley.Micheline.Expression Methods (==) :: Exp x -> Exp x -> Bool # (/=) :: Exp x -> Exp x -> Bool #
Eq (Exp x) => Eq (MichelinePrimAp x)
Instance details Defined in Morley.Micheline.Expression Methods (==) :: MichelinePrimAp x -> MichelinePrimAp x -> Bool # (/=) :: MichelinePrimAp x -> MichelinePrimAp x -> Bool #
Eq a => Eq (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods (==) :: StringEncode a -> StringEncode a -> Bool # (/=) :: StringEncode a -> StringEncode a -> Bool #
Eq a => Eq (ViewsSetF a)
Instance details Defined in Morley.Michelson.Internal.ViewsSet Methods (==) :: ViewsSetF a -> ViewsSetF a -> Bool # (/=) :: ViewsSetF a -> ViewsSetF a -> Bool #
Eq ext => Eq (MichelsonFailed ext)
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MichelsonFailed ext -> MichelsonFailed ext -> Bool # (/=) :: MichelsonFailed ext -> MichelsonFailed ext -> Bool #
Eq ext => Eq (MichelsonFailureWithStack ext)
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MichelsonFailureWithStack ext -> MichelsonFailureWithStack ext -> Bool # (/=) :: MichelsonFailureWithStack ext -> MichelsonFailureWithStack ext -> Bool #
Eq op => Eq (ParsedSeq op)
Instance details Defined in Morley.Michelson.Macro Methods (==) :: ParsedSeq op -> ParsedSeq op -> Bool # (/=) :: ParsedSeq op -> ParsedSeq op -> Bool #
Eq op => Eq (TCOpSeq op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TCOpSeq op -> TCOpSeq op -> Bool # (/=) :: TCOpSeq op -> TCOpSeq op -> Bool #
Eq op => Eq (TcError' op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TcError' op -> TcError' op -> Bool # (/=) :: TcError' op -> TcError' op -> Bool #
Eq op => Eq (IllTypedInstr op)
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: IllTypedInstr op -> IllTypedInstr op -> Bool # (/=) :: IllTypedInstr op -> IllTypedInstr op -> Bool #
Eq op => Eq (TypeCheckedOp op)
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: TypeCheckedOp op -> TypeCheckedOp op -> Bool # (/=) :: TypeCheckedOp op -> TypeCheckedOp op -> Bool #
Eq (HST ts)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods (==) :: HST ts -> HST ts -> Bool # (/=) :: HST ts -> HST ts -> Bool #
Eq (AnnotatedValue v)
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods (==) :: AnnotatedValue v -> AnnotatedValue v -> Bool # (/=) :: AnnotatedValue v -> AnnotatedValue v -> Bool #
(Eq r, Eq (Anns rs)) => Eq (Anns (r ': rs))
Instance details Defined in Morley.Michelson.Typed.Annotation Methods (==) :: Anns (r ': rs) -> Anns (r ': rs) -> Bool # (/=) :: Anns (r ': rs) -> Anns (r ': rs) -> Bool #
Eq (Anns ('[] :: [Type]))
Instance details Defined in Morley.Michelson.Typed.Annotation Methods (==) :: Anns '[] -> Anns '[] -> Bool # (/=) :: Anns '[] -> Anns '[] -> Bool #
Eq (Notes t)
Instance details Defined in Morley.Michelson.Typed.Annotation Methods (==) :: Notes t -> Notes t -> Bool # (/=) :: Notes t -> Notes t -> Bool #
Eq (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParamNotes t -> ParamNotes t -> Bool # (/=) :: ParamNotes t -> ParamNotes t -> Bool #
Eq (SomeEntrypointCallT arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: SomeEntrypointCallT arg -> SomeEntrypointCallT arg -> Bool # (/=) :: SomeEntrypointCallT arg -> SomeEntrypointCallT arg -> Bool #
Eq (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
Eq arg => Eq (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: Ticket arg -> Ticket arg -> Bool # (/=) :: Ticket arg -> Ticket arg -> Bool #
Eq (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (==) :: PrintComment st -> PrintComment st -> Bool # (/=) :: PrintComment st -> PrintComment st -> Bool #
Eq (StackRef st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (==) :: StackRef st -> StackRef st -> Bool # (/=) :: StackRef st -> StackRef st -> Bool #
Eq (SingT x)
Instance details Defined in Morley.Michelson.Typed.Sing Methods (==) :: SingT x -> SingT x -> Bool # (/=) :: SingT x -> SingT x -> Bool #
Eq (Operation' instr)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: Operation' instr -> Operation' instr -> Bool # (/=) :: Operation' instr -> Operation' instr -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (SomeViewsSet' instr)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: SomeViewsSet' instr -> SomeViewsSet' instr -> Bool # (/=) :: SomeViewsSet' instr -> SomeViewsSet' instr -> Bool #
Eq op => Eq (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: Contract' op -> Contract' op -> Bool # (/=) :: Contract' op -> Contract' op -> Bool #
Eq op => Eq (ContractBlock op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: ContractBlock op -> ContractBlock op -> Bool # (/=) :: ContractBlock op -> ContractBlock op -> Bool #
Eq op => Eq (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Methods (==) :: View' op -> View' op -> Bool # (/=) :: View' op -> View' op -> Bool #
Eq instr => Eq (ViewsSet instr)
Instance details Defined in Morley.Michelson.Untyped.View Methods (==) :: ViewsSet instr -> ViewsSet instr -> Bool # (/=) :: ViewsSet instr -> ViewsSet instr -> Bool #
Eq (KindedAddress kind)
Instance details Defined in Morley.Tezos.Address Methods (==) :: KindedAddress kind -> KindedAddress kind -> Bool # (/=) :: KindedAddress kind -> KindedAddress kind -> Bool #
Eq (Hash kind)
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: Hash kind -> Hash kind -> Bool # (/=) :: Hash kind -> Hash kind -> Bool #
Eq (HashTag kind)
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: HashTag kind -> HashTag kind -> Bool # (/=) :: HashTag kind -> HashTag kind -> Bool #
Eq (Label name)
Instance details Defined in Morley.Util.Label Methods (==) :: Label name -> Label name -> Bool # (/=) :: Label name -> Label name -> Bool #
Eq a => Eq (MismatchError a)
Instance details Defined in Morley.Util.MismatchError Methods (==) :: MismatchError a -> MismatchError a -> Bool # (/=) :: MismatchError a -> MismatchError a -> Bool #
Eq (SingNat n)
Instance details Defined in Morley.Util.Peano Methods (==) :: SingNat n -> SingNat n -> Bool # (/=) :: SingNat n -> SingNat n -> Bool #
Eq (PeanoNatural n)
Instance details Defined in Morley.Util.PeanoNatural Methods (==) :: PeanoNatural n -> PeanoNatural n -> Bool # (/=) :: PeanoNatural n -> PeanoNatural n -> Bool #
Eq a => Eq (All a)
Instance details Defined in Morley.Prelude.Boolean Methods (==) :: All a -> All a -> Bool # (/=) :: All a -> All a -> Bool #
Eq a => Eq (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods (==) :: Any a -> Any a -> Bool # (/=) :: Any a -> Any a -> Bool #
Eq a => Eq (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool #
Eq (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Doc a -> Doc a -> Bool # (/=) :: Doc a -> Doc a -> Bool #
Eq a => Eq (Span a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Span a -> Span a -> Bool # (/=) :: Span a -> Span a -> Bool #
Eq ann => Eq (SimpleDocStream ann)
Instance details Defined in Prettyprinter.Internal Methods (==) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (/=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool #
Eq a => Eq (Array a)
Instance details Defined in Data.Primitive.Array Methods (==) :: Array a -> Array a -> Bool # (/=) :: Array a -> Array a -> Bool #
Eq (MutableByteArray s)
Instance details 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
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: PrimArray a -> PrimArray a -> Bool # (/=) :: PrimArray a -> PrimArray a -> Bool #
Eq a => Eq (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallArray a -> SmallArray a -> Bool # (/=) :: SmallArray a -> SmallArray a -> Bool #
Eq g => Eq (StateGen g)
Instance details Defined in System.Random.Internal Methods (==) :: StateGen g -> StateGen g -> Bool # (/=) :: StateGen g -> StateGen g -> Bool #
Eq g => Eq (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: AtomicGen g -> AtomicGen g -> Bool # (/=) :: AtomicGen g -> AtomicGen g -> Bool #
Eq g => Eq (IOGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: IOGen g -> IOGen g -> Bool # (/=) :: IOGen g -> IOGen g -> Bool #
Eq g => Eq (STGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: STGen g -> STGen g -> Bool # (/=) :: STGen g -> STGen g -> Bool #
Eq g => Eq (TGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: TGen g -> TGen g -> Bool # (/=) :: TGen g -> TGen g -> Bool #
Eq a => Eq (Add a)
Instance details Defined in Data.Semiring Methods (==) :: Add a -> Add a -> Bool # (/=) :: Add a -> Add a -> Bool #
Eq (IntSetOf a)
Instance details Defined in Data.Semiring Methods (==) :: IntSetOf a -> IntSetOf a -> Bool # (/=) :: IntSetOf a -> IntSetOf a -> Bool #
Eq a => Eq (Mul a)
Instance details Defined in Data.Semiring Methods (==) :: Mul a -> Mul a -> Bool # (/=) :: Mul a -> Mul a -> Bool #
Eq a => Eq (WrappedNum a)
Instance details Defined in Data.Semiring Methods (==) :: WrappedNum a -> WrappedNum a -> Bool # (/=) :: WrappedNum a -> WrappedNum a -> Bool #
Eq a => Eq (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Eq flag => Eq (TyVarBndr flag)
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (/=) :: TyVarBndr flag -> TyVarBndr flag -> Bool #
Eq flag => Eq (DTyVarBndr flag)
Instance details 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 `HashSet`s may behave differently, i.e. substitutivity may be violated: `>>>` `data D = A \| B deriving (Eq, Show)``>>>` `instance Hashable D where hashWithSalt salt _d = salt` `>>>` `x = fromList [A, B]``>>>` `y = fromList [B, A]` `>>>` `x == y`True `>>>` `toList x`[A,B] `>>>` `toList y`[B,A] In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.
Instance details Defined in Data.HashSet.Internal Methods (==) :: HashSet a -> HashSet a -> Bool # (/=) :: HashSet a -> HashSet a -> Bool #
Eq a => Eq (Vector a)
Instance details Defined in Data.Vector Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
(Prim a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
(Storable a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Storable Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Eq t => Eq (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods (==) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (/=) :: ElField '(s, t) -> ElField '(s, t) -> Bool #
Eq a => Eq (Identity a)
Instance details Defined in Data.Vinyl.Functor Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Eq a => Eq (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (==) :: NonEmpty a -> NonEmpty a -> Bool # (/=) :: NonEmpty a -> NonEmpty a -> Bool #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Eq a => Eq (a)
Instance details Defined in GHC.Classes Methods (==) :: (a) -> (a) -> Bool # (/=) :: (a) -> (a) -> Bool #
Eq a => Eq [a]
Instance details Defined in GHC.Classes Methods (==) :: [a] -> [a] -> Bool # (/=) :: [a] -> [a] -> Bool #
(Eq a) :=> (Eq (Complex a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Complex a) #
(Eq a) :=> (Eq (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Const a b) #
(Eq a) :=> (Eq (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Identity a) #
(Eq a) :=> (Eq (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Ratio a) #
(Eq a) :=> (Eq (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Maybe a) #
(Eq a) :=> (Eq [a])
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq [a] #
Class (Eq a) (Bits a)
Instance details Defined in Data.Constraint Methods cls :: Bits a :- Eq a #
Class (Eq a) (Ord a)
Instance details Defined in Data.Constraint Methods cls :: Ord a :- Eq a #
Eq a => Eq (WrapWord a n)
Instance details Defined in Data.Word.Odd Methods (==) :: WrapWord a n -> WrapWord a n -> Bool # (/=) :: WrapWord a n -> WrapWord a n -> Bool #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
Eq (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (==) :: Fixed a -> Fixed a -> Bool # (/=) :: Fixed a -> Fixed a -> Bool #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Eq a => Eq (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Arg a b -> Arg a b -> Bool # (/=) :: Arg a b -> Arg a b -> Bool #
Eq (TypeRep a)	Since: base-2.1
Instance details Defined in Data.Typeable.Internal Methods (==) :: TypeRep a -> TypeRep a -> Bool # (/=) :: TypeRep a -> TypeRep a -> Bool #
Eq (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: U1 p -> U1 p -> Bool # (/=) :: U1 p -> U1 p -> Bool #
Eq (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: V1 p -> V1 p -> Bool # (/=) :: V1 p -> V1 p -> Bool #
Eq a => Eq (ListN n a)
Instance details Defined in Basement.Sized.List Methods (==) :: ListN n a -> ListN n a -> Bool # (/=) :: ListN n a -> ListN n a -> Bool #
(Eq a, Eq b) => Eq (Bimap a b)
Instance details Defined in Data.Bimap Methods (==) :: Bimap a b -> Bimap a b -> Bool # (/=) :: Bimap a b -> Bimap a b -> Bool #
Eq (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods (==) :: (a :- b) -> (a :- b) -> Bool # (/=) :: (a :- b) -> (a :- b) -> Bool #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
(Eq1 f, Eq a) => Eq (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods (==) :: Cofree f a -> Cofree f a -> Bool # (/=) :: Cofree f a -> Cofree f a -> Bool #
(Eq1 f, Eq a) => Eq (Free f a)
Instance details Defined in Control.Monad.Free Methods (==) :: Free f a -> Free f a -> Bool # (/=) :: Free f a -> Free f a -> Bool #
Eq k => Eq (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods (==) :: Extension p k -> Extension p k -> Bool # (/=) :: Extension p k -> Extension p k -> Bool #
Eq k => Eq (RootsOfUnity n k)
Instance details 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)
Instance details Defined in Crypto.BLST.Internal.Types Methods (==) :: Signature c m -> Signature c m -> Bool # (/=) :: Signature c m -> Signature c m -> Bool #
(Eq1 f, Eq a) => Eq (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods (==) :: Yoneda f a -> Yoneda f a -> Bool # (/=) :: Yoneda f a -> Yoneda f a -> Bool #
Eq (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods (==) :: TAddress p vd -> TAddress p vd -> Bool # (/=) :: TAddress p vd -> TAddress p vd -> Bool #
Eq (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods (==) :: (inp :-> out) -> (inp :-> out) -> Bool # (/=) :: (inp :-> out) -> (inp :-> out) -> Bool #
Eq (ContractCode cp st) Source #
Instance details Defined in Lorentz.Base Methods (==) :: ContractCode cp st -> ContractCode cp st -> Bool # (/=) :: ContractCode cp st -> ContractCode cp st -> Bool #
Eq (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Hash alg a -> Hash alg a -> Bool # (/=) :: Hash alg a -> Hash alg a -> Bool #
Eq (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods (==) :: NFixed p -> NFixed p -> Bool # (/=) :: NFixed p -> NFixed p -> Bool #
Eq (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Methods (==) :: Extensible x -> Extensible x -> Bool # (/=) :: Extensible x -> Extensible x -> Bool #
Eq (WrappedLambda i o) Source #
Instance details 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 #
Instance details Defined in Lorentz.Macro Methods (==) :: View_ a r -> View_ a r -> Bool # (/=) :: View_ a r -> View_ a r -> Bool #
(Eq a, Eq b) => Eq (ZippedStackRepr a b) Source #
Instance details 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)
Instance details 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)
Instance details 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)
Instance details Defined in Text.Megaparsec.State Methods (==) :: State s e -> State s e -> Bool # (/=) :: State s e -> State s e -> Bool #
Eq (NoStkElMeta t)
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: NoStkElMeta t -> NoStkElMeta t -> Bool # (/=) :: NoStkElMeta t -> NoStkElMeta t -> Bool #
Eq (meta t) => Eq (StkEl meta t)
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: StkEl meta t -> StkEl meta t -> Bool # (/=) :: StkEl meta t -> StkEl meta t -> Bool #
(Eq n, Eq m) => Eq (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: ArithError n m -> ArithError n m -> Bool # (/=) :: ArithError n m -> ArithError n m -> Bool #
Eq (EntrypointCallT param arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EntrypointCallT param arg -> EntrypointCallT param arg -> Bool # (/=) :: EntrypointCallT param arg -> EntrypointCallT param arg -> Bool #
Eq (EpLiftSequence arg param)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EpLiftSequence arg param -> EpLiftSequence arg param -> Bool # (/=) :: EpLiftSequence arg param -> EpLiftSequence arg param -> Bool #
Eq (Emit instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: Emit instr t -> Emit instr t -> Bool # (/=) :: Emit instr t -> Emit instr t -> Bool #
Eq (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: TransferTokens instr p -> TransferTokens instr p -> Bool # (/=) :: TransferTokens instr p -> TransferTokens instr p -> Bool #
Eq (Value' instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: Value' instr t -> Value' instr t -> Bool # (/=) :: Value' instr t -> Value' instr t -> Bool #
(forall (arg :: T) (ret :: T). Eq (ViewCode' instr arg st ret)) => Eq (SomeView' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: SomeView' instr st -> SomeView' instr st -> Bool # (/=) :: SomeView' instr st -> SomeView' instr st -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: ViewsSet' instr st -> ViewsSet' instr st -> Bool # (/=) :: ViewsSet' instr st -> ViewsSet' instr st -> Bool #
Eq (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (==) :: Annotation tag -> Annotation tag -> Bool # (/=) :: Annotation tag -> Annotation tag -> Bool #
(Eq e, Eq a) => Eq (Validation e a)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: Validation e a -> Validation e a -> Bool # (/=) :: Validation e a -> Validation e a -> Bool #
Eq (f op) => Eq (ExtInstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: ExtInstrAbstract f op -> ExtInstrAbstract f op -> Bool # (/=) :: ExtInstrAbstract f op -> ExtInstrAbstract f op -> Bool #
Eq (f op) => Eq (TestAssert f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: TestAssert f op -> TestAssert f op -> Bool # (/=) :: TestAssert f op -> TestAssert f op -> Bool #
(Eq op, Eq (f op)) => Eq (InstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Instr Methods (==) :: InstrAbstract f op -> InstrAbstract f op -> Bool # (/=) :: InstrAbstract f op -> InstrAbstract f op -> Bool #
(Eq a, Eq b) => Eq (Bimap a b)
Instance details Defined in Morley.Util.Bimap Methods (==) :: Bimap a b -> Bimap a b -> Bool # (/=) :: Bimap a b -> Bimap a b -> Bool #
Eq a => Eq (SizedList' n a)
Instance details Defined in Morley.Util.SizedList Methods (==) :: SizedList' n a -> SizedList' n a -> Bool # (/=) :: SizedList' n a -> SizedList' n a -> Bool #
Eq (v a) => Eq (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods (==) :: Poly v a -> Poly v a -> Bool # (/=) :: Poly v a -> Poly v a -> Bool #
Eq (MutableArray s a)
Instance details Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool # (/=) :: MutableArray s a -> MutableArray s a -> Bool #
Eq (MutablePrimArray s a)
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # (/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool #
Eq (SmallMutableArray s a)
Instance details 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)
Instance details Defined in Data.Semiring Methods (==) :: IntMapOf k v -> IntMapOf k v -> Bool # (/=) :: IntMapOf k v -> IntMapOf k v -> Bool #
GEq tag => Eq (Some tag)
Instance details Defined in Data.GADT.Internal Methods (==) :: Some tag -> Some tag -> Bool # (/=) :: Some tag -> Some tag -> Bool #
(Eq a, Eq b) => Eq (Either a b)
Instance details Defined in Data.Strict.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
(Eq a, Eq b) => Eq (These a b)
Instance details Defined in Data.Strict.These Methods (==) :: These a b -> These a b -> Bool # (/=) :: These a b -> These a b -> Bool #
(Eq a, Eq b) => Eq (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods (==) :: Pair a b -> Pair a b -> Bool # (/=) :: Pair a b -> Pair a b -> Bool #
(Eq a, Eq b) => Eq (These a b)
Instance details Defined in Data.These Methods (==) :: These a b -> These a b -> Bool # (/=) :: These a b -> These a b -> Bool #
(Eq1 m, Eq a) => Eq (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods (==) :: MaybeT m a -> MaybeT m a -> Bool # (/=) :: MaybeT m a -> MaybeT m a -> Bool #
(Eq k, Eq v) => Eq (HashMap k v)	Note that, in the presence of hash collisions, equal `HashMap`s may behave differently, i.e. substitutivity may be violated: `>>>` `data D = A \| B deriving (Eq, Show)``>>>` `instance Hashable D where hashWithSalt salt _d = salt` `>>>` `x = fromList [(A,1), (B,2)]``>>>` `y = fromList [(B,2), (A,1)]` `>>>` `x == y`True `>>>` `toList x`[(A,1),(B,2)] `>>>` `toList y`[(B,2),(A,1)] In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.
Instance details Defined in Data.HashMap.Internal Methods (==) :: HashMap k v -> HashMap k v -> Bool # (/=) :: HashMap k v -> HashMap k v -> Bool #
(Eq k, Eq v) => Eq (Leaf k v)
Instance details Defined in Data.HashMap.Internal Methods (==) :: Leaf k v -> Leaf k v -> Bool # (/=) :: Leaf k v -> Leaf k v -> Bool #
(Eq a, Eq b) => Eq (a, b)
Instance details Defined in GHC.Classes Methods (==) :: (a, b) -> (a, b) -> Bool # (/=) :: (a, b) -> (a, b) -> Bool #
(Eq a, Eq b) :=> (Eq (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (Either a b) #
(Eq a, Eq b) :=> (Eq (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (a, b) #
Eq a => Eq (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (==) :: Const a b -> Const a b -> Bool # (/=) :: Const a b -> Const a b -> Bool #
Eq (f a) => Eq (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (==) :: Ap f a -> Ap f a -> Bool # (/=) :: Ap f a -> Ap f a -> Bool #
Eq (f a) => Eq (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Alt f a -> Alt f a -> Bool # (/=) :: Alt f a -> Alt f a -> Bool #
Eq (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~: b) -> (a :~: b) -> Bool # (/=) :: (a :~: b) -> (a :~: b) -> Bool #
Eq (OrderingI a b)
Instance details Defined in Data.Type.Ord Methods (==) :: OrderingI a b -> OrderingI a b -> Bool # (/=) :: OrderingI a b -> OrderingI a b -> Bool #
Eq (f p) => Eq (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: Rec1 f p -> Rec1 f p -> Bool # (/=) :: Rec1 f p -> Rec1 f p -> Bool #
Eq (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #
Eq (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Char p -> URec Char p -> Bool # (/=) :: URec Char p -> URec Char p -> Bool #
Eq (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Double p -> URec Double p -> Bool # (/=) :: URec Double p -> URec Double p -> Bool #
Eq (URec Float p)
Instance details Defined in GHC.Generics Methods (==) :: URec Float p -> URec Float p -> Bool # (/=) :: URec Float p -> URec Float p -> Bool #
Eq (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Int p -> URec Int p -> Bool # (/=) :: URec Int p -> URec Int p -> Bool #
Eq (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Word p -> URec Word p -> Bool # (/=) :: URec Word p -> URec Word p -> Bool #
Eq (p (Fix p a) a) => Eq (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods (==) :: Fix p a -> Fix p a -> Bool # (/=) :: Fix p a -> Fix p a -> Bool #
Eq (p a a) => Eq (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods (==) :: Join p a -> Join p a -> Bool # (/=) :: Join p a -> Join p a -> Bool #
(Eq a, Eq (f b)) => Eq (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeF f a b -> CofreeF f a b -> Bool # (/=) :: CofreeF f a b -> CofreeF f a b -> Bool #
Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeT f w a -> CofreeT f w a -> Bool # (/=) :: CofreeT f w a -> CofreeT f w a -> Bool #
(Eq a, Eq (f b)) => Eq (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeF f a b -> FreeF f a b -> Bool # (/=) :: FreeF f a b -> FreeF f a b -> Bool #
(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeT f m a -> FreeT f m a -> Bool # (/=) :: FreeT f m a -> FreeT f m a -> Bool #
Eq (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods (==) :: Contract cp st vd -> Contract cp st vd -> Bool # (/=) :: Contract cp st vd -> Contract cp st vd -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (Contract' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods (==) :: Contract' instr cp st -> Contract' instr cp st -> Bool # (/=) :: Contract' instr cp st -> Contract' instr cp st -> Bool #
Eq (instr (ContractInp cp st) (ContractOut st)) => Eq (ContractCode' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods (==) :: ContractCode' instr cp st -> ContractCode' instr cp st -> Bool # (/=) :: ContractCode' instr cp st -> ContractCode' instr cp st -> Bool #
Eq (CreateContract instr cp st)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: CreateContract instr cp st -> CreateContract instr cp st -> Bool # (/=) :: CreateContract instr cp st -> CreateContract instr cp st -> Bool #
Eq (LambdaCode' instr inp out)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: LambdaCode' instr inp out -> LambdaCode' instr inp out -> Bool # (/=) :: LambdaCode' instr inp out -> LambdaCode' instr inp out -> Bool #
Eq (f op) => Eq (Elt f op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: Elt f op -> Elt f op -> Bool # (/=) :: Elt f op -> Elt f op -> Bool #
Eq (f op) => Eq (Value' f op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: Value' f op -> Value' f op -> Bool # (/=) :: Value' f op -> Value' f op -> Bool #
GEq f => Eq (Constrained c f)
Instance details Defined in Morley.Util.Constrained Methods (==) :: Constrained c f -> Constrained c f -> Bool # (/=) :: Constrained c f -> Constrained c f -> Bool #
Eq (v (Vector n Word, a)) => Eq (MultiPoly v n a)
Instance details Defined in Data.Poly.Internal.Multi Methods (==) :: MultiPoly v n a -> MultiPoly v n a -> Bool # (/=) :: MultiPoly v n a -> MultiPoly v n a -> Bool #
Eq (GOrdering a b)
Instance details Defined in Data.GADT.Internal Methods (==) :: GOrdering a b -> GOrdering a b -> Bool # (/=) :: GOrdering a b -> GOrdering a b -> Bool #
Eq b => Eq (Tagged s b)
Instance details Defined in Data.Tagged Methods (==) :: Tagged s b -> Tagged s b -> Bool # (/=) :: Tagged s b -> Tagged s b -> Bool #
(Eq (f a), Eq (g a), Eq a) => Eq (These1 f g a)
Instance details Defined in Data.Functor.These Methods (==) :: These1 f g a -> These1 f g a -> Bool # (/=) :: These1 f g a -> These1 f g a -> Bool #
(Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods (==) :: ErrorT e m a -> ErrorT e m a -> Bool # (/=) :: ErrorT e m a -> ErrorT e m a -> Bool #
(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a)
Instance details Defined in Control.Monad.Trans.Except Methods (==) :: ExceptT e m a -> ExceptT e m a -> Bool # (/=) :: ExceptT e m a -> ExceptT e m a -> Bool #
(Eq1 f, Eq a) => Eq (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods (==) :: IdentityT f a -> IdentityT f a -> Bool # (/=) :: IdentityT f a -> IdentityT f a -> Bool #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Eq (Rec f rs)) => Eq (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods (==) :: ARec f rs -> ARec f rs -> Bool # (/=) :: ARec f rs -> ARec f rs -> Bool #
(Eq (f r), Eq (Rec f rs)) => Eq (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (/=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool #
Eq (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f '[] -> Rec f '[] -> Bool # (/=) :: Rec f '[] -> Rec f '[] -> Bool #
Eq a => Eq (Const a b)
Instance details Defined in Data.Vinyl.Functor Methods (==) :: Const a b -> Const a b -> Bool # (/=) :: Const a b -> Const a b -> Bool #
(Eq a, Eq b, Eq c) => Eq (a, b, c)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c) -> (a, b, c) -> Bool # (/=) :: (a, b, c) -> (a, b, c) -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods (==) :: Product f g a -> Product f g a -> Bool # (/=) :: Product f g a -> Product f g a -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods (==) :: Sum f g a -> Sum f g a -> Bool # (/=) :: Sum f g a -> Sum f g a -> Bool #
Eq (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~~: b) -> (a :~~: b) -> Bool # (/=) :: (a :~~: b) -> (a :~~: b) -> Bool #
(Eq (f p), Eq (g p)) => Eq ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :: g) p -> (f :: g) p -> Bool # (/=) :: (f :: g) p -> (f :: g) p -> Bool #
(Eq (f p), Eq (g p)) => Eq ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :+: g) p -> (f :+: g) p -> Bool # (/=) :: (f :+: g) p -> (f :+: g) p -> Bool #
Eq c => Eq (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: K1 i c p -> K1 i c p -> Bool # (/=) :: K1 i c p -> K1 i c p -> Bool #
Eq (instr i o) => Eq (RemFail instr i o)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: RemFail instr i o -> RemFail instr i o -> Bool # (/=) :: RemFail instr i o -> RemFail instr i o -> Bool #
Eq (ViewCode' instr arg st ret) => Eq (View' instr arg st ret)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: View' instr arg st ret -> View' instr arg st ret -> Bool # (/=) :: View' instr arg st ret -> View' instr arg st ret -> Bool #
(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods (==) :: Compose f g a -> Compose f g a -> Bool # (/=) :: Compose f g a -> Compose f g a -> Bool #
Eq (f (g p)) => Eq ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :.: g) p -> (f :.: g) p -> Bool # (/=) :: (f :.: g) p -> (f :.: g) p -> Bool #
Eq (f p) => Eq (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: M1 i c f p -> M1 i c f p -> Bool # (/=) :: M1 i c f p -> M1 i c f p -> Bool #
Eq (f a) => Eq (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods (==) :: Clown f a b -> Clown f a b -> Bool # (/=) :: Clown f a b -> Clown f a b -> Bool #
Eq (p b a) => Eq (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods (==) :: Flip p a b -> Flip p a b -> Bool # (/=) :: Flip p a b -> Flip p a b -> Bool #
Eq (g b) => Eq (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods (==) :: Joker g a b -> Joker g a b -> Bool # (/=) :: Joker g a b -> Joker g a b -> Bool #
Eq (p a b) => Eq (WrappedBifunctor p a b)
Instance details 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)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #
(Eq (f a b), Eq (g a b)) => Eq (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods (==) :: Product f g a b -> Product f g a b -> Bool # (/=) :: Product f g a b -> Product f g a b -> Bool #
(Eq (p a b), Eq (q a b)) => Eq (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods (==) :: Sum p q a b -> Sum p q a b -> Bool # (/=) :: Sum p q a b -> Sum p q a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
Eq (f (p a b)) => Eq (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods (==) :: Tannen f p a b -> Tannen f p a b -> Bool # (/=) :: Tannen f p a b -> Tannen f p a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
Eq (p (f a) (g b)) => Eq (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods (==) :: 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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #
(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)
Instance details Defined in GHC.Classes Methods (==) :: (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 #

class Eq a => Ord a #

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, then x <= z = True
Reflexivity: x <= x = True
Antisymmetry: if x <= y && y <= x = True, then x == y = True

The following operator interactions are expected to hold:

x >= y = y <= x
x < y = x <= y && x /= y
x > y = y < x
x < y = compare x y == LT
x > y = compare x y == GT
x == y = compare x y == EQ
min x y == if x <= y then x else y = True
max 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.

Minimal complete definition

compare | (<=)

Instances

Instances details

Ord CabalSpecVersion
Instance details 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
Instance details Defined in Distribution.Parsec.Position Methods compare :: Position -> Position -> Ordering # (<) :: Position -> Position -> Bool # (<=) :: Position -> Position -> Bool # (>) :: Position -> Position -> Bool # (>=) :: Position -> Position -> Bool # max :: Position -> Position -> Position # min :: Position -> Position -> Position #
Ord PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods compare :: PWarnType -> PWarnType -> Ordering # (<) :: PWarnType -> PWarnType -> Bool # (<=) :: PWarnType -> PWarnType -> Bool # (>) :: PWarnType -> PWarnType -> Bool # (>=) :: PWarnType -> PWarnType -> Bool # max :: PWarnType -> PWarnType -> PWarnType # min :: PWarnType -> PWarnType -> PWarnType #
Ord Structure
Instance details Defined in Distribution.Utils.Structured Methods compare :: Structure -> Structure -> Ordering # (<) :: Structure -> Structure -> Bool # (<=) :: Structure -> Structure -> Bool # (>) :: Structure -> Structure -> Bool # (>=) :: Structure -> Structure -> Bool # max :: Structure -> Structure -> Structure # min :: Structure -> Structure -> Structure #
Ord Extension
Instance details Defined in Language.Haskell.Extension Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Ord KnownExtension
Instance details 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
Instance details Defined in Data.Aeson.Key Methods compare :: Key -> Key -> Ordering # (<) :: Key -> Key -> Bool # (<=) :: Key -> Key -> Bool # (>) :: Key -> Key -> Bool # (>=) :: Key -> Key -> Bool # max :: Key -> Key -> Key # min :: Key -> Key -> Key #
Ord DotNetTime
Instance details 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
Instance details 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 `Eq` instance. However, nothing else about the ordering is specified, and it may change from environment to environment and version to version of either this package or its dependencies (`hashable` and 'unordered-containers'). Since: aeson-1.5.2.0
Instance details Defined in Data.Aeson.Types.Internal Methods compare :: Value -> Value -> Ordering # (<) :: Value -> Value -> Bool # (<=) :: Value -> Value -> Bool # (>) :: Value -> Value -> Bool # (>=) :: Value -> Value -> Bool # max :: Value -> Value -> Value # min :: Value -> Value -> Value #
Ord Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> 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
Instance details Defined in Data.Array.Byte Methods compare :: ByteArray -> ByteArray -> Ordering # (<) :: ByteArray -> ByteArray -> Bool # (<=) :: ByteArray -> ByteArray -> Bool # (>) :: ByteArray -> ByteArray -> Bool # (>=) :: ByteArray -> ByteArray -> Bool # max :: ByteArray -> ByteArray -> ByteArray # min :: ByteArray -> ByteArray -> ByteArray #
Ord All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: All -> All -> Ordering # (<) :: All -> All -> Bool # (<=) :: All -> All -> Bool # (>) :: All -> All -> Bool # (>=) :: All -> All -> Bool # max :: All -> All -> All # min :: All -> All -> All #
Ord Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Any -> Any -> Ordering # (<) :: Any -> Any -> Bool # (<=) :: Any -> Any -> Bool # (>) :: Any -> Any -> Bool # (>=) :: Any -> Any -> Bool # max :: Any -> Any -> Any # min :: Any -> Any -> Any #
Ord SomeTypeRep
Instance details 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
Instance details Defined in Data.Version Methods compare :: Version -> Version -> Ordering # (<) :: Version -> Version -> Bool # (<=) :: Version -> Version -> Bool # (>) :: Version -> Version -> Bool # (>=) :: Version -> Version -> Bool # max :: Version -> Version -> Version # min :: Version -> Version -> Version #
Ord Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods compare :: Void -> Void -> Ordering # (<) :: Void -> Void -> Bool # (<=) :: Void -> Void -> Bool # (>) :: Void -> Void -> Bool # (>=) :: Void -> Void -> Bool # max :: Void -> Void -> Void # min :: Void -> Void -> Void #
Ord BlockReason	Since: base-4.3.0.0
Instance details 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
Instance details Defined in GHC.Conc.Sync Methods compare :: ThreadId -> ThreadId -> Ordering # (<) :: ThreadId -> ThreadId -> Bool # (<=) :: ThreadId -> ThreadId -> Bool # (>) :: ThreadId -> ThreadId -> Bool # (>=) :: ThreadId -> ThreadId -> Bool # max :: ThreadId -> ThreadId -> ThreadId # min :: ThreadId -> ThreadId -> ThreadId #
Ord ThreadStatus	Since: base-4.3.0.0
Instance details 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
Instance details Defined in GHC.Exception Methods compare :: ErrorCall -> ErrorCall -> Ordering # (<) :: ErrorCall -> ErrorCall -> Bool # (<=) :: ErrorCall -> ErrorCall -> Bool # (>) :: ErrorCall -> ErrorCall -> Bool # (>=) :: ErrorCall -> ErrorCall -> Bool # max :: ErrorCall -> ErrorCall -> ErrorCall # min :: ErrorCall -> ErrorCall -> ErrorCall #
Ord ArithException	Since: base-3.0
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in GHC.Generics Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord SourceStrictness	Since: base-4.9.0.0
Instance details 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
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in GHC.IO.Exception Methods compare :: ExitCode -> ExitCode -> Ordering # (<) :: ExitCode -> ExitCode -> Bool # (<=) :: ExitCode -> ExitCode -> Bool # (>) :: ExitCode -> ExitCode -> Bool # (>=) :: ExitCode -> ExitCode -> Bool # max :: ExitCode -> ExitCode -> ExitCode # min :: ExitCode -> ExitCode -> ExitCode #
Ord BufferMode	Since: base-4.2.0.0
Instance details 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
Instance details Defined in GHC.IO.Handle.Types Methods compare :: Newline -> Newline -> Ordering # (<) :: Newline -> Newline -> Bool # (<=) :: Newline -> Newline -> Bool # (>) :: Newline -> Newline -> Bool # (>=) :: Newline -> Newline -> Bool # max :: Newline -> Newline -> Newline # min :: Newline -> Newline -> Newline #
Ord NewlineMode	Since: base-4.3.0.0
Instance details 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
Instance details Defined in GHC.IO.IOMode Methods compare :: IOMode -> IOMode -> Ordering # (<) :: IOMode -> IOMode -> Bool # (<=) :: IOMode -> IOMode -> Bool # (>) :: IOMode -> IOMode -> Bool # (>=) :: IOMode -> IOMode -> Bool # max :: IOMode -> IOMode -> IOMode # min :: IOMode -> IOMode -> IOMode #
Ord Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int16 -> Int16 -> Ordering # (<) :: Int16 -> Int16 -> Bool # (<=) :: Int16 -> Int16 -> Bool # (>) :: Int16 -> Int16 -> Bool # (>=) :: Int16 -> Int16 -> Bool # max :: Int16 -> Int16 -> Int16 # min :: Int16 -> Int16 -> Int16 #
Ord Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int32 -> Int32 -> Ordering # (<) :: Int32 -> Int32 -> Bool # (<=) :: Int32 -> Int32 -> Bool # (>) :: Int32 -> Int32 -> Bool # (>=) :: Int32 -> Int32 -> Bool # max :: Int32 -> Int32 -> Int32 # min :: Int32 -> Int32 -> Int32 #
Ord Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int64 -> Int64 -> Ordering # (<) :: Int64 -> Int64 -> Bool # (<=) :: Int64 -> Int64 -> Bool # (>) :: Int64 -> Int64 -> Bool # (>=) :: Int64 -> Int64 -> Bool # max :: Int64 -> Int64 -> Int64 # min :: Int64 -> Int64 -> Int64 #
Ord Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int8 -> Int8 -> Ordering # (<) :: Int8 -> Int8 -> Bool # (<=) :: Int8 -> Int8 -> Bool # (>) :: Int8 -> Int8 -> Bool # (>=) :: Int8 -> Int8 -> Bool # max :: Int8 -> Int8 -> Int8 # min :: Int8 -> Int8 -> Int8 #
Ord SomeChar
Instance details Defined in GHC.TypeLits Methods compare :: SomeChar -> SomeChar -> Ordering # (<) :: SomeChar -> SomeChar -> Bool # (<=) :: SomeChar -> SomeChar -> Bool # (>) :: SomeChar -> SomeChar -> Bool # (>=) :: SomeChar -> SomeChar -> Bool # max :: SomeChar -> SomeChar -> SomeChar # min :: SomeChar -> SomeChar -> SomeChar #
Ord SomeSymbol	Since: base-4.7.0.0
Instance details 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
Instance details Defined in GHC.TypeNats Methods compare :: SomeNat -> SomeNat -> Ordering # (<) :: SomeNat -> SomeNat -> Bool # (<=) :: SomeNat -> SomeNat -> Bool # (>) :: SomeNat -> SomeNat -> Bool # (>=) :: SomeNat -> SomeNat -> Bool # max :: SomeNat -> SomeNat -> SomeNat # min :: SomeNat -> SomeNat -> SomeNat #
Ord GeneralCategory	Since: base-2.1
Instance details 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
Instance details Defined in GHC.Word Methods compare :: Word16 -> Word16 -> Ordering # (<) :: Word16 -> Word16 -> Bool # (<=) :: Word16 -> Word16 -> Bool # (>) :: Word16 -> Word16 -> Bool # (>=) :: Word16 -> Word16 -> Bool # max :: Word16 -> Word16 -> Word16 # min :: Word16 -> Word16 -> Word16 #
Ord Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word32 -> Word32 -> Ordering # (<) :: Word32 -> Word32 -> Bool # (<=) :: Word32 -> Word32 -> Bool # (>) :: Word32 -> Word32 -> Bool # (>=) :: Word32 -> Word32 -> Bool # max :: Word32 -> Word32 -> Word32 # min :: Word32 -> Word32 -> Word32 #
Ord Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word64 -> Word64 -> Ordering # (<) :: Word64 -> Word64 -> Bool # (<=) :: Word64 -> Word64 -> Bool # (>) :: Word64 -> Word64 -> Bool # (>=) :: Word64 -> Word64 -> Bool # max :: Word64 -> Word64 -> Word64 # min :: Word64 -> Word64 -> Word64 #
Ord Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word8 -> Word8 -> Ordering # (<) :: Word8 -> Word8 -> Bool # (<=) :: Word8 -> Word8 -> Bool # (>) :: Word8 -> Word8 -> Bool # (>=) :: Word8 -> Word8 -> Bool # max :: Word8 -> Word8 -> Word8 # min :: Word8 -> Word8 -> Word8 #
Ord Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods compare :: Alphabet -> Alphabet -> Ordering # (<) :: Alphabet -> Alphabet -> Bool # (<=) :: Alphabet -> Alphabet -> Bool # (>) :: Alphabet -> Alphabet -> Bool # (>=) :: Alphabet -> Alphabet -> Bool # max :: Alphabet -> Alphabet -> Alphabet # min :: Alphabet -> Alphabet -> Alphabet #
Ord Encoding
Instance details Defined in Basement.String Methods compare :: Encoding -> Encoding -> Ordering # (<) :: Encoding -> Encoding -> Bool # (<=) :: Encoding -> Encoding -> Bool # (>) :: Encoding -> Encoding -> Bool # (>=) :: Encoding -> Encoding -> Bool # max :: Encoding -> Encoding -> Encoding # min :: Encoding -> Encoding -> Encoding #
Ord UTF32_Invalid
Instance details 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 # max :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid # min :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #
Ord AsciiString
Instance details 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
Instance details Defined in Basement.Types.Char7 Methods compare :: Char7 -> Char7 -> Ordering # (<) :: Char7 -> Char7 -> Bool # (<=) :: Char7 -> Char7 -> Bool # (>) :: Char7 -> Char7 -> Bool # (>=) :: Char7 -> Char7 -> Bool # max :: Char7 -> Char7 -> Char7 # min :: Char7 -> Char7 -> Char7 #
Ord FileSize
Instance details Defined in Basement.Types.OffsetSize Methods compare :: FileSize -> FileSize -> Ordering # (<) :: FileSize -> FileSize -> Bool # (<=) :: FileSize -> FileSize -> Bool # (>) :: FileSize -> FileSize -> Bool # (>=) :: FileSize -> FileSize -> Bool # max :: FileSize -> FileSize -> FileSize # min :: FileSize -> FileSize -> FileSize #
Ord String
Instance details Defined in Basement.UTF8.Base Methods compare :: String -> String -> Ordering # (<) :: String -> String -> Bool # (<=) :: String -> String -> Bool # (>) :: String -> String -> Bool # (>=) :: String -> String -> Bool # max :: String -> String -> String # min :: String -> String -> String #
Ord F2Poly
Instance details Defined in Data.Bit.F2Poly Methods compare :: F2Poly -> F2Poly -> Ordering # (<) :: F2Poly -> F2Poly -> Bool # (<=) :: F2Poly -> F2Poly -> Bool # (>) :: F2Poly -> F2Poly -> Bool # (>=) :: F2Poly -> F2Poly -> Bool # max :: F2Poly -> F2Poly -> F2Poly # min :: F2Poly -> F2Poly -> F2Poly #
Ord Bit
Instance details Defined in Data.Bit.Internal Methods compare :: Bit -> Bit -> Ordering # (<) :: Bit -> Bit -> Bool # (<=) :: Bit -> Bit -> Bool # (>) :: Bit -> Bit -> Bool # (>=) :: Bit -> Bit -> Bool # max :: Bit -> Bit -> Bit # min :: Bit -> Bit -> Bit #
Ord ByteString
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Data.IntSet.Internal Methods compare :: IntSet -> IntSet -> Ordering # (<) :: IntSet -> IntSet -> Bool # (<=) :: IntSet -> IntSet -> Bool # (>) :: IntSet -> IntSet -> Bool # (>=) :: IntSet -> IntSet -> Bool # max :: IntSet -> IntSet -> IntSet # min :: IntSet -> IntSet -> IntSet #
Ord BigNat
Instance details Defined in GHC.Num.BigNat Methods compare :: BigNat -> BigNat -> Ordering # (<) :: BigNat -> BigNat -> Bool # (<=) :: BigNat -> BigNat -> Bool # (>) :: BigNat -> BigNat -> Bool # (>=) :: BigNat -> BigNat -> Bool # max :: BigNat -> BigNat -> BigNat # min :: BigNat -> BigNat -> BigNat #
Ord Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Ord Ordering
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering # (<) :: Ordering -> Ordering -> Bool # (<=) :: Ordering -> Ordering -> Bool # (>) :: Ordering -> Ordering -> Bool # (>=) :: Ordering -> Ordering -> Bool # max :: Ordering -> Ordering -> Ordering # min :: Ordering -> Ordering -> Ordering #
Ord TyCon
Instance details Defined in GHC.Classes Methods compare :: TyCon -> TyCon -> Ordering # (<) :: TyCon -> TyCon -> Bool # (<=) :: TyCon -> TyCon -> Bool # (>) :: TyCon -> TyCon -> Bool # (>=) :: TyCon -> TyCon -> Bool # max :: TyCon -> TyCon -> TyCon # min :: TyCon -> TyCon -> TyCon #
Ord DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods compare :: DefName -> DefName -> Ordering # (<) :: DefName -> DefName -> Bool # (<=) :: DefName -> DefName -> Bool # (>) :: DefName -> DefName -> Bool # (>=) :: DefName -> DefName -> Bool # max :: DefName -> DefName -> DefName # min :: DefName -> DefName -> DefName #
Ord DHashAlgorithm Source #
Instance details 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 #
Instance details Defined in Lorentz.Doc Methods compare :: DViewDesc -> DViewDesc -> Ordering # (<) :: DViewDesc -> DViewDesc -> Bool # (<=) :: DViewDesc -> DViewDesc -> Bool # (>) :: DViewDesc -> DViewDesc -> Bool # (>=) :: DViewDesc -> DViewDesc -> Bool # max :: DViewDesc -> DViewDesc -> DViewDesc # min :: DViewDesc -> DViewDesc -> DViewDesc #
Ord DError Source #
Instance details Defined in Lorentz.Errors Methods compare :: DError -> DError -> Ordering # (<) :: DError -> DError -> Bool # (<=) :: DError -> DError -> Bool # (>) :: DError -> DError -> Bool # (>=) :: DError -> DError -> Bool # max :: DError -> DError -> DError # min :: DError -> DError -> DError #
Ord DDescribeErrorTagMap Source #
Instance details 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 #
Instance details Defined in Lorentz.Value Methods compare :: Never -> Never -> Ordering # (<) :: Never -> Never -> Bool # (<=) :: Never -> Never -> Bool # (>) :: Never -> Never -> Bool # (>=) :: Never -> Never -> Bool # max :: Never -> Never -> Never # min :: Never -> Never -> Never #
Ord Pos
Instance details Defined in Text.Megaparsec.Pos Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods compare :: SourcePos -> SourcePos -> Ordering # (<) :: SourcePos -> SourcePos -> Bool # (<=) :: SourcePos -> SourcePos -> Bool # (>) :: SourcePos -> SourcePos -> Bool # (>=) :: SourcePos -> SourcePos -> Bool # max :: SourcePos -> SourcePos -> SourcePos # min :: SourcePos -> SourcePos -> SourcePos #
Ord MichelinePrimitive
Instance details 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
Instance details Defined in Morley.Micheline.Json Methods compare :: TezosMutez -> TezosMutez -> Ordering # (<) :: TezosMutez -> TezosMutez -> Bool # (<=) :: TezosMutez -> TezosMutez -> Bool # (>) :: TezosMutez -> TezosMutez -> Bool # (>=) :: TezosMutez -> TezosMutez -> Bool # max :: TezosMutez -> TezosMutez -> TezosMutez # min :: TezosMutez -> TezosMutez -> TezosMutez #
Ord DocItemId
Instance details Defined in Morley.Michelson.Doc Methods compare :: DocItemId -> DocItemId -> Ordering # (<) :: DocItemId -> DocItemId -> Bool # (<=) :: DocItemId -> DocItemId -> Bool # (>) :: DocItemId -> DocItemId -> Bool # (>=) :: DocItemId -> DocItemId -> Bool # max :: DocItemId -> DocItemId -> DocItemId # min :: DocItemId -> DocItemId -> DocItemId #
Ord DocItemPos
Instance details 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
Instance details 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
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: ErrorSrcPos -> ErrorSrcPos -> Ordering # (<) :: ErrorSrcPos -> ErrorSrcPos -> Bool # (<=) :: ErrorSrcPos -> ErrorSrcPos -> Bool # (>) :: ErrorSrcPos -> ErrorSrcPos -> Bool # (>=) :: ErrorSrcPos -> ErrorSrcPos -> Bool # max :: ErrorSrcPos -> ErrorSrcPos -> ErrorSrcPos # min :: ErrorSrcPos -> ErrorSrcPos -> ErrorSrcPos #
Ord Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: SrcPos -> SrcPos -> Ordering # (<) :: SrcPos -> SrcPos -> Bool # (<=) :: SrcPos -> SrcPos -> Bool # (>) :: SrcPos -> SrcPos -> Bool # (>=) :: SrcPos -> SrcPos -> Bool # max :: SrcPos -> SrcPos -> SrcPos # min :: SrcPos -> SrcPos -> SrcPos #
Ord BadViewNameError
Instance details 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
Instance details Defined in Morley.Michelson.Internal.ViewName Methods compare :: ViewName -> ViewName -> Ordering # (<) :: ViewName -> ViewName -> Bool # (<=) :: ViewName -> ViewName -> Bool # (>) :: ViewName -> ViewName -> Bool # (>=) :: ViewName -> ViewName -> Bool # max :: ViewName -> ViewName -> ViewName # min :: ViewName -> ViewName -> ViewName #
Ord RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods compare :: RemainingSteps -> RemainingSteps -> Ordering # (<) :: RemainingSteps -> RemainingSteps -> Bool # (<=) :: RemainingSteps -> RemainingSteps -> Bool # (>) :: RemainingSteps -> RemainingSteps -> Bool # (>=) :: RemainingSteps -> RemainingSteps -> Bool # max :: RemainingSteps -> RemainingSteps -> RemainingSteps # min :: RemainingSteps -> RemainingSteps -> RemainingSteps #
Ord OptimizationStage
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Morley.Michelson.Text Methods compare :: MText -> MText -> Ordering # (<) :: MText -> MText -> Bool # (<=) :: MText -> MText -> Bool # (>) :: MText -> MText -> Bool # (>=) :: MText -> MText -> Bool # max :: MText -> MText -> MText # min :: MText -> MText -> MText #
Ord Nesting
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods compare :: Nesting -> Nesting -> Ordering # (<) :: Nesting -> Nesting -> Bool # (<=) :: Nesting -> Nesting -> Bool # (>) :: Nesting -> Nesting -> Bool # (>=) :: Nesting -> Nesting -> Bool # max :: Nesting -> Nesting -> Nesting # min :: Nesting -> Nesting -> Nesting #
Ord MutezArithErrorType
Instance details 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
Instance details 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
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods compare :: EpAddress -> EpAddress -> Ordering # (<) :: EpAddress -> EpAddress -> Bool # (<=) :: EpAddress -> EpAddress -> Bool # (>) :: EpAddress -> EpAddress -> Bool # (>=) :: EpAddress -> EpAddress -> Bool # max :: EpAddress -> EpAddress -> EpAddress # min :: EpAddress -> EpAddress -> EpAddress #
Ord DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods compare :: DStorageType -> DStorageType -> Ordering # (<) :: DStorageType -> DStorageType -> Bool # (<=) :: DStorageType -> DStorageType -> Bool # (>) :: DStorageType -> DStorageType -> Bool # (>=) :: DStorageType -> DStorageType -> Bool # max :: DStorageType -> DStorageType -> DStorageType # min :: DStorageType -> DStorageType -> DStorageType #
Ord DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods compare :: DType -> DType -> Ordering # (<) :: DType -> DType -> Bool # (<=) :: DType -> DType -> Bool # (>) :: DType -> DType -> Bool # (>=) :: DType -> DType -> Bool # max :: DType -> DType -> DType # min :: DType -> DType -> DType #
Ord OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods compare :: OperationHash -> OperationHash -> Ordering # (<) :: OperationHash -> OperationHash -> Bool # (<=) :: OperationHash -> OperationHash -> Bool # (>) :: OperationHash -> OperationHash -> Bool # (>=) :: OperationHash -> OperationHash -> Bool # max :: OperationHash -> OperationHash -> OperationHash # min :: OperationHash -> OperationHash -> OperationHash #
Ord EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods compare :: EntriesOrder -> EntriesOrder -> Ordering # (<) :: EntriesOrder -> EntriesOrder -> Bool # (<=) :: EntriesOrder -> EntriesOrder -> Bool # (>) :: EntriesOrder -> EntriesOrder -> Bool # (>=) :: EntriesOrder -> EntriesOrder -> Bool # max :: EntriesOrder -> EntriesOrder -> EntriesOrder # min :: EntriesOrder -> EntriesOrder -> EntriesOrder #
Ord Entry
Instance details Defined in Morley.Michelson.Untyped.Contract Methods compare :: Entry -> Entry -> Ordering # (<) :: Entry -> Entry -> Bool # (<=) :: Entry -> Entry -> Bool # (>) :: Entry -> Entry -> Bool # (>=) :: Entry -> Entry -> Bool # max :: Entry -> Entry -> Entry # min :: Entry -> Entry -> Entry #
Ord EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods compare :: EpName -> EpName -> Ordering # (<) :: EpName -> EpName -> Bool # (<=) :: EpName -> EpName -> Bool # (>) :: EpName -> EpName -> Bool # (>=) :: EpName -> EpName -> Bool # max :: EpName -> EpName -> EpName # min :: EpName -> EpName -> EpName #
Ord HandleImplicitDefaultEp
Instance details 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
Instance details Defined in Morley.Michelson.Untyped.Ext Methods compare :: Var -> Var -> Ordering # (<) :: Var -> Var -> Bool # (<=) :: Var -> Var -> Bool # (>) :: Var -> Var -> Bool # (>=) :: Var -> Var -> Bool # max :: Var -> Var -> Var # min :: Var -> Var -> Var #
Ord AddressKind
Instance details Defined in Morley.Tezos.Address.Kinds Methods compare :: AddressKind -> AddressKind -> Ordering # (<) :: AddressKind -> AddressKind -> Bool # (<=) :: AddressKind -> AddressKind -> Bool # (>) :: AddressKind -> AddressKind -> Bool # (>=) :: AddressKind -> AddressKind -> Bool # max :: AddressKind -> AddressKind -> AddressKind # min :: AddressKind -> AddressKind -> AddressKind #
Ord ChainId
Instance details Defined in Morley.Tezos.Core Methods compare :: ChainId -> ChainId -> Ordering # (<) :: ChainId -> ChainId -> Bool # (<=) :: ChainId -> ChainId -> Bool # (>) :: ChainId -> ChainId -> Bool # (>=) :: ChainId -> ChainId -> Bool # max :: ChainId -> ChainId -> ChainId # min :: ChainId -> ChainId -> ChainId #
Ord Mutez
Instance details Defined in Morley.Tezos.Core Methods compare :: Mutez -> Mutez -> Ordering # (<) :: Mutez -> Mutez -> Bool # (<=) :: Mutez -> Mutez -> Bool # (>) :: Mutez -> Mutez -> Bool # (>=) :: Mutez -> Mutez -> Bool # max :: Mutez -> Mutez -> Mutez # min :: Mutez -> Mutez -> Mutez #
Ord Timestamp
Instance details Defined in Morley.Tezos.Core Methods compare :: Timestamp -> Timestamp -> Ordering # (<) :: Timestamp -> Timestamp -> Bool # (<=) :: Timestamp -> Timestamp -> Bool # (>) :: Timestamp -> Timestamp -> Bool # (>=) :: Timestamp -> Timestamp -> Bool # max :: Timestamp -> Timestamp -> Timestamp # min :: Timestamp -> Timestamp -> Timestamp #
Ord KeyType
Instance details Defined in Morley.Tezos.Crypto Methods compare :: KeyType -> KeyType -> Ordering # (<) :: KeyType -> KeyType -> Bool # (<=) :: KeyType -> KeyType -> Bool # (>) :: KeyType -> KeyType -> Bool # (>=) :: KeyType -> KeyType -> Bool # max :: KeyType -> KeyType -> KeyType # min :: KeyType -> KeyType -> KeyType #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord Signature
Instance details Defined in Morley.Tezos.Crypto Methods compare :: Signature -> Signature -> Ordering # (<) :: Signature -> Signature -> Bool # (<=) :: Signature -> Signature -> Bool # (>) :: Signature -> Signature -> Bool # (>=) :: Signature -> Signature -> Bool # max :: Signature -> Signature -> Signature # min :: Signature -> Signature -> Signature #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.BLS Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord Bls12381Fr
Instance details 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
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord HexJSONByteString
Instance details 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
Instance details Defined in Morley.Prelude.Word Methods compare :: Word62 -> Word62 -> Ordering # (<) :: Word62 -> Word62 -> Bool # (<=) :: Word62 -> Word62 -> Bool # (>) :: Word62 -> Word62 -> Bool # (>=) :: Word62 -> Word62 -> Bool # max :: Word62 -> Word62 -> Word62 # min :: Word62 -> Word62 -> Word62 #
Ord Word63
Instance details Defined in Morley.Prelude.Word Methods compare :: Word63 -> Word63 -> Ordering # (<) :: Word63 -> Word63 -> Bool # (<=) :: Word63 -> Word63 -> Bool # (>) :: Word63 -> Word63 -> Bool # (>=) :: Word63 -> Word63 -> Bool # max :: Word63 -> Word63 -> Word63 # min :: Word63 -> Word63 -> Word63 #
Ord ArgPolicy
Instance details Defined in Options.Applicative.Types Methods compare :: ArgPolicy -> ArgPolicy -> Ordering # (<) :: ArgPolicy -> ArgPolicy -> Bool # (<=) :: ArgPolicy -> ArgPolicy -> Bool # (>) :: ArgPolicy -> ArgPolicy -> Bool # (>=) :: ArgPolicy -> ArgPolicy -> Bool # max :: ArgPolicy -> ArgPolicy -> ArgPolicy # min :: ArgPolicy -> ArgPolicy -> ArgPolicy #
Ord OptName
Instance details Defined in Options.Applicative.Types Methods compare :: OptName -> OptName -> Ordering # (<) :: OptName -> OptName -> Bool # (<=) :: OptName -> OptName -> Bool # (>) :: OptName -> OptName -> Bool # (>=) :: OptName -> OptName -> Bool # max :: OptName -> OptName -> OptName # min :: OptName -> OptName -> OptName #
Ord OptVisibility
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Prettyprinter.Internal Methods compare :: PageWidth -> PageWidth -> Ordering # (<) :: PageWidth -> PageWidth -> Bool # (<=) :: PageWidth -> PageWidth -> Bool # (>) :: PageWidth -> PageWidth -> Bool # (>=) :: PageWidth -> PageWidth -> Bool # max :: PageWidth -> PageWidth -> PageWidth # min :: PageWidth -> PageWidth -> 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
Instance details Defined in Data.Primitive.ByteArray Methods compare :: ByteArray -> ByteArray -> Ordering # (<) :: ByteArray -> ByteArray -> Bool # (<=) :: ByteArray -> ByteArray -> Bool # (>) :: ByteArray -> ByteArray -> Bool # (>=) :: ByteArray -> ByteArray -> Bool # max :: ByteArray -> ByteArray -> ByteArray # min :: ByteArray -> ByteArray -> ByteArray #
Ord Scientific	Scientific numbers can be safely compared for ordering. No magnitude `10^e` is calculated so there's no risk of a blowup in space or time when comparing scientific numbers coming from untrusted sources.
Instance details 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
Instance details Defined in Data.Semiring Methods compare :: Mod2 -> Mod2 -> Ordering # (<) :: Mod2 -> Mod2 -> Bool # (<=) :: Mod2 -> Mod2 -> Bool # (>) :: Mod2 -> Mod2 -> Bool # (>=) :: Mod2 -> Mod2 -> Bool # max :: Mod2 -> Mod2 -> Mod2 # min :: Mod2 -> Mod2 -> Mod2 #
Ord AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnLookup -> AnnLookup -> Ordering # (<) :: AnnLookup -> AnnLookup -> Bool # (<=) :: AnnLookup -> AnnLookup -> Bool # (>) :: AnnLookup -> AnnLookup -> Bool # (>=) :: AnnLookup -> AnnLookup -> Bool # max :: AnnLookup -> AnnLookup -> AnnLookup # min :: AnnLookup -> AnnLookup -> AnnLookup #
Ord AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnTarget -> AnnTarget -> Ordering # (<) :: AnnTarget -> AnnTarget -> Bool # (<=) :: AnnTarget -> AnnTarget -> Bool # (>) :: AnnTarget -> AnnTarget -> Bool # (>=) :: AnnTarget -> AnnTarget -> Bool # max :: AnnTarget -> AnnTarget -> AnnTarget # min :: AnnTarget -> AnnTarget -> AnnTarget #
Ord Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bang -> Bang -> Ordering # (<) :: Bang -> Bang -> Bool # (<=) :: Bang -> Bang -> Bool # (>) :: Bang -> Bang -> Bool # (>=) :: Bang -> Bang -> Bool # max :: Bang -> Bang -> Bang # min :: Bang -> Bang -> Bang #
Ord Body
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Body -> Body -> Ordering # (<) :: Body -> Body -> Bool # (<=) :: Body -> Body -> Bool # (>) :: Body -> Body -> Bool # (>=) :: Body -> Body -> Bool # max :: Body -> Body -> Body # min :: Body -> Body -> Body #
Ord Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bytes -> Bytes -> Ordering # (<) :: Bytes -> Bytes -> Bool # (<=) :: Bytes -> Bytes -> Bool # (>) :: Bytes -> Bytes -> Bool # (>=) :: Bytes -> Bytes -> Bool # max :: Bytes -> Bytes -> Bytes # min :: Bytes -> Bytes -> Bytes #
Ord Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Callconv -> Callconv -> Ordering # (<) :: Callconv -> Callconv -> Bool # (<=) :: Callconv -> Callconv -> Bool # (>) :: Callconv -> Callconv -> Bool # (>=) :: Callconv -> Callconv -> Bool # max :: Callconv -> Callconv -> Callconv # min :: Callconv -> Callconv -> Callconv #
Ord Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Clause -> Clause -> Ordering # (<) :: Clause -> Clause -> Bool # (<=) :: Clause -> Clause -> Bool # (>) :: Clause -> Clause -> Bool # (>=) :: Clause -> Clause -> Bool # max :: Clause -> Clause -> Clause # min :: Clause -> Clause -> Clause #
Ord Con
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Con -> Con -> Ordering # (<) :: Con -> Con -> Bool # (<=) :: Con -> Con -> Bool # (>) :: Con -> Con -> Bool # (>=) :: Con -> Con -> Bool # max :: Con -> Con -> Con # min :: Con -> Con -> Con #
Ord Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Dec -> Dec -> Ordering # (<) :: Dec -> Dec -> Bool # (<=) :: Dec -> Dec -> Bool # (>) :: Dec -> Dec -> Bool # (>=) :: Dec -> Dec -> Bool # max :: Dec -> Dec -> Dec # min :: Dec -> Dec -> Dec #
Ord DecidedStrictness
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DocLoc -> DocLoc -> Ordering # (<) :: DocLoc -> DocLoc -> Bool # (<=) :: DocLoc -> DocLoc -> Bool # (>) :: DocLoc -> DocLoc -> Bool # (>=) :: DocLoc -> DocLoc -> Bool # max :: DocLoc -> DocLoc -> DocLoc # min :: DocLoc -> DocLoc -> DocLoc #
Ord Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Exp -> Exp -> Ordering # (<) :: Exp -> Exp -> Bool # (<=) :: Exp -> Exp -> Bool # (>) :: Exp -> Exp -> Bool # (>=) :: Exp -> Exp -> Bool # max :: Exp -> Exp -> Exp # min :: Exp -> Exp -> Exp #
Ord FamilyResultSig
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord FixityDirection
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Foreign -> Foreign -> Ordering # (<) :: Foreign -> Foreign -> Bool # (<=) :: Foreign -> Foreign -> Bool # (>) :: Foreign -> Foreign -> Bool # (>=) :: Foreign -> Foreign -> Bool # max :: Foreign -> Foreign -> Foreign # min :: Foreign -> Foreign -> Foreign #
Ord FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FunDep -> FunDep -> Ordering # (<) :: FunDep -> FunDep -> Bool # (<=) :: FunDep -> FunDep -> Bool # (>) :: FunDep -> FunDep -> Bool # (>=) :: FunDep -> FunDep -> Bool # max :: FunDep -> FunDep -> FunDep # min :: FunDep -> FunDep -> FunDep #
Ord Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Guard -> Guard -> Ordering # (<) :: Guard -> Guard -> Bool # (<=) :: Guard -> Guard -> Bool # (>) :: Guard -> Guard -> Bool # (>=) :: Guard -> Guard -> Bool # max :: Guard -> Guard -> Guard # min :: Guard -> Guard -> Guard #
Ord Info
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Info -> Info -> Ordering # (<) :: Info -> Info -> Bool # (<=) :: Info -> Info -> Bool # (>) :: Info -> Info -> Bool # (>=) :: Info -> Info -> Bool # max :: Info -> Info -> Info # min :: Info -> Info -> Info #
Ord InjectivityAnn
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Inline -> Inline -> Ordering # (<) :: Inline -> Inline -> Bool # (<=) :: Inline -> Inline -> Bool # (>) :: Inline -> Inline -> Bool # (>=) :: Inline -> Inline -> Bool # max :: Inline -> Inline -> Inline # min :: Inline -> Inline -> Inline #
Ord Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Lit -> Lit -> Ordering # (<) :: Lit -> Lit -> Bool # (<=) :: Lit -> Lit -> Bool # (>) :: Lit -> Lit -> Bool # (>=) :: Lit -> Lit -> Bool # max :: Lit -> Lit -> Lit # min :: Lit -> Lit -> Lit #
Ord Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Loc -> Loc -> Ordering # (<) :: Loc -> Loc -> Bool # (<=) :: Loc -> Loc -> Bool # (>) :: Loc -> Loc -> Bool # (>=) :: Loc -> Loc -> Bool # max :: Loc -> Loc -> Loc # min :: Loc -> Loc -> Loc #
Ord Match
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Match -> Match -> Ordering # (<) :: Match -> Match -> Bool # (<=) :: Match -> Match -> Bool # (>) :: Match -> Match -> Bool # (>=) :: Match -> Match -> Bool # max :: Match -> Match -> Match # min :: Match -> Match -> Match #
Ord ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModName -> ModName -> Ordering # (<) :: ModName -> ModName -> Bool # (<=) :: ModName -> ModName -> Bool # (>) :: ModName -> ModName -> Bool # (>=) :: ModName -> ModName -> Bool # max :: ModName -> ModName -> ModName # min :: ModName -> ModName -> ModName #
Ord Module
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Module -> Module -> Ordering # (<) :: Module -> Module -> Bool # (<=) :: Module -> Module -> Bool # (>) :: Module -> Module -> Bool # (>=) :: Module -> Module -> Bool # max :: Module -> Module -> Module # min :: Module -> Module -> Module #
Ord ModuleInfo
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
Ord NameFlavour
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: NameSpace -> NameSpace -> Ordering # (<) :: NameSpace -> NameSpace -> Bool # (<=) :: NameSpace -> NameSpace -> Bool # (>) :: NameSpace -> NameSpace -> Bool # (>=) :: NameSpace -> NameSpace -> Bool # max :: NameSpace -> NameSpace -> NameSpace # min :: NameSpace -> NameSpace -> NameSpace #
Ord OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: OccName -> OccName -> Ordering # (<) :: OccName -> OccName -> Bool # (<=) :: OccName -> OccName -> Bool # (>) :: OccName -> OccName -> Bool # (>=) :: OccName -> OccName -> Bool # max :: OccName -> OccName -> OccName # min :: OccName -> OccName -> OccName #
Ord Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Overlap -> Overlap -> Ordering # (<) :: Overlap -> Overlap -> Bool # (<=) :: Overlap -> Overlap -> Bool # (>) :: Overlap -> Overlap -> Bool # (>=) :: Overlap -> Overlap -> Bool # max :: Overlap -> Overlap -> Overlap # min :: Overlap -> Overlap -> Overlap #
Ord Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pat -> Pat -> Ordering # (<) :: Pat -> Pat -> Bool # (<=) :: Pat -> Pat -> Bool # (>) :: Pat -> Pat -> Bool # (>=) :: Pat -> Pat -> Bool # max :: Pat -> Pat -> Pat # min :: Pat -> Pat -> Pat #
Ord PatSynArgs
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynDir -> PatSynDir -> Ordering # (<) :: PatSynDir -> PatSynDir -> Bool # (<=) :: PatSynDir -> PatSynDir -> Bool # (>) :: PatSynDir -> PatSynDir -> Bool # (>=) :: PatSynDir -> PatSynDir -> Bool # max :: PatSynDir -> PatSynDir -> PatSynDir # min :: PatSynDir -> PatSynDir -> PatSynDir #
Ord Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Phases -> Phases -> Ordering # (<) :: Phases -> Phases -> Bool # (<=) :: Phases -> Phases -> Bool # (>) :: Phases -> Phases -> Bool # (>=) :: Phases -> Phases -> Bool # max :: Phases -> Phases -> Phases # min :: Phases -> Phases -> Phases #
Ord PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PkgName -> PkgName -> Ordering # (<) :: PkgName -> PkgName -> Bool # (<=) :: PkgName -> PkgName -> Bool # (>) :: PkgName -> PkgName -> Bool # (>=) :: PkgName -> PkgName -> Bool # max :: PkgName -> PkgName -> PkgName # min :: PkgName -> PkgName -> PkgName #
Ord Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pragma -> Pragma -> Ordering # (<) :: Pragma -> Pragma -> Bool # (<=) :: Pragma -> Pragma -> Bool # (>) :: Pragma -> Pragma -> Bool # (>=) :: Pragma -> Pragma -> Bool # max :: Pragma -> Pragma -> Pragma # min :: Pragma -> Pragma -> Pragma #
Ord Range
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Range -> Range -> Ordering # (<) :: Range -> Range -> Bool # (<=) :: Range -> Range -> Bool # (>) :: Range -> Range -> Bool # (>=) :: Range -> Range -> Bool # max :: Range -> Range -> Range # min :: Range -> Range -> Range #
Ord Role
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Role -> Role -> Ordering # (<) :: Role -> Role -> Bool # (<=) :: Role -> Role -> Bool # (>) :: Role -> Role -> Bool # (>=) :: Role -> Role -> Bool # max :: Role -> Role -> Role # min :: Role -> Role -> Role #
Ord RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleBndr -> RuleBndr -> Ordering # (<) :: RuleBndr -> RuleBndr -> Bool # (<=) :: RuleBndr -> RuleBndr -> Bool # (>) :: RuleBndr -> RuleBndr -> Bool # (>=) :: RuleBndr -> RuleBndr -> Bool # max :: RuleBndr -> RuleBndr -> RuleBndr # min :: RuleBndr -> RuleBndr -> RuleBndr #
Ord RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleMatch -> RuleMatch -> Ordering # (<) :: RuleMatch -> RuleMatch -> Bool # (<=) :: RuleMatch -> RuleMatch -> Bool # (>) :: RuleMatch -> RuleMatch -> Bool # (>=) :: RuleMatch -> RuleMatch -> Bool # max :: RuleMatch -> RuleMatch -> RuleMatch # min :: RuleMatch -> RuleMatch -> RuleMatch #
Ord Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Safety -> Safety -> Ordering # (<) :: Safety -> Safety -> Bool # (<=) :: Safety -> Safety -> Bool # (>) :: Safety -> Safety -> Bool # (>=) :: Safety -> Safety -> Bool # max :: Safety -> Safety -> Safety # min :: Safety -> Safety -> Safety #
Ord SourceStrictness
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Stmt -> Stmt -> Ordering # (<) :: Stmt -> Stmt -> Bool # (<=) :: Stmt -> Stmt -> Bool # (>) :: Stmt -> Stmt -> Bool # (>=) :: Stmt -> Stmt -> Bool # max :: Stmt -> Stmt -> Stmt # min :: Stmt -> Stmt -> Stmt #
Ord TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyLit -> TyLit -> Ordering # (<) :: TyLit -> TyLit -> Bool # (<=) :: TyLit -> TyLit -> Bool # (>) :: TyLit -> TyLit -> Bool # (>=) :: TyLit -> TyLit -> Bool # max :: TyLit -> TyLit -> TyLit # min :: TyLit -> TyLit -> TyLit #
Ord TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TySynEqn -> TySynEqn -> Ordering # (<) :: TySynEqn -> TySynEqn -> Bool # (<=) :: TySynEqn -> TySynEqn -> Bool # (>) :: TySynEqn -> TySynEqn -> Bool # (>=) :: TySynEqn -> TySynEqn -> Bool # max :: TySynEqn -> TySynEqn -> TySynEqn # min :: TySynEqn -> TySynEqn -> TySynEqn #
Ord Type
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Type -> Type -> Ordering # (<) :: Type -> Type -> Bool # (<=) :: Type -> Type -> Bool # (>) :: Type -> Type -> Bool # (>=) :: Type -> Type -> Bool # max :: Type -> Type -> Type # min :: Type -> Type -> Type #
Ord TypeFamilyHead
Instance details 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
Instance details Defined in Data.Text.Internal.Builder Methods compare :: Builder -> Builder -> Ordering # (<) :: Builder -> Builder -> Bool # (<=) :: Builder -> Builder -> Bool # (>) :: Builder -> Builder -> Bool # (>=) :: Builder -> Builder -> Bool # max :: Builder -> Builder -> Builder # min :: Builder -> Builder -> Builder #
Ord B
Instance details Defined in Data.Text.Short.Internal Methods compare :: B -> B -> Ordering # (<) :: B -> B -> Bool # (<=) :: B -> B -> Bool # (>) :: B -> B -> Bool # (>=) :: B -> B -> Bool # max :: B -> B -> B # min :: B -> B -> B #
Ord ShortText
Instance details Defined in Data.Text.Short.Internal Methods compare :: ShortText -> ShortText -> Ordering # (<) :: ShortText -> ShortText -> Bool # (<=) :: ShortText -> ShortText -> Bool # (>) :: ShortText -> ShortText -> Bool # (>=) :: ShortText -> ShortText -> Bool # max :: ShortText -> ShortText -> ShortText # min :: ShortText -> ShortText -> ShortText #
Ord ConstructorVariant
Instance details 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
Instance details 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
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods compare :: UTCTime -> UTCTime -> Ordering # (<) :: UTCTime -> UTCTime -> Bool # (<=) :: UTCTime -> UTCTime -> Bool # (>) :: UTCTime -> UTCTime -> Bool # (>=) :: UTCTime -> UTCTime -> Bool # max :: UTCTime -> UTCTime -> UTCTime # min :: UTCTime -> UTCTime -> UTCTime #
Ord LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods compare :: LocalTime -> LocalTime -> Ordering # (<) :: LocalTime -> LocalTime -> Bool # (<=) :: LocalTime -> LocalTime -> Bool # (>) :: LocalTime -> LocalTime -> Bool # (>=) :: LocalTime -> LocalTime -> Bool # max :: LocalTime -> LocalTime -> LocalTime # min :: LocalTime -> LocalTime -> LocalTime #
Ord Undefined
Instance details Defined in Universum.Debug Methods compare :: Undefined -> Undefined -> Ordering # (<) :: Undefined -> Undefined -> Bool # (<=) :: Undefined -> Undefined -> Bool # (>) :: Undefined -> Undefined -> Bool # (>=) :: Undefined -> Undefined -> Bool # max :: Undefined -> Undefined -> Undefined # min :: Undefined -> Undefined -> Undefined #
Ord UUID
Instance details Defined in Data.UUID.Types.Internal Methods compare :: UUID -> UUID -> Ordering # (<) :: UUID -> UUID -> Bool # (<=) :: UUID -> UUID -> Bool # (>) :: UUID -> UUID -> Bool # (>=) :: UUID -> UUID -> Bool # max :: UUID -> UUID -> UUID # min :: UUID -> UUID -> UUID #
Ord UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods compare :: UnpackedUUID -> UnpackedUUID -> Ordering # (<) :: UnpackedUUID -> UnpackedUUID -> Bool # (<=) :: UnpackedUUID -> UnpackedUUID -> Bool # (>) :: UnpackedUUID -> UnpackedUUID -> Bool # (>=) :: UnpackedUUID -> UnpackedUUID -> Bool # max :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID # min :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #
Ord Integer
Instance details Defined in GHC.Num.Integer Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Ord Natural
Instance details Defined in GHC.Num.Natural Methods compare :: Natural -> Natural -> Ordering # (<) :: Natural -> Natural -> Bool # (<=) :: Natural -> Natural -> Bool # (>) :: Natural -> Natural -> Bool # (>=) :: Natural -> Natural -> Bool # max :: Natural -> Natural -> Natural # min :: Natural -> Natural -> Natural #
Ord ()
Instance details Defined in GHC.Classes Methods compare :: () -> () -> Ordering # (<) :: () -> () -> Bool # (<=) :: () -> () -> Bool # (>) :: () -> () -> Bool # (>=) :: () -> () -> Bool # max :: () -> () -> () # min :: () -> () -> () #
Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Ord Char
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering # (<) :: Char -> Char -> Bool # (<=) :: Char -> Char -> Bool # (>) :: Char -> Char -> Bool # (>=) :: Char -> Char -> Bool # max :: Char -> Char -> Char # min :: Char -> Char -> Char #
Ord Double	Note that due to the presence of `NaN`, `Double`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Double)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Double`'s instance: `>>>` `(0/0 :: Double) > 1`False `>>>` `compare (0/0 :: Double) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering # (<) :: Double -> Double -> Bool # (<=) :: Double -> Double -> Bool # (>) :: Double -> Double -> Bool # (>=) :: Double -> Double -> Bool # max :: Double -> Double -> Double # min :: Double -> Double -> Double #
Ord Float	Note that due to the presence of `NaN`, `Float`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Float)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Float`'s instance: `>>>` `(0/0 :: Float) > 1`False `>>>` `compare (0/0 :: Float) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering # (<) :: Float -> Float -> Bool # (<=) :: Float -> Float -> Bool # (>) :: Float -> Float -> Bool # (>=) :: Float -> Float -> Bool # max :: Float -> Float -> Float # min :: Float -> Float -> Float #
Ord Int
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering # (<) :: Int -> Int -> Bool # (<=) :: Int -> Int -> Bool # (>) :: Int -> Int -> Bool # (>=) :: Int -> Int -> Bool # max :: Int -> Int -> Int # min :: Int -> Int -> Int #
Ord Word
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering # (<) :: Word -> Word -> Bool # (<=) :: Word -> Word -> Bool # (>) :: Word -> Word -> Bool # (>=) :: Word -> Word -> Bool # max :: Word -> Word -> Word # min :: Word -> Word -> Word #
() :=> (Ord (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (a :- b) #
() :=> (Ord (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (Dict a) #
() :=> (Ord Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Integer #
() :=> (Ord Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Natural #
() :=> (Ord ())
Instance details Defined in Data.Constraint Methods ins :: () :- Ord () #
() :=> (Ord Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Bool #
() :=> (Ord Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Char #
() :=> (Ord Double)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Double #
() :=> (Ord Float)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Float #
() :=> (Ord Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Int #
() :=> (Ord Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Word #
Ord a => Ord (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: First' a -> First' a -> Ordering # (<) :: First' a -> First' a -> Bool # (<=) :: First' a -> First' a -> Bool # (>) :: First' a -> First' a -> Bool # (>=) :: First' a -> First' a -> Bool # max :: First' a -> First' a -> First' a # min :: First' a -> First' a -> First' a #
Ord a => Ord (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: Last' a -> Last' a -> Ordering # (<) :: Last' a -> Last' a -> Bool # (<=) :: Last' a -> Last' a -> Bool # (>) :: Last' a -> Last' a -> Bool # (>=) :: Last' a -> Last' a -> Bool # max :: Last' a -> Last' a -> Last' a # min :: Last' a -> Last' a -> Last' a #
Ord a => Ord (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: Option' a -> Option' a -> Ordering # (<) :: Option' a -> Option' a -> Bool # (<=) :: Option' a -> Option' a -> Bool # (>) :: Option' a -> Option' a -> Bool # (>=) :: Option' a -> Option' a -> Bool # max :: Option' a -> Option' a -> Option' a # min :: Option' a -> Option' a -> Option' a #
Ord a => Ord (Only a)
Instance details Defined in Data.Tuple.Only Methods compare :: Only a -> Only a -> Ordering # (<) :: Only a -> Only a -> Bool # (<=) :: Only a -> Only a -> Bool # (>) :: Only a -> Only a -> Bool # (>=) :: Only a -> Only a -> Bool # max :: Only a -> Only a -> Only a # min :: Only a -> Only a -> Only a #
Ord v => Ord (KeyMap v)
Instance details Defined in Data.Aeson.KeyMap Methods compare :: KeyMap v -> KeyMap v -> Ordering # (<) :: KeyMap v -> KeyMap v -> Bool # (<=) :: KeyMap v -> KeyMap v -> Bool # (>) :: KeyMap v -> KeyMap v -> Bool # (>=) :: KeyMap v -> KeyMap v -> Bool # max :: KeyMap v -> KeyMap v -> KeyMap v # min :: KeyMap v -> KeyMap v -> KeyMap v #
Ord a => Ord (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods compare :: ZipList a -> ZipList a -> Ordering # (<) :: ZipList a -> ZipList a -> Bool # (<=) :: ZipList a -> ZipList a -> Bool # (>) :: ZipList a -> ZipList a -> Bool # (>=) :: ZipList a -> ZipList a -> Bool # max :: ZipList a -> ZipList a -> ZipList a # min :: ZipList a -> ZipList a -> ZipList a #
Ord a => Ord (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Ord a => Ord (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord a => Ord (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord a => Ord (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods compare :: Down a -> Down a -> Ordering # (<) :: Down a -> Down a -> Bool # (<=) :: Down a -> Down a -> Bool # (>) :: Down a -> Down a -> Bool # (>=) :: Down a -> Down a -> Bool # max :: Down a -> Down a -> Down a # min :: Down a -> Down a -> Down a #
Ord a => Ord (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord a => Ord (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord a => Ord (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Max a -> Max a -> Ordering # (<) :: Max a -> Max a -> Bool # (<=) :: Max a -> Max a -> Bool # (>) :: Max a -> Max a -> Bool # (>=) :: Max a -> Max a -> Bool # max :: Max a -> Max a -> Max a # min :: Max a -> Max a -> Max a #
Ord a => Ord (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Min a -> Min a -> Ordering # (<) :: Min a -> Min a -> Bool # (<=) :: Min a -> Min a -> Bool # (>) :: Min a -> Min a -> Bool # (>=) :: Min a -> Min a -> Bool # max :: Min a -> Min a -> Min a # min :: Min a -> Min a -> Min a #
Ord m => Ord (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.Semigroup.Internal Methods compare :: Dual a -> Dual a -> Ordering # (<) :: Dual a -> Dual a -> Bool # (<=) :: Dual a -> Dual a -> Bool # (>) :: Dual a -> Dual a -> Bool # (>=) :: Dual a -> Dual a -> Bool # max :: Dual a -> Dual a -> Dual a # min :: Dual a -> Dual a -> Dual a #
Ord a => Ord (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Product a -> Product a -> Ordering # (<) :: Product a -> Product a -> Bool # (<=) :: Product a -> Product a -> Bool # (>) :: Product a -> Product a -> Bool # (>=) :: Product a -> Product a -> Bool # max :: Product a -> Product a -> Product a # min :: Product a -> Product a -> Product a #
Ord a => Ord (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Sum a -> Sum a -> Ordering # (<) :: Sum a -> Sum a -> Bool # (<=) :: Sum a -> Sum a -> Bool # (>) :: Sum a -> Sum a -> Bool # (>=) :: Sum a -> Sum a -> Bool # max :: Sum a -> Sum a -> Sum a # min :: Sum a -> Sum a -> Sum a #
Ord p => Ord (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Par1 p -> Par1 p -> Ordering # (<) :: Par1 p -> Par1 p -> Bool # (<=) :: Par1 p -> Par1 p -> Bool # (>) :: Par1 p -> Par1 p -> Bool # (>=) :: Par1 p -> Par1 p -> Bool # max :: Par1 p -> Par1 p -> Par1 p # min :: Par1 p -> Par1 p -> Par1 p #
Ord (FunPtr a)
Instance details Defined in GHC.Ptr Methods compare :: FunPtr a -> FunPtr a -> Ordering # (<) :: FunPtr a -> FunPtr a -> Bool # (<=) :: FunPtr a -> FunPtr a -> Bool # (>) :: FunPtr a -> FunPtr a -> Bool # (>=) :: FunPtr a -> FunPtr a -> Bool # max :: FunPtr a -> FunPtr a -> FunPtr a # min :: FunPtr a -> FunPtr a -> FunPtr a #
Ord (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods compare :: Ptr a -> Ptr a -> Ordering # (<) :: Ptr a -> Ptr a -> Bool # (<=) :: Ptr a -> Ptr a -> Bool # (>) :: Ptr a -> Ptr a -> Bool # (>=) :: Ptr a -> Ptr a -> Bool # max :: Ptr a -> Ptr a -> Ptr a # min :: Ptr a -> Ptr a -> Ptr a #
Integral a => Ord (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods compare :: Ratio a -> Ratio a -> Ordering # (<) :: Ratio a -> Ratio a -> Bool # (<=) :: Ratio a -> Ratio a -> Bool # (>) :: Ratio a -> Ratio a -> Bool # (>=) :: Ratio a -> Ratio a -> Bool # max :: Ratio a -> Ratio a -> Ratio a # min :: Ratio a -> Ratio a -> Ratio a #
Ord (Bits n)
Instance details Defined in Basement.Bits Methods compare :: Bits n -> Bits n -> Ordering # (<) :: Bits n -> Bits n -> Bool # (<=) :: Bits n -> Bits n -> Bool # (>) :: Bits n -> Bits n -> Bool # (>=) :: Bits n -> Bits n -> Bool # max :: Bits n -> Bits n -> Bits n # min :: Bits n -> Bits n -> Bits n #
(PrimType ty, Ord ty) => Ord (Block ty)
Instance details Defined in Basement.Block.Base Methods compare :: Block ty -> Block ty -> Ordering # (<) :: Block ty -> Block ty -> Bool # (<=) :: Block ty -> Block ty -> Bool # (>) :: Block ty -> Block ty -> Bool # (>=) :: Block ty -> Block ty -> Bool # max :: Block ty -> Block ty -> Block ty # min :: Block ty -> Block ty -> Block ty #
Ord (Zn n)
Instance details Defined in Basement.Bounded Methods compare :: Zn n -> Zn n -> Ordering # (<) :: Zn n -> Zn n -> Bool # (<=) :: Zn n -> Zn n -> Bool # (>) :: Zn n -> Zn n -> Bool # (>=) :: Zn n -> Zn n -> Bool # max :: Zn n -> Zn n -> Zn n # min :: Zn n -> Zn n -> Zn n #
Ord (Zn64 n)
Instance details Defined in Basement.Bounded Methods compare :: Zn64 n -> Zn64 n -> Ordering # (<) :: Zn64 n -> Zn64 n -> Bool # (<=) :: Zn64 n -> Zn64 n -> Bool # (>) :: Zn64 n -> Zn64 n -> Bool # (>=) :: Zn64 n -> Zn64 n -> Bool # max :: Zn64 n -> Zn64 n -> Zn64 n # min :: Zn64 n -> Zn64 n -> Zn64 n #
Ord a => Ord (Array a)
Instance details Defined in Basement.BoxedArray Methods compare :: Array a -> Array a -> Ordering # (<) :: Array a -> Array a -> Bool # (<=) :: Array a -> Array a -> Bool # (>) :: Array a -> Array a -> Bool # (>=) :: Array a -> Array a -> Bool # max :: Array a -> Array a -> Array a # min :: Array a -> Array a -> Array a #
Ord (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods compare :: CountOf ty -> CountOf ty -> Ordering # (<) :: CountOf ty -> CountOf ty -> Bool # (<=) :: CountOf ty -> CountOf ty -> Bool # (>) :: CountOf ty -> CountOf ty -> Bool # (>=) :: CountOf ty -> CountOf ty -> Bool # max :: CountOf ty -> CountOf ty -> CountOf ty # min :: CountOf ty -> CountOf ty -> CountOf ty #
Ord (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods compare :: Offset ty -> Offset ty -> Ordering # (<) :: Offset ty -> Offset ty -> Bool # (<=) :: Offset ty -> Offset ty -> Bool # (>) :: Offset ty -> Offset ty -> Bool # (>=) :: Offset ty -> Offset ty -> Bool # max :: Offset ty -> Offset ty -> Offset ty # min :: Offset ty -> Offset ty -> Offset ty #
(PrimType ty, Ord ty) => Ord (UArray ty)
Instance details Defined in Basement.UArray.Base Methods compare :: UArray ty -> UArray ty -> Ordering # (<) :: UArray ty -> UArray ty -> Bool # (<=) :: UArray ty -> UArray ty -> Bool # (>) :: UArray ty -> UArray ty -> Bool # (>=) :: UArray ty -> UArray ty -> Bool # max :: UArray ty -> UArray ty -> UArray ty # min :: UArray ty -> UArray ty -> UArray ty #
Ord (Dict a)
Instance details Defined in Data.Constraint Methods compare :: Dict a -> Dict a -> Ordering # (<) :: Dict a -> Dict a -> Bool # (<=) :: Dict a -> Dict a -> Bool # (>) :: Dict a -> Dict a -> Bool # (>=) :: Dict a -> Dict a -> Bool # max :: Dict a -> Dict a -> Dict a # min :: Dict a -> Dict a -> Dict a #
Ord a => Ord (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods compare :: IntMap a -> IntMap a -> Ordering # (<) :: IntMap a -> IntMap a -> Bool # (<=) :: IntMap a -> IntMap a -> Bool # (>) :: IntMap a -> IntMap a -> Bool # (>=) :: IntMap a -> IntMap a -> Bool # max :: IntMap a -> IntMap a -> IntMap a # min :: IntMap a -> IntMap a -> IntMap a #
Ord a => Ord (Seq a)
Instance details Defined in Data.Sequence.Internal Methods compare :: Seq a -> Seq a -> Ordering # (<) :: Seq a -> Seq a -> Bool # (<=) :: Seq a -> Seq a -> Bool # (>) :: Seq a -> Seq a -> Bool # (>=) :: Seq a -> Seq a -> Bool # max :: Seq a -> Seq a -> Seq a # min :: Seq a -> Seq a -> Seq a #
Ord a => Ord (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewL a -> ViewL a -> Ordering # (<) :: ViewL a -> ViewL a -> Bool # (<=) :: ViewL a -> ViewL a -> Bool # (>) :: ViewL a -> ViewL a -> Bool # (>=) :: ViewL a -> ViewL a -> Bool # max :: ViewL a -> ViewL a -> ViewL a # min :: ViewL a -> ViewL a -> ViewL a #
Ord a => Ord (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewR a -> ViewR a -> Ordering # (<) :: ViewR a -> ViewR a -> Bool # (<=) :: ViewR a -> ViewR a -> Bool # (>) :: ViewR a -> ViewR a -> Bool # (>=) :: ViewR a -> ViewR a -> Bool # max :: ViewR a -> ViewR a -> ViewR a # min :: ViewR a -> ViewR a -> ViewR a #
Ord a => Ord (Intersection a)
Instance details 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)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
Ord a => Ord (Tree a)	Since: containers-0.6.5
Instance details Defined in Data.Tree Methods compare :: Tree a -> Tree a -> Ordering # (<) :: Tree a -> Tree a -> Bool # (<=) :: Tree a -> Tree a -> Bool # (>) :: Tree a -> Tree a -> Bool # (>=) :: Tree a -> Tree a -> Bool # max :: Tree a -> Tree a -> Tree a # min :: Tree a -> Tree a -> Tree a #
Ord (Digest a)
Instance details Defined in Crypto.Hash.Types Methods compare :: Digest a -> Digest a -> Ordering # (<) :: Digest a -> Digest a -> Bool # (<=) :: Digest a -> Digest a -> Bool # (>) :: Digest a -> Digest a -> Bool # (>=) :: Digest a -> Digest a -> Bool # max :: Digest a -> Digest a -> Digest a # min :: Digest a -> Digest a -> Digest a #
Ord1 f => Ord (Fix f)
Instance details Defined in Data.Fix Methods compare :: Fix f -> Fix f -> Ordering # (<) :: Fix f -> Fix f -> Bool # (<=) :: Fix f -> Fix f -> Bool # (>) :: Fix f -> Fix f -> Bool # (>=) :: Fix f -> Fix f -> Bool # max :: Fix f -> Fix f -> Fix f # min :: Fix f -> Fix f -> Fix f #
(Functor f, Ord1 f) => Ord (Mu f)
Instance details Defined in Data.Fix Methods compare :: Mu f -> Mu f -> Ordering # (<) :: Mu f -> Mu f -> Bool # (<=) :: Mu f -> Mu f -> Bool # (>) :: Mu f -> Mu f -> Bool # (>=) :: Mu f -> Mu f -> Bool # max :: Mu f -> Mu f -> Mu f # min :: Mu f -> Mu f -> Mu f #
(Functor f, Ord1 f) => Ord (Nu f)
Instance details Defined in Data.Fix Methods compare :: Nu f -> Nu f -> Ordering # (<) :: Nu f -> Nu f -> Bool # (<=) :: Nu f -> Nu f -> Bool # (>) :: Nu f -> Nu f -> Bool # (>=) :: Nu f -> Nu f -> Bool # max :: Nu f -> Nu f -> Nu f # min :: Nu f -> Nu f -> Nu f #
Ord a => Ord (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods compare :: DNonEmpty a -> DNonEmpty a -> Ordering # (<) :: DNonEmpty a -> DNonEmpty a -> Bool # (<=) :: DNonEmpty a -> DNonEmpty a -> Bool # (>) :: DNonEmpty a -> DNonEmpty a -> Bool # (>=) :: DNonEmpty a -> DNonEmpty a -> Bool # max :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a # min :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a #
Ord a => Ord (DList a)
Instance details Defined in Data.DList.Internal Methods compare :: DList a -> DList a -> Ordering # (<) :: DList a -> DList a -> Bool # (<=) :: DList a -> DList a -> Bool # (>) :: DList a -> DList a -> Bool # (>=) :: DList a -> DList a -> Bool # max :: DList a -> DList a -> DList a # min :: DList a -> DList a -> DList a #
Ord (Finite n)
Instance details Defined in Data.Finite.Internal Methods compare :: Finite n -> Finite n -> Ordering # (<) :: Finite n -> Finite n -> Bool # (<=) :: Finite n -> Finite n -> Bool # (>) :: Finite n -> Finite n -> Bool # (>=) :: Finite n -> Finite n -> Bool # max :: Finite n -> Finite n -> Finite n # min :: Finite n -> Finite n -> Finite n #
Ord (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods compare :: Binary p -> Binary p -> Ordering # (<) :: Binary p -> Binary p -> Bool # (<=) :: Binary p -> Binary p -> Bool # (>) :: Binary p -> Binary p -> Bool # (>=) :: Binary p -> Binary p -> Bool # max :: Binary p -> Binary p -> Binary p # min :: Binary p -> Binary p -> Binary p #
Ord (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods compare :: Prime p -> Prime p -> Ordering # (<) :: Prime p -> Prime p -> Bool # (<=) :: Prime p -> Prime p -> Bool # (>) :: Prime p -> Prime p -> Bool # (>=) :: Prime p -> Prime p -> Bool # max :: Prime p -> Prime p -> Prime p # min :: Prime p -> Prime p -> Prime p #
Ord a => Ord (Hashed a)
Instance details Defined in Data.Hashable.Class Methods compare :: Hashed a -> Hashed a -> Ordering # (<) :: Hashed a -> Hashed a -> Bool # (<=) :: Hashed a -> Hashed a -> Bool # (>) :: Hashed a -> Hashed a -> Bool # (>=) :: Hashed a -> Hashed a -> Bool # max :: Hashed a -> Hashed a -> Hashed a # min :: Hashed a -> Hashed a -> Hashed a #
Ord (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Packed a -> Packed a -> Ordering # (<) :: Packed a -> Packed a -> Bool # (<=) :: Packed a -> Packed a -> Bool # (>) :: Packed a -> Packed a -> Bool # (>=) :: Packed a -> Packed a -> Bool # max :: Packed a -> Packed a -> Packed a # min :: Packed a -> Packed a -> Packed a #
Ord a => Ord (ReadTicket a) Source #
Instance details 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)
Instance details 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)
Instance details Defined in Text.Megaparsec.Error Methods compare :: ErrorItem t -> ErrorItem t -> Ordering # (<) :: ErrorItem t -> ErrorItem t -> Bool # (<=) :: ErrorItem t -> ErrorItem t -> Bool # (>) :: ErrorItem t -> ErrorItem t -> Bool # (>=) :: ErrorItem t -> ErrorItem t -> Bool # max :: ErrorItem t -> ErrorItem t -> ErrorItem t # min :: ErrorItem t -> ErrorItem t -> ErrorItem t #
Ord (Mod m)
Instance details Defined in Data.Mod Methods compare :: Mod m -> Mod m -> Ordering # (<) :: Mod m -> Mod m -> Bool # (<=) :: Mod m -> Mod m -> Bool # (>) :: Mod m -> Mod m -> Bool # (>=) :: Mod m -> Mod m -> Bool # max :: Mod m -> Mod m -> Mod m # min :: Mod m -> Mod m -> Mod m #
Ord a => Ord (StringEncode a)
Instance details 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 # max :: StringEncode a -> StringEncode a -> StringEncode a # min :: StringEncode a -> StringEncode a -> StringEncode a #
Ord (KindedAddress kind)
Instance details 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)
Instance details Defined in Morley.Tezos.Crypto Methods compare :: Hash kind -> Hash kind -> Ordering # (<) :: Hash kind -> Hash kind -> Bool # (<=) :: Hash kind -> Hash kind -> Bool # (>) :: Hash kind -> Hash kind -> Bool # (>=) :: Hash kind -> Hash kind -> Bool # max :: Hash kind -> Hash kind -> Hash kind # min :: Hash kind -> Hash kind -> Hash kind #
Ord (HashTag kind)
Instance details Defined in Morley.Tezos.Crypto Methods compare :: HashTag kind -> HashTag kind -> Ordering # (<) :: HashTag kind -> HashTag kind -> Bool # (<=) :: HashTag kind -> HashTag kind -> Bool # (>) :: HashTag kind -> HashTag kind -> Bool # (>=) :: HashTag kind -> HashTag kind -> Bool # max :: HashTag kind -> HashTag kind -> HashTag kind # min :: HashTag kind -> HashTag kind -> HashTag kind #
Ord a => Ord (All a)
Instance details Defined in Morley.Prelude.Boolean Methods compare :: All a -> All a -> Ordering # (<) :: All a -> All a -> Bool # (<=) :: All a -> All a -> Bool # (>) :: All a -> All a -> Bool # (>=) :: All a -> All a -> Bool # max :: All a -> All a -> All a # min :: All a -> All a -> All a #
Ord a => Ord (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods compare :: Any a -> Any a -> Ordering # (<) :: Any a -> Any a -> Bool # (<=) :: Any a -> Any a -> Bool # (>) :: Any a -> Any a -> Bool # (>=) :: Any a -> Any a -> Bool # max :: Any a -> Any a -> Any a # min :: Any a -> Any a -> Any a #
Ord ann => Ord (SimpleDocStream ann)
Instance details 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.
Instance details Defined in Data.Primitive.Array Methods compare :: Array a -> Array a -> Ordering # (<) :: Array a -> Array a -> Bool # (<=) :: Array a -> Array a -> Bool # (>) :: Array a -> Array a -> Bool # (>=) :: Array a -> Array a -> Bool # max :: Array a -> Array a -> Array a # min :: Array a -> Array a -> Array a #
(Ord a, Prim a) => Ord (PrimArray a)	Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods compare :: PrimArray a -> PrimArray a -> Ordering # (<) :: PrimArray a -> PrimArray a -> Bool # (<=) :: PrimArray a -> PrimArray a -> Bool # (>) :: PrimArray a -> PrimArray a -> Bool # (>=) :: PrimArray a -> PrimArray a -> Bool # max :: PrimArray a -> PrimArray a -> PrimArray a # min :: PrimArray a -> PrimArray a -> PrimArray a #
Ord a => Ord (SmallArray a)	Lexicographic ordering. Subject to change between major versions.
Instance details 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)
Instance details Defined in System.Random.Internal Methods compare :: StateGen g -> StateGen g -> Ordering # (<) :: StateGen g -> StateGen g -> Bool # (<=) :: StateGen g -> StateGen g -> Bool # (>) :: StateGen g -> StateGen g -> Bool # (>=) :: StateGen g -> StateGen g -> Bool # max :: StateGen g -> StateGen g -> StateGen g # min :: StateGen g -> StateGen g -> StateGen g #
Ord g => Ord (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods compare :: AtomicGen g -> AtomicGen g -> Ordering # (<) :: AtomicGen g -> AtomicGen g -> Bool # (<=) :: AtomicGen g -> AtomicGen g -> Bool # (>) :: AtomicGen g -> AtomicGen g -> Bool # (>=) :: AtomicGen g -> AtomicGen g -> Bool # max :: AtomicGen g -> AtomicGen g -> AtomicGen g # min :: AtomicGen g -> AtomicGen g -> AtomicGen g #
Ord g => Ord (IOGen g)
Instance details Defined in System.Random.Stateful Methods compare :: IOGen g -> IOGen g -> Ordering # (<) :: IOGen g -> IOGen g -> Bool # (<=) :: IOGen g -> IOGen g -> Bool # (>) :: IOGen g -> IOGen g -> Bool # (>=) :: IOGen g -> IOGen g -> Bool # max :: IOGen g -> IOGen g -> IOGen g # min :: IOGen g -> IOGen g -> IOGen g #
Ord g => Ord (STGen g)
Instance details Defined in System.Random.Stateful Methods compare :: STGen g -> STGen g -> Ordering # (<) :: STGen g -> STGen g -> Bool # (<=) :: STGen g -> STGen g -> Bool # (>) :: STGen g -> STGen g -> Bool # (>=) :: STGen g -> STGen g -> Bool # max :: STGen g -> STGen g -> STGen g # min :: STGen g -> STGen g -> STGen g #
Ord g => Ord (TGen g)
Instance details Defined in System.Random.Stateful Methods compare :: TGen g -> TGen g -> Ordering # (<) :: TGen g -> TGen g -> Bool # (<=) :: TGen g -> TGen g -> Bool # (>) :: TGen g -> TGen g -> Bool # (>=) :: TGen g -> TGen g -> Bool # max :: TGen g -> TGen g -> TGen g # min :: TGen g -> TGen g -> TGen g #
Ord a => Ord (Add a)
Instance details Defined in Data.Semiring Methods compare :: Add a -> Add a -> Ordering # (<) :: Add a -> Add a -> Bool # (<=) :: Add a -> Add a -> Bool # (>) :: Add a -> Add a -> Bool # (>=) :: Add a -> Add a -> Bool # max :: Add a -> Add a -> Add a # min :: Add a -> Add a -> Add a #
Ord (IntSetOf a)
Instance details Defined in Data.Semiring Methods compare :: IntSetOf a -> IntSetOf a -> Ordering # (<) :: IntSetOf a -> IntSetOf a -> Bool # (<=) :: IntSetOf a -> IntSetOf a -> Bool # (>) :: IntSetOf a -> IntSetOf a -> Bool # (>=) :: IntSetOf a -> IntSetOf a -> Bool # max :: IntSetOf a -> IntSetOf a -> IntSetOf a # min :: IntSetOf a -> IntSetOf a -> IntSetOf a #
Ord a => Ord (Mul a)
Instance details Defined in Data.Semiring Methods compare :: Mul a -> Mul a -> Ordering # (<) :: Mul a -> Mul a -> Bool # (<=) :: Mul a -> Mul a -> Bool # (>) :: Mul a -> Mul a -> Bool # (>=) :: Mul a -> Mul a -> Bool # max :: Mul a -> Mul a -> Mul a # min :: Mul a -> Mul a -> Mul a #
Ord a => Ord (WrappedNum a)
Instance details 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)
Instance details Defined in Data.Strict.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Ord flag => Ord (TyVarBndr flag)
Instance details 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 # max :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag # min :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag #
Ord a => Ord (HashSet a)
Instance details Defined in Data.HashSet.Internal Methods compare :: HashSet a -> HashSet a -> Ordering # (<) :: HashSet a -> HashSet a -> Bool # (<=) :: HashSet a -> HashSet a -> Bool # (>) :: HashSet a -> HashSet a -> Bool # (>=) :: HashSet a -> HashSet a -> Bool # max :: HashSet a -> HashSet a -> HashSet a # min :: HashSet a -> HashSet a -> HashSet a #
Ord a => Ord (Vector a)
Instance details Defined in Data.Vector Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
(Prim a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Primitive Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
(Storable a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Storable Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
Ord t => Ord (ElField '(s, t))
Instance details 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)
Instance details Defined in Data.Vinyl.Functor Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Ord a => Ord (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods compare :: NonEmpty a -> NonEmpty a -> Ordering # (<) :: NonEmpty a -> NonEmpty a -> Bool # (<=) :: NonEmpty a -> NonEmpty a -> Bool # (>) :: NonEmpty a -> NonEmpty a -> Bool # (>=) :: NonEmpty a -> NonEmpty a -> Bool # max :: NonEmpty a -> NonEmpty a -> NonEmpty a # min :: NonEmpty a -> NonEmpty a -> NonEmpty a #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Ord a => Ord (a)
Instance details Defined in GHC.Classes Methods compare :: (a) -> (a) -> Ordering # (<) :: (a) -> (a) -> Bool # (<=) :: (a) -> (a) -> Bool # (>) :: (a) -> (a) -> Bool # (>=) :: (a) -> (a) -> Bool # max :: (a) -> (a) -> (a) # min :: (a) -> (a) -> (a) #
Ord a => Ord [a]
Instance details Defined in GHC.Classes Methods compare :: [a] -> [a] -> Ordering # (<) :: [a] -> [a] -> Bool # (<=) :: [a] -> [a] -> Bool # (>) :: [a] -> [a] -> Bool # (>=) :: [a] -> [a] -> Bool # max :: [a] -> [a] -> [a] # min :: [a] -> [a] -> [a] #
(Integral a) :=> (Ord (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: Integral a :- Ord (Ratio a) #
(Ord a) :=> (Ord (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Const a b) #
(Ord a) :=> (Ord (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Identity a) #
(Ord a) :=> (Ord (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Maybe a) #
(Ord a) :=> (Ord [a])
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord [a] #
Class (Eq a) (Ord a)
Instance details Defined in Data.Constraint Methods cls :: Ord a :- Eq a #
Ord a => Ord (WrapWord a n)
Instance details Defined in Data.Word.Odd Methods compare :: WrapWord a n -> WrapWord a n -> Ordering # (<) :: WrapWord a n -> WrapWord a n -> Bool # (<=) :: WrapWord a n -> WrapWord a n -> Bool # (>) :: WrapWord a n -> WrapWord a n -> Bool # (>=) :: WrapWord a n -> WrapWord a n -> Bool # max :: WrapWord a n -> WrapWord a n -> WrapWord a n # min :: WrapWord a n -> WrapWord a n -> WrapWord a n #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
Ord (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods compare :: Fixed a -> Fixed a -> Ordering # (<) :: Fixed a -> Fixed a -> Bool # (<=) :: Fixed a -> Fixed a -> Bool # (>) :: Fixed a -> Fixed a -> Bool # (>=) :: Fixed a -> Fixed a -> Bool # max :: Fixed a -> Fixed a -> Fixed a # min :: Fixed a -> Fixed a -> Fixed a #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Ord a => Ord (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Arg a b -> Arg a b -> Ordering # (<) :: Arg a b -> Arg a b -> Bool # (<=) :: Arg a b -> Arg a b -> Bool # (>) :: Arg a b -> Arg a b -> Bool # (>=) :: Arg a b -> Arg a b -> Bool # max :: Arg a b -> Arg a b -> Arg a b # min :: Arg a b -> Arg a b -> Arg a b #
Ord (TypeRep a)	Since: base-4.4.0.0
Instance details Defined in Data.Typeable.Internal Methods compare :: TypeRep a -> TypeRep a -> Ordering # (<) :: TypeRep a -> TypeRep a -> Bool # (<=) :: TypeRep a -> TypeRep a -> Bool # (>) :: TypeRep a -> TypeRep a -> Bool # (>=) :: TypeRep a -> TypeRep a -> Bool # max :: TypeRep a -> TypeRep a -> TypeRep a # min :: TypeRep a -> TypeRep a -> TypeRep a #
Ord (U1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: U1 p -> U1 p -> Ordering # (<) :: U1 p -> U1 p -> Bool # (<=) :: U1 p -> U1 p -> Bool # (>) :: U1 p -> U1 p -> Bool # (>=) :: U1 p -> U1 p -> Bool # max :: U1 p -> U1 p -> U1 p # min :: U1 p -> U1 p -> U1 p #
Ord (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: V1 p -> V1 p -> Ordering # (<) :: V1 p -> V1 p -> Bool # (<=) :: V1 p -> V1 p -> Bool # (>) :: V1 p -> V1 p -> Bool # (>=) :: V1 p -> V1 p -> Bool # max :: V1 p -> V1 p -> V1 p # min :: V1 p -> V1 p -> V1 p #
Ord a => Ord (ListN n a)
Instance details Defined in Basement.Sized.List Methods compare :: ListN n a -> ListN n a -> Ordering # (<) :: ListN n a -> ListN n a -> Bool # (<=) :: ListN n a -> ListN n a -> Bool # (>) :: ListN n a -> ListN n a -> Bool # (>=) :: ListN n a -> ListN n a -> Bool # max :: ListN n a -> ListN n a -> ListN n a # min :: ListN n a -> ListN n a -> ListN n a #
(Ord a, Ord b) => Ord (Bimap a b)
Instance details Defined in Data.Bimap Methods compare :: Bimap a b -> Bimap a b -> Ordering # (<) :: Bimap a b -> Bimap a b -> Bool # (<=) :: Bimap a b -> Bimap a b -> Bool # (>) :: Bimap a b -> Bimap a b -> Bool # (>=) :: Bimap a b -> Bimap a b -> Bool # max :: Bimap a b -> Bimap a b -> Bimap a b # min :: Bimap a b -> Bimap a b -> Bimap a b #
Ord (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods compare :: (a :- b) -> (a :- b) -> Ordering # (<) :: (a :- b) -> (a :- b) -> Bool # (<=) :: (a :- b) -> (a :- b) -> Bool # (>) :: (a :- b) -> (a :- b) -> Bool # (>=) :: (a :- b) -> (a :- b) -> Bool # max :: (a :- b) -> (a :- b) -> a :- b # min :: (a :- b) -> (a :- b) -> a :- b #
(Ord k, Ord v) => Ord (Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
(Ord1 f, Ord a) => Ord (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods compare :: Cofree f a -> Cofree f a -> Ordering # (<) :: Cofree f a -> Cofree f a -> Bool # (<=) :: Cofree f a -> Cofree f a -> Bool # (>) :: Cofree f a -> Cofree f a -> Bool # (>=) :: Cofree f a -> Cofree f a -> Bool # max :: Cofree f a -> Cofree f a -> Cofree f a # min :: Cofree f a -> Cofree f a -> Cofree f a #
(Ord1 f, Ord a) => Ord (Free f a)
Instance details Defined in Control.Monad.Free Methods compare :: Free f a -> Free f a -> Ordering # (<) :: Free f a -> Free f a -> Bool # (<=) :: Free f a -> Free f a -> Bool # (>) :: Free f a -> Free f a -> Bool # (>=) :: Free f a -> Free f a -> Bool # max :: Free f a -> Free f a -> Free f a # min :: Free f a -> Free f a -> Free f a #
Ord k => Ord (Extension p k)
Instance details 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 # max :: Extension p k -> Extension p k -> Extension p k # min :: Extension p k -> Extension p k -> Extension p k #
Ord k => Ord (RootsOfUnity n k)
Instance details 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)
Instance details Defined in Data.Functor.Yoneda Methods compare :: Yoneda f a -> Yoneda f a -> Ordering # (<) :: Yoneda f a -> Yoneda f a -> Bool # (<=) :: Yoneda f a -> Yoneda f a -> Bool # (>) :: Yoneda f a -> Yoneda f a -> Bool # (>=) :: Yoneda f a -> Yoneda f a -> Bool # max :: Yoneda f a -> Yoneda f a -> Yoneda f a # min :: Yoneda f a -> Yoneda f a -> Yoneda f a #
Ord (TAddress p vd) Source #
Instance details 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 # max :: TAddress p vd -> TAddress p vd -> TAddress p vd # min :: TAddress p vd -> TAddress p vd -> TAddress p vd #
Ord (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Hash alg a -> Hash alg a -> Ordering # (<) :: Hash alg a -> Hash alg a -> Bool # (<=) :: Hash alg a -> Hash alg a -> Bool # (>) :: Hash alg a -> Hash alg a -> Bool # (>=) :: Hash alg a -> Hash alg a -> Bool # max :: Hash alg a -> Hash alg a -> Hash alg a # min :: Hash alg a -> Hash alg a -> Hash alg a #
Ord (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods compare :: NFixed p -> NFixed p -> Ordering # (<) :: NFixed p -> NFixed p -> Bool # (<=) :: NFixed p -> NFixed p -> Bool # (>) :: NFixed p -> NFixed p -> Bool # (>=) :: NFixed p -> NFixed p -> Bool # max :: NFixed p -> NFixed p -> NFixed p # min :: NFixed p -> NFixed p -> NFixed p #
(Ord n, Ord m) => Ord (ArithError n m)
Instance details 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 # max :: ArithError n m -> ArithError n m -> ArithError n m # min :: ArithError n m -> ArithError n m -> ArithError n m #
Comparable t => Ord (Value' instr t)
Instance details 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 # max :: Value' instr t -> Value' instr t -> Value' instr t # min :: Value' instr t -> Value' instr t -> Value' instr t #
(Ord a, Ord b) => Ord (Bimap a b)
Instance details Defined in Morley.Util.Bimap Methods compare :: Bimap a b -> Bimap a b -> Ordering # (<) :: Bimap a b -> Bimap a b -> Bool # (<=) :: Bimap a b -> Bimap a b -> Bool # (>) :: Bimap a b -> Bimap a b -> Bool # (>=) :: Bimap a b -> Bimap a b -> Bool # max :: Bimap a b -> Bimap a b -> Bimap a b # min :: Bimap a b -> Bimap a b -> Bimap a b #
Ord a => Ord (SizedList' n a)
Instance details 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 # max :: SizedList' n a -> SizedList' n a -> SizedList' n a # min :: SizedList' n a -> SizedList' n a -> SizedList' n a #
Ord (v a) => Ord (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods compare :: Poly v a -> Poly v a -> Ordering # (<) :: Poly v a -> Poly v a -> Bool # (<=) :: Poly v a -> Poly v a -> Bool # (>) :: Poly v a -> Poly v a -> Bool # (>=) :: Poly v a -> Poly v a -> Bool # max :: Poly v a -> Poly v a -> Poly v a # min :: Poly v a -> Poly v a -> Poly v a #
Ord v => Ord (IntMapOf k v)
Instance details Defined in Data.Semiring Methods compare :: IntMapOf k v -> IntMapOf k v -> Ordering # (<) :: IntMapOf k v -> IntMapOf k v -> Bool # (<=) :: IntMapOf k v -> IntMapOf k v -> Bool # (>) :: IntMapOf k v -> IntMapOf k v -> Bool # (>=) :: IntMapOf k v -> IntMapOf k v -> Bool # max :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # min :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v #
GCompare tag => Ord (Some tag)
Instance details Defined in Data.GADT.Internal Methods compare :: Some tag -> Some tag -> Ordering # (<) :: Some tag -> Some tag -> Bool # (<=) :: Some tag -> Some tag -> Bool # (>) :: Some tag -> Some tag -> Bool # (>=) :: Some tag -> Some tag -> Bool # max :: Some tag -> Some tag -> Some tag # min :: Some tag -> Some tag -> Some tag #
(Ord a, Ord b) => Ord (Either a b)
Instance details Defined in Data.Strict.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
(Ord a, Ord b) => Ord (These a b)
Instance details Defined in Data.Strict.These Methods compare :: These a b -> These a b -> Ordering # (<) :: These a b -> These a b -> Bool # (<=) :: These a b -> These a b -> Bool # (>) :: These a b -> These a b -> Bool # (>=) :: These a b -> These a b -> Bool # max :: These a b -> These a b -> These a b # min :: These a b -> These a b -> These a b #
(Ord a, Ord b) => Ord (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods compare :: Pair a b -> Pair a b -> Ordering # (<) :: Pair a b -> Pair a b -> Bool # (<=) :: Pair a b -> Pair a b -> Bool # (>) :: Pair a b -> Pair a b -> Bool # (>=) :: Pair a b -> Pair a b -> Bool # max :: Pair a b -> Pair a b -> Pair a b # min :: Pair a b -> Pair a b -> Pair a b #
(Ord a, Ord b) => Ord (These a b)
Instance details Defined in Data.These Methods compare :: These a b -> These a b -> Ordering # (<) :: These a b -> These a b -> Bool # (<=) :: These a b -> These a b -> Bool # (>) :: These a b -> These a b -> Bool # (>=) :: These a b -> These a b -> Bool # max :: These a b -> These a b -> These a b # min :: These a b -> These a b -> These a b #
(Ord1 m, Ord a) => Ord (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods compare :: MaybeT m a -> MaybeT m a -> Ordering # (<) :: MaybeT m a -> MaybeT m a -> Bool # (<=) :: MaybeT m a -> MaybeT m a -> Bool # (>) :: MaybeT m a -> MaybeT m a -> Bool # (>=) :: MaybeT m a -> MaybeT m a -> Bool # max :: MaybeT m a -> MaybeT m a -> MaybeT m a # min :: MaybeT m a -> MaybeT m a -> MaybeT m a #
(Ord k, Ord v) => Ord (HashMap k v)	The ordering is total and consistent with the `Eq` instance. However, nothing else about the ordering is specified, and it may change from version to version of either this package or of hashable.
Instance details Defined in Data.HashMap.Internal Methods compare :: HashMap k v -> HashMap k v -> Ordering # (<) :: HashMap k v -> HashMap k v -> Bool # (<=) :: HashMap k v -> HashMap k v -> Bool # (>) :: HashMap k v -> HashMap k v -> Bool # (>=) :: HashMap k v -> HashMap k v -> Bool # max :: HashMap k v -> HashMap k v -> HashMap k v # min :: HashMap k v -> HashMap k v -> HashMap k v #
(Ord a, Ord b) => Ord (a, b)
Instance details Defined in GHC.Classes Methods compare :: (a, b) -> (a, b) -> Ordering # (<) :: (a, b) -> (a, b) -> Bool # (<=) :: (a, b) -> (a, b) -> Bool # (>) :: (a, b) -> (a, b) -> Bool # (>=) :: (a, b) -> (a, b) -> Bool # max :: (a, b) -> (a, b) -> (a, b) # min :: (a, b) -> (a, b) -> (a, b) #
(Ord a, Ord b) :=> (Ord (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (Either a b) #
(Ord a, Ord b) :=> (Ord (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (a, b) #
Class (Num a, Ord a) (Real a)
Instance details Defined in Data.Constraint Methods cls :: Real a :- (Num a, Ord a) #
Ord a => Ord (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods compare :: Const a b -> Const a b -> Ordering # (<) :: Const a b -> Const a b -> Bool # (<=) :: Const a b -> Const a b -> Bool # (>) :: Const a b -> Const a b -> Bool # (>=) :: Const a b -> Const a b -> Bool # max :: Const a b -> Const a b -> Const a b # min :: Const a b -> Const a b -> Const a b #
Ord (f a) => Ord (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods compare :: Ap f a -> Ap f a -> Ordering # (<) :: Ap f a -> Ap f a -> Bool # (<=) :: Ap f a -> Ap f a -> Bool # (>) :: Ap f a -> Ap f a -> Bool # (>=) :: Ap f a -> Ap f a -> Bool # max :: Ap f a -> Ap f a -> Ap f a # min :: Ap f a -> Ap f a -> Ap f a #
Ord (f a) => Ord (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods compare :: Alt f a -> Alt f a -> Ordering # (<) :: Alt f a -> Alt f a -> Bool # (<=) :: Alt f a -> Alt f a -> Bool # (>) :: Alt f a -> Alt f a -> Bool # (>=) :: Alt f a -> Alt f a -> Bool # max :: Alt f a -> Alt f a -> Alt f a # min :: Alt f a -> Alt f a -> Alt f a #
Ord (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~: b) -> (a :~: b) -> Ordering # (<) :: (a :~: b) -> (a :~: b) -> Bool # (<=) :: (a :~: b) -> (a :~: b) -> Bool # (>) :: (a :~: b) -> (a :~: b) -> Bool # (>=) :: (a :~: b) -> (a :~: b) -> Bool # max :: (a :~: b) -> (a :~: b) -> a :~: b # min :: (a :~: b) -> (a :~: b) -> a :~: b #
Ord (f p) => Ord (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Rec1 f p -> Rec1 f p -> Ordering # (<) :: Rec1 f p -> Rec1 f p -> Bool # (<=) :: Rec1 f p -> Rec1 f p -> Bool # (>) :: Rec1 f p -> Rec1 f p -> Bool # (>=) :: Rec1 f p -> Rec1 f p -> Bool # max :: Rec1 f p -> Rec1 f p -> Rec1 f p # min :: Rec1 f p -> Rec1 f p -> Rec1 f p #
Ord (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in GHC.Generics Methods compare :: URec Char p -> URec Char p -> Ordering # (<) :: URec Char p -> URec Char p -> Bool # (<=) :: URec Char p -> URec Char p -> Bool # (>) :: URec Char p -> URec Char p -> Bool # (>=) :: URec Char p -> URec Char p -> Bool # max :: URec Char p -> URec Char p -> URec Char p # min :: URec Char p -> URec Char p -> URec Char p #
Ord (URec Double p)	Since: base-4.9.0.0
Instance details 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 # max :: URec Double p -> URec Double p -> URec Double p # min :: URec Double p -> URec Double p -> URec Double p #
Ord (URec Float p)
Instance details Defined in GHC.Generics Methods compare :: URec Float p -> URec Float p -> Ordering # (<) :: URec Float p -> URec Float p -> Bool # (<=) :: URec Float p -> URec Float p -> Bool # (>) :: URec Float p -> URec Float p -> Bool # (>=) :: URec Float p -> URec Float p -> Bool # max :: URec Float p -> URec Float p -> URec Float p # min :: URec Float p -> URec Float p -> URec Float p #
Ord (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Int p -> URec Int p -> Ordering # (<) :: URec Int p -> URec Int p -> Bool # (<=) :: URec Int p -> URec Int p -> Bool # (>) :: URec Int p -> URec Int p -> Bool # (>=) :: URec Int p -> URec Int p -> Bool # max :: URec Int p -> URec Int p -> URec Int p # min :: URec Int p -> URec Int p -> URec Int p #
Ord (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Word p -> URec Word p -> Ordering # (<) :: URec Word p -> URec Word p -> Bool # (<=) :: URec Word p -> URec Word p -> Bool # (>) :: URec Word p -> URec Word p -> Bool # (>=) :: URec Word p -> URec Word p -> Bool # max :: URec Word p -> URec Word p -> URec Word p # min :: URec Word p -> URec Word p -> URec Word p #
Ord (p (Fix p a) a) => Ord (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods compare :: Fix p a -> Fix p a -> Ordering # (<) :: Fix p a -> Fix p a -> Bool # (<=) :: Fix p a -> Fix p a -> Bool # (>) :: Fix p a -> Fix p a -> Bool # (>=) :: Fix p a -> Fix p a -> Bool # max :: Fix p a -> Fix p a -> Fix p a # min :: Fix p a -> Fix p a -> Fix p a #
Ord (p a a) => Ord (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods compare :: Join p a -> Join p a -> Ordering # (<) :: Join p a -> Join p a -> Bool # (<=) :: Join p a -> Join p a -> Bool # (>) :: Join p a -> Join p a -> Bool # (>=) :: Join p a -> Join p a -> Bool # max :: Join p a -> Join p a -> Join p a # min :: Join p a -> Join p a -> Join p a #
(Ord a, Ord (f b)) => Ord (CofreeF f a b)
Instance details 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 # max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b # min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #
Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a)
Instance details 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 # max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a # min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #
(Ord a, Ord (f b)) => Ord (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeF f a b -> FreeF f a b -> Ordering # (<) :: FreeF f a b -> FreeF f a b -> Bool # (<=) :: FreeF f a b -> FreeF f a b -> Bool # (>) :: FreeF f a b -> FreeF f a b -> Bool # (>=) :: FreeF f a b -> FreeF f a b -> Bool # max :: FreeF f a b -> FreeF f a b -> FreeF f a b # min :: FreeF f a b -> FreeF f a b -> FreeF f a b #
(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeT f m a -> FreeT f m a -> Ordering # (<) :: FreeT f m a -> FreeT f m a -> Bool # (<=) :: FreeT f m a -> FreeT f m a -> Bool # (>) :: FreeT f m a -> FreeT f m a -> Bool # (>=) :: FreeT f m a -> FreeT f m a -> Bool # max :: FreeT f m a -> FreeT f m a -> FreeT f m a # min :: FreeT f m a -> FreeT f m a -> FreeT f m a #
GCompare f => Ord (Constrained c f)
Instance details 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)
Instance details 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)
Instance details 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 # max :: GOrdering a b -> GOrdering a b -> GOrdering a b # min :: GOrdering a b -> GOrdering a b -> GOrdering a b #
Ord b => Ord (Tagged s b)
Instance details Defined in Data.Tagged Methods compare :: Tagged s b -> Tagged s b -> Ordering # (<) :: Tagged s b -> Tagged s b -> Bool # (<=) :: Tagged s b -> Tagged s b -> Bool # (>) :: Tagged s b -> Tagged s b -> Bool # (>=) :: Tagged s b -> Tagged s b -> Bool # max :: Tagged s b -> Tagged s b -> Tagged s b # min :: Tagged s b -> Tagged s b -> Tagged s b #
(Ord (f a), Ord (g a), Ord a) => Ord (These1 f g a)
Instance details Defined in Data.Functor.These Methods compare :: These1 f g a -> These1 f g a -> Ordering # (<) :: These1 f g a -> These1 f g a -> Bool # (<=) :: These1 f g a -> These1 f g a -> Bool # (>) :: These1 f g a -> These1 f g a -> Bool # (>=) :: These1 f g a -> These1 f g a -> Bool # max :: These1 f g a -> These1 f g a -> These1 f g a # min :: These1 f g a -> These1 f g a -> These1 f g a #
(Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods compare :: ErrorT e m a -> ErrorT e m a -> Ordering # (<) :: ErrorT e m a -> ErrorT e m a -> Bool # (<=) :: ErrorT e m a -> ErrorT e m a -> Bool # (>) :: ErrorT e m a -> ErrorT e m a -> Bool # (>=) :: ErrorT e m a -> ErrorT e m a -> Bool # max :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a # min :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #
(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a)
Instance details 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 # max :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a # min :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #
(Ord1 f, Ord a) => Ord (IdentityT f a)
Instance details 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 # max :: IdentityT f a -> IdentityT f a -> IdentityT f a # min :: IdentityT f a -> IdentityT f a -> IdentityT f a #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Ord (Rec f rs)) => Ord (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods compare :: ARec f rs -> ARec f rs -> Ordering # (<) :: ARec f rs -> ARec f rs -> Bool # (<=) :: ARec f rs -> ARec f rs -> Bool # (>) :: ARec f rs -> ARec f rs -> Bool # (>=) :: ARec f rs -> ARec f rs -> Bool # max :: ARec f rs -> ARec f rs -> ARec f rs # min :: ARec f rs -> ARec f rs -> ARec f rs #
(Ord (f r), Ord (Rec f rs)) => Ord (Rec f (r ': rs))
Instance details 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]))
Instance details Defined in Data.Vinyl.Core Methods compare :: Rec f '[] -> Rec f '[] -> Ordering # (<) :: Rec f '[] -> Rec f '[] -> Bool # (<=) :: Rec f '[] -> Rec f '[] -> Bool # (>) :: Rec f '[] -> Rec f '[] -> Bool # (>=) :: Rec f '[] -> Rec f '[] -> Bool # max :: Rec f '[] -> Rec f '[] -> Rec f '[] # min :: Rec f '[] -> Rec f '[] -> Rec f '[] #
(Ord a, Ord b, Ord c) => Ord (a, b, c)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c) -> (a, b, c) -> Ordering # (<) :: (a, b, c) -> (a, b, c) -> Bool # (<=) :: (a, b, c) -> (a, b, c) -> Bool # (>) :: (a, b, c) -> (a, b, c) -> Bool # (>=) :: (a, b, c) -> (a, b, c) -> Bool # max :: (a, b, c) -> (a, b, c) -> (a, b, c) # min :: (a, b, c) -> (a, b, c) -> (a, b, c) #
(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a)	Since: base-4.9.0.0
Instance details 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 # max :: Product f g a -> Product f g a -> Product f g a # min :: Product f g a -> Product f g a -> Product f g a #
(Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods compare :: Sum f g a -> Sum f g a -> Ordering # (<) :: Sum f g a -> Sum f g a -> Bool # (<=) :: Sum f g a -> Sum f g a -> Bool # (>) :: Sum f g a -> Sum f g a -> Bool # (>=) :: Sum f g a -> Sum f g a -> Bool # max :: Sum f g a -> Sum f g a -> Sum f g a # min :: Sum f g a -> Sum f g a -> Sum f g a #
Ord (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~~: b) -> (a :~~: b) -> Ordering # (<) :: (a :~~: b) -> (a :~~: b) -> Bool # (<=) :: (a :~~: b) -> (a :~~: b) -> Bool # (>) :: (a :~~: b) -> (a :~~: b) -> Bool # (>=) :: (a :~~: b) -> (a :~~: b) -> Bool # max :: (a :~~: b) -> (a :~~: b) -> a :~~: b # min :: (a :~~: b) -> (a :~~: b) -> a :~~: b #
(Ord (f p), Ord (g p)) => Ord ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :: g) p -> (f :: g) p -> Ordering # (<) :: (f :: g) p -> (f :: g) p -> Bool # (<=) :: (f :: g) p -> (f :: g) p -> Bool # (>) :: (f :: g) p -> (f :: g) p -> Bool # (>=) :: (f :: g) p -> (f :: g) p -> Bool # max :: (f :: g) p -> (f :: g) p -> (f :: g) p # min :: (f :: g) p -> (f :: g) p -> (f :: g) p #
(Ord (f p), Ord (g p)) => Ord ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :+: g) p -> (f :+: g) p -> Ordering # (<) :: (f :+: g) p -> (f :+: g) p -> Bool # (<=) :: (f :+: g) p -> (f :+: g) p -> Bool # (>) :: (f :+: g) p -> (f :+: g) p -> Bool # (>=) :: (f :+: g) p -> (f :+: g) p -> Bool # max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p # min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #
Ord c => Ord (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: K1 i c p -> K1 i c p -> Ordering # (<) :: K1 i c p -> K1 i c p -> Bool # (<=) :: K1 i c p -> K1 i c p -> Bool # (>) :: K1 i c p -> K1 i c p -> Bool # (>=) :: K1 i c p -> K1 i c p -> Bool # max :: K1 i c p -> K1 i c p -> K1 i c p # min :: K1 i c p -> K1 i c p -> K1 i c p #
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering # (<) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #
(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)	Since: base-4.9.0.0
Instance details 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 # max :: Compose f g a -> Compose f g a -> Compose f g a # min :: Compose f g a -> Compose f g a -> Compose f g a #
Ord (f (g p)) => Ord ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :.: g) p -> (f :.: g) p -> Ordering # (<) :: (f :.: g) p -> (f :.: g) p -> Bool # (<=) :: (f :.: g) p -> (f :.: g) p -> Bool # (>) :: (f :.: g) p -> (f :.: g) p -> Bool # (>=) :: (f :.: g) p -> (f :.: g) p -> Bool # max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #
Ord (f p) => Ord (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: M1 i c f p -> M1 i c f p -> Ordering # (<) :: M1 i c f p -> M1 i c f p -> Bool # (<=) :: M1 i c f p -> M1 i c f p -> Bool # (>) :: M1 i c f p -> M1 i c f p -> Bool # (>=) :: M1 i c f p -> M1 i c f p -> Bool # max :: M1 i c f p -> M1 i c f p -> M1 i c f p # min :: M1 i c f p -> M1 i c f p -> M1 i c f p #
Ord (f a) => Ord (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods compare :: Clown f a b -> Clown f a b -> Ordering # (<) :: Clown f a b -> Clown f a b -> Bool # (<=) :: Clown f a b -> Clown f a b -> Bool # (>) :: Clown f a b -> Clown f a b -> Bool # (>=) :: Clown f a b -> Clown f a b -> Bool # max :: Clown f a b -> Clown f a b -> Clown f a b # min :: Clown f a b -> Clown f a b -> Clown f a b #
Ord (p b a) => Ord (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods compare :: Flip p a b -> Flip p a b -> Ordering # (<) :: Flip p a b -> Flip p a b -> Bool # (<=) :: Flip p a b -> Flip p a b -> Bool # (>) :: Flip p a b -> Flip p a b -> Bool # (>=) :: Flip p a b -> Flip p a b -> Bool # max :: Flip p a b -> Flip p a b -> Flip p a b # min :: Flip p a b -> Flip p a b -> Flip p a b #
Ord (g b) => Ord (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods compare :: Joker g a b -> Joker g a b -> Ordering # (<) :: Joker g a b -> Joker g a b -> Bool # (<=) :: Joker g a b -> Joker g a b -> Bool # (>) :: Joker g a b -> Joker g a b -> Bool # (>=) :: Joker g a b -> Joker g a b -> Bool # max :: Joker g a b -> Joker g a b -> Joker g a b # min :: Joker g a b -> Joker g a b -> Joker g a b #
Ord (p a b) => Ord (WrappedBifunctor p a b)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Bifunctor.Sum Methods compare :: Sum p q a b -> Sum p q a b -> Ordering # (<) :: Sum p q a b -> Sum p q a b -> Bool # (<=) :: Sum p q a b -> Sum p q a b -> Bool # (>) :: Sum p q a b -> Sum p q a b -> Bool # (>=) :: Sum p q a b -> Sum p q a b -> Bool # max :: Sum p q a b -> Sum p q a b -> Sum p q a b # min :: Sum p q a b -> Sum p q a b -> Sum p q a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)
Instance details 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)
Instance details 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 # max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b # min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)
Instance details 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)
Instance details 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)
Instance details 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 # max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b # min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #
(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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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) #

class Show a #

Conversion of values to readable Strings.

Derived instances of Show have the following properties, which are compatible with derived instances of Read:

The result of show is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used.
If the constructor is defined to be an infix operator, then showsPrec will produce infix applications of the constructor.
the representation will be enclosed in parentheses if the precedence of the top-level constructor in x is less than d (associativity is ignored). Thus, if d is 0 then the result is never surrounded in parentheses; if d is 11 it is always surrounded in parentheses, unless it is an atomic expression.
If the constructor is defined using record syntax, then show will produce the record-syntax form, with the fields given in the same order as the original declaration.

For example, given the declarations

infixr 5 :^:
data Tree a =  Leaf a  |  Tree a :^: Tree a

the derived instance of Show is equivalent to

instance (Show a) => Show (Tree a) where

       showsPrec d (Leaf m) = showParen (d > app_prec) $
            showString "Leaf " . showsPrec (app_prec+1) m
         where app_prec = 10

       showsPrec d (u :^: v) = showParen (d > up_prec) $
            showsPrec (up_prec+1) u .
            showString " :^: "      .
            showsPrec (up_prec+1) v
         where up_prec = 5

Note that right-associativity of :^: is ignored. For example,

show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".

Minimal complete definition

showsPrec | show

Instances

Instances details

Show CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods showsPrec :: Int -> CabalSpecVersion -> ShowS # show :: CabalSpecVersion -> String # showList :: [CabalSpecVersion] -> ShowS #
Show HasCommonStanzas
Instance details Defined in Distribution.CabalSpecVersion Methods showsPrec :: Int -> HasCommonStanzas -> ShowS # show :: HasCommonStanzas -> String # showList :: [HasCommonStanzas] -> ShowS #
Show HasElif
Instance details Defined in Distribution.CabalSpecVersion Methods showsPrec :: Int -> HasElif -> ShowS # show :: HasElif -> String # showList :: [HasElif] -> ShowS #
Show PError
Instance details Defined in Distribution.Parsec.Error Methods showsPrec :: Int -> PError -> ShowS # show :: PError -> String # showList :: [PError] -> ShowS #
Show Position
Instance details Defined in Distribution.Parsec.Position Methods showsPrec :: Int -> Position -> ShowS # show :: Position -> String # showList :: [Position] -> ShowS #
Show PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods showsPrec :: Int -> PWarnType -> ShowS # show :: PWarnType -> String # showList :: [PWarnType] -> ShowS #
Show PWarning
Instance details Defined in Distribution.Parsec.Warning Methods showsPrec :: Int -> PWarning -> ShowS # show :: PWarning -> String # showList :: [PWarning] -> ShowS #
Show Structure
Instance details Defined in Distribution.Utils.Structured Methods showsPrec :: Int -> Structure -> ShowS # show :: Structure -> String # showList :: [Structure] -> ShowS #
Show Extension
Instance details Defined in Language.Haskell.Extension Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Show KnownExtension
Instance details Defined in Language.Haskell.Extension Methods showsPrec :: Int -> KnownExtension -> ShowS # show :: KnownExtension -> String # showList :: [KnownExtension] -> ShowS #
Show Language
Instance details Defined in Language.Haskell.Extension Methods showsPrec :: Int -> Language -> ShowS # show :: Language -> String # showList :: [Language] -> ShowS #
Show Key
Instance details Defined in Data.Aeson.Key Methods showsPrec :: Int -> Key -> ShowS # show :: Key -> String # showList :: [Key] -> ShowS #
Show DotNetTime
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> DotNetTime -> ShowS # show :: DotNetTime -> String # showList :: [DotNetTime] -> ShowS #
Show JSONPathElement
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> JSONPathElement -> ShowS # show :: JSONPathElement -> String # showList :: [JSONPathElement] -> ShowS #
Show Options
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Options -> ShowS # show :: Options -> String # showList :: [Options] -> ShowS #
Show SumEncoding
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> SumEncoding -> ShowS # show :: SumEncoding -> String # showList :: [SumEncoding] -> ShowS #
Show Value	Since version 1.5.6.0 version object values are printed in lexicographic key order `>>>` `toJSON $ H.fromList [("a", True), ("z", False)]`Object (fromList [("a",Bool True),("z",Bool False)]) `>>>` `toJSON $ H.fromList [("z", False), ("a", True)]`Object (fromList [("a",Bool True),("z",Bool False)])
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Value -> ShowS # show :: Value -> String # showList :: [Value] -> ShowS #
Show More
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> More -> ShowS # show :: More -> String # showList :: [More] -> ShowS #
Show Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show ByteArray	Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods showsPrec :: Int -> ByteArray -> ShowS # show :: ByteArray -> String # showList :: [ByteArray] -> ShowS #
Show Constr	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods showsPrec :: Int -> Constr -> ShowS # show :: Constr -> String # showList :: [Constr] -> ShowS #
Show ConstrRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods showsPrec :: Int -> ConstrRep -> ShowS # show :: ConstrRep -> String # showList :: [ConstrRep] -> ShowS #
Show DataRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods showsPrec :: Int -> DataRep -> ShowS # show :: DataRep -> String # showList :: [DataRep] -> ShowS #
Show DataType	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods showsPrec :: Int -> DataType -> ShowS # show :: DataType -> String # showList :: [DataType] -> ShowS #
Show Fixity	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> All -> ShowS # show :: All -> String # showList :: [All] -> ShowS #
Show Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Any -> ShowS # show :: Any -> String # showList :: [Any] -> ShowS #
Show SomeTypeRep	Since: base-4.10.0.0
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> SomeTypeRep -> ShowS # show :: SomeTypeRep -> String # showList :: [SomeTypeRep] -> ShowS #
Show Version	Since: base-2.1
Instance details Defined in Data.Version Methods showsPrec :: Int -> Version -> ShowS # show :: Version -> String # showList :: [Version] -> ShowS #
Show Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods showsPrec :: Int -> Void -> ShowS # show :: Void -> String # showList :: [Void] -> ShowS #
Show BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> BlockReason -> ShowS # show :: BlockReason -> String # showList :: [BlockReason] -> ShowS #
Show ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadId -> ShowS # show :: ThreadId -> String # showList :: [ThreadId] -> ShowS #
Show ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadStatus -> ShowS # show :: ThreadStatus -> String # showList :: [ThreadStatus] -> ShowS #
Show ErrorCall	Since: base-4.0.0.0
Instance details Defined in GHC.Exception Methods showsPrec :: Int -> ErrorCall -> ShowS # show :: ErrorCall -> String # showList :: [ErrorCall] -> ShowS #
Show ArithException	Since: base-4.0.0.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> ArithException -> ShowS # show :: ArithException -> String # showList :: [ArithException] -> ShowS #
Show SomeException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS #
Show Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS #
Show DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods showsPrec :: Int -> MaskingState -> ShowS # show :: MaskingState -> String # showList :: [MaskingState] -> ShowS #
Show AllocationLimitExceeded	Since: base-4.7.1.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AllocationLimitExceeded -> ShowS # show :: AllocationLimitExceeded -> String # showList :: [AllocationLimitExceeded] -> ShowS #
Show ArrayException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ArrayException -> ShowS # show :: ArrayException -> String # showList :: [ArrayException] -> ShowS #
Show AssertionFailed	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AssertionFailed -> ShowS # show :: AssertionFailed -> String # showList :: [AssertionFailed] -> ShowS #
Show AsyncException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AsyncException -> ShowS # show :: AsyncException -> String # showList :: [AsyncException] -> ShowS #
Show BlockedIndefinitelyOnMVar	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS # show :: BlockedIndefinitelyOnMVar -> String # showList :: [BlockedIndefinitelyOnMVar] -> ShowS #
Show BlockedIndefinitelyOnSTM	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS # show :: BlockedIndefinitelyOnSTM -> String # showList :: [BlockedIndefinitelyOnSTM] -> ShowS #
Show CompactionFailed	Since: base-4.10.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> CompactionFailed -> ShowS # show :: CompactionFailed -> String # showList :: [CompactionFailed] -> ShowS #
Show Deadlock	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> Deadlock -> ShowS # show :: Deadlock -> String # showList :: [Deadlock] -> ShowS #
Show ExitCode
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ExitCode -> ShowS # show :: ExitCode -> String # showList :: [ExitCode] -> ShowS #
Show FixIOException	Since: base-4.11.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> FixIOException -> ShowS # show :: FixIOException -> String # showList :: [FixIOException] -> ShowS #
Show IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS #
Show IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS #
Show SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS #
Show BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS #
Show Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Handle -> ShowS # show :: Handle -> String # showList :: [Handle] -> ShowS #
Show HandleType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> HandleType -> ShowS # show :: HandleType -> String # showList :: [HandleType] -> ShowS #
Show Newline	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Newline -> ShowS # show :: Newline -> String # showList :: [Newline] -> ShowS #
Show NewlineMode	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> NewlineMode -> ShowS # show :: NewlineMode -> String # showList :: [NewlineMode] -> ShowS #
Show IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods showsPrec :: Int -> IOMode -> ShowS # show :: IOMode -> String # showList :: [IOMode] -> ShowS #
Show Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int16 -> ShowS # show :: Int16 -> String # showList :: [Int16] -> ShowS #
Show Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int32 -> ShowS # show :: Int32 -> String # showList :: [Int32] -> ShowS #
Show Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int64 -> ShowS # show :: Int64 -> String # showList :: [Int64] -> ShowS #
Show Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int8 -> ShowS # show :: Int8 -> String # showList :: [Int8] -> ShowS #
Show CCFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> CCFlags -> ShowS # show :: CCFlags -> String # showList :: [CCFlags] -> ShowS #
Show ConcFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> ConcFlags -> ShowS # show :: ConcFlags -> String # showList :: [ConcFlags] -> ShowS #
Show DebugFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DebugFlags -> ShowS # show :: DebugFlags -> String # showList :: [DebugFlags] -> ShowS #
Show DoCostCentres	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DoCostCentres -> ShowS # show :: DoCostCentres -> String # showList :: [DoCostCentres] -> ShowS #
Show DoHeapProfile	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DoHeapProfile -> ShowS # show :: DoHeapProfile -> String # showList :: [DoHeapProfile] -> ShowS #
Show DoTrace	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DoTrace -> ShowS # show :: DoTrace -> String # showList :: [DoTrace] -> ShowS #
Show GCFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> GCFlags -> ShowS # show :: GCFlags -> String # showList :: [GCFlags] -> ShowS #
Show GiveGCStats	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> GiveGCStats -> ShowS # show :: GiveGCStats -> String # showList :: [GiveGCStats] -> ShowS #
Show IoSubSystem
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> IoSubSystem -> ShowS # show :: IoSubSystem -> String # showList :: [IoSubSystem] -> ShowS #
Show MiscFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> MiscFlags -> ShowS # show :: MiscFlags -> String # showList :: [MiscFlags] -> ShowS #
Show ParFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> ParFlags -> ShowS # show :: ParFlags -> String # showList :: [ParFlags] -> ShowS #
Show ProfFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> ProfFlags -> ShowS # show :: ProfFlags -> String # showList :: [ProfFlags] -> ShowS #
Show RTSFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> RTSFlags -> ShowS # show :: RTSFlags -> String # showList :: [RTSFlags] -> ShowS #
Show TickyFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> TickyFlags -> ShowS # show :: TickyFlags -> String # showList :: [TickyFlags] -> ShowS #
Show TraceFlags	Since: base-4.8.0.0
Instance details Defined in GHC.RTS.Flags Methods showsPrec :: Int -> TraceFlags -> ShowS # show :: TraceFlags -> String # showList :: [TraceFlags] -> ShowS #
Show FractionalExponentBase
Instance details Defined in GHC.Real Methods showsPrec :: Int -> FractionalExponentBase -> ShowS # show :: FractionalExponentBase -> String # showList :: [FractionalExponentBase] -> ShowS #
Show CallStack	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> CallStack -> ShowS # show :: CallStack -> String # showList :: [CallStack] -> ShowS #
Show SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> SrcLoc -> ShowS # show :: SrcLoc -> String # showList :: [SrcLoc] -> ShowS #
Show GCDetails	Since: base-4.10.0.0
Instance details Defined in GHC.Stats Methods showsPrec :: Int -> GCDetails -> ShowS # show :: GCDetails -> String # showList :: [GCDetails] -> ShowS #
Show RTSStats	Since: base-4.10.0.0
Instance details Defined in GHC.Stats Methods showsPrec :: Int -> RTSStats -> ShowS # show :: RTSStats -> String # showList :: [RTSStats] -> ShowS #
Show SomeChar
Instance details Defined in GHC.TypeLits Methods showsPrec :: Int -> SomeChar -> ShowS # show :: SomeChar -> String # showList :: [SomeChar] -> ShowS #
Show SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods showsPrec :: Int -> SomeSymbol -> ShowS # show :: SomeSymbol -> String # showList :: [SomeSymbol] -> ShowS #
Show SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods showsPrec :: Int -> SomeNat -> ShowS # show :: SomeNat -> String # showList :: [SomeNat] -> ShowS #
Show GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods showsPrec :: Int -> GeneralCategory -> ShowS # show :: GeneralCategory -> String # showList :: [GeneralCategory] -> ShowS #
Show Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word16 -> ShowS # show :: Word16 -> String # showList :: [Word16] -> ShowS #
Show Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word32 -> ShowS # show :: Word32 -> String # showList :: [Word32] -> ShowS #
Show Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word64 -> ShowS # show :: Word64 -> String # showList :: [Word64] -> ShowS #
Show Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word8 -> ShowS # show :: Word8 -> String # showList :: [Word8] -> ShowS #
Show Lexeme	Since: base-2.1
Instance details Defined in Text.Read.Lex Methods showsPrec :: Int -> Lexeme -> ShowS # show :: Lexeme -> String # showList :: [Lexeme] -> ShowS #
Show Number	Since: base-4.6.0.0
Instance details Defined in Text.Read.Lex Methods showsPrec :: Int -> Number -> ShowS # show :: Number -> String # showList :: [Number] -> ShowS #
Show Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods showsPrec :: Int -> Alphabet -> ShowS # show :: Alphabet -> String # showList :: [Alphabet] -> ShowS #
Show Encoding
Instance details Defined in Basement.String Methods showsPrec :: Int -> Encoding -> ShowS # show :: Encoding -> String # showList :: [Encoding] -> ShowS #
Show ASCII7_Invalid
Instance details Defined in Basement.String.Encoding.ASCII7 Methods showsPrec :: Int -> ASCII7_Invalid -> ShowS # show :: ASCII7_Invalid -> String # showList :: [ASCII7_Invalid] -> ShowS #
Show ISO_8859_1_Invalid
Instance details Defined in Basement.String.Encoding.ISO_8859_1 Methods showsPrec :: Int -> ISO_8859_1_Invalid -> ShowS # show :: ISO_8859_1_Invalid -> String # showList :: [ISO_8859_1_Invalid] -> ShowS #
Show UTF16_Invalid
Instance details Defined in Basement.String.Encoding.UTF16 Methods showsPrec :: Int -> UTF16_Invalid -> ShowS # show :: UTF16_Invalid -> String # showList :: [UTF16_Invalid] -> ShowS #
Show UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods showsPrec :: Int -> UTF32_Invalid -> ShowS # show :: UTF32_Invalid -> String # showList :: [UTF32_Invalid] -> ShowS #
Show AsciiString
Instance details Defined in Basement.Types.AsciiString Methods showsPrec :: Int -> AsciiString -> ShowS # show :: AsciiString -> String # showList :: [AsciiString] -> ShowS #
Show Char7
Instance details Defined in Basement.Types.Char7 Methods showsPrec :: Int -> Char7 -> ShowS # show :: Char7 -> String # showList :: [Char7] -> ShowS #
Show FileSize
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> FileSize -> ShowS # show :: FileSize -> String # showList :: [FileSize] -> ShowS #
Show String
Instance details Defined in Basement.UTF8.Base Methods showsPrec :: Int -> String -> ShowS # show :: String -> String0 # showList :: [String] -> ShowS #
Show BimapException
Instance details Defined in Data.Bimap Methods showsPrec :: Int -> BimapException -> ShowS # show :: BimapException -> String # showList :: [BimapException] -> ShowS #
Show F2Poly
Instance details Defined in Data.Bit.F2Poly Methods showsPrec :: Int -> F2Poly -> ShowS # show :: F2Poly -> String # showList :: [F2Poly] -> ShowS #
Show Bit
Instance details Defined in Data.Bit.Internal Methods showsPrec :: Int -> Bit -> ShowS # show :: Bit -> String # showList :: [Bit] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods showsPrec :: Int -> ShortByteString -> ShowS # show :: ShortByteString -> String # showList :: [ShortByteString] -> ShowS #
Show IntSet
Instance details Defined in Data.IntSet.Internal Methods showsPrec :: Int -> IntSet -> ShowS # show :: IntSet -> String # showList :: [IntSet] -> ShowS #
Show CryptoError
Instance details Defined in Crypto.Error.Types Methods showsPrec :: Int -> CryptoError -> ShowS # show :: CryptoError -> String # showList :: [CryptoError] -> ShowS #
Show Blake2b_160
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_160 -> ShowS # show :: Blake2b_160 -> String # showList :: [Blake2b_160] -> ShowS #
Show Blake2b_224
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_224 -> ShowS # show :: Blake2b_224 -> String # showList :: [Blake2b_224] -> ShowS #
Show Blake2b_256
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_256 -> ShowS # show :: Blake2b_256 -> String # showList :: [Blake2b_256] -> ShowS #
Show Blake2b_384
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_384 -> ShowS # show :: Blake2b_384 -> String # showList :: [Blake2b_384] -> ShowS #
Show Blake2b_512
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_512 -> ShowS # show :: Blake2b_512 -> String # showList :: [Blake2b_512] -> ShowS #
Show Blake2bp_512
Instance details Defined in Crypto.Hash.Blake2bp Methods showsPrec :: Int -> Blake2bp_512 -> ShowS # show :: Blake2bp_512 -> String # showList :: [Blake2bp_512] -> ShowS #
Show Blake2s_160
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_160 -> ShowS # show :: Blake2s_160 -> String # showList :: [Blake2s_160] -> ShowS #
Show Blake2s_224
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_224 -> ShowS # show :: Blake2s_224 -> String # showList :: [Blake2s_224] -> ShowS #
Show Blake2s_256
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_256 -> ShowS # show :: Blake2s_256 -> String # showList :: [Blake2s_256] -> ShowS #
Show Blake2sp_224
Instance details Defined in Crypto.Hash.Blake2sp Methods showsPrec :: Int -> Blake2sp_224 -> ShowS # show :: Blake2sp_224 -> String # showList :: [Blake2sp_224] -> ShowS #
Show Blake2sp_256
Instance details Defined in Crypto.Hash.Blake2sp Methods showsPrec :: Int -> Blake2sp_256 -> ShowS # show :: Blake2sp_256 -> String # showList :: [Blake2sp_256] -> ShowS #
Show Keccak_224
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_224 -> ShowS # show :: Keccak_224 -> String # showList :: [Keccak_224] -> ShowS #
Show Keccak_256
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_256 -> ShowS # show :: Keccak_256 -> String # showList :: [Keccak_256] -> ShowS #
Show Keccak_384
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_384 -> ShowS # show :: Keccak_384 -> String # showList :: [Keccak_384] -> ShowS #
Show Keccak_512
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_512 -> ShowS # show :: Keccak_512 -> String # showList :: [Keccak_512] -> ShowS #
Show MD2
Instance details Defined in Crypto.Hash.MD2 Methods showsPrec :: Int -> MD2 -> ShowS # show :: MD2 -> String # showList :: [MD2] -> ShowS #
Show MD4
Instance details Defined in Crypto.Hash.MD4 Methods showsPrec :: Int -> MD4 -> ShowS # show :: MD4 -> String # showList :: [MD4] -> ShowS #
Show MD5
Instance details Defined in Crypto.Hash.MD5 Methods showsPrec :: Int -> MD5 -> ShowS # show :: MD5 -> String # showList :: [MD5] -> ShowS #
Show RIPEMD160
Instance details Defined in Crypto.Hash.RIPEMD160 Methods showsPrec :: Int -> RIPEMD160 -> ShowS # show :: RIPEMD160 -> String # showList :: [RIPEMD160] -> ShowS #
Show SHA1
Instance details Defined in Crypto.Hash.SHA1 Methods showsPrec :: Int -> SHA1 -> ShowS # show :: SHA1 -> String # showList :: [SHA1] -> ShowS #
Show SHA224
Instance details Defined in Crypto.Hash.SHA224 Methods showsPrec :: Int -> SHA224 -> ShowS # show :: SHA224 -> String # showList :: [SHA224] -> ShowS #
Show SHA256
Instance details Defined in Crypto.Hash.SHA256 Methods showsPrec :: Int -> SHA256 -> ShowS # show :: SHA256 -> String # showList :: [SHA256] -> ShowS #
Show SHA3_224
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_224 -> ShowS # show :: SHA3_224 -> String # showList :: [SHA3_224] -> ShowS #
Show SHA3_256
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_256 -> ShowS # show :: SHA3_256 -> String # showList :: [SHA3_256] -> ShowS #
Show SHA3_384
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_384 -> ShowS # show :: SHA3_384 -> String # showList :: [SHA3_384] -> ShowS #
Show SHA3_512
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_512 -> ShowS # show :: SHA3_512 -> String # showList :: [SHA3_512] -> ShowS #
Show SHA384
Instance details Defined in Crypto.Hash.SHA384 Methods showsPrec :: Int -> SHA384 -> ShowS # show :: SHA384 -> String # showList :: [SHA384] -> ShowS #
Show SHA512
Instance details Defined in Crypto.Hash.SHA512 Methods showsPrec :: Int -> SHA512 -> ShowS # show :: SHA512 -> String # showList :: [SHA512] -> ShowS #
Show SHA512t_224
Instance details Defined in Crypto.Hash.SHA512t Methods showsPrec :: Int -> SHA512t_224 -> ShowS # show :: SHA512t_224 -> String # showList :: [SHA512t_224] -> ShowS #
Show SHA512t_256
Instance details Defined in Crypto.Hash.SHA512t Methods showsPrec :: Int -> SHA512t_256 -> ShowS # show :: SHA512t_256 -> String # showList :: [SHA512t_256] -> ShowS #
Show Skein256_224
Instance details Defined in Crypto.Hash.Skein256 Methods showsPrec :: Int -> Skein256_224 -> ShowS # show :: Skein256_224 -> String # showList :: [Skein256_224] -> ShowS #
Show Skein256_256
Instance details Defined in Crypto.Hash.Skein256 Methods showsPrec :: Int -> Skein256_256 -> ShowS # show :: Skein256_256 -> String # showList :: [Skein256_256] -> ShowS #
Show Skein512_224
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_224 -> ShowS # show :: Skein512_224 -> String # showList :: [Skein512_224] -> ShowS #
Show Skein512_256
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_256 -> ShowS # show :: Skein512_256 -> String # showList :: [Skein512_256] -> ShowS #
Show Skein512_384
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_384 -> ShowS # show :: Skein512_384 -> String # showList :: [Skein512_384] -> ShowS #
Show Skein512_512
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_512 -> ShowS # show :: Skein512_512 -> String # showList :: [Skein512_512] -> ShowS #
Show Tiger
Instance details Defined in Crypto.Hash.Tiger Methods showsPrec :: Int -> Tiger -> ShowS # show :: Tiger -> String # showList :: [Tiger] -> ShowS #
Show Whirlpool
Instance details Defined in Crypto.Hash.Whirlpool Methods showsPrec :: Int -> Whirlpool -> ShowS # show :: Whirlpool -> String # showList :: [Whirlpool] -> ShowS #
Show ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS # show :: ForeignSrcLang -> String # showList :: [ForeignSrcLang] -> ShowS #
Show Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Show KindRep
Instance details Defined in GHC.Show Methods showsPrec :: Int -> KindRep -> ShowS # show :: KindRep -> String # showList :: [KindRep] -> ShowS #
Show Module	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show Ordering	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Ordering -> ShowS # show :: Ordering -> String # showList :: [Ordering] -> ShowS #
Show TrName	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TrName -> ShowS # show :: TrName -> String # showList :: [TrName] -> ShowS #
Show TyCon	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TyCon -> ShowS # show :: TyCon -> String # showList :: [TyCon] -> ShowS #
Show TypeLitSort	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TypeLitSort -> ShowS # show :: TypeLitSort -> String # showList :: [TypeLitSort] -> ShowS #
Show BlstError
Instance details Defined in Crypto.BLST.Internal.Bindings Methods showsPrec :: Int -> BlstError -> ShowS # show :: BlstError -> String # showList :: [BlstError] -> ShowS #
Show EncodeMethod
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods showsPrec :: Int -> EncodeMethod -> ShowS # show :: EncodeMethod -> String # showList :: [EncodeMethod] -> ShowS #
Show Scalar
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods showsPrec :: Int -> Scalar -> ShowS # show :: Scalar -> String # showList :: [Scalar] -> ShowS #
Show SecretKey
Instance details Defined in Crypto.BLST.Internal.Types Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods showsPrec :: Int -> DefName -> ShowS # show :: DefName -> String # showList :: [DefName] -> ShowS #
Show NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods showsPrec :: Int -> NRational -> ShowS # show :: NRational -> String # showList :: [NRational] -> ShowS #
Show Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods showsPrec :: Int -> Rational -> ShowS # show :: Rational -> String # showList :: [Rational] -> ShowS #
Show EpCallingStep Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods showsPrec :: Int -> EpCallingStep -> ShowS # show :: EpCallingStep -> String # showList :: [EpCallingStep] -> ShowS #
Show ExtConversionError Source #
Instance details Defined in Lorentz.Extensible Methods showsPrec :: Int -> ExtConversionError -> ShowS # show :: ExtConversionError -> String # showList :: [ExtConversionError] -> ShowS #
Show EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> EntrypointLookupError -> ShowS # show :: EntrypointLookupError -> String # showList :: [EntrypointLookupError] -> ShowS #
Show Never Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> Never -> ShowS # show :: Never -> String # showList :: [Never] -> ShowS #
Show OpenChest Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> OpenChest -> ShowS # show :: OpenChest -> String # showList :: [OpenChest] -> ShowS #
Show ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods showsPrec :: Int -> ViewInterfaceMatchError -> ShowS # show :: ViewInterfaceMatchError -> String # showList :: [ViewInterfaceMatchError] -> ShowS #
Show ZSNil Source #
Instance details Defined in Lorentz.Zip Methods showsPrec :: Int -> ZSNil -> ShowS # show :: ZSNil -> String # showList :: [ZSNil] -> ShowS #
Show InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> InvalidPosException -> ShowS # show :: InvalidPosException -> String # showList :: [InvalidPosException] -> ShowS #
Show Pos
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> SourcePos -> ShowS # show :: SourcePos -> String # showList :: [SourcePos] -> ShowS #
Show FromExpErrorReason
Instance details Defined in Morley.Micheline.Class Methods showsPrec :: Int -> FromExpErrorReason -> ShowS # show :: FromExpErrorReason -> String # showList :: [FromExpErrorReason] -> ShowS #
Show Annotation
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> Annotation -> ShowS # show :: Annotation -> String # showList :: [Annotation] -> ShowS #
Show MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods showsPrec :: Int -> MichelinePrimitive -> ShowS # show :: MichelinePrimitive -> String # showList :: [MichelinePrimitive] -> ShowS #
Show MichelinePrimitiveTag
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods showsPrec :: Int -> MichelinePrimitiveTag -> ShowS # show :: MichelinePrimitiveTag -> String # showList :: [MichelinePrimitiveTag] -> ShowS #
Show TezosMutez
Instance details Defined in Morley.Micheline.Json Methods showsPrec :: Int -> TezosMutez -> ShowS # show :: TezosMutez -> String # showList :: [TezosMutez] -> ShowS #
Show AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods showsPrec :: Int -> AnalyzerRes -> ShowS # show :: AnalyzerRes -> String # showList :: [AnalyzerRes] -> ShowS #
Show DocGrouping
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocGrouping -> ShowS # show :: DocGrouping -> String # showList :: [DocGrouping] -> ShowS #
Show DocItemId
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemId -> ShowS # show :: DocItemId -> String # showList :: [DocItemId] -> ShowS #
Show DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemPos -> ShowS # show :: DocItemPos -> String # showList :: [DocItemPos] -> ShowS #
Show SomeDocItem
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> SomeDocItem -> ShowS # show :: SomeDocItem -> String # showList :: [SomeDocItem] -> ShowS #
Show ErrorSrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> ErrorSrcPos -> ShowS # show :: ErrorSrcPos -> String # showList :: [ErrorSrcPos] -> ShowS #
Show Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> SrcPos -> ShowS # show :: SrcPos -> String # showList :: [SrcPos] -> ShowS #
Show BadViewNameError
Instance details Defined in Morley.Michelson.Internal.ViewName Methods showsPrec :: Int -> BadViewNameError -> ShowS # show :: BadViewNameError -> String # showList :: [BadViewNameError] -> ShowS #
Show ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods showsPrec :: Int -> ViewName -> ShowS # show :: ViewName -> String # showList :: [ViewName] -> ShowS #
Show ViewsSetError
Instance details Defined in Morley.Michelson.Internal.ViewsSet Methods showsPrec :: Int -> ViewsSetError -> ShowS # show :: ViewsSetError -> String # showList :: [ViewsSetError] -> ShowS #
Show InterpreterState
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> InterpreterState -> ShowS # show :: InterpreterState -> String # showList :: [InterpreterState] -> ShowS #
Show MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MorleyLogs -> ShowS # show :: MorleyLogs -> String # showList :: [MorleyLogs] -> ShowS #
Show RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> RemainingSteps -> ShowS # show :: RemainingSteps -> String # showList :: [RemainingSteps] -> ShowS #
Show ViewLookupError
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> ViewLookupError -> ShowS # show :: ViewLookupError -> String # showList :: [ViewLookupError] -> ShowS #
Show CadrStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> CadrStruct -> ShowS # show :: CadrStruct -> String # showList :: [CadrStruct] -> ShowS #
Show Macro
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> Macro -> ShowS # show :: Macro -> String # showList :: [Macro] -> ShowS #
Show PairStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> PairStruct -> ShowS # show :: PairStruct -> String # showList :: [PairStruct] -> ShowS #
Show ParsedOp
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> ParsedOp -> ShowS # show :: ParsedOp -> String # showList :: [ParsedOp] -> ShowS #
Show UnpairStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> UnpairStruct -> ShowS # show :: UnpairStruct -> String # showList :: [UnpairStruct] -> ShowS #
Show CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> CustomParserException -> ShowS # show :: CustomParserException -> String # showList :: [CustomParserException] -> ShowS #
Show ParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> ParserException -> ShowS # show :: ParserException -> String # showList :: [ParserException] -> ShowS #
Show StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> StringLiteralParserException -> ShowS # show :: StringLiteralParserException -> String # showList :: [StringLiteralParserException] -> ShowS #
Show MichelsonSource
Instance details Defined in Morley.Michelson.Parser.Types Methods showsPrec :: Int -> MichelsonSource -> ShowS # show :: MichelsonSource -> String # showList :: [MichelsonSource] -> ShowS #
Show ParserOptions
Instance details Defined in Morley.Michelson.Parser.Types Methods showsPrec :: Int -> ParserOptions -> ShowS # show :: ParserOptions -> String # showList :: [ParserOptions] -> ShowS #
Show BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> BigMapCounter -> ShowS # show :: BigMapCounter -> String # showList :: [BigMapCounter] -> ShowS #
Show ContractState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> ContractState -> ShowS # show :: ContractState -> String # showList :: [ContractState] -> ShowS #
Show GState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GState -> ShowS # show :: GState -> String # showList :: [GState] -> ShowS #
Show GStateParseError
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateParseError -> ShowS # show :: GStateParseError -> String # showList :: [GStateParseError] -> ShowS #
Show GStateUpdate
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateUpdate -> ShowS # show :: GStateUpdate -> String # showList :: [GStateUpdate] -> ShowS #
Show GStateUpdateError
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateUpdateError -> ShowS # show :: GStateUpdateError -> String # showList :: [GStateUpdateError] -> ShowS #
Show ImplicitState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> ImplicitState -> ShowS # show :: ImplicitState -> String # showList :: [ImplicitState] -> ShowS #
Show TicketKey
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> TicketKey -> ShowS # show :: TicketKey -> String # showList :: [TicketKey] -> ShowS #
Show VotingPowers
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> VotingPowers -> ShowS # show :: VotingPowers -> String # showList :: [VotingPowers] -> ShowS #
Show MText
Instance details Defined in Morley.Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
Show ExtError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> ExtError -> ShowS # show :: ExtError -> String # showList :: [ExtError] -> ShowS #
Show StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> StackSize -> ShowS # show :: StackSize -> String # showList :: [StackSize] -> ShowS #
Show TcTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TcTypeError -> ShowS # show :: TcTypeError -> String # showList :: [TcTypeError] -> ShowS #
Show TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TopLevelType -> ShowS # show :: TopLevelType -> String # showList :: [TopLevelType] -> ShowS #
Show TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TypeContext -> ShowS # show :: TypeContext -> String # showList :: [TypeContext] -> ShowS #
Show SomeParamType
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods showsPrec :: Int -> SomeParamType -> ShowS # show :: SomeParamType -> String # showList :: [SomeParamType] -> ShowS #
Show Nesting
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods showsPrec :: Int -> Nesting -> ShowS # show :: Nesting -> String # showList :: [Nesting] -> ShowS #
Show SomeSingInstr
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods showsPrec :: Int -> SomeSingInstr -> ShowS # show :: SomeSingInstr -> String # showList :: [SomeSingInstr] -> ShowS #
Show SomeHST
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeHST -> ShowS # show :: SomeHST -> String # showList :: [SomeHST] -> ShowS #
Show SomeAnnotatedValue
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods showsPrec :: Int -> SomeAnnotatedValue -> ShowS # show :: SomeAnnotatedValue -> String # showList :: [SomeAnnotatedValue] -> ShowS #
Show MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> MutezArithErrorType -> ShowS # show :: MutezArithErrorType -> String # showList :: [MutezArithErrorType] -> ShowS #
Show ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> ShiftArithErrorType -> ShowS # show :: ShiftArithErrorType -> String # showList :: [ShiftArithErrorType] -> ShowS #
Show FailureType
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods showsPrec :: Int -> FailureType -> ShowS # show :: FailureType -> String # showList :: [FailureType] -> ShowS #
Show HasAnns
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods showsPrec :: Int -> HasAnns -> ShowS # show :: HasAnns -> String # showList :: [HasAnns] -> ShowS #
Show IsMichelson
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods showsPrec :: Int -> IsMichelson -> ShowS # show :: IsMichelson -> String # showList :: [IsMichelson] -> ShowS #
Show NumChildren
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods showsPrec :: Int -> NumChildren -> ShowS # show :: NumChildren -> String # showList :: [NumChildren] -> ShowS #
Show UntypingOptions
Instance details Defined in Morley.Michelson.Typed.Convert Methods showsPrec :: Int -> UntypingOptions -> ShowS # show :: UntypingOptions -> String # showList :: [UntypingOptions] -> ShowS #
Show ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ArmCoord -> ShowS # show :: ArmCoord -> String # showList :: [ArmCoord] -> ShowS #
Show EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
Show ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParamEpError -> ShowS # show :: ParamEpError -> String # showList :: [ParamEpError] -> ShowS #
Show ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParseEpAddressError -> ShowS # show :: ParseEpAddressError -> String # showList :: [ParseEpAddressError] -> ShowS #
Show SomeContract
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeContract -> ShowS # show :: SomeContract -> String # showList :: [SomeContract] -> ShowS #
Show SomeContractAndStorage
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeContractAndStorage -> ShowS # show :: SomeContractAndStorage -> String # showList :: [SomeContractAndStorage] -> ShowS #
Show CommentType
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> CommentType -> ShowS # show :: CommentType -> String # showList :: [CommentType] -> ShowS #
Show SomeMeta
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> SomeMeta -> ShowS # show :: SomeMeta -> String # showList :: [SomeMeta] -> ShowS #
Show EmitOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> EmitOperation -> ShowS # show :: EmitOperation -> String # showList :: [EmitOperation] -> ShowS #
Show OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> OperationHash -> ShowS # show :: OperationHash -> String # showList :: [OperationHash] -> ShowS #
Show OriginationOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> OriginationOperation -> ShowS # show :: OriginationOperation -> String # showList :: [OriginationOperation] -> ShowS #
Show SetDelegateOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> SetDelegateOperation -> ShowS # show :: SetDelegateOperation -> String # showList :: [SetDelegateOperation] -> ShowS #
Show TransferOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> TransferOperation -> ShowS # show :: TransferOperation -> String # showList :: [TransferOperation] -> ShowS #
Show BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.WellTyped Methods showsPrec :: Int -> BadTypeForScope -> ShowS # show :: BadTypeForScope -> String # showList :: [BadTypeForScope] -> ShowS #
Show T
Instance details Defined in Morley.Michelson.Typed.T Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Show SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> SetDelegate -> ShowS # show :: SetDelegate -> String # showList :: [SetDelegate] -> ShowS #
Show AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> AnnotationSet -> ShowS # show :: AnnotationSet -> String # showList :: [AnnotationSet] -> ShowS #
Show AnyAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> AnyAnn -> ShowS # show :: AnyAnn -> String # showList :: [AnyAnn] -> ShowS #
Show VarAnns
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> VarAnns -> ShowS # show :: VarAnns -> String # showList :: [VarAnns] -> ShowS #
Show ContractBlockError
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> ContractBlockError -> ShowS # show :: ContractBlockError -> String # showList :: [ContractBlockError] -> ShowS #
Show EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> EntriesOrder -> ShowS # show :: EntriesOrder -> String # showList :: [EntriesOrder] -> ShowS #
Show Entry
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> Entry -> ShowS # show :: Entry -> String # showList :: [Entry] -> ShowS #
Show EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
Show EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpNameFromRefAnnError -> ShowS # show :: EpNameFromRefAnnError -> String # showList :: [EpNameFromRefAnnError] -> ShowS #
Show HandleImplicitDefaultEp
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> HandleImplicitDefaultEp -> ShowS # show :: HandleImplicitDefaultEp -> String # showList :: [HandleImplicitDefaultEp] -> ShowS #
Show PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> PrintComment -> ShowS # show :: PrintComment -> String # showList :: [PrintComment] -> ShowS #
Show StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> StackRef -> ShowS # show :: StackRef -> String # showList :: [StackRef] -> ShowS #
Show StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> StackTypePattern -> ShowS # show :: StackTypePattern -> String # showList :: [StackTypePattern] -> ShowS #
Show TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> TyVar -> ShowS # show :: TyVar -> String # showList :: [TyVar] -> ShowS #
Show Var
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> Var -> ShowS # show :: Var -> String # showList :: [Var] -> ShowS #
Show ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Methods showsPrec :: Int -> ExpandedOp -> ShowS # show :: ExpandedOp -> String # showList :: [ExpandedOp] -> ShowS #
Show ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> ParameterType -> ShowS # show :: ParameterType -> String # showList :: [ParameterType] -> ShowS #
Show T
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Show Ty
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> Ty -> ShowS # show :: Ty -> String # showList :: [Ty] -> ShowS #
Show InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> InternalByteString -> ShowS # show :: InternalByteString -> String # showList :: [InternalByteString] -> ShowS #
Show GlobalCounter
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> GlobalCounter -> ShowS # show :: GlobalCounter -> String # showList :: [GlobalCounter] -> ShowS #
Show ParseAddressError
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ParseAddressError -> ShowS # show :: ParseAddressError -> String # showList :: [ParseAddressError] -> ShowS #
Show ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ParseAddressRawError -> ShowS # show :: ParseAddressRawError -> String # showList :: [ParseAddressRawError] -> ShowS #
Show AddressKind
Instance details Defined in Morley.Tezos.Address.Kinds Methods showsPrec :: Int -> AddressKind -> ShowS # show :: AddressKind -> String # showList :: [AddressKind] -> ShowS #
Show ChainId
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> ChainId -> ShowS # show :: ChainId -> String # showList :: [ChainId] -> ShowS #
Show Mutez
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Mutez -> ShowS # show :: Mutez -> String # showList :: [Mutez] -> ShowS #
Show ParseChainIdError
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> ParseChainIdError -> ShowS # show :: ParseChainIdError -> String # showList :: [ParseChainIdError] -> ShowS #
Show Timestamp
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Timestamp -> ShowS # show :: Timestamp -> String # showList :: [Timestamp] -> ShowS #
Show KeyType
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> KeyType -> ShowS # show :: KeyType -> String # showList :: [KeyType] -> ShowS #
Show ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> ParseSignatureRawError -> ShowS # show :: ParseSignatureRawError -> String # showList :: [ParseSignatureRawError] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.BLS Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.BLS Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.BLS Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381Fr -> ShowS # show :: Bls12381Fr -> String # showList :: [Bls12381Fr] -> ShowS #
Show Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G1 -> ShowS # show :: Bls12381G1 -> String # showList :: [Bls12381G1] -> ShowS #
Show Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G2 -> ShowS # show :: Bls12381G2 -> String # showList :: [Bls12381G2] -> ShowS #
Show DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> DeserializationError -> ShowS # show :: DeserializationError -> String # showList :: [DeserializationError] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Chest -> ShowS # show :: Chest -> String # showList :: [Chest] -> ShowS #
Show ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> ChestKey -> ShowS # show :: ChestKey -> String # showList :: [ChestKey] -> ShowS #
Show Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Ciphertext -> ShowS # show :: Ciphertext -> String # showList :: [Ciphertext] -> ShowS #
Show Locked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Locked -> ShowS # show :: Locked -> String # showList :: [Locked] -> ShowS #
Show Nonce
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Nonce -> ShowS # show :: Nonce -> String # showList :: [Nonce] -> ShowS #
Show OpeningResult
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> OpeningResult -> ShowS # show :: OpeningResult -> String # showList :: [OpeningResult] -> ShowS #
Show Proof
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Proof -> ShowS # show :: Proof -> String # showList :: [Proof] -> ShowS #
Show PublicModulus
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> PublicModulus -> ShowS # show :: PublicModulus -> String # showList :: [PublicModulus] -> ShowS #
Show RSAFactors
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> RSAFactors -> ShowS # show :: RSAFactors -> String # showList :: [RSAFactors] -> ShowS #
Show SymmetricKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> SymmetricKey -> ShowS # show :: SymmetricKey -> String # showList :: [SymmetricKey] -> ShowS #
Show TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> TLTime -> ShowS # show :: TLTime -> String # showList :: [TLTime] -> ShowS #
Show Unlocked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Unlocked -> ShowS # show :: Unlocked -> String # showList :: [Unlocked] -> ShowS #
Show B58CheckWithPrefixError
Instance details Defined in Morley.Tezos.Crypto.Util Methods showsPrec :: Int -> B58CheckWithPrefixError -> ShowS # show :: B58CheckWithPrefixError -> String # showList :: [B58CheckWithPrefixError] -> ShowS #
Show CryptoParseError
Instance details Defined in Morley.Tezos.Crypto.Util Methods showsPrec :: Int -> CryptoParseError -> ShowS # show :: CryptoParseError -> String # showList :: [CryptoParseError] -> ShowS #
Show UnpackError
Instance details Defined in Morley.Util.Binary Methods showsPrec :: Int -> UnpackError -> ShowS # show :: UnpackError -> String # showList :: [UnpackError] -> ShowS #
Show HexJSONByteString
Instance details Defined in Morley.Util.ByteString Methods showsPrec :: Int -> HexJSONByteString -> ShowS # show :: HexJSONByteString -> String # showList :: [HexJSONByteString] -> ShowS #
Show Word62
Instance details Defined in Morley.Prelude.Word Methods showsPrec :: Int -> Word62 -> ShowS # show :: Word62 -> String # showList :: [Word62] -> ShowS #
Show Word63
Instance details Defined in Morley.Prelude.Word Methods showsPrec :: Int -> Word63 -> ShowS # show :: Word63 -> String # showList :: [Word63] -> ShowS #
Show AltNodeType
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> AltNodeType -> ShowS # show :: AltNodeType -> String # showList :: [AltNodeType] -> ShowS #
Show ArgPolicy
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgPolicy -> ShowS # show :: ArgPolicy -> String # showList :: [ArgPolicy] -> ShowS #
Show ArgumentReachability
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgumentReachability -> ShowS # show :: ArgumentReachability -> String # showList :: [ArgumentReachability] -> ShowS #
Show Backtracking
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Backtracking -> ShowS # show :: Backtracking -> String # showList :: [Backtracking] -> ShowS #
Show CompletionResult
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> CompletionResult -> ShowS # show :: CompletionResult -> String # showList :: [CompletionResult] -> ShowS #
Show IsCmdStart
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> IsCmdStart -> ShowS # show :: IsCmdStart -> String # showList :: [IsCmdStart] -> ShowS #
Show OptName
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptName -> ShowS # show :: OptName -> String # showList :: [OptName] -> ShowS #
Show OptProperties
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptProperties -> ShowS # show :: OptProperties -> String # showList :: [OptProperties] -> ShowS #
Show OptVisibility
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptVisibility -> ShowS # show :: OptVisibility -> String # showList :: [OptVisibility] -> ShowS #
Show ParserPrefs
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserPrefs -> ShowS # show :: ParserPrefs -> String # showList :: [ParserPrefs] -> ShowS #
Show Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Mode -> ShowS # show :: Mode -> String # showList :: [Mode] -> ShowS #
Show Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Style -> ShowS # show :: Style -> String # showList :: [Style] -> ShowS #
Show TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> TextDetails -> ShowS # show :: TextDetails -> String # showList :: [TextDetails] -> ShowS #
Show Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods showsPrec :: Int -> Doc -> ShowS # show :: Doc -> String # showList :: [Doc] -> ShowS #
Show FusionDepth
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> FusionDepth -> ShowS # show :: FusionDepth -> String # showList :: [FusionDepth] -> ShowS #
Show LayoutOptions
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> LayoutOptions -> ShowS # show :: LayoutOptions -> String # showList :: [LayoutOptions] -> ShowS #
Show PageWidth
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> PageWidth -> ShowS # show :: PageWidth -> String # showList :: [PageWidth] -> ShowS #
Show ByteArray	Behavior changed in 0.7.2.0. Before 0.7.2.0, this instance rendered 8-bit words less than 16 as a single hexadecimal digit (e.g. 13 was `0xD`). Starting with 0.7.2.0, all 8-bit words are represented as two digits (e.g. 13 is `0x0D`). Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods showsPrec :: Int -> ByteArray -> ShowS # show :: ByteArray -> String # showList :: [ByteArray] -> ShowS #
Show StdGen
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StdGen -> ShowS # show :: StdGen -> String # showList :: [StdGen] -> ShowS #
Show Scientific	See `formatScientific` if you need more control over the rendering.
Instance details Defined in Data.Scientific Methods showsPrec :: Int -> Scientific -> ShowS # show :: Scientific -> String # showList :: [Scientific] -> ShowS #
Show Mod2
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Mod2 -> ShowS # show :: Mod2 -> String # showList :: [Mod2] -> ShowS #
Show DependencyType
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> DependencyType -> ShowS # show :: DependencyType -> String # showList :: [DependencyType] -> ShowS #
Show FailureReason
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> FailureReason -> ShowS # show :: FailureReason -> String # showList :: [FailureReason] -> ShowS #
Show Outcome
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Outcome -> ShowS # show :: Outcome -> String # showList :: [Outcome] -> ShowS #
Show Progress
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Progress -> ShowS # show :: Progress -> String # showList :: [Progress] -> ShowS #
Show ResourceError
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> ResourceError -> ShowS # show :: ResourceError -> String # showList :: [ResourceError] -> ShowS #
Show Result
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Result -> ShowS # show :: Result -> String # showList :: [Result] -> ShowS #
Show Expr
Instance details Defined in Test.Tasty.Patterns.Types Methods showsPrec :: Int -> Expr -> ShowS # show :: Expr -> String # showList :: [Expr] -> ShowS #
Show AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnLookup -> ShowS # show :: AnnLookup -> String # showList :: [AnnLookup] -> ShowS #
Show AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnTarget -> ShowS # show :: AnnTarget -> String # showList :: [AnnTarget] -> ShowS #
Show Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bang -> ShowS # show :: Bang -> String # showList :: [Bang] -> ShowS #
Show Body
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Body -> ShowS # show :: Body -> String # showList :: [Body] -> ShowS #
Show Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bytes -> ShowS # show :: Bytes -> String # showList :: [Bytes] -> ShowS #
Show Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Callconv -> ShowS # show :: Callconv -> String # showList :: [Callconv] -> ShowS #
Show Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Clause -> ShowS # show :: Clause -> String # showList :: [Clause] -> ShowS #
Show Con
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Con -> ShowS # show :: Con -> String # showList :: [Con] -> ShowS #
Show Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Dec -> ShowS # show :: Dec -> String # showList :: [Dec] -> ShowS #
Show DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivClause -> ShowS # show :: DerivClause -> String # showList :: [DerivClause] -> ShowS #
Show DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivStrategy -> ShowS # show :: DerivStrategy -> String # showList :: [DerivStrategy] -> ShowS #
Show DocLoc
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DocLoc -> ShowS # show :: DocLoc -> String # showList :: [DocLoc] -> ShowS #
Show Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Exp -> ShowS # show :: Exp -> String # showList :: [Exp] -> ShowS #
Show FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FamilyResultSig -> ShowS # show :: FamilyResultSig -> String # showList :: [FamilyResultSig] -> ShowS #
Show Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FixityDirection -> ShowS # show :: FixityDirection -> String # showList :: [FixityDirection] -> ShowS #
Show Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Foreign -> ShowS # show :: Foreign -> String # showList :: [Foreign] -> ShowS #
Show FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FunDep -> ShowS # show :: FunDep -> String # showList :: [FunDep] -> ShowS #
Show Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Guard -> ShowS # show :: Guard -> String # showList :: [Guard] -> ShowS #
Show Info
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Info -> ShowS # show :: Info -> String # showList :: [Info] -> ShowS #
Show InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> InjectivityAnn -> ShowS # show :: InjectivityAnn -> String # showList :: [InjectivityAnn] -> ShowS #
Show Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Inline -> ShowS # show :: Inline -> String # showList :: [Inline] -> ShowS #
Show Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Lit -> ShowS # show :: Lit -> String # showList :: [Lit] -> ShowS #
Show Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Loc -> ShowS # show :: Loc -> String # showList :: [Loc] -> ShowS #
Show Match
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Match -> ShowS # show :: Match -> String # showList :: [Match] -> ShowS #
Show ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModName -> ShowS # show :: ModName -> String # showList :: [ModName] -> ShowS #
Show Module
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModuleInfo -> ShowS # show :: ModuleInfo -> String # showList :: [ModuleInfo] -> ShowS #
Show Name
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Name -> ShowS # show :: Name -> String # showList :: [Name] -> ShowS #
Show NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameFlavour -> ShowS # show :: NameFlavour -> String # showList :: [NameFlavour] -> ShowS #
Show NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameSpace -> ShowS # show :: NameSpace -> String # showList :: [NameSpace] -> ShowS #
Show OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> OccName -> ShowS # show :: OccName -> String # showList :: [OccName] -> ShowS #
Show Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Overlap -> ShowS # show :: Overlap -> String # showList :: [Overlap] -> ShowS #
Show Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pat -> ShowS # show :: Pat -> String # showList :: [Pat] -> ShowS #
Show PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynArgs -> ShowS # show :: PatSynArgs -> String # showList :: [PatSynArgs] -> ShowS #
Show PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynDir -> ShowS # show :: PatSynDir -> String # showList :: [PatSynDir] -> ShowS #
Show Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Phases -> ShowS # show :: Phases -> String # showList :: [Phases] -> ShowS #
Show PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PkgName -> ShowS # show :: PkgName -> String # showList :: [PkgName] -> ShowS #
Show Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pragma -> ShowS # show :: Pragma -> String # showList :: [Pragma] -> ShowS #
Show Range
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Range -> ShowS # show :: Range -> String # showList :: [Range] -> ShowS #
Show Role
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Role -> ShowS # show :: Role -> String # showList :: [Role] -> ShowS #
Show RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleBndr -> ShowS # show :: RuleBndr -> String # showList :: [RuleBndr] -> ShowS #
Show RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleMatch -> ShowS # show :: RuleMatch -> String # showList :: [RuleMatch] -> ShowS #
Show Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Safety -> ShowS # show :: Safety -> String # showList :: [Safety] -> ShowS #
Show SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show Specificity
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Specificity -> ShowS # show :: Specificity -> String # showList :: [Specificity] -> ShowS #
Show Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Stmt -> ShowS # show :: Stmt -> String # showList :: [Stmt] -> ShowS #
Show TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyLit -> ShowS # show :: TyLit -> String # showList :: [TyLit] -> ShowS #
Show TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TySynEqn -> ShowS # show :: TySynEqn -> String # showList :: [TySynEqn] -> ShowS #
Show Type
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Type -> ShowS # show :: Type -> String # showList :: [Type] -> ShowS #
Show TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TypeFamilyHead -> ShowS # show :: TypeFamilyHead -> String # showList :: [TypeFamilyHead] -> ShowS #
Show UnicodeException
Instance details Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS #
Show Builder
Instance details Defined in Data.Text.Internal.Builder Methods showsPrec :: Int -> Builder -> ShowS # show :: Builder -> String # showList :: [Builder] -> ShowS #
Show ShortText
Instance details Defined in Data.Text.Short.Internal Methods showsPrec :: Int -> ShortText -> ShowS # show :: ShortText -> String # showList :: [ShortText] -> ShowS #
Show ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorInfo -> ShowS # show :: ConstructorInfo -> String # showList :: [ConstructorInfo] -> ShowS #
Show ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorVariant -> ShowS # show :: ConstructorVariant -> String # showList :: [ConstructorVariant] -> ShowS #
Show DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeInfo -> ShowS # show :: DatatypeInfo -> String # showList :: [DatatypeInfo] -> ShowS #
Show DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeVariant -> ShowS # show :: DatatypeVariant -> String # showList :: [DatatypeVariant] -> ShowS #
Show FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> FieldStrictness -> ShowS # show :: FieldStrictness -> String # showList :: [FieldStrictness] -> ShowS #
Show Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Strictness -> ShowS # show :: Strictness -> String # showList :: [Strictness] -> ShowS #
Show Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Unpackedness -> ShowS # show :: Unpackedness -> String # showList :: [Unpackedness] -> ShowS #
Show DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DClause -> ShowS # show :: DClause -> String # showList :: [DClause] -> ShowS #
Show DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DCon -> ShowS # show :: DCon -> String # showList :: [DCon] -> ShowS #
Show DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DConFields -> ShowS # show :: DConFields -> String # showList :: [DConFields] -> ShowS #
Show DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDec -> ShowS # show :: DDec -> String # showList :: [DDec] -> ShowS #
Show DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivClause -> ShowS # show :: DDerivClause -> String # showList :: [DDerivClause] -> ShowS #
Show DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivStrategy -> ShowS # show :: DDerivStrategy -> String # showList :: [DDerivStrategy] -> ShowS #
Show DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DExp -> ShowS # show :: DExp -> String # showList :: [DExp] -> ShowS #
Show DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DFamilyResultSig -> ShowS # show :: DFamilyResultSig -> String # showList :: [DFamilyResultSig] -> ShowS #
Show DForallTelescope
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DForallTelescope -> ShowS # show :: DForallTelescope -> String # showList :: [DForallTelescope] -> ShowS #
Show DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DForeign -> ShowS # show :: DForeign -> String # showList :: [DForeign] -> ShowS #
Show DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DInfo -> ShowS # show :: DInfo -> String # showList :: [DInfo] -> ShowS #
Show DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DLetDec -> ShowS # show :: DLetDec -> String # showList :: [DLetDec] -> ShowS #
Show DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DMatch -> ShowS # show :: DMatch -> String # showList :: [DMatch] -> ShowS #
Show DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPat -> ShowS # show :: DPat -> String # showList :: [DPat] -> ShowS #
Show DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPatSynDir -> ShowS # show :: DPatSynDir -> String # showList :: [DPatSynDir] -> ShowS #
Show DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPragma -> ShowS # show :: DPragma -> String # showList :: [DPragma] -> ShowS #
Show DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DRuleBndr -> ShowS # show :: DRuleBndr -> String # showList :: [DRuleBndr] -> ShowS #
Show DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTySynEqn -> ShowS # show :: DTySynEqn -> String # showList :: [DTySynEqn] -> ShowS #
Show DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DType -> ShowS # show :: DType -> String # showList :: [DType] -> ShowS #
Show DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTypeFamilyHead -> ShowS # show :: DTypeFamilyHead -> String # showList :: [DTypeFamilyHead] -> ShowS #
Show NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> NewOrData -> ShowS # show :: NewOrData -> String # showList :: [NewOrData] -> ShowS #
Show DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DFunArgs -> ShowS # show :: DFunArgs -> String # showList :: [DFunArgs] -> ShowS #
Show DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DTypeArg -> ShowS # show :: DTypeArg -> String # showList :: [DTypeArg] -> ShowS #
Show DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DVisFunArg -> ShowS # show :: DVisFunArg -> String # showList :: [DVisFunArg] -> ShowS #
Show LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods showsPrec :: Int -> LocalTime -> ShowS # show :: LocalTime -> String # showList :: [LocalTime] -> ShowS #
Show ZonedTime	For the time zone, this only shows the name, or offset if the name is empty.
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods showsPrec :: Int -> ZonedTime -> ShowS # show :: ZonedTime -> String # showList :: [ZonedTime] -> ShowS #
Show Undefined
Instance details Defined in Universum.Debug Methods showsPrec :: Int -> Undefined -> ShowS # show :: Undefined -> String # showList :: [Undefined] -> ShowS #
Show Bug
Instance details Defined in Universum.Exception Methods showsPrec :: Int -> Bug -> ShowS # show :: Bug -> String # showList :: [Bug] -> ShowS #
Show UUID	Pretty prints a `UUID` (without quotation marks). See also `toString`. `>>>` `show nil`"00000000-0000-0000-0000-000000000000"
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UUID -> ShowS # show :: UUID -> String # showList :: [UUID] -> ShowS #
Show UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UnpackedUUID -> ShowS # show :: UnpackedUUID -> String # showList :: [UnpackedUUID] -> ShowS #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Show Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Natural -> ShowS # show :: Natural -> String # showList :: [Natural] -> ShowS #
Show ()	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> () -> ShowS # show :: () -> String # showList :: [()] -> ShowS #
Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
Show Char	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Char -> ShowS # show :: Char -> String # showList :: [Char] -> ShowS #
Show Int	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Int -> ShowS # show :: Int -> String # showList :: [Int] -> ShowS #
Show Levity	Since: base-4.15.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Levity -> ShowS # show :: Levity -> String # showList :: [Levity] -> ShowS #
Show RuntimeRep	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> RuntimeRep -> ShowS # show :: RuntimeRep -> String # showList :: [RuntimeRep] -> ShowS #
Show VecCount	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecCount -> ShowS # show :: VecCount -> String # showList :: [VecCount] -> ShowS #
Show VecElem	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecElem -> ShowS # show :: VecElem -> String # showList :: [VecElem] -> ShowS #
Show Word	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Word -> ShowS # show :: Word -> String # showList :: [Word] -> ShowS #
() :=> (Show (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (a :- b) #
() :=> (Show (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (Dict a) #
() :=> (Show Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Ordering #
() :=> (Show Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Natural #
() :=> (Show ())
Instance details Defined in Data.Constraint Methods ins :: () :- Show () #
() :=> (Show Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Bool #
() :=> (Show Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Char #
() :=> (Show Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Int #
() :=> (Show Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Word #
Class () (Show a)
Instance details Defined in Data.Constraint Methods cls :: Show a :- () #
Show a => Show (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods showsPrec :: Int -> First' a -> ShowS # show :: First' a -> String # showList :: [First' a] -> ShowS #
Show a => Show (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods showsPrec :: Int -> Last' a -> ShowS # show :: Last' a -> String # showList :: [Last' a] -> ShowS #
Show a => Show (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods showsPrec :: Int -> Option' a -> ShowS # show :: Option' a -> String # showList :: [Option' a] -> ShowS #
Show a => Show (Only a)
Instance details Defined in Data.Tuple.Only Methods showsPrec :: Int -> Only a -> ShowS # show :: Only a -> String # showList :: [Only a] -> ShowS #
Show v => Show (KeyMap v)
Instance details Defined in Data.Aeson.KeyMap Methods showsPrec :: Int -> KeyMap v -> ShowS # show :: KeyMap v -> String # showList :: [KeyMap v] -> ShowS #
Show a => Show (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> IResult a -> ShowS # show :: IResult a -> String # showList :: [IResult a] -> ShowS #
Show a => Show (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Result a -> ShowS # show :: Result a -> String # showList :: [Result a] -> ShowS #
Show a => Show (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods showsPrec :: Int -> ZipList a -> ShowS # show :: ZipList a -> String # showList :: [ZipList a] -> ShowS #
Show a => Show (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods showsPrec :: Int -> Complex a -> ShowS # show :: Complex a -> String # showList :: [Complex a] -> ShowS #
Show a => Show (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Show a => Show (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show a => Show (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show a => Show (Down a)	This instance would be equivalent to the derived instances of the `Down` newtype if the `getDown` field were removed Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods showsPrec :: Int -> Down a -> ShowS # show :: Down a -> String # showList :: [Down a] -> ShowS #
Show a => Show (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show a => Show (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show a => Show (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Max a -> ShowS # show :: Max a -> String # showList :: [Max a] -> ShowS #
Show a => Show (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Min a -> ShowS # show :: Min a -> String # showList :: [Min a] -> ShowS #
Show m => Show (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS #
Show a => Show (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Dual a -> ShowS # show :: Dual a -> String # showList :: [Dual a] -> ShowS #
Show a => Show (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Product a -> ShowS # show :: Product a -> String # showList :: [Product a] -> ShowS #
Show a => Show (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Sum a -> ShowS # show :: Sum a -> String # showList :: [Sum a] -> ShowS #
Show p => Show (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Par1 p -> ShowS # show :: Par1 p -> String # showList :: [Par1 p] -> ShowS #
Show (FunPtr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> FunPtr a -> ShowS # show :: FunPtr a -> String # showList :: [FunPtr a] -> ShowS #
Show (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> Ptr a -> ShowS # show :: Ptr a -> String # showList :: [Ptr a] -> ShowS #
Show a => Show (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods showsPrec :: Int -> Ratio a -> ShowS # show :: Ratio a -> String # showList :: [Ratio a] -> ShowS #
Show (Bits n)
Instance details Defined in Basement.Bits Methods showsPrec :: Int -> Bits n -> ShowS # show :: Bits n -> String # showList :: [Bits n] -> ShowS #
(PrimType ty, Show ty) => Show (Block ty)
Instance details Defined in Basement.Block.Base Methods showsPrec :: Int -> Block ty -> ShowS # show :: Block ty -> String # showList :: [Block ty] -> ShowS #
Show (Zn n)
Instance details Defined in Basement.Bounded Methods showsPrec :: Int -> Zn n -> ShowS # show :: Zn n -> String # showList :: [Zn n] -> ShowS #
Show (Zn64 n)
Instance details Defined in Basement.Bounded Methods showsPrec :: Int -> Zn64 n -> ShowS # show :: Zn64 n -> String # showList :: [Zn64 n] -> ShowS #
Show a => Show (Array a)
Instance details Defined in Basement.BoxedArray Methods showsPrec :: Int -> Array a -> ShowS # show :: Array a -> String # showList :: [Array a] -> ShowS #
Show a => Show (NonEmpty a)
Instance details Defined in Basement.NonEmpty Methods showsPrec :: Int -> NonEmpty a -> ShowS # show :: NonEmpty a -> String # showList :: [NonEmpty a] -> ShowS #
Show (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> CountOf ty -> ShowS # show :: CountOf ty -> String # showList :: [CountOf ty] -> ShowS #
Show (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> Offset ty -> ShowS # show :: Offset ty -> String # showList :: [Offset ty] -> ShowS #
(PrimType ty, Show ty) => Show (UArray ty)
Instance details Defined in Basement.UArray.Base Methods showsPrec :: Int -> UArray ty -> ShowS # show :: UArray ty -> String # showList :: [UArray ty] -> ShowS #
Show (Dict a)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> Dict a -> ShowS # show :: Dict a -> String # showList :: [Dict a] -> ShowS #
Show vertex => Show (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods showsPrec :: Int -> SCC vertex -> ShowS # show :: SCC vertex -> String # showList :: [SCC vertex] -> ShowS #
Show a => Show (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods showsPrec :: Int -> IntMap a -> ShowS # show :: IntMap a -> String # showList :: [IntMap a] -> ShowS #
Show a => Show (Seq a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> Seq a -> ShowS # show :: Seq a -> String # showList :: [Seq a] -> ShowS #
Show a => Show (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewL a -> ShowS # show :: ViewL a -> String # showList :: [ViewL a] -> ShowS #
Show a => Show (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewR a -> ShowS # show :: ViewR a -> String # showList :: [ViewR a] -> ShowS #
Show a => Show (Intersection a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Intersection a -> ShowS # show :: Intersection a -> String # showList :: [Intersection a] -> ShowS #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
Show a => Show (Tree a)
Instance details Defined in Data.Tree Methods showsPrec :: Int -> Tree a -> ShowS # show :: Tree a -> String # showList :: [Tree a] -> ShowS #
Show a => Show (CryptoFailable a)
Instance details Defined in Crypto.Error.Types Methods showsPrec :: Int -> CryptoFailable a -> ShowS # show :: CryptoFailable a -> String # showList :: [CryptoFailable a] -> ShowS #
Show (Blake2b bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2b bitlen -> ShowS # show :: Blake2b bitlen -> String # showList :: [Blake2b bitlen] -> ShowS #
Show (Blake2bp bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2bp bitlen -> ShowS # show :: Blake2bp bitlen -> String # showList :: [Blake2bp bitlen] -> ShowS #
Show (Blake2s bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2s bitlen -> ShowS # show :: Blake2s bitlen -> String # showList :: [Blake2s bitlen] -> ShowS #
Show (Blake2sp bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2sp bitlen -> ShowS # show :: Blake2sp bitlen -> String # showList :: [Blake2sp bitlen] -> ShowS #
Show (SHAKE128 bitlen)
Instance details Defined in Crypto.Hash.SHAKE Methods showsPrec :: Int -> SHAKE128 bitlen -> ShowS # show :: SHAKE128 bitlen -> String # showList :: [SHAKE128 bitlen] -> ShowS #
Show (SHAKE256 bitlen)
Instance details Defined in Crypto.Hash.SHAKE Methods showsPrec :: Int -> SHAKE256 bitlen -> ShowS # show :: SHAKE256 bitlen -> String # showList :: [SHAKE256 bitlen] -> ShowS #
Show (Digest a)
Instance details Defined in Crypto.Hash.Types Methods showsPrec :: Int -> Digest a -> ShowS # show :: Digest a -> String # showList :: [Digest a] -> ShowS #
Show1 f => Show (Fix f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Fix f -> ShowS # show :: Fix f -> String # showList :: [Fix f] -> ShowS #
(Functor f, Show1 f) => Show (Mu f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Mu f -> ShowS # show :: Mu f -> String # showList :: [Mu f] -> ShowS #
(Functor f, Show1 f) => Show (Nu f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Nu f -> ShowS # show :: Nu f -> String # showList :: [Nu f] -> ShowS #
Show a => Show (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods showsPrec :: Int -> DNonEmpty a -> ShowS # show :: DNonEmpty a -> String # showList :: [DNonEmpty a] -> ShowS #
Show a => Show (DList a)
Instance details Defined in Data.DList.Internal Methods showsPrec :: Int -> DList a -> ShowS # show :: DList a -> String # showList :: [DList a] -> ShowS #
Show a => Show (ExitCase a)
Instance details Defined in Control.Monad.Catch Methods showsPrec :: Int -> ExitCase a -> ShowS # show :: ExitCase a -> String # showList :: [ExitCase a] -> ShowS #
Show (Finite n)
Instance details Defined in Data.Finite.Internal Methods showsPrec :: Int -> Finite n -> ShowS # show :: Finite n -> String # showList :: [Finite n] -> ShowS #
Show (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods showsPrec :: Int -> Binary p -> ShowS # show :: Binary p -> String # showList :: [Binary p] -> ShowS #
Show (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods showsPrec :: Int -> Prime p -> ShowS # show :: Prime p -> String # showList :: [Prime p] -> ShowS #
Show a => Show (Hashed a)
Instance details Defined in Data.Hashable.Class Methods showsPrec :: Int -> Hashed a -> ShowS # show :: Hashed a -> String # showList :: [Hashed a] -> ShowS #
Show (Affine a)
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods showsPrec :: Int -> Affine a -> ShowS # show :: Affine a -> String # showList :: [Affine a] -> ShowS #
Show (Point a)
Instance details Defined in Crypto.BLST.Internal.Bindings.Types Methods showsPrec :: Int -> Point a -> ShowS # show :: Point a -> String # showList :: [Point a] -> ShowS #
Show (PublicKey c)
Instance details Defined in Crypto.BLST.Internal.Types Methods showsPrec :: Int -> PublicKey c -> ShowS # show :: PublicKey c -> String # showList :: [PublicKey c] -> ShowS #
Show a => Show (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> OpenChestT a -> ShowS # show :: OpenChestT a -> String # showList :: [OpenChestT a] -> ShowS #
Show (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Packed a -> ShowS # show :: Packed a -> String # showList :: [Packed a] -> ShowS #
Show (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> TSignature a -> ShowS # show :: TSignature a -> String # showList :: [TSignature a] -> ShowS #
Show (EpCallingDesc info) Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods showsPrec :: Int -> EpCallingDesc info -> ShowS # show :: EpCallingDesc info -> String # showList :: [EpCallingDesc info] -> ShowS #
Show (CustomErrorRep tag) => Show (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> CustomError tag -> ShowS # show :: CustomError tag -> String # showList :: [CustomError tag] -> ShowS #
Show a => Show (Range a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> Range a -> ShowS # show :: Range a -> String # showList :: [Range a] -> ShowS #
Show a => Show (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeEE a -> ShowS # show :: RangeEE a -> String # showList :: [RangeEE a] -> ShowS #
Show a => Show (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeEI a -> ShowS # show :: RangeEI a -> String # showList :: [RangeEI a] -> ShowS #
Show a => Show (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeIE a -> ShowS # show :: RangeIE a -> String # showList :: [RangeIE a] -> ShowS #
Show (ConstrainedSome Show) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> ConstrainedSome Show -> ShowS # show :: ConstrainedSome Show -> String # showList :: [ConstrainedSome Show] -> ShowS #
Show (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> UParam entries -> ShowS # show :: UParam entries -> String # showList :: [UParam entries] -> ShowS #
Show a => Show (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> ReadTicket a -> ShowS # show :: ReadTicket a -> String # showList :: [ReadTicket a] -> ShowS #
Show e => Show (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ErrorFancy e -> ShowS # show :: ErrorFancy e -> String # showList :: [ErrorFancy e] -> ShowS #
Show t => Show (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ErrorItem t -> ShowS # show :: ErrorItem t -> String # showList :: [ErrorItem t] -> ShowS #
Show s => Show (PosState s)
Instance details Defined in Text.Megaparsec.State Methods showsPrec :: Int -> PosState s -> ShowS # show :: PosState s -> String # showList :: [PosState s] -> ShowS #
Show (Mod m)
Instance details Defined in Data.Mod Methods showsPrec :: Int -> Mod m -> ShowS # show :: Mod m -> String # showList :: [Mod m] -> ShowS #
Show (Exp x) => Show (FromExpError x)
Instance details Defined in Morley.Micheline.Class Methods showsPrec :: Int -> FromExpError x -> ShowS # show :: FromExpError x -> String # showList :: [FromExpError x] -> ShowS #
ExpAllExtrasConstrainted Show x => Show (Exp x)
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> Exp x -> ShowS # show :: Exp x -> String # showList :: [Exp x] -> ShowS #
Show (Exp x) => Show (MichelinePrimAp x)
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> MichelinePrimAp x -> ShowS # show :: MichelinePrimAp x -> String # showList :: [MichelinePrimAp x] -> ShowS #
Show a => Show (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods showsPrec :: Int -> StringEncode a -> ShowS # show :: StringEncode a -> String # showList :: [StringEncode a] -> ShowS #
Show a => Show (ViewsSetF a)
Instance details Defined in Morley.Michelson.Internal.ViewsSet Methods showsPrec :: Int -> ViewsSetF a -> ShowS # show :: ViewsSetF a -> String # showList :: [ViewsSetF a] -> ShowS #
Show ext => Show (InterpretError ext)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> InterpretError ext -> ShowS # show :: InterpretError ext -> String # showList :: [InterpretError ext] -> ShowS #
Show ext => Show (MichelsonFailed ext)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MichelsonFailed ext -> ShowS # show :: MichelsonFailed ext -> String # showList :: [MichelsonFailed ext] -> ShowS #
Show ext => Show (MichelsonFailureWithStack ext)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MichelsonFailureWithStack ext -> ShowS # show :: MichelsonFailureWithStack ext -> String # showList :: [MichelsonFailureWithStack ext] -> ShowS #
Show res => Show (ResultStateLogs res)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> ResultStateLogs res -> ShowS # show :: ResultStateLogs res -> String # showList :: [ResultStateLogs res] -> ShowS #
Show op => Show (ParsedSeq op)
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> ParsedSeq op -> ShowS # show :: ParsedSeq op -> String # showList :: [ParsedSeq op] -> ShowS #
Show op => Show (TCOpSeq op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TCOpSeq op -> ShowS # show :: TCOpSeq op -> String # showList :: [TCOpSeq op] -> ShowS #
Show op => Show (TcError' op)
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TcError' op -> ShowS # show :: TcError' op -> String # showList :: [TcError' op] -> ShowS #
Show op => Show (IllTypedInstr op)
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods showsPrec :: Int -> IllTypedInstr op -> ShowS # show :: IllTypedInstr op -> String # showList :: [IllTypedInstr op] -> ShowS #
Show op => Show (TypeCheckedOp op)
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods showsPrec :: Int -> TypeCheckedOp op -> ShowS # show :: TypeCheckedOp op -> String # showList :: [TypeCheckedOp op] -> ShowS #
Show (HST ts)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> HST ts -> ShowS # show :: HST ts -> String # showList :: [HST ts] -> ShowS #
Show (SomeTcInstr inp)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeTcInstr inp -> ShowS # show :: SomeTcInstr inp -> String # showList :: [SomeTcInstr inp] -> ShowS #
Show (SomeTcInstrOut inp)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeTcInstrOut inp -> ShowS # show :: SomeTcInstrOut inp -> String # showList :: [SomeTcInstrOut inp] -> ShowS #
Show (AnnotatedValue v)
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods showsPrec :: Int -> AnnotatedValue v -> ShowS # show :: AnnotatedValue v -> String # showList :: [AnnotatedValue v] -> ShowS #
Each '[Show] rs => Show (Anns rs)
Instance details Defined in Morley.Michelson.Typed.Annotation Methods showsPrec :: Int -> Anns rs -> ShowS # show :: Anns rs -> String # showList :: [Anns rs] -> ShowS #
Show (Notes t)
Instance details Defined in Morley.Michelson.Typed.Annotation Methods showsPrec :: Int -> Notes t -> ShowS # show :: Notes t -> String # showList :: [Notes t] -> ShowS #
Show (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParamNotes t -> ShowS # show :: ParamNotes t -> String # showList :: [ParamNotes t] -> ShowS #
Show (SomeEntrypointCallT arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> SomeEntrypointCallT arg -> ShowS # show :: SomeEntrypointCallT arg -> String # showList :: [SomeEntrypointCallT arg] -> ShowS #
Show a => Show (ComposeResult a)
Instance details Defined in Morley.Michelson.Typed.Haskell.LooseSum Methods showsPrec :: Int -> ComposeResult a -> ShowS # show :: ComposeResult a -> String # showList :: [ComposeResult a] -> ShowS #
Show (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
Show arg => Show (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> Ticket arg -> ShowS # show :: Ticket arg -> String # showList :: [Ticket arg] -> ShowS #
Show (ExtInstr s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> ExtInstr s -> ShowS # show :: ExtInstr s -> String # showList :: [ExtInstr s] -> ShowS #
Show (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> PrintComment st -> ShowS # show :: PrintComment st -> String # showList :: [PrintComment st] -> ShowS #
Show (StackRef st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> StackRef st -> ShowS # show :: StackRef st -> String # showList :: [StackRef st] -> ShowS #
Show (TestAssert s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> TestAssert s -> ShowS # show :: TestAssert s -> String # showList :: [TestAssert s] -> ShowS #
Show (Comparability t)
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.Comparable Methods showsPrec :: Int -> Comparability t -> ShowS # show :: Comparability t -> String # showList :: [Comparability t] -> ShowS #
Show (SingT x)
Instance details Defined in Morley.Michelson.Typed.Sing Methods showsPrec :: Int -> SingT x -> ShowS # show :: SingT x -> String # showList :: [SingT x] -> ShowS #
Show (Operation' instr)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> Operation' instr -> ShowS # show :: Operation' instr -> String # showList :: [Operation' instr] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (SomeViewsSet' instr)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> SomeViewsSet' instr -> ShowS # show :: SomeViewsSet' instr -> String # showList :: [SomeViewsSet' instr] -> ShowS #
Show op => Show (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> Contract' op -> ShowS # show :: Contract' op -> String # showList :: [Contract' op] -> ShowS #
Show op => Show (ContractBlock op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> ContractBlock op -> ShowS # show :: ContractBlock op -> String # showList :: [ContractBlock op] -> ShowS #
Show op => Show (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Methods showsPrec :: Int -> View' op -> ShowS # show :: View' op -> String # showList :: [View' op] -> ShowS #
Show instr => Show (ViewsSet instr)
Instance details Defined in Morley.Michelson.Untyped.View Methods showsPrec :: Int -> ViewsSet instr -> ShowS # show :: ViewsSet instr -> String # showList :: [ViewsSet instr] -> ShowS #
Show (KindedAddress kind)
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> KindedAddress kind -> ShowS # show :: KindedAddress kind -> String # showList :: [KindedAddress kind] -> ShowS #
Show (Hash kind)
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> Hash kind -> ShowS # show :: Hash kind -> String # showList :: [Hash kind] -> ShowS #
Show (HashTag kind)
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> HashTag kind -> ShowS # show :: HashTag kind -> String # showList :: [HashTag kind] -> ShowS #
Show (Label name)
Instance details Defined in Morley.Util.Label Methods showsPrec :: Int -> Label name -> ShowS # show :: Label name -> String # showList :: [Label name] -> ShowS #
Show a => Show (MismatchError a)
Instance details Defined in Morley.Util.MismatchError Methods showsPrec :: Int -> MismatchError a -> ShowS # show :: MismatchError a -> String # showList :: [MismatchError a] -> ShowS #
Show (SingNat n)
Instance details Defined in Morley.Util.Peano Methods showsPrec :: Int -> SingNat n -> ShowS # show :: SingNat n -> String # showList :: [SingNat n] -> ShowS #
Show (PeanoNatural n)
Instance details Defined in Morley.Util.PeanoNatural Methods showsPrec :: Int -> PeanoNatural n -> ShowS # show :: PeanoNatural n -> String # showList :: [PeanoNatural n] -> ShowS #
Show a => Show (SomeSizedList a)
Instance details Defined in Morley.Util.SizedList Methods showsPrec :: Int -> SomeSizedList a -> ShowS # show :: SomeSizedList a -> String # showList :: [SomeSizedList a] -> ShowS #
Show a => Show (All a)
Instance details Defined in Morley.Prelude.Boolean Methods showsPrec :: Int -> All a -> ShowS # show :: All a -> String # showList :: [All a] -> ShowS #
Show a => Show (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods showsPrec :: Int -> Any a -> ShowS # show :: Any a -> String # showList :: [Any a] -> ShowS #
Show a => Show (OptTree a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptTree a -> ShowS # show :: OptTree a -> String # showList :: [OptTree a] -> ShowS #
Show (Option a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Show h => Show (ParserFailure h)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserFailure h -> ShowS # show :: ParserFailure h -> String # showList :: [ParserFailure h] -> ShowS #
Show a => Show (ParserResult a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserResult a -> ShowS # show :: ParserResult a -> String # showList :: [ParserResult a] -> ShowS #
Show a => Show (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> AnnotDetails a -> ShowS # show :: AnnotDetails a -> String # showList :: [AnnotDetails a] -> ShowS #
Show (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Doc a -> ShowS # show :: Doc a -> String # showList :: [Doc a] -> ShowS #
Show a => Show (Span a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Span a -> ShowS # show :: Span a -> String # showList :: [Span a] -> ShowS #
Show (Doc ann)	`(show doc)` prettyprints document `doc` with `defaultLayoutOptions`, ignoring all annotations.
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> Doc ann -> ShowS # show :: Doc ann -> String # showList :: [Doc ann] -> ShowS #
Show ann => Show (SimpleDocStream ann)
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> SimpleDocStream ann -> ShowS # show :: SimpleDocStream ann -> String # showList :: [SimpleDocStream ann] -> ShowS #
Show a => Show (Array a)
Instance details Defined in Data.Primitive.Array Methods showsPrec :: Int -> Array a -> ShowS # show :: Array a -> String # showList :: [Array a] -> ShowS #
(Show a, Prim a) => Show (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods showsPrec :: Int -> PrimArray a -> ShowS # show :: PrimArray a -> String # showList :: [PrimArray a] -> ShowS #
Show a => Show (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS # show :: SmallArray a -> String # showList :: [SmallArray a] -> ShowS #
Show g => Show (StateGen g)
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StateGen g -> ShowS # show :: StateGen g -> String # showList :: [StateGen g] -> ShowS #
Show g => Show (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> AtomicGen g -> ShowS # show :: AtomicGen g -> String # showList :: [AtomicGen g] -> ShowS #
Show g => Show (IOGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> IOGen g -> ShowS # show :: IOGen g -> String # showList :: [IOGen g] -> ShowS #
Show g => Show (STGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> STGen g -> ShowS # show :: STGen g -> String # showList :: [STGen g] -> ShowS #
Show g => Show (TGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> TGen g -> ShowS # show :: TGen g -> String # showList :: [TGen g] -> ShowS #
Show a => Show (Add a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Add a -> ShowS # show :: Add a -> String # showList :: [Add a] -> ShowS #
Show (IntSetOf a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> IntSetOf a -> ShowS # show :: IntSetOf a -> String # showList :: [IntSetOf a] -> ShowS #
Show a => Show (Mul a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Mul a -> ShowS # show :: Mul a -> String # showList :: [Mul a] -> ShowS #
Show a => Show (WrappedNum a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> WrappedNum a -> ShowS # show :: WrappedNum a -> String # showList :: [WrappedNum a] -> ShowS #
Show (SBool z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SBool z -> ShowS # show :: SBool z -> String # showList :: [SBool z] -> ShowS #
Show (SOrdering z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SOrdering z -> ShowS # show :: SOrdering z -> String # showList :: [SOrdering z] -> ShowS #
Show (STuple0 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple0 z -> ShowS # show :: STuple0 z -> String # showList :: [STuple0 z] -> ShowS #
Show (SVoid z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SVoid z -> ShowS # show :: SVoid z -> String # showList :: [SVoid z] -> ShowS #
Show (SChar c)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods showsPrec :: Int -> SChar c -> ShowS # show :: SChar c -> String # showList :: [SChar c] -> ShowS #
Show (SNat n)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods showsPrec :: Int -> SNat n -> ShowS # show :: SNat n -> String # showList :: [SNat n] -> ShowS #
Show (SSymbol s)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods showsPrec :: Int -> SSymbol s -> ShowS # show :: SSymbol s -> String # showList :: [SSymbol s] -> ShowS #
Show a => Show (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Show flag => Show (TyVarBndr flag)
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyVarBndr flag -> ShowS # show :: TyVarBndr flag -> String # showList :: [TyVarBndr flag] -> ShowS #
Show flag => Show (DTyVarBndr flag)
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTyVarBndr flag -> ShowS # show :: DTyVarBndr flag -> String # showList :: [DTyVarBndr flag] -> ShowS #
Show a => Show (HashSet a)
Instance details Defined in Data.HashSet.Internal Methods showsPrec :: Int -> HashSet a -> ShowS # show :: HashSet a -> String # showList :: [HashSet a] -> ShowS #
Show a => Show (Vector a)
Instance details Defined in Data.Vector Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
(Show a, Prim a) => Show (Vector a)
Instance details Defined in Data.Vector.Primitive Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
(Show a, Storable a) => Show (Vector a)
Instance details Defined in Data.Vector.Storable Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
(Show t, KnownSymbol s) => Show (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> ElField '(s, t) -> ShowS # show :: ElField '(s, t) -> String # showList :: [ElField '(s, t)] -> ShowS #
Show a => Show (Identity a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Show a => Show (Thunk a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Thunk a -> ShowS # show :: Thunk a -> String # showList :: [Thunk a] -> ShowS #
Show a => Show (NonEmpty a)	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> NonEmpty a -> ShowS # show :: NonEmpty a -> String # showList :: [NonEmpty a] -> ShowS #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Show a => Show (a)	Since: base-4.15
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a) -> ShowS # show :: (a) -> String # showList :: [(a)] -> ShowS #
Show a => Show [a]	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> [a] -> ShowS # show :: [a] -> String # showList :: [[a]] -> ShowS #
(Show a) :=> (Show (Complex a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Complex a) #
(Show a) :=> (Show (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Const a b) #
(Show a) :=> (Show (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Identity a) #
(Show a) :=> (Show (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Maybe a) #
(Show a) :=> (Show [a])
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show [a] #
Show a => Show (WrapWord a n)
Instance details Defined in Data.Word.Odd Methods showsPrec :: Int -> WrapWord a n -> ShowS # show :: WrapWord a n -> String # showList :: [WrapWord a n] -> ShowS #
(Show i, Show r) => Show (IResult i r)
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> IResult i r -> ShowS # show :: IResult i r -> String # showList :: [IResult i r] -> ShowS #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
HasResolution a => Show (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods showsPrec :: Int -> Fixed a -> ShowS # show :: Fixed a -> String # showList :: [Fixed a] -> ShowS #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
(Show a, Show b) => Show (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Arg a b -> ShowS # show :: Arg a b -> String # showList :: [Arg a b] -> ShowS #
Show (TypeRep a)
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> TypeRep a -> ShowS # show :: TypeRep a -> String # showList :: [TypeRep a] -> ShowS #
Show (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> U1 p -> ShowS # show :: U1 p -> String # showList :: [U1 p] -> ShowS #
Show (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> V1 p -> ShowS # show :: V1 p -> String # showList :: [V1 p] -> ShowS #
Show (ST s a)	Since: base-2.1
Instance details Defined in GHC.ST Methods showsPrec :: Int -> ST s a -> ShowS # show :: ST s a -> String # showList :: [ST s a] -> ShowS #
Show a => Show (ListN n a)
Instance details Defined in Basement.Sized.List Methods showsPrec :: Int -> ListN n a -> ShowS # show :: ListN n a -> String # showList :: [ListN n a] -> ShowS #
(Show a, Show b) => Show (Bimap a b)
Instance details Defined in Data.Bimap Methods showsPrec :: Int -> Bimap a b -> ShowS # show :: Bimap a b -> String # showList :: [Bimap a b] -> ShowS #
Show (a :- b)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> (a :- b) -> ShowS # show :: (a :- b) -> String # showList :: [a :- b] -> ShowS #
(Show k, Show a) => Show (Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS # show :: Map k a -> String # showList :: [Map k a] -> ShowS #
(Show1 f, Show a) => Show (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods showsPrec :: Int -> Cofree f a -> ShowS # show :: Cofree f a -> String # showList :: [Cofree f a] -> ShowS #
(Show1 f, Show a) => Show (Free f a)
Instance details Defined in Control.Monad.Free Methods showsPrec :: Int -> Free f a -> ShowS # show :: Free f a -> String # showList :: [Free f a] -> ShowS #
Show k => Show (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods showsPrec :: Int -> Extension p k -> ShowS # show :: Extension p k -> String # showList :: [Extension p k] -> ShowS #
Show k => Show (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods showsPrec :: Int -> RootsOfUnity n k -> ShowS # show :: RootsOfUnity n k -> String # showList :: [RootsOfUnity n k] -> ShowS #
Show (Signature c m)
Instance details Defined in Crypto.BLST.Internal.Types Methods showsPrec :: Int -> Signature c m -> ShowS # show :: Signature c m -> String # showList :: [Signature c m] -> ShowS #
Show (f a) => Show (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods showsPrec :: Int -> Yoneda f a -> ShowS # show :: Yoneda f a -> String # showList :: [Yoneda f a] -> ShowS #
Show (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods showsPrec :: Int -> TAddress p vd -> ShowS # show :: TAddress p vd -> String # showList :: [TAddress p vd] -> ShowS #
Show (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> (inp :-> out) -> ShowS # show :: (inp :-> out) -> String # showList :: [inp :-> out] -> ShowS #
Show (ContractCode cp st) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> ContractCode cp st -> ShowS # show :: ContractCode cp st -> String # showList :: [ContractCode cp st] -> ShowS #
Show (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Hash alg a -> ShowS # show :: Hash alg a -> String # showList :: [Hash alg a] -> ShowS #
HasResolution a => Show (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods showsPrec :: Int -> NFixed a -> ShowS # show :: NFixed a -> String # showList :: [NFixed a] -> ShowS #
Show (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Methods showsPrec :: Int -> Extensible x -> ShowS # show :: Extensible x -> String # showList :: [Extensible x] -> ShowS #
Show (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Methods showsPrec :: Int -> WrappedLambda i o -> ShowS # show :: WrappedLambda i o -> String # showList :: [WrappedLambda i o] -> ShowS #
Show a => Show (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> View_ a r -> ShowS # show :: View_ a r -> String # showList :: [View_ a r] -> ShowS #
Show a => Show (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> Void_ a b -> ShowS # show :: Void_ a b -> String # showList :: [Void_ a b] -> ShowS #
(Show a, Show b) => Show (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods showsPrec :: Int -> ZippedStackRepr a b -> ShowS # show :: ZippedStackRepr a b -> String # showList :: [ZippedStackRepr a b] -> ShowS #
(Show (Token s), Show e) => Show (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseError s e -> ShowS # show :: ParseError s e -> String # showList :: [ParseError s e] -> ShowS #
(Show s, Show (Token s), Show e) => Show (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseErrorBundle s e -> ShowS # show :: ParseErrorBundle s e -> String # showList :: [ParseErrorBundle s e] -> ShowS #
(Show (ParseError s e), Show s) => Show (State s e)
Instance details Defined in Text.Megaparsec.State Methods showsPrec :: Int -> State s e -> ShowS # show :: State s e -> String # showList :: [State s e] -> ShowS #
Show (NoStkElMeta t)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> NoStkElMeta t -> ShowS # show :: NoStkElMeta t -> String # showList :: [NoStkElMeta t] -> ShowS #
Show (meta t) => Show (StkEl meta t)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> StkEl meta t -> ShowS # show :: StkEl meta t -> String # showList :: [StkEl meta t] -> ShowS #
(Show n, Show m) => Show (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> ArithError n m -> ShowS # show :: ArithError n m -> String # showList :: [ArithError n m] -> ShowS #
Show (EntrypointCallT param arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EntrypointCallT param arg -> ShowS # show :: EntrypointCallT param arg -> String # showList :: [EntrypointCallT param arg] -> ShowS #
Show (EpLiftSequence arg param)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpLiftSequence arg param -> ShowS # show :: EpLiftSequence arg param -> String # showList :: [EpLiftSequence arg param] -> ShowS #
(Show k, Show v) => Show (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMap k v -> ShowS # show :: BigMap k v -> String # showList :: [BigMap k v] -> ShowS #
Show (Instr inp out)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> Instr inp out -> ShowS # show :: Instr inp out -> String # showList :: [Instr inp out] -> ShowS #
Show (TPresence t p)
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.Presence Methods showsPrec :: Int -> TPresence t p -> ShowS # show :: TPresence t p -> String # showList :: [TPresence t p] -> ShowS #
Show (Emit instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> Emit instr t -> ShowS # show :: Emit instr t -> String # showList :: [Emit instr t] -> ShowS #
Show (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> TransferTokens instr p -> ShowS # show :: TransferTokens instr p -> String # showList :: [TransferTokens instr p] -> ShowS #
Show (Value' instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> Value' instr t -> ShowS # show :: Value' instr t -> String # showList :: [Value' instr t] -> ShowS #
(forall (arg :: T) (ret :: T). Show (ViewCode' instr arg st ret)) => Show (SomeView' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> SomeView' instr st -> ShowS # show :: SomeView' instr st -> String # showList :: [SomeView' instr st] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> ViewsSet' instr st -> ShowS # show :: ViewsSet' instr st -> String # showList :: [ViewsSet' instr st] -> ShowS #
Typeable tag => Show (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> Annotation tag -> ShowS # show :: Annotation tag -> String # showList :: [Annotation tag] -> ShowS #
(Show e, Show a) => Show (Validation e a)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> Validation e a -> ShowS # show :: Validation e a -> String # showList :: [Validation e a] -> ShowS #
Show (f op) => Show (ExtInstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> ExtInstrAbstract f op -> ShowS # show :: ExtInstrAbstract f op -> String # showList :: [ExtInstrAbstract f op] -> ShowS #
Show (f op) => Show (TestAssert f op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> TestAssert f op -> ShowS # show :: TestAssert f op -> String # showList :: [TestAssert f op] -> ShowS #
(Show op, Show (f op)) => Show (InstrAbstract f op)
Instance details Defined in Morley.Michelson.Untyped.Instr Methods showsPrec :: Int -> InstrAbstract f op -> ShowS # show :: InstrAbstract f op -> String # showList :: [InstrAbstract f op] -> ShowS #
(Show a, Show b) => Show (Bimap a b)
Instance details Defined in Morley.Util.Bimap Methods showsPrec :: Int -> Bimap a b -> ShowS # show :: Bimap a b -> String # showList :: [Bimap a b] -> ShowS #
Show a => Show (SizedList' n a)
Instance details Defined in Morley.Util.SizedList Methods showsPrec :: Int -> SizedList' n a -> ShowS # show :: SizedList' n a -> String # showList :: [SizedList' n a] -> ShowS #
(forall (a :: k). Show (f a)) => Show (Some1 f)
Instance details Defined in Morley.Util.Type Methods showsPrec :: Int -> Some1 f -> ShowS # show :: Some1 f -> String # showList :: [Some1 f] -> ShowS #
(Show a, Vector v a) => Show (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods showsPrec :: Int -> Poly v a -> ShowS # show :: Poly v a -> String # showList :: [Poly v a] -> ShowS #
Show v => Show (IntMapOf k v)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> IntMapOf k v -> ShowS # show :: IntMapOf k v -> String # showList :: [IntMapOf k v] -> ShowS #
ShowSing (Maybe a) => Show (SFirst z)
Instance details Defined in Data.Monoid.Singletons Methods showsPrec :: Int -> SFirst z -> ShowS # show :: SFirst z -> String # showList :: [SFirst z] -> ShowS #
ShowSing (Maybe a) => Show (SLast z)
Instance details Defined in Data.Monoid.Singletons Methods showsPrec :: Int -> SLast z -> ShowS # show :: SLast z -> String # showList :: [SLast z] -> ShowS #
ShowSing a => Show (SIdentity z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SIdentity z -> ShowS # show :: SIdentity z -> String # showList :: [SIdentity z] -> ShowS #
(ShowSing a, ShowSing [a]) => Show (SList z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SList z -> ShowS # show :: SList z -> String # showList :: [SList z] -> ShowS #
ShowSing a => Show (SMaybe z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SMaybe z -> ShowS # show :: SMaybe z -> String # showList :: [SMaybe z] -> ShowS #
(ShowSing a, ShowSing [a]) => Show (SNonEmpty z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SNonEmpty z -> ShowS # show :: SNonEmpty z -> String # showList :: [SNonEmpty z] -> ShowS #
GShow tag => Show (Some tag)
Instance details Defined in Data.GADT.Internal Methods showsPrec :: Int -> Some tag -> ShowS # show :: Some tag -> String # showList :: [Some tag] -> ShowS #
(Show a, Show b) => Show (Either a b)
Instance details Defined in Data.Strict.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
(Show a, Show b) => Show (These a b)
Instance details Defined in Data.Strict.These Methods showsPrec :: Int -> These a b -> ShowS # show :: These a b -> String # showList :: [These a b] -> ShowS #
(Show a, Show b) => Show (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods showsPrec :: Int -> Pair a b -> ShowS # show :: Pair a b -> String # showList :: [Pair a b] -> ShowS #
(Show a, Show b) => Show (These a b)
Instance details Defined in Data.These Methods showsPrec :: Int -> These a b -> ShowS # show :: These a b -> String # showList :: [These a b] -> ShowS #
(Show1 m, Show a) => Show (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods showsPrec :: Int -> MaybeT m a -> ShowS # show :: MaybeT m a -> String # showList :: [MaybeT m a] -> ShowS #
(Show k, Show v) => Show (HashMap k v)
Instance details Defined in Data.HashMap.Internal Methods showsPrec :: Int -> HashMap k v -> ShowS # show :: HashMap k v -> String # showList :: [HashMap k v] -> ShowS #
(Show a, Show b) => Show (a, b)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b) -> ShowS # show :: (a, b) -> String # showList :: [(a, b)] -> ShowS #
(Integral a, Show a) :=> (Show (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: (Integral a, Show a) :- Show (Ratio a) #
(Show a, Show b) :=> (Show (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (Either a b) #
(Show a, Show b) :=> (Show (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (a, b) #
Show a => Show (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `getConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
Show (f a) => Show (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Ap f a -> ShowS # show :: Ap f a -> String # showList :: [Ap f a] -> ShowS #
Show (f a) => Show (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Alt f a -> ShowS # show :: Alt f a -> String # showList :: [Alt f a] -> ShowS #
Show (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~: b) -> ShowS # show :: (a :~: b) -> String # showList :: [a :~: b] -> ShowS #
Show (OrderingI a b)
Instance details Defined in Data.Type.Ord Methods showsPrec :: Int -> OrderingI a b -> ShowS # show :: OrderingI a b -> String # showList :: [OrderingI a b] -> ShowS #
Show (f p) => Show (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Rec1 f p -> ShowS # show :: Rec1 f p -> String # showList :: [Rec1 f p] -> ShowS #
Show (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Char p -> ShowS # show :: URec Char p -> String # showList :: [URec Char p] -> ShowS #
Show (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Double p -> ShowS # show :: URec Double p -> String # showList :: [URec Double p] -> ShowS #
Show (URec Float p)
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Float p -> ShowS # show :: URec Float p -> String # showList :: [URec Float p] -> ShowS #
Show (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Int p -> ShowS # show :: URec Int p -> String # showList :: [URec Int p] -> ShowS #
Show (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Word p -> ShowS # show :: URec Word p -> String # showList :: [URec Word p] -> ShowS #
Show (p (Fix p a) a) => Show (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods showsPrec :: Int -> Fix p a -> ShowS # show :: Fix p a -> String # showList :: [Fix p a] -> ShowS #
Show (p a a) => Show (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods showsPrec :: Int -> Join p a -> ShowS # show :: Join p a -> String # showList :: [Join p a] -> ShowS #
(Show a, Show (f b)) => Show (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeF f a b -> ShowS # show :: CofreeF f a b -> String # showList :: [CofreeF f a b] -> ShowS #
Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeT f w a -> ShowS # show :: CofreeT f w a -> String # showList :: [CofreeT f w a] -> ShowS #
(Show a, Show (f b)) => Show (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeF f a b -> ShowS # show :: FreeF f a b -> String # showList :: [FreeF f a b] -> ShowS #
(Show1 f, Show1 m, Show a) => Show (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeT f m a -> ShowS # show :: FreeT f m a -> String # showList :: [FreeT f m a] -> ShowS #
Show (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> Contract cp st vd -> ShowS # show :: Contract cp st vd -> String # showList :: [Contract cp st vd] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (Contract' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods showsPrec :: Int -> Contract' instr cp st -> ShowS # show :: Contract' instr cp st -> String # showList :: [Contract' instr cp st] -> ShowS #
Show (instr (ContractInp cp st) (ContractOut st)) => Show (ContractCode' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods showsPrec :: Int -> ContractCode' instr cp st -> ShowS # show :: ContractCode' instr cp st -> String # showList :: [ContractCode' instr cp st] -> ShowS #
Show (CreateContract instr cp st)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> CreateContract instr cp st -> ShowS # show :: CreateContract instr cp st -> String # showList :: [CreateContract instr cp st] -> ShowS #
Show (LambdaCode' instr inp out)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> LambdaCode' instr inp out -> ShowS # show :: LambdaCode' instr inp out -> String # showList :: [LambdaCode' instr inp out] -> ShowS #
Show (f op) => Show (Elt f op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> Elt f op -> ShowS # show :: Elt f op -> String # showList :: [Elt f op] -> ShowS #
Show (f op) => Show (Value' f op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> Value' f op -> ShowS # show :: Value' f op -> String # showList :: [Value' f op] -> ShowS #
(forall (a :: k). c a => Show (f a)) => Show (Constrained c f)
Instance details Defined in Morley.Util.Constrained Methods showsPrec :: Int -> Constrained c f -> ShowS # show :: Constrained c f -> String # showList :: [Constrained c f] -> ShowS #
(Show a, KnownNat n, Vector v (Vector n Word, a)) => Show (MultiPoly v n a)
Instance details Defined in Data.Poly.Internal.Multi Methods showsPrec :: Int -> MultiPoly v n a -> ShowS # show :: MultiPoly v n a -> String # showList :: [MultiPoly v n a] -> ShowS #
Show (SProxy z)
Instance details Defined in Data.Proxy.Singletons Methods showsPrec :: Int -> SProxy z -> ShowS # show :: SProxy z -> String # showList :: [SProxy z] -> ShowS #
(ShowSing a, ShowSing b) => Show (SArg z)
Instance details Defined in Data.Semigroup.Singletons Methods showsPrec :: Int -> SArg z -> ShowS # show :: SArg z -> String # showList :: [SArg z] -> ShowS #
(ShowSing a, ShowSing b) => Show (SEither z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> SEither z -> ShowS # show :: SEither z -> String # showList :: [SEither z] -> ShowS #
(ShowSing a, ShowSing b) => Show (STuple2 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple2 z -> ShowS # show :: STuple2 z -> String # showList :: [STuple2 z] -> ShowS #
Show (GOrdering a b)
Instance details Defined in Data.GADT.Internal Methods showsPrec :: Int -> GOrdering a b -> ShowS # show :: GOrdering a b -> String # showList :: [GOrdering a b] -> ShowS #
Show b => Show (Tagged s b)
Instance details Defined in Data.Tagged Methods showsPrec :: Int -> Tagged s b -> ShowS # show :: Tagged s b -> String # showList :: [Tagged s b] -> ShowS #
(Show (f a), Show (g a), Show a) => Show (These1 f g a)
Instance details Defined in Data.Functor.These Methods showsPrec :: Int -> These1 f g a -> ShowS # show :: These1 f g a -> String # showList :: [These1 f g a] -> ShowS #
(Show e, Show1 m, Show a) => Show (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods showsPrec :: Int -> ErrorT e m a -> ShowS # show :: ErrorT e m a -> String # showList :: [ErrorT e m a] -> ShowS #
(Show e, Show1 m, Show a) => Show (ExceptT e m a)
Instance details Defined in Control.Monad.Trans.Except Methods showsPrec :: Int -> ExceptT e m a -> ShowS # show :: ExceptT e m a -> String # showList :: [ExceptT e m a] -> ShowS #
(Show1 f, Show a) => Show (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods showsPrec :: Int -> IdentityT f a -> ShowS # show :: IdentityT f a -> String # showList :: [IdentityT f a] -> ShowS #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Show (Rec f rs)) => Show (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods showsPrec :: Int -> ARec f rs -> ShowS # show :: ARec f rs -> String # showList :: [ARec f rs] -> ShowS #
(RMap rs, ReifyConstraint Show f rs, RecordToList rs) => Show (Rec f rs)	Records may be shown insofar as their points may be shown. `reifyConstraint` is used to great effect here.
Instance details Defined in Data.Vinyl.Core Methods showsPrec :: Int -> Rec f rs -> ShowS # show :: Rec f rs -> String # showList :: [Rec f rs] -> ShowS #
Show a => Show (Const a b)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
(Show a, Show b, Show c) => Show (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c) -> ShowS # show :: (a, b, c) -> String # showList :: [(a, b, c)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods showsPrec :: Int -> Product f g a -> ShowS # show :: Product f g a -> String # showList :: [Product f g a] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods showsPrec :: Int -> Sum f g a -> ShowS # show :: Sum f g a -> String # showList :: [Sum f g a] -> ShowS #
Show (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~~: b) -> ShowS # show :: (a :~~: b) -> String # showList :: [a :~~: b] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :: g) p -> ShowS # show :: (f :: g) p -> String # showList :: [(f :*: g) p] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :+: g) p -> ShowS # show :: (f :+: g) p -> String # showList :: [(f :+: g) p] -> ShowS #
Show c => Show (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> K1 i c p -> ShowS # show :: K1 i c p -> String # showList :: [K1 i c p] -> ShowS #
Show (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMapId k2 v -> ShowS # show :: BigMapId k2 v -> String # showList :: [BigMapId k2 v] -> ShowS #
(forall (o' :: k). Show (instr i o')) => Show (RemFail instr i o)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> RemFail instr i o -> ShowS # show :: RemFail instr i o -> String # showList :: [RemFail instr i o] -> ShowS #
Show (ViewCode' instr arg st ret) => Show (View' instr arg st ret)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> View' instr arg st ret -> ShowS # show :: View' instr arg st ret -> String # showList :: [View' instr arg st ret] -> ShowS #
(ShowSing a, ShowSing b, ShowSing c) => Show (STuple3 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple3 z -> ShowS # show :: STuple3 z -> String # showList :: [STuple3 z] -> ShowS #
(Show a, Show b, Show c, Show d) => Show (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d) -> ShowS # show :: (a, b, c, d) -> String # showList :: [(a, b, c, d)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods showsPrec :: Int -> Compose f g a -> ShowS # show :: Compose f g a -> String # showList :: [Compose f g a] -> ShowS #
Show (f (g p)) => Show ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :.: g) p -> ShowS # show :: (f :.: g) p -> String # showList :: [(f :.: g) p] -> ShowS #
Show (f p) => Show (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> M1 i c f p -> ShowS # show :: M1 i c f p -> String # showList :: [M1 i c f p] -> ShowS #
Show (f a) => Show (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods showsPrec :: Int -> Clown f a b -> ShowS # show :: Clown f a b -> String # showList :: [Clown f a b] -> ShowS #
Show (p b a) => Show (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods showsPrec :: Int -> Flip p a b -> ShowS # show :: Flip p a b -> String # showList :: [Flip p a b] -> ShowS #
Show (g b) => Show (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods showsPrec :: Int -> Joker g a b -> ShowS # show :: Joker g a b -> String # showList :: [Joker g a b] -> ShowS #
Show (p a b) => Show (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods showsPrec :: Int -> WrappedBifunctor p a b -> ShowS # show :: WrappedBifunctor p a b -> String # showList :: [WrappedBifunctor p a b] -> ShowS #
(ShowSing a, ShowSing b, ShowSing c, ShowSing d) => Show (STuple4 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple4 z -> ShowS # show :: STuple4 z -> String # showList :: [STuple4 z] -> ShowS #
Show (f (g a)) => Show (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Compose f g a -> ShowS # show :: Compose f g a -> String # showList :: [Compose f g a] -> ShowS #
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e) -> ShowS # show :: (a, b, c, d, e) -> String # showList :: [(a, b, c, d, e)] -> ShowS #
(Show (f a b), Show (g a b)) => Show (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods showsPrec :: Int -> Product f g a b -> ShowS # show :: Product f g a b -> String # showList :: [Product f g a b] -> ShowS #
(Show (p a b), Show (q a b)) => Show (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods showsPrec :: Int -> Sum p q a b -> ShowS # show :: Sum p q a b -> String # showList :: [Sum p q a b] -> ShowS #
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e) => Show (STuple5 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple5 z -> ShowS # show :: STuple5 z -> String # showList :: [STuple5 z] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS # show :: (a, b, c, d, e, f) -> String # showList :: [(a, b, c, d, e, f)] -> ShowS #
Show (f (p a b)) => Show (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f p a b -> ShowS # show :: Tannen f p a b -> String # showList :: [Tannen f p a b] -> ShowS #
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f) => Show (STuple6 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple6 z -> ShowS # show :: STuple6 z -> String # showList :: [STuple6 z] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS # show :: (a, b, c, d, e, f, g) -> String # showList :: [(a, b, c, d, e, f, g)] -> ShowS #
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f, ShowSing g) => Show (STuple7 z)
Instance details Defined in Data.Singletons.Base.Instances Methods showsPrec :: Int -> STuple7 z -> ShowS # show :: STuple7 z -> String # showList :: [STuple7 z] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS # show :: (a, b, c, d, e, f, g, h) -> String # showList :: [(a, b, c, d, e, f, g, h)] -> ShowS #
Show (p (f a) (g b)) => Show (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods showsPrec :: Int -> Biff p f g a b -> ShowS # show :: Biff p f g a b -> String # showList :: [Biff p f g a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS # show :: (a, b, c, d, e, f, g, h, i) -> String # showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS #

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the following:

Associativity: x <> (y <> z) = (x <> y) <> z

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]

sconcat :: NonEmpty a -> a #

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 = stimesIdempotent or stimes = stimesIdempotentMonoid respectively.

>>> stimes 4 [1]
[1,1,1,1]

Instances

Instances details

Semigroup Key
Instance details Defined in Data.Aeson.Key Methods (<>) :: Key -> Key -> Key # sconcat :: NonEmpty Key -> Key # stimes :: Integral b => b -> Key -> Key #
Semigroup More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: More -> More -> More # sconcat :: NonEmpty More -> More # stimes :: Integral b => b -> More -> More #
Semigroup ByteArray	Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (<>) :: ByteArray -> ByteArray -> ByteArray # sconcat :: NonEmpty ByteArray -> ByteArray # stimes :: Integral b => b -> ByteArray -> ByteArray #
Semigroup All	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: All -> All -> All # sconcat :: NonEmpty All -> All # stimes :: Integral b => b -> All -> All #
Semigroup Any	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any # sconcat :: NonEmpty Any -> Any # stimes :: Integral b => b -> Any -> Any #
Semigroup Void	Since: base-4.9.0.0
Instance details Defined in Data.Void Methods (<>) :: Void -> Void -> Void # sconcat :: NonEmpty Void -> Void # stimes :: Integral b => b -> Void -> Void #
Semigroup AsciiString
Instance details Defined in Basement.Types.AsciiString Methods (<>) :: AsciiString -> AsciiString -> AsciiString # sconcat :: NonEmpty AsciiString -> AsciiString # stimes :: Integral b => b -> AsciiString -> AsciiString #
Semigroup String
Instance details Defined in Basement.UTF8.Base Methods (<>) :: String -> String -> String # sconcat :: NonEmpty String -> String # stimes :: Integral b => b -> String -> String #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods (<>) :: ShortByteString -> ShortByteString -> ShortByteString # sconcat :: NonEmpty ShortByteString -> ShortByteString # stimes :: Integral b => b -> ShortByteString -> ShortByteString #
Semigroup IntSet	Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet # sconcat :: NonEmpty IntSet -> IntSet # stimes :: Integral b => b -> IntSet -> IntSet #
Semigroup Ordering	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Ordering -> Ordering -> Ordering # sconcat :: NonEmpty Ordering -> Ordering # stimes :: Integral b => b -> Ordering -> Ordering #
Semigroup Pos
Instance details Defined in Text.Megaparsec.Pos Methods (<>) :: Pos -> Pos -> Pos # sconcat :: NonEmpty Pos -> Pos # stimes :: Integral b => b -> Pos -> Pos #
Semigroup AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods (<>) :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # sconcat :: NonEmpty AnalyzerRes -> AnalyzerRes # stimes :: Integral b => b -> AnalyzerRes -> AnalyzerRes #
Semigroup ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods (<>) :: ContractDoc -> ContractDoc -> ContractDoc # sconcat :: NonEmpty ContractDoc -> ContractDoc # stimes :: Integral b => b -> ContractDoc -> ContractDoc #
Semigroup MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods (<>) :: MorleyLogs -> MorleyLogs -> MorleyLogs # sconcat :: NonEmpty MorleyLogs -> MorleyLogs # stimes :: Integral b => b -> MorleyLogs -> MorleyLogs #
Semigroup MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods (<>) :: MorleyLogsBuilder -> MorleyLogsBuilder -> MorleyLogsBuilder # sconcat :: NonEmpty MorleyLogsBuilder -> MorleyLogsBuilder # stimes :: Integral b => b -> MorleyLogsBuilder -> MorleyLogsBuilder #
Semigroup Ruleset
Instance details Defined in Morley.Michelson.Optimizer.Internal.Ruleset Methods (<>) :: Ruleset -> Ruleset -> Ruleset # sconcat :: NonEmpty Ruleset -> Ruleset # stimes :: Integral b => b -> Ruleset -> Ruleset #
Semigroup MText
Instance details Defined in Morley.Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Semigroup AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (<>) :: AnnotationSet -> AnnotationSet -> AnnotationSet # sconcat :: NonEmpty AnnotationSet -> AnnotationSet # stimes :: Integral b => b -> AnnotationSet -> AnnotationSet #
Semigroup VarAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (<>) :: VarAnn -> VarAnn -> VarAnn # sconcat :: NonEmpty VarAnn -> VarAnn # stimes :: Integral b => b -> VarAnn -> VarAnn #
Semigroup PrefsMod
Instance details Defined in Options.Applicative.Builder Methods (<>) :: PrefsMod -> PrefsMod -> PrefsMod # sconcat :: NonEmpty PrefsMod -> PrefsMod # stimes :: Integral b => b -> PrefsMod -> PrefsMod #
Semigroup Completer
Instance details Defined in Options.Applicative.Types Methods (<>) :: Completer -> Completer -> Completer # sconcat :: NonEmpty Completer -> Completer # stimes :: Integral b => b -> Completer -> Completer #
Semigroup ParseError
Instance details Defined in Options.Applicative.Types Methods (<>) :: ParseError -> ParseError -> ParseError # sconcat :: NonEmpty ParseError -> ParseError # stimes :: Integral b => b -> ParseError -> ParseError #
Semigroup Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc # sconcat :: NonEmpty Doc -> Doc # stimes :: Integral b => b -> Doc -> Doc #
Semigroup ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods (<>) :: ByteArray -> ByteArray -> ByteArray # sconcat :: NonEmpty ByteArray -> ByteArray # stimes :: Integral b => b -> ByteArray -> ByteArray #
Semigroup PromDPatInfos
Instance details Defined in Data.Singletons.TH.Syntax Methods (<>) :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # sconcat :: NonEmpty PromDPatInfos -> PromDPatInfos # stimes :: Integral b => b -> PromDPatInfos -> PromDPatInfos #
Semigroup ULetDecEnv
Instance details Defined in Data.Singletons.TH.Syntax Methods (<>) :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # sconcat :: NonEmpty ULetDecEnv -> ULetDecEnv # stimes :: Integral b => b -> ULetDecEnv -> ULetDecEnv #
Semigroup Builder
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder # sconcat :: NonEmpty Builder -> Builder # stimes :: Integral b => b -> Builder -> Builder #
Semigroup ShortText
Instance details Defined in Data.Text.Short.Internal Methods (<>) :: ShortText -> ShortText -> ShortText # sconcat :: NonEmpty ShortText -> ShortText # stimes :: Integral b => b -> ShortText -> ShortText #
Semigroup ()	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: () -> () -> () # sconcat :: NonEmpty () -> () # stimes :: Integral b => b -> () -> () #
() :=> (Semigroup (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup (Dict a) #
() :=> (Semigroup Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup Ordering #
() :=> (Semigroup ())
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup () #
() :=> (Semigroup [a])
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup [a] #
Class () (Semigroup a)
Instance details Defined in Data.Constraint Methods cls :: Semigroup a :- () #
Semigroup (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: First' a -> First' a -> First' a # sconcat :: NonEmpty (First' a) -> First' a # stimes :: Integral b => b -> First' a -> First' a #
Semigroup (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: Last' a -> Last' a -> Last' a # sconcat :: NonEmpty (Last' a) -> Last' a # stimes :: Integral b => b -> Last' a -> Last' a #
Semigroup a => Semigroup (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: Option' a -> Option' a -> Option' a # sconcat :: NonEmpty (Option' a) -> Option' a # stimes :: Integral b => b -> Option' a -> Option' a #
Semigroup (KeyMap v)
Instance details Defined in Data.Aeson.KeyMap Methods (<>) :: KeyMap v -> KeyMap v -> KeyMap v # sconcat :: NonEmpty (KeyMap v) -> KeyMap v # stimes :: Integral b => b -> KeyMap v -> KeyMap v #
Semigroup (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: IResult a -> IResult a -> IResult a # sconcat :: NonEmpty (IResult a) -> IResult a # stimes :: Integral b => b -> IResult a -> IResult a #
Semigroup (Parser a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Parser a -> Parser a -> Parser a # sconcat :: NonEmpty (Parser a) -> Parser a # stimes :: Integral b => b -> Parser a -> Parser a #
Semigroup (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Result a -> Result a -> Result a # sconcat :: NonEmpty (Result a) -> Result a # stimes :: Integral b => b -> Result a -> Result a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a # sconcat :: NonEmpty (Identity a) -> Identity a # stimes :: Integral b => b -> Identity a -> Identity a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Semigroup a => Semigroup (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (<>) :: Down a -> Down a -> Down a # sconcat :: NonEmpty (Down a) -> Down a # stimes :: Integral b => b -> Down a -> Down a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Ord a => Semigroup (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
Ord a => Semigroup (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #
Monoid m => Semigroup (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #
Semigroup a => Semigroup (Dual a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a # sconcat :: NonEmpty (Dual a) -> Dual a # stimes :: Integral b => b -> Dual a -> Dual a #
Semigroup (Endo a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a # sconcat :: NonEmpty (Endo a) -> Endo a # stimes :: Integral b => b -> Endo a -> Endo a #
Num a => Semigroup (Product a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a # sconcat :: NonEmpty (Product a) -> Product a # stimes :: Integral b => b -> Product a -> Product a #
Num a => Semigroup (Sum a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a # sconcat :: NonEmpty (Sum a) -> Sum a # stimes :: Integral b => b -> Sum a -> Sum a #
Semigroup a => Semigroup (STM a)	Since: base-4.17.0.0
Instance details Defined in GHC.Conc.Sync Methods (<>) :: STM a -> STM a -> STM a # sconcat :: NonEmpty (STM a) -> STM a # stimes :: Integral b => b -> STM a -> STM a #
(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a)	Since: base-4.17.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Generically a -> Generically a -> Generically a # sconcat :: NonEmpty (Generically a) -> Generically a # stimes :: Integral b => b -> Generically a -> Generically a #
Semigroup p => Semigroup (Par1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p # sconcat :: NonEmpty (Par1 p) -> Par1 p # stimes :: Integral b => b -> Par1 p -> Par1 p #
PrimType ty => Semigroup (Block ty)
Instance details Defined in Basement.Block.Base Methods (<>) :: Block ty -> Block ty -> Block ty # sconcat :: NonEmpty (Block ty) -> Block ty # stimes :: Integral b => b -> Block ty -> Block ty #
Semigroup (Array a)
Instance details Defined in Basement.BoxedArray Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
Semigroup (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods (<>) :: CountOf ty -> CountOf ty -> CountOf ty # sconcat :: NonEmpty (CountOf ty) -> CountOf ty # stimes :: Integral b => b -> CountOf ty -> CountOf ty #
PrimType ty => Semigroup (UArray ty)
Instance details Defined in Basement.UArray.Base Methods (<>) :: UArray ty -> UArray ty -> UArray ty # sconcat :: NonEmpty (UArray ty) -> UArray ty # stimes :: Integral b => b -> UArray ty -> UArray ty #
Semigroup (Dict a)
Instance details Defined in Data.Constraint Methods (<>) :: Dict a -> Dict a -> Dict a # sconcat :: NonEmpty (Dict a) -> Dict a # stimes :: Integral b => b -> Dict a -> Dict a #
Semigroup (IntMap a)	Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a # sconcat :: NonEmpty (IntMap a) -> IntMap a # stimes :: Integral b => b -> IntMap a -> IntMap a #
Semigroup (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a # sconcat :: NonEmpty (Seq a) -> Seq a # stimes :: Integral b => b -> Seq a -> Seq a #
Ord a => Semigroup (Intersection a)
Instance details Defined in Data.Set.Internal Methods (<>) :: Intersection a -> Intersection a -> Intersection a # sconcat :: NonEmpty (Intersection a) -> Intersection a # stimes :: Integral b => b -> Intersection a -> Intersection a #
Semigroup (MergeSet a)
Instance details Defined in Data.Set.Internal Methods (<>) :: MergeSet a -> MergeSet a -> MergeSet a # sconcat :: NonEmpty (MergeSet a) -> MergeSet a # stimes :: Integral b => b -> MergeSet a -> MergeSet a #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Semigroup (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (<>) :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a # sconcat :: NonEmpty (DNonEmpty a) -> DNonEmpty a # stimes :: Integral b => b -> DNonEmpty a -> DNonEmpty a #
Semigroup (DList a)
Instance details Defined in Data.DList.Internal Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #
KnownNat p => Semigroup (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods (<>) :: Binary p -> Binary p -> Binary p # sconcat :: NonEmpty (Binary p) -> Binary p # stimes :: Integral b => b -> Binary p -> Binary p #
KnownNat p => Semigroup (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods (<>) :: Prime p -> Prime p -> Prime p # sconcat :: NonEmpty (Prime p) -> Prime p # stimes :: Integral b => b -> Prime p -> Prime p #
Semigroup a => Semigroup (IO a)	Since: base-4.10.0.0
Instance details Defined in GHC.Base Methods (<>) :: IO a -> IO a -> IO a # sconcat :: NonEmpty (IO a) -> IO a # stimes :: Integral b => b -> IO a -> IO a #
Semigroup a => Semigroup (May a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: May a -> May a -> May a # sconcat :: NonEmpty (May a) -> May a # stimes :: Integral b => b -> May a -> May a #
Semigroup (ComposeResult a)
Instance details Defined in Morley.Michelson.Typed.Haskell.LooseSum Methods (<>) :: ComposeResult a -> ComposeResult a -> ComposeResult a # sconcat :: NonEmpty (ComposeResult a) -> ComposeResult a # stimes :: Integral b => b -> ComposeResult a -> ComposeResult a #
Semigroup (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (<>) :: PrintComment st -> PrintComment st -> PrintComment st # sconcat :: NonEmpty (PrintComment st) -> PrintComment st # stimes :: Integral b => b -> PrintComment st -> PrintComment st #
Semigroup (SomeSizedList a)
Instance details Defined in Morley.Util.SizedList Methods (<>) :: SomeSizedList a -> SomeSizedList a -> SomeSizedList a # sconcat :: NonEmpty (SomeSizedList a) -> SomeSizedList a # stimes :: Integral b => b -> SomeSizedList a -> SomeSizedList a #
Boolean a => Semigroup (All a)
Instance details Defined in Morley.Prelude.Boolean Methods (<>) :: All a -> All a -> All a # sconcat :: NonEmpty (All a) -> All a # stimes :: Integral b => b -> All a -> All a #
Boolean a => Semigroup (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods (<>) :: Any a -> Any a -> Any a # sconcat :: NonEmpty (Any a) -> Any a # stimes :: Integral b => b -> Any a -> Any a #
Semigroup (InfoMod a)
Instance details Defined in Options.Applicative.Builder Methods (<>) :: InfoMod a -> InfoMod a -> InfoMod a # sconcat :: NonEmpty (InfoMod a) -> InfoMod a # stimes :: Integral b => b -> InfoMod a -> InfoMod a #
Semigroup (DefaultProp a)
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: DefaultProp a -> DefaultProp a -> DefaultProp a # sconcat :: NonEmpty (DefaultProp a) -> DefaultProp a # stimes :: Integral b => b -> DefaultProp a -> DefaultProp a #
Semigroup (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (<>) :: Doc a -> Doc a -> Doc a # sconcat :: NonEmpty (Doc a) -> Doc a # stimes :: Integral b => b -> Doc a -> Doc a #
Semigroup (Doc ann)	x `<>` y = `hcat` [x, y] `>>>` `"hello" <> "world" :: Doc ann`helloworld
Instance details Defined in Prettyprinter.Internal Methods (<>) :: Doc ann -> Doc ann -> Doc ann # sconcat :: NonEmpty (Doc ann) -> Doc ann # stimes :: Integral b => b -> Doc ann -> Doc ann #
Semigroup (Array a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
Semigroup (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a # sconcat :: NonEmpty (PrimArray a) -> PrimArray a # stimes :: Integral b => b -> PrimArray a -> PrimArray a #
Semigroup (SmallArray a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a # sconcat :: NonEmpty (SmallArray a) -> SmallArray a # stimes :: Integral b => b -> SmallArray a -> SmallArray a #
Semiring a => Semigroup (Add a)
Instance details Defined in Data.Semiring Methods (<>) :: Add a -> Add a -> Add a # sconcat :: NonEmpty (Add a) -> Add a # stimes :: Integral b => b -> Add a -> Add a #
Semiring a => Semigroup (Add' a)
Instance details Defined in Data.Semiring Methods (<>) :: Add' a -> Add' a -> Add' a # sconcat :: NonEmpty (Add' a) -> Add' a # stimes :: Integral b => b -> Add' a -> Add' a #
Semigroup (IntSetOf a)
Instance details Defined in Data.Semiring Methods (<>) :: IntSetOf a -> IntSetOf a -> IntSetOf a # sconcat :: NonEmpty (IntSetOf a) -> IntSetOf a # stimes :: Integral b => b -> IntSetOf a -> IntSetOf a #
Semiring a => Semigroup (Mul a)
Instance details Defined in Data.Semiring Methods (<>) :: Mul a -> Mul a -> Mul a # sconcat :: NonEmpty (Mul a) -> Mul a # stimes :: Integral b => b -> Mul a -> Mul a #
Semigroup a => Semigroup (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Semigroup (Q a)	Since: template-haskell-2.17.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods (<>) :: Q a -> Q a -> Q a # sconcat :: NonEmpty (Q a) -> Q a # stimes :: Integral b => b -> Q a -> Q a #
(Hashable a, Eq a) => Semigroup (HashSet a)	`<>` = `union` $O(n+m)$ To obtain good performance, the smaller set must be presented as the first argument. Examples Expand `>>>` `fromList [1,2] <> fromList [2,3]`fromList [1,2,3]
Instance details Defined in Data.HashSet.Internal Methods (<>) :: HashSet a -> HashSet a -> HashSet a # sconcat :: NonEmpty (HashSet a) -> HashSet a # stimes :: Integral b => b -> HashSet a -> HashSet a #
Semigroup (Vector a)
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Prim a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Storable a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Semigroup t => Semigroup (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods (<>) :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # sconcat :: NonEmpty (ElField '(s, t)) -> ElField '(s, t) # stimes :: Integral b => b -> ElField '(s, t) -> ElField '(s, t) #
Semigroup (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Semigroup (a)	Since: base-4.15
Instance details Defined in GHC.Base Methods (<>) :: (a) -> (a) -> (a) # sconcat :: NonEmpty (a) -> (a) # stimes :: Integral b => b -> (a) -> (a) #
Semigroup [a]	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: [a] -> [a] -> [a] # sconcat :: NonEmpty [a] -> [a] # stimes :: Integral b => b -> [a] -> [a] #
(Semigroup a) :=> (Semigroup (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Const a b) #
(Semigroup a) :=> (Semigroup (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Identity a) #
(Semigroup a) :=> (Semigroup (IO a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (IO a) #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
Class (Semigroup a) (Monoid a)
Instance details Defined in Data.Constraint Methods cls :: Monoid a :- Semigroup a #
Semigroup (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: Parser i a -> Parser i a -> Parser i a # sconcat :: NonEmpty (Parser i a) -> Parser i a # stimes :: Integral b => b -> Parser i a -> Parser i a #
Semigroup (Either a b)	Since: base-4.9.0.0
Instance details Defined in Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Semigroup (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: U1 p -> U1 p -> U1 p # sconcat :: NonEmpty (U1 p) -> U1 p # stimes :: Integral b => b -> U1 p -> U1 p #
Semigroup (V1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: V1 p -> V1 p -> V1 p # sconcat :: NonEmpty (V1 p) -> V1 p # stimes :: Integral b => b -> V1 p -> V1 p #
Semigroup a => Semigroup (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods (<>) :: ST s a -> ST s a -> ST s a # sconcat :: NonEmpty (ST s a) -> ST s a # stimes :: Integral b => b -> ST s a -> ST s a #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
IrreducibleMonic p k => Semigroup (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods (<>) :: Extension p k -> Extension p k -> Extension p k # sconcat :: NonEmpty (Extension p k) -> Extension p k # stimes :: Integral b => b -> Extension p k -> Extension p k #
(KnownNat n, GaloisField k) => Semigroup (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods (<>) :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # sconcat :: NonEmpty (RootsOfUnity n k) -> RootsOfUnity n k # stimes :: Integral b => b -> RootsOfUnity n k -> RootsOfUnity n k #
Semigroup (f a) => Semigroup (Indexing f a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a # sconcat :: NonEmpty (Indexing f a) -> Indexing f a # stimes :: Integral b => b -> Indexing f a -> Indexing f a #
Semigroup (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #
Semigroup (s :-> s) Source #
Instance details Defined in Lorentz.Base Methods (<>) :: (s :-> s) -> (s :-> s) -> s :-> s # sconcat :: NonEmpty (s :-> s) -> s :-> s # stimes :: Integral b => b -> (s :-> s) -> s :-> s #
(Stream s, Ord e) => Semigroup (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods (<>) :: ParseError s e -> ParseError s e -> ParseError s e # sconcat :: NonEmpty (ParseError s e) -> ParseError s e # stimes :: Integral b => b -> ParseError s e -> ParseError s e #
Semigroup a => Semigroup (Err e a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: Err e a -> Err e a -> Err e a # sconcat :: NonEmpty (Err e a) -> Err e a # stimes :: Integral b => b -> Err e a -> Err e a #
Ord k => Semigroup (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (<>) :: BigMap k v -> BigMap k v -> BigMap k v # sconcat :: NonEmpty (BigMap k v) -> BigMap k v # stimes :: Integral b => b -> BigMap k v -> BigMap k v #
Semigroup (Instr s s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (<>) :: Instr s s -> Instr s s -> Instr s s # sconcat :: NonEmpty (Instr s s) -> Instr s s # stimes :: Integral b => b -> Instr s s -> Instr s s #
Semigroup (Mod f a)	Since: optparse-applicative-0.13.0.0
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: Mod f a -> Mod f a -> Mod f a # sconcat :: NonEmpty (Mod f a) -> Mod f a # stimes :: Integral b => b -> Mod f a -> Mod f a #
Semigroup (IntMapOf k v)
Instance details Defined in Data.Semiring Methods (<>) :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # sconcat :: NonEmpty (IntMapOf k v) -> IntMapOf k v # stimes :: Integral b => b -> IntMapOf k v -> IntMapOf k v #
Applicative m => Semigroup (Some m)
Instance details Defined in Data.GADT.Internal Methods (<>) :: Some m -> Some m -> Some m # sconcat :: NonEmpty (Some m) -> Some m # stimes :: Integral b => b -> Some m -> Some m #
Semigroup (Either a b)
Instance details Defined in Data.Strict.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
(Semigroup a, Semigroup b) => Semigroup (These a b)
Instance details Defined in Data.Strict.These Methods (<>) :: These a b -> These a b -> These a b # sconcat :: NonEmpty (These a b) -> These a b # stimes :: Integral b0 => b0 -> These a b -> These a b #
(Semigroup a, Semigroup b) => Semigroup (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods (<>) :: Pair a b -> Pair a b -> Pair a b # sconcat :: NonEmpty (Pair a b) -> Pair a b # stimes :: Integral b0 => b0 -> Pair a b -> Pair a b #
(Semigroup a, Semigroup b) => Semigroup (These a b)
Instance details Defined in Data.These Methods (<>) :: These a b -> These a b -> These a b # sconcat :: NonEmpty (These a b) -> These a b # stimes :: Integral b0 => b0 -> These a b -> These a b #
(Eq k, Hashable k) => Semigroup (HashMap k v)	`<>` = `union` If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples Expand `>>>` `fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]`fromList [(1,'a'),(2,'b'),(3,'d')]
Instance details Defined in Data.HashMap.Internal Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v # sconcat :: NonEmpty (HashMap k v) -> HashMap k v # stimes :: Integral b => b -> HashMap k v -> HashMap k v #
Semigroup b => Semigroup (a -> b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b # sconcat :: NonEmpty (a -> b) -> a -> b # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b #
(Semigroup a, Semigroup b) => Semigroup (a, b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b) -> (a, b) -> (a, b) # sconcat :: NonEmpty (a, b) -> (a, b) # stimes :: Integral b0 => b0 -> (a, b) -> (a, b) #
(Semigroup a, Semigroup b) :=> (Semigroup (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Semigroup a, Semigroup b) :- Semigroup (a, b) #
Semigroup a => Semigroup (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b # sconcat :: NonEmpty (Const a b) -> Const a b # stimes :: Integral b0 => b0 -> Const a b -> Const a b #
(Applicative f, Semigroup a) => Semigroup (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Ap f a -> Ap f a -> Ap f a # sconcat :: NonEmpty (Ap f a) -> Ap f a # stimes :: Integral b => b -> Ap f a -> Ap f a #
Alternative f => Semigroup (Alt f a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Alt f a -> Alt f a -> Alt f a # sconcat :: NonEmpty (Alt f a) -> Alt f a # stimes :: Integral b => b -> Alt f a -> Alt f a #
Semigroup (f p) => Semigroup (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p # sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p # stimes :: Integral b => b -> Rec1 f p -> Rec1 f p #
Semigroup (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #
(Monad m, Semigroup r) => Semigroup (Effect m r a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: Effect m r a -> Effect m r a -> Effect m r a # sconcat :: NonEmpty (Effect m r a) -> Effect m r a # stimes :: Integral b => b -> Effect m r a -> Effect m r a #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #
Semigroup a => Semigroup (Tagged s a)
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a # sconcat :: NonEmpty (Tagged s a) -> Tagged s a # stimes :: Integral b => b -> Tagged s a -> Tagged s a #
(Semigroup (f r), Semigroup (Rec f rs)) => Semigroup (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # sconcat :: NonEmpty (Rec f (r ': rs)) -> Rec f (r ': rs) # stimes :: Integral b => b -> Rec f (r ': rs) -> Rec f (r ': rs) #
Semigroup (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f '[] -> Rec f '[] -> Rec f '[] # sconcat :: NonEmpty (Rec f '[]) -> Rec f '[] # stimes :: Integral b => b -> Rec f '[] -> Rec f '[] #
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) # sconcat :: NonEmpty (a, b, c) -> (a, b, c) # stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) #
(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a)	Since: base-4.16.0.0
Instance details Defined in Data.Functor.Product Methods (<>) :: Product f g a -> Product f g a -> Product f g a # sconcat :: NonEmpty (Product f g a) -> Product f g a # stimes :: Integral b => b -> Product f g a -> Product f g a #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :: g) p -> (f :: g) p -> (f :: g) p # sconcat :: NonEmpty ((f :: g) p) -> (f :: g) p # stimes :: Integral b => b -> (f :: g) p -> (f :*: g) p #
Semigroup c => Semigroup (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: K1 i c p -> K1 i c p -> K1 i c p # sconcat :: NonEmpty (K1 i c p) -> K1 i c p # stimes :: Integral b => b -> K1 i c p -> K1 i c p #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) # stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) #
Semigroup (f (g a)) => Semigroup (Compose f g a)	Since: base-4.16.0.0
Instance details Defined in Data.Functor.Compose Methods (<>) :: Compose f g a -> Compose f g a -> Compose f g a # sconcat :: NonEmpty (Compose f g a) -> Compose f g a # stimes :: Integral b => b -> Compose f g a -> Compose f g a #
Semigroup (f (g p)) => Semigroup ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p # stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p #
Semigroup (f p) => Semigroup (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p # sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p # stimes :: Integral b => b -> M1 i c f p -> M1 i c f p #
Semigroup (f (g a)) => Semigroup (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods (<>) :: Compose f g a -> Compose f g a -> Compose f g a # sconcat :: NonEmpty (Compose f g a) -> Compose f g a # stimes :: Integral b => b -> Compose f g a -> Compose f g a #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) # stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) #
Curve f c e q r => Semigroup (Point f c e q r)
Instance details Defined in Data.Curve Methods (<>) :: Point f c e q r -> Point f c e q r -> Point f c e q r # sconcat :: NonEmpty (Point f c e q r) -> Point f c e q r # stimes :: Integral b => b -> Point f c e q r -> Point f c e q r #

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) <> z (Semigroup law)
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

mempty

Methods

mempty :: a #

Identity of mappend

>>> "Hello world" <> mempty
"Hello world"

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since 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.

mconcat :: [a] -> a #

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

Instances details

Monoid Key
Instance details Defined in Data.Aeson.Key Methods mempty :: Key # mappend :: Key -> Key -> Key # mconcat :: [Key] -> Key #
Monoid More
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: More # mappend :: More -> More -> More # mconcat :: [More] -> More #
Monoid ByteArray	Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods mempty :: ByteArray # mappend :: ByteArray -> ByteArray -> ByteArray # mconcat :: [ByteArray] -> ByteArray #
Monoid All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: All # mappend :: All -> All -> All # mconcat :: [All] -> All #
Monoid Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Any # mappend :: Any -> Any -> Any # mconcat :: [Any] -> Any #
Monoid AsciiString
Instance details Defined in Basement.Types.AsciiString Methods mempty :: AsciiString # mappend :: AsciiString -> AsciiString -> AsciiString # mconcat :: [AsciiString] -> AsciiString #
Monoid String
Instance details Defined in Basement.UTF8.Base Methods mempty :: String # mappend :: String -> String -> String # mconcat :: [String] -> String #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods mempty :: ShortByteString # mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString #
Monoid IntSet
Instance details Defined in Data.IntSet.Internal Methods mempty :: IntSet # mappend :: IntSet -> IntSet -> IntSet # mconcat :: [IntSet] -> IntSet #
Monoid Ordering	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: Ordering # mappend :: Ordering -> Ordering -> Ordering # mconcat :: [Ordering] -> Ordering #
Monoid AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods mempty :: AnalyzerRes # mappend :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # mconcat :: [AnalyzerRes] -> AnalyzerRes #
Monoid ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods mempty :: ContractDoc # mappend :: ContractDoc -> ContractDoc -> ContractDoc # mconcat :: [ContractDoc] -> ContractDoc #
Monoid MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods mempty :: MorleyLogs # mappend :: MorleyLogs -> MorleyLogs -> MorleyLogs # mconcat :: [MorleyLogs] -> MorleyLogs #
Monoid MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods mempty :: MorleyLogsBuilder # mappend :: MorleyLogsBuilder -> MorleyLogsBuilder -> MorleyLogsBuilder # mconcat :: [MorleyLogsBuilder] -> MorleyLogsBuilder #
Monoid Ruleset
Instance details Defined in Morley.Michelson.Optimizer.Internal.Ruleset Methods mempty :: Ruleset # mappend :: Ruleset -> Ruleset -> Ruleset # mconcat :: [Ruleset] -> Ruleset #
Monoid MText
Instance details Defined in Morley.Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Monoid AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods mempty :: AnnotationSet # mappend :: AnnotationSet -> AnnotationSet -> AnnotationSet # mconcat :: [AnnotationSet] -> AnnotationSet #
Monoid VarAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods mempty :: VarAnn # mappend :: VarAnn -> VarAnn -> VarAnn # mconcat :: [VarAnn] -> VarAnn #
Monoid PrefsMod
Instance details Defined in Options.Applicative.Builder Methods mempty :: PrefsMod # mappend :: PrefsMod -> PrefsMod -> PrefsMod # mconcat :: [PrefsMod] -> PrefsMod #
Monoid Completer
Instance details Defined in Options.Applicative.Types Methods mempty :: Completer # mappend :: Completer -> Completer -> Completer # mconcat :: [Completer] -> Completer #
Monoid ParseError
Instance details Defined in Options.Applicative.Types Methods mempty :: ParseError # mappend :: ParseError -> ParseError -> ParseError # mconcat :: [ParseError] -> ParseError #
Monoid Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods mempty :: Doc # mappend :: Doc -> Doc -> Doc # mconcat :: [Doc] -> Doc #
Monoid ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods mempty :: ByteArray # mappend :: ByteArray -> ByteArray -> ByteArray # mconcat :: [ByteArray] -> ByteArray #
Monoid PromDPatInfos
Instance details Defined in Data.Singletons.TH.Syntax Methods mempty :: PromDPatInfos # mappend :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # mconcat :: [PromDPatInfos] -> PromDPatInfos #
Monoid ULetDecEnv
Instance details Defined in Data.Singletons.TH.Syntax Methods mempty :: ULetDecEnv # mappend :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # mconcat :: [ULetDecEnv] -> ULetDecEnv #
Monoid Builder
Instance details Defined in Data.Text.Internal.Builder Methods mempty :: Builder # mappend :: Builder -> Builder -> Builder # mconcat :: [Builder] -> Builder #
Monoid ShortText
Instance details Defined in Data.Text.Short.Internal Methods mempty :: ShortText # mappend :: ShortText -> ShortText -> ShortText # mconcat :: [ShortText] -> ShortText #
Monoid ()	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: () # mappend :: () -> () -> () # mconcat :: [()] -> () #
() :=> (Monoid Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid Ordering #
() :=> (Monoid ())
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid () #
() :=> (Monoid [a])
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid [a] #
a :=> (Monoid (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Monoid (Dict a) #
Semigroup a => Monoid (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods mempty :: Option' a # mappend :: Option' a -> Option' a -> Option' a # mconcat :: [Option' a] -> Option' a #
Monoid (KeyMap v)
Instance details Defined in Data.Aeson.KeyMap Methods mempty :: KeyMap v # mappend :: KeyMap v -> KeyMap v -> KeyMap v # mconcat :: [KeyMap v] -> KeyMap v #
Monoid (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: IResult a # mappend :: IResult a -> IResult a -> IResult a # mconcat :: [IResult a] -> IResult a #
Monoid (Parser a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Parser a # mappend :: Parser a -> Parser a -> Parser a # mconcat :: [Parser a] -> Parser a #
Monoid (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Result a # mappend :: Result a -> Result a -> Result a # mconcat :: [Result a] -> Result a #
Monoid a => Monoid (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
Monoid (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: First a # mappend :: First a -> First a -> First a # mconcat :: [First a] -> First a #
Monoid (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: Last a # mappend :: Last a -> Last a -> Last a # mconcat :: [Last a] -> Last a #
Monoid a => Monoid (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods mempty :: Down a # mappend :: Down a -> Down a -> Down a # mconcat :: [Down a] -> Down a #
(Ord a, Bounded a) => Monoid (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Max a # mappend :: Max a -> Max a -> Max a # mconcat :: [Max a] -> Max a #
(Ord a, Bounded a) => Monoid (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Min a # mappend :: Min a -> Min a -> Min a # mconcat :: [Min a] -> Min a #
Monoid m => Monoid (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Dual a # mappend :: Dual a -> Dual a -> Dual a # mconcat :: [Dual a] -> Dual a #
Monoid (Endo a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Endo a # mappend :: Endo a -> Endo a -> Endo a # mconcat :: [Endo a] -> Endo a #
Num a => Monoid (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Product a # mappend :: Product a -> Product a -> Product a # mconcat :: [Product a] -> Product a #
Num a => Monoid (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
Monoid a => Monoid (STM a)	Since: base-4.17.0.0
Instance details Defined in GHC.Conc.Sync Methods mempty :: STM a # mappend :: STM a -> STM a -> STM a # mconcat :: [STM a] -> STM a #
(Generic a, Monoid (Rep a ())) => Monoid (Generically a)	Since: base-4.17.0.0
Instance details 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
Instance details Defined in GHC.Generics Methods mempty :: Par1 p # mappend :: Par1 p -> Par1 p -> Par1 p # mconcat :: [Par1 p] -> Par1 p #
PrimType ty => Monoid (Block ty)
Instance details Defined in Basement.Block.Base Methods mempty :: Block ty # mappend :: Block ty -> Block ty -> Block ty # mconcat :: [Block ty] -> Block ty #
Monoid (Array a)
Instance details Defined in Basement.BoxedArray Methods mempty :: Array a # mappend :: Array a -> Array a -> Array a # mconcat :: [Array a] -> Array a #
Monoid (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods mempty :: CountOf ty # mappend :: CountOf ty -> CountOf ty -> CountOf ty # mconcat :: [CountOf ty] -> CountOf ty #
PrimType ty => Monoid (UArray ty)
Instance details Defined in Basement.UArray.Base Methods mempty :: UArray ty # mappend :: UArray ty -> UArray ty -> UArray ty # mconcat :: [UArray ty] -> UArray ty #
a => Monoid (Dict a)
Instance details Defined in Data.Constraint Methods mempty :: Dict a # mappend :: Dict a -> Dict a -> Dict a # mconcat :: [Dict a] -> Dict a #
Monoid (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods mempty :: IntMap a # mappend :: IntMap a -> IntMap a -> IntMap a # mconcat :: [IntMap a] -> IntMap a #
Monoid (Seq a)
Instance details Defined in Data.Sequence.Internal Methods mempty :: Seq a # mappend :: Seq a -> Seq a -> Seq a # mconcat :: [Seq a] -> Seq a #
Monoid (MergeSet a)
Instance details Defined in Data.Set.Internal Methods mempty :: MergeSet a # mappend :: MergeSet a -> MergeSet a -> MergeSet a # mconcat :: [MergeSet a] -> MergeSet a #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
Monoid (DList a)
Instance details Defined in Data.DList.Internal Methods mempty :: DList a # mappend :: DList a -> DList a -> DList a # mconcat :: [DList a] -> DList a #
KnownNat p => Monoid (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods mempty :: Binary p # mappend :: Binary p -> Binary p -> Binary p # mconcat :: [Binary p] -> Binary p #
KnownNat p => Monoid (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods mempty :: Prime p # mappend :: Prime p -> Prime p -> Prime p # mconcat :: [Prime p] -> Prime p #
Monoid a => Monoid (IO a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mempty :: IO a # mappend :: IO a -> IO a -> IO a # mconcat :: [IO a] -> IO a #
Monoid a => Monoid (May a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: May a # mappend :: May a -> May a -> May a # mconcat :: [May a] -> May a #
Monoid (ComposeResult a)
Instance details Defined in Morley.Michelson.Typed.Haskell.LooseSum Methods mempty :: ComposeResult a # mappend :: ComposeResult a -> ComposeResult a -> ComposeResult a # mconcat :: [ComposeResult a] -> ComposeResult a #
Monoid (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods mempty :: PrintComment st # mappend :: PrintComment st -> PrintComment st -> PrintComment st # mconcat :: [PrintComment st] -> PrintComment st #
Monoid (SomeSizedList a)
Instance details Defined in Morley.Util.SizedList Methods mempty :: SomeSizedList a # mappend :: SomeSizedList a -> SomeSizedList a -> SomeSizedList a # mconcat :: [SomeSizedList a] -> SomeSizedList a #
BooleanMonoid a => Monoid (All a)
Instance details Defined in Morley.Prelude.Boolean Methods mempty :: All a # mappend :: All a -> All a -> All a # mconcat :: [All a] -> All a #
BooleanMonoid a => Monoid (Any a)
Instance details Defined in Morley.Prelude.Boolean Methods mempty :: Any a # mappend :: Any a -> Any a -> Any a # mconcat :: [Any a] -> Any a #
Monoid (InfoMod a)
Instance details Defined in Options.Applicative.Builder Methods mempty :: InfoMod a # mappend :: InfoMod a -> InfoMod a -> InfoMod a # mconcat :: [InfoMod a] -> InfoMod a #
Monoid (DefaultProp a)
Instance details 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)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods mempty :: Doc a # mappend :: Doc a -> Doc a -> Doc a # mconcat :: [Doc a] -> Doc a #
Monoid (Doc ann)	`mempty` = `emptyDoc` `mconcat` = `hcat` `>>>` `mappend "hello" "world" :: Doc ann`helloworld
Instance details Defined in Prettyprinter.Internal Methods mempty :: Doc ann # mappend :: Doc ann -> Doc ann -> Doc ann # mconcat :: [Doc ann] -> Doc ann #
Monoid (Array a)
Instance details Defined in Data.Primitive.Array Methods mempty :: Array a # mappend :: Array a -> Array a -> Array a # mconcat :: [Array a] -> Array a #
Monoid (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods mempty :: PrimArray a # mappend :: PrimArray a -> PrimArray a -> PrimArray a # mconcat :: [PrimArray a] -> PrimArray a #
Monoid (SmallArray a)
Instance details 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)
Instance details Defined in Data.Semiring Methods mempty :: Add a # mappend :: Add a -> Add a -> Add a # mconcat :: [Add a] -> Add a #
Monoid (IntSetOf a)
Instance details Defined in Data.Semiring Methods mempty :: IntSetOf a # mappend :: IntSetOf a -> IntSetOf a -> IntSetOf a # mconcat :: [IntSetOf a] -> IntSetOf a #
Semiring a => Monoid (Mul a)
Instance details Defined in Data.Semiring Methods mempty :: Mul a # mappend :: Mul a -> Mul a -> Mul a # mconcat :: [Mul a] -> Mul a #
Semigroup a => Monoid (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Monoid a => Monoid (Q a)	Since: template-haskell-2.17.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods mempty :: Q a # mappend :: Q a -> Q a -> Q a # mconcat :: [Q a] -> Q a #
(Hashable a, Eq a) => Monoid (HashSet a)	`mempty` = `empty` `mappend` = `union` $O(n+m)$ To obtain good performance, the smaller set must be presented as the first argument. Examples Expand `>>>` `mappend (fromList [1,2]) (fromList [2,3])`fromList [1,2,3]
Instance details Defined in Data.HashSet.Internal Methods mempty :: HashSet a # mappend :: HashSet a -> HashSet a -> HashSet a # mconcat :: [HashSet a] -> HashSet a #
Monoid (Vector a)
Instance details Defined in Data.Vector Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Prim a => Monoid (Vector a)
Instance details Defined in Data.Vector.Primitive Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Storable a => Monoid (Vector a)
Instance details Defined in Data.Vector.Storable Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
(KnownSymbol s, Monoid t) => Monoid (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods mempty :: ElField '(s, t) # mappend :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # mconcat :: [ElField '(s, t)] -> ElField '(s, t) #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Monoid a => Monoid (a)	Since: base-4.15
Instance details Defined in GHC.Base Methods mempty :: (a) # mappend :: (a) -> (a) -> (a) # mconcat :: [(a)] -> (a) #
Monoid [a]	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: [a] # mappend :: [a] -> [a] -> [a] # mconcat :: [[a]] -> [a] #
(Monoid a) :=> (Applicative (Const a :: Type -> Type))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Applicative (Const a) #
(Monoid a) :=> (Applicative ((,) a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Applicative ((,) a) #
(Monoid a) :=> (Monoid (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Const a b) #
(Monoid a) :=> (Monoid (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Identity a) #
(Monoid a) :=> (Monoid (IO a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (IO a) #
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Maybe a) #
Class (Semigroup a) (Monoid a)
Instance details Defined in Data.Constraint Methods cls :: Monoid a :- Semigroup a #
Monoid (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: Parser i a # mappend :: Parser i a -> Parser i a -> Parser i a # mconcat :: [Parser i a] -> Parser i a #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
Monoid (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: U1 p # mappend :: U1 p -> U1 p -> U1 p # mconcat :: [U1 p] -> U1 p #
Monoid a => Monoid (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods mempty :: ST s a # mappend :: ST s a -> ST s a -> ST s a # mconcat :: [ST s a] -> ST s a #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
IrreducibleMonic p k => Monoid (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods mempty :: Extension p k # mappend :: Extension p k -> Extension p k -> Extension p k # mconcat :: [Extension p k] -> Extension p k #
(KnownNat n, GaloisField k) => Monoid (RootsOfUnity n k)
Instance details 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)	`>>>` `"cat" ^@.. (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(0,'c'),(1,'a'),(2,'t')] `>>>` `"cat" ^@.. indexing (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(3,'c'),(4,'a'),(5,'t')]
Instance details Defined in Control.Lens.Internal.Indexed Methods mempty :: Indexing f a # mappend :: Indexing f a -> Indexing f a -> Indexing f a # mconcat :: [Indexing f a] -> Indexing f a #
Monoid (ReifiedFold s a)
Instance details 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 #
Instance details Defined in Lorentz.Base Methods mempty :: s :-> s # mappend :: (s :-> s) -> (s :-> s) -> s :-> s # mconcat :: [s :-> s] -> s :-> s #
(Stream s, Ord e) => Monoid (ParseError s e)
Instance details 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)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: Err e a # mappend :: Err e a -> Err e a -> Err e a # mconcat :: [Err e a] -> Err e a #
Monoid (Instr s s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods mempty :: Instr s s # mappend :: Instr s s -> Instr s s -> Instr s s # mconcat :: [Instr s s] -> Instr s s #
Monoid (Mod f a)
Instance details Defined in Options.Applicative.Builder.Internal Methods mempty :: Mod f a # mappend :: Mod f a -> Mod f a -> Mod f a # mconcat :: [Mod f a] -> Mod f a #
Monoid (IntMapOf k v)
Instance details Defined in Data.Semiring Methods mempty :: IntMapOf k v # mappend :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # mconcat :: [IntMapOf k v] -> IntMapOf k v #
Applicative m => Monoid (Some m)
Instance details Defined in Data.GADT.Internal Methods mempty :: Some m # mappend :: Some m -> Some m -> Some m # mconcat :: [Some m] -> Some m #
(Monoid a, Monoid b) => Monoid (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods mempty :: Pair a b # mappend :: Pair a b -> Pair a b -> Pair a b # mconcat :: [Pair a b] -> Pair a b #
(Eq k, Hashable k) => Monoid (HashMap k v)	`mempty` = `empty` `mappend` = `union` If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples Expand `>>>` `mappend (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])`fromList [(1,'a'),(2,'b'),(3,'d')]
Instance details Defined in Data.HashMap.Internal Methods mempty :: HashMap k v # mappend :: HashMap k v -> HashMap k v -> HashMap k v # mconcat :: [HashMap k v] -> HashMap k v #
Monoid b => Monoid (a -> b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: a -> b # mappend :: (a -> b) -> (a -> b) -> a -> b # mconcat :: [a -> b] -> a -> b #
(Monoid a, Monoid b) => Monoid (a, b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b) # mappend :: (a, b) -> (a, b) -> (a, b) # mconcat :: [(a, b)] -> (a, b) #
(Monoid a, Monoid b) :=> (Monoid (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Monoid a, Monoid b) :- Monoid (a, b) #
Monoid a => Monoid (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods mempty :: Const a b # mappend :: Const a b -> Const a b -> Const a b # mconcat :: [Const a b] -> Const a b #
(Applicative f, Monoid a) => Monoid (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods mempty :: Ap f a # mappend :: Ap f a -> Ap f a -> Ap f a # mconcat :: [Ap f a] -> Ap f a #
Alternative f => Monoid (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Alt f a # mappend :: Alt f a -> Alt f a -> Alt f a # mconcat :: [Alt f a] -> Alt f a #
Monoid (f p) => Monoid (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: Rec1 f p # mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p # mconcat :: [Rec1 f p] -> Rec1 f p #
Monoid (ReifiedIndexedFold i s a)
Instance details 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)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: Effect m r a # mappend :: Effect m r a -> Effect m r a -> Effect m r a # mconcat :: [Effect m r a] -> Effect m r a #
Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s)
Instance details 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)
Instance details Defined in Data.Tagged Methods mempty :: Tagged s a # mappend :: Tagged s a -> Tagged s a -> Tagged s a # mconcat :: [Tagged s a] -> Tagged s a #
(Monoid (f r), Monoid (Rec f rs)) => Monoid (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f (r ': rs) # mappend :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # mconcat :: [Rec f (r ': rs)] -> Rec f (r ': rs) #
Monoid (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f '[] # mappend :: Rec f '[] -> Rec f '[] -> Rec f '[] # mconcat :: [Rec f '[]] -> Rec f '[] #
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c) # mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) # mconcat :: [(a, b, c)] -> (a, b, c) #
(Monoid (f a), Monoid (g a)) => Monoid (Product f g a)	Since: base-4.16.0.0
Instance details Defined in Data.Functor.Product Methods mempty :: Product f g a # mappend :: Product f g a -> Product f g a -> Product f g a # mconcat :: [Product f g a] -> Product f g a #
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :: g) p # mappend :: (f :: g) p -> (f :: g) p -> (f :: g) p # mconcat :: [(f :: g) p] -> (f :: g) p #
Monoid c => Monoid (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: K1 i c p # mappend :: K1 i c p -> K1 i c p -> K1 i c p # mconcat :: [K1 i c p] -> K1 i c p #
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d) # mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # mconcat :: [(a, b, c, d)] -> (a, b, c, d) #
Monoid (f (g a)) => Monoid (Compose f g a)	Since: base-4.16.0.0
Instance details Defined in Data.Functor.Compose Methods mempty :: Compose f g a # mappend :: Compose f g a -> Compose f g a -> Compose f g a # mconcat :: [Compose f g a] -> Compose f g a #
Monoid (f (g p)) => Monoid ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :.: g) p # mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # mconcat :: [(f :.: g) p] -> (f :.: g) p #
Monoid (f p) => Monoid (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: M1 i c f p # mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p # mconcat :: [M1 i c f p] -> M1 i c f p #
Monoid (f (g a)) => Monoid (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods mempty :: Compose f g a # mappend :: Compose f g a -> Compose f g a -> Compose f g a # mconcat :: [Compose f g a] -> Compose f g a #
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d, e) # mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #
Curve f c e q r => Monoid (Point f c e q r)
Instance details Defined in Data.Curve Methods mempty :: Point f c e q r # mappend :: Point f c e q r -> Point f c e q r -> Point f c e q r # mconcat :: [Point f c e q r] -> Point f c e q r #

data Bool #

Constructors

False
True

Instances

Instances details

Structured Bool
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy Bool -> Structure # structureHash' :: Tagged Bool MD5
ToJSON Bool
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Bool -> Value # toEncoding :: Bool -> Encoding # toJSONList :: [Bool] -> Value # toEncodingList :: [Bool] -> Encoding #
ToJSONKey Bool
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Bool # toJSONKeyList :: ToJSONKeyFunction [Bool] #
Data Bool	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bool -> c Bool # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool # toConstr :: Bool -> Constr # dataTypeOf :: Bool -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) # gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool #
Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Enum Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Bool -> Bool # pred :: Bool -> Bool # toEnum :: Int -> Bool # fromEnum :: Bool -> Int # enumFrom :: Bool -> [Bool] # enumFromThen :: Bool -> Bool -> [Bool] # enumFromTo :: Bool -> Bool -> [Bool] # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #
Generic Bool
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
SingKind Bool	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep Bool Methods fromSing :: forall (a :: Bool). Sing a -> DemoteRep Bool
Read Bool	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Bool # readList :: ReadS [Bool] # readPrec :: ReadPrec Bool # readListPrec :: ReadPrec [Bool] #
Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
BitOps Bool
Instance details Defined in Basement.Bits Methods (.&.) :: Bool -> Bool -> Bool # (.\|.) :: Bool -> Bool -> Bool # (.^.) :: Bool -> Bool -> Bool # (.<<.) :: Bool -> CountOf Bool -> Bool # (.>>.) :: Bool -> CountOf Bool -> Bool # bit :: Offset Bool -> Bool # isBitSet :: Bool -> Offset Bool -> Bool # setBit :: Bool -> Offset Bool -> Bool # clearBit :: Bool -> Offset Bool -> Bool #
FiniteBitsOps Bool
Instance details Defined in Basement.Bits Methods numberOfBits :: Bool -> CountOf Bool # rotateL :: Bool -> CountOf Bool -> Bool # rotateR :: Bool -> CountOf Bool -> Bool # popCount :: Bool -> CountOf Bool # bitFlip :: Bool -> Bool # countLeadingZeros :: Bool -> CountOf Bool # countTrailingZeros :: Bool -> CountOf Bool #
NFData Bool
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
HasAnnotation Bool Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Bool
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Bool
TypeHasDoc Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Bool :: FieldDescriptions # Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Bool # typeDocMichelsonRep :: TypeDocMichelsonRep Bool #
IsoValue Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
Buildable Bool
Instance details Defined in Fmt.Buildable Methods build :: Bool -> Doc buildList :: [Bool] -> Doc
Boolean Bool
Instance details Defined in Morley.Prelude.Boolean Methods (&&) :: Bool -> Bool -> Bool (\|\|) :: Bool -> Bool -> Bool not :: Bool -> Bool
BooleanMonoid Bool
Instance details Defined in Morley.Prelude.Boolean Methods false :: Bool true :: Bool
Pretty Bool	`>>>` `pretty True`True
Instance details Defined in Prettyprinter.Internal Methods pretty :: Bool -> Doc ann # prettyList :: [Bool] -> Doc ann #
Uniform Bool
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Bool #
UniformRange Bool
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Bool, Bool) -> g -> m Bool #
Semiring Bool
Instance details Defined in Data.Semiring Methods plus :: Bool -> Bool -> Bool # zero :: Bool # times :: Bool -> Bool -> Bool # one :: Bool # fromNatural :: Natural -> Bool #
PEq Bool
Instance details Defined in Data.Eq.Singletons Associated Types type arg == arg1 :: Bool # type arg /= arg1 :: Bool #
SEq Bool
Instance details Defined in Data.Eq.Singletons Methods (%==) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) # (%/=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) #
POrd Bool
Instance details Defined in Data.Ord.Singletons Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd Bool
Instance details Defined in Data.Ord.Singletons Methods sCompare :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) #
PBounded Bool
Instance details Defined in Data.Singletons.Base.Enum Associated Types type MinBound :: a # type MaxBound :: a #
PEnum Bool
Instance details Defined in Data.Singletons.Base.Enum Associated Types type Succ arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Natural # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
SBounded Bool
Instance details Defined in Data.Singletons.Base.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
SEnum Bool
Instance details Defined in Data.Singletons.Base.Enum Methods sSucc :: forall (t :: Bool). Sing t -> Sing (Apply SuccSym0 t) # sPred :: forall (t :: Bool). Sing t -> Sing (Apply PredSym0 t) # sToEnum :: forall (t :: Natural). Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: forall (t1 :: Bool) (t2 :: Bool) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) #
PShow Bool
Instance details Defined in Text.Show.Singletons Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow Bool
Instance details Defined in Text.Show.Singletons Methods sShowsPrec :: forall (t1 :: Natural) (t2 :: Bool) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Bool]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
Unbox Bool
Instance details Defined in Data.Vector.Unboxed.Base
TestCoercion SBool
Instance details Defined in Data.Singletons.Base.Instances Methods testCoercion :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (Coercion a b) #
TestEquality SBool
Instance details Defined in Data.Singletons.Base.Instances Methods testEquality :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (a :~: b) #
SingI 'False	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'False
SingI 'True	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'True
UnaryArithOpHs Not Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bool ': s) :-> (UnaryArithResHs Not Bool ': s) Source #
Lift Bool
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Bool -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Bool -> Code m Bool #
Vector Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Bool -> ST s (Vector Bool) # basicUnsafeThaw :: Vector Bool -> ST s (Mutable Vector s Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Vector Bool -> Int -> Box Bool # basicUnsafeCopy :: Mutable Vector s Bool -> Vector Bool -> ST s () # elemseq :: Vector Bool -> Bool -> b -> b #
MVector MVector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: Int -> ST s (MVector s Bool) # basicInitialize :: MVector s Bool -> ST s () # basicUnsafeReplicate :: Int -> Bool -> ST s (MVector s Bool) # basicUnsafeRead :: MVector s Bool -> Int -> ST s Bool # basicUnsafeWrite :: MVector s Bool -> Int -> Bool -> ST s () # basicClear :: MVector s Bool -> ST s () # basicSet :: MVector s Bool -> Bool -> ST s () # basicUnsafeCopy :: MVector s Bool -> MVector s Bool -> ST s () # basicUnsafeMove :: MVector s Bool -> MVector s Bool -> ST s () # basicUnsafeGrow :: MVector s Bool -> Int -> ST s (MVector s Bool) #
r ~ Bool => ArithOpHs And Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Or Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Xor Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
SingI2 (IfSym2 :: Bool -> k2 -> TyFun k2 k2 -> Type)
Instance details Defined in Data.Bool.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k20). Sing x -> Sing y -> Sing (IfSym2 x y) #
SingI2 (Bool_Sym2 :: a -> a -> TyFun Bool a -> Type)
Instance details Defined in Data.Bool.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Bool_Sym2 x y) #
() :=> (Bits Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Bool #
() :=> (Bounded Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Bool #
() :=> (Enum Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Bool #
() :=> (Read Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Read Bool #
() :=> (Show Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Bool #
() :=> (Eq Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Bool #
() :=> (Ord Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Bool #
SingI1 ShowParenSym1
Instance details Defined in Text.Show.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ShowParenSym1 x) #
SingI1 ((<=?@#@$$) :: Natural -> TyFun Natural Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing ((<=?@#@$$) x) #
SApplicative f => SingI1 (UnlessSym1 :: Bool -> TyFun (f ()) (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (UnlessSym1 x) #
SApplicative f => SingI1 (WhenSym1 :: Bool -> TyFun (f ()) (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (WhenSym1 x) #
SingI1 (IfSym1 :: Bool -> TyFun k (k ~> k) -> Type)
Instance details Defined in Data.Bool.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (IfSym1 x) #
SEq a => SingI1 (ElemSym1 :: a -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (ElemSym1 x) #
SEq a => SingI1 (NotElemSym1 :: a -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (NotElemSym1 x) #
SEq a => SingI1 (ListelemSym1 :: a -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListelemSym1 x) #
SingI1 (Bool_Sym1 :: a -> TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Bool.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Bool_Sym1 x) #
SEq a => SingI1 ((/=@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((/=@#@$$) x) #
SEq a => SingI1 ((==@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((==@#@$$) x) #
SOrd a => SingI1 ((<=@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((<=@#@$$) x) #
SOrd a => SingI1 ((<@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((<@#@$$) x) #
SOrd a => SingI1 ((>=@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((>=@#@$$) x) #
SOrd a => SingI1 ((>@#@$$) :: a -> TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ((>@#@$$) x) #
SingI d => SingI1 (Bool_Sym2 d :: a -> TyFun Bool a -> Type)
Instance details Defined in Data.Bool.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (Bool_Sym2 d x) #
SingI d => SingI1 (Elem_bySym2 d :: a -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (Elem_bySym2 d x) #
(SFoldable t, SEq a) => SingI1 (ElemSym1 :: a -> TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ElemSym1 x) #
(SFoldable t, SEq a) => SingI1 (NotElemSym1 :: a -> TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (NotElemSym1 x) #
SingI2 ShowParenSym2
Instance details Defined in Text.Show.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ShowParenSym2 x y) #
SEq a => SingI1 (IsInfixOfSym1 :: [a] -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (IsInfixOfSym1 x) #
SEq a => SingI1 (IsPrefixOfSym1 :: [a] -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (IsPrefixOfSym1 x) #
SEq a => SingI1 (IsSuffixOfSym1 :: [a] -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (IsSuffixOfSym1 x) #
SEq a => SingI1 (ListisPrefixOfSym1 :: [a] -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListisPrefixOfSym1 x) #
SingI GetAllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAllSym0 #
SingI GetAnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAnySym0 #
SingI AllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing AllSym0 #
SingI All_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing All_Sym0 #
SingI AnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing AnySym0 #
SingI Any_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing Any_Sym0 #
SingI ShowParenSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowParenSym0 #
SingI AndSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AndSym0 #
SingI OrSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing OrSym0 #
SingI (&&@#@$)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (&&@#@$) #
SingI (\|\|@#@$)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (\|\|@#@$) #
SingI NotSym0
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing NotSym0 #
SuppressUnusedWarnings TFHelper_6989586621679647443Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings TFHelper_6989586621679647460Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings TFHelper_6989586621679136333Sym0
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings TFHelper_6989586621679136722Sym0
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ProtectEscSym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680127564Sym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679583880Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings TFHelper_6989586621679136731Sym0
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings All_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Any_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowParenSym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679189701Sym0
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (&&@#@$)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (\|\|@#@$)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings TFHelper_6989586621679136713Sym0
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679583893Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings NotSym0
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings IsDecSym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AndSym0
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings OrSym0
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SingI2 (Elem_bySym2 :: (a ~> (a ~> Bool)) -> a -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Elem_bySym2 x y) #
SingI2 (DeleteBySym2 :: (a ~> (a ~> Bool)) -> a -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (DeleteBySym2 x y) #
SingI2 (SelectSym2 :: (a ~> Bool) -> a -> TyFun ([a], [a]) ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (SelectSym2 x y) #
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteFirstsBySym0 #
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IntersectBySym0 #
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnionBySym0 #
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing GroupBySym0 #
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NubBySym0 #
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListnubBySym0 #
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Elem_bySym0 #
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteBySym0 #
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing UntilSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindSym0 #
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing BreakSym0 #
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing PartitionSym0 #
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SpanSym0 #
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListpartitionSym0 #
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListspanSym0 #
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AllSym0 #
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AnySym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndicesSym0 #
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropWhileEndSym0 #
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropWhileSym0 #
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FilterSym0 #
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TakeWhileSym0 #
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListdropWhileSym0 #
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListfilterSym0 #
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtakeWhileSym0 #
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SelectSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 #
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing UnlessSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing WhenSym0 #
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing GuardSym0 #
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsInfixOfSym0 #
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsPrefixOfSym0 #
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsSuffixOfSym0 #
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListisPrefixOfSym0 #
SingI (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NullSym0 #
SingI (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListnullSym0 #
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemSym0 #
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NotElemSym0 #
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListelemSym0 #
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing Bool_Sym0 #
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing (/=@#@$) #
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing (==@#@$) #
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (<=@#@$) #
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (<@#@$) #
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (>=@#@$) #
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (>@#@$) #
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AndSym0 #
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing OrSym0 #
SingI ((<=?@#@$) :: TyFun Natural (Natural ~> Bool) -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing (<=?@#@$) #
SingI (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing IfSym0 #
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing ((&&@#@$$) x) #
SingI x => SingI ((\|\|@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing ((\|\|@#@$$) x) #
SuppressUnusedWarnings (TFHelper_6989586621679136700Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680460416Sym0 :: TyFun (Identity a) Bool -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680176930Sym0 :: TyFun (First a) (First a ~> Bool) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680176950Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679187081Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647560Sym0 :: TyFun (First a) (First a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647580Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647540Sym0 :: TyFun (Max a) (Max a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647520Sym0 :: TyFun (Min a) (Min a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647600Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647443Sym1 a6989586621679647448 :: TyFun All Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647460Sym1 a6989586621679647465 :: TyFun Any Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647426Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261827Sym0 :: TyFun (Dual a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647500Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680262177Sym0 :: TyFun (Product a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647480Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680262002Sym0 :: TyFun (Sum a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136333Sym1 a6989586621679136338 :: TyFun Void Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136722Sym1 a6989586621679136727 :: TyFun Ordering Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765788X_6989586621679765789Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765823X_6989586621679765824Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765788YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765788ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765823YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765823ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136316Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136731Sym1 a6989586621679136736 :: TyFun () Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679189701Sym1 a6989586621679189706 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127564Sym1 a6989586621680127574 :: TyFun Bool (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679128318 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679128697 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136713Sym1 a6989586621679136718 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136241Sym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261421Sym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680460300Sym0 :: TyFun a (Identity a ~> Bool) -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261695Sym0 :: TyFun a (Dual a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680262045Sym0 :: TyFun a (Product a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261870Sym0 :: TyFun a (Sum a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261287Sym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679133659Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679133670Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173484Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173500Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173516Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173532Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$) :: TyFun k (k ~> Bool) -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251459Scrutinee_6989586621680251427Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251483Scrutinee_6989586621680251429Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173472Scrutinee_6989586621679171703Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173476Scrutinee_6989586621679171705Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173557Scrutinee_6989586621679171715Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173573Scrutinee_6989586621679171717Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680230554Scrutinee_6989586621680228699Sym0 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SingI2 (DeleteFirstsBySym2 :: (a ~> (a ~> Bool)) -> [a] -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (DeleteFirstsBySym2 x y) #
SingI2 (IntersectBySym2 :: (a ~> (a ~> Bool)) -> [a] -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (IntersectBySym2 x y) #
SingI2 (UnionBySym2 :: (a ~> (a ~> Bool)) -> [a] -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (UnionBySym2 x y) #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 #
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing MfilterSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FindSym0 #
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AllSym0 #
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AnySym0 #
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing FilterMSym0 #
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (AllSym1 d) #
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (AnySym1 d) #
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemSym1 d) #
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsInfixOfSym1 d) #
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsSuffixOfSym1 d) #
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (NotElemSym1 d) #
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListelemSym1 d) #
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListisPrefixOfSym1 d) #
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (Bool_Sym1 d) #
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Elem_bySym1 d) #
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ElemSym0 #
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing NotElemSym0 #
(SEq a, SingI d) => SingI ((/=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing ((/=@#@$$) d) #
(SEq a, SingI d) => SingI ((==@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing ((==@#@$$) d) #
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((<=@#@$$) d) #
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((<@#@$$) d) #
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((>=@#@$$) d) #
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((>@#@$$) d) #
SingI x => SingI ((<=?@#@$$) x :: TyFun Natural Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SuppressUnusedWarnings (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136700Sym1 a6989586621679136705 :: TyFun (Identity a) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680460300Sym1 a6989586621680460305 :: TyFun (Identity a) Bool -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680176930Sym1 a6989586621680176935 :: TyFun (First a) Bool -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680176950Sym1 a6989586621680176955 :: TyFun (Last a) Bool -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679187081Sym1 a6989586621679187086 :: TyFun (Down a) Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680669373Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647560Sym1 a6989586621679647565 :: TyFun (First a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647580Sym1 a6989586621679647585 :: TyFun (Last a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647540Sym1 a6989586621679647545 :: TyFun (Max a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647520Sym1 a6989586621679647525 :: TyFun (Min a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647600Sym1 a6989586621679647605 :: TyFun (WrappedMonoid m) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261695Sym1 a6989586621680261704 :: TyFun (Dual a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647426Sym1 a6989586621679647431 :: TyFun (Dual a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680262045Sym1 a6989586621680262054 :: TyFun (Product a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647500Sym1 a6989586621679647505 :: TyFun (Product a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261870Sym1 a6989586621680261879 :: TyFun (Sum a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679647480Sym1 a6989586621679647485 :: TyFun (Sum a) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120016ContSym0 :: TyFun (Char ~> Bool) (TyFun k1 (TyFun k2 (TyFun Symbol Symbol -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680260710Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621679765851Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765690X_6989586621679765691Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765690YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765690ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765556NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679257799GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in GHC.Base.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136316Sym1 a6989586621679136321 :: TyFun (NonEmpty a) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136356Sym0 :: TyFun (a, b) ((a, b) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136241Sym1 a6989586621679136246 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261287Sym1 a6989586621680261296 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621679766539 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621679766531 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621679766314 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621679766322 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621679766336 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621679766329 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621679766306 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym1 a6989586621680046083 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680046155 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679126615 :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym1 a6989586621679765542 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261177Sym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$$) a6989586621679133655 :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$$) a6989586621679133650 :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679133659Sym1 a6989586621679133664 :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679133670Sym1 a6989586621679133675 :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$$) a6989586621679173439 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$$) a6989586621679173434 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$$) a6989586621679173449 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$$) a6989586621679173444 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173484Sym1 a6989586621679173489 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173500Sym1 a6989586621679173505 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173516Sym1 a6989586621679173521 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679173532Sym1 a6989586621679173537 :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679135866 :: TyFun k Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$$) a6989586621679491383 :: TyFun k Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765611Scrutinee_6989586621679762511Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251459Scrutinee_6989586621680251427Sym1 x6989586621680251454 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251483Scrutinee_6989586621680251429Sym1 x6989586621680251478 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173472Scrutinee_6989586621679171703Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173476Scrutinee_6989586621679171705Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173557Scrutinee_6989586621679171715Sym1 x6989586621679173555 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679173573Scrutinee_6989586621679171717Sym1 x6989586621679173571 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SingI1 (DeleteFirstsBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (DeleteFirstsBySym1 x) #
SingI1 (IntersectBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (IntersectBySym1 x) #
SingI1 (UnionBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (UnionBySym1 x) #
SingI1 (GroupBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (GroupBySym1 x) #
SingI1 (NubBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (NubBySym1 x) #
SingI1 (ListnubBySym1 :: (a ~> (a ~> Bool)) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListnubBySym1 x) #
SingI1 (Elem_bySym1 :: (a ~> (a ~> Bool)) -> TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (Elem_bySym1 x) #
SingI1 (DeleteBySym1 :: (a ~> (a ~> Bool)) -> TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (DeleteBySym1 x) #
SingI1 (UntilSym1 :: (a ~> Bool) -> TyFun (a ~> a) (a ~> a) -> Type)
Instance details Defined in GHC.Base.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (UntilSym1 x) #
SingI1 (FindIndexSym1 :: (a ~> Bool) -> TyFun [a] (Maybe Natural) -> Type)
Instance details 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)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindSym1 x) #
SingI1 (BreakSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (BreakSym1 x) #
SingI1 (PartitionSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (PartitionSym1 x) #
SingI1 (SpanSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (SpanSym1 x) #
SingI1 (ListpartitionSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListpartitionSym1 x) #
SingI1 (ListspanSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListspanSym1 x) #
SingI1 (AllSym1 :: (a ~> Bool) -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (AllSym1 x) #
SingI1 (AnySym1 :: (a ~> Bool) -> TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (AnySym1 x) #
SingI1 (FindIndicesSym1 :: (a ~> Bool) -> TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindIndicesSym1 x) #
SingI1 (DropWhileEndSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (DropWhileEndSym1 x) #
SingI1 (DropWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (DropWhileSym1 x) #
SingI1 (FilterSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FilterSym1 x) #
SingI1 (TakeWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (TakeWhileSym1 x) #
SingI1 (ListdropWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListdropWhileSym1 x) #
SingI1 (ListfilterSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListfilterSym1 x) #
SingI1 (ListtakeWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListtakeWhileSym1 x) #
SingI1 (SelectSym1 :: (a ~> Bool) -> TyFun a (([a], [a]) ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (SelectSym1 x) #
SMonadPlus m => SingI1 (MfilterSym1 :: (a ~> Bool) -> TyFun (m a) (m a) -> Type)
Instance details Defined in Control.Monad.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (MfilterSym1 x) #
SFoldable t => SingI1 (FindSym1 :: (a ~> Bool) -> TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindSym1 x) #
SFoldable t => SingI1 (AllSym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (AllSym1 x) #
SFoldable t => SingI1 (AnySym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (AnySym1 x) #
SApplicative m => SingI1 (FilterMSym1 :: (a ~> m Bool) -> TyFun [a] (m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (FilterMSym1 x) #
SingI2 (UntilSym2 :: (a ~> Bool) -> (a ~> a) -> TyFun a a -> Type)
Instance details Defined in GHC.Base.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (UntilSym2 x y) #
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (Bool_Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Elem_bySym2 d1 d2) #
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AllSym1 d) #
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AnySym1 d) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ElemSym1 d) #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym1 d) #
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing NullSym0 #
SuppressUnusedWarnings (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680493995Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680669373Sym1 a6989586621680669378 :: TyFun (Arg a b) Bool -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993136Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993298Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136356Sym1 a6989586621679136361 :: TyFun (a, b) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136394Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym2 a6989586621679126615 a6989586621679126616 :: TyFun Bool a -> Type)
Instance details Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym2 a6989586621679765542 a6989586621679765543 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765611Scrutinee_6989586621679762511Sym1 n6989586621679765609 :: TyFun k Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765855Scrutinee_6989586621679762489Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765677Scrutinee_6989586621679762507Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765563Scrutinee_6989586621679762517Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765579Scrutinee_6989586621679762515Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993301Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680261149Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765592Scrutinee_6989586621679762513Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765754Scrutinee_6989586621679762497Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765767Scrutinee_6989586621679762495Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680260773 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680260782 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621680260977 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261177Sym1 a6989586621680261186 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680260724 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261141Sym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680493995Sym1 a6989586621680494000 :: TyFun (Const a b) Bool -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136394Sym1 a6989586621679136399 :: TyFun (a, b, c) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136443Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765855Scrutinee_6989586621679762489Sym1 x6989586621679765853 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679555031Scrutinee_6989586621679554839Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765677Scrutinee_6989586621679762507Sym1 key6989586621679765673 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765563Scrutinee_6989586621679762517Sym1 y6989586621679765560 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765579Scrutinee_6989586621679762515Sym1 x6989586621679765576 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993301Sym1 x6989586621680993300 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680261149Sym1 a_69895866216802611436989586621680261148 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765592Scrutinee_6989586621679762513Sym1 x6989586621679765589 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765754Scrutinee_6989586621679762497Sym1 n6989586621679765751 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765767Scrutinee_6989586621679762495Sym1 n6989586621679765764 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621679765904Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765855Scrutinee_6989586621679762489Sym2 x6989586621679765853 xs6989586621679765854 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136443Sym1 a6989586621679136448 :: TyFun (a, b, c, d) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136503Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765563Scrutinee_6989586621679762517Sym2 y6989586621679765560 ys6989586621679765561 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765579Scrutinee_6989586621679762515Sym2 x6989586621679765576 xs6989586621679765577 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679555031Scrutinee_6989586621679554839Sym1 x6989586621679555030 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765677Scrutinee_6989586621679762507Sym2 key6989586621679765673 x6989586621679765674 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993301Sym2 x6989586621680993300 p6989586621680993296 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680261149Sym2 a_69895866216802611436989586621680261148 arg_69895866216802605496989586621680261151 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765592Scrutinee_6989586621679762513Sym2 x6989586621679765589 xs6989586621679765590 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765754Scrutinee_6989586621679762497Sym2 n6989586621679765751 x6989586621679765752 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765767Scrutinee_6989586621679762495Sym2 n6989586621679765764 x6989586621679765765 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765563Scrutinee_6989586621679762517Sym3 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136503Sym1 a6989586621679136508 :: TyFun (a, b, c, d, e) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136574Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680993301Sym3 x6989586621680993300 p6989586621680993296 a_69895866216809932896989586621680993297 :: TyFun Bool ([k1] ~> [k1]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765855Scrutinee_6989586621679762489Sym3 x6989586621679765853 xs6989586621679765854 p6989586621679765849 :: TyFun k Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679555031Scrutinee_6989586621679554839Sym2 x6989586621679555030 x06989586621679555025 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym1 x16989586621679554935 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym1 x16989586621679554972 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765579Scrutinee_6989586621679762515Sym3 x6989586621679765576 xs6989586621679765577 ls6989586621679765578 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765677Scrutinee_6989586621679762507Sym3 key6989586621679765673 x6989586621679765674 y6989586621679765675 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136574Sym1 a6989586621679136579 :: TyFun (a, b, c, d, e, f) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136656Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym2 x16989586621679554935 x26989586621679554936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym2 x16989586621679554972 x26989586621679554973 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679555031Scrutinee_6989586621679554839Sym3 x6989586621679555030 x06989586621679555025 y6989586621679555026 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765563Scrutinee_6989586621679762517Sym4 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 eq6989586621679765554 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136656Sym1 a6989586621679136661 :: TyFun (a, b, c, d, e, f, g) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym1 s6989586621680120092 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym3 x16989586621679554935 x26989586621679554936 y6989586621679554937 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym3 x16989586621679554972 x26989586621679554973 y6989586621679554974 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679555031Scrutinee_6989586621679554839Sym4 x6989586621679555030 x06989586621679555025 y6989586621679555026 arg_69895866216795548356989586621679555021 :: TyFun k4 Bool -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym2 s6989586621680120092 c6989586621680120079 :: TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym4 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym4 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym3 s6989586621680120092 c6989586621680120079 s6989586621680120080 :: TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554940Scrutinee_6989586621679554863Sym5 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 arg_69895866216795548596989586621679554931 :: TyFun k5 Bool -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679554977Scrutinee_6989586621679554853Sym5 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 arg_69895866216795548496989586621679554968 :: TyFun k5 Bool -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym4 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 :: TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym5 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 :: TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym6 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 :: TyFun k7 (TyFun Char Bool -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680120093Sym7 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 arg_69895866216801199676989586621680120068 :: TyFun Char Bool -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
type DemoteRep Bool
Instance details Defined in GHC.Generics type DemoteRep Bool = Bool
type Rep Bool	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep Bool = D1 ('MetaData "Bool" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "False" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "True" 'PrefixI 'False) (U1 :: Type -> Type))
data Sing (a :: Bool)
Instance details Defined in GHC.Generics data Sing (a :: Bool) where STrue :: Sing 'True SFalse :: Sing 'False
type AsRPC Bool
Instance details Defined in Morley.AsRPC type AsRPC Bool = Bool
type TypeDocFieldDescriptions Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
type Demote Bool
Instance details Defined in Data.Singletons.Base.Instances type Demote Bool = Bool
type Sing
Instance details Defined in Data.Singletons.Base.Instances type Sing = SBool
type MaxBound
Instance details Defined in Data.Singletons.Base.Enum type MaxBound = MaxBound_6989586621679548439Sym0
type MinBound
Instance details Defined in Data.Singletons.Base.Enum type MinBound = MinBound_6989586621679548436Sym0
newtype Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
type UnaryArithResHs Not Bool Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Bool = Bool
type FromEnum (a :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type FromEnum (a :: Bool) = Apply FromEnum_6989586621679583893Sym0 a
type Pred (arg :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type Pred (arg :: Bool) = Apply (Pred_6989586621679555078Sym0 :: TyFun Bool Bool -> Type) arg
type Succ (arg :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type Succ (arg :: Bool) = Apply (Succ_6989586621679555065Sym0 :: TyFun Bool Bool -> Type) arg
type ToEnum a
Instance details Defined in Data.Singletons.Base.Enum type ToEnum a = Apply ToEnum_6989586621679583880Sym0 a
type Show_ (arg :: Bool)
Instance details Defined in Text.Show.Singletons type Show_ (arg :: Bool) = Apply (Show__6989586621680095117Sym0 :: TyFun Bool Symbol -> Type) arg
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
type (arg1 :: Bool) /= (arg2 :: Bool)
Instance details Defined in Data.Eq.Singletons type (arg1 :: Bool) /= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679133659Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (a1 :: Bool) == (a2 :: Bool)
Instance details Defined in Data.Eq.Singletons type (a1 :: Bool) == (a2 :: Bool) = Apply (Apply TFHelper_6989586621679136713Sym0 a1) a2
type (arg1 :: Bool) < (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Bool) < (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679173484Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) <= (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Bool) <= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679173500Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) > (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Bool) > (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679173516Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) >= (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Bool) >= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679173532Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Bool) (a2 :: Bool)
Instance details Defined in Data.Ord.Singletons type Compare (a1 :: Bool) (a2 :: Bool) = Apply (Apply Compare_6989586621679189701Sym0 a1) a2
type Max (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type Max (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Max_6989586621679173548Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Min (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Ord.Singletons type Min (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Min_6989586621679173564Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type EnumFromTo (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (EnumFromTo_6989586621679555088Sym0 :: TyFun Bool (Bool ~> [Bool]) -> Type) arg1) arg2
type ShowList (arg1 :: [Bool]) arg2
Instance details Defined in Text.Show.Singletons type ShowList (arg1 :: [Bool]) arg2 = Apply (Apply (ShowList_6989586621680095125Sym0 :: TyFun [Bool] (Symbol ~> Symbol) -> Type) arg1) arg2
type Apply GetAllSym0 (a6989586621679637196 :: All)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply GetAllSym0 (a6989586621679637196 :: All) = GetAll a6989586621679637196
type Apply GetAnySym0 (a6989586621679637212 :: Any)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply GetAnySym0 (a6989586621679637212 :: Any) = GetAny a6989586621679637212
type Apply ToEnum_6989586621679583880Sym0 (a6989586621679583884 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679583880Sym0 (a6989586621679583884 :: Natural) = ToEnum_6989586621679583880 a6989586621679583884
type Apply AllSym0 (a6989586621679637193 :: Bool)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply AllSym0 (a6989586621679637193 :: Bool) = 'All a6989586621679637193
type Apply All_Sym0 (a6989586621679748525 :: Bool)
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation type Apply All_Sym0 (a6989586621679748525 :: Bool) = All_ a6989586621679748525
type Apply AnySym0 (a6989586621679637209 :: Bool)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply AnySym0 (a6989586621679637209 :: Bool) = 'Any a6989586621679637209
type Apply Any_Sym0 (a6989586621679748519 :: Bool)
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation type Apply Any_Sym0 (a6989586621679748519 :: Bool) = Any_ a6989586621679748519
type Apply FromEnum_6989586621679583893Sym0 (a6989586621679583897 :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679583893Sym0 (a6989586621679583897 :: Bool) = FromEnum_6989586621679583893 a6989586621679583897
type Apply NotSym0 (a6989586621679129059 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply NotSym0 (a6989586621679129059 :: Bool) = Not a6989586621679129059
type Apply IsDecSym0 (a6989586621680120034 :: Char)
Instance details Defined in Text.Show.Singletons type Apply IsDecSym0 (a6989586621680120034 :: Char) = IsDec a6989586621680120034
type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) = Apply (Apply (Apply (EnumFromThenTo_6989586621679555100Sym0 :: TyFun Bool (Bool ~> (Bool ~> [Bool])) -> Type) arg1) arg2) arg3
type ShowsPrec a1 (a2 :: Bool) a3
Instance details Defined in Text.Show.Singletons type ShowsPrec a1 (a2 :: Bool) a3 = Apply (Apply (Apply ShowsPrec_6989586621680127564Sym0 a1) a2) a3
type Apply (TFHelper_6989586621679647443Sym1 a6989586621679647448 :: TyFun All Bool -> Type) (a6989586621679647449 :: All)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647443Sym1 a6989586621679647448 :: TyFun All Bool -> Type) (a6989586621679647449 :: All) = TFHelper_6989586621679647443 a6989586621679647448 a6989586621679647449
type Apply (TFHelper_6989586621679647460Sym1 a6989586621679647465 :: TyFun Any Bool -> Type) (a6989586621679647466 :: Any)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647460Sym1 a6989586621679647465 :: TyFun Any Bool -> Type) (a6989586621679647466 :: Any) = TFHelper_6989586621679647460 a6989586621679647465 a6989586621679647466
type Apply (TFHelper_6989586621679136333Sym1 a6989586621679136338 :: TyFun Void Bool -> Type) (a6989586621679136339 :: Void)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136333Sym1 a6989586621679136338 :: TyFun Void Bool -> Type) (a6989586621679136339 :: Void) = TFHelper_6989586621679136333 a6989586621679136338 a6989586621679136339
type Apply (TFHelper_6989586621679136722Sym1 a6989586621679136727 :: TyFun Ordering Bool -> Type) (a6989586621679136728 :: Ordering)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136722Sym1 a6989586621679136727 :: TyFun Ordering Bool -> Type) (a6989586621679136728 :: Ordering) = TFHelper_6989586621679136722 a6989586621679136727 a6989586621679136728
type Apply (TFHelper_6989586621679136731Sym1 a6989586621679136736 :: TyFun () Bool -> Type) (a6989586621679136737 :: ())
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136731Sym1 a6989586621679136736 :: TyFun () Bool -> Type) (a6989586621679136737 :: ()) = TFHelper_6989586621679136731 a6989586621679136736 a6989586621679136737
type Apply (Compare_6989586621679189701Sym1 a6989586621679189706 :: TyFun Bool Ordering -> Type) (a6989586621679189707 :: Bool)
Instance details Defined in Data.Ord.Singletons type Apply (Compare_6989586621679189701Sym1 a6989586621679189706 :: TyFun Bool Ordering -> Type) (a6989586621679189707 :: Bool) = Compare_6989586621679189701 a6989586621679189706 a6989586621679189707
type Apply ((&&@#@$$) a6989586621679128318 :: TyFun Bool Bool -> Type) (a6989586621679128319 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply ((&&@#@$$) a6989586621679128318 :: TyFun Bool Bool -> Type) (a6989586621679128319 :: Bool) = a6989586621679128318 && a6989586621679128319
type Apply ((\|\|@#@$$) a6989586621679128697 :: TyFun Bool Bool -> Type) (a6989586621679128698 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply ((\|\|@#@$$) a6989586621679128697 :: TyFun Bool Bool -> Type) (a6989586621679128698 :: Bool) = a6989586621679128697 \|\| a6989586621679128698
type Apply (TFHelper_6989586621679136713Sym1 a6989586621679136718 :: TyFun Bool Bool -> Type) (a6989586621679136719 :: Bool)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136713Sym1 a6989586621679136718 :: TyFun Bool Bool -> Type) (a6989586621679136719 :: Bool) = TFHelper_6989586621679136713 a6989586621679136718 a6989586621679136719
type Apply (Let6989586621680230554Scrutinee_6989586621680228699Sym0 :: TyFun k1 Bool -> Type) (n6989586621680230553 :: k1)
Instance details Defined in Data.Proxy.Singletons type Apply (Let6989586621680230554Scrutinee_6989586621680228699Sym0 :: TyFun k1 Bool -> Type) (n6989586621680230553 :: k1) = Let6989586621680230554Scrutinee_6989586621680228699 n6989586621680230553
type Apply ((/=@#@$$) a6989586621679133655 :: TyFun a Bool -> Type) (a6989586621679133656 :: a)
Instance details Defined in Data.Eq.Singletons type Apply ((/=@#@$$) a6989586621679133655 :: TyFun a Bool -> Type) (a6989586621679133656 :: a) = a6989586621679133655 /= a6989586621679133656
type Apply ((==@#@$$) a6989586621679133650 :: TyFun a Bool -> Type) (a6989586621679133651 :: a)
Instance details Defined in Data.Eq.Singletons type Apply ((==@#@$$) a6989586621679133650 :: TyFun a Bool -> Type) (a6989586621679133651 :: a) = a6989586621679133650 == a6989586621679133651
type Apply (TFHelper_6989586621679133659Sym1 a6989586621679133664 :: TyFun a Bool -> Type) (a6989586621679133665 :: a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679133659Sym1 a6989586621679133664 :: TyFun a Bool -> Type) (a6989586621679133665 :: a) = TFHelper_6989586621679133659 a6989586621679133664 a6989586621679133665
type Apply (TFHelper_6989586621679133670Sym1 a6989586621679133675 :: TyFun a Bool -> Type) (a6989586621679133676 :: a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679133670Sym1 a6989586621679133675 :: TyFun a Bool -> Type) (a6989586621679133676 :: a) = TFHelper_6989586621679133670 a6989586621679133675 a6989586621679133676
type Apply ((<=@#@$$) a6989586621679173439 :: TyFun a Bool -> Type) (a6989586621679173440 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((<=@#@$$) a6989586621679173439 :: TyFun a Bool -> Type) (a6989586621679173440 :: a) = a6989586621679173439 <= a6989586621679173440
type Apply ((<@#@$$) a6989586621679173434 :: TyFun a Bool -> Type) (a6989586621679173435 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((<@#@$$) a6989586621679173434 :: TyFun a Bool -> Type) (a6989586621679173435 :: a) = a6989586621679173434 < a6989586621679173435
type Apply ((>=@#@$$) a6989586621679173449 :: TyFun a Bool -> Type) (a6989586621679173450 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((>=@#@$$) a6989586621679173449 :: TyFun a Bool -> Type) (a6989586621679173450 :: a) = a6989586621679173449 >= a6989586621679173450
type Apply ((>@#@$$) a6989586621679173444 :: TyFun a Bool -> Type) (a6989586621679173445 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((>@#@$$) a6989586621679173444 :: TyFun a Bool -> Type) (a6989586621679173445 :: a) = a6989586621679173444 > a6989586621679173445
type Apply (TFHelper_6989586621679173484Sym1 a6989586621679173489 :: TyFun a Bool -> Type) (a6989586621679173490 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173484Sym1 a6989586621679173489 :: TyFun a Bool -> Type) (a6989586621679173490 :: a) = TFHelper_6989586621679173484 a6989586621679173489 a6989586621679173490
type Apply (TFHelper_6989586621679173500Sym1 a6989586621679173505 :: TyFun a Bool -> Type) (a6989586621679173506 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173500Sym1 a6989586621679173505 :: TyFun a Bool -> Type) (a6989586621679173506 :: a) = TFHelper_6989586621679173500 a6989586621679173505 a6989586621679173506
type Apply (TFHelper_6989586621679173516Sym1 a6989586621679173521 :: TyFun a Bool -> Type) (a6989586621679173522 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173516Sym1 a6989586621679173521 :: TyFun a Bool -> Type) (a6989586621679173522 :: a) = TFHelper_6989586621679173516 a6989586621679173521 a6989586621679173522
type Apply (TFHelper_6989586621679173532Sym1 a6989586621679173537 :: TyFun a Bool -> Type) (a6989586621679173538 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173532Sym1 a6989586621679173537 :: TyFun a Bool -> Type) (a6989586621679173538 :: a) = TFHelper_6989586621679173532 a6989586621679173537 a6989586621679173538
type Apply (DefaultEqSym1 a6989586621679135866 :: TyFun k Bool -> Type) (a6989586621679135867 :: k)
Instance details Defined in Data.Eq.Singletons type Apply (DefaultEqSym1 a6989586621679135866 :: TyFun k Bool -> Type) (a6989586621679135867 :: k) = DefaultEq a6989586621679135866 a6989586621679135867
type Apply ((<=?@#@$$) a6989586621679491383 :: TyFun k Bool -> Type) (a6989586621679491384 :: k)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Apply ((<=?@#@$$) a6989586621679491383 :: TyFun k Bool -> Type) (a6989586621679491384 :: k) = a6989586621679491383 <=? a6989586621679491384
type Apply (Let6989586621680251459Scrutinee_6989586621680251427Sym1 x6989586621680251454 :: TyFun k1 Bool -> Type) (y6989586621680251455 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251459Scrutinee_6989586621680251427Sym1 x6989586621680251454 :: TyFun k1 Bool -> Type) (y6989586621680251455 :: k1) = Let6989586621680251459Scrutinee_6989586621680251427 x6989586621680251454 y6989586621680251455
type Apply (Let6989586621680251483Scrutinee_6989586621680251429Sym1 x6989586621680251478 :: TyFun k1 Bool -> Type) (y6989586621680251479 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251483Scrutinee_6989586621680251429Sym1 x6989586621680251478 :: TyFun k1 Bool -> Type) (y6989586621680251479 :: k1) = Let6989586621680251483Scrutinee_6989586621680251429 x6989586621680251478 y6989586621680251479
type Apply (Let6989586621679173472Scrutinee_6989586621679171703Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type) (y6989586621679173471 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173472Scrutinee_6989586621679171703Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type) (y6989586621679173471 :: k1) = Let6989586621679173472Scrutinee_6989586621679171703 x6989586621679173470 y6989586621679173471
type Apply (Let6989586621679173476Scrutinee_6989586621679171705Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type) (y6989586621679173471 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173476Scrutinee_6989586621679171705Sym1 x6989586621679173470 :: TyFun k1 Bool -> Type) (y6989586621679173471 :: k1) = Let6989586621679173476Scrutinee_6989586621679171705 x6989586621679173470 y6989586621679173471
type Apply (Let6989586621679173557Scrutinee_6989586621679171715Sym1 x6989586621679173555 :: TyFun k1 Bool -> Type) (y6989586621679173556 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173557Scrutinee_6989586621679171715Sym1 x6989586621679173555 :: TyFun k1 Bool -> Type) (y6989586621679173556 :: k1) = Let6989586621679173557Scrutinee_6989586621679171715 x6989586621679173555 y6989586621679173556
type Apply (Let6989586621679173573Scrutinee_6989586621679171717Sym1 x6989586621679173571 :: TyFun k1 Bool -> Type) (y6989586621679173572 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173573Scrutinee_6989586621679171717Sym1 x6989586621679173571 :: TyFun k1 Bool -> Type) (y6989586621679173572 :: k1) = Let6989586621679173573Scrutinee_6989586621679171717 x6989586621679173571 y6989586621679173572
type Apply (Bool_Sym2 a6989586621679126615 a6989586621679126616 :: TyFun Bool a -> Type) (a6989586621679126617 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply (Bool_Sym2 a6989586621679126615 a6989586621679126616 :: TyFun Bool a -> Type) (a6989586621679126617 :: Bool) = Bool_ a6989586621679126615 a6989586621679126616 a6989586621679126617
type Apply (Let6989586621679765611Scrutinee_6989586621679762511Sym1 n6989586621679765609 :: TyFun k Bool -> Type) (x6989586621679765610 :: k)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765611Scrutinee_6989586621679762511Sym1 n6989586621679765609 :: TyFun k Bool -> Type) (x6989586621679765610 :: k) = Let6989586621679765611Scrutinee_6989586621679762511 n6989586621679765609 x6989586621679765610
type Apply (Lambda_6989586621680261149Sym2 a_69895866216802611436989586621680261148 arg_69895866216802605496989586621680261151 :: TyFun k3 Bool -> Type) (arg_69895866216802605516989586621680261152 :: k3)
Instance details Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680261149Sym2 a_69895866216802611436989586621680261148 arg_69895866216802605496989586621680261151 :: TyFun k3 Bool -> Type) (arg_69895866216802605516989586621680261152 :: k3) = Lambda_6989586621680261149 a_69895866216802611436989586621680261148 arg_69895866216802605496989586621680261151 arg_69895866216802605516989586621680261152
type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym2 x6989586621679765589 xs6989586621679765590 :: TyFun k3 Bool -> Type) (n6989586621679765591 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym2 x6989586621679765589 xs6989586621679765590 :: TyFun k3 Bool -> Type) (n6989586621679765591 :: k3) = Let6989586621679765592Scrutinee_6989586621679762513 x6989586621679765589 xs6989586621679765590 n6989586621679765591
type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym2 n6989586621679765751 x6989586621679765752 :: TyFun k3 Bool -> Type) (xs6989586621679765753 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym2 n6989586621679765751 x6989586621679765752 :: TyFun k3 Bool -> Type) (xs6989586621679765753 :: k3) = Let6989586621679765754Scrutinee_6989586621679762497 n6989586621679765751 x6989586621679765752 xs6989586621679765753
type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym2 n6989586621679765764 x6989586621679765765 :: TyFun k3 Bool -> Type) (xs6989586621679765766 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym2 n6989586621679765764 x6989586621679765765 :: TyFun k3 Bool -> Type) (xs6989586621679765766 :: k3) = Let6989586621679765767Scrutinee_6989586621679762495 n6989586621679765764 x6989586621679765765 xs6989586621679765766
type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym3 x6989586621679765853 xs6989586621679765854 p6989586621679765849 :: TyFun k Bool -> Type) (a_69895866216797658426989586621679765850 :: k)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym3 x6989586621679765853 xs6989586621679765854 p6989586621679765849 :: TyFun k Bool -> Type) (a_69895866216797658426989586621679765850 :: k) = Let6989586621679765855Scrutinee_6989586621679762489 x6989586621679765853 xs6989586621679765854 p6989586621679765849 a_69895866216797658426989586621679765850
type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym3 x6989586621679765576 xs6989586621679765577 ls6989586621679765578 :: TyFun k3 Bool -> Type) (l6989586621679765571 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym3 x6989586621679765576 xs6989586621679765577 ls6989586621679765578 :: TyFun k3 Bool -> Type) (l6989586621679765571 :: k3) = Let6989586621679765579Scrutinee_6989586621679762515 x6989586621679765576 xs6989586621679765577 ls6989586621679765578 l6989586621679765571
type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym3 key6989586621679765673 x6989586621679765674 y6989586621679765675 :: TyFun k3 Bool -> Type) (xys6989586621679765676 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym3 key6989586621679765673 x6989586621679765674 y6989586621679765675 :: TyFun k3 Bool -> Type) (xys6989586621679765676 :: k3) = Let6989586621679765677Scrutinee_6989586621679762507 key6989586621679765673 x6989586621679765674 y6989586621679765675 xys6989586621679765676
type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym4 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 eq6989586621679765554 :: TyFun k3 Bool -> Type) (l6989586621679765555 :: k3)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym4 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 eq6989586621679765554 :: TyFun k3 Bool -> Type) (l6989586621679765555 :: k3) = Let6989586621679765563Scrutinee_6989586621679762517 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 eq6989586621679765554 l6989586621679765555
type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym4 x6989586621679555030 x06989586621679555025 y6989586621679555026 arg_69895866216795548356989586621679555021 :: TyFun k4 Bool -> Type) (arg_69895866216795548376989586621679555022 :: k4)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym4 x6989586621679555030 x06989586621679555025 y6989586621679555026 arg_69895866216795548356989586621679555021 :: TyFun k4 Bool -> Type) (arg_69895866216795548376989586621679555022 :: k4) = Let6989586621679555031Scrutinee_6989586621679554839 x6989586621679555030 x06989586621679555025 y6989586621679555026 arg_69895866216795548356989586621679555021 arg_69895866216795548376989586621679555022
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym5 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 arg_69895866216795548596989586621679554931 :: TyFun k5 Bool -> Type) (arg_69895866216795548616989586621679554932 :: k5)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym5 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 arg_69895866216795548596989586621679554931 :: TyFun k5 Bool -> Type) (arg_69895866216795548616989586621679554932 :: k5) = Let6989586621679554940Scrutinee_6989586621679554863 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 arg_69895866216795548596989586621679554931 arg_69895866216795548616989586621679554932
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym5 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 arg_69895866216795548496989586621679554968 :: TyFun k5 Bool -> Type) (arg_69895866216795548516989586621679554969 :: k5)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym5 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 arg_69895866216795548496989586621679554968 :: TyFun k5 Bool -> Type) (arg_69895866216795548516989586621679554969 :: k5) = Let6989586621679554977Scrutinee_6989586621679554853 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 arg_69895866216795548496989586621679554968 arg_69895866216795548516989586621679554969
type Apply (Lambda_6989586621680120093Sym7 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 arg_69895866216801199676989586621680120068 :: TyFun Char Bool -> Type) (lhs_69895866216801199696989586621680120095 :: Char)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym7 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 arg_69895866216801199676989586621680120068 :: TyFun Char Bool -> Type) (lhs_69895866216801199696989586621680120095 :: Char) = Lambda_6989586621680120093 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 arg_69895866216801199676989586621680120068 lhs_69895866216801199696989586621680120095
type Eval (Not 'False)
Instance details Defined in Fcf.Data.Bool type Eval (Not 'False) = 'True
type Eval (Not 'True)
Instance details Defined in Fcf.Data.Bool type Eval (Not 'True) = 'False
type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621679301224 :: Bool)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621679301224 :: Bool) = Guard a6989586621679301224 :: f ()
type Eval (And lst :: Bool -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (And lst :: Bool -> Type) = Eval (Foldr (&&) 'True lst)
type Eval (Or lst :: Bool -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Or lst :: Bool -> Type) = Eval (Foldr (\|\|) 'False lst)
type Eval ('False && b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval ('False && b :: Bool -> Type) = 'False
type Eval ('True && b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval ('True && b :: Bool -> Type) = b
type Eval (a && 'False :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && 'False :: Bool -> Type) = 'False
type Eval (a && 'True :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && 'True :: Bool -> Type) = a
type Eval ('False \|\| b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval ('False \|\| b :: Bool -> Type) = b
type Eval ('True \|\| b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval ('True \|\| b :: Bool -> Type) = 'True
type Eval (a \|\| 'False :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a \|\| 'False :: Bool -> Type) = a
type Eval (a \|\| 'True :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a \|\| 'True :: Bool -> Type) = 'True
type Eval (IsJust ('Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsJust ('Just _a) :: Bool -> Type) = 'True
type Eval (IsJust ('Nothing :: Maybe a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsJust ('Nothing :: Maybe a) :: Bool -> Type) = 'False
type Eval (IsNothing ('Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsNothing ('Just _a) :: Bool -> Type) = 'False
type Eval (IsNothing ('Nothing :: Maybe a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsNothing ('Nothing :: Maybe a) :: Bool -> Type) = 'True
type Eval (Null ('[] :: [a]) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null ('[] :: [a]) :: Bool -> Type) = 'True
type Eval (Null (a2 ': as) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null (a2 ': as) :: Bool -> Type) = 'False
type Eval (a < b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a < b :: Bool -> Type) = Eval (Not =<< (a >= b))
type Eval (a <= b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a <= b :: Bool -> Type) = a <=? b
type Eval (a > b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a > b :: Bool -> Type) = Eval (Not =<< (a <= b))
type Eval (a >= b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a >= b :: Bool -> Type) = b <=? a
type Apply TFHelper_6989586621679647443Sym0 (a6989586621679647448 :: All)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply TFHelper_6989586621679647443Sym0 (a6989586621679647448 :: All) = TFHelper_6989586621679647443Sym1 a6989586621679647448
type Apply TFHelper_6989586621679647460Sym0 (a6989586621679647465 :: Any)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply TFHelper_6989586621679647460Sym0 (a6989586621679647465 :: Any) = TFHelper_6989586621679647460Sym1 a6989586621679647465
type Apply TFHelper_6989586621679136333Sym0 (a6989586621679136338 :: Void)
Instance details Defined in Data.Eq.Singletons type Apply TFHelper_6989586621679136333Sym0 (a6989586621679136338 :: Void) = TFHelper_6989586621679136333Sym1 a6989586621679136338
type Apply TFHelper_6989586621679136722Sym0 (a6989586621679136727 :: Ordering)
Instance details Defined in Data.Eq.Singletons type Apply TFHelper_6989586621679136722Sym0 (a6989586621679136727 :: Ordering) = TFHelper_6989586621679136722Sym1 a6989586621679136727
type Apply ShowsPrec_6989586621680127564Sym0 (a6989586621680127574 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsPrec_6989586621680127564Sym0 (a6989586621680127574 :: Natural) = ShowsPrec_6989586621680127564Sym1 a6989586621680127574
type Apply TFHelper_6989586621679136731Sym0 (a6989586621679136736 :: ())
Instance details Defined in Data.Eq.Singletons type Apply TFHelper_6989586621679136731Sym0 (a6989586621679136736 :: ()) = TFHelper_6989586621679136731Sym1 a6989586621679136736
type Apply ShowParenSym0 (a6989586621680095030 :: Bool)
Instance details Defined in Text.Show.Singletons type Apply ShowParenSym0 (a6989586621680095030 :: Bool) = ShowParenSym1 a6989586621680095030
type Apply Compare_6989586621679189701Sym0 (a6989586621679189706 :: Bool)
Instance details Defined in Data.Ord.Singletons type Apply Compare_6989586621679189701Sym0 (a6989586621679189706 :: Bool) = Compare_6989586621679189701Sym1 a6989586621679189706
type Apply (&&@#@$) (a6989586621679128318 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply (&&@#@$) (a6989586621679128318 :: Bool) = (&&@#@$$) a6989586621679128318
type Apply (\|\|@#@$) (a6989586621679128697 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply (\|\|@#@$) (a6989586621679128697 :: Bool) = (\|\|@#@$$) a6989586621679128697
type Apply TFHelper_6989586621679136713Sym0 (a6989586621679136718 :: Bool)
Instance details Defined in Data.Eq.Singletons type Apply TFHelper_6989586621679136713Sym0 (a6989586621679136718 :: Bool) = TFHelper_6989586621679136713Sym1 a6989586621679136718
type Apply (ShowsPrec_6989586621680127564Sym1 a6989586621680127574 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680127575 :: Bool)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127564Sym1 a6989586621680127574 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680127575 :: Bool) = ShowsPrec_6989586621680127564Sym2 a6989586621680127574 a6989586621680127575
type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680993161 :: Bool)
Instance details Defined in Control.Monad.Singletons type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680993161 :: Bool) = UnlessSym1 a6989586621680993161 :: TyFun (f ()) (f ()) -> Type
type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621679301368 :: Bool)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621679301368 :: Bool) = WhenSym1 a6989586621679301368 :: TyFun (f ()) (f ()) -> Type
type Apply (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) (a6989586621679129293 :: Bool)
Instance details Defined in Data.Bool.Singletons type Apply (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) (a6989586621679129293 :: Bool) = IfSym1 a6989586621679129293 :: TyFun k (k ~> k) -> Type
type Apply (Elem_6989586621680460300Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621680460305 :: a)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (Elem_6989586621680460300Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621680460305 :: a) = Elem_6989586621680460300Sym1 a6989586621680460305
type Apply (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680261668 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680261668 :: a) = Elem_6989586621680261663Sym1 a6989586621680261668
type Apply (Elem_6989586621680261695Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680261704 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261695Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680261704 :: a) = Elem_6989586621680261695Sym1 a6989586621680261704
type Apply (Elem_6989586621680262045Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680262054 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680262045Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680262054 :: a) = Elem_6989586621680262045Sym1 a6989586621680262054
type Apply (Elem_6989586621680261870Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680261879 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261870Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680261879 :: a) = Elem_6989586621680261870Sym1 a6989586621680261879
type Apply (Elem_6989586621680261287Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680261296 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261287Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680261296 :: a) = Elem_6989586621680261287Sym1 a6989586621680261296
type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679766314 :: a)
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679766314 :: a) = ElemSym1 a6989586621679766314
type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679766306 :: a)
Instance details Defined in Data.List.Singletons.Internal type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679766306 :: a) = NotElemSym1 a6989586621679766306
type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680046083 :: a)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680046083 :: a) = ListelemSym1 a6989586621680046083
type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679126615 :: a)
Instance details Defined in Data.Bool.Singletons type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679126615 :: a) = Bool_Sym1 a6989586621679126615
type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679133655 :: a)
Instance details Defined in Data.Eq.Singletons type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679133655 :: a) = (/=@#@$$) a6989586621679133655
type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679133650 :: a)
Instance details Defined in Data.Eq.Singletons type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679133650 :: a) = (==@#@$$) a6989586621679133650
type Apply (TFHelper_6989586621679133659Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679133664 :: a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679133659Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679133664 :: a) = TFHelper_6989586621679133659Sym1 a6989586621679133664
type Apply (TFHelper_6989586621679133670Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679133675 :: a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679133670Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679133675 :: a) = TFHelper_6989586621679133670Sym1 a6989586621679133675
type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173439 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173439 :: a) = (<=@#@$$) a6989586621679173439
type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173434 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173434 :: a) = (<@#@$$) a6989586621679173434
type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173449 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173449 :: a) = (>=@#@$$) a6989586621679173449
type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173444 :: a)
Instance details Defined in Data.Ord.Singletons type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679173444 :: a) = (>@#@$$) a6989586621679173444
type Apply (TFHelper_6989586621679173484Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173489 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173484Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173489 :: a) = TFHelper_6989586621679173484Sym1 a6989586621679173489
type Apply (TFHelper_6989586621679173500Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173505 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173500Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173505 :: a) = TFHelper_6989586621679173500Sym1 a6989586621679173505
type Apply (TFHelper_6989586621679173516Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173521 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173516Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173521 :: a) = TFHelper_6989586621679173516Sym1 a6989586621679173521
type Apply (TFHelper_6989586621679173532Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173537 :: a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679173532Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679173537 :: a) = TFHelper_6989586621679173532Sym1 a6989586621679173537
type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679135866 :: k)
Instance details Defined in Data.Eq.Singletons type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679135866 :: k) = DefaultEqSym1 a6989586621679135866
type Apply ((<=?@#@$) :: TyFun k (k ~> Bool) -> Type) (a6989586621679491383 :: k)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Apply ((<=?@#@$) :: TyFun k (k ~> Bool) -> Type) (a6989586621679491383 :: k) = (<=?@#@$$) a6989586621679491383
type Apply (Let6989586621680251459Scrutinee_6989586621680251427Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680251454 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251459Scrutinee_6989586621680251427Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680251454 :: k1) = Let6989586621680251459Scrutinee_6989586621680251427Sym1 x6989586621680251454
type Apply (Let6989586621680251483Scrutinee_6989586621680251429Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680251478 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251483Scrutinee_6989586621680251429Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680251478 :: k1) = Let6989586621680251483Scrutinee_6989586621680251429Sym1 x6989586621680251478
type Apply (Let6989586621679173472Scrutinee_6989586621679171703Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173470 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173472Scrutinee_6989586621679171703Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173470 :: k1) = Let6989586621679173472Scrutinee_6989586621679171703Sym1 x6989586621679173470
type Apply (Let6989586621679173476Scrutinee_6989586621679171705Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173470 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173476Scrutinee_6989586621679171705Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173470 :: k1) = Let6989586621679173476Scrutinee_6989586621679171705Sym1 x6989586621679173470
type Apply (Let6989586621679173557Scrutinee_6989586621679171715Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173555 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173557Scrutinee_6989586621679171715Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173555 :: k1) = Let6989586621679173557Scrutinee_6989586621679171715Sym1 x6989586621679173555
type Apply (Let6989586621679173573Scrutinee_6989586621679171717Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173571 :: k1)
Instance details Defined in Data.Ord.Singletons type Apply (Let6989586621679173573Scrutinee_6989586621679171717Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679173571 :: k1) = Let6989586621679173573Scrutinee_6989586621679171717Sym1 x6989586621679173571
type Apply (Bool_Sym1 a6989586621679126615 :: TyFun a (Bool ~> a) -> Type) (a6989586621679126616 :: a)
Instance details Defined in Data.Bool.Singletons type Apply (Bool_Sym1 a6989586621679126615 :: TyFun a (Bool ~> a) -> Type) (a6989586621679126616 :: a) = Bool_Sym2 a6989586621679126615 a6989586621679126616
type Apply (Elem_bySym1 a6989586621679765542 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679765543 :: a)
Instance details Defined in Data.List.Singletons.Internal type Apply (Elem_bySym1 a6989586621679765542 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679765543 :: a) = Elem_bySym2 a6989586621679765542 a6989586621679765543
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680260977 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680260977 :: a) = ElemSym1 a6989586621680260977 :: TyFun (t a) Bool -> Type
type Apply (Elem_6989586621680261177Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680261186 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261177Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680261186 :: a) = Elem_6989586621680261177Sym1 a6989586621680261186 :: TyFun (t a) Bool -> Type
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680260724 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680260724 :: a) = NotElemSym1 a6989586621680260724 :: TyFun (t a) Bool -> Type
type Apply (Let6989586621679765611Scrutinee_6989586621679762511Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621679765609 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765611Scrutinee_6989586621679762511Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621679765609 :: k1) = Let6989586621679765611Scrutinee_6989586621679762511Sym1 n6989586621679765609 :: TyFun k Bool -> Type
type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679765853 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679765853 :: k1) = Let6989586621679765855Scrutinee_6989586621679762489Sym1 x6989586621679765853 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679765673 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679765673 :: k1) = Let6989586621679765677Scrutinee_6989586621679762507Sym1 key6989586621679765673 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621679765560 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621679765560 :: k1) = Let6989586621679765563Scrutinee_6989586621679762517Sym1 y6989586621679765560 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679765576 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679765576 :: k1) = Let6989586621679765579Scrutinee_6989586621679762515Sym1 x6989586621679765576 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680993301Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621680993300 :: k1)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993301Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621680993300 :: k1) = Lambda_6989586621680993301Sym1 x6989586621680993300 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680261149Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216802611436989586621680261148 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680261149Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216802611436989586621680261148 :: k1) = Lambda_6989586621680261149Sym1 a_69895866216802611436989586621680261148 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679765589 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679765589 :: k1) = Let6989586621679765592Scrutinee_6989586621679762513Sym1 x6989586621679765589 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679765751 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679765751 :: k1) = Let6989586621679765754Scrutinee_6989586621679762497Sym1 n6989586621679765751 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679765764 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679765764 :: k1) = Let6989586621679765767Scrutinee_6989586621679762495Sym1 n6989586621679765764 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679555030 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679555030 :: k1) = Let6989586621679555031Scrutinee_6989586621679554839Sym1 x6989586621679555030 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym1 key6989586621679765673 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679765674 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym1 key6989586621679765673 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679765674 :: k1) = Let6989586621679765677Scrutinee_6989586621679762507Sym2 key6989586621679765673 x6989586621679765674 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym1 y6989586621679765560 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621679765561 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym1 y6989586621679765560 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621679765561 :: k2) = Let6989586621679765563Scrutinee_6989586621679762517Sym2 y6989586621679765560 ys6989586621679765561 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym1 x6989586621679765576 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679765577 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym1 x6989586621679765576 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679765577 :: k2) = Let6989586621679765579Scrutinee_6989586621679762515Sym2 x6989586621679765576 xs6989586621679765577 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type
type Apply (Lambda_6989586621680993301Sym1 x6989586621680993300 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621680993296 :: k2)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993301Sym1 x6989586621680993300 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621680993296 :: k2) = Lambda_6989586621680993301Sym2 x6989586621680993300 p6989586621680993296 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type
type Apply (Lambda_6989586621680261149Sym1 a_69895866216802611436989586621680261148 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216802605496989586621680261151 :: k2)
Instance details Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680261149Sym1 a_69895866216802611436989586621680261148 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216802605496989586621680261151 :: k2) = Lambda_6989586621680261149Sym2 a_69895866216802611436989586621680261148 arg_69895866216802605496989586621680261151 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym1 x6989586621679765589 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621679765590 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765592Scrutinee_6989586621679762513Sym1 x6989586621679765589 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621679765590 :: k2) = Let6989586621679765592Scrutinee_6989586621679762513Sym2 x6989586621679765589 xs6989586621679765590 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym1 n6989586621679765751 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679765752 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765754Scrutinee_6989586621679762497Sym1 n6989586621679765751 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679765752 :: k2) = Let6989586621679765754Scrutinee_6989586621679762497Sym2 n6989586621679765751 x6989586621679765752 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym1 n6989586621679765764 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679765765 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765767Scrutinee_6989586621679762495Sym1 n6989586621679765764 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679765765 :: k2) = Let6989586621679765767Scrutinee_6989586621679762495Sym2 n6989586621679765764 x6989586621679765765 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679554935 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679554935 :: k1) = Let6989586621679554940Scrutinee_6989586621679554863Sym1 x16989586621679554935 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679554972 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679554972 :: k1) = Let6989586621679554977Scrutinee_6989586621679554853Sym1 x16989586621679554972 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym1 x6989586621679555030 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679555025 :: k2)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym1 x6989586621679555030 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679555025 :: k2) = Let6989586621679555031Scrutinee_6989586621679554839Sym2 x6989586621679555030 x06989586621679555025 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym2 key6989586621679765673 x6989586621679765674 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679765675 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765677Scrutinee_6989586621679762507Sym2 key6989586621679765673 x6989586621679765674 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679765675 :: k2) = Let6989586621679765677Scrutinee_6989586621679762507Sym3 key6989586621679765673 x6989586621679765674 y6989586621679765675 :: TyFun k3 Bool -> Type
type Apply (Lambda_6989586621680993301Sym2 x6989586621680993300 p6989586621680993296 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216809932896989586621680993297 :: k3)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993301Sym2 x6989586621680993300 p6989586621680993296 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216809932896989586621680993297 :: k3) = Lambda_6989586621680993301Sym3 x6989586621680993300 p6989586621680993296 a_69895866216809932896989586621680993297
type Apply (Lambda_6989586621680993301Sym3 x6989586621680993300 p6989586621680993296 a_69895866216809932896989586621680993297 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621680993303 :: Bool)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993301Sym3 x6989586621680993300 p6989586621680993296 a_69895866216809932896989586621680993297 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621680993303 :: Bool) = Lambda_6989586621680993301 x6989586621680993300 p6989586621680993296 a_69895866216809932896989586621680993297 flg6989586621680993303
type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym2 x6989586621679555030 x06989586621679555025 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679555026 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym2 x6989586621679555030 x06989586621679555025 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679555026 :: k1) = Let6989586621679555031Scrutinee_6989586621679554839Sym3 x6989586621679555030 x06989586621679555025 y6989586621679555026 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym1 x16989586621679554935 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679554936 :: k2)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym1 x16989586621679554935 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679554936 :: k2) = Let6989586621679554940Scrutinee_6989586621679554863Sym2 x16989586621679554935 x26989586621679554936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym1 x16989586621679554972 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679554973 :: k2)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym1 x16989586621679554972 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679554973 :: k2) = Let6989586621679554977Scrutinee_6989586621679554853Sym2 x16989586621679554972 x26989586621679554973 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680120093Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (s6989586621680120092 :: k1)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (s6989586621680120092 :: k1) = Lambda_6989586621680120093Sym1 s6989586621680120092 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym2 x16989586621679554935 x26989586621679554936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679554937 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym2 x16989586621679554935 x26989586621679554936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679554937 :: k1) = Let6989586621679554940Scrutinee_6989586621679554863Sym3 x16989586621679554935 x26989586621679554936 y6989586621679554937 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym2 x16989586621679554972 x26989586621679554973 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679554974 :: k1)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym2 x16989586621679554972 x26989586621679554973 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679554974 :: k1) = Let6989586621679554977Scrutinee_6989586621679554853Sym3 x16989586621679554972 x26989586621679554973 y6989586621679554974 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym3 x6989586621679555030 x06989586621679555025 y6989586621679555026 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216795548356989586621679555021 :: k3)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679555031Scrutinee_6989586621679554839Sym3 x6989586621679555030 x06989586621679555025 y6989586621679555026 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216795548356989586621679555021 :: k3) = Let6989586621679555031Scrutinee_6989586621679554839Sym4 x6989586621679555030 x06989586621679555025 y6989586621679555026 arg_69895866216795548356989586621679555021 :: TyFun k4 Bool -> Type
type Apply (Lambda_6989586621680120093Sym1 s6989586621680120092 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (c6989586621680120079 :: k2)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym1 s6989586621680120092 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (c6989586621680120079 :: k2) = Lambda_6989586621680120093Sym2 s6989586621680120092 c6989586621680120079 :: TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym3 x16989586621679554935 x26989586621679554936 y6989586621679554937 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795548576989586621679554930 :: k3)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym3 x16989586621679554935 x26989586621679554936 y6989586621679554937 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795548576989586621679554930 :: k3) = Let6989586621679554940Scrutinee_6989586621679554863Sym4 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym3 x16989586621679554972 x26989586621679554973 y6989586621679554974 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795548476989586621679554967 :: k3)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym3 x16989586621679554972 x26989586621679554973 y6989586621679554974 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795548476989586621679554967 :: k3) = Let6989586621679554977Scrutinee_6989586621679554853Sym4 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Lambda_6989586621680120093Sym2 s6989586621680120092 c6989586621680120079 :: TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (s6989586621680120080 :: k3)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym2 s6989586621680120092 c6989586621680120079 :: TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (s6989586621680120080 :: k3) = Lambda_6989586621680120093Sym3 s6989586621680120092 c6989586621680120079 s6989586621680120080 :: TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym4 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795548596989586621679554931 :: k4)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554940Scrutinee_6989586621679554863Sym4 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795548596989586621679554931 :: k4) = Let6989586621679554940Scrutinee_6989586621679554863Sym5 x16989586621679554935 x26989586621679554936 y6989586621679554937 arg_69895866216795548576989586621679554930 arg_69895866216795548596989586621679554931 :: TyFun k5 Bool -> Type
type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym4 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795548496989586621679554968 :: k4)
Instance details Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679554977Scrutinee_6989586621679554853Sym4 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795548496989586621679554968 :: k4) = Let6989586621679554977Scrutinee_6989586621679554853Sym5 x16989586621679554972 x26989586621679554973 y6989586621679554974 arg_69895866216795548476989586621679554967 arg_69895866216795548496989586621679554968 :: TyFun k5 Bool -> Type
type Apply (Lambda_6989586621680120093Sym3 s6989586621680120092 c6989586621680120079 s6989586621680120080 :: TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) (c6989586621680120071 :: k4)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym3 s6989586621680120092 c6989586621680120079 s6989586621680120080 :: TyFun k4 (TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) -> Type) (c6989586621680120071 :: k4) = Lambda_6989586621680120093Sym4 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 :: TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680120093Sym4 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 :: TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) (s6989586621680120072 :: k5)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym4 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 :: TyFun k5 (TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) -> Type) (s6989586621680120072 :: k5) = Lambda_6989586621680120093Sym5 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 :: TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680120093Sym5 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 :: TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) (arg_69895866216801199656989586621680120067 :: k6)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym5 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 :: TyFun k6 (TyFun k7 (TyFun Char Bool -> Type) -> Type) -> Type) (arg_69895866216801199656989586621680120067 :: k6) = Lambda_6989586621680120093Sym6 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 :: TyFun k7 (TyFun Char Bool -> Type) -> Type
type Apply (Lambda_6989586621680120093Sym6 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 :: TyFun k7 (TyFun Char Bool -> Type) -> Type) (arg_69895866216801199676989586621680120068 :: k7)
Instance details Defined in Text.Show.Singletons type Apply (Lambda_6989586621680120093Sym6 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 :: TyFun k7 (TyFun Char Bool -> Type) -> Type) (arg_69895866216801199676989586621680120068 :: k7) = Lambda_6989586621680120093Sym7 s6989586621680120092 c6989586621680120079 s6989586621680120080 c6989586621680120071 s6989586621680120072 arg_69895866216801199656989586621680120067 arg_69895866216801199676989586621680120068
type Eval (IsLeft ('Left _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsLeft ('Left _a :: Either a b) :: Bool -> Type) = 'True
type Eval (IsLeft ('Right _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsLeft ('Right _a :: Either a b) :: Bool -> Type) = 'False
type Eval (IsRight ('Left _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsRight ('Left _a :: Either a b) :: Bool -> Type) = 'False
type Eval (IsRight ('Right _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsRight ('Right _a :: Either a b) :: Bool -> Type) = 'True
type Eval (Elem a2 as :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Elem a2 as :: Bool -> Type) = Eval ((IsJust :: Maybe Nat -> Bool -> Type) =<< FindIndex (TyEq a2 :: a1 -> Bool -> Type) as)
type Eval (IsInfixOf xs ys :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (IsInfixOf xs ys :: Bool -> Type) = Eval ((Any (IsPrefixOf xs) :: [[a]] -> Bool -> Type) =<< Tails ys)
type Eval (IsPrefixOf xs ys :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (IsPrefixOf xs ys :: Bool -> Type) = IsPrefixOf_ xs ys
type Eval (IsSuffixOf xs ys :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (IsSuffixOf xs ys :: Bool -> Type) = Eval (IsPrefixOf ((Reverse :: [a] -> [a] -> Type) @@ xs) ((Reverse :: [a] -> [a] -> Type) @@ ys))
type Eval (All p lst :: Bool -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (All p lst :: Bool -> Type) = Eval (Foldr (Bicomap p (Pure :: Bool -> Bool -> Type) (&&)) 'True lst)
type Eval (Any p lst :: Bool -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Any p lst :: Bool -> Type) = Eval (Foldr (Bicomap p (Pure :: Bool -> Bool -> Type) (\|\|)) 'False lst)
type Eval (TyEq a b :: Bool -> Type)
Instance details Defined in Fcf.Utils type Eval (TyEq a b :: Bool -> Type) = TyEqImpl a b
type Eval (TyEqSing a b :: Bool -> Type)
Instance details Defined in Morley.Util.Fcf type Eval (TyEqSing a b :: Bool -> Type) = DefaultEq a b
type Apply AndSym0 (a6989586621679766551 :: [Bool])
Instance details Defined in Data.List.Singletons.Internal type Apply AndSym0 (a6989586621679766551 :: [Bool]) = And a6989586621679766551
type Apply OrSym0 (a6989586621679766546 :: [Bool])
Instance details Defined in Data.List.Singletons.Internal type Apply OrSym0 (a6989586621679766546 :: [Bool]) = Or a6989586621679766546
type Apply (Null_6989586621680460416Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680460420 :: Identity a)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (Null_6989586621680460416Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680460420 :: Identity a) = Null_6989586621680460416 a6989586621680460420
type Apply (Null_6989586621680261827Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680261831 :: Dual a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261827Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680261831 :: Dual a) = Null_6989586621680261827 a6989586621680261831
type Apply (Null_6989586621680262177Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680262181 :: Product a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680262177Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680262181 :: Product a) = Null_6989586621680262177 a6989586621680262181
type Apply (Null_6989586621680262002Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680262006 :: Sum a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680262002Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680262006 :: Sum a) = Null_6989586621680262002 a6989586621680262006
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524081 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524081 :: Maybe a) = IsJust a6989586621679524081
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524078 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524078 :: Maybe a) = IsNothing a6989586621679524078
type Apply (Null_6989586621680261421Sym0 :: TyFun [a] Bool -> Type) (a6989586621680261427 :: [a])
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261421Sym0 :: TyFun [a] Bool -> Type) (a6989586621680261427 :: [a]) = Null_6989586621680261421 a6989586621680261427
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621679766724 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621679766724 :: [a]) = Null a6989586621679766724
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680045992 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680045992 :: [a]) = Listnull a6989586621680045992
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680260796 :: t Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680260796 :: t Bool) = And a6989586621680260796
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680260790 :: t Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680260790 :: t Bool) = Or a6989586621680260790
type Apply (TFHelper_6989586621679136700Sym1 a6989586621679136705 :: TyFun (Identity a) Bool -> Type) (a6989586621679136706 :: Identity a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136700Sym1 a6989586621679136705 :: TyFun (Identity a) Bool -> Type) (a6989586621679136706 :: Identity a) = TFHelper_6989586621679136700 a6989586621679136705 a6989586621679136706
type Apply (Elem_6989586621680460300Sym1 a6989586621680460305 :: TyFun (Identity a) Bool -> Type) (a6989586621680460306 :: Identity a)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (Elem_6989586621680460300Sym1 a6989586621680460305 :: TyFun (Identity a) Bool -> Type) (a6989586621680460306 :: Identity a) = Elem_6989586621680460300 a6989586621680460305 a6989586621680460306
type Apply (TFHelper_6989586621680176930Sym1 a6989586621680176935 :: TyFun (First a) Bool -> Type) (a6989586621680176936 :: First a)
Instance details Defined in Data.Monoid.Singletons type Apply (TFHelper_6989586621680176930Sym1 a6989586621680176935 :: TyFun (First a) Bool -> Type) (a6989586621680176936 :: First a) = TFHelper_6989586621680176930 a6989586621680176935 a6989586621680176936
type Apply (TFHelper_6989586621680176950Sym1 a6989586621680176955 :: TyFun (Last a) Bool -> Type) (a6989586621680176956 :: Last a)
Instance details Defined in Data.Monoid.Singletons type Apply (TFHelper_6989586621680176950Sym1 a6989586621680176955 :: TyFun (Last a) Bool -> Type) (a6989586621680176956 :: Last a) = TFHelper_6989586621680176950 a6989586621680176955 a6989586621680176956
type Apply (TFHelper_6989586621679187081Sym1 a6989586621679187086 :: TyFun (Down a) Bool -> Type) (a6989586621679187087 :: Down a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679187081Sym1 a6989586621679187086 :: TyFun (Down a) Bool -> Type) (a6989586621679187087 :: Down a) = TFHelper_6989586621679187081 a6989586621679187086 a6989586621679187087
type Apply (TFHelper_6989586621679647560Sym1 a6989586621679647565 :: TyFun (First a) Bool -> Type) (a6989586621679647566 :: First a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647560Sym1 a6989586621679647565 :: TyFun (First a) Bool -> Type) (a6989586621679647566 :: First a) = TFHelper_6989586621679647560 a6989586621679647565 a6989586621679647566
type Apply (TFHelper_6989586621679647580Sym1 a6989586621679647585 :: TyFun (Last a) Bool -> Type) (a6989586621679647586 :: Last a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647580Sym1 a6989586621679647585 :: TyFun (Last a) Bool -> Type) (a6989586621679647586 :: Last a) = TFHelper_6989586621679647580 a6989586621679647585 a6989586621679647586
type Apply (TFHelper_6989586621679647540Sym1 a6989586621679647545 :: TyFun (Max a) Bool -> Type) (a6989586621679647546 :: Max a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647540Sym1 a6989586621679647545 :: TyFun (Max a) Bool -> Type) (a6989586621679647546 :: Max a) = TFHelper_6989586621679647540 a6989586621679647545 a6989586621679647546
type Apply (TFHelper_6989586621679647520Sym1 a6989586621679647525 :: TyFun (Min a) Bool -> Type) (a6989586621679647526 :: Min a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647520Sym1 a6989586621679647525 :: TyFun (Min a) Bool -> Type) (a6989586621679647526 :: Min a) = TFHelper_6989586621679647520 a6989586621679647525 a6989586621679647526
type Apply (TFHelper_6989586621679647600Sym1 a6989586621679647605 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679647606 :: WrappedMonoid m)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647600Sym1 a6989586621679647605 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679647606 :: WrappedMonoid m) = TFHelper_6989586621679647600 a6989586621679647605 a6989586621679647606
type Apply (Elem_6989586621680261695Sym1 a6989586621680261704 :: TyFun (Dual a) Bool -> Type) (a6989586621680261705 :: Dual a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261695Sym1 a6989586621680261704 :: TyFun (Dual a) Bool -> Type) (a6989586621680261705 :: Dual a) = Elem_6989586621680261695 a6989586621680261704 a6989586621680261705
type Apply (TFHelper_6989586621679647426Sym1 a6989586621679647431 :: TyFun (Dual a) Bool -> Type) (a6989586621679647432 :: Dual a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647426Sym1 a6989586621679647431 :: TyFun (Dual a) Bool -> Type) (a6989586621679647432 :: Dual a) = TFHelper_6989586621679647426 a6989586621679647431 a6989586621679647432
type Apply (Elem_6989586621680262045Sym1 a6989586621680262054 :: TyFun (Product a) Bool -> Type) (a6989586621680262055 :: Product a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680262045Sym1 a6989586621680262054 :: TyFun (Product a) Bool -> Type) (a6989586621680262055 :: Product a) = Elem_6989586621680262045 a6989586621680262054 a6989586621680262055
type Apply (TFHelper_6989586621679647500Sym1 a6989586621679647505 :: TyFun (Product a) Bool -> Type) (a6989586621679647506 :: Product a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647500Sym1 a6989586621679647505 :: TyFun (Product a) Bool -> Type) (a6989586621679647506 :: Product a) = TFHelper_6989586621679647500 a6989586621679647505 a6989586621679647506
type Apply (Elem_6989586621680261870Sym1 a6989586621680261879 :: TyFun (Sum a) Bool -> Type) (a6989586621680261880 :: Sum a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261870Sym1 a6989586621680261879 :: TyFun (Sum a) Bool -> Type) (a6989586621680261880 :: Sum a) = Elem_6989586621680261870 a6989586621680261879 a6989586621680261880
type Apply (TFHelper_6989586621679647480Sym1 a6989586621679647485 :: TyFun (Sum a) Bool -> Type) (a6989586621679647486 :: Sum a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647480Sym1 a6989586621679647485 :: TyFun (Sum a) Bool -> Type) (a6989586621679647486 :: Sum a) = TFHelper_6989586621679647480 a6989586621679647485 a6989586621679647486
type Apply (TFHelper_6989586621679136316Sym1 a6989586621679136321 :: TyFun (NonEmpty a) Bool -> Type) (a6989586621679136322 :: NonEmpty a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136316Sym1 a6989586621679136321 :: TyFun (NonEmpty a) Bool -> Type) (a6989586621679136322 :: NonEmpty a) = TFHelper_6989586621679136316 a6989586621679136321 a6989586621679136322
type Apply (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) (a6989586621679136216 :: Maybe a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) (a6989586621679136216 :: Maybe a) = TFHelper_6989586621679136210 a6989586621679136215 a6989586621679136216
type Apply (TFHelper_6989586621679136241Sym1 a6989586621679136246 :: TyFun [a] Bool -> Type) (a6989586621679136247 :: [a])
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136241Sym1 a6989586621679136246 :: TyFun [a] Bool -> Type) (a6989586621679136247 :: [a]) = TFHelper_6989586621679136241 a6989586621679136246 a6989586621679136247
type Apply (Elem_6989586621680261287Sym1 a6989586621680261296 :: TyFun [a] Bool -> Type) (a6989586621680261297 :: [a])
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261287Sym1 a6989586621680261296 :: TyFun [a] Bool -> Type) (a6989586621680261297 :: [a]) = Elem_6989586621680261287 a6989586621680261296 a6989586621680261297
type Apply (AllSym1 a6989586621679766539 :: TyFun [a] Bool -> Type) (a6989586621679766540 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (AllSym1 a6989586621679766539 :: TyFun [a] Bool -> Type) (a6989586621679766540 :: [a]) = All a6989586621679766539 a6989586621679766540
type Apply (AnySym1 a6989586621679766531 :: TyFun [a] Bool -> Type) (a6989586621679766532 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (AnySym1 a6989586621679766531 :: TyFun [a] Bool -> Type) (a6989586621679766532 :: [a]) = Any a6989586621679766531 a6989586621679766532
type Apply (ElemSym1 a6989586621679766314 :: TyFun [a] Bool -> Type) (a6989586621679766315 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemSym1 a6989586621679766314 :: TyFun [a] Bool -> Type) (a6989586621679766315 :: [a]) = Elem a6989586621679766314 a6989586621679766315
type Apply (IsInfixOfSym1 a6989586621679766322 :: TyFun [a] Bool -> Type) (a6989586621679766323 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsInfixOfSym1 a6989586621679766322 :: TyFun [a] Bool -> Type) (a6989586621679766323 :: [a]) = IsInfixOf a6989586621679766322 a6989586621679766323
type Apply (IsPrefixOfSym1 a6989586621679766336 :: TyFun [a] Bool -> Type) (a6989586621679766337 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsPrefixOfSym1 a6989586621679766336 :: TyFun [a] Bool -> Type) (a6989586621679766337 :: [a]) = IsPrefixOf a6989586621679766336 a6989586621679766337
type Apply (IsSuffixOfSym1 a6989586621679766329 :: TyFun [a] Bool -> Type) (a6989586621679766330 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsSuffixOfSym1 a6989586621679766329 :: TyFun [a] Bool -> Type) (a6989586621679766330 :: [a]) = IsSuffixOf a6989586621679766329 a6989586621679766330
type Apply (NotElemSym1 a6989586621679766306 :: TyFun [a] Bool -> Type) (a6989586621679766307 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (NotElemSym1 a6989586621679766306 :: TyFun [a] Bool -> Type) (a6989586621679766307 :: [a]) = NotElem a6989586621679766306 a6989586621679766307
type Apply (ListelemSym1 a6989586621680046083 :: TyFun [a] Bool -> Type) (a6989586621680046084 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListelemSym1 a6989586621680046083 :: TyFun [a] Bool -> Type) (a6989586621680046084 :: [a]) = Listelem a6989586621680046083 a6989586621680046084
type Apply (ListisPrefixOfSym1 a6989586621680046155 :: TyFun [a] Bool -> Type) (a6989586621680046156 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListisPrefixOfSym1 a6989586621680046155 :: TyFun [a] Bool -> Type) (a6989586621680046156 :: [a]) = ListisPrefixOf a6989586621680046155 a6989586621680046156
type Apply (Elem_bySym2 a6989586621679765542 a6989586621679765543 :: TyFun [a] Bool -> Type) (a6989586621679765544 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (Elem_bySym2 a6989586621679765542 a6989586621679765543 :: TyFun [a] Bool -> Type) (a6989586621679765544 :: [a]) = Elem_by a6989586621679765542 a6989586621679765543 a6989586621679765544
type Apply (AllSym1 a6989586621680260773 :: TyFun (t a) Bool -> Type) (a6989586621680260774 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (AllSym1 a6989586621680260773 :: TyFun (t a) Bool -> Type) (a6989586621680260774 :: t a) = All a6989586621680260773 a6989586621680260774
type Apply (AnySym1 a6989586621680260782 :: TyFun (t a) Bool -> Type) (a6989586621680260783 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (AnySym1 a6989586621680260782 :: TyFun (t a) Bool -> Type) (a6989586621680260783 :: t a) = Any a6989586621680260782 a6989586621680260783
type Apply (ElemSym1 a6989586621680260977 :: TyFun (t a) Bool -> Type) (a6989586621680260978 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (ElemSym1 a6989586621680260977 :: TyFun (t a) Bool -> Type) (a6989586621680260978 :: t a) = Elem a6989586621680260977 a6989586621680260978
type Apply (Elem_6989586621680261177Sym1 a6989586621680261186 :: TyFun (t a) Bool -> Type) (a6989586621680261187 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261177Sym1 a6989586621680261186 :: TyFun (t a) Bool -> Type) (a6989586621680261187 :: t a) = Elem_6989586621680261177 a6989586621680261186 a6989586621680261187
type Apply (NotElemSym1 a6989586621680260724 :: TyFun (t a) Bool -> Type) (a6989586621680260725 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (NotElemSym1 a6989586621680260724 :: TyFun (t a) Bool -> Type) (a6989586621680260725 :: t a) = NotElem a6989586621680260724 a6989586621680260725
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680260970 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680260970 :: t a) = Null a6989586621680260970
type Apply (Null_6989586621680261141Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680261147 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261141Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680261147 :: t a) = Null_6989586621680261141 a6989586621680261147
type Apply (TFHelper_6989586621679136700Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) (a6989586621679136705 :: Identity a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136700Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) (a6989586621679136705 :: Identity a) = TFHelper_6989586621679136700Sym1 a6989586621679136705
type Apply (TFHelper_6989586621680176930Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621680176935 :: First a)
Instance details Defined in Data.Monoid.Singletons type Apply (TFHelper_6989586621680176930Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621680176935 :: First a) = TFHelper_6989586621680176930Sym1 a6989586621680176935
type Apply (TFHelper_6989586621680176950Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621680176955 :: Last a)
Instance details Defined in Data.Monoid.Singletons type Apply (TFHelper_6989586621680176950Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621680176955 :: Last a) = TFHelper_6989586621680176950Sym1 a6989586621680176955
type Apply (TFHelper_6989586621679187081Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) (a6989586621679187086 :: Down a)
Instance details Defined in Data.Ord.Singletons type Apply (TFHelper_6989586621679187081Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) (a6989586621679187086 :: Down a) = TFHelper_6989586621679187081Sym1 a6989586621679187086
type Apply (TFHelper_6989586621679647560Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621679647565 :: First a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647560Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621679647565 :: First a) = TFHelper_6989586621679647560Sym1 a6989586621679647565
type Apply (TFHelper_6989586621679647580Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621679647585 :: Last a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647580Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621679647585 :: Last a) = TFHelper_6989586621679647580Sym1 a6989586621679647585
type Apply (TFHelper_6989586621679647540Sym0 :: TyFun (Max a) (Max a ~> Bool) -> Type) (a6989586621679647545 :: Max a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647540Sym0 :: TyFun (Max a) (Max a ~> Bool) -> Type) (a6989586621679647545 :: Max a) = TFHelper_6989586621679647540Sym1 a6989586621679647545
type Apply (TFHelper_6989586621679647520Sym0 :: TyFun (Min a) (Min a ~> Bool) -> Type) (a6989586621679647525 :: Min a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647520Sym0 :: TyFun (Min a) (Min a ~> Bool) -> Type) (a6989586621679647525 :: Min a) = TFHelper_6989586621679647520Sym1 a6989586621679647525
type Apply (TFHelper_6989586621679647600Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679647605 :: WrappedMonoid m)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647600Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679647605 :: WrappedMonoid m) = TFHelper_6989586621679647600Sym1 a6989586621679647605
type Apply (TFHelper_6989586621679647426Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) (a6989586621679647431 :: Dual a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647426Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) (a6989586621679647431 :: Dual a) = TFHelper_6989586621679647426Sym1 a6989586621679647431
type Apply (TFHelper_6989586621679647500Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) (a6989586621679647505 :: Product a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647500Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) (a6989586621679647505 :: Product a) = TFHelper_6989586621679647500Sym1 a6989586621679647505
type Apply (TFHelper_6989586621679647480Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) (a6989586621679647485 :: Sum a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679647480Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) (a6989586621679647485 :: Sum a) = TFHelper_6989586621679647480Sym1 a6989586621679647485
type Apply (TFHelper_6989586621679136316Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) (a6989586621679136321 :: NonEmpty a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136316Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) (a6989586621679136321 :: NonEmpty a) = TFHelper_6989586621679136316Sym1 a6989586621679136321
type Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679136215 :: Maybe a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679136215 :: Maybe a) = TFHelper_6989586621679136210Sym1 a6989586621679136215
type Apply (TFHelper_6989586621679136241Sym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679136246 :: [a])
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136241Sym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679136246 :: [a]) = TFHelper_6989586621679136241Sym1 a6989586621679136246
type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766322 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766322 :: [a]) = IsInfixOfSym1 a6989586621679766322
type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766336 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766336 :: [a]) = IsPrefixOfSym1 a6989586621679766336
type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766329 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679766329 :: [a]) = IsSuffixOfSym1 a6989586621679766329
type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680046155 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680046155 :: [a]) = ListisPrefixOfSym1 a6989586621680046155
type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym1 x6989586621679765853 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621679765854 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym1 x6989586621679765853 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621679765854 :: [a]) = Let6989586621679765855Scrutinee_6989586621679762489Sym2 x6989586621679765853 xs6989586621679765854 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type
type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym2 y6989586621679765560 ys6989586621679765561 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679765562 :: [k1])
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym2 y6989586621679765560 ys6989586621679765561 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679765562 :: [k1]) = Let6989586621679765563Scrutinee_6989586621679762517Sym3 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym2 x6989586621679765576 xs6989586621679765577 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621679765578 :: [k1])
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765579Scrutinee_6989586621679762515Sym2 x6989586621679765576 xs6989586621679765577 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621679765578 :: [k1]) = Let6989586621679765579Scrutinee_6989586621679762515Sym3 x6989586621679765576 xs6989586621679765577 ls6989586621679765578 :: TyFun k3 Bool -> Type
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291365 :: Either a b)
Instance details Defined in Data.Either.Singletons type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291365 :: Either a b) = IsLeft a6989586621679291365
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291362 :: Either a b)
Instance details Defined in Data.Either.Singletons type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291362 :: Either a b) = IsRight a6989586621679291362
type Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680261588 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680261588 :: Either a1 a2) = Null_6989586621680261582 a6989586621680261588
type Apply (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261669 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261669 :: Proxy a) = Elem_6989586621680261663 a6989586621680261668 a6989586621680261669
type Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261660 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261660 :: Proxy a) = Null_6989586621680261656 a6989586621680261660
type Apply (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) (a6989586621679136294 :: Either a b)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) (a6989586621679136294 :: Either a b) = TFHelper_6989586621679136288 a6989586621679136293 a6989586621679136294
type Apply (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) (a6989586621680230375 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) (a6989586621680230375 :: Proxy s) = TFHelper_6989586621680230369 a6989586621680230374 a6989586621680230375
type Apply (TFHelper_6989586621680669373Sym1 a6989586621680669378 :: TyFun (Arg a b) Bool -> Type) (a6989586621680669379 :: Arg a b)
Instance details Defined in Data.Semigroup.Singletons type Apply (TFHelper_6989586621680669373Sym1 a6989586621680669378 :: TyFun (Arg a b) Bool -> Type) (a6989586621680669379 :: Arg a b) = TFHelper_6989586621680669373 a6989586621680669378 a6989586621680669379
type Apply (TFHelper_6989586621679136356Sym1 a6989586621679136361 :: TyFun (a, b) Bool -> Type) (a6989586621679136362 :: (a, b))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136356Sym1 a6989586621679136361 :: TyFun (a, b) Bool -> Type) (a6989586621679136362 :: (a, b)) = TFHelper_6989586621679136356 a6989586621679136361 a6989586621679136362
type Apply ProtectEscSym0 (a6989586621680120010 :: Char ~> Bool)
Instance details Defined in Text.Show.Singletons type Apply ProtectEscSym0 (a6989586621680120010 :: Char ~> Bool) = ProtectEscSym1 a6989586621680120010
type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679766068 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679766068 :: a ~> (a ~> Bool)) = DeleteFirstsBySym1 a6989586621679766068
type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679765893 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679765893 :: a ~> (a ~> Bool)) = IntersectBySym1 a6989586621679765893
type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679765532 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679765532 :: a ~> (a ~> Bool)) = UnionBySym1 a6989586621679765532
type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621679765685 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621679765685 :: a ~> (a ~> Bool)) = GroupBySym1 a6989586621679765685
type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621679765552 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621679765552 :: a ~> (a ~> Bool)) = NubBySym1 a6989586621679765552
type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680046117 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680046117 :: a ~> (a ~> Bool)) = ListnubBySym1 a6989586621680046117
type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621679765542 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621679765542 :: a ~> (a ~> Bool)) = Elem_bySym1 a6989586621679765542
type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621679766078 :: a ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621679766078 :: a ~> (a ~> Bool)) = DeleteBySym1 a6989586621679766078
type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679257793 :: a ~> Bool)
Instance details Defined in GHC.Base.Singletons type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679257793 :: a ~> Bool) = UntilSym1 a6989586621679257793
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool) = FindIndexSym1 a6989586621679765945
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679765972 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679765972 :: a ~> Bool) = FindSym1 a6989586621679765972
type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765775 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765775 :: a ~> Bool) = BreakSym1 a6989586621679765775
type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765663 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765663 :: a ~> Bool) = PartitionSym1 a6989586621679765663
type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765810 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679765810 :: a ~> Bool) = SpanSym1 a6989586621679765810
type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680046177 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680046177 :: a ~> Bool) = ListpartitionSym1 a6989586621680046177
type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680046199 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680046199 :: a ~> Bool) = ListspanSym1 a6989586621680046199
type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679766539 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679766539 :: a ~> Bool) = AllSym1 a6989586621679766539
type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679766531 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679766531 :: a ~> Bool) = AnySym1 a6989586621679766531
type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type) (a6989586621679765922 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type) (a6989586621679765922 :: a ~> Bool) = FindIndicesSym1 a6989586621679765922
type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765847 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765847 :: a ~> Bool) = DropWhileEndSym1 a6989586621679765847
type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765864 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765864 :: a ~> Bool) = DropWhileSym1 a6989586621679765864
type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765979 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765979 :: a ~> Bool) = FilterSym1 a6989586621679765979
type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765879 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679765879 :: a ~> Bool) = TakeWhileSym1 a6989586621679765879
type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046210 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046210 :: a ~> Bool) = ListdropWhileSym1 a6989586621680046210
type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046188 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046188 :: a ~> Bool) = ListfilterSym1 a6989586621680046188
type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046221 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680046221 :: a ~> Bool) = ListtakeWhileSym1 a6989586621680046221
type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621679765648 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621679765648 :: a ~> Bool) = SelectSym1 a6989586621679765648
type Apply (Let6989586621679765788X_6989586621679765789Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765788X_6989586621679765789Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool) = Let6989586621679765788X_6989586621679765789Sym1 p6989586621679765779
type Apply (Let6989586621679765823X_6989586621679765824Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765823X_6989586621679765824Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool) = Let6989586621679765823X_6989586621679765824Sym1 p6989586621679765814
type Apply (Let6989586621679765788YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765788YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool) = Let6989586621679765788YsSym1 p6989586621679765779
type Apply (Let6989586621679765788ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765788ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765779 :: k ~> Bool) = Let6989586621679765788ZsSym1 p6989586621679765779
type Apply (Let6989586621679765823YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765823YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool) = Let6989586621679765823YsSym1 p6989586621679765814
type Apply (Let6989586621679765823ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765823ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679765814 :: k ~> Bool) = Let6989586621679765823ZsSym1 p6989586621679765814
type Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679136293 :: Either a b)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679136293 :: Either a b) = TFHelper_6989586621679136288Sym1 a6989586621679136293
type Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680230374 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680230374 :: Proxy s) = TFHelper_6989586621680230369Sym1 a6989586621680230374
type Apply (TFHelper_6989586621680669373Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621680669378 :: Arg a b)
Instance details Defined in Data.Semigroup.Singletons type Apply (TFHelper_6989586621680669373Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621680669378 :: Arg a b) = TFHelper_6989586621680669373Sym1 a6989586621680669378
type Apply (Let6989586621680120016ContSym0 :: TyFun (Char ~> Bool) (TyFun k1 (TyFun k2 (TyFun Symbol Symbol -> Type) -> Type) -> Type) -> Type) (p6989586621680120013 :: Char ~> Bool)
Instance details Defined in Text.Show.Singletons type Apply (Let6989586621680120016ContSym0 :: TyFun (Char ~> Bool) (TyFun k1 (TyFun k2 (TyFun Symbol Symbol -> Type) -> Type) -> Type) -> Type) (p6989586621680120013 :: Char ~> Bool) = Let6989586621680120016ContSym1 p6989586621680120013 :: TyFun k1 (TyFun k2 (TyFun Symbol Symbol -> Type) -> Type) -> Type
type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621680993132 :: a ~> Bool)
Instance details Defined in Control.Monad.Singletons type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621680993132 :: a ~> Bool) = MfilterSym1 a6989586621680993132 :: TyFun (m a) (m a) -> Type
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680260706 :: a ~> Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680260706 :: a ~> Bool) = FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680260773 :: a ~> Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680260773 :: a ~> Bool) = AllSym1 a6989586621680260773 :: TyFun (t a) Bool -> Type
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680260782 :: a ~> Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680260782 :: a ~> Bool) = AnySym1 a6989586621680260782 :: TyFun (t a) Bool -> Type
type Apply (Lambda_6989586621680260710Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680260708 :: a ~> Bool)
Instance details Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680260710Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680260708 :: a ~> Bool) = Lambda_6989586621680260710Sym1 p6989586621680260708 :: TyFun k (TyFun a (First a) -> Type) -> Type
type Apply (Lambda_6989586621679765851Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621679765849 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Lambda_6989586621679765851Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621679765849 :: a ~> Bool) = Lambda_6989586621679765851Sym1 p6989586621679765849 :: TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type
type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621680993294 :: a ~> m Bool)
Instance details Defined in Control.Monad.Singletons type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621680993294 :: a ~> m Bool) = FilterMSym1 a6989586621680993294
type Apply (Let6989586621679765690X_6989586621679765691Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765690X_6989586621679765691Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool)) = Let6989586621679765690X_6989586621679765691Sym1 eq6989586621679765687
type Apply (Let6989586621679765690YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765690YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool)) = Let6989586621679765690YsSym1 eq6989586621679765687
type Apply (Let6989586621679765690ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765690ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679765687 :: k1 ~> (a ~> Bool)) = Let6989586621679765690ZsSym1 eq6989586621679765687
type Apply (Let6989586621679765556NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621679765554 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765556NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621679765554 :: k1 ~> (k1 ~> Bool)) = Let6989586621679765556NubBy'Sym1 eq6989586621679765554 :: TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type
type Apply (Let6989586621679257799GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679257796 :: k1 ~> Bool)
Instance details Defined in GHC.Base.Singletons type Apply (Let6989586621679257799GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679257796 :: k1 ~> Bool) = Let6989586621679257799GoSym1 p6989586621679257796 :: TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type
type Apply (TFHelper_6989586621679136356Sym0 :: TyFun (a, b) ((a, b) ~> Bool) -> Type) (a6989586621679136361 :: (a, b))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136356Sym0 :: TyFun (a, b) ((a, b) ~> Bool) -> Type) (a6989586621679136361 :: (a, b)) = TFHelper_6989586621679136356Sym1 a6989586621679136361
type Apply (Lambda_6989586621680993136Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621680993134 :: k1 ~> Bool)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993136Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621680993134 :: k1 ~> Bool) = Lambda_6989586621680993136Sym1 p6989586621680993134 :: TyFun k (TyFun k1 (m k1) -> Type) -> Type
type Apply (Lambda_6989586621680993298Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621680993296 :: k2 ~> f Bool)
Instance details Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680993298Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621680993296 :: k2 ~> f Bool) = Lambda_6989586621680993298Sym1 p6989586621680993296 :: TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type
type Apply (Lambda_6989586621679765904Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679765896 :: b ~> (a ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Lambda_6989586621679765904Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679765896 :: b ~> (a ~> Bool)) = Lambda_6989586621679765904Sym1 eq6989586621679765896 :: TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym2 x6989586621679765853 xs6989586621679765854 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621679765849 :: k1 ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765855Scrutinee_6989586621679762489Sym2 x6989586621679765853 xs6989586621679765854 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621679765849 :: k1 ~> Bool) = Let6989586621679765855Scrutinee_6989586621679762489Sym3 x6989586621679765853 xs6989586621679765854 p6989586621679765849 :: TyFun k Bool -> Type
type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym3 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621679765554 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765563Scrutinee_6989586621679762517Sym3 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621679765554 :: k1 ~> (k1 ~> Bool)) = Let6989586621679765563Scrutinee_6989586621679762517Sym4 y6989586621679765560 ys6989586621679765561 xs6989586621679765562 eq6989586621679765554 :: TyFun k3 Bool -> Type
type Apply (TFHelper_6989586621680493995Sym1 a6989586621680494000 :: TyFun (Const a b) Bool -> Type) (a6989586621680494001 :: Const a b)
Instance details Defined in Data.Functor.Const.Singletons type Apply (TFHelper_6989586621680493995Sym1 a6989586621680494000 :: TyFun (Const a b) Bool -> Type) (a6989586621680494001 :: Const a b) = TFHelper_6989586621680493995 a6989586621680494000 a6989586621680494001
type Apply (TFHelper_6989586621679136394Sym1 a6989586621679136399 :: TyFun (a, b, c) Bool -> Type) (a6989586621679136400 :: (a, b, c))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136394Sym1 a6989586621679136399 :: TyFun (a, b, c) Bool -> Type) (a6989586621679136400 :: (a, b, c)) = TFHelper_6989586621679136394 a6989586621679136399 a6989586621679136400
type Apply (TFHelper_6989586621680493995Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) (a6989586621680494000 :: Const a b)
Instance details Defined in Data.Functor.Const.Singletons type Apply (TFHelper_6989586621680493995Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) (a6989586621680494000 :: Const a b) = TFHelper_6989586621680493995Sym1 a6989586621680494000
type Apply (TFHelper_6989586621679136394Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Bool) -> Type) (a6989586621679136399 :: (a, b, c))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136394Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Bool) -> Type) (a6989586621679136399 :: (a, b, c)) = TFHelper_6989586621679136394Sym1 a6989586621679136399
type Apply (TFHelper_6989586621679136443Sym1 a6989586621679136448 :: TyFun (a, b, c, d) Bool -> Type) (a6989586621679136449 :: (a, b, c, d))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136443Sym1 a6989586621679136448 :: TyFun (a, b, c, d) Bool -> Type) (a6989586621679136449 :: (a, b, c, d)) = TFHelper_6989586621679136443 a6989586621679136448 a6989586621679136449
type Apply (TFHelper_6989586621679136443Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Bool) -> Type) (a6989586621679136448 :: (a, b, c, d))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136443Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Bool) -> Type) (a6989586621679136448 :: (a, b, c, d)) = TFHelper_6989586621679136443Sym1 a6989586621679136448
type Apply (TFHelper_6989586621679136503Sym1 a6989586621679136508 :: TyFun (a, b, c, d, e) Bool -> Type) (a6989586621679136509 :: (a, b, c, d, e))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136503Sym1 a6989586621679136508 :: TyFun (a, b, c, d, e) Bool -> Type) (a6989586621679136509 :: (a, b, c, d, e)) = TFHelper_6989586621679136503 a6989586621679136508 a6989586621679136509
type Apply (TFHelper_6989586621679136503Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Bool) -> Type) (a6989586621679136508 :: (a, b, c, d, e))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136503Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Bool) -> Type) (a6989586621679136508 :: (a, b, c, d, e)) = TFHelper_6989586621679136503Sym1 a6989586621679136508
type Apply (TFHelper_6989586621679136574Sym1 a6989586621679136579 :: TyFun (a, b, c, d, e, f) Bool -> Type) (a6989586621679136580 :: (a, b, c, d, e, f))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136574Sym1 a6989586621679136579 :: TyFun (a, b, c, d, e, f) Bool -> Type) (a6989586621679136580 :: (a, b, c, d, e, f)) = TFHelper_6989586621679136574 a6989586621679136579 a6989586621679136580
type Apply (TFHelper_6989586621679136574Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Bool) -> Type) (a6989586621679136579 :: (a, b, c, d, e, f))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136574Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Bool) -> Type) (a6989586621679136579 :: (a, b, c, d, e, f)) = TFHelper_6989586621679136574Sym1 a6989586621679136579
type Apply (TFHelper_6989586621679136656Sym1 a6989586621679136661 :: TyFun (a, b, c, d, e, f, g) Bool -> Type) (a6989586621679136662 :: (a, b, c, d, e, f, g))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136656Sym1 a6989586621679136661 :: TyFun (a, b, c, d, e, f, g) Bool -> Type) (a6989586621679136662 :: (a, b, c, d, e, f, g)) = TFHelper_6989586621679136656 a6989586621679136661 a6989586621679136662
type Apply (TFHelper_6989586621679136656Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Bool) -> Type) (a6989586621679136661 :: (a, b, c, d, e, f, g))
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136656Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Bool) -> Type) (a6989586621679136661 :: (a, b, c, d, e, f, g)) = TFHelper_6989586621679136656Sym1 a6989586621679136661

data Integer #

Arbitrary precision integers. In contrast with fixed-size integral types such as Int, the Integer type represents the entire infinite range of integers.

Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.

If the value is small (fit into an Int), IS constructor is used. Otherwise Integer and IN constructors are used to store a BigNat representing respectively the positive or the negative value magnitude.

Invariant: Integer and IN are used iff value doesn't fit in IS

Instances

Instances details

Structured Integer
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy Integer -> Structure # structureHash' :: Tagged Integer MD5
FiniteBitsBase Integer
Instance details Defined in Data.Word.Odd Methods subWordClz :: Int -> Integer -> Int # subWordCtz :: Int -> Integer -> Int #
FromJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods parseJSON :: Value -> Parser TezosBigNum # parseJSONList :: Value -> Parser [TezosBigNum] #
ToJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods toJSON :: TezosBigNum -> Value # toEncoding :: TezosBigNum -> Encoding # toJSONList :: [TezosBigNum] -> Value # toEncodingList :: [TezosBigNum] -> Encoding #
ToJSON Integer
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Integer -> Value # toEncoding :: Integer -> Encoding # toJSONList :: [Integer] -> Value # toEncodingList :: [Integer] -> Encoding #
ToJSONKey Integer
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Integer # toJSONKeyList :: ToJSONKeyFunction [Integer] #
Data Integer	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Integer -> c Integer # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Integer # toConstr :: Integer -> Constr # dataTypeOf :: Integer -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Integer) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Integer) # gmapT :: (forall b. Data b => b -> b) -> Integer -> Integer # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQ :: (forall d. Data d => d -> u) -> Integer -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Integer -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer #
Enum Integer	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Integer -> Integer # pred :: Integer -> Integer # toEnum :: Int -> Integer # fromEnum :: Integer -> Int # enumFrom :: Integer -> [Integer] # enumFromThen :: Integer -> Integer -> [Integer] # enumFromTo :: Integer -> Integer -> [Integer] # enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #
Num Integer	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Integer -> Integer -> Integer # (-) :: Integer -> Integer -> Integer # (*) :: Integer -> Integer -> Integer # negate :: Integer -> Integer # abs :: Integer -> Integer # signum :: Integer -> Integer # fromInteger :: Integer -> Integer #
Read Integer	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Integer # readList :: ReadS [Integer] # readPrec :: ReadPrec Integer # readListPrec :: ReadPrec [Integer] #
Integral Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Integer -> Integer -> Integer # rem :: Integer -> Integer -> Integer # div :: Integer -> Integer -> Integer # mod :: Integer -> Integer -> Integer # quotRem :: Integer -> Integer -> (Integer, Integer) # divMod :: Integer -> Integer -> (Integer, Integer) # toInteger :: Integer -> Integer #
Real Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Integer -> Rational #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Subtractive Integer
Instance details Defined in Basement.Numerical.Subtractive Associated Types type Difference Integer # Methods (-) :: Integer -> Integer -> Difference Integer #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
NFData Integer
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () #
Eq Integer
Instance details Defined in GHC.Num.Integer Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Ord Integer
Instance details Defined in GHC.Num.Integer Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
HasAnnotation Integer Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer) Source # annOptions :: Maybe AnnOptions Source #
ToBytesArithOpHs Integer Source #
Instance details Defined in Lorentz.Arith Methods evalToBytesOpHs :: forall bs (s :: [Type]). BytesLike bs => (Integer ': s) :-> (bs ': s) Source #
LDefault Integer Source #
Instance details Defined in Lorentz.Default Methods ldef :: Integer Source # lIsDef :: forall (s :: [Type]). (Integer ': s) :-> (Bool ': s) Source #
NonZero Integer Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s) Source #
HasRPCRepr Integer
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Integer
TypeHasDoc Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Integer :: FieldDescriptions # Methods typeDocName :: Proxy Integer -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Integer -> WithinParens -> Markdown # typeDocDependencies :: Proxy Integer -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Integer # typeDocMichelsonRep :: TypeDocMichelsonRep Integer #
IsoValue Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
HasCLReader Integer
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Integer getMetavar :: String
Buildable Integer
Instance details Defined in Fmt.Buildable Methods build :: Integer -> Doc buildList :: [Integer] -> Doc
FormatAsHex Integer
Instance details Defined in Fmt.Buildable Methods hexF :: Integer -> Doc
Pretty Integer	`>>>` `pretty (2^123 :: Integer)`10633823966279326983230456482242756608
Instance details Defined in Prettyprinter.Internal Methods pretty :: Integer -> Doc ann # prettyList :: [Integer] -> Doc ann #
UniformRange Integer
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Integer, Integer) -> g -> m Integer #
Ring Integer
Instance details Defined in Data.Semiring Methods negate :: Integer -> Integer #
Semiring Integer
Instance details Defined in Data.Semiring Methods plus :: Integer -> Integer -> Integer # zero :: Integer # times :: Integer -> Integer -> Integer # one :: Integer # fromNatural :: Natural -> Integer #
UnaryArithOpHs Abs Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Abs Integer ': s) Source #
UnaryArithOpHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Eq' Integer ': s) Source #
UnaryArithOpHs Ge Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Ge Integer ': s) Source #
UnaryArithOpHs Gt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Gt Integer ': s) Source #
UnaryArithOpHs Le Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Le Integer ': s) Source #
UnaryArithOpHs Lt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Lt Integer ': s) Source #
UnaryArithOpHs Neg Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neg Integer ': s) Source #
UnaryArithOpHs Neq Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neq Integer ': s) Source #
UnaryArithOpHs Not Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Not Integer ': s) Source #
MultiplyPoint Integer Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G1 -> Bls12381G1
MultiplyPoint Integer Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G2 -> Bls12381G2
Lift Integer
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Integer -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Integer -> Code m Integer #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
r ~ Rational => ArithOpHs Div NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Integer Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Integer Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Sub Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
() :=> (Bits Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Integer #
() :=> (Enum Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Integer #
() :=> (Num Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Integer #
() :=> (Integral Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Integer #
() :=> (Real Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Real Integer #
() :=> (Eq Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Integer #
() :=> (Ord Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Integer #
r ~ Fixed p => ArithOpHs Add (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
type Difference Integer
Instance details Defined in Basement.Numerical.Subtractive type Difference Integer = Integer
type IntBaseType Integer
Instance details Defined in Data.IntCast type IntBaseType Integer = 'BigIntTag
type AsRPC Integer
Instance details Defined in Morley.AsRPC type AsRPC Integer = Integer
type TypeDocFieldDescriptions Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type PrettyShow Integer
Instance details Defined in Morley.Prelude.Show type PrettyShow Integer = ()
type UnaryArithResHs Abs Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Ge Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type UnaryArithResHs Gt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Lt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Neg Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Neq Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Not Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer

data Maybe a #

The Maybe type encapsulates an optional value. A value of type Maybe a either contains a value of type a (represented as Just a), or it is empty (represented as Nothing). 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.

Constructors

Nothing
Just a

Instances

Instances details

ToJSON1 Maybe
Instance details 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
Instance details Defined in Control.Monad.Fail Methods fail :: String -> Maybe a #
Foldable Maybe	Since: base-2.1
Instance details 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 # toList :: Maybe a -> [a] # null :: Maybe a -> Bool # length :: Maybe a -> Int # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # sum :: Num a => Maybe a -> a # product :: Num a => Maybe a -> a #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
Alternative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: Maybe a # (<\|>) :: Maybe a -> Maybe a -> Maybe a # some :: Maybe a -> Maybe [a] # many :: Maybe a -> Maybe [a] #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Functor Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b # (<$) :: a -> Maybe b -> Maybe a #
Monad Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b # (>>) :: Maybe a -> Maybe b -> Maybe b # return :: a -> Maybe a #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe a -> Maybe a -> Maybe a #
MonadFailure Maybe
Instance details Defined in Basement.Monad Associated Types type Failure Maybe # Methods mFail :: Failure Maybe -> Maybe () #
NFData1 Maybe	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Maybe a -> () #
MonadThrow Maybe
Instance details Defined in Control.Monad.Catch Methods throwM :: Exception e => e -> Maybe a #
Hashable1 Maybe
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int #
KnownNamedFunctor Maybe
Instance details Defined in Morley.Util.Named Methods namedL :: forall (name :: Symbol) a. Label name -> Iso' (NamedF Maybe a name) (ApplyNamedFunctor Maybe a)
InjValue Maybe
Instance details Defined in Named.Internal Methods injValue :: a -> Maybe a #
SMonadFail Maybe
Instance details Defined in Control.Monad.Fail.Singletons Methods sFail :: forall a (t :: [Char]). Sing t -> Sing (Apply FailSym0 t) #
PApplicative Maybe
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PFunctor Maybe
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PMonad Maybe
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a #
SAlternative Maybe
Instance details Defined in Control.Monad.Singletons.Internal Methods sEmpty :: Sing EmptySym0 # (%<\|>) :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<\|>@#@$) t1) t2) #
SApplicative Maybe
Instance details 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
Instance details Defined in Control.Monad.Singletons.Internal Methods sFmap :: forall a b (t1 :: a ~> b) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: forall a b (t1 :: a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SMonad Maybe
Instance details 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
Instance details Defined in Control.Monad.Singletons.Internal Methods sMzero :: Sing MzeroSym0 # sMplus :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MplusSym0 t1) t2) #
PFoldable Maybe
Instance details Defined in Data.Foldable.Singletons Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Natural # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable Maybe
Instance details 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
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Maybe
Instance details 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
Instance details Defined in GHC.Generics Associated Types type Rep1 Maybe :: k -> Type # Methods from1 :: forall (a :: k). Maybe a -> Rep1 Maybe a # to1 :: forall (a :: k). Rep1 Maybe a -> Maybe a #
MonadError () Maybe	Since: mtl-2.2.2
Instance details Defined in Control.Monad.Error.Class Methods throwError :: () -> Maybe a # catchError :: Maybe a -> (() -> Maybe a) -> Maybe a #
PMonadFail Maybe
Instance details Defined in Control.Monad.Fail.Singletons Associated Types type Fail arg :: m a #
PAlternative Maybe
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Empty :: f a # type arg <\|> arg1 :: f a #
PMonadPlus Maybe
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Mzero :: m a # type Mplus arg arg1 :: m a #
LorentzFunctor Maybe a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Maybe a ': s) :-> (Maybe b ': s) Source #
IsoHKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec Associated Types type HKD Maybe a # Methods unHKD :: HKD Maybe a -> Maybe a # toHKD :: Maybe a -> HKD Maybe a #
DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (NFixed (b r)) ': s) Source #
ArithOpHs Div Natural Natural (Maybe NRational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe NRational ': s) Source #
(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))
Instance details Defined in Data.Aeson.Types.ToJSON Methods recordToPairs :: Options -> ToArgs enc arity a0 -> S1 s (K1 i (Maybe a)) a0 -> pairs
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () Source #
() :=> (Alternative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Alternative Maybe #
() :=> (Applicative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative Maybe #
() :=> (Functor Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Functor Maybe #
() :=> (MonadPlus Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- MonadPlus Maybe #
Lift a => Lift (Maybe a :: Type)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Maybe a -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Maybe a -> Code m (Maybe a) #
SingI1 (FromMaybeSym1 :: a -> TyFun (Maybe a) a -> Type)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Maybe.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Maybe_Sym2 x y) #
Structured a => Structured (Maybe a)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Maybe a) -> Structure # structureHash' :: Tagged (Maybe a) MD5
ToJSON a => ToJSON (Maybe a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Maybe a -> Value # toEncoding :: Maybe a -> Encoding # toJSONList :: [Maybe a] -> Value # toEncodingList :: [Maybe a] -> Encoding #
Data a => Data (Maybe a)	Since: base-4.0.0.0
Instance details 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 `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Generic (Maybe a)
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
SingKind a => SingKind (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) Methods fromSing :: forall (a0 :: Maybe a). Sing a0 -> DemoteRep (Maybe a)
Read a => Read (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Maybe a) # readList :: ReadS [Maybe a] # readPrec :: ReadPrec (Maybe a) # readListPrec :: ReadPrec [Maybe a] #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
HasAnnotation a => HasAnnotation (Maybe a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # annOptions :: Maybe AnnOptions Source #
MapOpHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Maybe e) Source # type MapOpResHs (Maybe e) :: Type -> Type Source #
HasRPCRepr a => HasRPCRepr (Maybe a)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Maybe a)
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a)
Instance details 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)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
Buildable a => Buildable (Maybe a)
Instance details Defined in Fmt.Buildable Methods build :: Maybe a -> Doc buildList :: [Maybe a] -> Doc
Pretty a => Pretty (Maybe a)	Ignore `Nothing`s, print `Just` contents. `>>>` `pretty (Just True)`True `>>>` `braces (pretty (Nothing :: Maybe Bool))`{} `>>>` `pretty [Just 1, Nothing, Just 3, Nothing]`[1, 3]
Instance details Defined in Prettyprinter.Internal Methods pretty :: Maybe a -> Doc ann # prettyList :: [Maybe a] -> Doc ann #
Semiring a => Semiring (Maybe a)
Instance details Defined in Data.Semiring Methods plus :: Maybe a -> Maybe a -> Maybe a # zero :: Maybe a # times :: Maybe a -> Maybe a -> Maybe a # one :: Maybe a # fromNatural :: Natural -> Maybe a #
PEq (Maybe a)
Instance details Defined in Data.Eq.Singletons Associated Types type arg == arg1 :: Bool # type arg /= arg1 :: Bool #
SEq a => SEq (Maybe a)
Instance details Defined in Data.Eq.Singletons Methods (%==) :: 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) #
PMonoid (Maybe a)
Instance details Defined in Data.Monoid.Singletons Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SSemigroup a => SMonoid (Maybe a)
Instance details Defined in Data.Monoid.Singletons Methods sMempty :: Sing MemptySym0 # sMappend :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: forall (t :: [Maybe a]). Sing t -> Sing (Apply MconcatSym0 t) #
POrd (Maybe a)
Instance details Defined in Data.Ord.Singletons Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Maybe a)
Instance details 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)
Instance details Defined in Data.Semigroup.Singletons.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup a => SSemigroup (Maybe a)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods (%<>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: forall (t :: NonEmpty (Maybe a)). Sing t -> Sing (Apply SconcatSym0 t) #
PShow (Maybe a)
Instance details Defined in Text.Show.Singletons Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow a => SShow (Maybe a)
Instance details 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)
Instance details Defined in Universum.Container.Class Associated Types type Element (Maybe a) # Methods toList :: Maybe a -> [Element (Maybe a)] # null :: Maybe a -> Bool # 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 # length :: Maybe a -> Int # 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 # and :: Maybe a -> Bool # or :: 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)
Instance details Defined in Data.Singletons.Base.Instances Methods testCoercion :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (Coercion a0 b) #
SDecide a => TestEquality (SMaybe :: Maybe a -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods testEquality :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (a0 :~: b) #
SingI ('Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'Nothing
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Maybe a) #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
(Read a) :=> (Read (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Read a :- Read (Maybe a) #
(Show a) :=> (Show (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Maybe a) #
(Eq a) :=> (Eq (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Maybe a) #
(Ord a) :=> (Ord (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Maybe a) #
Each (Maybe a) (Maybe b) a b
Instance details Defined in Lens.Micro.Internal Methods each :: Traversal (Maybe a) (Maybe b) a b #
SingI1 ('MaxInternal :: Maybe a -> MaxInternal a)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ('MaxInternal x) #
SingI1 ('MinInternal :: Maybe a -> MinInternal a)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing ('MinInternal x) #
SingI a2 => SingI ('Just a2 :: Maybe a1)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing ('Just a2)
SingI UnconsSymbolSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing UnconsSymbolSym0 #
SuppressUnusedWarnings UnconsSymbolSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing GetFirstSym0 #
SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing GetLastSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindSym0 #
SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing GetMaxInternalSym0 #
SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing GetMinInternalSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing FirstSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing LastSym0 #
SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MaxInternalSym0 #
SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MinInternalSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing MaybeToListSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing FromJustSym0 #
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing CatMaybesSym0 #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing ListToMaybeSym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing FromMaybeSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndexSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing JustSym0 #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679188560Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120043Scrutinee_6989586621680119971Sym0 :: TyFun Symbol (TyFun k (Maybe (Char, Symbol)) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a) -> Type)
Instance details Defined in Control.Monad.Fail.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621679378397Sym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679378667LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing MapMaybeSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FindSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnfoldrSym0 #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (FromMaybeSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndexSym1 d) #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindSym1 d) #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing LookupSym0 #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing Maybe_Sym0 #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Control.Applicative.Singletons Methods sing :: Sing OptionalSym0 #
SuppressUnusedWarnings (Foldr_6989586621680261256Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679378274Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261240Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261272Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679188560Sym1 a6989586621679188565 :: TyFun (Maybe a) Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378658Sym1 a6989586621679378663 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679625161Sym1 a6989586621679625166 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679524064 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621679923128 :: TyFun [a] (Maybe [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621679765972 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378286Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261199MkJustSym0 :: TyFun k (TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261214MkJustSym0 :: TyFun k (TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251456NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251480NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251456MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251480MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SingI1 (FindIndexSym1 :: (a ~> Bool) -> TyFun [a] (Maybe Natural) -> Type)
Instance details 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)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindSym1 x) #
SingI1 (MapMaybeSym1 :: (a ~> Maybe b) -> TyFun [a] [b] -> Type)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindSym1 x) #
SingI1 (UnfoldrSym1 :: (b ~> Maybe (a, b)) -> TyFun b [a] -> Type)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym1 d) #
(SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (LookupSym1 d) #
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FindSym1 d) #
SuppressUnusedWarnings (LiftA2_6989586621679378420Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679524039RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543622Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679378274Sym1 a6989586621679378279 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378407Sym1 a6989586621679378412 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261240Sym1 a6989586621680261249 :: TyFun (Maybe a) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details 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)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a6989586621680260386 (Maybe a6989586621680260386) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261272Sym1 a6989586621680261278 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261256Sym1 a6989586621680261262 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680186007Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680186243Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details 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)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679378420Sym1 a6989586621679378426 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679521908 a6989586621679521909 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543622Sym1 a6989586621680543627 :: TyFun (Maybe a) (f (Maybe b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427 :: TyFun (Maybe b) (Maybe c) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261100MfSym2 f6989586621680261098 xs6989586621680261099 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101 :: TyFun (Maybe k3) (Maybe k2) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680261121MfSym3 f6989586621680261119 xs6989586621680261120 a6989586621680261122 :: TyFun k3 (Maybe k3) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # annOptions :: Maybe AnnOptions Source #
Unwrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) Source #
Wrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable
HasRPCRepr a => HasRPCRepr (NamedF Maybe a name)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (NamedF Maybe a name)
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
type Failure Maybe
Instance details Defined in Basement.Monad type Failure Maybe = ()
type Rep1 Maybe	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 Maybe = D1 ('MetaData "Maybe" "GHC.Maybe" "base" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))
type Empty
Instance details Defined in Control.Monad.Singletons.Internal type Empty = Empty_6989586621679378653Sym0 :: Maybe a
type Mzero
Instance details Defined in Control.Monad.Singletons.Internal type Mzero = Mzero_6989586621679301582Sym0 :: Maybe a
type Pure (a :: k1)
Instance details Defined in Control.Monad.Singletons.Internal type Pure (a :: k1) = Apply (Pure_6989586621679378397Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Control.Monad.Singletons.Internal type Return (arg :: a) = Apply (Return_6989586621679301562Sym0 :: TyFun a (Maybe a) -> Type) arg
type Fold (arg :: Maybe m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Maybe m) = Apply (Fold_6989586621680260992Sym0 :: TyFun (Maybe m) m -> Type) arg
type Length (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Length (arg :: Maybe a) = Apply (Length_6989586621680261158Sym0 :: TyFun (Maybe a) Natural -> Type) arg
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Maybe a) = Apply (Maximum_6989586621680261191Sym0 :: TyFun (Maybe a) a -> Type) arg
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Maybe a) = Apply (Minimum_6989586621680261206Sym0 :: TyFun (Maybe a) a -> Type) arg
type Null (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Null (arg :: Maybe a) = Apply (Null_6989586621680261141Sym0 :: TyFun (Maybe a) Bool -> Type) arg
type Product (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: Maybe a) = Apply (Product_6989586621680261230Sym0 :: TyFun (Maybe a) a -> Type) arg
type Sum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: Maybe a) = Apply (Sum_6989586621680261221Sym0 :: TyFun (Maybe a) a -> Type) arg
type ToList (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Maybe a) = Apply (ToList_6989586621680261132Sym0 :: TyFun (Maybe a) [a] -> Type) arg
type HKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD Maybe (a :: Type) = Maybe a
type Fail a2
Instance details Defined in Control.Monad.Fail.Singletons type Fail a2 = Apply (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a1) -> Type) a2
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a) (arg2 :: Maybe a) = Apply (Apply (Elem_6989586621680261177Sym0 :: TyFun a (Maybe a ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldl1_6989586621680261112Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldr1_6989586621680261091Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Maybe (m a)) = Apply (Sequence_6989586621680536024Sym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) arg
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Maybe (f a)) = Apply (SequenceA_6989586621680536000Sym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) arg
type (a2 :: Maybe a1) *> (a3 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Maybe a1) *> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a1 :: k1) <$ (a2 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type (a1 :: k1) <$ (a2 :: Maybe b) = Apply (Apply (TFHelper_6989586621679378286Sym0 :: TyFun k1 (Maybe b ~> Maybe k1) -> Type) a1) a2
type (arg1 :: Maybe a) <* (arg2 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type (arg1 :: Maybe a) <* (arg2 :: Maybe b) = Apply (Apply (TFHelper_6989586621679301517Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe a) -> Type) arg1) arg2
type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a1 ~> b)) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type (a2 :: Maybe a1) >> (a3 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Maybe a1) >> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) = Apply (Apply (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a1) ((a1 ~> Maybe b) ~> Maybe b) -> Type) a2) a3
type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1)
Instance details Defined in Control.Monad.Singletons.Internal type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) = Apply (Apply (Fmap_6989586621679378274Sym0 :: TyFun (a1 ~> b) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mplus_6989586621679301587Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) = Apply (Apply (FoldMap_6989586621680261240Sym0 :: TyFun (a1 ~> k2) (Maybe a1 ~> k2) -> Type) a2) a3
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldl_6989586621680261272Sym0 :: TyFun (k2 ~> (a1 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldl'_6989586621680261069Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldr_6989586621680261256Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldr'_6989586621680261031Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) = Apply (Apply (MapM_6989586621680536010Sym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) arg1) arg2
type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) = Apply (Apply (Traverse_6989586621680543622Sym0 :: TyFun (a1 ~> f b) (Maybe a1 ~> f (Maybe b)) -> Type) a2) a3
type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) = Apply (Apply (Apply (LiftA2_6989586621679378420Sym0 :: TyFun (a1 ~> (b ~> c)) (Maybe a1 ~> (Maybe b ~> Maybe c)) -> Type) a2) a3) a4
type Apply UnconsSymbolSym0 (a6989586621679512089 :: Symbol)
Instance details Defined in GHC.TypeLits.Singletons type Apply UnconsSymbolSym0 (a6989586621679512089 :: Symbol) = UnconsSymbol a6989586621679512089
type Apply (Pure_6989586621679378397Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679378403 :: a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Pure_6989586621679378397Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679378403 :: a) = Pure_6989586621679378397 a6989586621679378403
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679028340 :: a)
Instance details Defined in Data.Singletons.Base.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679028340 :: a) = 'Just a6989586621679028340
type Apply (Let6989586621679378667LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216793775176989586621679378666 :: k1)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Let6989586621679378667LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216793775176989586621679378666 :: k1) = Let6989586621679378667L wild_69895866216793775176989586621679378666
type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type) (s6989586621680120042 :: k)
Instance details Defined in Text.Show.Singletons type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type) (s6989586621680120042 :: k) = Let6989586621680120043Scrutinee_6989586621680119971 sym6989586621680120041 s6989586621680120042
type Apply (Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a (Maybe a) -> Type) (a6989586621680261202 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261199MkJustSym1 a_69895866216802611936989586621680261198 :: TyFun a (Maybe a) -> Type) (a6989586621680261202 :: a) = Let6989586621680261199MkJust a_69895866216802611936989586621680261198 a6989586621680261202
type Apply (Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a (Maybe a) -> Type) (a6989586621680261217 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261214MkJustSym1 a_69895866216802612086989586621680261213 :: TyFun a (Maybe a) -> Type) (a6989586621680261217 :: a) = Let6989586621680261214MkJust a_69895866216802612086989586621680261213 a6989586621680261217
type Apply (Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type) (y6989586621680251455 :: k)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type) (y6989586621680251455 :: k) = Let6989586621680251456M x6989586621680251454 y6989586621680251455
type Apply (Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type) (y6989586621680251479 :: k)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type) (y6989586621680251479 :: k) = Let6989586621680251480M x6989586621680251478 y6989586621680251479
type Apply (Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251455 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251455 :: k1) = Let6989586621680251456N x6989586621680251454 y6989586621680251455
type Apply (Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251479 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680251479 :: k1) = Let6989586621680251480N x6989586621680251478 y6989586621680251479
type Apply (Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186009 :: k1)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186009 :: k1) = Lambda_6989586621680186007 a6989586621680186005 k6989586621680186006 x6989586621680186009
type Apply (Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186245 :: k1)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242 :: TyFun k1 (Maybe a) -> Type) (x6989586621680186245 :: k1) = Lambda_6989586621680186243 a6989586621680186241 k6989586621680186242 x6989586621680186245
type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym3 s6989586621680120019 p6989586621680120013 f6989586621680120014 :: TyFun k3 (Maybe (Char, Symbol)) -> Type) (a_69895866216801200046989586621680120015 :: k3)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261121MfSym3 f6989586621680261119 xs6989586621680261120 a6989586621680261122 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680261123 :: k3) = Let6989586621680261121Mf f6989586621680261119 xs6989586621680261120 a6989586621680261122 a6989586621680261123
type Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127464 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127464 :: Natural) = ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type
type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym0 :: TyFun Symbol (TyFun k (Maybe (Char, Symbol)) -> Type) -> Type) (sym6989586621680120041 :: Symbol)
Instance details Defined in Text.Show.Singletons type Apply (Let6989586621680120043Scrutinee_6989586621680119971Sym0 :: TyFun Symbol (TyFun k (Maybe (Char, Symbol)) -> Type) -> Type) (sym6989586621680120041 :: Symbol) = Let6989586621680120043Scrutinee_6989586621680119971Sym1 sym6989586621680120041 :: TyFun k (Maybe (Char, Symbol)) -> Type
type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679524064 :: a)
Instance details 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)
Instance details 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)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378286Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621679378291 :: a) = TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type
type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679765670 :: a)
Instance details 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)
Instance details Defined in Data.Maybe.Singletons type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679521908 :: b) = Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type
type Apply (Let6989586621680261199MkJustSym0 :: TyFun k (TyFun a6989586621680260385 (Maybe a6989586621680260385) -> Type) -> Type) (a_69895866216802611936989586621680261198 :: k)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251456NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680251454 :: k) = Let6989586621680251456NSym1 x6989586621680251454 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680251480NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251480NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k) = Let6989586621680251480NSym1 x6989586621680251478 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680251456MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251454 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251456MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251454 :: k1) = Let6989586621680251456MSym1 x6989586621680251454 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680251480MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k1)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680251480MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680251478 :: k1) = Let6989586621680251480MSym1 x6989586621680251478 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym0 :: TyFun Symbol (TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) -> Type) (s6989586621680120019 :: Symbol)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261272Sym1 a6989586621680261278 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680261279 :: b) = Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279
type Apply (Foldr_6989586621680261256Sym1 a6989586621680261262 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680261263 :: b)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261256Sym1 a6989586621680261262 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680261263 :: b) = Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263
type Apply (Lambda_6989586621680186007Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186005 :: k)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186007Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186005 :: k) = Lambda_6989586621680186007Sym1 a6989586621680186005 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Lambda_6989586621680186243Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186241 :: k)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186243Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680186241 :: k) = Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680261120 :: k)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261121MfSym1 f6989586621680261119 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680261120 :: k) = Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120
type Apply (Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680261099 :: k)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261100MfSym1 f6989586621680261098 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680261099 :: k) = Let6989586621680261100MfSym2 f6989586621680261098 xs6989586621680261099
type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym1 s6989586621680120019 :: TyFun k1 (TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) -> Type) (p6989586621680120013 :: k1)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261100MfSym2 f6989586621680261098 xs6989586621680261099 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680261101 :: k2) = Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101
type Apply (Let6989586621680120020Scrutinee_6989586621680119979Sym2 s6989586621680120019 p6989586621680120013 :: TyFun k2 (TyFun k3 (Maybe (Char, Symbol)) -> Type) -> Type) (f6989586621680120014 :: k2)
Instance details 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)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Just x) :: a2 -> Type) = Eval (f x)
type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) = MEmpty :: a2
type Eval (Foldr f y ('Just x) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Just x) :: a2 -> Type) = Eval (f x y)
type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) = y
type DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Rep (Maybe a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Maybe a) = D1 ('MetaData "Maybe" "GHC.Maybe" "base" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
data Sing (b :: Maybe a)
Instance details Defined in GHC.Generics data Sing (b :: Maybe a) where SNothing :: forall {a}. Sing ('Nothing :: Maybe a) SJust :: forall {a} (a1 :: a). Sing a1 -> Sing ('Just a1)
type MEmpty
Instance details Defined in Fcf.Class.Monoid type MEmpty = 'Nothing :: Maybe a
type Index (Maybe a)
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type IxValue (Maybe a)
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a
type MapOpInpHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Maybe e) = e
type MapOpResHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Maybe e) = Maybe
type AsRPC (Maybe a)
Instance details Defined in Morley.AsRPC type AsRPC (Maybe a) = Maybe (AsRPC a)
type TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type Demote (Maybe a)
Instance details Defined in Data.Singletons.Base.Instances type Demote (Maybe a) = Maybe (Demote a)
type Sing
Instance details Defined in Data.Singletons.Base.Instances type Sing = SMaybe :: Maybe a -> Type
type Mempty
Instance details Defined in Data.Monoid.Singletons type Mempty = Mempty_6989586621680170117Sym0 :: Maybe a
type Element (Maybe a)
Instance details Defined in Universum.Container.Class type Element (Maybe a) = ElementDefault (Maybe a)
type Mconcat (arg :: [Maybe a])
Instance details Defined in Data.Monoid.Singletons type Mconcat (arg :: [Maybe a]) = Apply (Mconcat_6989586621680170070Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg
type Sconcat (arg :: NonEmpty (Maybe a))
Instance details Defined in Data.Semigroup.Singletons.Internal type Sconcat (arg :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621679625012Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg
type Show_ (arg :: Maybe a)
Instance details Defined in Text.Show.Singletons type Show_ (arg :: Maybe a) = Apply (Show__6989586621680095117Sym0 :: TyFun (Maybe a) Symbol -> Type) arg
type (arg1 :: Maybe a) /= (arg2 :: Maybe a)
Instance details Defined in Data.Eq.Singletons type (arg1 :: Maybe a) /= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679133659Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (a2 :: Maybe a1) == (a3 :: Maybe a1)
Instance details Defined in Data.Eq.Singletons type (a2 :: Maybe a1) == (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Bool) -> Type) a2) a3
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Monoid.Singletons type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mappend_6989586621680170056Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (arg1 :: Maybe a) < (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Maybe a) < (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679173484Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) <= (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Maybe a) <= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679173500Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) > (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Maybe a) > (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679173516Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) >= (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Maybe a) >= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679173532Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1)
Instance details Defined in Data.Ord.Singletons type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) = Apply (Apply (Compare_6989586621679188560Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Ordering) -> Type) a2) a3
type Max (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type Max (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Max_6989586621679173548Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type Min (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type Min (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Min_6989586621679173564Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> (a3 :: Maybe a1)
Instance details Defined in Data.Semigroup.Singletons.Internal type (a2 :: Maybe a1) <> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type ShowList (arg1 :: [Maybe a]) arg2
Instance details Defined in Text.Show.Singletons type ShowList (arg1 :: [Maybe a]) arg2 = Apply (Apply (ShowList_6989586621680095125Sym0 :: TyFun [Maybe a] (Symbol ~> Symbol) -> Type) arg1) arg2
type ShowsPrec a2 (a3 :: Maybe a1) a4
Instance details Defined in Text.Show.Singletons type ShowsPrec a2 (a3 :: Maybe a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1)
Instance details Defined in Fcf.Class.Monoid type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) = a2
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524081 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524081 :: Maybe a) = IsJust a6989586621679524081
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524078 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679524078 :: Maybe a) = IsNothing a6989586621679524078
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679524074 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679524074 :: Maybe a) = FromJust a6989586621679524074
type Apply (Compare_6989586621679188560Sym1 a6989586621679188565 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679188566 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type Apply (Compare_6989586621679188560Sym1 a6989586621679188565 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679188566 :: Maybe a) = Compare_6989586621679188560 a6989586621679188565 a6989586621679188566
type Apply (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) (a6989586621679136216 :: Maybe a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136210Sym1 a6989586621679136215 :: TyFun (Maybe a) Bool -> Type) (a6989586621679136216 :: Maybe a) = TFHelper_6989586621679136210 a6989586621679136215 a6989586621679136216
type Apply (FromMaybeSym1 a6989586621679524064 :: TyFun (Maybe a) a -> Type) (a6989586621679524065 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (FromMaybeSym1 a6989586621679524064 :: TyFun (Maybe a) a -> Type) (a6989586621679524065 :: Maybe a) = FromMaybe a6989586621679524064 a6989586621679524065
type Apply (FoldMap_6989586621680261240Sym1 a6989586621680261249 :: TyFun (Maybe a) m -> Type) (a6989586621680261250 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261240Sym1 a6989586621680261249 :: TyFun (Maybe a) m -> Type) (a6989586621680261250 :: Maybe a) = FoldMap_6989586621680261240 a6989586621680261249 a6989586621680261250
type Apply (Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279 :: TyFun (Maybe a) b -> Type) (a6989586621680261280 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261272Sym2 a6989586621680261278 a6989586621680261279 :: TyFun (Maybe a) b -> Type) (a6989586621680261280 :: Maybe a) = Foldl_6989586621680261272 a6989586621680261278 a6989586621680261279 a6989586621680261280
type Apply (Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263 :: TyFun (Maybe a) b -> Type) (a6989586621680261264 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261256Sym2 a6989586621680261262 a6989586621680261263 :: TyFun (Maybe a) b -> Type) (a6989586621680261264 :: Maybe a) = Foldr_6989586621680261256 a6989586621680261262 a6989586621680261263 a6989586621680261264
type Apply (Maybe_Sym2 a6989586621679521908 a6989586621679521909 :: TyFun (Maybe a) b -> Type) (a6989586621679521910 :: Maybe a)
Instance details Defined in Data.Maybe.Singletons type Apply (Maybe_Sym2 a6989586621679521908 a6989586621679521909 :: TyFun (Maybe a) b -> Type) (a6989586621679521910 :: Maybe a) = Maybe_ a6989586621679521908 a6989586621679521909 a6989586621679521910
type ('Nothing :: Maybe a) <> (b :: Maybe a)
Instance details Defined in Fcf.Class.Monoid type ('Nothing :: Maybe a) <> (b :: Maybe a) = b
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680175058 :: First a)
Instance details Defined in Data.Monoid.Singletons type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680175058 :: First a) = GetFirst a6989586621680175058
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680175082 :: Last a)
Instance details Defined in Data.Monoid.Singletons type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680175082 :: Last a) = GetLast a6989586621680175082
type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680249487 :: MaxInternal a)
Instance details Defined in Data.Foldable.Singletons type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680249487 :: MaxInternal a) = GetMaxInternal a6989586621680249487
type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680249483 :: MinInternal a)
Instance details Defined in Data.Foldable.Singletons type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680249483 :: MinInternal a) = GetMinInternal a6989586621680249483
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680175055 :: Maybe a)
Instance details Defined in Data.Monoid.Singletons type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680175055 :: Maybe a) = 'First a6989586621680175055
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680175079 :: Maybe a)
Instance details Defined in Data.Monoid.Singletons type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680175079 :: Maybe a) = 'Last a6989586621680175079
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680249477 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680249477 :: Maybe a) = 'MaxInternal a6989586621680249477
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680249480 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680249480 :: Maybe a) = 'MinInternal a6989586621680249480
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679524059 :: Maybe a)
Instance details 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])
Instance details Defined in Data.Maybe.Singletons type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679524049 :: [Maybe a]) = CatMaybes a6989586621679524049
type Apply (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621679481551 :: [Char])
Instance details Defined in Control.Monad.Fail.Singletons type Apply (Fail_6989586621679481547Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621679481551 :: [Char]) = Fail_6989586621679481547 a6989586621679481551 :: Maybe a
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679524055 :: [a])
Instance details 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)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378658Sym1 a6989586621679378663 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679378664 :: Maybe a) = TFHelper_6989586621679378658 a6989586621679378663 a6989586621679378664
type Apply (TFHelper_6989586621679625161Sym1 a6989586621679625166 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679625167 :: Maybe a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679625161Sym1 a6989586621679625166 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679625167 :: Maybe a) = TFHelper_6989586621679625161 a6989586621679625166 a6989586621679625167
type Apply (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765964 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765964 :: [a]) = ElemIndex a6989586621679765963 a6989586621679765964
type Apply (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765946 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765946 :: [a]) = FindIndex a6989586621679765945 a6989586621679765946
type Apply (StripPrefixSym1 a6989586621679923128 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621679923129 :: [a])
Instance details 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])
Instance details Defined in Data.List.Singletons.Internal type Apply (FindSym1 a6989586621679765972 :: TyFun [a] (Maybe a) -> Type) (a6989586621679765973 :: [a]) = Find a6989586621679765972 a6989586621679765973
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680962105 :: f a)
Instance details Defined in Control.Applicative.Singletons type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680962105 :: f a) = Optional a6989586621680962105
type Apply (Fmap_6989586621679378274Sym1 a6989586621679378279 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378280 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Fmap_6989586621679378274Sym1 a6989586621679378279 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378280 :: Maybe a) = Fmap_6989586621679378274 a6989586621679378279 a6989586621679378280
type Apply (TFHelper_6989586621679378407Sym1 a6989586621679378412 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378413 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378407Sym1 a6989586621679378412 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679378413 :: Maybe a) = TFHelper_6989586621679378407 a6989586621679378412 a6989586621679378413
type Apply (TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679378292 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378286Sym1 a6989586621679378291 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679378292 :: Maybe b) = TFHelper_6989586621679378286 a6989586621679378291 a6989586621679378292
type Apply (TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378440 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378440 :: Maybe b) = TFHelper_6989586621679378434 a6989586621679378439 a6989586621679378440
type Apply (TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378592 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679378592 :: Maybe b) = TFHelper_6989586621679378582 a6989586621679378591 a6989586621679378592
type Apply (LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679765671 :: [(a, b)])
Instance details Defined in Data.List.Singletons.Internal type Apply (LookupSym1 a6989586621679765670 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679765671 :: [(a, b)]) = Lookup a6989586621679765670 a6989586621679765671
type Apply (FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680260707 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680260707 :: t a) = Find a6989586621680260706 a6989586621680260707
type Apply (Traverse_6989586621680543622Sym1 a6989586621680543627 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680543628 :: Maybe a)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543622Sym1 a6989586621680543627 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680543628 :: Maybe a) = Traverse_6989586621680543622 a6989586621680543627 a6989586621680543628
type Apply (LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679378428 :: Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679378428 :: Maybe b) = LiftA2_6989586621679378420 a6989586621679378426 a6989586621679378427 a6989586621679378428
type Apply (Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680261102 :: Maybe k3)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261100MfSym3 f6989586621680261098 xs6989586621680261099 a6989586621680261101 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680261102 :: Maybe k3) = Let6989586621680261100Mf f6989586621680261098 xs6989586621680261099 a6989586621680261101 a6989586621680261102
type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) = 'Nothing :: Maybe [a]
type Eval (Tail (_a ': as) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail (_a ': as) :: Maybe [a] -> Type) = 'Just as
type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) = 'Nothing :: Maybe [a]
type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) = Eval ((Map (Cons a2) :: Maybe [a1] -> Maybe [a1] -> Type) =<< Init (b ': as))
type Eval (Init '[a2] :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init '[a2] :: Maybe [a1] -> Type) = 'Just ('[] :: [a1])
type Eval (Head ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Eval (Last ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Eval (Head (a2 ': _as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) = 'Just a2
type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) = Eval (Last (b ': as))
type Eval (Last '[a2] :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last '[a2] :: Maybe a1 -> Type) = 'Just a2
type Apply (Compare_6989586621679188560Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679188565 :: Maybe a)
Instance details Defined in Data.Ord.Singletons type Apply (Compare_6989586621679188560Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679188565 :: Maybe a) = Compare_6989586621679188560Sym1 a6989586621679188565
type Apply (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679378663 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378658Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679378663 :: Maybe a) = TFHelper_6989586621679378658Sym1 a6989586621679378663
type Apply (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679625166 :: Maybe a)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679625161Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679625166 :: Maybe a) = TFHelper_6989586621679625161Sym1 a6989586621679625166
type Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679136215 :: Maybe a)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136210Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679136215 :: Maybe a) = TFHelper_6989586621679136210Sym1 a6989586621679136215
type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621679923128 :: [a])
Instance details 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)
Instance details Defined in Fcf.Class.Monoid type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) = 'Just (a2 <> b)
type Apply (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621679378412 :: Maybe (a ~> b))
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378407Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621679378412 :: Maybe (a ~> b)) = TFHelper_6989586621679378407Sym1 a6989586621679378412
type Apply (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621679378576 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378571Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621679378576 :: Maybe a) = TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378439 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378434Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378439 :: Maybe a) = TFHelper_6989586621679378434Sym1 a6989586621679378439 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378591 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378582Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679378591 :: Maybe a) = TFHelper_6989586621679378582Sym1 a6989586621679378591 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680127465 :: Maybe a)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680127465 :: Maybe a) = ShowsPrec_6989586621680127454Sym2 a6989586621680127464 a6989586621680127465
type Apply (LiftA2_6989586621679378420Sym1 a6989586621679378426 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621679378427 :: Maybe a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (LiftA2_6989586621679378420Sym1 a6989586621679378426 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621679378427 :: Maybe a) = LiftA2_6989586621679378420Sym2 a6989586621679378426 a6989586621679378427
type Apply (Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680261122 :: Maybe k2)
Instance details Defined in Data.Foldable.Singletons type Apply (Let6989586621680261121MfSym2 f6989586621680261119 xs6989586621680261120 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680261122 :: Maybe k2) = Let6989586621680261121MfSym3 f6989586621680261119 xs6989586621680261120 a6989586621680261122
type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) = 'Nothing :: Maybe Nat
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) = Eval (If (Eval (p a2)) (Pure ('Just 0)) ((Map ((+) 1) :: Maybe Nat -> Maybe Nat -> Type) =<< FindIndex p as))
type Eval (NumIter a s :: Maybe (k, Nat) -> Type)
Instance details Defined in Fcf.Data.List type Eval (NumIter a s :: Maybe (k, Nat) -> Type) = If (Eval (s > 0)) ('Just '(a, s - 1)) ('Nothing :: Maybe (k, Natural))
type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Eval (Find p (a2 ': as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) = Eval (If (Eval (p a2)) (Pure ('Just a2)) (Find p as))
type Eval (Lookup a as :: Maybe b -> Type)
Instance details Defined in Fcf.Data.List type Eval (Lookup a as :: Maybe b -> Type) = Eval (Map (Snd :: (k, b) -> b -> Type) (Eval (Find ((TyEq a :: k -> Bool -> Type) <=< (Fst :: (k, b) -> k -> Type)) as)))
type Eval ('Just x <\|> _1 :: Maybe a -> Type)
Instance details Defined in Morley.Util.Fcf type Eval ('Just x <\|> _1 :: Maybe a -> Type) = 'Just x
type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type)
Instance details Defined in Morley.Util.Fcf type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type) = m
type Eval (Map f ('Just a3) :: Maybe a2 -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Just a3) :: Maybe a2 -> Type) = 'Just (Eval (f a3))
type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) = 'Nothing :: Maybe b
type Apply (TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679378577 :: a ~> Maybe b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378571Sym1 a6989586621679378576 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679378577 :: a ~> Maybe b) = TFHelper_6989586621679378571 a6989586621679378576 a6989586621679378577
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool) = FindIndexSym1 a6989586621679765945
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679765972 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679765972 :: a ~> Bool) = FindSym1 a6989586621679765972
type Apply (Foldr_6989586621680261256Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261262 :: a ~> (b ~> b))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261256Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261262 :: a ~> (b ~> b)) = Foldr_6989586621680261256Sym1 a6989586621680261262
type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679524034 :: a ~> Maybe b)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680260706 :: a ~> Bool) = FindSym1 a6989586621680260706 :: TyFun (t a) (Maybe a) -> Type
type Apply (Fmap_6989586621679378274Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621679378279 :: a ~> b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Fmap_6989586621679378274Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621679378279 :: a ~> b) = Fmap_6989586621679378274Sym1 a6989586621679378279
type Apply (FoldMap_6989586621680261240Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680261249 :: a ~> m)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261240Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680261249 :: a ~> m) = FoldMap_6989586621680261240Sym1 a6989586621680261249
type Apply (Foldl_6989586621680261272Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261278 :: b ~> (a ~> b))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261272Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680261278 :: b ~> (a ~> b)) = Foldl_6989586621680261272Sym1 a6989586621680261278
type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621679766362 :: b ~> Maybe (a, b))
Instance details 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))
Instance details Defined in Control.Monad.Singletons.Internal type Apply (LiftA2_6989586621679378420Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621679378426 :: a ~> (b ~> c)) = LiftA2_6989586621679378420Sym1 a6989586621679378426
type Apply (Let6989586621679524039RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679524036 :: a ~> Maybe k1)
Instance details Defined in Data.Maybe.Singletons type Apply (Let6989586621679524039RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679524036 :: a ~> Maybe k1) = Let6989586621679524039RsSym1 f6989586621679524036 :: TyFun k (TyFun [a] [k1] -> Type) -> Type
type Apply (Maybe_Sym1 a6989586621679521908 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679521909 :: a ~> b)
Instance details 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)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543622Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621680543627 :: a ~> f b) = Traverse_6989586621680543622Sym1 a6989586621680543627
type Apply (Let6989586621680261100MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680261098 :: k2 ~> (k3 ~> k2))
Instance details 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))
Instance details 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)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186007Sym1 a6989586621680186005 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680186006 :: k1 ~> First a) = Lambda_6989586621680186007Sym2 a6989586621680186005 k6989586621680186006
type Apply (Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680186242 :: k1 ~> Last a)
Instance details Defined in Data.Monoid.Singletons type Apply (Lambda_6989586621680186243Sym1 a6989586621680186241 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680186242 :: k1 ~> Last a) = Lambda_6989586621680186243Sym2 a6989586621680186241 k6989586621680186242
type Unwrappabled (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappabled (NamedF Maybe a name) = Maybe a
type AsRPC (NamedF Maybe a name)
Instance details Defined in Morley.AsRPC type AsRPC (NamedF Maybe a name) = NamedF Maybe (AsRPC a) name
type ToT (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)

data Rational Source #

Instances

Instances details

Show Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods showsPrec :: Int -> Rational -> ShowS # show :: Rational -> String # showList :: [Rational] -> ShowS #
Eq Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods (==) :: Rational -> Rational -> Bool # (/=) :: Rational -> Rational -> Bool #
HasAnnotation Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Rational) Source # annOptions :: Maybe AnnOptions Source #
LorentzRational Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods numerator :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (a ': s) Source # denominator :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (Natural ': s) Source # deconstructRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (a ': (Natural ': s)) Source # constructRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (a ': (Natural ': s)) :-> (Rational ': s) Source # unsafePairToRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => ((a, Natural) ': s) :-> (Rational ': s) Source # uncheckedPairToRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => ((a, Natural) ': s) :-> (Rational ': s) Source # pairToRational :: forall a (s :: [Type]). (Unwrappabled Rational ~ (a, Natural), KnownValue Rational) => ((a, Natural) ': s) :-> (Maybe Rational ': s) Source # oppositeRational :: forall (s :: [Type]). (Rational ': s) :-> (Rational ': s) Source # reduce :: forall (s :: [Type]). (Rational ': s) :-> (Rational ': s) Source #
Unwrappable Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type Unwrappabled Rational Source #
IsoValue Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type ToT Rational :: T # Methods toVal :: Rational -> Value (ToT Rational) # fromVal :: Value (ToT Rational) -> Rational #
r ~ Rational => ArithOpHs Div NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
ArithOpHs Div Integer Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
type Unwrappabled Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type Unwrappabled Rational = (Integer, Natural)
type ToT Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type ToT Rational = 'TPair 'TInt 'TNat

class a ~# b => (a :: k) ~ (b :: k) infix 4 #

Lifted, homogeneous equality. By lifted, we mean that it can be bogus (deferred type error). By homogeneous, the two types a and b must have the same kinds.

Instances

Instances details

HasDict (a ~ b) (a :~: b)
Instance details Defined in Data.Constraint Methods evidence :: (a :~: b) -> Dict (a ~ b) #

data Either a b #

The Either type represents values with two possibilities: a value of type Either a b is either Left a or Right 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

Expand

The type Either String Int is the type of values which can be either a String 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
>>> s
Left "foo"
>>> let n = Right 3 :: Either String Int
>>> n
Right 3
>>> :type s
s :: Either String Int
>>> :type n
n :: 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) s
Left "foo"
>>> fmap (*2) n
Right 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)
>>> :}

>>> parseMultiple
Right 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)
>>> :}

>>> parseMultiple
Left "parse error"

Constructors

Left a
Right b

Instances

Instances details

ToJSON2 Either
Instance details 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
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d # first :: (a -> b) -> Either a c -> Either b c # second :: (b -> c) -> Either a b -> Either a c #
NFData2 Either	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () #
Hashable2 Either
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int #
(CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Either l1 r1) -> Proxy (Either l2 r2) -> () Source #
Generic1 (Either a :: Type -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (Either a) :: k -> Type # Methods from1 :: forall (a0 :: k). Either a a0 -> Rep1 (Either a) a0 # to1 :: forall (a0 :: k). Rep1 (Either a) a0 -> Either a a0 #
() :=> (Applicative (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) #
() :=> (Functor (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Functor (Either a) #
() :=> (Monad (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Monad (Either a) #
MonadError e (Either e)
Instance details Defined in Control.Monad.Error.Class Methods throwError :: e -> Either e a # catchError :: Either e a -> (e -> Either e a) -> Either e a #
IsoHKD (Either a :: Type -> Type) (b :: Type)
Instance details Defined in Data.Vinyl.XRec Associated Types type HKD (Either a) b # Methods unHKD :: HKD (Either a) b -> Either a b # toHKD :: Either a b -> HKD (Either a) b #
(Lift a, Lift b) => Lift (Either a b :: Type)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Either a b -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Either a b -> Code m (Either a b) #
ToJSON a => ToJSON1 (Either a)
Instance details 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
Instance details 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] # null :: Either a a0 -> Bool # 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 # sum :: Num a0 => Either a a0 -> a0 # product :: Num a0 => Either a a0 -> a0 #
Traversable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) # sequence :: Monad m => Either a (m a0) -> m (Either a a0) #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Functor (Either a)	Since: base-3.0
Instance details Defined in Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b # (<$) :: a0 -> Either a b -> Either a a0 #
Monad (Either e)	Since: base-4.4.0.0
Instance details Defined in Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b # (>>) :: Either e a -> Either e b -> Either e b # return :: a -> Either e a #
MonadFailure (Either a)
Instance details Defined in Basement.Monad Associated Types type Failure (Either a) # Methods mFail :: Failure (Either a) -> Either a () #
NFData a => NFData1 (Either a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a0 -> ()) -> Either a a0 -> () #
e ~ SomeException => MonadCatch (Either e)	Since: exceptions-0.8.3
Instance details Defined in Control.Monad.Catch Methods catch :: Exception e0 => Either e a -> (e0 -> Either e a) -> Either e a #
e ~ SomeException => MonadMask (Either e)	Since: exceptions-0.8.3
Instance details Defined in Control.Monad.Catch Methods mask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # uninterruptibleMask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # generalBracket :: Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c) #
e ~ SomeException => MonadThrow (Either e)
Instance details Defined in Control.Monad.Catch Methods throwM :: Exception e0 => e0 -> Either e a #
Hashable a => Hashable1 (Either a)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int #
PApplicative (Either e)
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PFunctor (Either a)
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PMonad (Either e)
Instance details Defined in Control.Monad.Singletons.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a #
SApplicative (Either e)
Instance details 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)
Instance details Defined in Control.Monad.Singletons.Internal Methods sFmap :: forall a0 b (t1 :: a0 ~> b) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: forall a0 b (t1 :: a0) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SMonad (Either e)
Instance details 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)
Instance details Defined in Data.Foldable.Singletons Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Natural # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable (Either a)
Instance details 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)
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable (Either a)
Instance details 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 #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Either a a ': s) :-> (Either a b ': s) Source #
(Structured a, Structured b) => Structured (Either a b)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Either a b) -> Structure # structureHash' :: Tagged (Either a b) MD5
(ToJSON a, ToJSON b) => ToJSON (Either a b)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Either a b -> Value # toEncoding :: Either a b -> Encoding # toJSONList :: [Either a b] -> Value # toEncodingList :: [Either a b] -> Encoding #
(Data a, Data b) => Data (Either a b)	Since: base-4.0.0.0
Instance details 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
Instance details Defined in Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
Generic (Either a b)
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
(Read a, Read b) => Read (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods readsPrec :: Int -> ReadS (Either a b) # readList :: ReadS [Either a b] # readPrec :: ReadPrec (Either a b) # readListPrec :: ReadPrec [Either a b] #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
(NFData a, NFData b) => NFData (Either a b)
Instance details Defined in Control.DeepSeq Methods rnf :: Either a b -> () #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
(Hashable a, Hashable b) => Hashable (Either a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Either a b -> Int # hash :: Either a b -> Int #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) Source # annOptions :: Maybe AnnOptions Source #
(HasRPCRepr l, HasRPCRepr r) => HasRPCRepr (Either l r)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Either l r)
PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r)
Instance details 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)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Either l r) :: T # Methods toVal :: Either l r -> Value (ToT (Either l r)) # fromVal :: Value (ToT (Either l r)) -> Either l r #
(Buildable a, Buildable b) => Buildable (Either a b)
Instance details Defined in Fmt.Buildable Methods build :: Either a b -> Doc buildList :: [Either a b] -> Doc
PEq (Either a b)
Instance details Defined in Data.Eq.Singletons Associated Types type arg == arg1 :: Bool # type arg /= arg1 :: Bool #
(SEq a, SEq b) => SEq (Either a b)
Instance details Defined in Data.Eq.Singletons Methods (%==) :: 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) #
POrd (Either a b)
Instance details Defined in Data.Ord.Singletons Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
(SOrd a, SOrd b) => SOrd (Either a b)
Instance details 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)
Instance details Defined in Data.Semigroup.Singletons.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup (Either a b)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods (%<>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: forall (t :: NonEmpty (Either a b)). Sing t -> Sing (Apply SconcatSym0 t) #
PShow (Either a b)
Instance details Defined in Text.Show.Singletons Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
(SShow a, SShow b) => SShow (Either a b)
Instance details 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)
Instance details Defined in Universum.Container.Class Associated Types type Element (Either a b) # Methods toList :: Either a b -> [Element (Either a b)] # null :: Either a b -> Bool # 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 # length :: Either a b -> Int # 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 # and :: Either a b -> Bool # or :: 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))
Instance details Defined in Data.Constraint Methods ins :: (Read a, Read b) :- Read (Either a b) #
(Show a, Show b) :=> (Show (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (Either a b) #
(Eq a, Eq b) :=> (Eq (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (Either a b) #
(Ord a, Ord b) :=> (Ord (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (Either a b) #
(SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods testCoercion :: forall (a0 :: k) (b0 :: k). SEither a0 -> SEither b0 -> Maybe (Coercion a0 b0) #
(SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods testEquality :: forall (a0 :: k) (b0 :: k). SEither a0 -> SEither b0 -> Maybe (a0 :~: b0) #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 #
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing PartitionEithersSym0 #
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing LeftsSym0 #
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing RightsSym0 #
SingI (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing LeftSym0 #
SingI (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing RightSym0 #
SuppressUnusedWarnings (TFHelper_6989586621679625174Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679189276Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621679378549Sym0 :: TyFun a (Either e a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679625183ASym0 :: TyFun k1 (Either a k1) -> Type)
Instance details 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
Instance details Defined in Lens.Micro.Internal Methods each :: Traversal (Either a a') (Either b b') a b #
SingI2 (Either_Sym2 :: (a ~> c) -> (b ~> c) -> TyFun (Either a b) c -> Type)
Instance details Defined in Data.Either.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Either_Sym2 x y) #
SingI1 (Either_Sym1 :: (a ~> c) -> TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details 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)
Instance details 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)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing Either_Sym0 #
SuppressUnusedWarnings (TFHelper_6989586621679625174Sym1 a6989586621679625179 :: TyFun (Either a b) (Either a b) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679189276Sym1 a6989586621679189281 :: TyFun (Either a b) Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378377Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym1 d) #
SuppressUnusedWarnings (Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378559Sym1 a6989586621679378564 :: TyFun (Either e a) (Either e b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym2 d1 d2) #
SuppressUnusedWarnings (Either_Sym2 a6989586621679289090 a6989586621679289091 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
(Functor f, Functor g) => Functor (Lift Either f g)
Instance details Defined in Data.Vinyl.Functor Methods fmap :: (a -> b) -> Lift Either f g a -> Lift Either f g b # (<$) :: a -> Lift Either f g b -> Lift Either f g a #
type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) = Apply (Apply (MapM_6989586621680536010Sym0 :: TyFun (a1 ~> m b) (Either a2 a1 ~> m (Either a2 b)) -> Type) arg1) arg2
type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1) = Apply (Apply (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) a3) a4
type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) = Apply (Apply (Apply (LiftA2_6989586621679301490Sym0 :: TyFun (a ~> (b ~> c)) (Either e a ~> (Either e b ~> Either e c)) -> Type) arg1) arg2) arg3
type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1)
Instance details Defined in Control.Monad.Singletons.Internal type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1) = Apply (Apply (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) a3) a4
type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1) = Apply (Apply (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> k2) (Either a2 a1 ~> k2) -> Type) a3) a4
type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl_6989586621680261054Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl'_6989586621680261069Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1) = Apply (Apply (Apply (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Either a2 a1 ~> k2)) -> Type) a3) a4) a5
type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldr'_6989586621680261031Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Rep1 (Either a :: Type -> Type)	Since: base-4.6.0.0
Instance details 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)
Instance details Defined in Control.Monad.Singletons.Internal type Pure (a :: k1) = Apply (Pure_6989586621679378549Sym0 :: TyFun k1 (Either e k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Control.Monad.Singletons.Internal type Return (arg :: a) = Apply (Return_6989586621679301562Sym0 :: TyFun a (Either e a) -> Type) arg
type HKD (Either a :: Type -> Type) (b :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD (Either a :: Type -> Type) (b :: Type) = Either a b
type Elem (arg1 :: a1) (arg2 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a1) (arg2 :: Either a2 a1) = Apply (Apply (Elem_6989586621680261177Sym0 :: TyFun a1 (Either a2 a1 ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldl1_6989586621680261112Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldr1_6989586621680261091Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type (a2 :: k1) <$ (a3 :: Either a1 b)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: k1) <$ (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621679378377Sym0 :: TyFun k1 (Either a1 b ~> Either a1 k1) -> Type) a2) a3
type Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127514 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127514 :: Natural) = ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type
type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679028412 :: a)
Instance details Defined in Data.Singletons.Base.Instances type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679028412 :: a) = 'Left a6989586621679028412 :: Either a b
type Apply (Pure_6989586621679378549Sym0 :: TyFun a (Either e a) -> Type) (a6989586621679378555 :: a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Pure_6989586621679378549Sym0 :: TyFun a (Either e a) -> Type) (a6989586621679378555 :: a) = Pure_6989586621679378549 a6989586621679378555 :: Either e a
type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679028414 :: b)
Instance details Defined in Data.Singletons.Base.Instances type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679028414 :: b) = 'Right a6989586621679028414 :: Either a b
type Apply (Let6989586621679625183ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216796248716989586621679625182 :: k1)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (Let6989586621679625183ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216796248716989586621679625182 :: k1) = Let6989586621679625183A wild_69895866216796248716989586621679625182 :: Either a k1
type Apply (TFHelper_6989586621679378377Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621679378382 :: a1)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378377Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621679378382 :: a1) = TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type
type Apply (Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680261569 :: b)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680261569 :: b) = Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type
type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type) = MEmpty :: a2
type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type) = Eval (f x)
type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type) = y
type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type) = Eval (f x y)
type Failure (Either a)
Instance details Defined in Basement.Monad type Failure (Either a) = a
type Fold (arg :: Either a m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Either a m) = Apply (Fold_6989586621680260992Sym0 :: TyFun (Either a m) m -> Type) arg
type Length (a3 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Length (a3 :: Either a1 a2) = Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) a3
type Maximum (arg :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Either a1 a2) = Apply (Maximum_6989586621680261191Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Minimum (arg :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Either a1 a2) = Apply (Minimum_6989586621680261206Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Null (a3 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Null (a3 :: Either a1 a2) = Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) a3
type Product (arg :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: Either a1 a2) = Apply (Product_6989586621680261230Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Sum (arg :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: Either a1 a2) = Apply (Sum_6989586621680261221Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type ToList (arg :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Either a1 a2) = Apply (ToList_6989586621680261132Sym0 :: TyFun (Either a1 a2) [a2] -> Type) arg
type Sequence (arg :: Either a1 (m a2))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Either a1 (m a2)) = Apply (Sequence_6989586621680536024Sym0 :: TyFun (Either a1 (m a2)) (m (Either a1 a2)) -> Type) arg
type SequenceA (arg :: Either a1 (f a2))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Either a1 (f a2)) = Apply (SequenceA_6989586621680536000Sym0 :: TyFun (Either a1 (f a2)) (f (Either a1 a2)) -> Type) arg
type (arg1 :: Either e a) *> (arg2 :: Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type (arg1 :: Either e a) *> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679301506Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (arg1 :: Either e a) <* (arg2 :: Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type (arg1 :: Either e a) <* (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679301517Sym0 :: TyFun (Either e a) (Either e b ~> Either e a) -> Type) arg1) arg2
type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1) = Apply (Apply (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a1 ~> b)) (Either e a1 ~> Either e b) -> Type) a2) a3
type (arg1 :: Either e a) >> (arg2 :: Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type (arg1 :: Either e a) >> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679301545Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b) = Apply (Apply (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a1) ((a1 ~> Either e b) ~> Either e b) -> Type) a2) a3
type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679291393 :: [Either a b])
Instance details Defined in Data.Either.Singletons type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679291393 :: [Either a b]) = Lefts a6989586621679291393
type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679291387 :: [Either a b])
Instance details Defined in Data.Either.Singletons type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679291387 :: [Either a b]) = Rights a6989586621679291387
type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679291370 :: [Either a b])
Instance details Defined in Data.Either.Singletons type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679291370 :: [Either a b]) = PartitionEithers a6989586621679291370
type Rep (Either a b)	Since: base-4.6.0.0
Instance details 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)
Instance details Defined in Morley.AsRPC type AsRPC (Either l r) = Either (AsRPC l) (AsRPC r)
type TypeDocFieldDescriptions (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Either l r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Either l r) = GValueType (GRep (Either l r))
type Demote (Either a b)
Instance details Defined in Data.Singletons.Base.Instances type Demote (Either a b) = Either (Demote a) (Demote b)
type Sing
Instance details Defined in Data.Singletons.Base.Instances type Sing = SEither :: Either a b -> Type
type Element (Either a b)
Instance details Defined in Universum.Container.Class type Element (Either a b) = ElementDefault (Either a b)
type Sconcat (arg :: NonEmpty (Either a b))
Instance details Defined in Data.Semigroup.Singletons.Internal type Sconcat (arg :: NonEmpty (Either a b)) = Apply (Sconcat_6989586621679625012Sym0 :: TyFun (NonEmpty (Either a b)) (Either a b) -> Type) arg
type Show_ (arg :: Either a b)
Instance details Defined in Text.Show.Singletons type Show_ (arg :: Either a b) = Apply (Show__6989586621680095117Sym0 :: TyFun (Either a b) Symbol -> Type) arg
type (arg1 :: Either a b) /= (arg2 :: Either a b)
Instance details Defined in Data.Eq.Singletons type (arg1 :: Either a b) /= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679133659Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (a2 :: Either a1 b) == (a3 :: Either a1 b)
Instance details Defined in Data.Eq.Singletons type (a2 :: Either a1 b) == (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Bool) -> Type) a2) a3
type (arg1 :: Either a b) < (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Either a b) < (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679173484Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) <= (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Either a b) <= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679173500Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) > (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Either a b) > (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679173516Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) >= (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type (arg1 :: Either a b) >= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679173532Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Either a1 b) (a3 :: Either a1 b)
Instance details Defined in Data.Ord.Singletons type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) = Apply (Apply (Compare_6989586621679189276Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Ordering) -> Type) a2) a3
type Max (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type Max (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Max_6989586621679173548Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type Min (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Ord.Singletons type Min (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Min_6989586621679173564Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type (a2 :: Either a1 b) <> (a3 :: Either a1 b)
Instance details Defined in Data.Semigroup.Singletons.Internal type (a2 :: Either a1 b) <> (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621679625174Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Either a1 b) -> Type) a2) a3
type ShowList (arg1 :: [Either a b]) arg2
Instance details Defined in Text.Show.Singletons type ShowList (arg1 :: [Either a b]) arg2 = Apply (Apply (ShowList_6989586621680095125Sym0 :: TyFun [Either a b] (Symbol ~> Symbol) -> Type) arg1) arg2
type ShowsPrec a2 (a3 :: Either a1 b) a4
Instance details Defined in Text.Show.Singletons type ShowsPrec a2 (a3 :: Either a1 b) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a1 b ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291365 :: Either a b)
Instance details Defined in Data.Either.Singletons type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291365 :: Either a b) = IsLeft a6989586621679291365
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291362 :: Either a b)
Instance details Defined in Data.Either.Singletons type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679291362 :: Either a b) = IsRight a6989586621679291362
type Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) (a6989586621680261580 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) (a6989586621680261580 :: Either a1 a2) = Length_6989586621680261576 a6989586621680261580
type Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680261588 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261582Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680261588 :: Either a1 a2) = Null_6989586621680261582 a6989586621680261588
type Apply (Compare_6989586621679189276Sym1 a6989586621679189281 :: TyFun (Either a b) Ordering -> Type) (a6989586621679189282 :: Either a b)
Instance details Defined in Data.Ord.Singletons type Apply (Compare_6989586621679189276Sym1 a6989586621679189281 :: TyFun (Either a b) Ordering -> Type) (a6989586621679189282 :: Either a b) = Compare_6989586621679189276 a6989586621679189281 a6989586621679189282
type Apply (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) (a6989586621679136294 :: Either a b)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136288Sym1 a6989586621679136293 :: TyFun (Either a b) Bool -> Type) (a6989586621679136294 :: Either a b) = TFHelper_6989586621679136288 a6989586621679136293 a6989586621679136294
type Apply (FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type) (a6989586621680261556 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type) (a6989586621680261556 :: Either a2 a1) = FoldMap_6989586621680261550 a6989586621680261555 a6989586621680261556
type Apply (Either_Sym2 a6989586621679289090 a6989586621679289091 :: TyFun (Either a b) c -> Type) (a6989586621679289092 :: Either a b)
Instance details Defined in Data.Either.Singletons type Apply (Either_Sym2 a6989586621679289090 a6989586621679289091 :: TyFun (Either a b) c -> Type) (a6989586621679289092 :: Either a b) = Either_ a6989586621679289090 a6989586621679289091 a6989586621679289092
type Apply (Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type) (a6989586621680261570 :: Either a2 a1)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261562Sym2 a6989586621680261568 a6989586621680261569 :: TyFun (Either a2 a1) b -> Type) (a6989586621680261570 :: Either a2 a1) = Foldr_6989586621680261562 a6989586621680261568 a6989586621680261569 a6989586621680261570
type Apply (Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680543665 :: Either a2 a1)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680543665 :: Either a2 a1) = Traverse_6989586621680543659 a6989586621680543664 a6989586621680543665
type Apply (TFHelper_6989586621679625174Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621679625179 :: Either a b)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679625174Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621679625179 :: Either a b) = TFHelper_6989586621679625174Sym1 a6989586621679625179
type Apply (Compare_6989586621679189276Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679189281 :: Either a b)
Instance details Defined in Data.Ord.Singletons type Apply (Compare_6989586621679189276Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679189281 :: Either a b) = Compare_6989586621679189276Sym1 a6989586621679189281
type Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679136293 :: Either a b)
Instance details Defined in Data.Eq.Singletons type Apply (TFHelper_6989586621679136288Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679136293 :: Either a b) = TFHelper_6989586621679136288Sym1 a6989586621679136293
type Apply (TFHelper_6989586621679625174Sym1 a6989586621679625179 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621679625180 :: Either a b)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679625174Sym1 a6989586621679625179 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621679625180 :: Either a b) = TFHelper_6989586621679625174 a6989586621679625179 a6989586621679625180
type Apply (ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680127515 :: Either a b)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680127515 :: Either a b) = ShowsPrec_6989586621680127504Sym2 a6989586621680127514 a6989586621680127515
type Apply (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621679378564 :: Either e (a ~> b))
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378559Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621679378564 :: Either e (a ~> b)) = TFHelper_6989586621679378559Sym1 a6989586621679378564
type Apply (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621679378648 :: Either e a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378643Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621679378648 :: Either e a) = TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type
type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679289090 :: a ~> c)
Instance details Defined in Data.Either.Singletons type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679289090 :: a ~> c) = Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type
type Apply (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680261568 :: a1 ~> (b ~> b))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261562Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680261568 :: a1 ~> (b ~> b)) = Foldr_6989586621680261562Sym1 a6989586621680261568 :: TyFun b (Either a2 a1 ~> b) -> Type
type Apply (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621679378365 :: a1 ~> b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Fmap_6989586621679378360Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621679378365 :: a1 ~> b) = Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type
type Apply (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680261555 :: a1 ~> m)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261550Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680261555 :: a1 ~> m) = FoldMap_6989586621680261550Sym1 a6989586621680261555 :: TyFun (Either a2 a1) m -> Type
type Apply (Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621679378366 :: Either a2 a1)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (Fmap_6989586621679378360Sym1 a6989586621679378365 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621679378366 :: Either a2 a1) = Fmap_6989586621679378360 a6989586621679378365 a6989586621679378366
type Apply (TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621679378383 :: Either a2 b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378377Sym1 a6989586621679378382 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621679378383 :: Either a2 b) = TFHelper_6989586621679378377 a6989586621679378382 a6989586621679378383
type Apply (TFHelper_6989586621679378559Sym1 a6989586621679378564 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621679378565 :: Either e a)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378559Sym1 a6989586621679378564 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621679378565 :: Either e a) = TFHelper_6989586621679378559 a6989586621679378564 a6989586621679378565
type Apply (TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621679378649 :: a ~> Either e b)
Instance details Defined in Control.Monad.Singletons.Internal type Apply (TFHelper_6989586621679378643Sym1 a6989586621679378648 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621679378649 :: a ~> Either e b) = TFHelper_6989586621679378643 a6989586621679378648 a6989586621679378649
type Apply (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621680543664 :: a1 ~> f b)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543659Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621680543664 :: a1 ~> f b) = Traverse_6989586621680543659Sym1 a6989586621680543664 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type
type Apply (Either_Sym1 a6989586621679289090 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679289091 :: b ~> c)
Instance details 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)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type) = 'Left x :: Either a2 b
type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type) = 'Right (Eval (f a3)) :: Either a2 b
type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type)
Instance details Defined in Fcf.Class.Bifunctor type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type) = 'Right (Eval (g y)) :: Either a' b2
type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type)
Instance details Defined in Fcf.Class.Bifunctor type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type) = 'Left (Eval (f x)) :: Either a2 b'

data Proxy (t :: k) #

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 a is a safer alternative to the undefined :: a idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Instances details

Generic1 (Proxy :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> Type # Methods from1 :: forall (a :: k0). Proxy a -> Rep1 Proxy a # to1 :: forall (a :: k0). Rep1 Proxy a -> Proxy a #
Representable (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep Associated Types type Rep Proxy # Methods tabulate :: (Rep Proxy -> a) -> Proxy a # index :: Proxy a -> Rep Proxy -> a #
ToJSON1 (Proxy :: Type -> Type)
Instance details 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
Instance details 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 # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Monad (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
NFData1 (Proxy :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Proxy a -> () #
Hashable1 (Proxy :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Proxy a -> Int #
PFoldable (Proxy :: Type -> Type)
Instance details Defined in Data.Foldable.Singletons Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Natural # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable (Proxy :: Type -> Type)
Instance details 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)
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable (Proxy :: Type -> Type)
Instance details 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)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Proxy a -> Value # toEncoding :: Proxy a -> Encoding # toJSONList :: [Proxy a] -> Value # toEncodingList :: [Proxy a] -> Encoding #
Data t => Data (Proxy t)	Since: base-4.7.0.0
Instance details 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
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int # inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
Semiring (Proxy a)
Instance details Defined in Data.Semiring Methods plus :: Proxy a -> Proxy a -> Proxy a # zero :: Proxy a # times :: Proxy a -> Proxy a -> Proxy a # one :: Proxy a # fromNatural :: Natural -> Proxy a #
SuppressUnusedWarnings (Product_6989586621680261677Sym0 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sum_6989586621680261671Sym0 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fold_6989586621680261600Sym0 :: TyFun (Proxy m) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680261633Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680261642Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680230948Sym0 :: TyFun a (Proxy a) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
TestCoercion (SProxy :: Proxy t -> Type)
Instance details Defined in Data.Proxy.Singletons Methods testCoercion :: forall (a :: k) (b :: k). SProxy a -> SProxy b -> Maybe (Coercion a b) #
TestEquality (SProxy :: Proxy t -> Type)
Instance details Defined in Data.Proxy.Singletons Methods testEquality :: forall (a :: k) (b :: k). SProxy a -> SProxy b -> Maybe (a :~: b) #
SuppressUnusedWarnings (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680261633Sym1 a6989586621680261638 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680261642Sym1 a6989586621680261647 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261608Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680230880Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261592Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261621Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680230880Sym1 a6989586621680230885 :: TyFun (Proxy a) (Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230955Sym1 a6989586621680230960 :: TyFun (Proxy a) (Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680261592Sym1 a6989586621680261597 :: TyFun (Proxy a) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230983Sym1 a6989586621680230988 :: TyFun (Proxy a) (Proxy a) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230604Sym1 a6989586621680230609 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680230432Sym1 a6989586621680230437 :: TyFun (Proxy s) Ordering -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680230573Sym1 a6989586621680230578 :: TyFun (Proxy s) [Proxy s] -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543684Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapM_6989586621680543699Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261621Sym1 a6989586621680261627 :: TyFun b (Proxy a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261608Sym1 a6989586621680261614 :: TyFun b (Proxy a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628 :: TyFun (Proxy a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615 :: TyFun (Proxy a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680543684Sym1 a6989586621680543689 :: TyFun (Proxy a) (f (Proxy b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapM_6989586621680543699Sym1 a6989586621680543704 :: TyFun (Proxy a) (m (Proxy b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569 :: TyFun (Proxy s) [Proxy s] -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1)
Instance details Defined in Data.Traversable.Singletons type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1) = Apply (Apply (MapM_6989586621680543699Sym0 :: TyFun (a1 ~> m b) (Proxy a1 ~> m (Proxy b)) -> Type) a2) a3
type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1) = Apply (Apply (Traverse_6989586621680543684Sym0 :: TyFun (a1 ~> f b) (Proxy a1 ~> f (Proxy b)) -> Type) a2) a3
type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Proxy a) (arg2 :: Proxy b)
Instance details Defined in Data.Proxy.Singletons type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Proxy a) (arg2 :: Proxy b) = Apply (Apply (Apply (LiftA2_6989586621679301490Sym0 :: TyFun (a ~> (b ~> c)) (Proxy a ~> (Proxy b ~> Proxy c)) -> Type) arg) arg1) arg2
type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1)
Instance details Defined in Data.Proxy.Singletons type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1) = Apply (Apply (Fmap_6989586621680230880Sym0 :: TyFun (a1 ~> b) (Proxy a1 ~> Proxy b) -> Type) a2) a3
type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1) = Apply (Apply (FoldMap_6989586621680261592Sym0 :: TyFun (a1 ~> k2) (Proxy a1 ~> k2) -> Type) a2) a3
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) = Apply (Apply (Apply (Foldl_6989586621680261621Sym0 :: TyFun (k2 ~> (a1 ~> k2)) (k2 ~> (Proxy a1 ~> k2)) -> Type) a2) a3) a4
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a) = Apply (Apply (Apply (Foldl'_6989586621680261069Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) = Apply (Apply (Apply (Foldr_6989586621680261608Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Proxy a1 ~> k2)) -> Type) a2) a3) a4
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a) = Apply (Apply (Apply (Foldr'_6989586621680261031Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) arg1) arg2) arg3
type Rep1 (Proxy :: k -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: k -> Type))
type Empty
Instance details Defined in Data.Proxy.Singletons type Empty = Empty_6989586621680230978Sym0 :: Proxy a
type Mzero
Instance details Defined in Data.Proxy.Singletons type Mzero = Mzero_6989586621679301582Sym0 :: Proxy a
type Pure (a :: k1)
Instance details Defined in Data.Proxy.Singletons type Pure (a :: k1) = Apply (Pure_6989586621680230948Sym0 :: TyFun k1 (Proxy k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Data.Proxy.Singletons type Return (arg :: a) = Apply (Return_6989586621679301562Sym0 :: TyFun a (Proxy a) -> Type) arg
type Elem (a1 :: k1) (a2 :: Proxy k1)
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: Proxy k1) = Apply (Apply (Elem_6989586621680261663Sym0 :: TyFun k1 (Proxy k1 ~> Bool) -> Type) a1) a2
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) = Apply (Apply (Foldl1_6989586621680261633Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Proxy k2 ~> k2) -> Type) a1) a2
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) = Apply (Apply (Foldr1_6989586621680261642Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Proxy k2 ~> k2) -> Type) a1) a2
type (arg :: a) <$ (arg1 :: Proxy b)
Instance details Defined in Data.Proxy.Singletons type (arg :: a) <$ (arg1 :: Proxy b) = Apply (Apply (TFHelper_6989586621679301434Sym0 :: TyFun a (Proxy b ~> Proxy a) -> Type) arg) arg1
type (a2 :: Proxy a1) <\|> (a3 :: Proxy a1)
Instance details Defined in Data.Proxy.Singletons type (a2 :: Proxy a1) <\|> (a3 :: Proxy a1) = Apply (Apply (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a1) (Proxy a1 ~> Proxy a1) -> Type) a2) a3
type Mplus (arg :: Proxy a) (arg1 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Mplus (arg :: Proxy a) (arg1 :: Proxy a) = Apply (Apply (Mplus_6989586621679301587Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) arg) arg1
type Apply (Pure_6989586621680230948Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680230952 :: a)
Instance details Defined in Data.Proxy.Singletons type Apply (Pure_6989586621680230948Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680230952 :: a) = Pure_6989586621680230948 a6989586621680230952
type Apply (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680261668 :: a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261663Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680261668 :: a) = Elem_6989586621680261663Sym1 a6989586621680261668
type Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) (a6989586621680230552 :: Natural)
Instance details Defined in Data.Proxy.Singletons type Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) (a6989586621680230552 :: Natural) = ToEnum_6989586621680230548 a6989586621680230552 :: Proxy s
type Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680230480 :: Natural)
Instance details Defined in Data.Proxy.Singletons type Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680230480 :: Natural) = ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type
type Apply (Foldl_6989586621680261621Sym1 a6989586621680261627 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261628 :: b)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261621Sym1 a6989586621680261627 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261628 :: b) = Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628
type Apply (Foldr_6989586621680261608Sym1 a6989586621680261614 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261615 :: b)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261608Sym1 a6989586621680261614 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680261615 :: b) = Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615
type Rep (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep type Rep (Proxy :: Type -> Type) = Void
type Fold (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Fold (a :: Proxy k2) = Apply (Fold_6989586621680261600Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type Length (a2 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: Proxy a1) = Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a1) Natural -> Type) a2
type Maximum (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Proxy a) = Apply (Maximum_6989586621680261191Sym0 :: TyFun (Proxy a) a -> Type) arg
type Minimum (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Proxy a) = Apply (Minimum_6989586621680261206Sym0 :: TyFun (Proxy a) a -> Type) arg
type Null (a2 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: Proxy a1) = Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a1) Bool -> Type) a2
type Product (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Product (a :: Proxy k2) = Apply (Product_6989586621680261677Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type Sum (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Sum (a :: Proxy k2) = Apply (Sum_6989586621680261671Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type ToList (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Proxy a) = Apply (ToList_6989586621680261132Sym0 :: TyFun (Proxy a) [a] -> Type) arg
type Sequence (a2 :: Proxy (m a1))
Instance details Defined in Data.Traversable.Singletons type Sequence (a2 :: Proxy (m a1)) = Apply (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a1)) (m (Proxy a1)) -> Type) a2
type SequenceA (a2 :: Proxy (f a1))
Instance details Defined in Data.Traversable.Singletons type SequenceA (a2 :: Proxy (f a1)) = Apply (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a1)) (f (Proxy a1)) -> Type) a2
type (arg :: Proxy a) *> (arg1 :: Proxy b)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy a) *> (arg1 :: Proxy b) = Apply (Apply (TFHelper_6989586621679301506Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy b) -> Type) arg) arg1
type (arg :: Proxy a) <* (arg1 :: Proxy b)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy a) <* (arg1 :: Proxy b) = Apply (Apply (TFHelper_6989586621679301517Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy a) -> Type) arg) arg1
type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1)
Instance details Defined in Data.Proxy.Singletons type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1) = Apply (Apply (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a1 ~> b)) (Proxy a1 ~> Proxy b) -> Type) a2) a3
type (arg :: Proxy a) >> (arg1 :: Proxy b)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy a) >> (arg1 :: Proxy b) = Apply (Apply (TFHelper_6989586621679301545Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy b) -> Type) arg) arg1
type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b)
Instance details Defined in Data.Proxy.Singletons type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b) = Apply (Apply (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a1) ((a1 ~> Proxy b) ~> Proxy b) -> Type) a2) a3
type Apply (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680230616 :: NonEmpty (Proxy s))
Instance details Defined in Data.Proxy.Singletons type Apply (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680230616 :: NonEmpty (Proxy s)) = Sconcat_6989586621680230612 a6989586621680230616
type Apply (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680230837 :: [Proxy s])
Instance details Defined in Data.Proxy.Singletons type Apply (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680230837 :: [Proxy s]) = Mconcat_6989586621680230833 a6989586621680230837
type Rep (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: Type -> Type))
type Demote (Proxy t)
Instance details Defined in Data.Proxy.Singletons type Demote (Proxy t) = Proxy t
type Sing
Instance details Defined in Data.Proxy.Singletons type Sing = SProxy :: Proxy t -> Type
type Mempty
Instance details Defined in Data.Proxy.Singletons type Mempty = Mempty_6989586621680230829Sym0 :: Proxy s
type MaxBound
Instance details Defined in Data.Proxy.Singletons type MaxBound = MaxBound_6989586621680230340Sym0 :: Proxy s
type MinBound
Instance details Defined in Data.Proxy.Singletons type MinBound = MinBound_6989586621680230337Sym0 :: Proxy s
type Mconcat (a :: [Proxy s])
Instance details Defined in Data.Proxy.Singletons type Mconcat (a :: [Proxy s]) = Apply (Mconcat_6989586621680230833Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) a
type Sconcat (a :: NonEmpty (Proxy s))
Instance details Defined in Data.Proxy.Singletons type Sconcat (a :: NonEmpty (Proxy s)) = Apply (Sconcat_6989586621680230612Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) a
type FromEnum (a :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type FromEnum (a :: Proxy s) = Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) a
type Pred (a :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Pred (a :: Proxy s) = Apply (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) a
type Succ (a :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Succ (a :: Proxy s) = Apply (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) a
type ToEnum a
Instance details Defined in Data.Proxy.Singletons type ToEnum a = Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) a
type Show_ (arg :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Show_ (arg :: Proxy s) = Apply (Show__6989586621680095117Sym0 :: TyFun (Proxy s) Symbol -> Type) arg
type (arg :: Proxy s) /= (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy s) /= (arg1 :: Proxy s) = Apply (Apply (TFHelper_6989586621679133659Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg) arg1
type (a1 :: Proxy s) == (a2 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (a1 :: Proxy s) == (a2 :: Proxy s) = Apply (Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) a1) a2
type Mappend (arg :: Proxy s) (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Mappend (arg :: Proxy s) (arg1 :: Proxy s) = Apply (Apply (Mappend_6989586621680170056Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg) arg1
type (arg :: Proxy s) < (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy s) < (arg1 :: Proxy s) = Apply (Apply (TFHelper_6989586621679173484Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg) arg1
type (arg :: Proxy s) <= (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy s) <= (arg1 :: Proxy s) = Apply (Apply (TFHelper_6989586621679173500Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg) arg1
type (arg :: Proxy s) > (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy s) > (arg1 :: Proxy s) = Apply (Apply (TFHelper_6989586621679173516Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg) arg1
type (arg :: Proxy s) >= (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (arg :: Proxy s) >= (arg1 :: Proxy s) = Apply (Apply (TFHelper_6989586621679173532Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg) arg1
type Compare (a1 :: Proxy s) (a2 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Compare (a1 :: Proxy s) (a2 :: Proxy s) = Apply (Apply (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) a1) a2
type Max (arg :: Proxy s) (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Max (arg :: Proxy s) (arg1 :: Proxy s) = Apply (Apply (Max_6989586621679173548Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg) arg1
type Min (arg :: Proxy s) (arg1 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Min (arg :: Proxy s) (arg1 :: Proxy s) = Apply (Apply (Min_6989586621679173564Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg) arg1
type (a1 :: Proxy s) <> (a2 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type (a1 :: Proxy s) <> (a2 :: Proxy s) = Apply (Apply (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) a1) a2
type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s) = Apply (Apply (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) a1) a2
type ShowList (arg :: [Proxy s]) arg1
Instance details Defined in Data.Proxy.Singletons type ShowList (arg :: [Proxy s]) arg1 = Apply (Apply (ShowList_6989586621680095125Sym0 :: TyFun [Proxy s] (Symbol ~> Symbol) -> Type) arg) arg1
type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s) = Apply (Apply (Apply (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) a1) a2) a3
type ShowsPrec a1 (a2 :: Proxy s) a3
Instance details Defined in Data.Proxy.Singletons type ShowsPrec a1 (a2 :: Proxy s) a3 = Apply (Apply (Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) a1) a2) a3
type Apply (Product_6989586621680261677Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261681 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Product_6989586621680261677Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261681 :: Proxy a) = Product_6989586621680261677 a6989586621680261681
type Apply (Sum_6989586621680261671Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261675 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Sum_6989586621680261671Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680261675 :: Proxy a) = Sum_6989586621680261671 a6989586621680261675
type Apply (Fold_6989586621680261600Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680261604 :: Proxy m)
Instance details Defined in Data.Foldable.Singletons type Apply (Fold_6989586621680261600Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680261604 :: Proxy m) = Fold_6989586621680261600 a6989586621680261604
type Apply (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261669 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Elem_6989586621680261663Sym1 a6989586621680261668 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261669 :: Proxy a) = Elem_6989586621680261663 a6989586621680261668 a6989586621680261669
type Apply (Foldl1_6989586621680261633Sym1 a6989586621680261638 :: TyFun (Proxy a) a -> Type) (a6989586621680261639 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl1_6989586621680261633Sym1 a6989586621680261638 :: TyFun (Proxy a) a -> Type) (a6989586621680261639 :: Proxy a) = Foldl1_6989586621680261633 a6989586621680261638 a6989586621680261639
type Apply (Foldr1_6989586621680261642Sym1 a6989586621680261647 :: TyFun (Proxy a) a -> Type) (a6989586621680261648 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr1_6989586621680261642Sym1 a6989586621680261647 :: TyFun (Proxy a) a -> Type) (a6989586621680261648 :: Proxy a) = Foldr1_6989586621680261642 a6989586621680261647 a6989586621680261648
type Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) (a6989586621680261654 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) (a6989586621680261654 :: Proxy a) = Length_6989586621680261650 a6989586621680261654
type Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261660 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Null_6989586621680261656Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680261660 :: Proxy a) = Null_6989586621680261656 a6989586621680261660
type Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) (a6989586621680230546 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) (a6989586621680230546 :: Proxy s) = FromEnum_6989586621680230542 a6989586621680230546
type Apply (FoldMap_6989586621680261592Sym1 a6989586621680261597 :: TyFun (Proxy a) m -> Type) (a6989586621680261598 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261592Sym1 a6989586621680261597 :: TyFun (Proxy a) m -> Type) (a6989586621680261598 :: Proxy a) = FoldMap_6989586621680261592 a6989586621680261597 a6989586621680261598
type Apply (Compare_6989586621680230432Sym1 a6989586621680230437 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680230438 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (Compare_6989586621680230432Sym1 a6989586621680230437 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680230438 :: Proxy s) = Compare_6989586621680230432 a6989586621680230437 a6989586621680230438
type Apply (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) (a6989586621680230375 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230369Sym1 a6989586621680230374 :: TyFun (Proxy s) Bool -> Type) (a6989586621680230375 :: Proxy s) = TFHelper_6989586621680230369 a6989586621680230374 a6989586621680230375
type Apply (Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628 :: TyFun (Proxy a) b -> Type) (a6989586621680261629 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261621Sym2 a6989586621680261627 a6989586621680261628 :: TyFun (Proxy a) b -> Type) (a6989586621680261629 :: Proxy a) = Foldl_6989586621680261621 a6989586621680261627 a6989586621680261628 a6989586621680261629
type Apply (Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615 :: TyFun (Proxy a) b -> Type) (a6989586621680261616 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261608Sym2 a6989586621680261614 a6989586621680261615 :: TyFun (Proxy a) b -> Type) (a6989586621680261616 :: Proxy a) = Foldr_6989586621680261608 a6989586621680261614 a6989586621680261615 a6989586621680261616
type Apply (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621680543696 :: Proxy (f a))
Instance details Defined in Data.Traversable.Singletons type Apply (SequenceA_6989586621680543692Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621680543696 :: Proxy (f a)) = SequenceA_6989586621680543692 a6989586621680543696
type Apply (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621680543711 :: Proxy (m a))
Instance details Defined in Data.Traversable.Singletons type Apply (Sequence_6989586621680543707Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621680543711 :: Proxy (m a)) = Sequence_6989586621680543707 a6989586621680543711
type Apply (EnumFromTo_6989586621680230573Sym1 a6989586621680230578 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230579 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (EnumFromTo_6989586621680230573Sym1 a6989586621680230578 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230579 :: Proxy s) = EnumFromTo_6989586621680230573 a6989586621680230578 a6989586621680230579
type Apply (Traverse_6989586621680543684Sym1 a6989586621680543689 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621680543690 :: Proxy a)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543684Sym1 a6989586621680543689 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621680543690 :: Proxy a) = Traverse_6989586621680543684 a6989586621680543689 a6989586621680543690
type Apply (MapM_6989586621680543699Sym1 a6989586621680543704 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621680543705 :: Proxy a)
Instance details Defined in Data.Traversable.Singletons type Apply (MapM_6989586621680543699Sym1 a6989586621680543704 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621680543705 :: Proxy a) = MapM_6989586621680543699 a6989586621680543704 a6989586621680543705
type Apply (EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230570 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680230570 :: Proxy s) = EnumFromThenTo_6989586621680230562 a6989586621680230568 a6989586621680230569 a6989586621680230570
type Apply (Foldl1_6989586621680261633Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261638 :: a ~> (a ~> a))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl1_6989586621680261633Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261638 :: a ~> (a ~> a)) = Foldl1_6989586621680261633Sym1 a6989586621680261638
type Apply (Foldr1_6989586621680261642Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261647 :: a ~> (a ~> a))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr1_6989586621680261642Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680261647 :: a ~> (a ~> a)) = Foldr1_6989586621680261642Sym1 a6989586621680261647
type Apply (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680230960 :: Proxy (a ~> b))
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230955Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680230960 :: Proxy (a ~> b)) = TFHelper_6989586621680230955Sym1 a6989586621680230960
type Apply (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680230988 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230983Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680230988 :: Proxy a) = TFHelper_6989586621680230983Sym1 a6989586621680230988
type Apply (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230540 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (Pred_6989586621680230536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230540 :: Proxy s) = Pred_6989586621680230536 a6989586621680230540
type Apply (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230534 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (Succ_6989586621680230530Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230534 :: Proxy s) = Succ_6989586621680230530 a6989586621680230534
type Apply (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680230609 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230604Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680230609 :: Proxy s) = TFHelper_6989586621680230604Sym1 a6989586621680230609
type Apply (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680230437 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (Compare_6989586621680230432Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680230437 :: Proxy s) = Compare_6989586621680230432Sym1 a6989586621680230437
type Apply (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680230568 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (EnumFromThenTo_6989586621680230562Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680230568 :: Proxy s) = EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568
type Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680230374 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230369Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680230374 :: Proxy s) = TFHelper_6989586621680230369Sym1 a6989586621680230374
type Apply (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230578 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (EnumFromTo_6989586621680230573Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230578 :: Proxy s) = EnumFromTo_6989586621680230573Sym1 a6989586621680230578
type Apply (Foldr_6989586621680261608Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261614 :: a ~> (b ~> b))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr_6989586621680261608Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261614 :: a ~> (b ~> b)) = Foldr_6989586621680261608Sym1 a6989586621680261614
type Apply (Fmap_6989586621680230880Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680230885 :: a ~> b)
Instance details Defined in Data.Proxy.Singletons type Apply (Fmap_6989586621680230880Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680230885 :: a ~> b) = Fmap_6989586621680230880Sym1 a6989586621680230885
type Apply (FoldMap_6989586621680261592Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680261597 :: a ~> m)
Instance details Defined in Data.Foldable.Singletons type Apply (FoldMap_6989586621680261592Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680261597 :: a ~> m) = FoldMap_6989586621680261592Sym1 a6989586621680261597
type Apply (Foldl_6989586621680261621Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261627 :: b ~> (a ~> b))
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl_6989586621680261621Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680261627 :: b ~> (a ~> b)) = Foldl_6989586621680261621Sym1 a6989586621680261627
type Apply (Fmap_6989586621680230880Sym1 a6989586621680230885 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230886 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Apply (Fmap_6989586621680230880Sym1 a6989586621680230885 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230886 :: Proxy a) = Fmap_6989586621680230880 a6989586621680230885 a6989586621680230886
type Apply (TFHelper_6989586621680230955Sym1 a6989586621680230960 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230961 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230955Sym1 a6989586621680230960 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680230961 :: Proxy a) = TFHelper_6989586621680230955 a6989586621680230960 a6989586621680230961
type Apply (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680231029 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680231024Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680231029 :: Proxy a) = TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type
type Apply (TFHelper_6989586621680230983Sym1 a6989586621680230988 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680230989 :: Proxy a)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230983Sym1 a6989586621680230988 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680230989 :: Proxy a) = TFHelper_6989586621680230983 a6989586621680230988 a6989586621680230989
type Apply (TFHelper_6989586621680230604Sym1 a6989586621680230609 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230610 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680230604Sym1 a6989586621680230609 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680230610 :: Proxy s) = TFHelper_6989586621680230604 a6989586621680230609 a6989586621680230610
type Apply (EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230569 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (EnumFromThenTo_6989586621680230562Sym1 a6989586621680230568 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680230569 :: Proxy s) = EnumFromThenTo_6989586621680230562Sym2 a6989586621680230568 a6989586621680230569
type Apply (ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680230481 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680230481 :: Proxy s) = ShowsPrec_6989586621680230472Sym2 a6989586621680230480 a6989586621680230481
type Apply (Traverse_6989586621680543684Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621680543689 :: a ~> f b)
Instance details Defined in Data.Traversable.Singletons type Apply (Traverse_6989586621680543684Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621680543689 :: a ~> f b) = Traverse_6989586621680543684Sym1 a6989586621680543689
type Apply (MapM_6989586621680543699Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621680543704 :: a ~> m b)
Instance details Defined in Data.Traversable.Singletons type Apply (MapM_6989586621680543699Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621680543704 :: a ~> m b) = MapM_6989586621680543699Sym1 a6989586621680543704
type Apply (TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680231030 :: a ~> Proxy b)
Instance details Defined in Data.Proxy.Singletons type Apply (TFHelper_6989586621680231024Sym1 a6989586621680231029 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680231030 :: a ~> Proxy b) = TFHelper_6989586621680231024 a6989586621680231029 a6989586621680231030

data Set a #

A set of values a.

Instances

Instances details

ToJSON1 Set
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Set a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Set a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Set a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Set a] -> Encoding #
Foldable Set	Folds in order of increasing key.
Instance details Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # toList :: Set a -> [a] # null :: Set a -> Bool # length :: Set a -> Int # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # minimum :: Ord a => Set a -> a # sum :: Num a => Set a -> a # product :: Num a => Set a -> a #
Eq1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool #
Ord1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering #
Show1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS #
Hashable1 Set	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Set a -> Int #
(NiceComparable a, NiceComparable b) => LorentzFunctor Set a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Set a ': s) :-> (Set b ': s) Source #
CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Set k1) -> Proxy (Set k2) -> () Source #
Lift a => Lift (Set a :: Type)	Since: containers-0.6.6
Instance details Defined in Data.Set.Internal Methods lift :: Quote m => Set a -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Set a -> Code m (Set a) #
Structured k => Structured (Set k)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Set k) -> Structure # structureHash' :: Tagged (Set k) MD5
ToJSON a => ToJSON (Set a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Set a -> Value # toEncoding :: Set a -> Encoding # toJSONList :: [Set a] -> Value # toEncodingList :: [Set a] -> Encoding #
(Data a, Ord a) => Data (Set a)
Instance details Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # toConstr :: Set a -> Constr # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Ord a => IsList (Set a)	Since: containers-0.5.6.2
Instance details Defined in Data.Set.Internal Associated Types type Item (Set a) # Methods fromList :: [Item (Set a)] -> Set a # fromListN :: Int -> [Item (Set a)] -> Set a # toList :: Set a -> [Item (Set a)] #
(Read a, Ord a) => Read (Set a)
Instance details Defined in Data.Set.Internal Methods readsPrec :: Int -> ReadS (Set a) # readList :: ReadS [Set a] # readPrec :: ReadPrec (Set a) # readListPrec :: ReadPrec [Set a] #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
NFData a => NFData (Set a)
Instance details Defined in Data.Set.Internal Methods rnf :: Set a -> () #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
Ord a => Ord (Set a)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
Hashable v => Hashable (Set v)	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Set v -> Int # hash :: Set v -> Int #
Ord k => At (Set k)
Instance details Defined in Control.Lens.At Methods at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) #
Ord a => Contains (Set a)
Instance details Defined in Control.Lens.At Methods contains :: Index (Set a) -> Lens' (Set a) Bool #
Ord k => Ixed (Set k)
Instance details Defined in Control.Lens.At Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #
Ord a => Wrapped (Set a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Set a) # Methods _Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #
KnownIsoT v => HasAnnotation (Set v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) Source # annOptions :: Maybe AnnOptions Source #
LDefault (Set k) Source #
Instance details Defined in Lorentz.Default Methods ldef :: Set k Source # lIsDef :: forall (s :: [Type]). (Set k ': s) :-> (Bool ': s) Source #
NiceComparable e => IterOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) Source #
NiceComparable e => MemOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) Source #
SizeOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic
NiceComparable a => UpdOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Set a) Source # type UpdOpParamsHs (Set a) Source #
HasRPCRepr (Set a)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Set a)
PolyCTypeHasDocC '[a] => TypeHasDoc (Set a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Set a) :: FieldDescriptions # Methods typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Set a) #
(Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
Buildable v => Buildable (Set v)
Instance details Defined in Fmt.Buildable Methods build :: Set v -> Doc buildList :: [Set v] -> Doc
(Ord a, Monoid a) => Semiring (Set a)	The multiplication laws are satisfied for any underlying `Monoid`, so we require a `Monoid` constraint instead of a `Semiring` constraint since `times` can use the context of either.
Instance details Defined in Data.Semiring Methods plus :: Set a -> Set a -> Set a # zero :: Set a # times :: Set a -> Set a -> Set a # one :: Set a # fromNatural :: Natural -> Set a #
Ord v => Container (Set v)
Instance details Defined in Universum.Container.Class Associated Types type Element (Set v) # Methods toList :: Set v -> [Element (Set v)] # null :: Set v -> Bool # foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b # foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b # length :: Set v -> Int # elem :: Element (Set v) -> Set v -> Bool # foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m # fold :: Set v -> Element (Set v) # foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b # notElem :: Element (Set v) -> Set v -> Bool # all :: (Element (Set v) -> Bool) -> Set v -> Bool # any :: (Element (Set v) -> Bool) -> Set v -> Bool # and :: Set v -> Bool # or :: Set v -> Bool # find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v)) # safeHead :: Set v -> Maybe (Element (Set v)) # safeMaximum :: Set v -> Maybe (Element (Set v)) # safeMinimum :: Set v -> Maybe (Element (Set v)) # safeFoldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # safeFoldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) #
Ord a => FromList (Set a)
Instance details Defined in Universum.Container.Class Associated Types type ListElement (Set a) # type FromListC (Set a) # Methods fromList :: [ListElement (Set a)] -> Set a #
One (Set v)
Instance details Defined in Universum.Container.Class Associated Types type OneItem (Set v) # Methods one :: OneItem (Set v) -> Set v #
(t ~ Set a', Ord a) => Rewrapped (Set a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source #
type Item (Set a)
Instance details Defined in Data.Set.Internal type Item (Set a) = a
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type Unwrapped (Set a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Set a) = [a]
type IterOpElHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Set e) = e
type MemOpKeyHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) = e
type UpdOpKeyHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) = a
type UpdOpParamsHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Set a) = Bool
type AsRPC (Set a)
Instance details Defined in Morley.AsRPC type AsRPC (Set a) = Set a
type TypeDocFieldDescriptions (Set a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type Element (Set v)
Instance details Defined in Universum.Container.Class type Element (Set v) = ElementDefault (Set v)
type FromListC (Set a)
Instance details Defined in Universum.Container.Class type FromListC (Set a) = ()
type ListElement (Set a)
Instance details Defined in Universum.Container.Class type ListElement (Set a) = Item (Set a)
type OneItem (Set v)
Instance details Defined in Universum.Container.Class type OneItem (Set v) = v

data Map k a #

A Map from keys k to values a.

The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.

Instances

Instances details

Bifoldable Map	Since: containers-0.6.3.1
Instance details Defined in Data.Map.Internal Methods bifold :: Monoid m => Map m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Map a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Map a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Map a b -> c #
Eq2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Map a c -> Map b d -> Bool #
Ord2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Map a c -> Map b d -> Ordering #
Show2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS #
Hashable2 Map	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Map a b -> Int #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Map k1 v1) -> Proxy (Map k2 v2) -> () Source #
(Lift k, Lift a) => Lift (Map k a :: Type)	Since: containers-0.6.6
Instance details Defined in Data.Map.Internal Methods lift :: Quote m => Map k a -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Map k a -> Code m (Map k a) #
ToJSONKey k => ToJSON1 (Map k)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Map k a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Map k a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Map k a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Map k a] -> Encoding #
Foldable (Map k)	Folds in order of increasing key.
Instance details Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # toList :: Map k a -> [a] # null :: Map k a -> Bool # length :: Map k a -> Int # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # sum :: Num a => Map k a -> a # product :: Num a => Map k a -> a #
Eq k => Eq1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool #
Ord k => Ord1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering #
(Ord k, Read k) => Read1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Map k a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Map k a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Map k a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Map k a] #
Show k => Show1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS #
Traversable (Map k)	Traverses in order of increasing key.
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) # sequence :: Monad m => Map k (m a) -> m (Map k a) #
Functor (Map k)
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b # (<$) :: a -> Map k b -> Map k a #
Hashable k => Hashable1 (Map k)	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Map k a -> Int #
NiceComparable k => LorentzFunctor (Map k) a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Map k a ': s) :-> (Map k b ': s) Source #
(Structured k, Structured v) => Structured (Map k v)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Map k v) -> Structure # structureHash' :: Tagged (Map k v) MD5
(ToJSON v, ToJSONKey k) => ToJSON (Map k v)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Map k v -> Value # toEncoding :: Map k v -> Encoding # toJSONList :: [Map k v] -> Value # toEncodingList :: [Map k v] -> Encoding #
(Data k, Data a, Ord k) => Data (Map k a)
Instance details Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
Ord k => IsList (Map k v)	Since: containers-0.5.6.2
Instance details Defined in Data.Map.Internal Associated Types type Item (Map k v) # Methods fromList :: [Item (Map k v)] -> Map k v # fromListN :: Int -> [Item (Map k v)] -> Map k v # toList :: Map k v -> [Item (Map k v)] #
(Ord k, Read k, Read e) => Read (Map k e)
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS (Map k e) # readList :: ReadS [Map k e] # readPrec :: ReadPrec (Map k e) # readListPrec :: ReadPrec [Map k e] #
(Show k, Show a) => Show (Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS # show :: Map k a -> String # showList :: [Map k a] -> ShowS #
(NFData k, NFData a) => NFData (Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: Map k a -> () #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
(Ord k, Ord v) => Ord (Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
(Hashable k, Hashable v) => Hashable (Map k v)	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Map k v -> Int # hash :: Map k v -> Int #
Ord k => At (Map k a)
Instance details Defined in Control.Lens.At Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) #
Ord k => Ixed (Map k a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #
Ord k => Wrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Map k a) # Methods _Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) Source # annOptions :: Maybe AnnOptions Source #
LDefault (Map k v) Source #
Instance details Defined in Lorentz.Default Methods ldef :: Map k v Source # lIsDef :: forall (s :: [Type]). (Map k v ': s) :-> (Bool ': s) Source #
NiceComparable k => GetOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (Map k v) Source # type GetOpValHs (Map k v) Source #
NiceComparable k => IterOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) Source #
NiceComparable k => MapOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Map k v) Source # type MapOpResHs (Map k v) :: Type -> Type Source #
NiceComparable k => MemOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) Source #
SizeOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic
NiceComparable k => UpdOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Map k v) Source # type UpdOpParamsHs (Map k v) Source #
HasRPCRepr v => HasRPCRepr (Map k v)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Map k v)
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Map k v) :: FieldDescriptions # Methods typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
ToBigMap (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToBigMapKey (Map k v) type ToBigMapValue (Map k v) Methods mkBigMap :: Map k v -> BigMap (ToBigMapKey (Map k v)) (ToBigMapValue (Map k v)) #
(Buildable k, Buildable v) => Buildable (Map k v)
Instance details Defined in Fmt.Buildable Methods build :: Map k v -> Doc buildList :: [Map k v] -> Doc
(Ord k, Monoid k, Semiring v) => Semiring (Map k v)	The multiplication laws are satisfied for any underlying `Monoid` as the key type, so we require a `Monoid` constraint instead of a `Semiring` constraint since `times` can use the context of either.
Instance details Defined in Data.Semiring Methods plus :: Map k v -> Map k v -> Map k v # zero :: Map k v # times :: Map k v -> Map k v -> Map k v # one :: Map k v # fromNatural :: Natural -> Map k v #
Container (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type Element (Map k v) # Methods toList :: Map k v -> [Element (Map k v)] # null :: Map k v -> Bool # foldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldl :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # foldl' :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # length :: Map k v -> Int # elem :: Element (Map k v) -> Map k v -> Bool # foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # fold :: Map k v -> Element (Map k v) # foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # notElem :: Element (Map k v) -> Map k v -> Bool # all :: (Element (Map k v) -> Bool) -> Map k v -> Bool # any :: (Element (Map k v) -> Bool) -> Map k v -> Bool # and :: Map k v -> Bool # or :: Map k v -> Bool # find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v)) # safeHead :: Map k v -> Maybe (Element (Map k v)) # safeMaximum :: Map k v -> Maybe (Element (Map k v)) # safeMinimum :: Map k v -> Maybe (Element (Map k v)) # safeFoldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # safeFoldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) #
Ord k => FromList (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type ListElement (Map k v) # type FromListC (Map k v) # Methods fromList :: [ListElement (Map k v)] -> Map k v #
One (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type OneItem (Map k v) # Methods one :: OneItem (Map k v) -> Map k v #
ToPairs (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type Key (Map k v) # type Val (Map k v) # Methods toPairs :: Map k v -> [(Key (Map k v), Val (Map k v))] # keys :: Map k v -> [Key (Map k v)] # elems :: Map k v -> [Val (Map k v)] #
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source #
type Item (Map k v)
Instance details Defined in Data.Map.Internal type Item (Map k v) = (k, v)
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type Unwrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Map k a) = [(k, a)]
type GetOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) = k
type GetOpValHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (Map k v) = v
type IterOpElHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) = (k, v)
type MapOpInpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) = (k, v)
type MapOpResHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Map k v) = Map k
type MemOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) = k
type UpdOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) = k
type UpdOpParamsHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Map k v) = Maybe v
type AsRPC (Map k v)
Instance details Defined in Morley.AsRPC type AsRPC (Map k v) = Map k (AsRPC v)
type TypeDocFieldDescriptions (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToBigMapKey (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapKey (Map k v) = k
type ToBigMapValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapValue (Map k v) = v
type ToT (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type Element (Map k v)
Instance details Defined in Universum.Container.Class type Element (Map k v) = ElementDefault (Map k v)
type FromListC (Map k v)
Instance details Defined in Universum.Container.Class type FromListC (Map k v) = ()
type Key (Map k v)
Instance details Defined in Universum.Container.Class type Key (Map k v) = k
type ListElement (Map k v)
Instance details Defined in Universum.Container.Class type ListElement (Map k v) = Item (Map k v)
type OneItem (Map k v)
Instance details Defined in Universum.Container.Class type OneItem (Map k v) = (k, v)
type Val (Map k v)
Instance details Defined in Universum.Container.Class type Val (Map k v) = v

type ($) (f :: k1 -> k) (a :: k1) = f a infixr 2 #

Infix application.

f :: Either String $ Maybe Int
=
f :: Either String (Maybe Int)

data Natural #

Natural number

Invariant: numbers <= 0xffffffffffffffff use the NS constructor

Instances

Instances details

FromJSON TezosNat
Instance details Defined in Morley.Micheline.Json Methods parseJSON :: Value -> Parser TezosNat # parseJSONList :: Value -> Parser [TezosNat] #
ToJSON TezosNat
Instance details Defined in Morley.Micheline.Json Methods toJSON :: TezosNat -> Value # toEncoding :: TezosNat -> Encoding # toJSONList :: [TezosNat] -> Value # toEncodingList :: [TezosNat] -> Encoding #
ToJSON Natural
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Natural -> Value # toEncoding :: Natural -> Encoding # toJSONList :: [Natural] -> Value # toEncodingList :: [Natural] -> Encoding #
ToJSONKey Natural
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Natural # toJSONKeyList :: ToJSONKeyFunction [Natural] #
Data Natural	Since: base-4.8.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Natural -> c Natural # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Natural # toConstr :: Natural -> Constr # dataTypeOf :: Natural -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Natural) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Natural) # gmapT :: (forall b. Data b => b -> b) -> Natural -> Natural # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQ :: (forall d. Data d => d -> u) -> Natural -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Natural -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural #
Enum Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Enum Methods succ :: Natural -> Natural # pred :: Natural -> Natural # toEnum :: Int -> Natural # fromEnum :: Natural -> Int # enumFrom :: Natural -> [Natural] # enumFromThen :: Natural -> Natural -> [Natural] # enumFromTo :: Natural -> Natural -> [Natural] # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] #
Num Natural	Note that `Natural`'s `Num` instance isn't a ring: no element but 0 has an additive inverse. It is a semiring though. Since: base-4.8.0.0
Instance details Defined in GHC.Num Methods (+) :: Natural -> Natural -> Natural # (-) :: Natural -> Natural -> Natural # (*) :: Natural -> Natural -> Natural # negate :: Natural -> Natural # abs :: Natural -> Natural # signum :: Natural -> Natural # fromInteger :: Integer -> Natural #
Read Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Natural # readList :: ReadS [Natural] # readPrec :: ReadPrec Natural # readListPrec :: ReadPrec [Natural] #
Integral Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods quot :: Natural -> Natural -> Natural # rem :: Natural -> Natural -> Natural # div :: Natural -> Natural -> Natural # mod :: Natural -> Natural -> Natural # quotRem :: Natural -> Natural -> (Natural, Natural) # divMod :: Natural -> Natural -> (Natural, Natural) # toInteger :: Natural -> Integer #
Real Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods toRational :: Natural -> Rational #
Show Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Natural -> ShowS # show :: Natural -> String # showList :: [Natural] -> ShowS #
Subtractive Natural
Instance details Defined in Basement.Numerical.Subtractive Associated Types type Difference Natural # Methods (-) :: Natural -> Natural -> Difference Natural #
NFData Natural	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Natural -> () #
Eq Natural
Instance details Defined in GHC.Num.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
Ord Natural
Instance details Defined in GHC.Num.Natural Methods compare :: Natural -> Natural -> Ordering # (<) :: Natural -> Natural -> Bool # (<=) :: Natural -> Natural -> Bool # (>) :: Natural -> Natural -> Bool # (>=) :: Natural -> Natural -> Bool # max :: Natural -> Natural -> Natural # min :: Natural -> Natural -> Natural #
Hashable Natural
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Natural -> Int # hash :: Natural -> Int #
HasAnnotation Natural Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural) Source # annOptions :: Maybe AnnOptions Source #
ToBytesArithOpHs Natural Source #
Instance details Defined in Lorentz.Arith Methods evalToBytesOpHs :: forall bs (s :: [Type]). BytesLike bs => (Natural ': s) :-> (bs ': s) Source #
ToIntegerArithOpHs Natural Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (Natural ': s) :-> (Integer ': s) Source #
LDefault Natural Source #
Instance details Defined in Lorentz.Default Methods ldef :: Natural Source # lIsDef :: forall (s :: [Type]). (Natural ': s) :-> (Bool ': s) Source #
NonZero Natural Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s) Source #
HasRPCRepr Natural
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Natural
TypeHasDoc Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Natural :: FieldDescriptions # Methods typeDocName :: Proxy Natural -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Natural -> WithinParens -> Markdown # typeDocDependencies :: Proxy Natural -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Natural # typeDocMichelsonRep :: TypeDocMichelsonRep Natural #
IsoValue Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
HasCLReader Natural
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Natural getMetavar :: String
Buildable TezosNat
Instance details Defined in Morley.Micheline.Json Methods build :: TezosNat -> Doc buildList :: [TezosNat] -> Doc
Buildable Natural
Instance details Defined in Fmt.Buildable Methods build :: Natural -> Doc buildList :: [Natural] -> Doc
FormatAsHex Natural
Instance details Defined in Fmt.Buildable Methods hexF :: Natural -> Doc
Pretty Natural
Instance details Defined in Prettyprinter.Internal Methods pretty :: Natural -> Doc ann # prettyList :: [Natural] -> Doc ann #
UniformRange Natural
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Natural, Natural) -> g -> m Natural #
Semiring Natural
Instance details Defined in Data.Semiring Methods plus :: Natural -> Natural -> Natural # zero :: Natural # times :: Natural -> Natural -> Natural # one :: Natural # fromNatural :: Natural -> Natural #
PEnum Natural
Instance details Defined in Data.Singletons.Base.Enum Associated Types type Succ arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Natural # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
SEnum Natural
Instance details Defined in Data.Singletons.Base.Enum Methods sSucc :: forall (t :: Natural). Sing t -> Sing (Apply SuccSym0 t) # sPred :: forall (t :: Natural). Sing t -> Sing (Apply PredSym0 t) # sToEnum :: forall (t :: Natural). Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: forall (t :: Natural). Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: forall (t1 :: Natural) (t2 :: Natural) (t3 :: Natural). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) #
PNum Natural
Instance details Defined in GHC.Num.Singletons Associated Types type arg + arg1 :: a # type arg - arg1 :: a # type arg * arg1 :: a # type Negate arg :: a # type Abs arg :: a # type Signum arg :: a # type FromInteger arg :: a #
SNum Natural
Instance details Defined in GHC.Num.Singletons Methods (%+) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (+@#@$) t1) t2) # (%-) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (-@#@$) t1) t2) # (%) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (@#@$) t1) t2) # sNegate :: forall (t :: Natural). Sing t -> Sing (Apply NegateSym0 t) # sAbs :: forall (t :: Natural). Sing t -> Sing (Apply AbsSym0 t) # sSignum :: forall (t :: Natural). Sing t -> Sing (Apply SignumSym0 t) # sFromInteger :: forall (t :: Natural). Sing t -> Sing (Apply FromIntegerSym0 t) #
PShow Natural
Instance details Defined in Text.Show.Singletons Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow Natural
Instance details Defined in Text.Show.Singletons Methods sShowsPrec :: forall (t1 :: Natural) (t2 :: Natural) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Natural). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Natural]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
KnownNat n => HasResolution (n :: Nat)	For example, `Fixed 1000` will give you a `Fixed` with a resolution of 1000.
Instance details Defined in Data.Fixed Methods resolution :: p n -> Integer #
UnaryArithOpHs Eq' Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Eq' Natural ': s) Source #
UnaryArithOpHs Ge Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Ge Natural ': s) Source #
UnaryArithOpHs Gt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Gt Natural ': s) Source #
UnaryArithOpHs Le Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Le Natural ': s) Source #
UnaryArithOpHs Lt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Lt Natural ': s) Source #
UnaryArithOpHs Neg Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neg Natural ': s) Source #
UnaryArithOpHs Neq Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neq Natural ': s) Source #
UnaryArithOpHs Not Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Not Natural ': s) Source #
FromExp x Natural
Instance details Defined in Morley.Micheline.Class Methods fromExp :: Exp x -> Either (FromExpError x) Natural
Lift Natural
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Natural -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Natural -> Code m Natural #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
r ~ NRational => ArithOpHs Div NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Add Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Mutez, Mutez) => ArithOpHs EDiv Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Natural, Natural) => ArithOpHs EDiv Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsl ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsl Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsr ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsr Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Natural Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Natural Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Mul Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Or Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Xor Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (NFixed (b r)) ': s) Source #
ArithOpHs Div Natural Natural (Maybe NRational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe NRational ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (NFixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
SingI2 EfdtNatDnSym2
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (EfdtNatDnSym2 x y) #
SingI2 EfdtNatSym2
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (EfdtNatSym2 x y) #
SingI2 EfdtNatUpSym2
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (EfdtNatUpSym2 x y) #
SShow a => SingI2 (ShowsPrecSym2 :: Natural -> a -> TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ShowsPrecSym2 x y) #
() :=> (Bits Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Natural #
() :=> (Enum Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Natural #
() :=> (Num Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Natural #
() :=> (Read Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Read Natural #
() :=> (Integral Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Natural #
() :=> (Real Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Real Natural #
() :=> (Show Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Natural #
() :=> (Eq Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Natural #
() :=> (Ord Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Natural #
SingI1 EfdtNatDnSym1
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatDnSym1 x) #
SingI1 EfdtNatSym1
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatSym1 x) #
SingI1 EfdtNatUpSym1
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatUpSym1 x) #
SingI1 EftNatSym1
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EftNatSym1 x) #
SingI1 DivSym1
Instance details Defined in GHC.TypeLits.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (DivSym1 x) #
SingI1 ModSym1
Instance details Defined in GHC.TypeLits.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ModSym1 x) #
SingI1 (^@#@$$)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing ((^@#@$$) x) #
r ~ Fixed p => ArithOpHs Add (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
SingI d => SingI1 (EfdtNatDnSym2 d :: Natural -> TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatDnSym2 d x) #
SingI d => SingI1 (EfdtNatSym2 d :: Natural -> TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatSym2 d x) #
SingI d => SingI1 (EfdtNatUpSym2 d :: Natural -> TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods liftSing :: forall (x :: k1). Sing x -> Sing (EfdtNatUpSym2 d x) #
SingI1 (SplitAtSym1 :: Natural -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (SplitAtSym1 x) #
SingI1 (ListsplitAtSym1 :: Natural -> TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListsplitAtSym1 x) #
SingI1 (DropSym1 :: Natural -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (DropSym1 x) #
SingI1 (TakeSym1 :: Natural -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (TakeSym1 x) #
SingI1 (ListdropSym1 :: Natural -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListdropSym1 x) #
SingI1 (ListtakeSym1 :: Natural -> TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListtakeSym1 x) #
SShow a => SingI1 (ShowsPrecSym1 :: Natural -> TyFun a (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ShowsPrecSym1 x) #
SingI1 (ReplicateSym1 :: Natural -> TyFun a [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (ReplicateSym1 x) #
SingI1 ((<=?@#@$$) :: Natural -> TyFun Natural Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing ((<=?@#@$$) x) #
SEq a => SingI1 (ElemIndexSym1 :: a -> TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (ElemIndexSym1 x) #
SEq a => SingI1 (ElemIndicesSym1 :: a -> TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (ElemIndicesSym1 x) #
SApplicative m => SingI1 (ReplicateM_Sym1 :: Natural -> TyFun (m a) (m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ReplicateM_Sym1 x) #
SApplicative m => SingI1 (ReplicateMSym1 :: Natural -> TyFun (m a) (m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods liftSing :: forall (x :: k1). Sing x -> Sing (ReplicateMSym1 x) #
SingI1 ((!!@#@$$) :: [a] -> TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing ((!!@#@$$) x) #
SingI1 (ListindexSym1 :: [a] -> TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods liftSing :: forall (x :: k1). Sing x -> Sing (ListindexSym1 x) #
SingI EfdtNatDnSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatDnSym0 #
SingI EfdtNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatSym0 #
SingI EfdtNatUpSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatUpSym0 #
SingI EftNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EftNatSym0 #
SingI DivSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing DivSym0 #
SingI ModSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing ModSym0 #
SingI (^@#@$)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing (^@#@$) #
SingI Log2Sym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing Log2Sym0 #
SingI NatToCharSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing NatToCharSym0 #
SingI CharToNatSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing CharToNatSym0 #
SuppressUnusedWarnings KnownNatSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679583917Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679583901Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680647397Sym0
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680647421Sym0
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680127614Sym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680127586Sym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EfdtNatDnSym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EfdtNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EfdtNatUpSym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EnumFromThenTo_6989586621679555158Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings DivSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ModSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings QuotSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings RemSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (^@#@$)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings DivModSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings QuotRemSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EftNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings EnumFromTo_6989586621679555142Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680127424Sym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680127564Sym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsCharPrecSym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsNatSym0
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679555134Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Pred_6989586621679555120Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Succ_6989586621679555113Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679555127Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Log2Sym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679583924Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679583880Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679555177Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings NatToCharSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679583934Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679583893Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679555186Sym0
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings CharToNatSym0
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndicesSym0 #
SingI d => SingI (EfdtNatDnSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatDnSym1 d) #
SingI d => SingI (EfdtNatSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatSym1 d) #
SingI d => SingI (EfdtNatUpSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatUpSym1 d) #
SingI (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SplitAtSym0 #
SingI (ListsplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListsplitAtSym0 #
SingI (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropSym0 #
SingI (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TakeSym0 #
SingI (ListdropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListdropSym0 #
SingI (ListtakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtakeSym0 #
SShow a => SingI (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowsPrecSym0 #
SingI (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ReplicateSym0 #
SingI d => SingI (EftNatSym1 d :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EftNatSym1 d) #
SEnum a => SingI (ToEnumSym0 :: TyFun Natural a -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing ToEnumSym0 #
SNum a => SingI (FromIntegerSym0 :: TyFun Natural a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing FromIntegerSym0 #
SingI ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (!!@#@$) #
SingI (ListindexSym0 :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListindexSym0 #
SingI (LengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing LengthSym0 #
SingI (ListlengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListlengthSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndexSym0 #
SEq a => SingI (ElemIndicesSym0 :: TyFun a ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndicesSym0 #
SEnum a => SingI (FromEnumSym0 :: TyFun a Natural -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing FromEnumSym0 #
SingI ((<=?@#@$) :: TyFun Natural (Natural ~> Bool) -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing (<=?@#@$) #
SingI x => SingI (DivSym1 x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing (DivSym1 x) #
SingI x => SingI (ModSym1 x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing (ModSym1 x) #
SingI x => SingI ((^@#@$$) x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((^@#@$$) x) #
SuppressUnusedWarnings (FromEnum_6989586621680458803Sym0 :: TyFun (Identity a) Natural -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680460396Sym0 :: TyFun (Identity a) Natural -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680669674Sym0 :: TyFun (First a) Natural -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680669882Sym0 :: TyFun (Last a) Natural -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680669145Sym0 :: TyFun (Max a) Natural -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680668172Sym0 :: TyFun (Min a) Natural -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680670051Sym0 :: TyFun (WrappedMonoid a) Natural -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261803Sym0 :: TyFun (Dual a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680262153Sym0 :: TyFun (Product a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261978Sym0 :: TyFun (Sum a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621680459017Sym0 :: TyFun Natural (Identity a) -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680458796Sym0 :: TyFun Natural (Identity a) -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621679533971Sym0 :: TyFun Natural (Down a) -> Type)
Instance details Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680669665Sym0 :: TyFun Natural (First a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680669873Sym0 :: TyFun Natural (Last a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621680669298Sym0 :: TyFun Natural (Max a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680669136Sym0 :: TyFun Natural (Max a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621680668529Sym0 :: TyFun Natural (Min a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680668163Sym0 :: TyFun Natural (Min a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680670042Sym0 :: TyFun Natural (WrappedMonoid a) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621679666504Sym0 :: TyFun Natural (Product a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621679666375Sym0 :: TyFun Natural (Sum a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680459070Sym0 :: TyFun Natural (Identity a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680180948Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680180996Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647556Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647583Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647529Sym0 :: TyFun Natural (Max a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647502Sym0 :: TyFun Natural (Min a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647610Sym0 :: TyFun Natural (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647373Sym0 :: TyFun Natural (Dual a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647475Sym0 :: TyFun Natural (Product a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680647448Sym0 :: TyFun Natural (Sum a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127540Sym0 :: TyFun Natural (NonEmpty a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatDnSym1 a6989586621679554927 :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatSym1 a6989586621679555001 :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatUpSym1 a6989586621679554964 :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621679555158Sym1 a6989586621679555170 :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095137Sym0 :: TyFun Natural ([a] ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListsplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095105Sym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DivSym1 a6989586621679509056 :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ModSym1 a6989586621679509551 :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (QuotSym1 a6989586621679510194 :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RemSym1 a6989586621679510183 :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((^@#@$$) a6989586621679490915 :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DivModSym1 a6989586621679510212 :: TyFun Natural (Natural, Natural) -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (QuotRemSym1 a6989586621679510205 :: TyFun Natural (Natural, Natural) -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EftNatSym1 a6989586621679555019 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621679555142Sym1 a6989586621679555151 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnumSym0 :: TyFun Natural a -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromIntegerSym0 :: TyFun Natural a -> Type)
Instance details Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListindexSym0 :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261394Sym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListlengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndicesSym0 :: TyFun a ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnumSym0 :: TyFun a Natural -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SApplicative m => SingI (ReplicateM_Sym0 :: TyFun Natural (m a ~> m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ReplicateM_Sym0 #
SApplicative m => SingI (ReplicateMSym0 :: TyFun Natural (m a ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ReplicateMSym0 #
(SingI d1, SingI d2) => SingI (EfdtNatDnSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatDnSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (EfdtNatSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (EfdtNatUpSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatUpSym2 d1 d2) #
SingI d => SingI ((!!@#@$$) d :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ((!!@#@$$) d) #
SingI d => SingI (ListindexSym1 d :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListindexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndicesSym1 d :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndicesSym1 d) #
SingI d => SingI (FindIndicesSym1 d :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndicesSym1 d) #
SingI x => SingI ((<=?@#@$$) x :: TyFun Natural Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SuppressUnusedWarnings (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680669533Sym0 :: TyFun Natural (Arg a b ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095155Sym0 :: TyFun Natural ((a, b) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ReplicateM_Sym0 :: TyFun Natural (m a ~> m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ReplicateMSym0 :: TyFun Natural (m a ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatDnSym2 a6989586621679554927 a6989586621679554928 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatSym2 a6989586621679555001 a6989586621679555002 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EfdtNatUpSym2 a6989586621679554964 a6989586621679554965 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621679555158Sym2 a6989586621679555170 a6989586621679555171 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((!!@#@$$) a6989586621679765587 :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListindexSym1 a6989586621680071766 :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndicesSym1 a6989586621679765954 :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym1 a6989586621679765922 :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SingI1 (FindIndexSym1 :: (a ~> Bool) -> TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindIndexSym1 x) #
SingI1 (FindIndicesSym1 :: (a ~> Bool) -> TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods liftSing :: forall (x :: k1). Sing x -> Sing (FindIndicesSym1 x) #
SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing LengthSym0 #
SuppressUnusedWarnings (FromEnum_6989586621680494037Sym0 :: TyFun (Const a b) Natural -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621680494127Sym0 :: TyFun Natural (Const a b) -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680494030Sym0 :: TyFun Natural (Const a b) -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680494147Sym0 :: TyFun Natural (Const a b ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095170Sym0 :: TyFun Natural ((a, b, c) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993175LoopSym0 :: TyFun k (TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993193LoopSym0 :: TyFun k (TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765926BuildListSym0 :: TyFun k1 (TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680261158Sym0 :: TyFun (t a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095186Sym0 :: TyFun Natural ((a, b, c, d) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765926BuildListSym1 p6989586621679765924 :: TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993175LoopSym1 cnt06989586621680993173 :: TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993193LoopSym1 cnt06989586621680993191 :: TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095203Sym0 :: TyFun Natural ((a, b, c, d, e) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765926BuildListSym2 p6989586621679765924 xs6989586621679765925 :: TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993175LoopSym2 cnt06989586621680993173 f6989586621680993174 :: TyFun Natural (m6989586621680992814 ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680993193LoopSym2 cnt06989586621680993191 f6989586621680993192 :: TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095221Sym0 :: TyFun Natural ((a, b, c, d, e, f) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679765926BuildListSym3 p6989586621679765924 xs6989586621679765925 a6989586621679765927 :: TyFun [b6989586621679762292] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680095240Sym0 :: TyFun Natural ((a, b, c, d, e, f, g) ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () #
type Difference Natural
Instance details Defined in Basement.Numerical.Subtractive type Difference Natural = Maybe Natural
type IntBaseType Natural
Instance details Defined in Data.IntCast type IntBaseType Natural = 'BigWordTag
type AsRPC Natural
Instance details Defined in Morley.AsRPC type AsRPC Natural = Natural
type TypeDocFieldDescriptions Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type PrettyShow Natural
Instance details Defined in Morley.Prelude.Show type PrettyShow Natural = ()
type Demote Natural
Instance details Defined in GHC.TypeLits.Singletons.Internal type Demote Natural = Natural
type Sing
Instance details Defined in GHC.TypeLits.Singletons.Internal type Sing = SNat
type UnaryArithResHs Eq' Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Natural = Bool
type UnaryArithResHs Ge Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Natural = Bool
type UnaryArithResHs Gt Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Natural = Bool
type UnaryArithResHs Le Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Natural = Bool
type UnaryArithResHs Lt Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Natural = Bool
type UnaryArithResHs Neg Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Neq Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Natural = Bool
type UnaryArithResHs Not Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer
type FromEnum (a :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type FromEnum (a :: Natural) = Apply FromEnum_6989586621679555134Sym0 a
type Pred (a :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Pred (a :: Natural) = Apply Pred_6989586621679555120Sym0 a
type Succ (a :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Succ (a :: Natural) = Apply Succ_6989586621679555113Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Base.Enum type ToEnum a = Apply ToEnum_6989586621679555127Sym0 a
type Abs (a :: Natural)
Instance details Defined in GHC.Num.Singletons type Abs (a :: Natural) = a
type FromInteger a
Instance details Defined in GHC.Num.Singletons type FromInteger a = a
type Negate (a :: Natural)
Instance details Defined in GHC.Num.Singletons type Negate (a :: Natural) = Error "Cannot negate a natural number" :: Natural
type Signum (a :: Natural)
Instance details Defined in GHC.Num.Singletons type Signum (a :: Natural) = SignumNat a
type Show_ (arg :: Natural)
Instance details Defined in Text.Show.Singletons type Show_ (arg :: Natural) = Apply (Show__6989586621680095117Sym0 :: TyFun Natural Symbol -> Type) arg
type Compare (a :: Natural) (b :: Natural)
Instance details Defined in Data.Type.Ord type Compare (a :: Natural) (b :: Natural) = CmpNat a b
type (arg :: Natural) /= (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (arg :: Natural) /= (arg1 :: Natural) = Apply (Apply (TFHelper_6989586621679133659Sym0 :: TyFun Natural (Natural ~> Bool) -> Type) arg) arg1
type (x :: Natural) == (y :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (x :: Natural) == (y :: Natural) = DefaultEq x y
type (arg :: Natural) < (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (arg :: Natural) < (arg1 :: Natural) = Apply (Apply (TFHelper_6989586621679173484Sym0 :: TyFun Natural (Natural ~> Bool) -> Type) arg) arg1
type (arg :: Natural) <= (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (arg :: Natural) <= (arg1 :: Natural) = Apply (Apply (TFHelper_6989586621679173500Sym0 :: TyFun Natural (Natural ~> Bool) -> Type) arg) arg1
type (arg :: Natural) > (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (arg :: Natural) > (arg1 :: Natural) = Apply (Apply (TFHelper_6989586621679173516Sym0 :: TyFun Natural (Natural ~> Bool) -> Type) arg) arg1
type (arg :: Natural) >= (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type (arg :: Natural) >= (arg1 :: Natural) = Apply (Apply (TFHelper_6989586621679173532Sym0 :: TyFun Natural (Natural ~> Bool) -> Type) arg) arg1
type Compare (a :: Natural) (b :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Compare (a :: Natural) (b :: Natural) = CmpNat a b
type Max (arg :: Natural) (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Max (arg :: Natural) (arg1 :: Natural) = Apply (Apply (Max_6989586621679173548Sym0 :: TyFun Natural (Natural ~> Natural) -> Type) arg) arg1
type Min (arg :: Natural) (arg1 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Min (arg :: Natural) (arg1 :: Natural) = Apply (Apply (Min_6989586621679173564Sym0 :: TyFun Natural (Natural ~> Natural) -> Type) arg) arg1
type EnumFromTo (a1 :: Natural) (a2 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type EnumFromTo (a1 :: Natural) (a2 :: Natural) = Apply (Apply EnumFromTo_6989586621679555142Sym0 a1) a2
type (a :: Natural) * (b :: Natural)
Instance details Defined in GHC.Num.Singletons type (a :: Natural) * (b :: Natural) = a * b
type (a :: Natural) + (b :: Natural)
Instance details Defined in GHC.Num.Singletons type (a :: Natural) + (b :: Natural) = a + b
type (a :: Natural) - (b :: Natural)
Instance details Defined in GHC.Num.Singletons type (a :: Natural) - (b :: Natural) = a - b
type ShowList (arg1 :: [Natural]) arg2
Instance details Defined in Text.Show.Singletons type ShowList (arg1 :: [Natural]) arg2 = Apply (Apply (ShowList_6989586621680095125Sym0 :: TyFun [Natural] (Symbol ~> Symbol) -> Type) arg1) arg2
type Apply KnownNatSym0 (a6989586621679508167 :: Nat)
Instance details Defined in GHC.TypeLits.Singletons type Apply KnownNatSym0 (a6989586621679508167 :: Nat) = KnownNat a6989586621679508167
type Apply FromEnum_6989586621679583917Sym0 (a6989586621679583921 :: Ordering)
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679583917Sym0 (a6989586621679583921 :: Ordering) = FromEnum_6989586621679583917 a6989586621679583921
type Apply ToEnum_6989586621679583901Sym0 (a6989586621679583905 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679583901Sym0 (a6989586621679583905 :: Natural) = ToEnum_6989586621679583901 a6989586621679583905
type Apply FromEnum_6989586621679555134Sym0 (a6989586621679555138 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679555134Sym0 (a6989586621679555138 :: Natural) = FromEnum_6989586621679555134 a6989586621679555138
type Apply Pred_6989586621679555120Sym0 (a6989586621679555124 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply Pred_6989586621679555120Sym0 (a6989586621679555124 :: Natural) = Pred_6989586621679555120 a6989586621679555124
type Apply Succ_6989586621679555113Sym0 (a6989586621679555117 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply Succ_6989586621679555113Sym0 (a6989586621679555117 :: Natural) = Succ_6989586621679555113 a6989586621679555117
type Apply ToEnum_6989586621679555127Sym0 (a6989586621679555131 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679555127Sym0 (a6989586621679555131 :: Natural) = ToEnum_6989586621679555127 a6989586621679555131
type Apply Log2Sym0 (a6989586621679508793 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply Log2Sym0 (a6989586621679508793 :: Natural) = Log2 a6989586621679508793
type Apply ToEnum_6989586621679583924Sym0 (a6989586621679583928 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679583924Sym0 (a6989586621679583928 :: Natural) = ToEnum_6989586621679583924 a6989586621679583928
type Apply ToEnum_6989586621679583880Sym0 (a6989586621679583884 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679583880Sym0 (a6989586621679583884 :: Natural) = ToEnum_6989586621679583880 a6989586621679583884
type Apply ToEnum_6989586621679555177Sym0 (a6989586621679555183 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply ToEnum_6989586621679555177Sym0 (a6989586621679555183 :: Natural) = ToEnum_6989586621679555177 a6989586621679555183
type Apply NatToCharSym0 (a6989586621679512602 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply NatToCharSym0 (a6989586621679512602 :: Natural) = NatToChar a6989586621679512602
type Apply FromEnum_6989586621679583934Sym0 (a6989586621679583938 :: ())
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679583934Sym0 (a6989586621679583938 :: ()) = FromEnum_6989586621679583934 a6989586621679583938
type Apply FromEnum_6989586621679583893Sym0 (a6989586621679583897 :: Bool)
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679583893Sym0 (a6989586621679583897 :: Bool) = FromEnum_6989586621679583893 a6989586621679583897
type Apply FromEnum_6989586621679555186Sym0 (a6989586621679555192 :: Char)
Instance details Defined in Data.Singletons.Base.Enum type Apply FromEnum_6989586621679555186Sym0 (a6989586621679555192 :: Char) = FromEnum_6989586621679555186 a6989586621679555192
type Apply CharToNatSym0 (a6989586621679512343 :: Char)
Instance details Defined in GHC.TypeLits.Singletons type Apply CharToNatSym0 (a6989586621679512343 :: Char) = CharToNat a6989586621679512343
type EnumFromThenTo (a1 :: Natural) (a2 :: Natural) (a3 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type EnumFromThenTo (a1 :: Natural) (a2 :: Natural) (a3 :: Natural) = Apply (Apply (Apply EnumFromThenTo_6989586621679555158Sym0 a1) a2) a3
type ShowsPrec _1 (n :: Natural) x
Instance details Defined in Text.Show.Singletons type ShowsPrec _1 (n :: Natural) x = ShowsNat n x
type Apply (DivSym1 a6989586621679509056 :: TyFun Natural Natural -> Type) (a6989586621679509057 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (DivSym1 a6989586621679509056 :: TyFun Natural Natural -> Type) (a6989586621679509057 :: Natural) = Div a6989586621679509056 a6989586621679509057
type Apply (ModSym1 a6989586621679509551 :: TyFun Natural Natural -> Type) (a6989586621679509552 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (ModSym1 a6989586621679509551 :: TyFun Natural Natural -> Type) (a6989586621679509552 :: Natural) = Mod a6989586621679509551 a6989586621679509552
type Apply (QuotSym1 a6989586621679510194 :: TyFun Natural Natural -> Type) (a6989586621679510195 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (QuotSym1 a6989586621679510194 :: TyFun Natural Natural -> Type) (a6989586621679510195 :: Natural) = Quot a6989586621679510194 a6989586621679510195
type Apply (RemSym1 a6989586621679510183 :: TyFun Natural Natural -> Type) (a6989586621679510184 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (RemSym1 a6989586621679510183 :: TyFun Natural Natural -> Type) (a6989586621679510184 :: Natural) = Rem a6989586621679510183 a6989586621679510184
type Apply ((^@#@$$) a6989586621679490915 :: TyFun Natural Natural -> Type) (a6989586621679490916 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Apply ((^@#@$$) a6989586621679490915 :: TyFun Natural Natural -> Type) (a6989586621679490916 :: Natural) = a6989586621679490915 ^ a6989586621679490916
type Apply (ToEnumSym0 :: TyFun Natural k2 -> Type) (a6989586621679555048 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (ToEnumSym0 :: TyFun Natural k2 -> Type) (a6989586621679555048 :: Natural) = ToEnum a6989586621679555048 :: k2
type Apply (FromIntegerSym0 :: TyFun Natural k2 -> Type) (a6989586621679533897 :: Natural)
Instance details Defined in GHC.Num.Singletons type Apply (FromIntegerSym0 :: TyFun Natural k2 -> Type) (a6989586621679533897 :: Natural) = FromInteger a6989586621679533897 :: k2
type Apply (FromEnumSym0 :: TyFun a Natural -> Type) (a6989586621679555051 :: a)
Instance details Defined in Data.Singletons.Base.Enum type Apply (FromEnumSym0 :: TyFun a Natural -> Type) (a6989586621679555051 :: a) = FromEnum a6989586621679555051
type Apply ((!!@#@$$) a6989586621679765587 :: TyFun Natural a -> Type) (a6989586621679765588 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply ((!!@#@$$) a6989586621679765587 :: TyFun Natural a -> Type) (a6989586621679765588 :: Natural) = a6989586621679765587 !! a6989586621679765588
type Apply (ListindexSym1 a6989586621680071766 :: TyFun Natural a -> Type) (a6989586621680071767 :: Natural)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListindexSym1 a6989586621680071766 :: TyFun Natural a -> Type) (a6989586621680071767 :: Natural) = Listindex a6989586621680071766 a6989586621680071767
type Apply (FromInteger_6989586621680459017Sym0 :: TyFun Natural (Identity a) -> Type) (a6989586621680459021 :: Natural)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (FromInteger_6989586621680459017Sym0 :: TyFun Natural (Identity a) -> Type) (a6989586621680459021 :: Natural) = FromInteger_6989586621680459017 a6989586621680459021 :: Identity a
type Apply (ToEnum_6989586621680458796Sym0 :: TyFun Natural (Identity a) -> Type) (a6989586621680458800 :: Natural)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (ToEnum_6989586621680458796Sym0 :: TyFun Natural (Identity a) -> Type) (a6989586621680458800 :: Natural) = ToEnum_6989586621680458796 a6989586621680458800 :: Identity a
type Apply (FromInteger_6989586621679533971Sym0 :: TyFun Natural (Down a) -> Type) (a6989586621679533975 :: Natural)
Instance details Defined in GHC.Num.Singletons type Apply (FromInteger_6989586621679533971Sym0 :: TyFun Natural (Down a) -> Type) (a6989586621679533975 :: Natural) = FromInteger_6989586621679533971 a6989586621679533975 :: Down a
type Apply (ToEnum_6989586621680669665Sym0 :: TyFun Natural (First a) -> Type) (a6989586621680669671 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680669665Sym0 :: TyFun Natural (First a) -> Type) (a6989586621680669671 :: Natural) = ToEnum_6989586621680669665 a6989586621680669671 :: First a
type Apply (ToEnum_6989586621680669873Sym0 :: TyFun Natural (Last a) -> Type) (a6989586621680669879 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680669873Sym0 :: TyFun Natural (Last a) -> Type) (a6989586621680669879 :: Natural) = ToEnum_6989586621680669873 a6989586621680669879 :: Last a
type Apply (FromInteger_6989586621680669298Sym0 :: TyFun Natural (Max a) -> Type) (a6989586621680669304 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromInteger_6989586621680669298Sym0 :: TyFun Natural (Max a) -> Type) (a6989586621680669304 :: Natural) = FromInteger_6989586621680669298 a6989586621680669304 :: Max a
type Apply (ToEnum_6989586621680669136Sym0 :: TyFun Natural (Max a) -> Type) (a6989586621680669142 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680669136Sym0 :: TyFun Natural (Max a) -> Type) (a6989586621680669142 :: Natural) = ToEnum_6989586621680669136 a6989586621680669142 :: Max a
type Apply (FromInteger_6989586621680668529Sym0 :: TyFun Natural (Min a) -> Type) (a6989586621680668535 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromInteger_6989586621680668529Sym0 :: TyFun Natural (Min a) -> Type) (a6989586621680668535 :: Natural) = FromInteger_6989586621680668529 a6989586621680668535 :: Min a
type Apply (ToEnum_6989586621680668163Sym0 :: TyFun Natural (Min a) -> Type) (a6989586621680668169 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680668163Sym0 :: TyFun Natural (Min a) -> Type) (a6989586621680668169 :: Natural) = ToEnum_6989586621680668163 a6989586621680668169 :: Min a
type Apply (ToEnum_6989586621680670042Sym0 :: TyFun Natural (WrappedMonoid a) -> Type) (a6989586621680670048 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680670042Sym0 :: TyFun Natural (WrappedMonoid a) -> Type) (a6989586621680670048 :: Natural) = ToEnum_6989586621680670042 a6989586621680670048 :: WrappedMonoid a
type Apply (FromInteger_6989586621679666504Sym0 :: TyFun Natural (Product a) -> Type) (a6989586621679666508 :: Natural)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (FromInteger_6989586621679666504Sym0 :: TyFun Natural (Product a) -> Type) (a6989586621679666508 :: Natural) = FromInteger_6989586621679666504 a6989586621679666508 :: Product a
type Apply (FromInteger_6989586621679666375Sym0 :: TyFun Natural (Sum a) -> Type) (a6989586621679666379 :: Natural)
Instance details Defined in Data.Semigroup.Singletons.Internal type Apply (FromInteger_6989586621679666375Sym0 :: TyFun Natural (Sum a) -> Type) (a6989586621679666379 :: Natural) = FromInteger_6989586621679666375 a6989586621679666379 :: Sum a
type Apply (EftNatSym1 a6989586621679555019 :: TyFun Natural [Natural] -> Type) (a6989586621679555020 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EftNatSym1 a6989586621679555019 :: TyFun Natural [Natural] -> Type) (a6989586621679555020 :: Natural) = EftNat a6989586621679555019 a6989586621679555020
type Apply (EnumFromTo_6989586621679555142Sym1 a6989586621679555151 :: TyFun Natural [Natural] -> Type) (a6989586621679555152 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EnumFromTo_6989586621679555142Sym1 a6989586621679555151 :: TyFun Natural [Natural] -> Type) (a6989586621679555152 :: Natural) = EnumFromTo_6989586621679555142 a6989586621679555151 a6989586621679555152
type Apply (EfdtNatDnSym2 a6989586621679554927 a6989586621679554928 :: TyFun Natural [Natural] -> Type) (a6989586621679554929 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatDnSym2 a6989586621679554927 a6989586621679554928 :: TyFun Natural [Natural] -> Type) (a6989586621679554929 :: Natural) = EfdtNatDn a6989586621679554927 a6989586621679554928 a6989586621679554929
type Apply (EfdtNatSym2 a6989586621679555001 a6989586621679555002 :: TyFun Natural [Natural] -> Type) (a6989586621679555003 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatSym2 a6989586621679555001 a6989586621679555002 :: TyFun Natural [Natural] -> Type) (a6989586621679555003 :: Natural) = EfdtNat a6989586621679555001 a6989586621679555002 a6989586621679555003
type Apply (EfdtNatUpSym2 a6989586621679554964 a6989586621679554965 :: TyFun Natural [Natural] -> Type) (a6989586621679554966 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatUpSym2 a6989586621679554964 a6989586621679554965 :: TyFun Natural [Natural] -> Type) (a6989586621679554966 :: Natural) = EfdtNatUp a6989586621679554964 a6989586621679554965 a6989586621679554966
type Apply (EnumFromThenTo_6989586621679555158Sym2 a6989586621679555170 a6989586621679555171 :: TyFun Natural [Natural] -> Type) (a6989586621679555172 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EnumFromThenTo_6989586621679555158Sym2 a6989586621679555170 a6989586621679555171 :: TyFun Natural [Natural] -> Type) (a6989586621679555172 :: Natural) = EnumFromThenTo_6989586621679555158 a6989586621679555170 a6989586621679555171 a6989586621679555172
type Apply (Let6989586621680993175LoopSym2 cnt06989586621680993173 f6989586621680993174 :: TyFun Natural (m ()) -> Type) (a6989586621680993176 :: Natural)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993175LoopSym2 cnt06989586621680993173 f6989586621680993174 :: TyFun Natural (m ()) -> Type) (a6989586621680993176 :: Natural) = Let6989586621680993175Loop cnt06989586621680993173 f6989586621680993174 a6989586621680993176
type Apply (Let6989586621680993193LoopSym2 cnt06989586621680993191 f6989586621680993192 :: TyFun Natural (m [a]) -> Type) (a6989586621680993194 :: Natural)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993193LoopSym2 cnt06989586621680993191 f6989586621680993192 :: TyFun Natural (m [a]) -> Type) (a6989586621680993194 :: Natural) = Let6989586621680993193Loop cnt06989586621680993191 f6989586621680993192 a6989586621680993194
type Eval (Sum ns :: Nat -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Sum ns :: Nat -> Type) = Eval (Foldr (+) 0 ns)
type Eval (Length ('[] :: [a]) :: Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (Length ('[] :: [a]) :: Nat -> Type) = 0
type Eval (Length (a2 ': as) :: Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (Length (a2 ': as) :: Nat -> Type) = 1 + Eval (Length as)
type Eval (a * b :: Nat -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a * b :: Nat -> Type) = a * b
type Eval (a + b :: Nat -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a + b :: Nat -> Type) = a + b
type Eval (a - b :: Nat -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a - b :: Nat -> Type) = a - b
type Eval (a ^ b :: Nat -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a ^ b :: Nat -> Type) = a ^ b
type Apply ShowsPrec_6989586621680647397Sym0 (a6989586621680647405 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply ShowsPrec_6989586621680647397Sym0 (a6989586621680647405 :: Natural) = ShowsPrec_6989586621680647397Sym1 a6989586621680647405
type Apply ShowsPrec_6989586621680647421Sym0 (a6989586621680647429 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply ShowsPrec_6989586621680647421Sym0 (a6989586621680647429 :: Natural) = ShowsPrec_6989586621680647421Sym1 a6989586621680647429
type Apply ShowsPrec_6989586621680127614Sym0 (a6989586621680127622 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsPrec_6989586621680127614Sym0 (a6989586621680127622 :: Natural) = ShowsPrec_6989586621680127614Sym1 a6989586621680127622
type Apply ShowsPrec_6989586621680127586Sym0 (a6989586621680127598 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsPrec_6989586621680127586Sym0 (a6989586621680127598 :: Natural) = ShowsPrec_6989586621680127586Sym1 a6989586621680127598
type Apply EfdtNatDnSym0 (a6989586621679554927 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EfdtNatDnSym0 (a6989586621679554927 :: Natural) = EfdtNatDnSym1 a6989586621679554927
type Apply EfdtNatSym0 (a6989586621679555001 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EfdtNatSym0 (a6989586621679555001 :: Natural) = EfdtNatSym1 a6989586621679555001
type Apply EfdtNatUpSym0 (a6989586621679554964 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EfdtNatUpSym0 (a6989586621679554964 :: Natural) = EfdtNatUpSym1 a6989586621679554964
type Apply EnumFromThenTo_6989586621679555158Sym0 (a6989586621679555170 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EnumFromThenTo_6989586621679555158Sym0 (a6989586621679555170 :: Natural) = EnumFromThenTo_6989586621679555158Sym1 a6989586621679555170
type Apply DivSym0 (a6989586621679509056 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply DivSym0 (a6989586621679509056 :: Natural) = DivSym1 a6989586621679509056
type Apply ModSym0 (a6989586621679509551 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply ModSym0 (a6989586621679509551 :: Natural) = ModSym1 a6989586621679509551
type Apply QuotSym0 (a6989586621679510194 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply QuotSym0 (a6989586621679510194 :: Natural) = QuotSym1 a6989586621679510194
type Apply RemSym0 (a6989586621679510183 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply RemSym0 (a6989586621679510183 :: Natural) = RemSym1 a6989586621679510183
type Apply (^@#@$) (a6989586621679490915 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons.Internal type Apply (^@#@$) (a6989586621679490915 :: Natural) = (^@#@$$) a6989586621679490915
type Apply DivModSym0 (a6989586621679510212 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply DivModSym0 (a6989586621679510212 :: Natural) = DivModSym1 a6989586621679510212
type Apply QuotRemSym0 (a6989586621679510205 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply QuotRemSym0 (a6989586621679510205 :: Natural) = QuotRemSym1 a6989586621679510205
type Apply EftNatSym0 (a6989586621679555019 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EftNatSym0 (a6989586621679555019 :: Natural) = EftNatSym1 a6989586621679555019
type Apply EnumFromTo_6989586621679555142Sym0 (a6989586621679555151 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply EnumFromTo_6989586621679555142Sym0 (a6989586621679555151 :: Natural) = EnumFromTo_6989586621679555142Sym1 a6989586621679555151
type Apply ShowsPrec_6989586621680127424Sym0 (a6989586621680127432 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsPrec_6989586621680127424Sym0 (a6989586621680127432 :: Natural) = ShowsPrec_6989586621680127424Sym1 a6989586621680127432
type Apply ShowsPrec_6989586621680127564Sym0 (a6989586621680127574 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsPrec_6989586621680127564Sym0 (a6989586621680127574 :: Natural) = ShowsPrec_6989586621680127564Sym1 a6989586621680127574
type Apply ShowsCharPrecSym0 (a6989586621680120130 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsCharPrecSym0 (a6989586621680120130 :: Natural) = ShowsCharPrecSym1 a6989586621680120130
type Apply ShowsNatSym0 (a6989586621680118200 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply ShowsNatSym0 (a6989586621680118200 :: Natural) = ShowsNatSym1 a6989586621680118200
type Apply (ShowsPrec_6989586621680459070Sym0 :: TyFun Natural (Identity a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680459078 :: Natural)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (ShowsPrec_6989586621680459070Sym0 :: TyFun Natural (Identity a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680459078 :: Natural) = ShowsPrec_6989586621680459070Sym1 a6989586621680459078 :: TyFun (Identity a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680180948Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680180956 :: Natural)
Instance details Defined in Data.Monoid.Singletons type Apply (ShowsPrec_6989586621680180948Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680180956 :: Natural) = ShowsPrec_6989586621680180948Sym1 a6989586621680180956 :: TyFun (First a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680180996Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680181004 :: Natural)
Instance details Defined in Data.Monoid.Singletons type Apply (ShowsPrec_6989586621680180996Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680181004 :: Natural) = ShowsPrec_6989586621680180996Sym1 a6989586621680181004 :: TyFun (Last a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647556Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647564 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647556Sym0 :: TyFun Natural (First a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647564 :: Natural) = ShowsPrec_6989586621680647556Sym1 a6989586621680647564 :: TyFun (First a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647583Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647591 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647583Sym0 :: TyFun Natural (Last a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647591 :: Natural) = ShowsPrec_6989586621680647583Sym1 a6989586621680647591 :: TyFun (Last a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647529Sym0 :: TyFun Natural (Max a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647537 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647529Sym0 :: TyFun Natural (Max a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647537 :: Natural) = ShowsPrec_6989586621680647529Sym1 a6989586621680647537 :: TyFun (Max a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647502Sym0 :: TyFun Natural (Min a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647510 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647502Sym0 :: TyFun Natural (Min a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647510 :: Natural) = ShowsPrec_6989586621680647502Sym1 a6989586621680647510 :: TyFun (Min a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647610Sym0 :: TyFun Natural (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647618 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647610Sym0 :: TyFun Natural (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647618 :: Natural) = ShowsPrec_6989586621680647610Sym1 a6989586621680647618 :: TyFun (WrappedMonoid m) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647373Sym0 :: TyFun Natural (Dual a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647381 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647373Sym0 :: TyFun Natural (Dual a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647381 :: Natural) = ShowsPrec_6989586621680647373Sym1 a6989586621680647381 :: TyFun (Dual a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647475Sym0 :: TyFun Natural (Product a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647483 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647475Sym0 :: TyFun Natural (Product a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647483 :: Natural) = ShowsPrec_6989586621680647475Sym1 a6989586621680647483 :: TyFun (Product a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680647448Sym0 :: TyFun Natural (Sum a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647456 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680647448Sym0 :: TyFun Natural (Sum a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680647456 :: Natural) = ShowsPrec_6989586621680647448Sym1 a6989586621680647456 :: TyFun (Sum a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680127540Sym0 :: TyFun Natural (NonEmpty a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127548 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127540Sym0 :: TyFun Natural (NonEmpty a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127548 :: Natural) = ShowsPrec_6989586621680127540Sym1 a6989586621680127548 :: TyFun (NonEmpty a) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127464 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127454Sym0 :: TyFun Natural (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127464 :: Natural) = ShowsPrec_6989586621680127454Sym1 a6989586621680127464 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type
type Apply (EfdtNatDnSym1 a6989586621679554927 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679554928 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatDnSym1 a6989586621679554927 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679554928 :: Natural) = EfdtNatDnSym2 a6989586621679554927 a6989586621679554928
type Apply (EfdtNatSym1 a6989586621679555001 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679555002 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatSym1 a6989586621679555001 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679555002 :: Natural) = EfdtNatSym2 a6989586621679555001 a6989586621679555002
type Apply (EfdtNatUpSym1 a6989586621679554964 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679554965 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EfdtNatUpSym1 a6989586621679554964 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679554965 :: Natural) = EfdtNatUpSym2 a6989586621679554964 a6989586621679554965
type Apply (EnumFromThenTo_6989586621679555158Sym1 a6989586621679555170 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679555171 :: Natural)
Instance details Defined in Data.Singletons.Base.Enum type Apply (EnumFromThenTo_6989586621679555158Sym1 a6989586621679555170 :: TyFun Natural (Natural ~> [Natural]) -> Type) (a6989586621679555171 :: Natural) = EnumFromThenTo_6989586621679555158Sym2 a6989586621679555170 a6989586621679555171
type Apply (ShowsPrec_6989586621680095137Sym0 :: TyFun Natural ([a] ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095147 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095137Sym0 :: TyFun Natural ([a] ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095147 :: Natural) = ShowsPrec_6989586621680095137Sym1 a6989586621680095147 :: TyFun [a] (Symbol ~> Symbol) -> Type
type Apply (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621679765742 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621679765742 :: Natural) = SplitAtSym1 a6989586621679765742 :: TyFun [a] ([a], [a]) -> Type
type Apply (ListsplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621680071777 :: Natural)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListsplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621680071777 :: Natural) = ListsplitAtSym1 a6989586621680071777 :: TyFun [a] ([a], [a]) -> Type
type Apply (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679765749 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679765749 :: Natural) = DropSym1 a6989586621679765749 :: TyFun [a] [a] -> Type
type Apply (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679765762 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679765762 :: Natural) = TakeSym1 a6989586621679765762 :: TyFun [a] [a] -> Type
type Apply (ListdropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621680071788 :: Natural)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListdropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621680071788 :: Natural) = ListdropSym1 a6989586621680071788 :: TyFun [a] [a] -> Type
type Apply (ListtakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621680071799 :: Natural)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListtakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621680071799 :: Natural) = ListtakeSym1 a6989586621680071799 :: TyFun [a] [a] -> Type
type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095091 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095091 :: Natural) = ShowsPrecSym1 a6989586621680095091 :: TyFun a (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680095105Sym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095111 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095105Sym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095111 :: Natural) = ShowsPrec_6989586621680095105Sym1 a6989586621680095111 :: TyFun a (Symbol ~> Symbol) -> Type
type Apply (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) (a6989586621679765607 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) (a6989586621679765607 :: Natural) = ReplicateSym1 a6989586621679765607 :: TyFun a [a] -> Type
type Apply (DivModSym1 a6989586621679510212 :: TyFun Natural (Natural, Natural) -> Type) (a6989586621679510213 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (DivModSym1 a6989586621679510212 :: TyFun Natural (Natural, Natural) -> Type) (a6989586621679510213 :: Natural) = DivMod a6989586621679510212 a6989586621679510213
type Apply (QuotRemSym1 a6989586621679510205 :: TyFun Natural (Natural, Natural) -> Type) (a6989586621679510206 :: Natural)
Instance details Defined in GHC.TypeLits.Singletons type Apply (QuotRemSym1 a6989586621679510205 :: TyFun Natural (Natural, Natural) -> Type) (a6989586621679510206 :: Natural) = QuotRem a6989586621679510205 a6989586621679510206
type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) (a6989586621679765963 :: a)
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type) (a6989586621679765963 :: a) = ElemIndexSym1 a6989586621679765963
type Apply (ElemIndicesSym0 :: TyFun a ([a] ~> [Natural]) -> Type) (a6989586621679765954 :: a)
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemIndicesSym0 :: TyFun a ([a] ~> [Natural]) -> Type) (a6989586621679765954 :: a) = ElemIndicesSym1 a6989586621679765954
type Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) (a6989586621680230552 :: Natural)
Instance details Defined in Data.Proxy.Singletons type Apply (ToEnum_6989586621680230548Sym0 :: TyFun Natural (Proxy s) -> Type) (a6989586621680230552 :: Natural) = ToEnum_6989586621680230548 a6989586621680230552 :: Proxy s
type Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127514 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680127504Sym0 :: TyFun Natural (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680127514 :: Natural) = ShowsPrec_6989586621680127504Sym1 a6989586621680127514 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680230480 :: Natural)
Instance details Defined in Data.Proxy.Singletons type Apply (ShowsPrec_6989586621680230472Sym0 :: TyFun Natural (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680230480 :: Natural) = ShowsPrec_6989586621680230472Sym1 a6989586621680230480 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680669533Sym0 :: TyFun Natural (Arg a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680669541 :: Natural)
Instance details Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680669533Sym0 :: TyFun Natural (Arg a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680669541 :: Natural) = ShowsPrec_6989586621680669533Sym1 a6989586621680669541 :: TyFun (Arg a b) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680095155Sym0 :: TyFun Natural ((a, b) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095161 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095155Sym0 :: TyFun Natural ((a, b) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095161 :: Natural) = ShowsPrec_6989586621680095155Sym1 a6989586621680095161 :: TyFun (a, b) (Symbol ~> Symbol) -> Type
type Apply (ReplicateM_Sym0 :: TyFun Natural (m a ~> m ()) -> Type) (a6989586621680993171 :: Natural)
Instance details Defined in Control.Monad.Singletons type Apply (ReplicateM_Sym0 :: TyFun Natural (m a ~> m ()) -> Type) (a6989586621680993171 :: Natural) = ReplicateM_Sym1 a6989586621680993171 :: TyFun (m a) (m ()) -> Type
type Apply (ReplicateMSym0 :: TyFun Natural (m a ~> m [a]) -> Type) (a6989586621680993189 :: Natural)
Instance details Defined in Control.Monad.Singletons type Apply (ReplicateMSym0 :: TyFun Natural (m a ~> m [a]) -> Type) (a6989586621680993189 :: Natural) = ReplicateMSym1 a6989586621680993189 :: TyFun (m a) (m [a]) -> Type
type Apply (ShowsPrec_6989586621680494147Sym0 :: TyFun Natural (Const a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680494155 :: Natural)
Instance details Defined in Data.Functor.Const.Singletons type Apply (ShowsPrec_6989586621680494147Sym0 :: TyFun Natural (Const a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680494155 :: Natural) = ShowsPrec_6989586621680494147Sym1 a6989586621680494155 :: TyFun (Const a b) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680095170Sym0 :: TyFun Natural ((a, b, c) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095176 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095170Sym0 :: TyFun Natural ((a, b, c) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095176 :: Natural) = ShowsPrec_6989586621680095170Sym1 a6989586621680095176 :: TyFun (a, b, c) (Symbol ~> Symbol) -> Type
type Apply (Let6989586621680993175LoopSym0 :: TyFun k (TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type) -> Type) (cnt06989586621680993173 :: k)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993175LoopSym0 :: TyFun k (TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type) -> Type) (cnt06989586621680993173 :: k) = Let6989586621680993175LoopSym1 cnt06989586621680993173 :: TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type
type Apply (Let6989586621680993193LoopSym0 :: TyFun k (TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type) -> Type) (cnt06989586621680993191 :: k)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993193LoopSym0 :: TyFun k (TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type) -> Type) (cnt06989586621680993191 :: k) = Let6989586621680993193LoopSym1 cnt06989586621680993191 :: TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type
type Apply (Let6989586621679765926BuildListSym0 :: TyFun k1 (TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type) -> Type) (p6989586621679765924 :: k1)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765926BuildListSym0 :: TyFun k1 (TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type) -> Type) (p6989586621679765924 :: k1) = Let6989586621679765926BuildListSym1 p6989586621679765924 :: TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type
type Apply (ShowsPrec_6989586621680095186Sym0 :: TyFun Natural ((a, b, c, d) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095192 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095186Sym0 :: TyFun Natural ((a, b, c, d) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095192 :: Natural) = ShowsPrec_6989586621680095186Sym1 a6989586621680095192 :: TyFun (a, b, c, d) (Symbol ~> Symbol) -> Type
type Apply (Let6989586621679765926BuildListSym1 p6989586621679765924 :: TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type) (xs6989586621679765925 :: k2)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765926BuildListSym1 p6989586621679765924 :: TyFun k2 (TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) -> Type) (xs6989586621679765925 :: k2) = Let6989586621679765926BuildListSym2 p6989586621679765924 xs6989586621679765925 :: TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type
type Apply (ShowsPrec_6989586621680095203Sym0 :: TyFun Natural ((a, b, c, d, e) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095209 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095203Sym0 :: TyFun Natural ((a, b, c, d, e) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095209 :: Natural) = ShowsPrec_6989586621680095203Sym1 a6989586621680095209 :: TyFun (a, b, c, d, e) (Symbol ~> Symbol) -> Type
type Apply (Let6989586621679765926BuildListSym2 p6989586621679765924 xs6989586621679765925 :: TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) (a6989586621679765927 :: Natural)
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765926BuildListSym2 p6989586621679765924 xs6989586621679765925 :: TyFun Natural ([b6989586621679762292] ~> [Natural]) -> Type) (a6989586621679765927 :: Natural) = Let6989586621679765926BuildListSym3 p6989586621679765924 xs6989586621679765925 a6989586621679765927 :: TyFun [b6989586621679762292] [Natural] -> Type
type Apply (ShowsPrec_6989586621680095221Sym0 :: TyFun Natural ((a, b, c, d, e, f) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095227 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095221Sym0 :: TyFun Natural ((a, b, c, d, e, f) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095227 :: Natural) = ShowsPrec_6989586621680095221Sym1 a6989586621680095227 :: TyFun (a, b, c, d, e, f) (Symbol ~> Symbol) -> Type
type Apply (ShowsPrec_6989586621680095240Sym0 :: TyFun Natural ((a, b, c, d, e, f, g) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095246 :: Natural)
Instance details Defined in Text.Show.Singletons type Apply (ShowsPrec_6989586621680095240Sym0 :: TyFun Natural ((a, b, c, d, e, f, g) ~> (Symbol ~> Symbol)) -> Type) (a6989586621680095246 :: Natural) = ShowsPrec_6989586621680095240Sym1 a6989586621680095246 :: TyFun (a, b, c, d, e, f, g) (Symbol ~> Symbol) -> Type
type Apply (FromInteger_6989586621680494127Sym0 :: TyFun Natural (Const a b) -> Type) (a6989586621680494131 :: Natural)
Instance details Defined in Data.Functor.Const.Singletons type Apply (FromInteger_6989586621680494127Sym0 :: TyFun Natural (Const a b) -> Type) (a6989586621680494131 :: Natural) = FromInteger_6989586621680494127 a6989586621680494131 :: Const a b
type Apply (ToEnum_6989586621680494030Sym0 :: TyFun Natural (Const a b) -> Type) (a6989586621680494034 :: Natural)
Instance details Defined in Data.Functor.Const.Singletons type Apply (ToEnum_6989586621680494030Sym0 :: TyFun Natural (Const a b) -> Type) (a6989586621680494034 :: Natural) = ToEnum_6989586621680494030 a6989586621680494034 :: Const a b
type Apply (FromEnum_6989586621680458803Sym0 :: TyFun (Identity a) Natural -> Type) (a6989586621680458807 :: Identity a)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (FromEnum_6989586621680458803Sym0 :: TyFun (Identity a) Natural -> Type) (a6989586621680458807 :: Identity a) = FromEnum_6989586621680458803 a6989586621680458807
type Apply (Length_6989586621680460396Sym0 :: TyFun (Identity a) Natural -> Type) (a6989586621680460400 :: Identity a)
Instance details Defined in Data.Functor.Identity.Singletons type Apply (Length_6989586621680460396Sym0 :: TyFun (Identity a) Natural -> Type) (a6989586621680460400 :: Identity a) = Length_6989586621680460396 a6989586621680460400
type Apply (FromEnum_6989586621680669674Sym0 :: TyFun (First a) Natural -> Type) (a6989586621680669678 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680669674Sym0 :: TyFun (First a) Natural -> Type) (a6989586621680669678 :: First a) = FromEnum_6989586621680669674 a6989586621680669678
type Apply (FromEnum_6989586621680669882Sym0 :: TyFun (Last a) Natural -> Type) (a6989586621680669886 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680669882Sym0 :: TyFun (Last a) Natural -> Type) (a6989586621680669886 :: Last a) = FromEnum_6989586621680669882 a6989586621680669886
type Apply (FromEnum_6989586621680669145Sym0 :: TyFun (Max a) Natural -> Type) (a6989586621680669149 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680669145Sym0 :: TyFun (Max a) Natural -> Type) (a6989586621680669149 :: Max a) = FromEnum_6989586621680669145 a6989586621680669149
type Apply (FromEnum_6989586621680668172Sym0 :: TyFun (Min a) Natural -> Type) (a6989586621680668176 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680668172Sym0 :: TyFun (Min a) Natural -> Type) (a6989586621680668176 :: Min a) = FromEnum_6989586621680668172 a6989586621680668176
type Apply (FromEnum_6989586621680670051Sym0 :: TyFun (WrappedMonoid a) Natural -> Type) (a6989586621680670055 :: WrappedMonoid a)
Instance details Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680670051Sym0 :: TyFun (WrappedMonoid a) Natural -> Type) (a6989586621680670055 :: WrappedMonoid a) = FromEnum_6989586621680670051 a6989586621680670055
type Apply (Length_6989586621680261803Sym0 :: TyFun (Dual a) Natural -> Type) (a6989586621680261807 :: Dual a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261803Sym0 :: TyFun (Dual a) Natural -> Type) (a6989586621680261807 :: Dual a) = Length_6989586621680261803 a6989586621680261807
type Apply (Length_6989586621680262153Sym0 :: TyFun (Product a) Natural -> Type) (a6989586621680262157 :: Product a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680262153Sym0 :: TyFun (Product a) Natural -> Type) (a6989586621680262157 :: Product a) = Length_6989586621680262153 a6989586621680262157
type Apply (Length_6989586621680261978Sym0 :: TyFun (Sum a) Natural -> Type) (a6989586621680261982 :: Sum a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261978Sym0 :: TyFun (Sum a) Natural -> Type) (a6989586621680261982 :: Sum a) = Length_6989586621680261978 a6989586621680261982
type Apply (Length_6989586621680261394Sym0 :: TyFun [a] Natural -> Type) (a6989586621680261400 :: [a])
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261394Sym0 :: TyFun [a] Natural -> Type) (a6989586621680261400 :: [a]) = Length_6989586621680261394 a6989586621680261400
type Apply (LengthSym0 :: TyFun [a] Natural -> Type) (a6989586621679765618 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (LengthSym0 :: TyFun [a] Natural -> Type) (a6989586621679765618 :: [a]) = Length a6989586621679765618
type Apply (ListlengthSym0 :: TyFun [a] Natural -> Type) (a6989586621680071757 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListlengthSym0 :: TyFun [a] Natural -> Type) (a6989586621680071757 :: [a]) = Listlength a6989586621680071757
type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680260973 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680260973 :: t a) = Length a6989586621680260973
type Apply (Length_6989586621680261158Sym0 :: TyFun (t a) Natural -> Type) (a6989586621680261164 :: t a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261158Sym0 :: TyFun (t a) Natural -> Type) (a6989586621680261164 :: t a) = Length_6989586621680261158 a6989586621680261164
type Apply (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765964 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemIndexSym1 a6989586621679765963 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765964 :: [a]) = ElemIndex a6989586621679765963 a6989586621679765964
type Apply (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765946 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndexSym1 a6989586621679765945 :: TyFun [a] (Maybe Natural) -> Type) (a6989586621679765946 :: [a]) = FindIndex a6989586621679765945 a6989586621679765946
type Apply (ElemIndicesSym1 a6989586621679765954 :: TyFun [a] [Natural] -> Type) (a6989586621679765955 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (ElemIndicesSym1 a6989586621679765954 :: TyFun [a] [Natural] -> Type) (a6989586621679765955 :: [a]) = ElemIndices a6989586621679765954 a6989586621679765955
type Apply (FindIndicesSym1 a6989586621679765922 :: TyFun [a] [Natural] -> Type) (a6989586621679765923 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndicesSym1 a6989586621679765922 :: TyFun [a] [Natural] -> Type) (a6989586621679765923 :: [a]) = FindIndices a6989586621679765922 a6989586621679765923
type Apply (Let6989586621679765926BuildListSym3 p6989586621679765924 xs6989586621679765925 a6989586621679765927 :: TyFun [b] [Natural] -> Type) (a6989586621679765928 :: [b])
Instance details Defined in Data.List.Singletons.Internal type Apply (Let6989586621679765926BuildListSym3 p6989586621679765924 xs6989586621679765925 a6989586621679765927 :: TyFun [b] [Natural] -> Type) (a6989586621679765928 :: [b]) = Let6989586621679765926BuildList p6989586621679765924 xs6989586621679765925 a6989586621679765927 a6989586621679765928
type Apply ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) (a6989586621679765587 :: [a])
Instance details Defined in Data.List.Singletons.Internal type Apply ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) (a6989586621679765587 :: [a]) = (!!@#@$$) a6989586621679765587
type Apply (ListindexSym0 :: TyFun [a] (Natural ~> a) -> Type) (a6989586621680071766 :: [a])
Instance details Defined in Data.List.Singletons.Internal.Disambiguation type Apply (ListindexSym0 :: TyFun [a] (Natural ~> a) -> Type) (a6989586621680071766 :: [a]) = ListindexSym1 a6989586621680071766
type Apply (Let6989586621680993175LoopSym1 cnt06989586621680993173 :: TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type) (f6989586621680993174 :: m6989586621680992814 a)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993175LoopSym1 cnt06989586621680993173 :: TyFun (m6989586621680992814 a) (TyFun Natural (m6989586621680992814 ()) -> Type) -> Type) (f6989586621680993174 :: m6989586621680992814 a) = Let6989586621680993175LoopSym2 cnt06989586621680993173 f6989586621680993174
type Apply (Let6989586621680993193LoopSym1 cnt06989586621680993191 :: TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type) (f6989586621680993192 :: m6989586621680992816 a6989586621680992817)
Instance details Defined in Control.Monad.Singletons type Apply (Let6989586621680993193LoopSym1 cnt06989586621680993191 :: TyFun (m6989586621680992816 a6989586621680992817) (TyFun Natural (m6989586621680992816 [a6989586621680992817]) -> Type) -> Type) (f6989586621680993192 :: m6989586621680992816 a6989586621680992817) = Let6989586621680993193LoopSym2 cnt06989586621680993191 f6989586621680993192
type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) = 'Nothing :: Maybe Nat
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) = Eval (If (Eval (p a2)) (Pure ('Just 0)) ((Map ((+) 1) :: Maybe Nat -> Maybe Nat -> Type) =<< FindIndex p as))
type Eval (NumIter a s :: Maybe (k, Nat) -> Type)
Instance details Defined in Fcf.Data.List type Eval (NumIter a s :: Maybe (k, Nat) -> Type) = If (Eval (s > 0)) ('Just '(a, s - 1)) ('Nothing :: Maybe (k, Natural))
type Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) (a6989586621680261580 :: Either a1 a2)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261576Sym0 :: TyFun (Either a1 a2) Natural -> Type) (a6989586621680261580 :: Either a1 a2) = Length_6989586621680261576 a6989586621680261580
type Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) (a6989586621680261654 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Apply (Length_6989586621680261650Sym0 :: TyFun (Proxy a) Natural -> Type) (a6989586621680261654 :: Proxy a) = Length_6989586621680261650 a6989586621680261654
type Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) (a6989586621680230546 :: Proxy s)
Instance details Defined in Data.Proxy.Singletons type Apply (FromEnum_6989586621680230542Sym0 :: TyFun (Proxy s) Natural -> Type) (a6989586621680230546 :: Proxy s) = FromEnum_6989586621680230542 a6989586621680230546
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type) (a6989586621679765945 :: a ~> Bool) = FindIndexSym1 a6989586621679765945
type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type) (a6989586621679765922 :: a ~> Bool)
Instance details Defined in Data.List.Singletons.Internal type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type) (a6989586621679765922 :: a ~> Bool) = FindIndicesSym1 a6989586621679765922
type Apply (FromEnum_6989586621680494037Sym0 :: TyFun (Const a b) Natural -> Type) (a6989586621680494041 :: Const a b)
Instance details Defined in Data.Functor.Const.Singletons type Apply (FromEnum_6989586621680494037Sym0 :: TyFun (Const a b) Natural -> Type) (a6989586621680494041 :: Const a b) = FromEnum_6989586621680494037 a6989586621680494041

data ByteString #

A space-efficient representation of a Word8 vector, supporting many efficient operations.

A ByteString contains 8-bit bytes, or by using the operations from Data.ByteString.Char8 it can be interpreted as containing 8-bit characters.

Instances

Instances details

Structured ByteString
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy ByteString -> Structure # structureHash' :: Tagged ByteString MD5
Chunk ByteString
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem ByteString # Methods nullChunk :: ByteString -> Bool # pappendChunk :: State ByteString -> ByteString -> State ByteString # atBufferEnd :: ByteString -> State ByteString -> Pos # bufferElemAt :: ByteString -> Pos -> State ByteString -> Maybe (ChunkElem ByteString, Int) # chunkElemToChar :: ByteString -> ChunkElem ByteString -> Char #
Data ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ByteString -> c ByteString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ByteString # toConstr :: ByteString -> Constr # dataTypeOf :: ByteString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ByteString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ByteString) # gmapT :: (forall b. Data b => b -> b) -> ByteString -> ByteString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQ :: (forall d. Data d => d -> u) -> ByteString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ByteString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString #
IsString ByteString	Beware: `fromString` truncates multi-byte characters to octets. e.g. "枯朶に烏のとまりけり秋の暮" becomes �6k�nh~�Q��n�
Instance details Defined in Data.ByteString.Internal.Type Methods fromString :: String -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
IsList ByteString	Since: bytestring-0.10.12.0
Instance details Defined in Data.ByteString.Internal.Type Associated Types type Item ByteString # Methods fromList :: [Item ByteString] -> ByteString # fromListN :: Int -> [Item ByteString] -> ByteString # toList :: ByteString -> [Item ByteString] #
Read ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Show ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
NFData ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods rnf :: ByteString -> () #
Eq ByteString
Instance details Defined in Data.ByteString.Internal.Type Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Ord ByteString
Instance details 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 #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
HasAnnotation ByteString Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString) Source # annOptions :: Maybe AnnOptions Source #
BytesLike ByteString Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: ByteString -> ByteString Source #
ConcatOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SliceOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
Stream ByteString
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token ByteString # type Tokens ByteString # Methods tokenToChunk :: Proxy ByteString -> Token ByteString -> Tokens ByteString # tokensToChunk :: Proxy ByteString -> [Token ByteString] -> Tokens ByteString # chunkToTokens :: Proxy ByteString -> Tokens ByteString -> [Token ByteString] # chunkLength :: Proxy ByteString -> Tokens ByteString -> Int # chunkEmpty :: Proxy ByteString -> Tokens ByteString -> Bool # take1_ :: ByteString -> Maybe (Token ByteString, ByteString) # takeN_ :: Int -> ByteString -> Maybe (Tokens ByteString, ByteString) # takeWhile_ :: (Token ByteString -> Bool) -> ByteString -> (Tokens ByteString, ByteString) #
TraversableStream ByteString
Instance details Defined in Text.Megaparsec.Stream Methods reachOffset :: Int -> PosState ByteString -> (Maybe String, PosState ByteString) # reachOffsetNoLine :: Int -> PosState ByteString -> PosState ByteString #
VisualStream ByteString
Instance details Defined in Text.Megaparsec.Stream Methods showTokens :: Proxy ByteString -> NonEmpty (Token ByteString) -> String # tokensLength :: Proxy ByteString -> NonEmpty (Token ByteString) -> Int #
HasRPCRepr ByteString
Instance details Defined in Morley.AsRPC Associated Types type AsRPC ByteString
TypeHasDoc ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ByteString :: FieldDescriptions # Methods typeDocName :: Proxy ByteString -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ByteString -> WithinParens -> Markdown # typeDocDependencies :: Proxy ByteString -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ByteString # typeDocMichelsonRep :: TypeDocMichelsonRep ByteString #
IsoValue ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
FormatAsHex ByteString
Instance details Defined in Fmt.Buildable Methods hexF :: ByteString -> Doc
FromDoc ByteString
Instance details Defined in Fmt.Buildable Methods fmt :: Doc -> ByteString
FromSimpleDoc ByteString
Instance details Defined in Fmt.Buildable Methods fmtSimple :: SimpleDocStream ann -> ByteString
Container ByteString
Instance details Defined in Universum.Container.Class Associated Types type Element ByteString # Methods toList :: ByteString -> [Element ByteString] # null :: ByteString -> Bool # foldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # foldl :: (b -> Element ByteString -> b) -> b -> ByteString -> b # foldl' :: (b -> Element ByteString -> b) -> b -> ByteString -> b # length :: ByteString -> Int # elem :: Element ByteString -> ByteString -> Bool # foldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # fold :: ByteString -> Element ByteString # foldr' :: (Element ByteString -> b -> b) -> b -> ByteString -> b # notElem :: Element ByteString -> ByteString -> Bool # all :: (Element ByteString -> Bool) -> ByteString -> Bool # any :: (Element ByteString -> Bool) -> ByteString -> Bool # and :: ByteString -> Bool # or :: ByteString -> Bool # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # safeHead :: ByteString -> Maybe (Element ByteString) # safeMaximum :: ByteString -> Maybe (Element ByteString) # safeMinimum :: ByteString -> Maybe (Element ByteString) # safeFoldr1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Maybe (Element ByteString) # safeFoldl1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Maybe (Element ByteString) #
FromList ByteString
Instance details Defined in Universum.Container.Class Associated Types type ListElement ByteString # type FromListC ByteString # Methods fromList :: [ListElement ByteString] -> ByteString #
One ByteString
Instance details Defined in Universum.Container.Class Associated Types type OneItem ByteString # Methods one :: OneItem ByteString -> ByteString #
Print ByteString
Instance details Defined in Universum.Print.Internal Methods hPutStr :: Handle -> ByteString -> IO () # hPutStrLn :: Handle -> ByteString -> IO () #
UnaryArithOpHs Not ByteString Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not ByteString Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (ByteString ': s) :-> (UnaryArithResHs Not ByteString ': s) Source #
Lift ByteString	Since: bytestring-0.11.2.0
Instance details Defined in Data.ByteString.Internal.Type Methods lift :: Quote m => ByteString -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => ByteString -> Code m ByteString #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
ConvertUtf8 String ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: String -> ByteString # decodeUtf8 :: ByteString -> String # decodeUtf8Strict :: ByteString -> Either UnicodeException String #
Cons ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #
Snoc ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #
r ~ ByteString => ArithOpHs And ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsl ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsr ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Or ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Xor ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
CanCastTo (Packed a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy ByteString -> () Source #
CanCastTo (TSignature a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy ByteString -> () Source #
CanCastTo (Hash alg a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg a) -> Proxy ByteString -> () Source #
Stream (NoShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token (NoShareInput ByteString) # type Tokens (NoShareInput ByteString) # Methods tokenToChunk :: Proxy (NoShareInput ByteString) -> Token (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) # tokensToChunk :: Proxy (NoShareInput ByteString) -> [Token (NoShareInput ByteString)] -> Tokens (NoShareInput ByteString) # chunkToTokens :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> [Token (NoShareInput ByteString)] # chunkLength :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> Int # chunkEmpty :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> Bool # take1_ :: NoShareInput ByteString -> Maybe (Token (NoShareInput ByteString), NoShareInput ByteString) # takeN_ :: Int -> NoShareInput ByteString -> Maybe (Tokens (NoShareInput ByteString), NoShareInput ByteString) # takeWhile_ :: (Token (NoShareInput ByteString) -> Bool) -> NoShareInput ByteString -> (Tokens (NoShareInput ByteString), NoShareInput ByteString) #
Stream (ShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token (ShareInput ByteString) # type Tokens (ShareInput ByteString) # Methods tokenToChunk :: Proxy (ShareInput ByteString) -> Token (ShareInput ByteString) -> Tokens (ShareInput ByteString) # tokensToChunk :: Proxy (ShareInput ByteString) -> [Token (ShareInput ByteString)] -> Tokens (ShareInput ByteString) # chunkToTokens :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> [Token (ShareInput ByteString)] # chunkLength :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> Int # chunkEmpty :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> Bool # take1_ :: ShareInput ByteString -> Maybe (Token (ShareInput ByteString), ShareInput ByteString) # takeN_ :: Int -> ShareInput ByteString -> Maybe (Tokens (ShareInput ByteString), ShareInput ByteString) # takeWhile_ :: (Token (ShareInput ByteString) -> Bool) -> ShareInput ByteString -> (Tokens (ShareInput ByteString), ShareInput ByteString) #
type ChunkElem ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem ByteString = Word8
type State ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type State ByteString = Buffer
type Item ByteString
Instance details Defined in Data.ByteString.Internal.Type type Item ByteString = Word8
type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int
type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8
type Token ByteString
Instance details Defined in Text.Megaparsec.Stream type Token ByteString = Token (ShareInput ByteString)
type Tokens ByteString
Instance details Defined in Text.Megaparsec.Stream type Tokens ByteString = Tokens (ShareInput ByteString)
type AsRPC ByteString
Instance details Defined in Morley.AsRPC type AsRPC ByteString = ByteString
type TypeDocFieldDescriptions ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes
type PrettyShow ByteString
Instance details Defined in Morley.Prelude.Show type PrettyShow ByteString = TypeError ('Text "Show instance for ByteString is not pretty") :: Constraint
type Element ByteString
Instance details Defined in Universum.Container.Class type Element ByteString = Word8
type FromListC ByteString
Instance details Defined in Universum.Container.Class type FromListC ByteString = ()
type ListElement ByteString
Instance details Defined in Universum.Container.Class type ListElement ByteString = Word8
type OneItem ByteString
Instance details Defined in Universum.Container.Class type OneItem ByteString = Word8
type UnaryArithResHs Not ByteString Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not ByteString = ByteString
type Token (NoShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream type Token (NoShareInput ByteString) = Word8
type Token (ShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream type Token (ShareInput ByteString) = Word8
type Tokens (NoShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream type Tokens (NoShareInput ByteString) = ByteString
type Tokens (ShareInput ByteString)
Instance details Defined in Text.Megaparsec.Stream type Tokens (ShareInput ByteString) = ByteString

data Condition arg argl argr outb out where Source #

The most basic predicate for if ... then .. else ... construction, defines a kind of operation applied to the top elements of the current stack.

Type arguments mean: 1. Input of if 2. Left branch input 3. Right branch input 4. Output of branches 5. Output of if

Constructors

Holds :: Condition (Bool ': s) s s o o
IsSome :: Condition (Maybe a ': s) (a ': s) s o o
IsNone :: Condition (Maybe a ': s) s (a ': s) o o
IsLeft :: Condition (Either l r ': s) (l ': s) (r ': s) o o
IsRight :: Condition (Either l r ': s) (r ': s) (l ': s) o o
IsCons :: Condition ([a] ': s) (a ': ([a] ': s)) s o o
IsNil :: Condition ([a] ': s) s (a ': ([a] ': s)) o o
Not :: Condition s s1 s2 ob o -> Condition s s2 s1 ob o
IsZero :: (UnaryArithOpHs Eq' a, UnaryArithResHs Eq' a ~ Bool) => Condition (a ': s) s s o o
IsEq :: NiceComparable a => Condition (a ': (a ': s)) s s o o
IsNeq :: NiceComparable a => Condition (a ': (a ': s)) s s o o
IsLt :: NiceComparable a => Condition (a ': (a ': s)) s s o o
IsGt :: NiceComparable a => Condition (a ': (a ': s)) s s o o
IsLe :: NiceComparable a => Condition (a ': (a ': s)) s s o o
IsGe :: NiceComparable a => Condition (a ': (a ': s)) s s o o
NamedBinCondition :: Condition (a ': (a ': s)) s s o o -> Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o	Explicitly named binary condition, to ensure proper order of stack arguments.
PreserveArgsBinCondition :: (Dupable a, Dupable b) => (forall st o. Condition (a ': (b ': st)) st st o o) -> Condition (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) s	Provide the compared arguments to `if` branches.

Instances

Instances details

(arg ~ arg0, argl ~ argl0, argr ~ argr0, outb ~ outb0, out ~ out0) => IsCondition (Condition arg argl argr outb out) arg0 argl0 argr0 outb0 out0 Source #
Instance details Defined in Lorentz.Rebound Methods ifThenElse :: Condition arg argl argr outb out -> (argl0 :-> outb0) -> (argr0 :-> outb0) -> arg0 :-> out0 Source #

type (&) (a :: Type) (b :: [Type]) = a ': b infixr 2 Source #

An alias for ':.

We discourage its use as this hinders reading error messages (the compiler inserts unnecessary parentheses and indentation).

data FieldName (n :: Symbol) (p :: FieldRefTag) Source #

The simplest field reference - just a name. Behaves similarly to Label.

type List = [] Source #

data PublicKey #

Instances

Instances details

FromJSON PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods parseJSON :: Value -> Parser PublicKey # parseJSONList :: Value -> Parser [PublicKey] #
ToJSON PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods toJSON :: PublicKey -> Value # toEncoding :: PublicKey -> Encoding # toJSONList :: [PublicKey] -> Value # toEncodingList :: [PublicKey] -> Encoding #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
NFData PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods rnf :: PublicKey -> () #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
HasAnnotation PublicKey Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT PublicKey) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr PublicKey
Instance details Defined in Morley.AsRPC Associated Types type AsRPC PublicKey
TypeHasDoc PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions PublicKey :: FieldDescriptions # Methods typeDocName :: Proxy PublicKey -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy PublicKey -> WithinParens -> Markdown # typeDocDependencies :: Proxy PublicKey -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep PublicKey # typeDocMichelsonRep :: TypeDocMichelsonRep PublicKey #
IsoValue PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
Buildable PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods build :: PublicKey -> Doc buildList :: [PublicKey] -> Doc
type Rep PublicKey
Instance details Defined in Morley.Tezos.Crypto type Rep PublicKey = D1 ('MetaData "PublicKey" "Morley.Tezos.Crypto" "morley-1.20.0-inplace" 'False) ((C1 ('MetaCons "PublicKeyEd25519" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedUnpack) (Rec0 PublicKey)) :+: C1 ('MetaCons "PublicKeySecp256k1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 PublicKey))) :+: (C1 ('MetaCons "PublicKeyP256" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 PublicKey)) :+: C1 ('MetaCons "PublicKeyBLS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedUnpack) (Rec0 PublicKey))))
type AsRPC PublicKey
Instance details Defined in Morley.AsRPC type AsRPC PublicKey = PublicKey
type TypeDocFieldDescriptions PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions PublicKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT PublicKey = 'TKey

data Div Source #

Since Michelson doesn't support divide operation, we will use our own to represent divison of Fixed and Rational values

Instances

Instances details

r ~ NRational => ArithOpHs Div NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (NFixed (b r)) ': s) Source #
ArithOpHs Div Natural Natural (Maybe NRational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe NRational ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (NFixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint a b t r (Fixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (Fixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
DivConstraint a b t r (NFixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (NFixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #

class NonZero t where Source #

Methods

nonZero :: (t : s) :-> (Maybe t : s) Source #

Retain the value only if it is not zero.

Instances

Instances details

NonZero Integer Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s) Source #
NonZero Natural Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s) Source #
NiceComparable d => NonZero (Ticket d) Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Ticket d ': s) :-> (Maybe (Ticket d) ': s) Source #
(NiceComparable d, Typeable k, Typeable action) => NonZero (STicket action d) Source #
Instance details Defined in Lorentz.Tickets Methods nonZero :: forall (s :: [Type]). (STicket action d ': s) :-> (Maybe (STicket action d) ': s) Source #

newtype Fixed (a :: k) #

The type parameter should be an instance of HasResolution.

Constructors

MkFixed Integer

Instances

Instances details

DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
UnaryArithOpHs Neg (Fixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type UnaryArithResHs Neg (Fixed p) Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Fixed p ': s) :-> (UnaryArithResHs Neg (Fixed p) ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
DivConstraint a b t r (Fixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (Fixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (Fixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (Fixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (NFixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
NFData1 (Fixed :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Fixed a -> () #
HasResolution a => ToJSON (Fixed a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Fixed a -> Value # toEncoding :: Fixed a -> Encoding # toJSONList :: [Fixed a] -> Value # toEncodingList :: [Fixed a] -> Encoding #
HasResolution a => ToJSONKey (Fixed a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction (Fixed a) # toJSONKeyList :: ToJSONKeyFunction [Fixed a] #
(Typeable k, Typeable a) => Data (Fixed a)	Since: base-4.1.0.0
Instance details Defined in Data.Fixed Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixed a -> c (Fixed a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Fixed a) # toConstr :: Fixed a -> Constr # dataTypeOf :: Fixed a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Fixed a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Fixed a)) # gmapT :: (forall b. Data b => b -> b) -> Fixed a -> Fixed a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixed a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixed a -> r # gmapQ :: (forall d. Data d => d -> u) -> Fixed a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixed a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) #
Enum (Fixed a)	Recall that, for numeric types, `succ` and `pred` typically add and subtract `1`, respectively. This is not true in the case of `Fixed`, whose successor and predecessor functions intuitively return the "next" and "previous" values in the enumeration. The results of these functions thus depend on the resolution of the `Fixed` value. For example, when enumerating values of resolution `10^-3` of `type Milli = Fixed E3`, succ (0.000 :: Milli) == 0.001 and likewise pred (0.000 :: Milli) == -0.001 In other words, `succ` and `pred` increment and decrement a fixed-precision value by the least amount such that the value's resolution is unchanged. For example, `10^-12` is the smallest (positive) amount that can be added to a value of `type Pico = Fixed E12` without changing its resolution, and so succ (0.000000000000 :: Pico) == 0.000000000001 and similarly pred (0.000000000000 :: Pico) == -0.000000000001 This is worth bearing in mind when defining `Fixed` arithmetic sequences. In particular, you may be forgiven for thinking the sequence [1..10] :: [Pico] evaluates to `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10] :: [Pico]`. However, this is not true. On the contrary, similarly to the above implementations of `succ` and `pred`, `enumFromTo :: Pico -> Pico -> [Pico]` has a "step size" of `10^-12`. Hence, the list `[1..10] :: [Pico]` has the form [1.000000000000, 1.00000000001, 1.00000000002, ..., 10.000000000000] and contains `9 * 10^12 + 1` values. Since: base-2.1
Instance details Defined in Data.Fixed Methods succ :: Fixed a -> Fixed a # pred :: Fixed a -> Fixed a # toEnum :: Int -> Fixed a # fromEnum :: Fixed a -> Int # enumFrom :: Fixed a -> [Fixed a] # enumFromThen :: Fixed a -> Fixed a -> [Fixed a] # enumFromTo :: Fixed a -> Fixed a -> [Fixed a] # enumFromThenTo :: Fixed a -> Fixed a -> Fixed a -> [Fixed a] #
HasResolution a => Num (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (+) :: Fixed a -> Fixed a -> Fixed a # (-) :: Fixed a -> Fixed a -> Fixed a # (*) :: Fixed a -> Fixed a -> Fixed a # negate :: Fixed a -> Fixed a # abs :: Fixed a -> Fixed a # signum :: Fixed a -> Fixed a # fromInteger :: Integer -> Fixed a #
HasResolution a => Read (Fixed a)	Since: base-4.3.0.0
Instance details Defined in Data.Fixed Methods readsPrec :: Int -> ReadS (Fixed a) # readList :: ReadS [Fixed a] # readPrec :: ReadPrec (Fixed a) # readListPrec :: ReadPrec [Fixed a] #
HasResolution a => Fractional (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (/) :: Fixed a -> Fixed a -> Fixed a # recip :: Fixed a -> Fixed a # fromRational :: Rational -> Fixed a #
HasResolution a => Real (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods toRational :: Fixed a -> Rational #
HasResolution a => RealFrac (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods properFraction :: Integral b => Fixed a -> (b, Fixed a) # truncate :: Integral b => Fixed a -> b # round :: Integral b => Fixed a -> b # ceiling :: Integral b => Fixed a -> b # floor :: Integral b => Fixed a -> b #
HasResolution a => Show (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods showsPrec :: Int -> Fixed a -> ShowS # show :: Fixed a -> String # showList :: [Fixed a] -> ShowS #
NFData (Fixed a)	Since: deepseq-1.3.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Fixed a -> () #
Eq (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (==) :: Fixed a -> Fixed a -> Bool # (/=) :: Fixed a -> Fixed a -> Bool #
Ord (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods compare :: Fixed a -> Fixed a -> Ordering # (<) :: Fixed a -> Fixed a -> Bool # (<=) :: Fixed a -> Fixed a -> Bool # (>) :: Fixed a -> Fixed a -> Bool # (>=) :: Fixed a -> Fixed a -> Bool # max :: Fixed a -> Fixed a -> Fixed a # min :: Fixed a -> Fixed a -> Fixed a #
Hashable (Fixed a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Fixed a -> Int # hash :: Fixed a -> Int #
Unwrappable (Fixed a) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (Fixed a) Source #
IsoValue (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Fixed p) :: T # Methods toVal :: Fixed p -> Value (ToT (Fixed p)) # fromVal :: Value (ToT (Fixed p)) -> Fixed p #
HasResolution a => Ring (Fixed a)
Instance details Defined in Data.Semiring Methods negate :: Fixed a -> Fixed a #
HasResolution a => Semiring (Fixed a)
Instance details Defined in Data.Semiring Methods plus :: Fixed a -> Fixed a -> Fixed a # zero :: Fixed a # times :: Fixed a -> Fixed a -> Fixed a # one :: Fixed a # fromNatural :: Natural -> Fixed a #
(KnownNat a, KnownNat b, b1 ~ b2, LorentzFixedBase b1) => LorentzRounding (Fixed (b1 a)) (Fixed (b2 b)) Source #	Round is implemented using "banker's rounding" strategy, rounding half-way values towards nearest even value
Instance details Defined in Lorentz.CustomArith.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source #
type UnaryArithResHs Neg (Fixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith type UnaryArithResHs Neg (Fixed p) = Fixed p
type Unwrappabled (Fixed a) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappabled (Fixed a) = Integer
type ToT (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Fixed p) = 'TInt
type PrettyShow (Fixed _1)
Instance details Defined in Morley.Prelude.Show type PrettyShow (Fixed _1) = ()

newtype (inp :: [Type]) :-> (out :: [Type]) infixr 1 Source #

Alias for instruction which hides inner types representation via T.

Constructors

LorentzInstr
Fields unLorentzInstr :: RemFail Instr (ToTs inp) (ToTs out)

Instances

Instances details

(CanCastTo (ZippedStack i1) (ZippedStack i2), CanCastTo (ZippedStack o1) (ZippedStack o2)) => CanCastTo (i1 :-> o1 :: Type) (i2 :-> o2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (i1 :-> o1) -> Proxy (i2 :-> o2) -> () Source #
Monoid (s :-> s) Source #
Instance details Defined in Lorentz.Base Methods mempty :: s :-> s # mappend :: (s :-> s) -> (s :-> s) -> s :-> s # mconcat :: [s :-> s] -> s :-> s #
Semigroup (s :-> s) Source #
Instance details Defined in Lorentz.Base Methods (<>) :: (s :-> s) -> (s :-> s) -> s :-> s # sconcat :: NonEmpty (s :-> s) -> s :-> s # stimes :: Integral b => b -> (s :-> s) -> s :-> s #
Show (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> (inp :-> out) -> ShowS # show :: (inp :-> out) -> String # showList :: [inp :-> out] -> ShowS #
NFData (i :-> o) Source #
Instance details Defined in Lorentz.Base Methods rnf :: (i :-> o) -> () #
Eq (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods (==) :: (inp :-> out) -> (inp :-> out) -> Bool # (/=) :: (inp :-> out) -> (inp :-> out) -> Bool #
NoLambdaCodeIsomorphismError => HasAnnotation (i :-> o) Source #
Instance details Defined in Lorentz.Base Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (i :-> o)) Source # annOptions :: Maybe AnnOptions Source #
MapLorentzInstr (i :-> o) Source #
Instance details Defined in Lorentz.Base Methods mapLorentzInstr :: (forall (i0 :: [Type]) (o0 :: [Type]). (i0 :-> o0) -> i0 :-> o0) -> (i :-> o) -> i :-> o Source #
ContainsDoc (i :-> o) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: (i :-> o) -> ContractDoc #
ContainsUpdateableDoc (i :-> o) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> (i :-> o) -> i :-> o #
RenderDoc (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods renderDoc :: RenderContext -> (inp :-> out) -> Doc isRenderable :: (inp :-> out) -> Bool
(NoLambdaCodeIsomorphismError, WellTyped (LorentzCodeIsNotIsomorphicToMichelsonValues :: T)) => IsoValue (inp :-> out) Source #
Instance details Defined in Lorentz.Base Associated Types type ToT (inp :-> out) :: T # Methods toVal :: (inp :-> out) -> Value (ToT (inp :-> out)) # fromVal :: Value (ToT (inp :-> out)) -> inp :-> out #
(i ~ arg, o ~ argl, o ~ argr, r ~ Bool, outb ~ out) => IsCondition (Expr i o r) arg argl argr outb out Source #	An expression producing `Bool` can be placed as condition to 'if'.
Instance details Defined in Lorentz.Expr Methods ifThenElse :: Expr i o r -> (argl :-> outb) -> (argr :-> outb) -> arg :-> out Source #
type ToT (inp :-> out) Source #
Instance details Defined in Lorentz.Base type ToT (inp :-> out)

type Fn a b = '[a] :-> '[b] Source #

An instruction sequence taking one stack element as input and returning one stack element as output. Essentially behaves as a Michelson lambda without any additional semantical meaning.

The reason for this distinction is Michelson lambdas allow instructions inside them that might be forbidden in the outer scope. This type doesn't add any such conditions.

type Value = Value' Instr #

data Text #

A space efficient, packed, unboxed Unicode text type.

Instances

Instances details

Structured Text
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy Text -> Structure # structureHash' :: Tagged Text MD5
ToJSON Text
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Text -> Value # toEncoding :: Text -> Encoding # toJSONList :: [Text] -> Value # toEncodingList :: [Text] -> Encoding #
ToJSONKey Text
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Text # toJSONKeyList :: ToJSONKeyFunction [Text] #
Chunk Text
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem Text # Methods nullChunk :: Text -> Bool # pappendChunk :: State Text -> Text -> State Text # atBufferEnd :: Text -> State Text -> Pos # bufferElemAt :: Text -> Pos -> State Text -> Maybe (ChunkElem Text, Int) # chunkElemToChar :: Text -> ChunkElem Text -> Char #
Hashable Text
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int # hash :: Text -> Int #
Ixed Text
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text) #
Stream Text
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token Text # type Tokens Text # Methods tokenToChunk :: Proxy Text -> Token Text -> Tokens Text # tokensToChunk :: Proxy Text -> [Token Text] -> Tokens Text # chunkToTokens :: Proxy Text -> Tokens Text -> [Token Text] # chunkLength :: Proxy Text -> Tokens Text -> Int # chunkEmpty :: Proxy Text -> Tokens Text -> Bool # take1_ :: Text -> Maybe (Token Text, Text) # takeN_ :: Int -> Text -> Maybe (Tokens Text, Text) # takeWhile_ :: (Token Text -> Bool) -> Text -> (Tokens Text, Text) #
TraversableStream Text
Instance details Defined in Text.Megaparsec.Stream Methods reachOffset :: Int -> PosState Text -> (Maybe String, PosState Text) # reachOffsetNoLine :: Int -> PosState Text -> PosState Text #
VisualStream Text
Instance details Defined in Text.Megaparsec.Stream Methods showTokens :: Proxy Text -> NonEmpty (Token Text) -> String # tokensLength :: Proxy Text -> NonEmpty (Token Text) -> Int #
RenderDoc Text
Instance details Defined in Morley.Michelson.Printer.Util Methods renderDoc :: RenderContext -> Text -> Doc isRenderable :: Text -> Bool
(Bottom, DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
HasCLReader Text
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Text getMetavar :: String
ToAnchor Text
Instance details Defined in Morley.Util.Markdown Methods toAnchor :: Text -> Anchor
Buildable Text
Instance details Defined in Fmt.Buildable Methods build :: Text -> Doc buildList :: [Text] -> Doc
FromDoc Text
Instance details Defined in Fmt.Buildable Methods fmt :: Doc -> Text
FromSimpleDoc Text
Instance details Defined in Fmt.Buildable Methods fmtSimple :: SimpleDocStream ann -> Text
Pretty Text	Automatically converts all newlines to `line`. `>>>` `pretty ("hello\nworld" :: Text)`hello world Note that `line` can be undone by `group`: `>>>` `group (pretty ("hello\nworld" :: Text))`hello world Manually use `hardline` if you definitely want newlines.
Instance details Defined in Prettyprinter.Internal Methods pretty :: Text -> Doc ann # prettyList :: [Text] -> Doc ann #
Container Text
Instance details Defined in Universum.Container.Class Associated Types type Element Text # Methods toList :: Text -> [Element Text] # null :: Text -> Bool # foldr :: (Element Text -> b -> b) -> b -> Text -> b # foldl :: (b -> Element Text -> b) -> b -> Text -> b # foldl' :: (b -> Element Text -> b) -> b -> Text -> b # length :: Text -> Int # elem :: Element Text -> Text -> Bool # foldMap :: Monoid m => (Element Text -> m) -> Text -> m # fold :: Text -> Element Text # foldr' :: (Element Text -> b -> b) -> b -> Text -> b # notElem :: Element Text -> Text -> Bool # all :: (Element Text -> Bool) -> Text -> Bool # any :: (Element Text -> Bool) -> Text -> Bool # and :: Text -> Bool # or :: Text -> Bool # find :: (Element Text -> Bool) -> Text -> Maybe (Element Text) # safeHead :: Text -> Maybe (Element Text) # safeMaximum :: Text -> Maybe (Element Text) # safeMinimum :: Text -> Maybe (Element Text) # safeFoldr1 :: (Element Text -> Element Text -> Element Text) -> Text -> Maybe (Element Text) # safeFoldl1 :: (Element Text -> Element Text -> Element Text) -> Text -> Maybe (Element Text) #
FromList Text
Instance details Defined in Universum.Container.Class Associated Types type ListElement Text # type FromListC Text # Methods fromList :: [ListElement Text] -> Text #
One Text
Instance details Defined in Universum.Container.Class Associated Types type OneItem Text # Methods one :: OneItem Text -> Text #
Print Text
Instance details Defined in Universum.Print.Internal Methods hPutStr :: Handle -> Text -> IO () # hPutStrLn :: Handle -> Text -> IO () #
ToLText Text
Instance details Defined in Universum.String.Conversion Methods toLText :: Text -> Text0 #
ToString Text
Instance details Defined in Universum.String.Conversion Methods toString :: Text -> String #
ToText Text
Instance details Defined in Universum.String.Conversion Methods toText :: Text -> Text #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
Cons Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism Text Text (Char, Text) (Char, Text) #
Snoc Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism Text Text (Text, Char) (Text, Char) #
Stream (NoShareInput Text)
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token (NoShareInput Text) # type Tokens (NoShareInput Text) # Methods tokenToChunk :: Proxy (NoShareInput Text) -> Token (NoShareInput Text) -> Tokens (NoShareInput Text) # tokensToChunk :: Proxy (NoShareInput Text) -> [Token (NoShareInput Text)] -> Tokens (NoShareInput Text) # chunkToTokens :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> [Token (NoShareInput Text)] # chunkLength :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> Int # chunkEmpty :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> Bool # take1_ :: NoShareInput Text -> Maybe (Token (NoShareInput Text), NoShareInput Text) # takeN_ :: Int -> NoShareInput Text -> Maybe (Tokens (NoShareInput Text), NoShareInput Text) # takeWhile_ :: (Token (NoShareInput Text) -> Bool) -> NoShareInput Text -> (Tokens (NoShareInput Text), NoShareInput Text) #
Stream (ShareInput Text)
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token (ShareInput Text) # type Tokens (ShareInput Text) # Methods tokenToChunk :: Proxy (ShareInput Text) -> Token (ShareInput Text) -> Tokens (ShareInput Text) # tokensToChunk :: Proxy (ShareInput Text) -> [Token (ShareInput Text)] -> Tokens (ShareInput Text) # chunkToTokens :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> [Token (ShareInput Text)] # chunkLength :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> Int # chunkEmpty :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> Bool # take1_ :: ShareInput Text -> Maybe (Token (ShareInput Text), ShareInput Text) # takeN_ :: Int -> ShareInput Text -> Maybe (Tokens (ShareInput Text), ShareInput Text) # takeWhile_ :: (Token (ShareInput Text) -> Bool) -> ShareInput Text -> (Tokens (ShareInput Text), ShareInput Text) #
type ChunkElem Text
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem Text = Char
type State Text
Instance details Defined in Data.Attoparsec.Internal.Types type State Text = Buffer
type Item Text
Instance details Defined in Data.Text type Item Text = Char
type Index Text
Instance details Defined in Control.Lens.At type Index Text = Int
type IxValue Text
Instance details Defined in Control.Lens.At type IxValue Text = Char
type Token Text
Instance details Defined in Text.Megaparsec.Stream type Token Text = Token (ShareInput Text)
type Tokens Text
Instance details Defined in Text.Megaparsec.Stream type Tokens Text = Tokens (ShareInput Text)
type ToT Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Text = ToT MText
type PrettyShow Text
Instance details Defined in Morley.Prelude.Show type PrettyShow Text = TypeError ('Text "Show instance for Text is not pretty" ':$$: 'Text "Consider relying on the Buildable instance") :: Constraint
type Element Text
Instance details Defined in Universum.Container.Class type Element Text = Char
type FromListC Text
Instance details Defined in Universum.Container.Class type FromListC Text = ()
type ListElement Text
Instance details Defined in Universum.Container.Class type ListElement Text = Item Text
type OneItem Text
Instance details Defined in Universum.Container.Class type OneItem Text = Char
type Token (NoShareInput Text)
Instance details Defined in Text.Megaparsec.Stream type Token (NoShareInput Text) = Char
type Token (ShareInput Text)
Instance details Defined in Text.Megaparsec.Stream type Token (ShareInput Text) = Char
type Tokens (NoShareInput Text)
Instance details Defined in Text.Megaparsec.Stream type Tokens (NoShareInput Text) = Text
type Tokens (ShareInput Text)
Instance details Defined in Text.Megaparsec.Stream type Tokens (ShareInput Text) = Text

type HasField dt fname = (InstrGetFieldC dt fname, InstrSetFieldC dt fname) Source #

Allows field access and modification.

type (:>) n ty = 'NamedEp n ty infixr 0 Source #

data Blake2b :: HashAlgorithmKind Source #

Instances

Instances details

KnownHashAlgorithm Blake2b Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Blake2b -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Blake2b bs ': s) Source #

data Signature #

Instances

Instances details

FromJSON Signature
Instance details Defined in Morley.Tezos.Crypto Methods parseJSON :: Value -> Parser Signature # parseJSONList :: Value -> Parser [Signature] #
ToJSON Signature
Instance details Defined in Morley.Tezos.Crypto Methods toJSON :: Signature -> Value # toEncoding :: Signature -> Encoding # toJSONList :: [Signature] -> Value # toEncodingList :: [Signature] -> Encoding #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Show Signature
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
NFData Signature
Instance details Defined in Morley.Tezos.Crypto Methods rnf :: Signature -> () #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Ord Signature
Instance details Defined in Morley.Tezos.Crypto Methods compare :: Signature -> Signature -> Ordering # (<) :: Signature -> Signature -> Bool # (<=) :: Signature -> Signature -> Bool # (>) :: Signature -> Signature -> Bool # (>=) :: Signature -> Signature -> Bool # max :: Signature -> Signature -> Signature # min :: Signature -> Signature -> Signature #
HasAnnotation Signature Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Signature) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Signature
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Signature
TypeHasDoc Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Signature :: FieldDescriptions # Methods typeDocName :: Proxy Signature -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Signature -> WithinParens -> Markdown # typeDocDependencies :: Proxy Signature -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Signature # typeDocMichelsonRep :: TypeDocMichelsonRep Signature #
IsoValue Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
Buildable Signature
Instance details Defined in Morley.Tezos.Crypto Methods build :: Signature -> Doc buildList :: [Signature] -> Doc
type Rep Signature
Instance details Defined in Morley.Tezos.Crypto type Rep Signature = D1 ('MetaData "Signature" "Morley.Tezos.Crypto" "morley-1.20.0-inplace" 'False) ((C1 ('MetaCons "SignatureEd25519" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedUnpack) (Rec0 Signature)) :+: C1 ('MetaCons "SignatureSecp256k1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Signature))) :+: (C1 ('MetaCons "SignatureP256" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Signature)) :+: (C1 ('MetaCons "SignatureBLS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedUnpack) (Rec0 Signature)) :+: C1 ('MetaCons "SignatureGeneric" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ByteString)))))
type AsRPC Signature
Instance details Defined in Morley.AsRPC type AsRPC Signature = Signature
type TypeDocFieldDescriptions Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Signature = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Signature = 'TSignature

class Default a where #

A class for types with a default value.

Minimal complete definition

Nothing

Methods

def :: a #

The default value for this type.

Instances

Instances details

Default All
Instance details Defined in Data.Default.Class Methods def :: All #
Default Any
Instance details Defined in Data.Default.Class Methods def :: Any #
Default CClock
Instance details Defined in Data.Default.Class Methods def :: CClock #
Default CDouble
Instance details Defined in Data.Default.Class Methods def :: CDouble #
Default CFloat
Instance details Defined in Data.Default.Class Methods def :: CFloat #
Default CInt
Instance details Defined in Data.Default.Class Methods def :: CInt #
Default CIntMax
Instance details Defined in Data.Default.Class Methods def :: CIntMax #
Default CIntPtr
Instance details Defined in Data.Default.Class Methods def :: CIntPtr #
Default CLLong
Instance details Defined in Data.Default.Class Methods def :: CLLong #
Default CLong
Instance details Defined in Data.Default.Class Methods def :: CLong #
Default CPtrdiff
Instance details Defined in Data.Default.Class Methods def :: CPtrdiff #
Default CSUSeconds
Instance details Defined in Data.Default.Class Methods def :: CSUSeconds #
Default CShort
Instance details Defined in Data.Default.Class Methods def :: CShort #
Default CSigAtomic
Instance details Defined in Data.Default.Class Methods def :: CSigAtomic #
Default CSize
Instance details Defined in Data.Default.Class Methods def :: CSize #
Default CTime
Instance details Defined in Data.Default.Class Methods def :: CTime #
Default CUInt
Instance details Defined in Data.Default.Class Methods def :: CUInt #
Default CUIntMax
Instance details Defined in Data.Default.Class Methods def :: CUIntMax #
Default CUIntPtr
Instance details Defined in Data.Default.Class Methods def :: CUIntPtr #
Default CULLong
Instance details Defined in Data.Default.Class Methods def :: CULLong #
Default CULong
Instance details Defined in Data.Default.Class Methods def :: CULong #
Default CUSeconds
Instance details Defined in Data.Default.Class Methods def :: CUSeconds #
Default CUShort
Instance details Defined in Data.Default.Class Methods def :: CUShort #
Default Int16
Instance details Defined in Data.Default.Class Methods def :: Int16 #
Default Int32
Instance details Defined in Data.Default.Class Methods def :: Int32 #
Default Int64
Instance details Defined in Data.Default.Class Methods def :: Int64 #
Default Int8
Instance details Defined in Data.Default.Class Methods def :: Int8 #
Default Word16
Instance details Defined in Data.Default.Class Methods def :: Word16 #
Default Word32
Instance details Defined in Data.Default.Class Methods def :: Word32 #
Default Word64
Instance details Defined in Data.Default.Class Methods def :: Word64 #
Default Word8
Instance details Defined in Data.Default.Class Methods def :: Word8 #
Default Ordering
Instance details Defined in Data.Default.Class Methods def :: Ordering #
Default AnnOptions Source #
Instance details Defined in Lorentz.Annotation Methods def :: AnnOptions #
Default DeriveRPCOptions
Instance details Defined in Morley.AsRPC Methods def :: DeriveRPCOptions #
Default ErrorSrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: ErrorSrcPos #
Default Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: Pos #
Default SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: SrcPos #
Default MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods def :: MorleyLogsBuilder #
Default OptimizerConf
Instance details Defined in Morley.Michelson.Optimizer Methods def :: OptimizerConf #
Default Ruleset
Instance details Defined in Morley.Michelson.Optimizer.Internal.Ruleset Methods def :: Ruleset #
Default TypeCheckInstrEnv
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods def :: TypeCheckInstrEnv #
Default TypeCheckOptions
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods def :: TypeCheckOptions #
Default EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods def :: EntriesOrder #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
Default ()
Instance details Defined in Data.Default.Class Methods def :: () #
Default Double
Instance details Defined in Data.Default.Class Methods def :: Double #
Default Float
Instance details Defined in Data.Default.Class Methods def :: Float #
Default Int
Instance details Defined in Data.Default.Class Methods def :: Int #
Default Word
Instance details Defined in Data.Default.Class Methods def :: Word #
(Default a, RealFloat a) => Default (Complex a)
Instance details Defined in Data.Default.Class Methods def :: Complex a #
Default (First a)
Instance details Defined in Data.Default.Class Methods def :: First a #
Default (Last a)
Instance details Defined in Data.Default.Class Methods def :: Last a #
Default a => Default (Dual a)
Instance details Defined in Data.Default.Class Methods def :: Dual a #
Default (Endo a)
Instance details Defined in Data.Default.Class Methods def :: Endo a #
Num a => Default (Product a)
Instance details Defined in Data.Default.Class Methods def :: Product a #
Num a => Default (Sum a)
Instance details Defined in Data.Default.Class Methods def :: Sum a #
Integral a => Default (Ratio a)
Instance details Defined in Data.Default.Class Methods def :: Ratio a #
Default a => Default (IO a)
Instance details Defined in Data.Default.Class Methods def :: IO a #
mname ~ ('Nothing :: Maybe Symbol) => Default (EntrypointRef mname) Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods def :: EntrypointRef mname #
Default (ViewsSetF a)
Instance details Defined in Morley.Michelson.Internal.ViewsSet Methods def :: ViewsSetF a #
(SingI t, Default (Anns xs)) => Default (Anns (Notes t ': xs))
Instance details Defined in Morley.Michelson.Typed.Annotation Methods def :: Anns (Notes t ': xs) #
(Typeable tag, Default (Anns xs)) => Default (Anns (Annotation tag ': xs))
Instance details Defined in Morley.Michelson.Typed.Annotation Methods def :: Anns (Annotation tag ': xs) #
Default (Anns ('[] :: [Type]))
Instance details Defined in Morley.Michelson.Typed.Annotation Methods def :: Anns '[] #
Applicative x => Default (DfsSettings x)
Instance details Defined in Morley.Michelson.Typed.Util Methods def :: DfsSettings x #
Default (ViewsSet instr)
Instance details Defined in Morley.Michelson.Untyped.View Methods def :: ViewsSet instr #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Default [a]
Instance details Defined in Data.Default.Class Methods def :: [a] #
Default (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
Default (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods def :: ViewsSet' instr st #
Default (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods def :: Annotation tag #
Default r => Default (e -> r)
Instance details Defined in Data.Default.Class Methods def :: e -> r #
(Default a, Default b) => Default (a, b)
Instance details Defined in Data.Default.Class Methods def :: (a, b) #
(Default a, Default b, Default c) => Default (a, b, c)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c) #
(Default a, Default b, Default c, Default d) => Default (a, b, c, d)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d) #
(Default a, Default b, Default c, Default d, Default e) => Default (a, b, c, d, e)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e) #
(Default a, Default b, Default c, Default d, Default e, Default f) => Default (a, b, c, d, e, f)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f) #
(Default a, Default b, Default c, Default d, Default e, Default f, Default g) => Default (a, b, c, d, e, f, g)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f, g) #

type (?:) (n :: Symbol) (a :: k) = '(n, a) Source #

A convenient alias for type-level name-something pair.

newtype Hash (alg :: HashAlgorithmKind) a Source #

Hash of type t evaluated from data of type a.

Constructors

UnsafeHash
Fields unHash :: ByteString

Instances

Instances details

CanCastTo (Hash alg a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg a) -> Proxy ByteString -> () Source #
(CanCastTo alg1 alg2, CanCastTo a1 a2) => CanCastTo (Hash alg1 a1 :: Type) (Hash alg2 a2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg1 a1) -> Proxy (Hash alg2 a2) -> () Source #
Generic (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Hash alg a) :: Type -> Type # Methods from :: Hash alg a -> Rep (Hash alg a) x # to :: Rep (Hash alg a) x -> Hash alg a #
Show (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Hash alg a -> ShowS # show :: Hash alg a -> String # showList :: [Hash alg a] -> ShowS #
Eq (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Hash alg a -> Hash alg a -> Bool # (/=) :: Hash alg a -> Hash alg a -> Bool #
Ord (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Hash alg a -> Hash alg a -> Ordering # (<) :: Hash alg a -> Hash alg a -> Bool # (<=) :: Hash alg a -> Hash alg a -> Bool # (>) :: Hash alg a -> Hash alg a -> Bool # (>=) :: Hash alg a -> Hash alg a -> Bool # max :: Hash alg a -> Hash alg a -> Hash alg a # min :: Hash alg a -> Hash alg a -> Hash alg a #
HasAnnotation (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Hash alg a)) Source # annOptions :: Maybe AnnOptions Source #
(Typeable alg, Typeable a) => BytesLike (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: Hash alg a -> ByteString Source #
HasRPCRepr (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type AsRPC (Hash alg a)
(KnownHashAlgorithm alg, TypeHasDoc a) => TypeHasDoc (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (Hash alg a) :: FieldDescriptions # Methods typeDocName :: Proxy (Hash alg a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Hash alg a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Hash alg a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Hash alg a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Hash alg a) #
IsoValue (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Hash alg a) :: T # Methods toVal :: Hash alg a -> Value (ToT (Hash alg a)) # fromVal :: Value (ToT (Hash alg a)) -> Hash alg a #
Buildable (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods build :: Hash alg a -> Doc buildList :: [Hash alg a] -> Doc
type Rep (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type Rep (Hash alg a) = D1 ('MetaData "Hash" "Lorentz.Bytes" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "UnsafeHash" 'PrefixI 'True) (S1 ('MetaSel ('Just "unHash") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ByteString)))
type AsRPC (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type AsRPC (Hash alg a) = Hash alg a
type TypeDocFieldDescriptions (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (Hash alg a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type ToT (Hash alg a) = ToT ByteString

data Label (name :: Symbol) where #

Constructors

Label :: forall (name :: Symbol). KnownSymbol name => Label name

Instances

Instances details

(KnownSymbol name, s ~ name) => IsLabel s (Label name)
Instance details Defined in Morley.Util.Label Methods fromLabel :: Label name #
Show (Label name)
Instance details Defined in Morley.Util.Label Methods showsPrec :: Int -> Label name -> ShowS # show :: Label name -> String # showList :: [Label name] -> ShowS #
Eq (Label name)
Instance details Defined in Morley.Util.Label Methods (==) :: Label name -> Label name -> Bool # (/=) :: Label name -> Label name -> Bool #
Buildable (Label name)
Instance details Defined in Morley.Util.Label Methods build :: Label name -> Doc buildList :: [Label name] -> Doc

type (:?) (name :: Symbol) a = NamedF Maybe a name #

Infix notation for the type of an optional named parameter.

type (:!) (name :: Symbol) a = NamedF Identity a name #

Infix notation for the type of a named parameter.

data k ~> v infix 9 Source #

Indicates a submap with given key and value types.

type (%>) = (:->) infixr 1 Source #

Alias for :->, seems to make signatures more readable sometimes.

Let's someday decide which one of these two should remain.

data DType where #

Constructors

DType :: forall a. TypeHasDoc a => Proxy a -> DType

Instances

Instances details

Eq DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Ord DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods compare :: DType -> DType -> Ordering # (<) :: DType -> DType -> Bool # (<=) :: DType -> DType -> Bool # (>) :: DType -> DType -> Bool # (>=) :: DType -> DType -> Bool # max :: DType -> DType -> DType # min :: DType -> DType -> DType #
DocItem DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type DocItemPlacement DType :: DocItemPlacementKind # type DocItemReferenced DType :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DType -> DocItemRef (DocItemPlacement DType) (DocItemReferenced DType) # docItemToMarkdown :: HeaderLevel -> DType -> Markdown # docItemToToc :: HeaderLevel -> DType -> Markdown # docItemDependencies :: DType -> [SomeDocDefinitionItem] # docItemsOrder :: [DType] -> [DType] #
Buildable DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods build :: DType -> Doc buildList :: [DType] -> Doc
type DocItemPlacement DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemPlacement DType = 'DocItemInDefinitions
type DocItemReferenced DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemReferenced DType = 'True

type Expr inp out res = inp :-> (res : out) Source #

Expression is just an instruction accepting stack inp and producing stack out with evaluation result res at the top.

newtype Range a Source #

Default range, inclusive in both boundaries.

Constructors

MkRangeII (Range' 'IncludeBoundary 'IncludeBoundary a)

Warning: Avoid using data constructors directly, use mkRange instead.

Instances

Instances details

KnownValue a => NiceRange Range 'IncludeBoundary 'IncludeBoundary a Source #
Instance details Defined in Lorentz.Range
Generic (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (Range a) :: Type -> Type # Methods from :: Range a -> Rep (Range a) x # to :: Rep (Range a) x -> Range a #
Show a => Show (Range a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> Range a -> ShowS # show :: Range a -> String # showList :: [Range a] -> ShowS #
Eq a => Eq (Range a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: Range a -> Range a -> Bool # (/=) :: Range a -> Range a -> Bool #
HasAnnotation a => HasAnnotation (Range a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Range a)) Source # annOptions :: Maybe AnnOptions Source #
TypeHasDoc a => TypeHasDoc (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (Range a) :: FieldDescriptions # Methods typeDocName :: Proxy (Range a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Range a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Range a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Range a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Range a) #
IsoValue a => IsoValue (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (Range a) :: T # Methods toVal :: Range a -> Value (ToT (Range a)) # fromVal :: Value (ToT (Range a)) -> Range a #
Buildable a => Buildable (Range a) Source #
Instance details Defined in Lorentz.Range Methods build :: Range a -> Doc buildList :: [Range a] -> Doc
type Rep (Range a) Source #
Instance details Defined in Lorentz.Range type Rep (Range a)
type TypeDocFieldDescriptions (Range a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (Range a)
type ToT (Range a) Source #
Instance details Defined in Lorentz.Range type ToT (Range a) = GValueType (GRep (Range a))

data Rec (a :: u -> Type) (b :: [u]) where #

A record is parameterized by a universe u, an interpretation f and a list of rows rs. The labels or indices of the record are given by inhabitants of the kind u; the type of values at any label r :: u is given by its interpretation f r :: *.

Constructors

RNil :: forall {u} (a :: u -> Type). Rec a ('[] :: [u])
(:&) :: forall {u} (a :: u -> Type) (r :: u) (rs :: [u]). !(a r) -> !(Rec a rs) -> Rec a (r ': rs) infixr 7

Instances

Instances details

RecSubset (Rec :: (k -> Type) -> [k] -> Type) ('[] :: [k]) (ss :: [k]) ('[] :: [Nat])
Instance details Defined in Data.Vinyl.Lens Associated Types type RecSubsetFCtx Rec f # Methods rsubsetC :: forall g (f :: k0 -> Type). (Functor g, RecSubsetFCtx Rec f) => (Rec f '[] -> g (Rec f '[])) -> Rec f ss -> g (Rec f ss) # rcastC :: forall (f :: k0 -> Type). RecSubsetFCtx Rec f => Rec f ss -> Rec f '[] # rreplaceC :: forall (f :: k0 -> Type). RecSubsetFCtx Rec f => Rec f '[] -> Rec f ss -> Rec f ss #
(RElem r ss i, RSubset rs ss is) => RecSubset (Rec :: (k -> Type) -> [k] -> Type) (r ': rs :: [k]) (ss :: [k]) (i ': is)
Instance details Defined in Data.Vinyl.Lens Associated Types type RecSubsetFCtx Rec f # Methods rsubsetC :: forall g (f :: k0 -> Type). (Functor g, RecSubsetFCtx Rec f) => (Rec f (r ': rs) -> g (Rec f (r ': rs))) -> Rec f ss -> g (Rec f ss) # rcastC :: forall (f :: k0 -> Type). RecSubsetFCtx Rec f => Rec f ss -> Rec f (r ': rs) # rreplaceC :: forall (f :: k0 -> Type). RecSubsetFCtx Rec f => Rec f (r ': rs) -> Rec f ss -> Rec f ss #
RecElem (Rec :: (a -> Type) -> [a] -> Type) (r :: a) (r' :: a) (r ': rs :: [a]) (r' ': rs :: [a]) 'Z
Instance details Defined in Data.Vinyl.Lens Associated Types type RecElemFCtx Rec f # Methods rlensC :: (Functor g, RecElemFCtx Rec f) => (f r -> g (f r')) -> Rec f (r ': rs) -> g (Rec f (r' ': rs)) # rgetC :: (RecElemFCtx Rec f, r ~ r') => Rec f (r ': rs) -> f r # rputC :: RecElemFCtx Rec f => f r' -> Rec f (r ': rs) -> Rec f (r' ': rs) #
(RIndex r (s ': rs) ~ 'S i, RecElem (Rec :: (a -> Type) -> [a] -> Type) r r' rs rs' i) => RecElem (Rec :: (a -> Type) -> [a] -> Type) (r :: a) (r' :: a) (s ': rs :: [a]) (s ': rs' :: [a]) ('S i)
Instance details Defined in Data.Vinyl.Lens Associated Types type RecElemFCtx Rec f # Methods rlensC :: (Functor g, RecElemFCtx Rec f) => (f r -> g (f r')) -> Rec f (s ': rs) -> g (Rec f (s ': rs')) # rgetC :: (RecElemFCtx Rec f, r ~ r') => Rec f (s ': rs) -> f r # rputC :: RecElemFCtx Rec f => f r' -> Rec f (s ': rs) -> Rec f (s ': rs') #
TestCoercion f => TestCoercion (Rec f :: [u] -> Type)
Instance details Defined in Data.Vinyl.Core Methods testCoercion :: forall (a :: k) (b :: k). Rec f a -> Rec f b -> Maybe (Coercion a b) #
TestEquality f => TestEquality (Rec f :: [u] -> Type)
Instance details Defined in Data.Vinyl.Core Methods testEquality :: forall (a :: k) (b :: k). Rec f a -> Rec f b -> Maybe (a :~: b) #
(Storable (f r), Storable (Rec f rs)) => Storable (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods sizeOf :: Rec f (r ': rs) -> Int # alignment :: Rec f (r ': rs) -> Int # peekElemOff :: Ptr (Rec f (r ': rs)) -> Int -> IO (Rec f (r ': rs)) # pokeElemOff :: Ptr (Rec f (r ': rs)) -> Int -> Rec f (r ': rs) -> IO () # peekByteOff :: Ptr b -> Int -> IO (Rec f (r ': rs)) # pokeByteOff :: Ptr b -> Int -> Rec f (r ': rs) -> IO () # peek :: Ptr (Rec f (r ': rs)) -> IO (Rec f (r ': rs)) # poke :: Ptr (Rec f (r ': rs)) -> Rec f (r ': rs) -> IO () #
Storable (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods sizeOf :: Rec f '[] -> Int # alignment :: Rec f '[] -> Int # peekElemOff :: Ptr (Rec f '[]) -> Int -> IO (Rec f '[]) # pokeElemOff :: Ptr (Rec f '[]) -> Int -> Rec f '[] -> IO () # peekByteOff :: Ptr b -> Int -> IO (Rec f '[]) # pokeByteOff :: Ptr b -> Int -> Rec f '[] -> IO () # peek :: Ptr (Rec f '[]) -> IO (Rec f '[]) # poke :: Ptr (Rec f '[]) -> Rec f '[] -> IO () #
(Monoid (f r), Monoid (Rec f rs)) => Monoid (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f (r ': rs) # mappend :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # mconcat :: [Rec f (r ': rs)] -> Rec f (r ': rs) #
Monoid (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f '[] # mappend :: Rec f '[] -> Rec f '[] -> Rec f '[] # mconcat :: [Rec f '[]] -> Rec f '[] #
(Semigroup (f r), Semigroup (Rec f rs)) => Semigroup (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # sconcat :: NonEmpty (Rec f (r ': rs)) -> Rec f (r ': rs) # stimes :: Integral b => b -> Rec f (r ': rs) -> Rec f (r ': rs) #
Semigroup (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f '[] -> Rec f '[] -> Rec f '[] # sconcat :: NonEmpty (Rec f '[]) -> Rec f '[] # stimes :: Integral b => b -> Rec f '[] -> Rec f '[] #
Generic (Rec f rs) => Generic (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f (r ': rs)) :: Type -> Type # Methods from :: Rec f (r ': rs) -> Rep (Rec f (r ': rs)) x # to :: Rep (Rec f (r ': rs)) x -> Rec f (r ': rs) #
Generic (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f '[]) :: Type -> Type # Methods from :: Rec f '[] -> Rep (Rec f '[]) x # to :: Rep (Rec f '[]) x -> Rec f '[] #
(RMap rs, ReifyConstraint Show f rs, RecordToList rs) => Show (Rec f rs)	Records may be shown insofar as their points may be shown. `reifyConstraint` is used to great effect here.
Instance details Defined in Data.Vinyl.Core Methods showsPrec :: Int -> Rec f rs -> ShowS # show :: Rec f rs -> String # showList :: [Rec f rs] -> ShowS #
ReifyConstraint NFData f xs => NFData (Rec f xs)
Instance details Defined in Data.Vinyl.Core Methods rnf :: Rec f xs -> () #
(Eq (f r), Eq (Rec f rs)) => Eq (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (/=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool #
Eq (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f '[] -> Rec f '[] -> Bool # (/=) :: Rec f '[] -> Rec f '[] -> Bool #
(Ord (f r), Ord (Rec f rs)) => Ord (Rec f (r ': rs))
Instance details 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]))
Instance details Defined in Data.Vinyl.Core Methods compare :: Rec f '[] -> Rec f '[] -> Ordering # (<) :: Rec f '[] -> Rec f '[] -> Bool # (<=) :: Rec f '[] -> Rec f '[] -> Bool # (>) :: Rec f '[] -> Rec f '[] -> Bool # (>=) :: Rec f '[] -> Rec f '[] -> Bool # max :: Rec f '[] -> Rec f '[] -> Rec f '[] # min :: Rec f '[] -> Rec f '[] -> Rec f '[] #
type RecSubsetFCtx (Rec :: (k -> Type) -> [k] -> Type) (f :: k -> Type)
Instance details Defined in Data.Vinyl.Lens type RecSubsetFCtx (Rec :: (k -> Type) -> [k] -> Type) (f :: k -> Type) = ()
type RecSubsetFCtx (Rec :: (k -> Type) -> [k] -> Type) (f :: k -> Type)
Instance details Defined in Data.Vinyl.Lens type RecSubsetFCtx (Rec :: (k -> Type) -> [k] -> Type) (f :: k -> Type) = ()
type RecElemFCtx (Rec :: (a -> Type) -> [a] -> Type) (f :: a -> Type)
Instance details Defined in Data.Vinyl.Lens type RecElemFCtx (Rec :: (a -> Type) -> [a] -> Type) (f :: a -> Type) = ()
type RecElemFCtx (Rec :: (a -> Type) -> [a] -> Type) (f :: a -> Type)
Instance details Defined in Data.Vinyl.Lens type RecElemFCtx (Rec :: (a -> Type) -> [a] -> Type) (f :: a -> Type) = ()
type Rep (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core type Rep (Rec f (r ': rs)) = C1 ('MetaCons ":&" ('InfixI 'RightAssociative 7) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (f r)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rep (Rec f rs)))
type Rep (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core type Rep (Rec f ('[] :: [u])) = C1 ('MetaCons "RNil" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (U1 :: Type -> Type))
type IsoRecTuple (Rec f '[a])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[a]) = f a
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20, f x21, f x22, f x23, f x24, f x25)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20, f x21, f x22, f x23, f x24)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20, f x21, f x22, f x23)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20, f x21, f x22)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20, f x21)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19, f x20)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18, f x19)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17, f x18)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16, f x17)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15, f x16)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14, f x15)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13, f x14)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12, f x13)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11, f x12)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10, f x11)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9, x10]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9, f x10)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8, x9]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8, f x9)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7, x8]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7, f x8)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6, x7]) = (f x1, f x2, f x3, f x4, f x5, f x6, f x7)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5, x6]) = (f x1, f x2, f x3, f x4, f x5, f x6)
type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4, x5]) = (f x1, f x2, f x3, f x4, f x5)
type IsoRecTuple (Rec f '[x1, x2, x3, x4])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3, x4]) = (f x1, f x2, f x3, f x4)
type IsoRecTuple (Rec f '[x1, x2, x3])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2, x3]) = (f x1, f x2, f x3)
type IsoRecTuple (Rec f '[x1, x2])
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2]) = (f x1, f x2)
type IsoRecTuple (Rec f ('[] :: [u]))
Instance details Defined in Morley.Util.TypeTuple.Instances type IsoRecTuple (Rec f ('[] :: [u])) = ()

type Address = Constrained (NullConstraint :: AddressKind -> Constraint) KindedAddress #

type Lambda i o = WrappedLambda '[i] '[o] Source #

A type synonym representing Michelson lambdas.

newtype UParam (entries :: [EntrypointKind]) Source #

Encapsulates parameter for one of entry points. It keeps entrypoint name and corresponding argument serialized.

In Haskell world, we keep an invariant of that contained value relates to one of entry points from entries list.

Constructors

UnsafeUParam (MText, ByteString)

Instances

Instances details

SameEntries entries1 entries2 => CanCastTo (UParam entries1 :: Type) (UParam entries2 :: Type) Source #	Allows casts only between `UParam_` and `UParam`.
Instance details Defined in Lorentz.UParam Methods castDummy :: Proxy (UParam entries1) -> Proxy (UParam entries2) -> () Source #
Generic (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep (UParam entries) :: Type -> Type # Methods from :: UParam entries -> Rep (UParam entries) x # to :: Rep (UParam entries) x -> UParam entries #
Show (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> UParam entries -> ShowS # show :: UParam entries -> String # showList :: [UParam entries] -> ShowS #
Eq (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods (==) :: UParam entries -> UParam entries -> Bool # (/=) :: UParam entries -> UParam entries -> Bool #
HasAnnotation (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UParam entries)) Source # annOptions :: Maybe AnnOptions Source #
Unwrappable (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type Unwrappabled (UParam entries) Source #
HasRPCRepr (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type AsRPC (UParam entries)
Typeable interface => TypeHasDoc (UParam interface) Source #
Instance details Defined in Lorentz.UParam Associated Types type TypeDocFieldDescriptions (UParam interface) :: FieldDescriptions # Methods typeDocName :: Proxy (UParam interface) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (UParam interface) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (UParam interface) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (UParam interface) # typeDocMichelsonRep :: TypeDocMichelsonRep (UParam interface) #
IsoValue (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type ToT (UParam entries) :: T # Methods toVal :: UParam entries -> Value (ToT (UParam entries)) # fromVal :: Value (ToT (UParam entries)) -> UParam entries #
type Rep (UParam entries) Source #
Instance details Defined in Lorentz.UParam type Rep (UParam entries) = D1 ('MetaData "UParam" "Lorentz.UParam" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "UnsafeUParam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (MText, ByteString))))
type Unwrappabled (UParam entries) Source #
Instance details Defined in Lorentz.UParam type Unwrappabled (UParam entries)
type AsRPC (UParam entries) Source #
Instance details Defined in Lorentz.UParam type AsRPC (UParam entries) = UParam entries
type TypeDocFieldDescriptions (UParam interface) Source #
Instance details Defined in Lorentz.UParam type TypeDocFieldDescriptions (UParam interface) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (UParam entries) Source #
Instance details Defined in Lorentz.UParam type ToT (UParam entries) = GValueType (GRep (UParam entries))

newtype TAddress (p :: Type) (vd :: Type) Source #

Address which remembers the parameter and views types of the contract it refers to.

It differs from Michelson's contract type because it cannot contain entrypoint, and it always refers to entire contract parameter even if this contract has explicit default entrypoint.

Constructors

TAddress
Fields unTAddress :: Address

Instances

Instances details

CanCastTo Address (TAddress p vd :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p vd) -> () Source #
(cp ~ cp', vd ~ vd') => ToTAddress cp vd (TAddress cp' vd') Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: TAddress cp' vd' -> TAddress cp vd Source #
CanCastTo (TAddress p vd :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p vd) -> Proxy Address -> () Source #
(FailWhen cond msg, cond ~ (CanHaveEntrypoints cp && Not (ParameterEntrypointsDerivation cp == EpdNone)), msg ~ (((('Text "Cannot apply `ToContractRef` to `TAddress`" ':$$: 'Text "Consider using call(Def)TAddress first`") ':$$: 'Text "(or if you know your parameter type is primitive,") ':$$: 'Text " make sure typechecker also knows about that)") ':$$: (('Text "For parameter `" ':<>: 'ShowType cp) ':<>: 'Text "`")), cp ~ arg, NiceParameter arg, NiceParameterFull cp, GetDefaultEntrypointArg cp ~ cp) => ToContractRef arg (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: TAddress cp vd -> ContractRef arg Source #
Generic (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Associated Types type Rep (TAddress p vd) :: Type -> Type # Methods from :: TAddress p vd -> Rep (TAddress p vd) x # to :: Rep (TAddress p vd) x -> TAddress p vd #
Show (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods showsPrec :: Int -> TAddress p vd -> ShowS # show :: TAddress p vd -> String # showList :: [TAddress p vd] -> ShowS #
Eq (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods (==) :: TAddress p vd -> TAddress p vd -> Bool # (/=) :: TAddress p vd -> TAddress p vd -> Bool #
Ord (TAddress p vd) Source #
Instance details 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 # max :: TAddress p vd -> TAddress p vd -> TAddress p vd # min :: TAddress p vd -> TAddress p vd -> TAddress p vd #
ToAddress (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: TAddress cp vd -> Address Source #
HasAnnotation (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TAddress p vd)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address Associated Types type AsRPC (TAddress cp vd)
(TypeHasDoc p, ViewsDescriptorHasDoc vd) => TypeHasDoc (TAddress p vd) Source #
Instance details Defined in Lorentz.Doc Associated Types type TypeDocFieldDescriptions (TAddress p vd) :: FieldDescriptions # Methods typeDocName :: Proxy (TAddress p vd) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (TAddress p vd) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (TAddress p vd) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (TAddress p vd) # typeDocMichelsonRep :: TypeDocMichelsonRep (TAddress p vd) #
IsoValue (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (TAddress p vd) :: T # Methods toVal :: TAddress p vd -> Value (ToT (TAddress p vd)) # fromVal :: Value (ToT (TAddress p vd)) -> TAddress p vd #
Buildable (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods build :: TAddress p vd -> Doc buildList :: [TAddress p vd] -> Doc
type Rep (TAddress p vd) Source #
Instance details Defined in Lorentz.Address type Rep (TAddress p vd) = D1 ('MetaData "TAddress" "Lorentz.Address" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "TAddress" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTAddress") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Address)))
type AsRPC (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address type AsRPC (TAddress cp vd) = TAddress cp vd
type TypeDocFieldDescriptions (TAddress p vd) Source #
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (TAddress p vd) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (TAddress p vd) Source #
Instance details Defined in Lorentz.Address type ToT (TAddress p vd) = GValueType (GRep (TAddress p vd))

newtype FutureContract arg Source #

Address associated with value of contract arg type.

Places where ContractRef can appear are now severely limited, this type gives you type-safety of ContractRef but still can be used everywhere. This type is not a full-featured one rather a helper; in particular, once pushing it on stack, you cannot return it back to Haskell world.

Note that it refers to an entrypoint of the contract, not just the contract as a whole. In this sense this type differs from TAddress.

Unlike with ContractRef, having this type you still cannot be sure that the referred contract exists and need to perform a lookup before calling it.

Constructors

FutureContract
Fields unFutureContract :: ContractRef arg

Instances

Instances details

CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () Source #
cp ~ cp' => FromContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> FutureContract cp' Source #
(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: FutureContract cp' -> ContractRef cp Source #
ToAddress (FutureContract cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: FutureContract cp -> Address Source #
HasAnnotation (FutureContract a) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr (FutureContract p) Source #
Instance details Defined in Lorentz.Address Associated Types type AsRPC (FutureContract p)
TypeHasDoc p => TypeHasDoc (FutureContract p) Source #
Instance details Defined in Lorentz.Doc Associated Types type TypeDocFieldDescriptions (FutureContract p) :: FieldDescriptions # Methods typeDocName :: Proxy (FutureContract p) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (FutureContract p) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (FutureContract p) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (FutureContract p) # typeDocMichelsonRep :: TypeDocMichelsonRep (FutureContract p) #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
type AsRPC (FutureContract p) Source #
Instance details Defined in Lorentz.Address type AsRPC (FutureContract p) = FutureContract p
type TypeDocFieldDescriptions (FutureContract p) Source #
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (FutureContract p) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (FutureContract arg) Source #
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress

class ToAddress a where Source #

Convert something to Address in Haskell world.

Use this when you want to access state of the contract and are not interested in calling it.

Methods

toAddress :: a -> Address Source #

Instances

Instances details

ToAddress EpAddress Source #
Instance details Defined in Lorentz.Address Methods toAddress :: EpAddress -> Address Source #
ToAddress Address Source #
Instance details Defined in Lorentz.Address Methods toAddress :: Address -> Address Source #
ToAddress L1Address Source #
Instance details Defined in Lorentz.Address Methods toAddress :: L1Address -> Address Source #
ToAddress (FutureContract cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: FutureContract cp -> Address Source #
ToAddress (ContractRef cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: ContractRef cp -> Address Source #
ToAddress (KindedAddress kind) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: KindedAddress kind -> Address Source #
ToAddress (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: TAddress cp vd -> Address Source #

class ToTAddress (cp :: Type) (vd :: Type) (a :: Type) where Source #

Convert something referring to a contract (not specific entrypoint) to TAddress in Haskell world.

Methods

toTAddress :: a -> TAddress cp vd Source #

Instances

Instances details

ToTAddress cp vd Address Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: Address -> TAddress cp vd Source #
ToTAddress cp vd ContractAddress Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: ContractAddress -> TAddress cp vd Source #
(ImplicitContractParameter cp (ToT cp), vd ~ ()) => ToTAddress cp vd ImplicitAddress Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: ImplicitAddress -> TAddress cp vd Source #
ToTAddress cp vd L1Address Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: L1Address -> TAddress cp vd Source #
vd ~ () => ToTAddress cp vd SmartRollupAddress Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: SmartRollupAddress -> TAddress cp vd Source #
(cp ~ cp', vd ~ vd') => ToTAddress cp vd (TAddress cp' vd') Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: TAddress cp' vd' -> TAddress cp vd Source #

type ToTAddress_ cp vd addr = (ToTAddress cp vd addr, ToT addr ~ ToT Address) Source #

Something coercible to 'TAddress cp'.

class ToContractRef (cp :: Type) (contract :: Type) where Source #

Convert something to ContractRef in Haskell world.

Methods

toContractRef :: HasCallStack => contract -> ContractRef cp Source #

Instances

Instances details

(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: FutureContract cp' -> ContractRef cp Source #
cp ~ cp' => ToContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: ContractRef cp' -> ContractRef cp Source #
(FailWhen cond msg, cond ~ (CanHaveEntrypoints cp && Not (ParameterEntrypointsDerivation cp == EpdNone)), msg ~ (((('Text "Cannot apply `ToContractRef` to `TAddress`" ':$$: 'Text "Consider using call(Def)TAddress first`") ':$$: 'Text "(or if you know your parameter type is primitive,") ':$$: 'Text " make sure typechecker also knows about that)") ':$$: (('Text "For parameter `" ':<>: 'ShowType cp) ':<>: 'Text "`")), cp ~ arg, NiceParameter arg, NiceParameterFull cp, GetDefaultEntrypointArg cp ~ cp) => ToContractRef arg (TAddress cp vd) Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: TAddress cp vd -> ContractRef arg Source #

class FromContractRef (cp :: Type) (contract :: Type) where Source #

Convert something from ContractRef in Haskell world.

Methods

fromContractRef :: ContractRef cp -> contract Source #

Instances

Instances details

FromContractRef cp EpAddress Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> EpAddress Source #
FromContractRef cp Address Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> Address Source #
cp ~ cp' => FromContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> FutureContract cp' Source #
cp ~ cp' => FromContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> ContractRef cp' Source #

class ToT cp ~ totcp => ImplicitContractParameter cp totcp Source #

We use this type class to forcibly default ambiguous parameter type to (), but still allow for other types. It also doubles as a proxy for a custom TypeError.

Instances

Instances details

(CheckImplicitContractParameter cp totcp, cp ~ (), totcp ~ 'TUnit) => ImplicitContractParameter cp totcp Source #
Instance details Defined in Lorentz.Address
ToT cp ~ 'TTicket t => ImplicitContractParameter cp ('TTicket t) Source #
Instance details Defined in Lorentz.Address

data EpAddress #

Constructors

EpAddress'
Fields eaAddress :: Address eaEntrypoint :: EpName

Bundled Patterns

pattern EpAddress :: forall (kind :: AddressKind). () => KindedAddress kind -> EpName -> EpAddress

Instances

Instances details

Generic EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep EpAddress :: Type -> Type # Methods from :: EpAddress -> Rep EpAddress x # to :: Rep EpAddress x -> EpAddress #
Show EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
NFData EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods rnf :: EpAddress -> () #
Eq EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Ord EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods compare :: EpAddress -> EpAddress -> Ordering # (<) :: EpAddress -> EpAddress -> Bool # (<=) :: EpAddress -> EpAddress -> Bool # (>) :: EpAddress -> EpAddress -> Bool # (>=) :: EpAddress -> EpAddress -> Bool # max :: EpAddress -> EpAddress -> EpAddress # min :: EpAddress -> EpAddress -> EpAddress #
ToAddress EpAddress Source #
Instance details Defined in Lorentz.Address Methods toAddress :: EpAddress -> Address Source #
HasAnnotation EpAddress Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr EpAddress
Instance details Defined in Morley.AsRPC Associated Types type AsRPC EpAddress
TypeHasDoc EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions EpAddress :: FieldDescriptions # Methods typeDocName :: Proxy EpAddress -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy EpAddress -> WithinParens -> Markdown # typeDocDependencies :: Proxy EpAddress -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep EpAddress # typeDocMichelsonRep :: TypeDocMichelsonRep EpAddress #
IsoValue EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
Buildable EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods build :: EpAddress -> Doc buildList :: [EpAddress] -> Doc
FromContractRef cp EpAddress Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> EpAddress Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () Source #
type Rep EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints type Rep EpAddress = D1 ('MetaData "EpAddress" "Morley.Michelson.Typed.Entrypoints" "morley-1.20.0-inplace" 'False) (C1 ('MetaCons "EpAddress'" 'PrefixI 'True) (S1 ('MetaSel ('Just "eaAddress") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Address) :*: S1 ('MetaSel ('Just "eaEntrypoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 EpName)))
type AsRPC EpAddress
Instance details Defined in Morley.AsRPC type AsRPC EpAddress = EpAddress
type TypeDocFieldDescriptions EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress

data ContractRef arg #

Constructors

ContractRef
Fields crAddress :: Address crEntrypoint :: SomeEntrypointCall arg

Instances

Instances details

CanCastTo a1 a2 => CanCastTo (ContractRef a1 :: Type) (ContractRef a2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ContractRef a1) -> Proxy (ContractRef a2) -> () Source #
cp ~ cp' => FromContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> ContractRef cp' Source #
cp ~ cp' => ToContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: ContractRef cp' -> ContractRef cp Source #
Show (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
Eq (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
ToAddress (ContractRef cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: ContractRef cp -> Address Source #
HasAnnotation a => HasAnnotation (ContractRef a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr (ContractRef arg)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (ContractRef arg)
PolyTypeHasDocC '[cp] => TypeHasDoc (ContractRef cp)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (ContractRef cp) :: FieldDescriptions # Methods typeDocName :: Proxy (ContractRef cp) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ContractRef cp) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ContractRef cp) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (ContractRef cp) # typeDocMichelsonRep :: TypeDocMichelsonRep (ContractRef cp) #
(HasNoOpToT arg, ForbidNestedBigMaps (ToT arg), WellTypedToT arg) => IsoValue (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
IsoValue (ContractRef arg) => Buildable (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods build :: ContractRef arg -> Doc buildList :: [ContractRef arg] -> Doc
type AsRPC (ContractRef arg)
Instance details Defined in Morley.AsRPC type AsRPC (ContractRef arg) = ContractRef arg
type TypeDocFieldDescriptions (ContractRef cp)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)

class WellTypedToT a => IsoValue a where #

Minimal complete definition

Nothing

Associated Types

type ToT a :: T #

type ToT a = GValueType (GRep a)

Methods

toVal :: a -> Value (ToT a) #

fromVal :: Value (ToT a) -> a #

Instances

Instances details

IsoValue Void
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Void :: T # Methods toVal :: Void -> Value (ToT Void) # fromVal :: Value (ToT Void) -> Void #
IsoValue ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
IsoValue NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type ToT NRational :: T # Methods toVal :: NRational -> Value (ToT NRational) # fromVal :: Value (ToT NRational) -> NRational #
IsoValue Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type ToT Rational :: T # Methods toVal :: Rational -> Value (ToT Rational) # fromVal :: Value (ToT Rational) -> Rational #
IsoValue UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ToT UnspecifiedError :: T # Methods toVal :: UnspecifiedError -> Value (ToT UnspecifiedError) # fromVal :: Value (ToT UnspecifiedError) -> UnspecifiedError #
IsoValue Never Source #
Instance details Defined in Lorentz.Value Associated Types type ToT Never :: T # Methods toVal :: Never -> Value (ToT Never) # fromVal :: Value (ToT Never) -> Never #
IsoValue OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type ToT OpenChest :: T # Methods toVal :: OpenChest -> Value (ToT OpenChest) # fromVal :: Value (ToT OpenChest) -> OpenChest #
IsoValue ZSNil Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT ZSNil :: T # Methods toVal :: ZSNil -> Value (ToT ZSNil) # fromVal :: Value (ToT ZSNil) -> ZSNil #
IsoValue MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
IsoValue Operation
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Operation :: T # Methods toVal :: Operation -> Value (ToT Operation) # fromVal :: Value (ToT Operation) -> Operation #
IsoValue EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
IsoValue MyType2
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Product Associated Types type ToT MyType2 :: T # Methods toVal :: MyType2 -> Value (ToT MyType2) # fromVal :: Value (ToT MyType2) -> MyType2 #
IsoValue MyCompoundType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyCompoundType :: T # Methods toVal :: MyCompoundType -> Value (ToT MyCompoundType) # fromVal :: Value (ToT MyCompoundType) -> MyCompoundType #
IsoValue MyEnum
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyEnum :: T # Methods toVal :: MyEnum -> Value (ToT MyEnum) # fromVal :: Value (ToT MyEnum) -> MyEnum #
IsoValue MyType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType :: T # Methods toVal :: MyType -> Value (ToT MyType) # fromVal :: Value (ToT MyType) -> MyType #
IsoValue MyType'
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType' :: T # Methods toVal :: MyType' -> Value (ToT MyType') # fromVal :: Value (ToT MyType') -> MyType' #
IsoValue MyTypeWithNamedField
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyTypeWithNamedField :: T # Methods toVal :: MyTypeWithNamedField -> Value (ToT MyTypeWithNamedField) # fromVal :: Value (ToT MyTypeWithNamedField) -> MyTypeWithNamedField #
IsoValue Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
IsoValue ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
IsoValue Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
IsoValue Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
IsoValue KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
IsoValue PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
IsoValue Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
IsoValue Bls12381Fr
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381Fr :: T # Methods toVal :: Bls12381Fr -> Value (ToT Bls12381Fr) # fromVal :: Value (ToT Bls12381Fr) -> Bls12381Fr #
IsoValue Bls12381G1
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G1 :: T # Methods toVal :: Bls12381G1 -> Value (ToT Bls12381G1) # fromVal :: Value (ToT Bls12381G1) -> Bls12381G1 #
IsoValue Bls12381G2
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G2 :: T # Methods toVal :: Bls12381G2 -> Value (ToT Bls12381G2) # fromVal :: Value (ToT Bls12381G2) -> Bls12381G2 #
IsoValue Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Chest :: T # Methods toVal :: Chest -> Value (ToT Chest) # fromVal :: Value (ToT Chest) -> Chest #
IsoValue ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChestKey :: T # Methods toVal :: ChestKey -> Value (ToT ChestKey) # fromVal :: Value (ToT ChestKey) -> ChestKey #
(Bottom, DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
IsoValue Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
IsoValue Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
IsoValue ()
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT () :: T # Methods toVal :: () -> Value (ToT ()) # fromVal :: Value (ToT ()) -> () #
IsoValue Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
IsoValue a => IsoValue (Identity a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Identity a) :: T # Methods toVal :: Identity a -> Value (ToT (Identity a)) # fromVal :: Value (ToT (Identity a)) -> Identity a #
(Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
IsoValue (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (ChestT a) :: T # Methods toVal :: ChestT a -> Value (ToT (ChestT a)) # fromVal :: Value (ToT (ChestT a)) -> ChestT a #
IsoValue a => IsoValue (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (OpenChestT a) :: T # Methods toVal :: OpenChestT a -> Value (ToT (OpenChestT a)) # fromVal :: Value (ToT (OpenChestT a)) -> OpenChestT a #
IsoValue (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Packed a) :: T # Methods toVal :: Packed a -> Value (ToT (Packed a)) # fromVal :: Value (ToT (Packed a)) -> Packed a #
IsoValue (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (TSignature a) :: T # Methods toVal :: TSignature a -> Value (ToT (TSignature a)) # fromVal :: Value (ToT (TSignature a)) -> TSignature a #
WellTypedToT r => IsoValue (ShouldHaveEntrypoints r) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type ToT (ShouldHaveEntrypoints r) :: T # Methods toVal :: ShouldHaveEntrypoints r -> Value (ToT (ShouldHaveEntrypoints r)) # fromVal :: Value (ToT (ShouldHaveEntrypoints r)) -> ShouldHaveEntrypoints r #
(Bottom, WellTypedToT (CustomErrorRep tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag) Source #	This instance cannot be implemented, use `IsError` instance instead.
Instance details Defined in Lorentz.Errors Associated Types type ToT (CustomError tag) :: T # Methods toVal :: CustomError tag -> Value (ToT (CustomError tag)) # fromVal :: Value (ToT (CustomError tag)) -> CustomError tag #
(Bottom, WellTypedToT (VoidResult r), TypeError ('Text "No IsoValue instance for VoidResult " ':<>: 'ShowType r) :: Constraint) => IsoValue (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (VoidResult r) :: T # Methods toVal :: VoidResult r -> Value (ToT (VoidResult r)) # fromVal :: Value (ToT (VoidResult r)) -> VoidResult r #
IsoValue a => IsoValue (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (Range a) :: T # Methods toVal :: Range a -> Value (ToT (Range a)) # fromVal :: Value (ToT (Range a)) -> Range a #
IsoValue a => IsoValue (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeEE a) :: T # Methods toVal :: RangeEE a -> Value (ToT (RangeEE a)) # fromVal :: Value (ToT (RangeEE a)) -> RangeEE a #
IsoValue a => IsoValue (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeEI a) :: T # Methods toVal :: RangeEI a -> Value (ToT (RangeEI a)) # fromVal :: Value (ToT (RangeEI a)) -> RangeEI a #
IsoValue a => IsoValue (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeFailureInfo a) :: T # Methods toVal :: RangeFailureInfo a -> Value (ToT (RangeFailureInfo a)) # fromVal :: Value (ToT (RangeFailureInfo a)) -> RangeFailureInfo a #
IsoValue a => IsoValue (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeIE a) :: T # Methods toVal :: RangeIE a -> Value (ToT (RangeIE a)) # fromVal :: Value (ToT (RangeIE a)) -> RangeIE a #
IsoValue (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type ToT (UParam entries) :: T # Methods toVal :: UParam entries -> Value (ToT (UParam entries)) # fromVal :: Value (ToT (UParam entries)) -> UParam entries #
IsoValue a => IsoValue (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (ReadTicket a) :: T # Methods toVal :: ReadTicket a -> Value (ToT (ReadTicket a)) # fromVal :: Value (ToT (ReadTicket a)) -> ReadTicket a #
WellTyped t => IsoValue (Value t)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Value t) :: T # Methods toVal :: Value t -> Value (ToT (Value t)) # fromVal :: Value (ToT (Value t)) -> Value t #
(HasNoOpToT arg, ForbidNestedBigMaps (ToT arg), WellTypedToT arg) => IsoValue (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
(Comparable (ToT a), IsoValue a) => IsoValue (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Ticket a) :: T # Methods toVal :: Ticket a -> Value (ToT (Ticket a)) # fromVal :: Value (ToT (Ticket a)) -> Ticket a #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
IsoValue a => IsoValue [a]
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT [a] :: T # Methods toVal :: [a] -> Value (ToT [a]) # fromVal :: Value (ToT [a]) -> [a] #
(IsoValue l, IsoValue r) => IsoValue (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Either l r) :: T # Methods toVal :: Either l r -> Value (ToT (Either l r)) # fromVal :: Value (ToT (Either l r)) -> Either l r #
IsoValue (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Fixed p) :: T # Methods toVal :: Fixed p -> Value (ToT (Fixed p)) # fromVal :: Value (ToT (Fixed p)) -> Fixed p #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
IsoValue (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (TAddress p vd) :: T # Methods toVal :: TAddress p vd -> Value (ToT (TAddress p vd)) # fromVal :: Value (ToT (TAddress p vd)) -> TAddress p vd #
(NoLambdaCodeIsomorphismError, WellTyped (LorentzCodeIsNotIsomorphicToMichelsonValues :: T)) => IsoValue (inp :-> out) Source #
Instance details Defined in Lorentz.Base Associated Types type ToT (inp :-> out) :: T # Methods toVal :: (inp :-> out) -> Value (ToT (inp :-> out)) # fromVal :: Value (ToT (inp :-> out)) -> inp :-> out #
IsoValue (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Hash alg a) :: T # Methods toVal :: Hash alg a -> Value (ToT (Hash alg a)) # fromVal :: Value (ToT (Hash alg a)) -> Hash alg a #
IsoValue (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type ToT (NFixed p) :: T # Methods toVal :: NFixed p -> Value (ToT (NFixed p)) # fromVal :: Value (ToT (NFixed p)) -> NFixed p #
IsoValue cp => IsoValue (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ToT (ParameterWrapper deriv cp) :: T # Methods toVal :: ParameterWrapper deriv cp -> Value (ToT (ParameterWrapper deriv cp)) # fromVal :: Value (ToT (ParameterWrapper deriv cp)) -> ParameterWrapper deriv cp #
IsoValue (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type ToT (Extensible x) :: T # Methods toVal :: Extensible x -> Value (ToT (Extensible x)) # fromVal :: Value (ToT (Extensible x)) -> Extensible x #
(KnownList i, ZipInstr i, ZipInstr o) => IsoValue (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type ToT (WrappedLambda i o) :: T # Methods toVal :: WrappedLambda i o -> Value (ToT (WrappedLambda i o)) # fromVal :: Value (ToT (WrappedLambda i o)) -> WrappedLambda i o #
(HasNoOpToT r, ForbidNestedBigMaps (ToT r), WellTypedToT a) => IsoValue (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (View_ a r) :: T # Methods toVal :: View_ a r -> Value (ToT (View_ a r)) # fromVal :: Value (ToT (View_ a r)) -> View_ a r #
(WellTypedToT r, WellTypedToT a) => IsoValue (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (Void_ a r) :: T # Methods toVal :: Void_ a r -> Value (ToT (Void_ a r)) # fromVal :: Value (ToT (Void_ a r)) -> Void_ a r #
(IsoValue a, IsoValue b) => IsoValue (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT (ZippedStackRepr a b) :: T # Methods toVal :: ZippedStackRepr a b -> Value (ToT (ZippedStackRepr a b)) # fromVal :: Value (ToT (ZippedStackRepr a b)) -> ZippedStackRepr a b #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v, HasNoBigMapToT v, HasNoOpToT v) => IsoValue (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMap k v) :: T # Methods toVal :: BigMap k v -> Value (ToT (BigMap k v)) # fromVal :: Value (ToT (BigMap k v)) -> BigMap k v #
(IsoValue a, IsoValue b) => IsoValue (a, b)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b) :: T # Methods toVal :: (a, b) -> Value (ToT (a, b)) # fromVal :: Value (ToT (a, b)) -> (a, b) #
NiceComparable td => IsoValue (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type ToT (STicket action td) :: T # Methods toVal :: STicket action td -> Value (ToT (STicket action td)) # fromVal :: Value (ToT (STicket action td)) -> STicket action td #
IsoValue a => IsoValue (NamedF Identity a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Identity a name) :: T # Methods toVal :: NamedF Identity a name -> Value (ToT (NamedF Identity a name)) # fromVal :: Value (ToT (NamedF Identity a name)) -> NamedF Identity a name #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
(IsoValue a, IsoValue b, IsoValue c) => IsoValue (a, b, c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c) :: T # Methods toVal :: (a, b, c) -> Value (ToT (a, b, c)) # fromVal :: Value (ToT (a, b, c)) -> (a, b, c) #
IsoValue (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMapId k2 v) :: T # Methods toVal :: BigMapId k2 v -> Value (ToT (BigMapId k2 v)) # fromVal :: Value (ToT (BigMapId k2 v)) -> BigMapId k2 v #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d) => IsoValue (a, b, c, d)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d) :: T # Methods toVal :: (a, b, c, d) -> Value (ToT (a, b, c, d)) # fromVal :: Value (ToT (a, b, c, d)) -> (a, b, c, d) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e) => IsoValue (a, b, c, d, e)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e) :: T # Methods toVal :: (a, b, c, d, e) -> Value (ToT (a, b, c, d, e)) # fromVal :: Value (ToT (a, b, c, d, e)) -> (a, b, c, d, e) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f) => IsoValue (a, b, c, d, e, f)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f) :: T # Methods toVal :: (a, b, c, d, e, f) -> Value (ToT (a, b, c, d, e, f)) # fromVal :: Value (ToT (a, b, c, d, e, f)) -> (a, b, c, d, e, f) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f, IsoValue g) => IsoValue (a, b, c, d, e, f, g)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f, g) :: T # Methods toVal :: (a, b, c, d, e, f, g) -> Value (ToT (a, b, c, d, e, f, g)) # fromVal :: Value (ToT (a, b, c, d, e, f, g)) -> (a, b, c, d, e, f, g) #

type HasFieldOfType dt fname fieldTy = (HasField dt fname, GetFieldType dt fname ~ fieldTy) Source #

Like HasField, but allows constrainting field type.

type family HasFieldsOfType (dt :: Type) (fs :: [NamedField]) :: Constraint where ... Source #

Shortcut for multiple HasFieldOfType constraints.

Equations

HasFieldsOfType _ '[] = ()
HasFieldsOfType dt ((n := ty) ': fs) = (HasFieldOfType dt n ty, HasFieldsOfType dt fs)

data NamedField Source #

A pair of field name and type.

Constructors

NamedField Symbol Type

type (:=) n ty = 'NamedField n ty infixr 0 Source #

class HasDupableGetters a Source #

This marker typeclass is a requirement for the getField (where it is imposed on the datatype), and it is supposed to be satisfied in two cases:

The entire datatype is Dupable;
When the datatype has non-dupable fields, they are located so that getField remains efficient.

The problem we are trying to solve here: without special care, getField may become multiple times more costly, see instrGetField for the explanation. And this typeclass imposes an invariant: if we ever use getField on a datatype, then we have to pay attention to the datatype's Michelson representation and ensure getField remains optimal.

When you are developing a contract: Lorentz.Layouts.NonDupable module contains utilities to help you provide the necessary Michelson layout. In case you want to use your custom layout but still allow getField for it, you can define an instance for your type manually as an assurance that Michelson layout is optimal enough to use getField on this type.

When you are developing a library: Note that HasDupableGetters resolves to Dupable by default, and when propagating this constraint you can switch to Dupable anytime but this will also make your code unusable in the presence of Tickets and other non-dupable types.

Instances

Instances details

Dupable a => HasDupableGetters (a :: Type) Source #
Instance details Defined in Lorentz.ADT

type CaseTC dt out inp clauses = (InstrCaseC dt, RMap (CaseClauses dt), RecFromTuple clauses, clauses ~ Rec (CaseClauseL inp out) (CaseClauses dt)) Source #

class CaseArrow name body clause | clause -> name, clause -> body where Source #

Provides "case" arrow which works on different wrappers for clauses.

Methods

(/->) :: Label name -> body -> clause infixr 0 Source #

Lift an instruction to case clause.

You should write out constructor name corresponding to the clause explicitly. Prefix constructor name with "c" letter, otherwise your label will not be recognized by Haskell parser. Passing constructor name can be circumvented but doing so is not recomended as mentioning contructor name improves readability and allows avoiding some mistakes.

Instances

Instances details

(name ~ AppendSymbol "c" ctor, body ~ (AppendCtorField x inp :-> out)) => CaseArrow name body (CaseClauseL inp out ('CaseClauseParam ctor x)) Source #
Instance details Defined in Lorentz.ADT Methods (/->) :: Label name -> body -> CaseClauseL inp out ('CaseClauseParam ctor x) Source #

data CaseClauseL (inp :: [Type]) (out :: [Type]) (param :: CaseClauseParam) where Source #

Lorentz analogy of CaseClause, it works on plain Type types.

Constructors

CaseClauseL :: (AppendCtorField x inp :-> out) -> CaseClauseL inp out ('CaseClauseParam ctor x)

Instances

Instances details

(name ~ AppendSymbol "c" ctor, body ~ (AppendCtorField x inp :-> out)) => CaseArrow name body (CaseClauseL inp out ('CaseClauseParam ctor x)) Source #
Instance details Defined in Lorentz.ADT Methods (/->) :: Label name -> body -> CaseClauseL inp out ('CaseClauseParam ctor x) Source #

type InstrConstructC dt = (GenericIsoValue dt, GInstrConstruct (GRep dt) ('[] :: [Type])) #

type ConstructorFieldTypes dt = GFieldTypes (GRep dt) ('[] :: [Type]) #

data AnnOptions Source #

Allow customization of field annotation generated for a type when declaring its HasAnnotation instance.

Constructors

AnnOptions
Fields fieldAnnModifier :: Text -> Text

Instances

Instances details

Default AnnOptions Source #
Instance details Defined in Lorentz.Annotation Methods def :: AnnOptions #

data FollowEntrypointFlag Source #

Used in GHasAnnotation and HasAnnotation as a flag to track whether or not it directly follows an entrypoint to avoid introducing extra entrypoints.

Constructors

FollowEntrypoint
NotFollowEntrypoint

data GenerateFieldAnnFlag Source #

Used in GHasAnnotation as a flag to track whether or not field/constructor annotations should be generated.

Constructors

GenerateFieldAnn
NotGenerateFieldAnn

class HasAnnotation a where Source #

This class defines the type and field annotations for a given type. Right now the type annotations come from names in a named field, and field annotations are generated from the record fields.

Allows generic derivation. The type must have Generic and IsoValue instances.

>>> data Foo = Foo
>>> instance HasAnnotation Foo
...
... GHC.Generics.Rep Foo
... is stuck. Likely
... Generic Foo
... instance is missing or out of scope.
...

>>> data Foo = Foo deriving (Generic, IsoValue)
>>> instance HasAnnotation Foo

Minimal complete definition

Nothing

Methods

getAnnotation :: FollowEntrypointFlag -> Notes (ToT a) Source #

default getAnnotation :: (GHasAnnotation (GRep a), GValueType (GRep a) ~ ToT a, GIsSumType (GRep a), TypeHasFieldNamingStrategy a) => FollowEntrypointFlag -> Notes (ToT a) Source #

annOptions :: Maybe AnnOptions Source #

Instances

Instances details

HasAnnotation ByteString Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT NRational) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Rational) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Never Source #
Instance details Defined in Lorentz.Value Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Never) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation OpenChest Source #
Instance details Defined in Lorentz.Value Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT OpenChest) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation ZSNil Source #
Instance details Defined in Lorentz.Zip Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ZSNil) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation MText Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Operation Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Operation) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation EpAddress Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Address Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Address) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation ChainId Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ChainId) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Mutez Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Mutez) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Timestamp Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Timestamp) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation KeyHash Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT KeyHash) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation PublicKey Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT PublicKey) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Signature Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Signature) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Chest Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Chest) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation ChestKey Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ChestKey) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Integer Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Natural Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation () Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ()) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation Bool Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool) Source # annOptions :: Maybe AnnOptions Source #
KnownIsoT v => HasAnnotation (Set v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (FutureContract a) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ChestT a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (OpenChestT a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Packed a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TSignature a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (Range a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Range a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeEE a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeEI a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeIE a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UParam entries)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (ContractRef a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation d => HasAnnotation (Ticket d) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Ticket d)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation (Maybe a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation a => HasAnnotation [a] Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT [a]) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TAddress p vd)) Source # annOptions :: Maybe AnnOptions Source #
NoLambdaCodeIsomorphismError => HasAnnotation (i :-> o) Source #
Instance details Defined in Lorentz.Base Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (i :-> o)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Hash alg a)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Extensible x)) Source # annOptions :: Maybe AnnOptions Source #
Each '[HasAnnotation] '[ZippedStack i, ZippedStack o] => HasAnnotation (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (WrappedLambda i o)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation r) => HasAnnotation (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (View_ a r)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Void_ a b)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ZippedStackRepr a b)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMap k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMap k v)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (a, b) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation td, NiceComparable td) => HasAnnotation (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (STicket action td)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, KnownSymbol name) => HasAnnotation (NamedF Identity a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Identity a name)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b, HasAnnotation c) => HasAnnotation (a, b, c) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c)) Source # annOptions :: Maybe AnnOptions Source #
HasAnnotation (BigMapId k3 v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMapId k3 v)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d) => HasAnnotation (a, b, c, d) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e) => HasAnnotation (a, b, c, d, e) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e, HasAnnotation f) => HasAnnotation (a, b, c, d, e, f) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e, f)) Source # annOptions :: Maybe AnnOptions Source #
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e, HasAnnotation f, HasAnnotation g) => HasAnnotation (a, b, c, d, e, f, g) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e, f, g)) Source # annOptions :: Maybe AnnOptions Source #

class GHasAnnotation a where Source #

A Generic HasAnnotation implementation

Methods

gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType a), FieldAnn, VarAnn) Source #

Instances

Instances details

GHasAnnotation (U1 :: Type -> Type) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType U1), FieldAnn, VarAnn) Source #
HasAnnotation x => GHasAnnotation (Rec0 x) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (Rec0 x)), FieldAnn, VarAnn) Source #
(GHasAnnotation x, GHasAnnotation y) => GHasAnnotation (x :*: y) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (x :*: y)), FieldAnn, VarAnn) Source #
(GHasAnnotation x, GHasAnnotation y) => GHasAnnotation (x :+: y) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (x :+: y)), FieldAnn, VarAnn) Source #
(GHasAnnotation x, KnownSymbol a) => GHasAnnotation (M1 C ('MetaCons a _p _f) x) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (M1 C ('MetaCons a _p _f) x)), FieldAnn, VarAnn) Source #
GHasAnnotation x => GHasAnnotation (M1 D i1 x) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (M1 D i1 x)), FieldAnn, VarAnn) Source #
(GHasAnnotation x, KnownSymbol a) => GHasAnnotation (M1 S ('MetaSel ('Just a) b c d) x) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (M1 S ('MetaSel ('Just a) b c d) x)), FieldAnn, VarAnn) Source #
GHasAnnotation x => GHasAnnotation (M1 S ('MetaSel ('Nothing :: Maybe Symbol) b c d) x) Source #
Instance details Defined in Lorentz.Annotation Methods gGetAnnotation :: AnnOptions -> FollowEntrypointFlag -> GenerateFieldAnnFlag -> (Notes (GValueType (M1 S ('MetaSel 'Nothing b c d) x)), FieldAnn, VarAnn) Source #

data BigMap k v #

Instances

Instances details

(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (BigMap k1 v1 :: Type) (BigMap k2 v2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (BigMap k1 v1) -> Proxy (BigMap k2 v2) -> () Source #
Foldable (BigMap k)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods fold :: Monoid m => BigMap k m -> m # foldMap :: Monoid m => (a -> m) -> BigMap k a -> m # foldMap' :: Monoid m => (a -> m) -> BigMap k a -> m # foldr :: (a -> b -> b) -> b -> BigMap k a -> b # foldr' :: (a -> b -> b) -> b -> BigMap k a -> b # foldl :: (b -> a -> b) -> b -> BigMap k a -> b # foldl' :: (b -> a -> b) -> b -> BigMap k a -> b # foldr1 :: (a -> a -> a) -> BigMap k a -> a # foldl1 :: (a -> a -> a) -> BigMap k a -> a # toList :: BigMap k a -> [a] # null :: BigMap k a -> Bool # length :: BigMap k a -> Int # elem :: Eq a => a -> BigMap k a -> Bool # maximum :: Ord a => BigMap k a -> a # minimum :: Ord a => BigMap k a -> a # sum :: Num a => BigMap k a -> a # product :: Num a => BigMap k a -> a #
(Data k, Data v, Ord k) => Data (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BigMap k v -> c (BigMap k v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BigMap k v) # toConstr :: BigMap k v -> Constr # dataTypeOf :: BigMap k v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BigMap k v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BigMap k v)) # gmapT :: (forall b. Data b => b -> b) -> BigMap k v -> BigMap k v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BigMap k v -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BigMap k v -> r # gmapQ :: (forall d. Data d => d -> u) -> BigMap k v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BigMap k v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BigMap k v -> m (BigMap k v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMap k v -> m (BigMap k v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMap k v -> m (BigMap k v) #
Ord k => Semigroup (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (<>) :: BigMap k v -> BigMap k v -> BigMap k v # sconcat :: NonEmpty (BigMap k v) -> BigMap k v # stimes :: Integral b => b -> BigMap k v -> BigMap k v #
Generic (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type Rep (BigMap k v) :: Type -> Type # Methods from :: BigMap k v -> Rep (BigMap k v) x # to :: Rep (BigMap k v) x -> BigMap k v #
Ord k => IsList (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type Item (BigMap k v) # Methods fromList :: [Item (BigMap k v)] -> BigMap k v # fromListN :: Int -> [Item (BigMap k v)] -> BigMap k v # toList :: BigMap k v -> [Item (BigMap k v)] #
(Show k, Show v) => Show (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMap k v -> ShowS # show :: BigMap k v -> String # showList :: [BigMap k v] -> ShowS #
Default (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
Ord k => At (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods at :: Index (BigMap k v) -> Lens' (BigMap k v) (Maybe (IxValue (BigMap k v))) #
Ord k => Ixed (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods ix :: Index (BigMap k v) -> Traversal' (BigMap k v) (IxValue (BigMap k v)) #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMap k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMap k v)) Source # annOptions :: Maybe AnnOptions Source #
NiceComparable k => GetOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (BigMap k v) Source # type GetOpValHs (BigMap k v) Source #
NiceComparable k => MemOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (BigMap k v) Source #
NiceComparable k => UpdOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (BigMap k v) Source # type UpdOpParamsHs (BigMap k v) Source #
HasRPCRepr (BigMap k v)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (BigMap k v)
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (BigMap k v) :: FieldDescriptions # Methods typeDocName :: Proxy (BigMap k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (BigMap k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (BigMap k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (BigMap k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (BigMap k v) #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v, HasNoBigMapToT v, HasNoOpToT v) => IsoValue (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMap k v) :: T # Methods toVal :: BigMap k v -> Value (ToT (BigMap k v)) # fromVal :: Value (ToT (BigMap k v)) -> BigMap k v #
(Ord k, Buildable k, Buildable v) => Buildable (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods build :: BigMap k v -> Doc buildList :: [BigMap k v] -> Doc
Container (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type Element (BigMap k v) # Methods toList :: BigMap k v -> [Element (BigMap k v)] # null :: BigMap k v -> Bool # foldr :: (Element (BigMap k v) -> b -> b) -> b -> BigMap k v -> b # foldl :: (b -> Element (BigMap k v) -> b) -> b -> BigMap k v -> b # foldl' :: (b -> Element (BigMap k v) -> b) -> b -> BigMap k v -> b # length :: BigMap k v -> Int # elem :: Element (BigMap k v) -> BigMap k v -> Bool # foldMap :: Monoid m => (Element (BigMap k v) -> m) -> BigMap k v -> m # fold :: BigMap k v -> Element (BigMap k v) # foldr' :: (Element (BigMap k v) -> b -> b) -> b -> BigMap k v -> b # notElem :: Element (BigMap k v) -> BigMap k v -> Bool # all :: (Element (BigMap k v) -> Bool) -> BigMap k v -> Bool # any :: (Element (BigMap k v) -> Bool) -> BigMap k v -> Bool # and :: BigMap k v -> Bool # or :: BigMap k v -> Bool # find :: (Element (BigMap k v) -> Bool) -> BigMap k v -> Maybe (Element (BigMap k v)) # safeHead :: BigMap k v -> Maybe (Element (BigMap k v)) # safeMaximum :: BigMap k v -> Maybe (Element (BigMap k v)) # safeMinimum :: BigMap k v -> Maybe (Element (BigMap k v)) # safeFoldr1 :: (Element (BigMap k v) -> Element (BigMap k v) -> Element (BigMap k v)) -> BigMap k v -> Maybe (Element (BigMap k v)) # safeFoldl1 :: (Element (BigMap k v) -> Element (BigMap k v) -> Element (BigMap k v)) -> BigMap k v -> Maybe (Element (BigMap k v)) #
One (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type OneItem (BigMap k v) # Methods one :: OneItem (BigMap k v) -> BigMap k v #
(NiceComparable key, KnownValue value) => StoreHasSubmap (BigMap key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key value) SelfRef key value Source #
type Rep (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type Rep (BigMap k v) = D1 ('MetaData "BigMap" "Morley.Michelson.Typed.Haskell.Value" "morley-1.20.0-inplace" 'False) (C1 ('MetaCons "BigMap" 'PrefixI 'True) (S1 ('MetaSel ('Just "bmId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe (BigMapId k v))) :*: S1 ('MetaSel ('Just "bmMap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Map k v))))
type Item (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type Item (BigMap k v) = Item (Map k v)
type Index (BigMap k _1)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type Index (BigMap k _1) = k
type IxValue (BigMap _1 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type IxValue (BigMap _1 v) = v
type GetOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (BigMap k v) = k
type GetOpValHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (BigMap k v) = v
type MemOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (BigMap k v) = k
type UpdOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (BigMap k v) = k
type UpdOpParamsHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (BigMap k v) = Maybe v
type AsRPC (BigMap k v)
Instance details Defined in Morley.AsRPC type AsRPC (BigMap k v) = BigMapId k v
type TypeDocFieldDescriptions (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (BigMap k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (BigMap k v) = 'TBigMap (ToT k) (ToT v)
type Element (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type Element (BigMap k v) = ElementDefault (BigMap k v)
type OneItem (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type OneItem (BigMap k v) = OneItem (Map k v)

newtype BigMapId (k2 :: k) (v :: k1) #

Constructors

BigMapId
Fields unBigMapId :: Natural

Instances

Instances details

(Typeable k2, Typeable v, Typeable k1, Typeable k3) => Data (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BigMapId k2 v -> c (BigMapId k2 v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BigMapId k2 v) # toConstr :: BigMapId k2 v -> Constr # dataTypeOf :: BigMapId k2 v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BigMapId k2 v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BigMapId k2 v)) # gmapT :: (forall b. Data b => b -> b) -> BigMapId k2 v -> BigMapId k2 v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BigMapId k2 v -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BigMapId k2 v -> r # gmapQ :: (forall d. Data d => d -> u) -> BigMapId k2 v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BigMapId k2 v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) #
Num (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (+) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # (-) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # (*) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # negate :: BigMapId k2 v -> BigMapId k2 v # abs :: BigMapId k2 v -> BigMapId k2 v # signum :: BigMapId k2 v -> BigMapId k2 v # fromInteger :: Integer -> BigMapId k2 v #
Show (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMapId k2 v -> ShowS # show :: BigMapId k2 v -> String # showList :: [BigMapId k2 v] -> ShowS #
HasAnnotation (BigMapId k3 v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMapId k3 v)) Source # annOptions :: Maybe AnnOptions Source #
IsoValue (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMapId k2 v) :: T # Methods toVal :: BigMapId k2 v -> Value (ToT (BigMapId k2 v)) # fromVal :: Value (ToT (BigMapId k2 v)) -> BigMapId k2 v #
Buildable (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods build :: BigMapId k2 v -> Doc buildList :: [BigMapId k2 v] -> Doc
type ToT (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (BigMapId k2 v) = ToT Natural

type Operation = Operation' Instr #

data Ticket arg #

Constructors

Ticket
Fields tTicketer :: Address tData :: arg tAmount :: Natural

Instances

Instances details

Show arg => Show (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> Ticket arg -> ShowS # show :: Ticket arg -> String # showList :: [Ticket arg] -> ShowS #
Eq arg => Eq (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: Ticket arg -> Ticket arg -> Bool # (/=) :: Ticket arg -> Ticket arg -> Bool #
HasAnnotation d => HasAnnotation (Ticket d) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Ticket d)) Source # annOptions :: Maybe AnnOptions Source #
NiceComparable d => NonZero (Ticket d) Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Ticket d ': s) :-> (Maybe (Ticket d) ': s) Source #
PolyTypeHasDocC '[a] => TypeHasDoc (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Ticket a) :: FieldDescriptions # Methods typeDocName :: Proxy (Ticket a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Ticket a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Ticket a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Ticket a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Ticket a) #
(Comparable (ToT a), IsoValue a) => IsoValue (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Ticket a) :: T # Methods toVal :: Ticket a -> Value (ToT (Ticket a)) # fromVal :: Value (ToT (Ticket a)) -> Ticket a #
type TypeDocFieldDescriptions (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Ticket a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Ticket a) = 'TTicket (ToT a)

type family ToT a :: T #

Instances

Instances details

type ToT Void
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Void = GValueType (GRep Void)
type ToT ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes
type ToT NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type ToT NRational = 'TPair 'TNat 'TNat
type ToT Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type ToT Rational = 'TPair 'TInt 'TNat
type ToT UnspecifiedError Source #
Instance details Defined in Lorentz.Errors type ToT UnspecifiedError = GValueType (GRep UnspecifiedError)
type ToT Never Source #
Instance details Defined in Lorentz.Value type ToT Never = GValueType (GRep Never)
type ToT OpenChest Source #
Instance details Defined in Lorentz.Value type ToT OpenChest = GValueType (GRep OpenChest)
type ToT ZSNil Source #
Instance details Defined in Lorentz.Zip type ToT ZSNil = GValueType (GRep ZSNil)
type ToT MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT MText = 'TString
type ToT Operation
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Operation = 'TOperation
type ToT EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress
type ToT MyType2
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Product type ToT MyType2 = GValueType (GRep MyType2)
type ToT MyCompoundType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum type ToT MyCompoundType = GValueType (GRep MyCompoundType)
type ToT MyEnum
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum type ToT MyEnum = GValueType (GRep MyEnum)
type ToT MyType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum type ToT MyType = GValueType (GRep MyType)
type ToT MyType'
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum type ToT MyType' = GValueType (GRep MyType')
type ToT MyTypeWithNamedField
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum type ToT MyTypeWithNamedField = GValueType (GRep MyTypeWithNamedField)
type ToT Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Address = 'TAddress
type ToT ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ChainId = 'TChainId
type ToT Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Mutez = 'TMutez
type ToT Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Timestamp = 'TTimestamp
type ToT KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT KeyHash = 'TKeyHash
type ToT PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT PublicKey = 'TKey
type ToT Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Signature = 'TSignature
type ToT Bls12381Fr
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381Fr = 'TBls12381Fr
type ToT Bls12381G1
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381G1 = 'TBls12381G1
type ToT Bls12381G2
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381G2 = 'TBls12381G2
type ToT Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Chest = 'TChest
type ToT ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ChestKey = 'TChestKey
type ToT Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Text = ToT MText
type ToT Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type ToT Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type ToT ()
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT () = GValueType (GRep ())
type ToT Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
type ToT (Identity a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Identity a) = ToT a
type ToT (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type ToT (FutureContract arg) Source #
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress
type ToT (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type ToT (ChestT a) = ToT Chest
type ToT (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type ToT (OpenChestT a) = GValueType (GRep (OpenChestT a))
type ToT (Packed a) Source #
Instance details Defined in Lorentz.Bytes type ToT (Packed a) = ToT ByteString
type ToT (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type ToT (TSignature a) = ToT Signature
type ToT (ShouldHaveEntrypoints r) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers type ToT (ShouldHaveEntrypoints r) = GValueType (GRep (ShouldHaveEntrypoints r))
type ToT (CustomError tag) Source #
Instance details Defined in Lorentz.Errors type ToT (CustomError tag) = ToT (CustomErrorRep tag)
type ToT (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type ToT (VoidResult r) = TypeError ('Text "No IsoValue instance for VoidResult " ':<>: 'ShowType r) :: T
type ToT (Range a) Source #
Instance details Defined in Lorentz.Range type ToT (Range a) = GValueType (GRep (Range a))
type ToT (RangeEE a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeEE a) = GValueType (GRep (RangeEE a))
type ToT (RangeEI a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeEI a) = GValueType (GRep (RangeEI a))
type ToT (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeFailureInfo a) = GValueType (GRep (RangeFailureInfo a))
type ToT (RangeIE a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeIE a) = GValueType (GRep (RangeIE a))
type ToT (UParam entries) Source #
Instance details Defined in Lorentz.UParam type ToT (UParam entries) = GValueType (GRep (UParam entries))
type ToT (ReadTicket a) Source #
Instance details Defined in Lorentz.Value type ToT (ReadTicket a) = GValueType (GRep (ReadTicket a))
type ToT (Value t)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Value t) = t
type ToT (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)
type ToT (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Ticket a) = 'TTicket (ToT a)
type ToT (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type ToT [a]
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT [a] = 'TList (ToT a)
type ToT (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Either l r) = GValueType (GRep (Either l r))
type ToT (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Fixed p) = 'TInt
type ToT (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type ToT (TAddress p vd) Source #
Instance details Defined in Lorentz.Address type ToT (TAddress p vd) = GValueType (GRep (TAddress p vd))
type ToT (inp :-> out) Source #
Instance details Defined in Lorentz.Base type ToT (inp :-> out)
type ToT (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type ToT (Hash alg a) = ToT ByteString
type ToT (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith type ToT (NFixed p) = 'TNat
type ToT (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type ToT (ParameterWrapper deriv cp) = GValueType (GRep (ParameterWrapper deriv cp))
type ToT (Extensible x) Source #
Instance details Defined in Lorentz.Extensible type ToT (Extensible x) = GValueType (GRep (Extensible x))
type ToT (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type ToT (WrappedLambda i o) = 'TLambda (ToT (ZippedStack i)) (ToT (ZippedStack o))
type ToT (View_ a r) Source #
Instance details Defined in Lorentz.Macro type ToT (View_ a r) = GValueType (GRep (View_ a r))
type ToT (Void_ a r) Source #
Instance details Defined in Lorentz.Macro type ToT (Void_ a r) = GValueType (GRep (Void_ a r))
type ToT (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip type ToT (ZippedStackRepr a b) = GValueType (GRep (ZippedStackRepr a b))
type ToT (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (BigMap k v) = 'TBigMap (ToT k) (ToT v)
type ToT (a, b)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b) = GValueType (GRep (a, b))
type ToT (STicket action td) Source #
Instance details Defined in Lorentz.Tickets type ToT (STicket action td) = ToT (Ticket td)
type ToT (NamedF Identity a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (NamedF Identity a name) = ToT (Identity a)
type ToT (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)
type ToT (a, b, c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b, c) = GValueType (GRep (a, b, c))
type ToT (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (BigMapId k2 v) = ToT Natural
type ToT (a, b, c, d)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b, c, d) = GValueType (GRep (a, b, c, d))
type ToT (a, b, c, d, e)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e) = GValueType (GRep (a, b, c, d, e))
type ToT (a, b, c, d, e, f)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e, f) = GValueType (GRep (a, b, c, d, e, f))
type ToT (a, b, c, d, e, f, g)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e, f, g) = GValueType (GRep (a, b, c, d, e, f, g))

class TypeHasFieldNamingStrategy (a :: k) where #

Minimal complete definition

Nothing

Methods

typeFieldNamingStrategy :: Text -> Text #

Instances

Instances details

TypeHasFieldNamingStrategy FieldCamelCase
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods typeFieldNamingStrategy :: Text -> Text #
TypeHasFieldNamingStrategy FieldSnakeCase
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods typeFieldNamingStrategy :: Text -> Text #
TypeHasFieldNamingStrategy (a :: k)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods typeFieldNamingStrategy :: Text -> Text #
TypeHasFieldNamingStrategy (RangeFailureInfo a :: Type) Source #
Instance details Defined in Lorentz.Range Methods typeFieldNamingStrategy :: Text -> Text #

class ArithOpHs (aop :: Type) (n :: Type) (m :: Type) (r :: Type) where Source #

Lifted ArithOp.

Minimal complete definition

Nothing

Methods

evalArithOpHs :: (n : (m : s)) :-> (r : s) Source #

default evalArithOpHs :: (DefArithOp aop, ArithOp aop (ToT n) (ToT m), ToT r ~ ArithRes aop (ToT n) (ToT m)) => (n : (m : s)) :-> (r : s) Source #

Instances

Instances details

r ~ NRational => ArithOpHs Div NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
(ArithOpHs EDiv n d (Maybe (q, r)), mq ~ Maybe q, KnownValue q) => ArithOpHs IDiv n d mq Source #
Instance details Defined in Lorentz.Macro Methods evalArithOpHs :: forall (s :: [Type]). (n ': (d ': s)) :-> (mq ': s) Source #
(ArithOpHs EDiv n d (Maybe (q, r)), mr ~ Maybe r, KnownValue r) => ArithOpHs IMod n d mr Source #
Instance details Defined in Lorentz.Macro Methods evalArithOpHs :: forall (s :: [Type]). (n ': (d ': s)) :-> (mr ': s) Source #
r ~ NRational => ArithOpHs Add NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Add Mutez Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Add Bls12381Fr Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Add Bls12381G1 Bls12381G1 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': (Bls12381G1 ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Add Bls12381G2 Bls12381G2 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': (Bls12381G2 ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Integer Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Add Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs And ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs And Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Maybe (Natural, Mutez) => ArithOpHs EDiv Mutez Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Maybe (Mutez, Mutez) => ArithOpHs EDiv Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Natural, Natural) => ArithOpHs EDiv Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsl ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsl Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Lsr ByteString Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsr Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381Fr Bls12381G1 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G1 ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381Fr Bls12381G2 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G2 ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Integer ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381G1 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381G2 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Integer Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Natural Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Natural Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Mul Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Or ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Or Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Or Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Timestamp Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Sub Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Rational ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ ByteString => ArithOpHs Xor ByteString ByteString r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (ByteString ': (ByteString ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Xor Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Xor Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Integer Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Integer Natural (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Integer (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
ArithOpHs Div Natural Integer (Maybe Rational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (Maybe Rational ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (Fixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (Fixed (b r)) ': s) Source #
DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (NFixed (b r)) ': s) Source #
ArithOpHs Div Natural Natural (Maybe NRational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe NRational ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (Fixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (NFixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (Fixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
DivConstraint a b t r (Fixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (Fixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
DivConstraint a b t r (NFixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (NFixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (NFixed p ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (Fixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (Fixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (NFixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ NFixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (NFixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (NFixed p ': s)) :-> (r ': s) Source #

class DefArithOp aop where Source #

Helper typeclass that provides default definition of evalArithOpHs.

Methods

defEvalOpHs :: (ArithOp aop n m, r ~ ArithRes aop n m) => Instr (n : (m : s)) (r : s) Source #

Instances

Instances details

DefArithOp Add Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Add n m, r ~ ArithRes Add n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp And Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp And n m, r ~ ArithRes And n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp EDiv Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp EDiv n m, r ~ ArithRes EDiv n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Lsl Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Lsl n m, r ~ ArithRes Lsl n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Lsr Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Lsr n m, r ~ ArithRes Lsr n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Mul Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Mul n m, r ~ ArithRes Mul n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Or Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Or n m, r ~ ArithRes Or n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Sub Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Sub n m, r ~ ArithRes Sub n m) => Instr (n ': (m ': s)) (r ': s) Source #
DefArithOp Xor Source #
Instance details Defined in Lorentz.Arith Methods defEvalOpHs :: forall (n :: T) (m :: T) (r :: T) (s :: [T]). (ArithOp Xor n m, r ~ ArithRes Xor n m) => Instr (n ': (m ': s)) (r ': s) Source #

class UnaryArithOpHs (aop :: Type) (n :: Type) where Source #

Lifted UnaryArithOp.

Minimal complete definition

Nothing

Associated Types

type UnaryArithResHs aop n :: Type Source #

Methods

evalUnaryArithOpHs :: (n : s) :-> (UnaryArithResHs aop n : s) Source #

default evalUnaryArithOpHs :: (DefUnaryArithOp aop, UnaryArithOp aop (ToT n), ToT (UnaryArithResHs aop n) ~ UnaryArithRes aop (ToT n), DefUnaryArithOpExtraConstraints aop (ToT n)) => (n : s) :-> (UnaryArithResHs aop n : s) Source #

Instances

Instances details

UnaryArithOpHs Abs Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Abs Integer ': s) Source #
UnaryArithOpHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Eq' Integer ': s) Source #
UnaryArithOpHs Eq' Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Eq' Natural ': s) Source #
UnaryArithOpHs Ge Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Ge Integer ': s) Source #
UnaryArithOpHs Ge Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Ge Natural ': s) Source #
UnaryArithOpHs Gt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Gt Integer ': s) Source #
UnaryArithOpHs Gt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Gt Natural ': s) Source #
UnaryArithOpHs Le Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Le Integer ': s) Source #
UnaryArithOpHs Le Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Le Natural ': s) Source #
UnaryArithOpHs Lt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Lt Integer ': s) Source #
UnaryArithOpHs Lt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Lt Natural ': s) Source #
UnaryArithOpHs Neg Bls12381Fr Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381Fr Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': s) :-> (UnaryArithResHs Neg Bls12381Fr ': s) Source #
UnaryArithOpHs Neg Bls12381G1 Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381G1 Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': s) :-> (UnaryArithResHs Neg Bls12381G1 ': s) Source #
UnaryArithOpHs Neg Bls12381G2 Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381G2 Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': s) :-> (UnaryArithResHs Neg Bls12381G2 ': s) Source #
UnaryArithOpHs Neg Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neg Integer ': s) Source #
UnaryArithOpHs Neg Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neg Natural ': s) Source #
UnaryArithOpHs Neq Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neq Integer ': s) Source #
UnaryArithOpHs Neq Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neq Natural ': s) Source #
UnaryArithOpHs Not ByteString Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not ByteString Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (ByteString ': s) :-> (UnaryArithResHs Not ByteString ': s) Source #
UnaryArithOpHs Not Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Not Integer ': s) Source #
UnaryArithOpHs Not Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Not Natural ': s) Source #
UnaryArithOpHs Not Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bool ': s) :-> (UnaryArithResHs Not Bool ': s) Source #
UnaryArithOpHs Neg (Fixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type UnaryArithResHs Neg (Fixed p) Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Fixed p ': s) :-> (UnaryArithResHs Neg (Fixed p) ': s) Source #
UnaryArithOpHs Neg (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type UnaryArithResHs Neg (NFixed p) Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (NFixed p ': s) :-> (UnaryArithResHs Neg (NFixed p) ': s) Source #

class DefUnaryArithOp aop where Source #

Helper typeclass that provides default definition of evalUnaryArithOpHs.

Associated Types

type DefUnaryArithOpExtraConstraints aop (n :: T) :: Constraint Source #

type DefUnaryArithOpExtraConstraints _ _ = ()

Methods

defUnaryArithOpHs :: (UnaryArithOp aop n, r ~ UnaryArithRes aop n, DefUnaryArithOpExtraConstraints aop n) => Instr (n : s) (r : s) Source #

Instances

Instances details

DefUnaryArithOp Abs Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Abs n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Abs n, r ~ UnaryArithRes Abs n, DefUnaryArithOpExtraConstraints Abs n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Eq' Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Eq' n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Eq' n, r ~ UnaryArithRes Eq' n, DefUnaryArithOpExtraConstraints Eq' n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Ge Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Ge n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Ge n, r ~ UnaryArithRes Ge n, DefUnaryArithOpExtraConstraints Ge n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Gt Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Gt n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Gt n, r ~ UnaryArithRes Gt n, DefUnaryArithOpExtraConstraints Gt n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Le Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Le n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Le n, r ~ UnaryArithRes Le n, DefUnaryArithOpExtraConstraints Le n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Lt Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Lt n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Lt n, r ~ UnaryArithRes Lt n, DefUnaryArithOpExtraConstraints Lt n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Neg Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Neg n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Neg n, r ~ UnaryArithRes Neg n, DefUnaryArithOpExtraConstraints Neg n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Neq Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Neq n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Neq n, r ~ UnaryArithRes Neq n, DefUnaryArithOpExtraConstraints Neq n) => Instr (n ': s) (r ': s) Source #
DefUnaryArithOp Not Source #
Instance details Defined in Lorentz.Arith Associated Types type DefUnaryArithOpExtraConstraints Not n Source # Methods defUnaryArithOpHs :: forall (n :: T) (r :: T) (s :: [T]). (UnaryArithOp Not n, r ~ UnaryArithRes Not n, DefUnaryArithOpExtraConstraints Not n) => Instr (n ': s) (r ': s) Source #

class ToIntegerArithOpHs (n :: Type) where Source #

Minimal complete definition

Nothing

Methods

evalToIntOpHs :: (n : s) :-> (Integer : s) Source #

default evalToIntOpHs :: ToIntArithOp (ToT n) => (n : s) :-> (Integer : s) Source #

Instances

Instances details

ToIntegerArithOpHs Bls12381Fr Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (Bls12381Fr ': s) :-> (Integer ': s) Source #
ToIntegerArithOpHs Natural Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (Natural ': s) :-> (Integer ': s) Source #
BytesLike bs => ToIntegerArithOpHs bs Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (bs ': s) :-> (Integer ': s) Source #
ToIntegerArithOpHs (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalToIntOpHs :: forall (s :: [Type]). (NFixed a ': s) :-> (Integer ': s) Source #

class ToBytesArithOpHs (n :: Type) where Source #

Minimal complete definition

Nothing

Methods

evalToBytesOpHs :: BytesLike bs => (n : s) :-> (bs : s) Source #

default evalToBytesOpHs :: (ToBytesArithOp (ToT n), BytesLike bs) => (n : s) :-> (bs : s) Source #

Instances

Instances details

ToBytesArithOpHs Integer Source #
Instance details Defined in Lorentz.Arith Methods evalToBytesOpHs :: forall bs (s :: [Type]). BytesLike bs => (Integer ': s) :-> (bs ': s) Source #
ToBytesArithOpHs Natural Source #
Instance details Defined in Lorentz.Arith Methods evalToBytesOpHs :: forall bs (s :: [Type]). BytesLike bs => (Natural ': s) :-> (bs ': s) Source #

class (KnownValue bs, ToT bs ~ ToT ByteString) => BytesLike bs where Source #

Everything which is represented as bytes inside.

Methods

toBytes :: bs -> ByteString Source #

Instances

Instances details

BytesLike ByteString Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: ByteString -> ByteString Source #
Typeable a => BytesLike (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: Packed a -> ByteString Source #
(Typeable alg, Typeable a) => BytesLike (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: Hash alg a -> ByteString Source #

class MapLorentzInstr instr where Source #

Applicable for wrappers over Lorentz code.

Methods

mapLorentzInstr :: (forall i o. (i :-> o) -> i :-> o) -> instr -> instr Source #

Modify all the code under given entity.

Instances

Instances details

MapLorentzInstr (i :-> o) Source #
Instance details Defined in Lorentz.Base Methods mapLorentzInstr :: (forall (i0 :: [Type]) (o0 :: [Type]). (i0 :-> o0) -> i0 :-> o0) -> (i :-> o) -> i :-> o Source #
MapLorentzInstr (WrappedLambda inp out) Source #
Instance details Defined in Lorentz.Lambda Methods mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> WrappedLambda inp out -> WrappedLambda inp out Source #

type ContractOut st = '[([Operation], st)] Source #

newtype ContractCode cp st Source #

Wrap contract code capturing the constraint that the code is not inside a view.

Constructors

ContractCode
Fields unContractCode :: '[(cp, st)] :-> ContractOut st

Instances

Instances details

Show (ContractCode cp st) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> ContractCode cp st -> ShowS # show :: ContractCode cp st -> String # showList :: [ContractCode cp st] -> ShowS #
NFData (ContractCode cp st) Source #
Instance details Defined in Lorentz.Base Methods rnf :: ContractCode cp st -> () #
Eq (ContractCode cp st) Source #
Instance details Defined in Lorentz.Base Methods (==) :: ContractCode cp st -> ContractCode cp st -> Bool # (/=) :: ContractCode cp st -> ContractCode cp st -> Bool #
ContainsDoc (ContractCode i o) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: ContractCode i o -> ContractDoc #
ContainsUpdateableDoc (ContractCode i o) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> ContractCode i o -> ContractCode i o #

class IsNotInView #

Instances

Instances details

(TypeError ('Text "Not allowed on the top level of a view") :: Constraint) => IsNotInView
Instance details Defined in Morley.Michelson.Typed.Contract

data SomeContractCode where Source #

Constructors

SomeContractCode :: (NiceParameter cp, NiceStorage st) => ContractCode cp st -> SomeContractCode

type ViewCode arg st ret = '[(arg, st)] :-> '[ret] Source #

data Contract cp st vd Source #

Compiled Lorentz contract.

Note, that the views argument (views descriptor) is added comparing to the Michelson. In Michelson, ability to call a view is fully checked at runtime, but in Lorentz we want to make calls safer at compile-time.

Constructors

(NiceParameter cp, NiceStorage st, NiceViewsDescriptor vd) => Contract
Fields cMichelsonContract :: Contract (ToT cp) (ToT st) Ready contract code. cDocumentedCode :: ~(ContractCode cp st) Contract that contains documentation. We have to keep it separately, since optimizer is free to destroy documentation blocks. Also, it is not `ContractDoc` but Lorentz code because the latter is easier to modify.

Instances

Instances details

Show (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> Contract cp st vd -> ShowS # show :: Contract cp st vd -> String # showList :: [Contract cp st vd] -> ShowS #
NFData (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods rnf :: Contract cp st vd -> () #
Eq (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods (==) :: Contract cp st vd -> Contract cp st vd -> Bool # (/=) :: Contract cp st vd -> Contract cp st vd -> Bool #
ToExpression (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods toExpression :: Contract cp st vd -> Expression
ContainsDoc (Contract cp st vd) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: Contract cp st vd -> ContractDoc #
ContainsUpdateableDoc (Contract cp st vd) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> Contract cp st vd -> Contract cp st vd #

data MText #

Instances

Instances details

FromJSON MText
Instance details Defined in Morley.Michelson.Text Methods parseJSON :: Value -> Parser MText # parseJSONList :: Value -> Parser [MText] #
ToJSON MText
Instance details Defined in Morley.Michelson.Text Methods toJSON :: MText -> Value # toEncoding :: MText -> Encoding # toJSONList :: [MText] -> Value # toEncodingList :: [MText] -> Encoding #
Data MText
Instance details Defined in Morley.Michelson.Text Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MText -> c MText # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MText # toConstr :: MText -> Constr # dataTypeOf :: MText -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MText) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MText) # gmapT :: (forall b. Data b => b -> b) -> MText -> MText # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQ :: (forall d. Data d => d -> u) -> MText -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MText -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText #
Monoid MText
Instance details Defined in Morley.Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Semigroup MText
Instance details Defined in Morley.Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Generic MText
Instance details Defined in Morley.Michelson.Text Associated Types type Rep MText :: Type -> Type # Methods from :: MText -> Rep MText x # to :: Rep MText x -> MText #
Show MText
Instance details Defined in Morley.Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
NFData MText
Instance details Defined in Morley.Michelson.Text Methods rnf :: MText -> () #
Eq MText
Instance details Defined in Morley.Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Ord MText
Instance details Defined in Morley.Michelson.Text Methods compare :: MText -> MText -> Ordering # (<) :: MText -> MText -> Bool # (<=) :: MText -> MText -> Bool # (>) :: MText -> MText -> Bool # (>=) :: MText -> MText -> Bool # max :: MText -> MText -> MText # min :: MText -> MText -> MText #
Hashable MText
Instance details Defined in Morley.Michelson.Text Methods hashWithSalt :: Int -> MText -> Int # hash :: MText -> Int #
HasAnnotation MText Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText) Source # annOptions :: Maybe AnnOptions Source #
ErrorHasDoc MText Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements MText Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements MText) Source #
IsCustomErrorArgRep MText Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> MText -> Either Text MText Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #
IsError MText Source #	Use this for internal errors only. "Normal" error scenarios should use the mechanism of custom errors, see below.
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text MText Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError MText => MText -> s :-> t Source #
ConcatOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
SliceOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
HasRPCRepr MText
Instance details Defined in Morley.AsRPC Associated Types type AsRPC MText
TypeHasDoc MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions MText :: FieldDescriptions # Methods typeDocName :: Proxy MText -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy MText -> WithinParens -> Markdown # typeDocDependencies :: Proxy MText -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep MText # typeDocMichelsonRep :: TypeDocMichelsonRep MText #
IsoValue MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
HasCLReader MText
Instance details Defined in Morley.Michelson.Text Methods getReader :: ReadM MText getMetavar :: String
Buildable MText
Instance details Defined in Morley.Michelson.Text Methods build :: MText -> Doc buildList :: [MText] -> Doc
Container MText
Instance details Defined in Morley.Michelson.Text Associated Types type Element MText # Methods toList :: MText -> [Element MText] # null :: MText -> Bool # foldr :: (Element MText -> b -> b) -> b -> MText -> b # foldl :: (b -> Element MText -> b) -> b -> MText -> b # foldl' :: (b -> Element MText -> b) -> b -> MText -> b # length :: MText -> Int # elem :: Element MText -> MText -> Bool # foldMap :: Monoid m => (Element MText -> m) -> MText -> m # fold :: MText -> Element MText # foldr' :: (Element MText -> b -> b) -> b -> MText -> b # notElem :: Element MText -> MText -> Bool # all :: (Element MText -> Bool) -> MText -> Bool # any :: (Element MText -> Bool) -> MText -> Bool # and :: MText -> Bool # or :: MText -> Bool # find :: (Element MText -> Bool) -> MText -> Maybe (Element MText) # safeHead :: MText -> Maybe (Element MText) # safeMaximum :: MText -> Maybe (Element MText) # safeMinimum :: MText -> Maybe (Element MText) # safeFoldr1 :: (Element MText -> Element MText -> Element MText) -> MText -> Maybe (Element MText) # safeFoldl1 :: (Element MText -> Element MText -> Element MText) -> MText -> Maybe (Element MText) #
ToText MText
Instance details Defined in Morley.Michelson.Text Methods toText :: MText -> Text #
TypeHasDoc errArg => IsCustomErrorArgRep (MText, errArg) Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> (MText, errArg) -> Either Text (MText, errArg) Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #
type Rep MText
Instance details Defined in Morley.Michelson.Text type Rep MText = D1 ('MetaData "MText" "Morley.Michelson.Text" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "UnsafeMText" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMText") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type ErrorRequirements MText Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements MText = ()
type AsRPC MText
Instance details Defined in Morley.AsRPC type AsRPC MText = MText
type TypeDocFieldDescriptions MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT MText = 'TString
type Element MText
Instance details Defined in Morley.Michelson.Text type Element MText = Element Text

newtype Packed a Source #

Represents a ByteString resulting from packing a value of type a.

This is not guaranteed to keep some packed value, and unpack can fail. We do so because often we need to accept values of such type from user, and also because there is no simple way to check validity of packed data without performing full unpack. So this wrapper is rather a hint for users.

Constructors

Packed
Fields unPacked :: ByteString

Instances

Instances details

CanCastTo (Packed a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy ByteString -> () Source #
CanCastTo a b => CanCastTo (Packed a :: Type) (Packed b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy (Packed b) -> () Source #
Generic (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Packed a) :: Type -> Type # Methods from :: Packed a -> Rep (Packed a) x # to :: Rep (Packed a) x -> Packed a #
Show (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Packed a -> ShowS # show :: Packed a -> String # showList :: [Packed a] -> ShowS #
Eq (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Packed a -> Packed a -> Bool # (/=) :: Packed a -> Packed a -> Bool #
Ord (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Packed a -> Packed a -> Ordering # (<) :: Packed a -> Packed a -> Bool # (<=) :: Packed a -> Packed a -> Bool # (>) :: Packed a -> Packed a -> Bool # (>=) :: Packed a -> Packed a -> Bool # max :: Packed a -> Packed a -> Packed a # min :: Packed a -> Packed a -> Packed a #
HasAnnotation (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Packed a)) Source # annOptions :: Maybe AnnOptions Source #
Typeable a => BytesLike (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: Packed a -> ByteString Source #
HasRPCRepr (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type AsRPC (Packed a)
TypeHasDoc a => TypeHasDoc (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (Packed a) :: FieldDescriptions # Methods typeDocName :: Proxy (Packed a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Packed a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Packed a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Packed a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Packed a) #
IsoValue (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Packed a) :: T # Methods toVal :: Packed a -> Value (ToT (Packed a)) # fromVal :: Value (ToT (Packed a)) -> Packed a #
Buildable (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods build :: Packed a -> Doc buildList :: [Packed a] -> Doc
type Rep (Packed a) Source #
Instance details Defined in Lorentz.Bytes type Rep (Packed a) = D1 ('MetaData "Packed" "Lorentz.Bytes" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "Packed" 'PrefixI 'True) (S1 ('MetaSel ('Just "unPacked") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ByteString)))
type AsRPC (Packed a) Source #
Instance details Defined in Lorentz.Bytes type AsRPC (Packed a) = Packed a
type TypeDocFieldDescriptions (Packed a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (Packed a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Packed a) Source #
Instance details Defined in Lorentz.Bytes type ToT (Packed a) = ToT ByteString

newtype TSignature a Source #

Represents a signature, where signed data has given type.

Since we usually sign a packed data, a common pattern for this type is TSignature (Packed signedData). If you don't want to use Packed, use plain TSignature ByteString instead.

Constructors

TSignature
Fields unTSignature :: Signature

Instances

Instances details

CanCastTo (TSignature a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy ByteString -> () Source #
CanCastTo a b => CanCastTo (TSignature a :: Type) (TSignature b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy (TSignature b) -> () Source #
Generic (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (TSignature a) :: Type -> Type # Methods from :: TSignature a -> Rep (TSignature a) x # to :: Rep (TSignature a) x -> TSignature a #
Show (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> TSignature a -> ShowS # show :: TSignature a -> String # showList :: [TSignature a] -> ShowS #
HasAnnotation (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TSignature a)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type AsRPC (TSignature a)
TypeHasDoc a => TypeHasDoc (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (TSignature a) :: FieldDescriptions # Methods typeDocName :: Proxy (TSignature a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (TSignature a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (TSignature a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (TSignature a) # typeDocMichelsonRep :: TypeDocMichelsonRep (TSignature a) #
IsoValue (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (TSignature a) :: T # Methods toVal :: TSignature a -> Value (ToT (TSignature a)) # fromVal :: Value (ToT (TSignature a)) -> TSignature a #
Buildable (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods build :: TSignature a -> Doc buildList :: [TSignature a] -> Doc
type Rep (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type Rep (TSignature a) = D1 ('MetaData "TSignature" "Lorentz.Bytes" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "TSignature" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTSignature") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Signature)))
type AsRPC (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type AsRPC (TSignature a) = TSignature a
type TypeDocFieldDescriptions (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (TSignature a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type ToT (TSignature a) = ToT Signature

data DHashAlgorithm Source #

Documentation item for hash algorithms.

Instances

Instances details

Eq DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (/=) :: DHashAlgorithm -> DHashAlgorithm -> Bool #
Ord DHashAlgorithm Source #
Instance details 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 #
DocItem DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Associated Types type DocItemPlacement DHashAlgorithm :: DocItemPlacementKind # type DocItemReferenced DHashAlgorithm :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DHashAlgorithm -> DocItemRef (DocItemPlacement DHashAlgorithm) (DocItemReferenced DHashAlgorithm) # docItemToMarkdown :: HeaderLevel -> DHashAlgorithm -> Markdown # docItemToToc :: HeaderLevel -> DHashAlgorithm -> Markdown # docItemDependencies :: DHashAlgorithm -> [SomeDocDefinitionItem] # docItemsOrder :: [DHashAlgorithm] -> [DHashAlgorithm] #
type DocItemPlacement DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes type DocItemPlacement DHashAlgorithm = 'DocItemInDefinitions
type DocItemReferenced DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes type DocItemReferenced DHashAlgorithm = 'True

class Typeable alg => KnownHashAlgorithm (alg :: HashAlgorithmKind) where Source #

Hash algorithm used in Tezos.

Minimal complete definition

computeHash, toHash

Methods

hashAlgorithmName :: Proxy alg -> Text Source #

computeHash :: ByteString -> ByteString Source #

toHash :: BytesLike bs => (bs : s) :-> (Hash alg bs : s) Source #

Instances

Instances details

KnownHashAlgorithm Blake2b Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Blake2b -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Blake2b bs ': s) Source #
KnownHashAlgorithm Keccak Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Keccak -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Keccak bs ': s) Source #
KnownHashAlgorithm Sha256 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha256 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha256 bs ': s) Source #
KnownHashAlgorithm Sha3 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha3 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha3 bs ': s) Source #
KnownHashAlgorithm Sha512 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha512 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha512 bs ': s) Source #

data Sha256 :: HashAlgorithmKind Source #

Instances

Instances details

KnownHashAlgorithm Sha256 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha256 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha256 bs ': s) Source #

data Sha512 :: HashAlgorithmKind Source #

Instances

Instances details

KnownHashAlgorithm Sha512 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha512 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha512 bs ': s) Source #

data Sha3 :: HashAlgorithmKind Source #

Instances

Instances details

KnownHashAlgorithm Sha3 Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Sha3 -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Sha3 bs ': s) Source #

data Keccak :: HashAlgorithmKind Source #

Instances

Instances details

KnownHashAlgorithm Keccak Source #
Instance details Defined in Lorentz.Bytes Methods hashAlgorithmName :: Proxy Keccak -> Text Source # computeHash :: ByteString -> ByteString Source # toHash :: forall bs (s :: [Type]). BytesLike bs => (bs ': s) :-> (Hash Keccak bs ': s) Source #

newtype ChestT a Source #

Constructors

ChestT
Fields unChestT :: Chest

Instances

Instances details

Generic (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (ChestT a) :: Type -> Type # Methods from :: ChestT a -> Rep (ChestT a) x # to :: Rep (ChestT a) x -> ChestT a #
HasAnnotation (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ChestT a)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type AsRPC (ChestT a)
TypeHasDoc a => TypeHasDoc (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (ChestT a) :: FieldDescriptions # Methods typeDocName :: Proxy (ChestT a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ChestT a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ChestT a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (ChestT a) # typeDocMichelsonRep :: TypeDocMichelsonRep (ChestT a) #
IsoValue (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (ChestT a) :: T # Methods toVal :: ChestT a -> Value (ToT (ChestT a)) # fromVal :: Value (ToT (ChestT a)) -> ChestT a #
type Rep (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type Rep (ChestT a) = D1 ('MetaData "ChestT" "Lorentz.Bytes" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "ChestT" 'PrefixI 'True) (S1 ('MetaSel ('Just "unChestT") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Chest)))
type AsRPC (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type AsRPC (ChestT a) = ChestT a
type TypeDocFieldDescriptions (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (ChestT a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type ToT (ChestT a) = ToT Chest

data OpenChestT a Source #

Constructors

ChestContentT a
ChestOpenFailedT Bool

Instances

Instances details

Generic (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (OpenChestT a) :: Type -> Type # Methods from :: OpenChestT a -> Rep (OpenChestT a) x # to :: Rep (OpenChestT a) x -> OpenChestT a #
Show a => Show (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> OpenChestT a -> ShowS # show :: OpenChestT a -> String # showList :: [OpenChestT a] -> ShowS #
Eq a => Eq (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: OpenChestT a -> OpenChestT a -> Bool # (/=) :: OpenChestT a -> OpenChestT a -> Bool #
HasAnnotation a => HasAnnotation (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (OpenChestT a)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr a => HasRPCRepr (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type AsRPC (OpenChestT a)
TypeHasDoc a => TypeHasDoc (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (OpenChestT a) :: FieldDescriptions # Methods typeDocName :: Proxy (OpenChestT a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (OpenChestT a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (OpenChestT a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (OpenChestT a) # typeDocMichelsonRep :: TypeDocMichelsonRep (OpenChestT a) #
IsoValue a => IsoValue (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (OpenChestT a) :: T # Methods toVal :: OpenChestT a -> Value (ToT (OpenChestT a)) # fromVal :: Value (ToT (OpenChestT a)) -> OpenChestT a #
type Rep (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type Rep (OpenChestT a) = D1 ('MetaData "OpenChestT" "Lorentz.Bytes" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "ChestContentT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a)) :+: C1 ('MetaCons "ChestOpenFailedT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Bool)))
type AsRPC (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type AsRPC (OpenChestT a) = OpenChestT (AsRPC a)
type TypeDocFieldDescriptions (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (OpenChestT a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type ToT (OpenChestT a) = GValueType (GRep (OpenChestT a))

type Markdown = Doc #

class CanCastTo a b where Source #

Explicitly allowed coercions.

a CanCastTo b proclaims that a can be casted to b without violating any invariants of b.

This relation is reflexive; it may be symmetric or not. It tends to be composable: casting complex types usually requires permission to cast their respective parts; for such types consider using castDummyG as implementation of the method of this typeclass.

For cases when a cast from a to b requires some validation, consider rather making a dedicated function which performs the necessary checks and then calls forcedCoerce.

Minimal complete definition

Nothing

Methods

castDummy :: Proxy a -> Proxy b -> () Source #

An optional method which helps passing -Wredundant-constraints check. Also, you can set specific implementation for it with specific sanity checks.

Instances

Instances details

CanCastTo (a :: k) (a :: k) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy a -> Proxy a -> () Source #
CanCastTo Address (TAddress p vd :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p vd) -> () Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () Source #
CanCastTo (Packed a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy ByteString -> () Source #
CanCastTo (TSignature a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy ByteString -> () Source #
CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Set k1) -> Proxy (Set k2) -> () Source #
CanCastTo a b => CanCastTo (Packed a :: Type) (Packed b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy (Packed b) -> () Source #
CanCastTo a b => CanCastTo (TSignature a :: Type) (TSignature b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy (TSignature b) -> () Source #
SameEntries entries1 entries2 => CanCastTo (UParam entries1 :: Type) (UParam entries2 :: Type) Source #	Allows casts only between `UParam_` and `UParam`.
Instance details Defined in Lorentz.UParam Methods castDummy :: Proxy (UParam entries1) -> Proxy (UParam entries2) -> () Source #
CanCastTo a1 a2 => CanCastTo (ContractRef a1 :: Type) (ContractRef a2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ContractRef a1) -> Proxy (ContractRef a2) -> () Source #
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () Source #
CanCastTo a b => CanCastTo ([a] :: Type) ([b] :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy [a] -> Proxy [b] -> () Source #
CanCastTo (TAddress p vd :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p vd) -> Proxy Address -> () Source #
CanCastTo (Hash alg a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg a) -> Proxy ByteString -> () Source #
(CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Either l1 r1) -> Proxy (Either l2 r2) -> () Source #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Map k1 v1) -> Proxy (Map k2 v2) -> () Source #
(CanCastTo (ZippedStack i1) (ZippedStack i2), CanCastTo (ZippedStack o1) (ZippedStack o2)) => CanCastTo (i1 :-> o1 :: Type) (i2 :-> o2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (i1 :-> o1) -> Proxy (i2 :-> o2) -> () Source #
(CanCastTo alg1 alg2, CanCastTo a1 a2) => CanCastTo (Hash alg1 a1 :: Type) (Hash alg2 a2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg1 a1) -> Proxy (Hash alg2 a2) -> () Source #
(CanCastTo (ZippedStack inp1) (ZippedStack inp2), CanCastTo (ZippedStack out1) (ZippedStack out2), CanCastTo (ZippedStack (inp1 ++ '[WrappedLambda inp1 out1])) (ZippedStack (inp2 ++ '[WrappedLambda inp2 out2]))) => CanCastTo (WrappedLambda inp1 out1 :: Type) (WrappedLambda inp2 out2 :: Type) Source #
Instance details Defined in Lorentz.Lambda Methods castDummy :: Proxy (WrappedLambda inp1 out1) -> Proxy (WrappedLambda inp2 out2) -> () Source #
(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (View_ a1 r1 :: Type) (View_ a2 r2 :: Type) Source #
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (View_ a1 r1) -> Proxy (View_ a2 r2) -> () Source #
(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (Void_ a1 r1 :: Type) (Void_ a2 r2 :: Type) Source #
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (Void_ a1 r1) -> Proxy (Void_ a2 r2) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2) => CanCastTo (ZippedStackRepr a1 b1 :: Type) (ZippedStackRepr a2 b2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ZippedStackRepr a1 b1) -> Proxy (ZippedStackRepr a2 b2) -> () Source #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (BigMap k1 v1 :: Type) (BigMap k2 v2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (BigMap k1 v1) -> Proxy (BigMap k2 v2) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2) => CanCastTo ((a1, b1) :: Type) ((a2, b2) :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1) -> Proxy (a2, b2) -> () Source #
(CanCastTo a a2, CanCastTo td td2) => CanCastTo (STicket a td :: Type) (STicket a2 td2 :: Type) Source #
Instance details Defined in Lorentz.Tickets Methods castDummy :: Proxy (STicket a td) -> Proxy (STicket a2 td2) -> () Source #
CanCastTo (f a) (g b) => CanCastTo (NamedF f a n :: Type) (NamedF g b m :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (NamedF f a n) -> Proxy (NamedF g b m) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2) => CanCastTo ((a1, b1, c1) :: Type) ((a2, b2, c2) :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1) -> Proxy (a2, b2, c2) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2, CanCastTo d1 d2) => CanCastTo ((a1, b1, c1, d1) :: Type) ((a2, b2, c2, d2) :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1) -> Proxy (a2, b2, c2, d2) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2, CanCastTo d1 d2, CanCastTo e1 e2) => CanCastTo ((a1, b1, c1, d1, e1) :: Type) ((a2, b2, c2, d2, e2) :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1, e1) -> Proxy (a2, b2, c2, d2, e2) -> () Source #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2, CanCastTo d1 d2, CanCastTo e1 e2, CanCastTo f1 f2) => CanCastTo ((a1, b1, c1, d1, e1, f1) :: Type) ((a2, b2, c2, d2, e2, f2) :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1, e1, f1) -> Proxy (a2, b2, c2, d2, e2, f2) -> () Source #

type Castable_ a b = (MichelsonCoercible a b, CanCastTo a b) Source #

Coercion from a to b is permitted and safe.

type Coercible_ a b = (MichelsonCoercible a b, CanCastTo a b, CanCastTo b a) Source #

Coercions between a to b are permitted and safe.

type MichelsonCoercible a b = ToT a ~ ToT b Source #

Whether two types have the same Michelson representation.

class ToT s ~ ToT (Unwrappabled s) => Unwrappable (s :: Type) Source #

Declares that this type is just a wrapper over some other type and it can be safely unwrapped to that inner type.

Inspired by lens Wrapped.

Generic-derivable for newtypes.

>>> import Lorentz
>>> :{
newtype Foo = Foo Integer
  deriving stock Generic
  deriving anyclass (IsoValue, Unwrappable)
:}

IsoValue instance is mandatory, but Generic isn't:

>>> import Morley.Michelson.Typed.T
>>> :{
data Foo = Foo Integer
--
instance IsoValue Foo where
  type ToT Foo = TInt
  toVal (Foo i) = toVal i
  fromVal i = Foo $ fromVal i
--
instance Unwrappable Foo where
  type Unwrappabled Foo = Integer
:}

Associated Types

type Unwrappabled s :: Type Source #

The type we unwrap to (inner type of the newtype).

Used in constraint for Lorentz instruction wrapping into a Haskell newtype and vice versa.

type Unwrappabled s = GUnwrappabled s (Rep s)

Instances

Instances details

Unwrappable NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type Unwrappabled NRational Source #
Unwrappable Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type Unwrappabled Rational Source #
Unwrappable (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type Unwrappabled (UParam entries) Source #
Unwrappable (Fixed a) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (Fixed a) Source #
Unwrappable (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type Unwrappabled (NFixed a) Source #
Unwrappable (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Unwrappabled (ParameterWrapper deriv cp) Source #
Unwrappable (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type Unwrappabled (Extensible x) Source #
Unwrappable (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type Unwrappabled (STicket action td) Source #
Unwrappable (NamedF Identity a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Identity a name) Source #
Unwrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) Source #

class Unwrappable s => Wrappable (s :: Type) Source #

Declares that it is safe to wrap an inner type to the given wrapper type. Can be provided in addition to Unwrappable.

You can declare this instance when your wrapper exists just to make type system differentiate the two types. Example: newtype TokenId = TokenId Natural.

Do not define this instance for wrappers that provide some invariants. Example: UStore type from morley-upgradeable.

Wrappable is similar to lens Wrapped class without the method.

Instances

Instances details

Wrappable (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual
Wrappable (NamedF Identity a name) Source #
Instance details Defined in Lorentz.Wrappable
Wrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable

type Entrypoint param store = '[param, store] :-> ContractOut store Source #

Single entrypoint of a contract.

Note that we cannot make it return [[Operation], store] because such entrypoint should've been followed by pair, and this is not possible if entrypoint implementation ends with failWith.

type Entrypoint_ store = '[store] :-> ContractOut store Source #

Version of Entrypoint which accepts no argument.

type NiceParameterFull cp = (Typeable cp, ParameterDeclaresEntrypoints cp) Source #

Constraint applied to a whole parameter type.

data DupableDecision a Source #

Tells whether given type is dupable or not.

Constructors

Dupable a => IsDupable
IsNotDupable

type NiceViews vs = RequireAllUnique "view" (ViewsNames vs) Source #

Require views set to be proper.

type NiceViewsDescriptor vd = NiceViews (RevealViews vd) Source #

Require views set referred by the given views descriptor to be proper.

class (ComparabilityScopeC (NiceComparable n) (ToT n), KnownValue n) => NiceComparable n Source #

Constraint applied to any type, to check if Michelson representation (if exists) of this type is Comparable. In case it is not prints human-readable error message

>>> emptySet @[Integer]
...
... Non-comparable type
... 'TList 'TInt
... is not allowed in this scope
...

>>> emptySet
...
... Can't check if type
... ToT e0
... contains non-comparable types. Perhaps you need to add
... NiceComparable e0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(ComparabilityScopeC (NiceComparable n) (ToT n), KnownValue n) => NiceComparable n Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ConstantScopeC (NiceConstant a) (ToT a), KnownValue a) => NiceConstant a Source #

Constraint applied to constants.

Shows human-readable errors on ambiguity:

>>> push undefined
...
... Can't check if type
... ToT t0
... contains `operation`, `big_map`, `contract`, `ticket` or `sapling_state`. Perhaps you need to add
... NiceConstant t0
... constraint? You can also try adding a type annotation.
...

>>> pretty $ push (1 :: Integer)
[PUSH int 1]

Instances

Instances details

(ConstantScopeC (NiceConstant a) (ToT a), KnownValue a) => NiceConstant a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (DupableScopeC (Dupable a) (ToT a), KnownValue a) => Dupable a Source #

Constraint applied to constants.

Shows human-readable errors:

>>> ticket # dup
...
... Type `ticket` found in
... 'TOption ('TTicket (ToT a))
... is not allowed in this scope
...

Also on ambiguity:

>>> dup
...
... Can't check if type
... ToT a0
... contains `ticket`. Perhaps you need to add
... Dupable a0
... constraint? You can also try adding a type annotation.
...

>>> pretty $ dup @Integer
[DUP]

Instances

Instances details

(DupableScopeC (Dupable a) (ToT a), KnownValue a) => Dupable a Source #
Instance details Defined in Lorentz.Constraints.Scopes

type NiceFullPackedValue a = (NicePackedValue a, NiceUnpackedValue a) Source #

class (PackedValScopeC (NicePackedValue a) (ToT a), KnownValue a) => NicePackedValue a Source #

Constraint applied to a value being packed.

Shows human-readable errors:

>>> pack @Operation
...
... Type `operation` found in
... 'TOperation
... is not allowed in this scope
...

Also on ambiguity:

>>> pack
...
... Can't check if type
... ToT a0
... contains `operation`, `big_map`, `ticket` or `sapling_state`. Perhaps you need to add
... NicePackedValue a0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(PackedValScopeC (NicePackedValue a) (ToT a), KnownValue a) => NicePackedValue a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ParameterScopeC (NiceParameter a) (ToT a), KnownValue a) => NiceParameter a Source #

Constraint applied to any part of a parameter type.

Use NiceParameterFull instead when you need to know the contract's entrypoints at compile-time.

Shows human-readable errors:

>>> epAddressToContract @Operation
...
... Type `operation` found in
... 'TOperation
... is not allowed in this scope
...

Also on ambiguity:

>>> epAddressToContract
...
... Can't check if type
... ToT p0
... contains `operation` or nested `big_map`s. Perhaps you need to add
... NiceParameter p0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(ParameterScopeC (NiceParameter a) (ToT a), KnownValue a) => NiceParameter a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (UntypedValScopeC (NiceUntypedValue a) (ToT a), KnownValue a) => NiceUntypedValue a Source #

Instances

Instances details

(UntypedValScopeC (NiceUntypedValue a) (ToT a), KnownValue a) => NiceUntypedValue a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (StorageScopeC (NiceStorage a) (ToT a), KnownValue a) => NiceStorage a Source #

Instances

Instances details

(StorageScopeC (NiceStorage a) (ToT a), KnownValue a) => NiceStorage a Source #
Instance details Defined in Lorentz.Constraints.Scopes

type NiceStorageFull a = (NiceStorage a, HasAnnotation a) Source #

class (UnpackedValScopeC (NiceUnpackedValue a) (ToT a), KnownValue a) => NiceUnpackedValue a Source #

Constraint applied to a value being unpacked.

Shows human-readable errors:

>>> unpack @Operation
...
... Type `operation` found in
... 'TOperation
... is not allowed in this scope
...

Also on ambiguity:

>>> unpack
...
... Can't check if type
... ToT a0
... contains `operation`, `big_map`, `contract`, `ticket` or `sapling_state`. Perhaps you need to add
... NiceUnpackedValue a0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(UnpackedValScopeC (NiceUnpackedValue a) (ToT a), KnownValue a) => NiceUnpackedValue a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ViewableScopeC (NiceViewable a) (ToT a), KnownValue a) => NiceViewable a Source #

Constraint applied to a value returned from a view.

Shows human-readable errors:

>>> view' @"SomeView" @Operation
...
... Type `operation` found in
... 'TOperation
... is not allowed in this scope
...

Also on ambiguity:

>>> view' @"SomeView"
...
... Can't check if type
... ToT ret0
... contains `operation`, `big_map` or `ticket`. Perhaps you need to add
... NiceViewable ret0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(ViewableScopeC (NiceViewable a) (ToT a), KnownValue a) => NiceViewable a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (KnownValue n, ForbidManyT (NiceNoBigMap n) '['PSBigMap] (ToT n)) => NiceNoBigMap n Source #

Constraint applied to a big_map value type.

Shows human-readable errors:

>>> emptyBigMap @Integer @(BigMap Integer Integer)
...
... Type `big_map` found in
... 'TBigMap 'TInt 'TInt
... is not allowed in this scope
...

Also on ambiguity:

>>> emptyBigMap @Integer
...
... Can't check if type
... ToT v0
... contains `big_map`. Perhaps you need to add
... NiceNoBigMap v0
... constraint? You can also try adding a type annotation.
...

Instances

Instances details

(KnownValue n, ForbidManyT (NiceNoBigMap n) '['PSBigMap] (ToT n)) => NiceNoBigMap n Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ForbidNestedBigMaps (ToT a), IsoValue a) => CanHaveBigMap a Source #

Instances

Instances details

(ForbidNestedBigMaps (ToT a), IsoValue a) => CanHaveBigMap a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (IsoValue a, Typeable a) => KnownValue a Source #

Gathers constraints, commonly required for values.

Instances

Instances details

(IsoValue a, Typeable a) => KnownValue a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ForbidOp (ToT a), IsoValue a) => NoOperation a Source #

Ensure given type does not contain "operation".

Instances

Instances details

(ForbidOp (ToT a), IsoValue a) => NoOperation a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ForbidContract (ToT a), IsoValue a) => NoContractType a Source #

Instances

Instances details

(ForbidContract (ToT a), IsoValue a) => NoContractType a Source #
Instance details Defined in Lorentz.Constraints.Scopes

class (ForbidBigMap (ToT a), IsoValue a) => NoBigMap a Source #

Instances

Instances details

(ForbidBigMap (ToT a), IsoValue a) => NoBigMap a Source #
Instance details Defined in Lorentz.Constraints.Scopes

type family (name :: Symbol) ?:: (tys :: (Type, Type)) where ... infix 3 Source #

Neat constructor for ViewTyInfo.

type View = "view" ?:: Integer >-> Natural

Equations

name ?:: '(arg, ret) = 'ViewTyInfo name arg ret

class LorentzRounding a b where Source #

Class that enables support of rounding operations for Lorentz non-integer values

Methods

round_ :: (a : s) :-> (b : s) Source #

ceil_ :: (a : s) :-> (b : s) Source #

floor_ :: (a : s) :-> (b : s) Source #

Instances

Instances details

(LorentzRational r, Unwrappabled r ~ (a, Natural), ArithOpHs EDiv a Natural (Maybe (a, Natural)), ArithOpHs Add a Natural a, ArithOpHs Add Natural a a) => LorentzRounding r a Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods round_ :: forall (s :: [Type]). (r ': s) :-> (a ': s) Source # ceil_ :: forall (s :: [Type]). (r ': s) :-> (a ': s) Source # floor_ :: forall (s :: [Type]). (r ': s) :-> (a ': s) Source #
(KnownNat a, KnownNat b, b1 ~ b2, LorentzFixedBase b1) => LorentzRounding (Fixed (b1 a)) (Fixed (b2 b)) Source #	Round is implemented using "banker's rounding" strategy, rounding half-way values towards nearest even value
Instance details Defined in Lorentz.CustomArith.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (b1 a) ': s) :-> (Fixed (b2 b) ': s) Source #
(KnownNat a, KnownNat b, b1 ~ b2, LorentzFixedBase b1) => LorentzRounding (NFixed (b1 a)) (NFixed (b2 b)) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods round_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source # ceil_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source # floor_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source #

newtype NFixed p Source #

Like Fixed but with a Natural value inside constructor

Constructors

MkNFixed Natural

Instances

Instances details

DivIntegralConstraint r b => ArithOpHs Div Natural Natural (Maybe (NFixed (b r))) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe (NFixed (b r)) ': s) Source #
DivConstraint1 a t r (Fixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Integer (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
DivConstraint1 a t r (NFixed :: LorentzFixedBaseKind -> Type) b1 => ArithOpHs Div Natural (NFixed (b1 a)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed (b1 a) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
UnaryArithOpHs Neg (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type UnaryArithResHs Neg (NFixed p) Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (NFixed p ': s) :-> (UnaryArithResHs Neg (NFixed p) ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (base a)), KnownNat a, LorentzFixedBase base) => ArithOpHs EDiv (NFixed (base a)) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (base a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Integer r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Natural r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
DivConstraint a b t r (NFixed :: LorentzFixedBaseKind -> Type) b1 b2 => ArithOpHs Div (NFixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (NFixed p ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (Fixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ Fixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (NFixed (b1 a)) (Fixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (Fixed (b2 b) ': s)) :-> (r ': s) Source #
(r ~ NFixed (b1 (a + b)), b1 ~ b2) => ArithOpHs Mul (NFixed (b1 a)) (NFixed (b2 b)) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (b1 a) ': (NFixed (b2 b) ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (NFixed p ': s)) :-> (r ': s) Source #
HasResolution a => Num (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods (+) :: NFixed a -> NFixed a -> NFixed a # (-) :: NFixed a -> NFixed a -> NFixed a # (*) :: NFixed a -> NFixed a -> NFixed a # negate :: NFixed a -> NFixed a # abs :: NFixed a -> NFixed a # signum :: NFixed a -> NFixed a # fromInteger :: Integer -> NFixed a #
HasResolution a => Fractional (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods (/) :: NFixed a -> NFixed a -> NFixed a # recip :: NFixed a -> NFixed a # fromRational :: Rational -> NFixed a #
HasResolution a => Real (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods toRational :: NFixed a -> Rational #
HasResolution a => Show (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods showsPrec :: Int -> NFixed a -> ShowS # show :: NFixed a -> String # showList :: [NFixed a] -> ShowS #
Eq (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods (==) :: NFixed p -> NFixed p -> Bool # (/=) :: NFixed p -> NFixed p -> Bool #
Ord (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods compare :: NFixed p -> NFixed p -> Ordering # (<) :: NFixed p -> NFixed p -> Bool # (<=) :: NFixed p -> NFixed p -> Bool # (>) :: NFixed p -> NFixed p -> Bool # (>=) :: NFixed p -> NFixed p -> Bool # max :: NFixed p -> NFixed p -> NFixed p # min :: NFixed p -> NFixed p -> NFixed p #
ToIntegerArithOpHs (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods evalToIntOpHs :: forall (s :: [Type]). (NFixed a ': s) :-> (Integer ': s) Source #
Unwrappable (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type Unwrappabled (NFixed a) Source #
IsoValue (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Associated Types type ToT (NFixed p) :: T # Methods toVal :: NFixed p -> Value (ToT (NFixed p)) # fromVal :: Value (ToT (NFixed p)) -> NFixed p #
(KnownNat a, KnownNat b, b1 ~ b2, LorentzFixedBase b1) => LorentzRounding (NFixed (b1 a)) (NFixed (b2 b)) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods round_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source # ceil_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source # floor_ :: forall (s :: [Type]). (NFixed (b1 a) ': s) :-> (NFixed (b2 b) ': s) Source #
type UnaryArithResHs Neg (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith type UnaryArithResHs Neg (NFixed p) = Fixed p
type Unwrappabled (NFixed a) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith type Unwrappabled (NFixed a) = Natural
type ToT (NFixed p) Source #
Instance details Defined in Lorentz.CustomArith.FixedArith type ToT (NFixed p) = 'TNat

type LorentzFixedBaseKind = LorentzFixedBaseKindTag -> Type Source #

Open kind for fixed value bases.

data DecBase :: Nat -> LorentzFixedBaseKind Source #

Represents decimal base of the Lorentz fixed-point values

Instances

Instances details

LorentzFixedBase DecBase Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods getBase :: Num b => b Source #

data BinBase :: Nat -> LorentzFixedBaseKind Source #

Represents binary base of the Lorentz fixed-point values

Instances

Instances details

LorentzFixedBase BinBase Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods getBase :: Num b => b Source #

class Typeable a => LorentzFixedBase a where Source #

Methods

getBase :: Num b => b Source #

Instances

Instances details

LorentzFixedBase BinBase Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods getBase :: Num b => b Source #
LorentzFixedBase DecBase Source #
Instance details Defined in Lorentz.CustomArith.FixedArith Methods getBase :: Num b => b Source #

data NRational Source #

Instances

Instances details

Show NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods showsPrec :: Int -> NRational -> ShowS # show :: NRational -> String # showList :: [NRational] -> ShowS #
Eq NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods (==) :: NRational -> NRational -> Bool # (/=) :: NRational -> NRational -> Bool #
HasAnnotation NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT NRational) Source # annOptions :: Maybe AnnOptions Source #
LorentzRational NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods numerator :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (a ': s) Source # denominator :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (Natural ': s) Source # deconstructRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (a ': (Natural ': s)) Source # constructRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (a ': (Natural ': s)) :-> (NRational ': s) Source # unsafePairToRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => ((a, Natural) ': s) :-> (NRational ': s) Source # uncheckedPairToRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => ((a, Natural) ': s) :-> (NRational ': s) Source # pairToRational :: forall a (s :: [Type]). (Unwrappabled NRational ~ (a, Natural), KnownValue NRational) => ((a, Natural) ': s) :-> (Maybe NRational ': s) Source # oppositeRational :: forall (s :: [Type]). (NRational ': s) :-> (NRational ': s) Source # reduce :: forall (s :: [Type]). (NRational ': s) :-> (NRational ': s) Source #
Unwrappable NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type Unwrappabled NRational Source #
IsoValue NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Associated Types type ToT NRational :: T # Methods toVal :: NRational -> Value (ToT NRational) # fromVal :: Value (ToT NRational) -> NRational #
r ~ NRational => ArithOpHs Div NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Div Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Div Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Add Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Add Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Mul Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ NRational => ArithOpHs Mul Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Rational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Rational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Integer r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Integer ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub NRational Natural r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (NRational ': (Natural ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Rational NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Rational ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Integer NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NRational ': s)) :-> (r ': s) Source #
r ~ Rational => ArithOpHs Sub Natural NRational r Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NRational ': s)) :-> (r ': s) Source #
ArithOpHs Div Natural Natural (Maybe NRational) Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (Maybe NRational ': s) Source #
type Unwrappabled NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type Unwrappabled NRational = (Natural, Natural)
type ToT NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type ToT NRational = 'TPair 'TNat 'TNat

class Unwrappable r => LorentzRational r where Source #

Minimal complete definition

oppositeRational, reduce

Methods

numerator :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (a : s) Source #

denominator :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (Natural : s) Source #

deconstructRational :: Unwrappabled r ~ (a, Natural) => (r : s) :-> (a : (Natural : s)) Source #

constructRational :: Unwrappabled r ~ (a, Natural) => (a : (Natural : s)) :-> (r : s) Source #

unsafePairToRational :: Unwrappabled r ~ (a, Natural) => ((a, Natural) : s) :-> (r : s) Source #

uncheckedPairToRational :: Unwrappabled r ~ (a, Natural) => ((a, Natural) : s) :-> (r : s) Source #

pairToRational :: (Unwrappabled r ~ (a, Natural), KnownValue r) => ((a, Natural) : s) :-> (Maybe r : s) Source #

oppositeRational :: (r : s) :-> (r : s) Source #

reduce :: (r : s) :-> (r : s) Source #

Instances

Instances details

LorentzRational NRational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods numerator :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (a ': s) Source # denominator :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (Natural ': s) Source # deconstructRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (NRational ': s) :-> (a ': (Natural ': s)) Source # constructRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => (a ': (Natural ': s)) :-> (NRational ': s) Source # unsafePairToRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => ((a, Natural) ': s) :-> (NRational ': s) Source # uncheckedPairToRational :: forall a (s :: [Type]). Unwrappabled NRational ~ (a, Natural) => ((a, Natural) ': s) :-> (NRational ': s) Source # pairToRational :: forall a (s :: [Type]). (Unwrappabled NRational ~ (a, Natural), KnownValue NRational) => ((a, Natural) ': s) :-> (Maybe NRational ': s) Source # oppositeRational :: forall (s :: [Type]). (NRational ': s) :-> (NRational ': s) Source # reduce :: forall (s :: [Type]). (NRational ': s) :-> (NRational ': s) Source #
LorentzRational Rational Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods numerator :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (a ': s) Source # denominator :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (Natural ': s) Source # deconstructRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (Rational ': s) :-> (a ': (Natural ': s)) Source # constructRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => (a ': (Natural ': s)) :-> (Rational ': s) Source # unsafePairToRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => ((a, Natural) ': s) :-> (Rational ': s) Source # uncheckedPairToRational :: forall a (s :: [Type]). Unwrappabled Rational ~ (a, Natural) => ((a, Natural) ': s) :-> (Rational ': s) Source # pairToRational :: forall a (s :: [Type]). (Unwrappabled Rational ~ (a, Natural), KnownValue Rational) => ((a, Natural) ': s) :-> (Maybe Rational ': s) Source # oppositeRational :: forall (s :: [Type]). (Rational ': s) :-> (Rational ': s) Source # reduce :: forall (s :: [Type]). (Rational ': s) :-> (Rational ': s) Source #

data DView Source #

Renders to a view section.

Constructors

DView
Fields dvName :: ViewName dvSub :: SubDoc

Instances

Instances details

DocItem DView Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DView :: DocItemPlacementKind # type DocItemReferenced DView :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DView -> DocItemRef (DocItemPlacement DView) (DocItemReferenced DView) # docItemToMarkdown :: HeaderLevel -> DView -> Markdown # docItemToToc :: HeaderLevel -> DView -> Markdown # docItemDependencies :: DView -> [SomeDocDefinitionItem] # docItemsOrder :: [DView] -> [DView] #
type DocItemPlacement DView Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DView = 'DocItemInlined
type DocItemReferenced DView Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DView = 'True

data DViewArg Source #

Renders to a line mentioning the view's argument.

Constructors

forall a.(NiceViewable a, TypeHasDoc a) => DViewArg (Proxy a)

Instances

Instances details

DocItem DViewArg Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewArg :: DocItemPlacementKind # type DocItemReferenced DViewArg :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewArg -> DocItemRef (DocItemPlacement DViewArg) (DocItemReferenced DViewArg) # docItemToMarkdown :: HeaderLevel -> DViewArg -> Markdown # docItemToToc :: HeaderLevel -> DViewArg -> Markdown # docItemDependencies :: DViewArg -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewArg] -> [DViewArg] #
type DocItemPlacement DViewArg Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewArg = 'DocItemInlined
type DocItemReferenced DViewArg Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewArg = 'False

data DViewRet Source #

Renders to a line mentioning the view's argument.

Constructors

forall a.(NiceViewable a, TypeHasDoc a) => DViewRet (Proxy a)

Instances

Instances details

DocItem DViewRet Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewRet :: DocItemPlacementKind # type DocItemReferenced DViewRet :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewRet -> DocItemRef (DocItemPlacement DViewRet) (DocItemReferenced DViewRet) # docItemToMarkdown :: HeaderLevel -> DViewRet -> Markdown # docItemToToc :: HeaderLevel -> DViewRet -> Markdown # docItemDependencies :: DViewRet -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewRet] -> [DViewRet] #
type DocItemPlacement DViewRet Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewRet = 'DocItemInlined
type DocItemReferenced DViewRet Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewRet = 'False

data DViewDesc Source #

Renders to documentation of view descriptor.

Constructors

forall vd.ViewsDescriptorHasDoc vd => DViewDesc (Proxy vd)

Instances

Instances details

Eq DViewDesc Source #
Instance details Defined in Lorentz.Doc Methods (==) :: DViewDesc -> DViewDesc -> Bool # (/=) :: DViewDesc -> DViewDesc -> Bool #
Ord DViewDesc Source #
Instance details Defined in Lorentz.Doc Methods compare :: DViewDesc -> DViewDesc -> Ordering # (<) :: DViewDesc -> DViewDesc -> Bool # (<=) :: DViewDesc -> DViewDesc -> Bool # (>) :: DViewDesc -> DViewDesc -> Bool # (>=) :: DViewDesc -> DViewDesc -> Bool # max :: DViewDesc -> DViewDesc -> DViewDesc # min :: DViewDesc -> DViewDesc -> DViewDesc #
DocItem DViewDesc Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewDesc :: DocItemPlacementKind # type DocItemReferenced DViewDesc :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewDesc -> DocItemRef (DocItemPlacement DViewDesc) (DocItemReferenced DViewDesc) # docItemToMarkdown :: HeaderLevel -> DViewDesc -> Markdown # docItemToToc :: HeaderLevel -> DViewDesc -> Markdown # docItemDependencies :: DViewDesc -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewDesc] -> [DViewDesc] #
type DocItemPlacement DViewDesc Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewDesc = 'DocItemInDefinitions
type DocItemReferenced DViewDesc Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewDesc = 'True

class (Typeable vd, RenderViewsImpl (RevealViews vd)) => ViewsDescriptorHasDoc (vd :: Type) where Source #

Provides documentation for views descriptor.

Note that views descriptors may describe views that do not belong to the current contract, e.g. TAddress may refer to an external contract provided by the user in which we want to call a view.

Minimal complete definition

Nothing

Methods

viewsDescriptorName :: Proxy vd -> Text Source #

default viewsDescriptorName :: (Generic vd, KnownSymbol (GenericTypeName vd)) => Proxy vd -> Text Source #

renderViewsDescriptorDoc :: Proxy vd -> Doc Source #

data DocElem d #

Constructors

DocElem
Fields deItem :: d deSub :: Maybe SubDoc

class (Typeable d, DOrd d) => DocItem d where #

Minimal complete definition

docItemPos, docItemSectionName, docItemToMarkdown

Associated Types

type DocItemPlacement d :: DocItemPlacementKind #

type DocItemPlacement d = 'DocItemInlined

type DocItemReferenced d :: DocItemReferencedKind #

type DocItemReferenced d = 'False

Methods

docItemPos :: Natural #

docItemSectionName :: Maybe Text #

docItemSectionDescription :: Maybe Markdown #

docItemSectionNameStyle :: DocSectionNameStyle #

docItemRef :: d -> DocItemRef (DocItemPlacement d) (DocItemReferenced d) #

docItemToMarkdown :: HeaderLevel -> d -> Markdown #

docItemToToc :: HeaderLevel -> d -> Markdown #

docItemDependencies :: d -> [SomeDocDefinitionItem] #

docItemsOrder :: [d] -> [d] #

Instances

Instances details

DocItem DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Associated Types type DocItemPlacement DHashAlgorithm :: DocItemPlacementKind # type DocItemReferenced DHashAlgorithm :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DHashAlgorithm -> DocItemRef (DocItemPlacement DHashAlgorithm) (DocItemReferenced DHashAlgorithm) # docItemToMarkdown :: HeaderLevel -> DHashAlgorithm -> Markdown # docItemToToc :: HeaderLevel -> DHashAlgorithm -> Markdown # docItemDependencies :: DHashAlgorithm -> [SomeDocDefinitionItem] # docItemsOrder :: [DHashAlgorithm] -> [DHashAlgorithm] #
DocItem DEntrypointExample Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DEntrypointExample :: DocItemPlacementKind # type DocItemReferenced DEntrypointExample :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointExample -> DocItemRef (DocItemPlacement DEntrypointExample) (DocItemReferenced DEntrypointExample) # docItemToMarkdown :: HeaderLevel -> DEntrypointExample -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointExample -> Markdown # docItemDependencies :: DEntrypointExample -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointExample] -> [DEntrypointExample] #
DocItem DView Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DView :: DocItemPlacementKind # type DocItemReferenced DView :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DView -> DocItemRef (DocItemPlacement DView) (DocItemReferenced DView) # docItemToMarkdown :: HeaderLevel -> DView -> Markdown # docItemToToc :: HeaderLevel -> DView -> Markdown # docItemDependencies :: DView -> [SomeDocDefinitionItem] # docItemsOrder :: [DView] -> [DView] #
DocItem DViewArg Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewArg :: DocItemPlacementKind # type DocItemReferenced DViewArg :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewArg -> DocItemRef (DocItemPlacement DViewArg) (DocItemReferenced DViewArg) # docItemToMarkdown :: HeaderLevel -> DViewArg -> Markdown # docItemToToc :: HeaderLevel -> DViewArg -> Markdown # docItemDependencies :: DViewArg -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewArg] -> [DViewArg] #
DocItem DViewDesc Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewDesc :: DocItemPlacementKind # type DocItemReferenced DViewDesc :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewDesc -> DocItemRef (DocItemPlacement DViewDesc) (DocItemReferenced DViewDesc) # docItemToMarkdown :: HeaderLevel -> DViewDesc -> Markdown # docItemToToc :: HeaderLevel -> DViewDesc -> Markdown # docItemDependencies :: DViewDesc -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewDesc] -> [DViewDesc] #
DocItem DViewRet Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DViewRet :: DocItemPlacementKind # type DocItemReferenced DViewRet :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DViewRet -> DocItemRef (DocItemPlacement DViewRet) (DocItemReferenced DViewRet) # docItemToMarkdown :: HeaderLevel -> DViewRet -> Markdown # docItemToToc :: HeaderLevel -> DViewRet -> Markdown # docItemDependencies :: DViewRet -> [SomeDocDefinitionItem] # docItemsOrder :: [DViewRet] -> [DViewRet] #
DocItem DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement DEntrypointArg :: DocItemPlacementKind # type DocItemReferenced DEntrypointArg :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointArg -> DocItemRef (DocItemPlacement DEntrypointArg) (DocItemReferenced DEntrypointArg) # docItemToMarkdown :: HeaderLevel -> DEntrypointArg -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointArg -> Markdown # docItemDependencies :: DEntrypointArg -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointArg] -> [DEntrypointArg] #
DocItem DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement DEntrypointReference :: DocItemPlacementKind # type DocItemReferenced DEntrypointReference :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointReference -> DocItemRef (DocItemPlacement DEntrypointReference) (DocItemReferenced DEntrypointReference) # docItemToMarkdown :: HeaderLevel -> DEntrypointReference -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointReference -> Markdown # docItemDependencies :: DEntrypointReference -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointReference] -> [DEntrypointReference] #
DocItem DError Source #
Instance details Defined in Lorentz.Errors Associated Types type DocItemPlacement DError :: DocItemPlacementKind # type DocItemReferenced DError :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DError -> DocItemRef (DocItemPlacement DError) (DocItemReferenced DError) # docItemToMarkdown :: HeaderLevel -> DError -> Markdown # docItemToToc :: HeaderLevel -> DError -> Markdown # docItemDependencies :: DError -> [SomeDocDefinitionItem] # docItemsOrder :: [DError] -> [DError] #
DocItem DThrows Source #
Instance details Defined in Lorentz.Errors Associated Types type DocItemPlacement DThrows :: DocItemPlacementKind # type DocItemReferenced DThrows :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DThrows -> DocItemRef (DocItemPlacement DThrows) (DocItemReferenced DThrows) # docItemToMarkdown :: HeaderLevel -> DThrows -> Markdown # docItemToToc :: HeaderLevel -> DThrows -> Markdown # docItemDependencies :: DThrows -> [SomeDocDefinitionItem] # docItemsOrder :: [DThrows] -> [DThrows] #
DocItem DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Associated Types type DocItemPlacement DDescribeErrorTagMap :: DocItemPlacementKind # type DocItemReferenced DDescribeErrorTagMap :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DDescribeErrorTagMap -> DocItemRef (DocItemPlacement DDescribeErrorTagMap) (DocItemReferenced DDescribeErrorTagMap) # docItemToMarkdown :: HeaderLevel -> DDescribeErrorTagMap -> Markdown # docItemToToc :: HeaderLevel -> DDescribeErrorTagMap -> Markdown # docItemDependencies :: DDescribeErrorTagMap -> [SomeDocDefinitionItem] # docItemsOrder :: [DDescribeErrorTagMap] -> [DDescribeErrorTagMap] #
DocItem DAnchor
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DAnchor :: DocItemPlacementKind # type DocItemReferenced DAnchor :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DAnchor -> DocItemRef (DocItemPlacement DAnchor) (DocItemReferenced DAnchor) # docItemToMarkdown :: HeaderLevel -> DAnchor -> Markdown # docItemToToc :: HeaderLevel -> DAnchor -> Markdown # docItemDependencies :: DAnchor -> [SomeDocDefinitionItem] # docItemsOrder :: [DAnchor] -> [DAnchor] #
DocItem DComment
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DComment :: DocItemPlacementKind # type DocItemReferenced DComment :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DComment -> DocItemRef (DocItemPlacement DComment) (DocItemReferenced DComment) # docItemToMarkdown :: HeaderLevel -> DComment -> Markdown # docItemToToc :: HeaderLevel -> DComment -> Markdown # docItemDependencies :: DComment -> [SomeDocDefinitionItem] # docItemsOrder :: [DComment] -> [DComment] #
DocItem DConversionInfo
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DConversionInfo :: DocItemPlacementKind # type DocItemReferenced DConversionInfo :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DConversionInfo -> DocItemRef (DocItemPlacement DConversionInfo) (DocItemReferenced DConversionInfo) # docItemToMarkdown :: HeaderLevel -> DConversionInfo -> Markdown # docItemToToc :: HeaderLevel -> DConversionInfo -> Markdown # docItemDependencies :: DConversionInfo -> [SomeDocDefinitionItem] # docItemsOrder :: [DConversionInfo] -> [DConversionInfo] #
DocItem DDescription
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DDescription :: DocItemPlacementKind # type DocItemReferenced DDescription :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DDescription -> DocItemRef (DocItemPlacement DDescription) (DocItemReferenced DDescription) # docItemToMarkdown :: HeaderLevel -> DDescription -> Markdown # docItemToToc :: HeaderLevel -> DDescription -> Markdown # docItemDependencies :: DDescription -> [SomeDocDefinitionItem] # docItemsOrder :: [DDescription] -> [DDescription] #
DocItem DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DGeneralInfoSection :: DocItemPlacementKind # type DocItemReferenced DGeneralInfoSection :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DGeneralInfoSection -> DocItemRef (DocItemPlacement DGeneralInfoSection) (DocItemReferenced DGeneralInfoSection) # docItemToMarkdown :: HeaderLevel -> DGeneralInfoSection -> Markdown # docItemToToc :: HeaderLevel -> DGeneralInfoSection -> Markdown # docItemDependencies :: DGeneralInfoSection -> [SomeDocDefinitionItem] # docItemsOrder :: [DGeneralInfoSection] -> [DGeneralInfoSection] #
DocItem DGitRevision
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DGitRevision :: DocItemPlacementKind # type DocItemReferenced DGitRevision :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DGitRevision -> DocItemRef (DocItemPlacement DGitRevision) (DocItemReferenced DGitRevision) # docItemToMarkdown :: HeaderLevel -> DGitRevision -> Markdown # docItemToToc :: HeaderLevel -> DGitRevision -> Markdown # docItemDependencies :: DGitRevision -> [SomeDocDefinitionItem] # docItemsOrder :: [DGitRevision] -> [DGitRevision] #
DocItem DName
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DName :: DocItemPlacementKind # type DocItemReferenced DName :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DName -> DocItemRef (DocItemPlacement DName) (DocItemReferenced DName) # docItemToMarkdown :: HeaderLevel -> DName -> Markdown # docItemToToc :: HeaderLevel -> DName -> Markdown # docItemDependencies :: DName -> [SomeDocDefinitionItem] # docItemsOrder :: [DName] -> [DName] #
DocItem DToc
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DToc :: DocItemPlacementKind # type DocItemReferenced DToc :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DToc -> DocItemRef (DocItemPlacement DToc) (DocItemReferenced DToc) # docItemToMarkdown :: HeaderLevel -> DToc -> Markdown # docItemToToc :: HeaderLevel -> DToc -> Markdown # docItemDependencies :: DToc -> [SomeDocDefinitionItem] # docItemsOrder :: [DToc] -> [DToc] #
DocItem DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type DocItemPlacement DStorageType :: DocItemPlacementKind # type DocItemReferenced DStorageType :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DStorageType -> DocItemRef (DocItemPlacement DStorageType) (DocItemReferenced DStorageType) # docItemToMarkdown :: HeaderLevel -> DStorageType -> Markdown # docItemToToc :: HeaderLevel -> DStorageType -> Markdown # docItemDependencies :: DStorageType -> [SomeDocDefinitionItem] # docItemsOrder :: [DStorageType] -> [DStorageType] #
DocItem DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type DocItemPlacement DType :: DocItemPlacementKind # type DocItemReferenced DType :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DType -> DocItemRef (DocItemPlacement DType) (DocItemReferenced DType) # docItemToMarkdown :: HeaderLevel -> DType -> Markdown # docItemToToc :: HeaderLevel -> DType -> Markdown # docItemDependencies :: DType -> [SomeDocDefinitionItem] # docItemsOrder :: [DType] -> [DType] #
EntrypointKindHasDoc ep => DocItem (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement (DEntrypoint ep) :: DocItemPlacementKind # type DocItemReferenced (DEntrypoint ep) :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypoint ep -> DocItemRef (DocItemPlacement (DEntrypoint ep)) (DocItemReferenced (DEntrypoint ep)) # docItemToMarkdown :: HeaderLevel -> DEntrypoint ep -> Markdown # docItemToToc :: HeaderLevel -> DEntrypoint ep -> Markdown # docItemDependencies :: DEntrypoint ep -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypoint ep] -> [DEntrypoint ep] #

newtype DocItemId #

Constructors

DocItemId Text

Instances

Instances details

Show DocItemId
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemId -> ShowS # show :: DocItemId -> String # showList :: [DocItemId] -> ShowS #
Eq DocItemId
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemId -> DocItemId -> Bool # (/=) :: DocItemId -> DocItemId -> Bool #
Ord DocItemId
Instance details Defined in Morley.Michelson.Doc Methods compare :: DocItemId -> DocItemId -> Ordering # (<) :: DocItemId -> DocItemId -> Bool # (<=) :: DocItemId -> DocItemId -> Bool # (>) :: DocItemId -> DocItemId -> Bool # (>=) :: DocItemId -> DocItemId -> Bool # max :: DocItemId -> DocItemId -> DocItemId # min :: DocItemId -> DocItemId -> DocItemId #
ToAnchor DocItemId
Instance details Defined in Morley.Michelson.Doc Methods toAnchor :: DocItemId -> Anchor

data DocItemPlacementKind #

Constructors

DocItemInlined
DocItemInDefinitions

newtype DocItemPos #

Constructors

DocItemPos (Natural, Text)

Instances

Instances details

Show DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemPos -> ShowS # show :: DocItemPos -> String # showList :: [DocItemPos] -> ShowS #
Eq DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemPos -> DocItemPos -> Bool # (/=) :: DocItemPos -> DocItemPos -> Bool #
Ord DocItemPos
Instance details 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 #
Buildable DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods build :: DocItemPos -> Doc buildList :: [DocItemPos] -> Doc

data DocItemRef (p :: DocItemPlacementKind) (r :: DocItemReferencedKind) where #

Constructors

DocItemRef :: DocItemId -> DocItemRef 'DocItemInDefinitions 'True
DocItemRefInlined :: DocItemId -> DocItemRef 'DocItemInlined 'True
DocItemNoRef :: DocItemRef 'DocItemInlined 'False

Instances

Instances details

ToAnchor (DocItemRef d 'True)
Instance details Defined in Morley.Michelson.Doc Methods toAnchor :: DocItemRef d 'True -> Anchor

data DocSection #

Constructors

DocItem d => DocSection (NonEmpty $ DocElem d)

data DocSectionNameStyle #

Constructors

DocSectionNameBig
DocSectionNameSmall

data SomeDocItem where #

Constructors

SomeDocItem :: forall d. DocItem d => d -> SomeDocItem

Instances

Instances details

Show DocGrouping
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocGrouping -> ShowS # show :: DocGrouping -> String # showList :: [DocGrouping] -> ShowS #
Show SomeDocItem
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> SomeDocItem -> ShowS # show :: SomeDocItem -> String # showList :: [SomeDocItem] -> ShowS #
NFData SomeDocItem
Instance details Defined in Morley.Michelson.Doc Methods rnf :: SomeDocItem -> () #

data SomeDocDefinitionItem where #

Constructors

SomeDocDefinitionItem :: forall d. (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => d -> SomeDocDefinitionItem

Instances

Instances details

Eq SomeDocDefinitionItem
Instance details Defined in Morley.Michelson.Doc Methods (==) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (/=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool #
Ord SomeDocDefinitionItem
Instance details 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 #

newtype SubDoc #

Constructors

SubDoc DocBlock

Instances

Instances details

Show DocGrouping
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocGrouping -> ShowS # show :: DocGrouping -> String # showList :: [DocGrouping] -> ShowS #
di ~ DName => IsString (SubDoc -> di)
Instance details Defined in Morley.Michelson.Doc Methods fromString :: String -> SubDoc -> di #

type DocGrouping = SubDoc -> SomeDocItem #

data ContractDoc #

Constructors

ContractDoc
Fields cdContents :: DocBlock cdDefinitions :: DocBlock cdDefinitionsSet :: Set SomeDocDefinitionItem cdDefinitionIds :: Set DocItemId

Instances

Instances details

Monoid ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods mempty :: ContractDoc # mappend :: ContractDoc -> ContractDoc -> ContractDoc # mconcat :: [ContractDoc] -> ContractDoc #
Semigroup ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods (<>) :: ContractDoc -> ContractDoc -> ContractDoc # sconcat :: NonEmpty ContractDoc -> ContractDoc # stimes :: Integral b => b -> ContractDoc -> ContractDoc #

newtype DGeneralInfoSection #

Constructors

DGeneralInfoSection SubDoc

Instances

Instances details

DocItem DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DGeneralInfoSection :: DocItemPlacementKind # type DocItemReferenced DGeneralInfoSection :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DGeneralInfoSection -> DocItemRef (DocItemPlacement DGeneralInfoSection) (DocItemReferenced DGeneralInfoSection) # docItemToMarkdown :: HeaderLevel -> DGeneralInfoSection -> Markdown # docItemToToc :: HeaderLevel -> DGeneralInfoSection -> Markdown # docItemDependencies :: DGeneralInfoSection -> [SomeDocDefinitionItem] # docItemsOrder :: [DGeneralInfoSection] -> [DGeneralInfoSection] #
type DocItemPlacement DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DGeneralInfoSection = 'DocItemInlined
type DocItemReferenced DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DGeneralInfoSection = 'False

data DName #

Constructors

DName Text SubDoc

Instances

Instances details

DocItem DName
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DName :: DocItemPlacementKind # type DocItemReferenced DName :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DName -> DocItemRef (DocItemPlacement DName) (DocItemReferenced DName) # docItemToMarkdown :: HeaderLevel -> DName -> Markdown # docItemToToc :: HeaderLevel -> DName -> Markdown # docItemDependencies :: DName -> [SomeDocDefinitionItem] # docItemsOrder :: [DName] -> [DName] #
type DocItemPlacement DName
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DName = 'DocItemInlined
type DocItemReferenced DName
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DName = 'False

data DDescription #

Constructors

DDescription Markdown

Instances

Instances details

DocItem DDescription
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DDescription :: DocItemPlacementKind # type DocItemReferenced DDescription :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DDescription -> DocItemRef (DocItemPlacement DDescription) (DocItemReferenced DDescription) # docItemToMarkdown :: HeaderLevel -> DDescription -> Markdown # docItemToToc :: HeaderLevel -> DDescription -> Markdown # docItemDependencies :: DDescription -> [SomeDocDefinitionItem] # docItemsOrder :: [DDescription] -> [DDescription] #
type DocItemPlacement DDescription
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DDescription = 'DocItemInlined
type DocItemReferenced DDescription
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DDescription = 'False

data DEntrypointExample Source #

Modify the example value of an entrypoint

Constructors

forall t.ParameterScope t => DEntrypointExample (Value t)

Instances

Instances details

DocItem DEntrypointExample Source #
Instance details Defined in Lorentz.Doc Associated Types type DocItemPlacement DEntrypointExample :: DocItemPlacementKind # type DocItemReferenced DEntrypointExample :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointExample -> DocItemRef (DocItemPlacement DEntrypointExample) (DocItemReferenced DEntrypointExample) # docItemToMarkdown :: HeaderLevel -> DEntrypointExample -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointExample -> Markdown # docItemDependencies :: DEntrypointExample -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointExample] -> [DEntrypointExample] #
type DocItemPlacement DEntrypointExample Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DEntrypointExample = 'DocItemInlined
type DocItemReferenced DEntrypointExample Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DEntrypointExample = 'False

data DGitRevision #

Constructors

DGitRevisionKnown DGitRevisionInfo
DGitRevisionUnknown

Instances

Instances details

DocItem DGitRevision
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DGitRevision :: DocItemPlacementKind # type DocItemReferenced DGitRevision :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DGitRevision -> DocItemRef (DocItemPlacement DGitRevision) (DocItemReferenced DGitRevision) # docItemToMarkdown :: HeaderLevel -> DGitRevision -> Markdown # docItemToToc :: HeaderLevel -> DGitRevision -> Markdown # docItemDependencies :: DGitRevision -> [SomeDocDefinitionItem] # docItemsOrder :: [DGitRevision] -> [DGitRevision] #
type DocItemPlacement DGitRevision
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DGitRevision = 'DocItemInlined
type DocItemReferenced DGitRevision
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DGitRevision = 'False

newtype GitRepoSettings #

Constructors

GitRepoSettings
Fields grsMkGitRevision :: Text -> Text

data DComment #

Constructors

DComment Text

Instances

Instances details

DocItem DComment
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DComment :: DocItemPlacementKind # type DocItemReferenced DComment :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DComment -> DocItemRef (DocItemPlacement DComment) (DocItemReferenced DComment) # docItemToMarkdown :: HeaderLevel -> DComment -> Markdown # docItemToToc :: HeaderLevel -> DComment -> Markdown # docItemDependencies :: DComment -> [SomeDocDefinitionItem] # docItemsOrder :: [DComment] -> [DComment] #
type DocItemPlacement DComment
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DComment = 'DocItemInlined
type DocItemReferenced DComment
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DComment = 'False

data DAnchor #

Constructors

DAnchor Anchor

Instances

Instances details

DocItem DAnchor
Instance details Defined in Morley.Michelson.Doc Associated Types type DocItemPlacement DAnchor :: DocItemPlacementKind # type DocItemReferenced DAnchor :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DAnchor -> DocItemRef (DocItemPlacement DAnchor) (DocItemReferenced DAnchor) # docItemToMarkdown :: HeaderLevel -> DAnchor -> Markdown # docItemToToc :: HeaderLevel -> DAnchor -> Markdown # docItemDependencies :: DAnchor -> [SomeDocDefinitionItem] # docItemsOrder :: [DAnchor] -> [DAnchor] #
type DocItemPlacement DAnchor
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DAnchor = 'DocItemInlined
type DocItemReferenced DAnchor
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DAnchor = 'False

class ContainsDoc a where #

Methods

buildDocUnfinalized :: a -> ContractDoc #

Instances

Instances details

ContainsDoc (i :-> o) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: (i :-> o) -> ContractDoc #
ContainsDoc (ContractCode i o) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: ContractCode i o -> ContractDoc #
ContainsDoc (Contract cp st vd) Source #
Instance details Defined in Lorentz.Doc Methods buildDocUnfinalized :: Contract cp st vd -> ContractDoc #
ContainsDoc (ContractData cp st vd) Source #
Instance details Defined in Lorentz.Run Methods buildDocUnfinalized :: ContractData cp st vd -> ContractDoc #

class ContainsDoc a => ContainsUpdateableDoc a where #

Methods

modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> a -> a #

Instances

Instances details

ContainsUpdateableDoc (i :-> o) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> (i :-> o) -> i :-> o #
ContainsUpdateableDoc (ContractCode i o) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> ContractCode i o -> ContractCode i o #
ContainsUpdateableDoc (Contract cp st vd) Source #
Instance details Defined in Lorentz.Doc Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> Contract cp st vd -> Contract cp st vd #
ContainsUpdateableDoc (ContractData cp st vd) Source #
Instance details Defined in Lorentz.Run Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> ContractData cp st vd -> ContractData cp st vd #

data WithFinalizedDoc a #

Instances

Instances details

Applicative WithFinalizedDoc
Instance details Defined in Morley.Michelson.Doc Methods pure :: a -> WithFinalizedDoc a # (<>) :: WithFinalizedDoc (a -> b) -> WithFinalizedDoc a -> WithFinalizedDoc b # liftA2 :: (a -> b -> c) -> WithFinalizedDoc a -> WithFinalizedDoc b -> WithFinalizedDoc c # (>) :: WithFinalizedDoc a -> WithFinalizedDoc b -> WithFinalizedDoc b # (<*) :: WithFinalizedDoc a -> WithFinalizedDoc b -> WithFinalizedDoc a #
Functor WithFinalizedDoc
Instance details Defined in Morley.Michelson.Doc Methods fmap :: (a -> b) -> WithFinalizedDoc a -> WithFinalizedDoc b # (<$) :: a -> WithFinalizedDoc b -> WithFinalizedDoc a #
Monad WithFinalizedDoc
Instance details Defined in Morley.Michelson.Doc Methods (>>=) :: WithFinalizedDoc a -> (a -> WithFinalizedDoc b) -> WithFinalizedDoc b # (>>) :: WithFinalizedDoc a -> WithFinalizedDoc b -> WithFinalizedDoc b # return :: a -> WithFinalizedDoc a #

class (Typeable a, SingI (TypeDocFieldDescriptions a), FieldDescriptionsValid (TypeDocFieldDescriptions a) a) => TypeHasDoc a where #

Minimal complete definition

typeDocMdDescription

Associated Types

type TypeDocFieldDescriptions a :: FieldDescriptions #

type TypeDocFieldDescriptions a = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

Methods

typeDocName :: Proxy a -> Text #

typeDocMdDescription :: Markdown #

typeDocMdReference :: Proxy a -> WithinParens -> Markdown #

typeDocDependencies :: Proxy a -> [SomeDocDefinitionItem] #

typeDocHaskellRep :: TypeDocHaskellRep a #

typeDocMichelsonRep :: TypeDocMichelsonRep a #

Instances

Instances details

TypeHasDoc ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ByteString :: FieldDescriptions # Methods typeDocName :: Proxy ByteString -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ByteString -> WithinParens -> Markdown # typeDocDependencies :: Proxy ByteString -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ByteString # typeDocMichelsonRep :: TypeDocMichelsonRep ByteString #
TypeHasDoc Never Source #
Instance details Defined in Lorentz.Value Associated Types type TypeDocFieldDescriptions Never :: FieldDescriptions # Methods typeDocName :: Proxy Never -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Never -> WithinParens -> Markdown # typeDocDependencies :: Proxy Never -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Never # typeDocMichelsonRep :: TypeDocMichelsonRep Never #
TypeHasDoc OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type TypeDocFieldDescriptions OpenChest :: FieldDescriptions # Methods typeDocName :: Proxy OpenChest -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy OpenChest -> WithinParens -> Markdown # typeDocDependencies :: Proxy OpenChest -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep OpenChest # typeDocMichelsonRep :: TypeDocMichelsonRep OpenChest #
TypeHasDoc MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions MText :: FieldDescriptions # Methods typeDocName :: Proxy MText -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy MText -> WithinParens -> Markdown # typeDocDependencies :: Proxy MText -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep MText # typeDocMichelsonRep :: TypeDocMichelsonRep MText #
TypeHasDoc Operation
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Operation :: FieldDescriptions # Methods typeDocName :: Proxy Operation -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Operation -> WithinParens -> Markdown # typeDocDependencies :: Proxy Operation -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Operation # typeDocMichelsonRep :: TypeDocMichelsonRep Operation #
TypeHasDoc EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions EpAddress :: FieldDescriptions # Methods typeDocName :: Proxy EpAddress -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy EpAddress -> WithinParens -> Markdown # typeDocDependencies :: Proxy EpAddress -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep EpAddress # typeDocMichelsonRep :: TypeDocMichelsonRep EpAddress #
TypeHasDoc Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Address :: FieldDescriptions # Methods typeDocName :: Proxy Address -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Address -> WithinParens -> Markdown # typeDocDependencies :: Proxy Address -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Address # typeDocMichelsonRep :: TypeDocMichelsonRep Address #
TypeHasDoc ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ChainId :: FieldDescriptions # Methods typeDocName :: Proxy ChainId -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ChainId -> WithinParens -> Markdown # typeDocDependencies :: Proxy ChainId -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ChainId # typeDocMichelsonRep :: TypeDocMichelsonRep ChainId #
TypeHasDoc Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Mutez :: FieldDescriptions # Methods typeDocName :: Proxy Mutez -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Mutez -> WithinParens -> Markdown # typeDocDependencies :: Proxy Mutez -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Mutez # typeDocMichelsonRep :: TypeDocMichelsonRep Mutez #
TypeHasDoc Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Timestamp :: FieldDescriptions # Methods typeDocName :: Proxy Timestamp -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Timestamp -> WithinParens -> Markdown # typeDocDependencies :: Proxy Timestamp -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Timestamp # typeDocMichelsonRep :: TypeDocMichelsonRep Timestamp #
TypeHasDoc KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions KeyHash :: FieldDescriptions # Methods typeDocName :: Proxy KeyHash -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy KeyHash -> WithinParens -> Markdown # typeDocDependencies :: Proxy KeyHash -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep KeyHash # typeDocMichelsonRep :: TypeDocMichelsonRep KeyHash #
TypeHasDoc PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions PublicKey :: FieldDescriptions # Methods typeDocName :: Proxy PublicKey -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy PublicKey -> WithinParens -> Markdown # typeDocDependencies :: Proxy PublicKey -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep PublicKey # typeDocMichelsonRep :: TypeDocMichelsonRep PublicKey #
TypeHasDoc Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Signature :: FieldDescriptions # Methods typeDocName :: Proxy Signature -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Signature -> WithinParens -> Markdown # typeDocDependencies :: Proxy Signature -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Signature # typeDocMichelsonRep :: TypeDocMichelsonRep Signature #
TypeHasDoc Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Chest :: FieldDescriptions # Methods typeDocName :: Proxy Chest -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Chest -> WithinParens -> Markdown # typeDocDependencies :: Proxy Chest -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Chest # typeDocMichelsonRep :: TypeDocMichelsonRep Chest #
TypeHasDoc ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ChestKey :: FieldDescriptions # Methods typeDocName :: Proxy ChestKey -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ChestKey -> WithinParens -> Markdown # typeDocDependencies :: Proxy ChestKey -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ChestKey # typeDocMichelsonRep :: TypeDocMichelsonRep ChestKey #
TypeHasDoc Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Integer :: FieldDescriptions # Methods typeDocName :: Proxy Integer -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Integer -> WithinParens -> Markdown # typeDocDependencies :: Proxy Integer -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Integer # typeDocMichelsonRep :: TypeDocMichelsonRep Integer #
TypeHasDoc Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Natural :: FieldDescriptions # Methods typeDocName :: Proxy Natural -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Natural -> WithinParens -> Markdown # typeDocDependencies :: Proxy Natural -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Natural # typeDocMichelsonRep :: TypeDocMichelsonRep Natural #
TypeHasDoc ()
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions () :: FieldDescriptions # Methods typeDocName :: Proxy () -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy () -> WithinParens -> Markdown # typeDocDependencies :: Proxy () -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep () # typeDocMichelsonRep :: TypeDocMichelsonRep () #
TypeHasDoc Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Bool :: FieldDescriptions # Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Bool # typeDocMichelsonRep :: TypeDocMichelsonRep Bool #
PolyCTypeHasDocC '[a] => TypeHasDoc (Set a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Set a) :: FieldDescriptions # Methods typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Set a) #
TypeHasDoc p => TypeHasDoc (FutureContract p) Source #
Instance details Defined in Lorentz.Doc Associated Types type TypeDocFieldDescriptions (FutureContract p) :: FieldDescriptions # Methods typeDocName :: Proxy (FutureContract p) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (FutureContract p) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (FutureContract p) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (FutureContract p) # typeDocMichelsonRep :: TypeDocMichelsonRep (FutureContract p) #
TypeHasDoc a => TypeHasDoc (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (ChestT a) :: FieldDescriptions # Methods typeDocName :: Proxy (ChestT a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ChestT a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ChestT a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (ChestT a) # typeDocMichelsonRep :: TypeDocMichelsonRep (ChestT a) #
TypeHasDoc a => TypeHasDoc (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (OpenChestT a) :: FieldDescriptions # Methods typeDocName :: Proxy (OpenChestT a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (OpenChestT a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (OpenChestT a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (OpenChestT a) # typeDocMichelsonRep :: TypeDocMichelsonRep (OpenChestT a) #
TypeHasDoc a => TypeHasDoc (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (Packed a) :: FieldDescriptions # Methods typeDocName :: Proxy (Packed a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Packed a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Packed a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Packed a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Packed a) #
TypeHasDoc a => TypeHasDoc (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (TSignature a) :: FieldDescriptions # Methods typeDocName :: Proxy (TSignature a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (TSignature a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (TSignature a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (TSignature a) # typeDocMichelsonRep :: TypeDocMichelsonRep (TSignature a) #
(TypeHasDoc r, IsError (VoidResult r)) => TypeHasDoc (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (VoidResult r) :: FieldDescriptions # Methods typeDocName :: Proxy (VoidResult r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (VoidResult r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (VoidResult r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (VoidResult r) # typeDocMichelsonRep :: TypeDocMichelsonRep (VoidResult r) #
TypeHasDoc a => TypeHasDoc (Range a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (Range a) :: FieldDescriptions # Methods typeDocName :: Proxy (Range a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Range a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Range a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Range a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Range a) #
TypeHasDoc a => TypeHasDoc (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeEE a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeEE a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeEE a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeEE a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeEE a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeEE a) #
TypeHasDoc a => TypeHasDoc (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeEI a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeEI a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeEI a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeEI a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeEI a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeEI a) #
TypeHasDoc a => TypeHasDoc (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeFailureInfo a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeFailureInfo a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeFailureInfo a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeFailureInfo a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeFailureInfo a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeFailureInfo a) #
TypeHasDoc a => TypeHasDoc (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeIE a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeIE a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeIE a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeIE a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeIE a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeIE a) #
Typeable interface => TypeHasDoc (UParam interface) Source #
Instance details Defined in Lorentz.UParam Associated Types type TypeDocFieldDescriptions (UParam interface) :: FieldDescriptions # Methods typeDocName :: Proxy (UParam interface) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (UParam interface) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (UParam interface) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (UParam interface) # typeDocMichelsonRep :: TypeDocMichelsonRep (UParam interface) #
PolyTypeHasDocC '[cp] => TypeHasDoc (ContractRef cp)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (ContractRef cp) :: FieldDescriptions # Methods typeDocName :: Proxy (ContractRef cp) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ContractRef cp) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ContractRef cp) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (ContractRef cp) # typeDocMichelsonRep :: TypeDocMichelsonRep (ContractRef cp) #
PolyTypeHasDocC '[a] => TypeHasDoc (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Ticket a) :: FieldDescriptions # Methods typeDocName :: Proxy (Ticket a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Ticket a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Ticket a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Ticket a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Ticket a) #
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a)
Instance details 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) #
PolyTypeHasDocC '[a] => TypeHasDoc [a]
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions [a] :: FieldDescriptions # Methods typeDocName :: Proxy [a] -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy [a] -> WithinParens -> Markdown # typeDocDependencies :: Proxy [a] -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep [a] # typeDocMichelsonRep :: TypeDocMichelsonRep [a] #
PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r)
Instance details 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) #
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Map k v) :: FieldDescriptions # Methods typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) #
(TypeHasDoc p, ViewsDescriptorHasDoc vd) => TypeHasDoc (TAddress p vd) Source #
Instance details Defined in Lorentz.Doc Associated Types type TypeDocFieldDescriptions (TAddress p vd) :: FieldDescriptions # Methods typeDocName :: Proxy (TAddress p vd) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (TAddress p vd) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (TAddress p vd) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (TAddress p vd) # typeDocMichelsonRep :: TypeDocMichelsonRep (TAddress p vd) #
(KnownHashAlgorithm alg, TypeHasDoc a) => TypeHasDoc (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type TypeDocFieldDescriptions (Hash alg a) :: FieldDescriptions # Methods typeDocName :: Proxy (Hash alg a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Hash alg a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Hash alg a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Hash alg a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Hash alg a) #
(ExtensibleHasDoc x, ReifyList DocumentCtor (EnumerateCtors (GetCtors x))) => TypeHasDoc (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type TypeDocFieldDescriptions (Extensible x) :: FieldDescriptions # Methods typeDocName :: Proxy (Extensible x) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Extensible x) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Extensible x) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Extensible x) # typeDocMichelsonRep :: TypeDocMichelsonRep (Extensible x) #
Each '[Typeable :: [Type] -> Constraint, ReifyList TypeHasDoc] '[i, o] => TypeHasDoc (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type TypeDocFieldDescriptions (WrappedLambda i o) :: FieldDescriptions # Methods typeDocName :: Proxy (WrappedLambda i o) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (WrappedLambda i o) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (WrappedLambda i o) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (WrappedLambda i o) # typeDocMichelsonRep :: TypeDocMichelsonRep (WrappedLambda i o) #
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (View_ a r) :: FieldDescriptions # Methods typeDocName :: Proxy (View_ a r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (View_ a r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (View_ a r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (View_ a r) # typeDocMichelsonRep :: TypeDocMichelsonRep (View_ a r) #
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (Void_ a r) :: FieldDescriptions # Methods typeDocName :: Proxy (Void_ a r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Void_ a r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Void_ a r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Void_ a r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Void_ a r) #
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (BigMap k v) :: FieldDescriptions # Methods typeDocName :: Proxy (BigMap k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (BigMap k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (BigMap k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (BigMap k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (BigMap k v) #
PolyTypeHasDocC '[a, b] => TypeHasDoc (a, b)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b) #
(Typeable k, Typeable action, TypeHasDoc td) => TypeHasDoc (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type TypeDocFieldDescriptions (STicket action td) :: FieldDescriptions # Methods typeDocName :: Proxy (STicket action td) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (STicket action td) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (STicket action td) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (STicket action td) # typeDocMichelsonRep :: TypeDocMichelsonRep (STicket action td) #
(TypeHasDoc (ApplyNamedFunctor f a), KnownSymbol n, KnownIsoT (ApplyNamedFunctor f Integer), Typeable f, Typeable a) => TypeHasDoc (NamedF f a n)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (NamedF f a n) :: FieldDescriptions # Methods typeDocName :: Proxy (NamedF f a n) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (NamedF f a n) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (NamedF f a n) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (NamedF f a n) # typeDocMichelsonRep :: TypeDocMichelsonRep (NamedF f a n) #
PolyTypeHasDocC '[a, b, c] => TypeHasDoc (a, b, c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b, c) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b, c) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b, c) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b, c) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b, c) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b, c) #
PolyTypeHasDocC '[a, b, c, d] => TypeHasDoc (a, b, c, d)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b, c, d) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b, c, d) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b, c, d) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b, c, d) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b, c, d) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b, c, d) #
PolyTypeHasDocC '[a, b, c, d, e] => TypeHasDoc (a, b, c, d, e)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b, c, d, e) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b, c, d, e) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b, c, d, e) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b, c, d, e) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b, c, d, e) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b, c, d, e) #
PolyTypeHasDocC '[a, b, c, d, e, f] => TypeHasDoc (a, b, c, d, e, f)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b, c, d, e, f) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b, c, d, e, f) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b, c, d, e, f) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b, c, d, e, f) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b, c, d, e, f) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b, c, d, e, f) #
PolyTypeHasDocC '[a, b, c, d, e, f, g] => TypeHasDoc (a, b, c, d, e, f, g)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (a, b, c, d, e, f, g) :: FieldDescriptions # Methods typeDocName :: Proxy (a, b, c, d, e, f, g) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (a, b, c, d, e, f, g) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (a, b, c, d, e, f, g) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (a, b, c, d, e, f, g) # typeDocMichelsonRep :: TypeDocMichelsonRep (a, b, c, d, e, f, g) #

data SomeTypeWithDoc where #

Constructors

SomeTypeWithDoc :: forall td. TypeHasDoc td => Proxy td -> SomeTypeWithDoc

type family HaveCommonTypeCtor (a :: k) (b :: k) where ... #

Equations

HaveCommonTypeCtor (ac _1 :: k2) (bc _2 :: k2) = HaveCommonTypeCtor ac bc
HaveCommonTypeCtor (a :: k) (a :: k) = ()

class IsHomomorphic (a :: k) #

Instances

Instances details

IsHomomorphic (a :: k)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc
(TypeError ('Text "Type is not homomorphic: " ':<>: 'ShowType (a b)) :: Constraint) => IsHomomorphic (a b :: k2)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc

class EntrypointsDerivation deriv cp where Source #

Defines a generalized way to declare entrypoints for various parameter types.

When defining instances of this typeclass, set concrete deriv argument and leave variable cp argument. Also keep in mind, that in presence of explicit default entrypoint, all other Or arms should be callable, though you can put this burden on user if very necessary.

Methods of this typeclass aim to better type-safety when making up an implementation and they may be not too convenient to use; users should exploit their counterparts.

Associated Types

type EpdAllEntrypoints deriv cp :: [(Symbol, Type)] Source #

Name and argument of each entrypoint. This may include intermediate ones, even root if necessary.

Touching this type family is costly (O(N^2)), don't use it often.

Note [order of entrypoints children]: If this contains entrypoints referring to indermediate nodes (not leaves) in or tree, then each such entrypoint should be mentioned eariler than all of its children.

type EpdLookupEntrypoint deriv cp :: Symbol -> Exp (Maybe Type) Source #

Get entrypoint argument by name.

Methods

epdNotes :: (Notes (ToT cp), RootAnn) Source #

Construct parameter annotations corresponding to expected entrypoints set.

This method is implementation detail, for actual notes construction use parameterEntrypointsToNotes.

epdCall :: ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint deriv cp name)) Source #

Construct entrypoint caller.

This does not treat calls to default entrypoint in a special way.

This method is implementation detail, for actual entrypoint lookup use parameterEntrypointCall.

epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints deriv cp) Source #

Description of how each of the entrypoints is constructed.

Instances

Instances details

HasAnnotation cp => EntrypointsDerivation EpdNone cp Source #
Instance details Defined in Lorentz.Entrypoints.Core Associated Types type EpdAllEntrypoints EpdNone cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdNone cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdNone cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdNone cp) Source #
PlainEntrypointsC EpdDelegate cp => EntrypointsDerivation EpdDelegate cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdDelegate cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdDelegate cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdDelegate cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdDelegate cp) Source #
PlainEntrypointsC EpdPlain cp => EntrypointsDerivation EpdPlain cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdPlain cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdPlain cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdPlain cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdPlain cp) Source #
PlainEntrypointsC EpdRecursive cp => EntrypointsDerivation EpdRecursive cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdRecursive cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdRecursive cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdRecursive cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdRecursive cp) Source #
(KnownSymbol r, PlainEntrypointsC deriv cp) => EntrypointsDerivation (EpdWithRoot r deriv :: Type) cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints (EpdWithRoot r deriv) cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint (EpdWithRoot r deriv) cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint (EpdWithRoot r deriv) cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints (EpdWithRoot r deriv) cp) Source #

class (EntrypointsDerivation (ParameterEntrypointsDerivation cp) cp, RequireAllUniqueEntrypoints cp) => ParameterHasEntrypoints cp Source #

Which entrypoints given parameter declares.

Note that usually this function should not be used as constraint, use ParameterDeclaresEntrypoints for this purpose.

Associated Types

type ParameterEntrypointsDerivation cp :: Type Source #

Instances

Instances details

(NiceParameter cp, EntrypointsDerivation epd cp, RequireAllUniqueEntrypoints' epd cp) => ParameterHasEntrypoints (ParameterWrapper epd cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ParameterEntrypointsDerivation (ParameterWrapper epd cp) Source #

type ParameterDeclaresEntrypoints cp = (If (CanHaveEntrypoints cp) (ParameterHasEntrypoints cp) (() :: Constraint), NiceParameter cp, EntrypointsDerivation (GetParameterEpDerivation cp) cp) Source #

Parameter declares some entrypoints.

This is a version of ParameterHasEntrypoints which we actually use in constraints. When given type is a sum type or newtype, we refer to ParameterHasEntrypoints instance, otherwise this instance is not necessary.

type family AllParameterEntrypoints (cp :: Type) :: [(Symbol, Type)] where ... Source #

Get all entrypoints declared for parameter.

Equations

AllParameterEntrypoints cp = EpdAllEntrypoints (GetParameterEpDerivation cp) cp

type family LookupParameterEntrypoint (cp :: Type) :: Symbol -> Exp (Maybe Type) where ... Source #

Lookup for entrypoint type by name.

Does not treat default entrypoints in a special way.

Equations

LookupParameterEntrypoint cp = EpdLookupEntrypoint (GetParameterEpDerivation cp) cp

type GetEntrypointArg cp name = Eval (LiftM2 FromMaybe (TError (('Text "Entrypoint not found: " ':<>: 'ShowType name) ':$$: (('Text "In contract parameter `" ':<>: 'ShowType cp) ':<>: 'Text "`"))) (LookupParameterEntrypoint cp name)) Source #

Get type of entrypoint with given name, fail if not found.

type GetDefaultEntrypointArg cp = Eval (LiftM2 FromMaybe (Pure cp) (LookupParameterEntrypoint cp DefaultEpName)) Source #

Get type of entrypoint with given name, fail if not found.

type ForbidExplicitDefaultEntrypoint cp = Eval (LiftM3 UnMaybe (Pure (Pure (() :: Constraint))) (TError ('Text "Parameter used here must have no explicit \"default\" entrypoint" ':$$: (('Text "In parameter type `" ':<>: 'ShowType cp) ':<>: 'Text "`"))) (LookupParameterEntrypoint cp DefaultEpName)) Source #

Ensure that there is no explicit "default" entrypoint.

type NoExplicitDefaultEntrypoint cp = Eval (LookupParameterEntrypoint cp DefaultEpName) ~ 'Nothing Source #

Similar to ForbidExplicitDefaultEntrypoint, but in a version which the compiler can work with (and which produces errors confusing for users :/)

data EntrypointRef (mname :: Maybe Symbol) where Source #

Which entrypoint to call.

We intentionally distinguish default and non-default cases because this makes API more details-agnostic.

Constructors

CallDefault :: EntrypointRef 'Nothing

Call the default entrypoint, or root if no explicit default is assigned.

Call :: NiceEntrypointName name => EntrypointRef ('Just name)

Call the given entrypoint; calling default is not treated specially. You have to provide entrypoint name via passing it as type argument.

Unfortunately, here we cannot accept a label because in most cases our entrypoints begin from capital letter (being derived from constructor name), while labels must start from a lower-case letter, and there is no way to make a conversion at type-level.

Instances

Instances details

(CheckStuckEp cp mname arg, ParameterDeclaresEntrypoints cp) => HasEntrypointArg (cp :: Type) (EntrypointRef mname) arg Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods useHasEntrypointArg :: EntrypointRef mname -> (Dict (ParameterScope (ToT arg)), EpName) Source #
(NiceEntrypointName (UppercaseFirstChar name), mname ~ 'Just (UppercaseFirstChar name)) => IsLabel name (EntrypointRef mname) Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods fromLabel :: EntrypointRef mname #
mname ~ ('Nothing :: Maybe Symbol) => Default (EntrypointRef mname) Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods def :: EntrypointRef mname #

type family GetEntrypointArgCustom cp mname :: Type where ... Source #

Universal entrypoint lookup.

Equations

GetEntrypointArgCustom cp 'Nothing = GetDefaultEntrypointArg cp
GetEntrypointArgCustom cp ('Just name) = GetEntrypointArg cp name

class HasEntrypointArg cp name arg where Source #

When we call a Lorentz contract we should pass entrypoint name and corresponding argument. Ideally we want to statically check that parameter has entrypoint with given name and argument. Constraint defined by this type class holds for contract with parameter cp that have entrypoint matching name with type arg.

In order to check this property statically, we need to know entrypoint name in compile time, EntrypointRef type serves this purpose. If entrypoint name is not known, one can use TrustEpName wrapper to take responsibility for presence of this entrypoint.

If you want to call a function which has this constraint, you have two options:

Pass contract parameter cp using type application, pass EntrypointRef as a value and pass entrypoint argument. Type system will check that cp has an entrypoint with given reference and type.
Pass EpName wrapped into TrustEpName and entrypoint argument. In this case passing contract parameter is not necessary, you do not even have to know it.

You may need to add this constraint for polymorphic arguments. GHC should tell you when that is the case:

>>> :{
f :: forall (cp :: Type). ParameterDeclaresEntrypoints cp => ()
f = useHasEntrypointArg @cp @_ @(Maybe Integer) CallDefault & const ()
:}
...
... Can not look up entrypoints in type
...   cp
... The most likely reason it is ambiguous, or you need
...   HasEntrypointArg cp (EntrypointRef 'Nothing) (Maybe Integer)
... constraint
...

If GHC can't deduce the type of entrypoint argument, it'll use an unbound type variable, usually arg0, in the error message:

>>> :{
f :: forall (cp :: Type). ParameterDeclaresEntrypoints cp => ()
f = useHasEntrypointArg @cp CallDefault & const ()
:}
...
... Can not look up entrypoints in type
...   cp
... The most likely reason it is ambiguous, or you need
...   HasEntrypointArg cp (EntrypointRef 'Nothing) arg0
... constraint
...

Methods

useHasEntrypointArg :: name -> (Dict (ParameterScope (ToT arg)), EpName) Source #

Data returned by this method may look somewhat arbitrary. EpName is obviously needed because name can be EntrypointRef or TrustEpName. Dict is returned because in EntrypointRef case we get this evidence for free and don't want to use it. We seem to always need it anyway.

Instances

Instances details

NiceParameter arg => HasEntrypointArg (cp :: k) TrustEpName arg Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods useHasEntrypointArg :: TrustEpName -> (Dict (ParameterScope (ToT arg)), EpName) Source #
(CheckStuckEp cp mname arg, ParameterDeclaresEntrypoints cp) => HasEntrypointArg (cp :: Type) (EntrypointRef mname) arg Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods useHasEntrypointArg :: EntrypointRef mname -> (Dict (ParameterScope (ToT arg)), EpName) Source #

type HasDefEntrypointArg cp defEpName defArg = (defEpName ~ EntrypointRef 'Nothing, HasEntrypointArg cp defEpName defArg) Source #

HasEntrypointArg constraint specialized to default entrypoint.

type HasEntrypointOfType param con exp = (GetEntrypointArgCustom param ('Just con) ~ exp, ParameterDeclaresEntrypoints param) Source #

Checks that the given parameter consists of some specific entrypoint. Similar as HasEntrypointArg but ensures that the argument matches the following datatype.

type family ParameterContainsEntrypoints param (fields :: [NamedEp]) :: Constraint where ... Source #

Check that the given entrypoint has some fields inside. This interface allows for an abstraction of contract parameter so that it requires some *minimal* specification, but not a concrete one.

Equations

ParameterContainsEntrypoints _ '[] = ()
ParameterContainsEntrypoints param ((n :> ty) ': rest) = (HasEntrypointOfType param n ty, ParameterContainsEntrypoints param rest)

newtype TrustEpName Source #

This wrapper allows to pass untyped EpName and bypass checking that entrypoint with given name and type exists.

Constructors

TrustEpName EpName

Instances

Instances details

NiceParameter arg => HasEntrypointArg (cp :: k) TrustEpName arg Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods useHasEntrypointArg :: TrustEpName -> (Dict (ParameterScope (ToT arg)), EpName) Source #

type RequireAllUniqueEntrypoints cp = RequireAllUniqueEntrypoints' (ParameterEntrypointsDerivation cp) cp Source #

Ensure that all declared entrypoints are unique.

data EpdNone Source #

No entrypoints declared, parameter type will serve as argument type of the only existing entrypoint (default one).

Instances

Instances details

HasAnnotation cp => EntrypointsDerivation EpdNone cp Source #
Instance details Defined in Lorentz.Entrypoints.Core Associated Types type EpdAllEntrypoints EpdNone cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdNone cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdNone cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdNone cp) Source #
type EpdAllEntrypoints EpdNone cp Source #
Instance details Defined in Lorentz.Entrypoints.Core type EpdAllEntrypoints EpdNone cp = '[] :: [(Symbol, Type)]
type EpdLookupEntrypoint EpdNone cp Source #
Instance details Defined in Lorentz.Entrypoints.Core type EpdLookupEntrypoint EpdNone cp = ConstFn ('Nothing :: Maybe Type) :: Symbol -> Maybe Type -> Type

data EpdPlain Source #

Implementation of ParameterHasEntrypoints which fits for case when your contract exposes multiple entrypoints via having sum type as its parameter.

In particular, each constructor would produce a homonymous entrypoint with argument type equal to type of constructor field (each constructor should have only one field). Constructor called Default will designate the default entrypoint.

Instances

Instances details

PlainEntrypointsC EpdPlain cp => EntrypointsDerivation EpdPlain cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdPlain cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdPlain cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdPlain cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdPlain cp) Source #
type EpdAllEntrypoints EpdPlain cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdPlain cp
type EpdLookupEntrypoint EpdPlain cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdPlain cp

data EpdRecursive Source #

Extension of EpdPlain on parameters being defined as several nested datatypes.

In particular, this will traverse sum types recursively, stopping at Michelson primitives (like Natural) and constructors with number of fields different from one.

It does not assign names to intermediate nodes of Or tree, only to the very leaves.

If some entrypoint arguments have custom IsoValue instance, this derivation way will not work. As a workaround, you can wrap your argument into some primitive (e.g. :!).

Instances

Instances details

PlainEntrypointsC EpdRecursive cp => EntrypointsDerivation EpdRecursive cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdRecursive cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdRecursive cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdRecursive cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdRecursive cp) Source #
type EpdAllEntrypoints EpdRecursive cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdRecursive cp
type EpdLookupEntrypoint EpdRecursive cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdRecursive cp

data EpdDelegate Source #

Extension of EpdPlain on parameters being defined as several nested datatypes.

In particular, it will traverse the immediate sum type, and require another ParameterHasEntrypoints for the inner complex datatypes. Only those inner types are considered which are the only fields in their respective constructors. Inner types should not themselves declare default entrypoint, we enforce this for better modularity. Each top-level constructor will be treated as entrypoint even if it contains a complex datatype within, in such case that would be an entrypoint corresponding to intermediate node in or tree.

Comparing to EpdRecursive this gives you more control over where and how entrypoints will be derived.

Instances

Instances details

PlainEntrypointsC EpdDelegate cp => EntrypointsDerivation EpdDelegate cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdDelegate cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint EpdDelegate cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdDelegate cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdDelegate cp) Source #
type EpdAllEntrypoints EpdDelegate cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdDelegate cp
type EpdLookupEntrypoint EpdDelegate cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdDelegate cp

data EpdWithRoot (r :: Symbol) epd Source #

Extension of EpdPlain, EpdRecursive, and EpdDelegate which allow specifying root annotation for the parameters.

Instances

Instances details

(KnownSymbol r, PlainEntrypointsC deriv cp) => EntrypointsDerivation (EpdWithRoot r deriv :: Type) cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints (EpdWithRoot r deriv) cp :: [(Symbol, Type)] Source # type EpdLookupEntrypoint (EpdWithRoot r deriv) cp :: Symbol -> Exp (Maybe Type) Source # Methods epdNotes :: (Notes (ToT cp), RootAnn) Source # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint (EpdWithRoot r deriv) cp name)) Source # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints (EpdWithRoot r deriv) cp) Source #
type EpdAllEntrypoints (EpdWithRoot r deriv :: Type) cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints (EpdWithRoot r deriv :: Type) cp
type EpdLookupEntrypoint (EpdWithRoot r deriv :: Type) cp Source #
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint (EpdWithRoot r deriv :: Type) cp

newtype ParameterWrapper (deriv :: Type) cp Source #

Wrap parameter into this to locally assign a way to derive entrypoints for it.

Constructors

ParameterWrapper
Fields unParameterWraper :: cp

Instances

Instances details

Generic (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Rep (ParameterWrapper deriv cp) :: Type -> Type # Methods from :: ParameterWrapper deriv cp -> Rep (ParameterWrapper deriv cp) x # to :: Rep (ParameterWrapper deriv cp) x -> ParameterWrapper deriv cp #
(NiceParameter cp, EntrypointsDerivation epd cp, RequireAllUniqueEntrypoints' epd cp) => ParameterHasEntrypoints (ParameterWrapper epd cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ParameterEntrypointsDerivation (ParameterWrapper epd cp) Source #
Unwrappable (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Unwrappabled (ParameterWrapper deriv cp) Source #
Wrappable (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual
HasRPCRepr cp => HasRPCRepr (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type AsRPC (ParameterWrapper deriv cp)
IsoValue cp => IsoValue (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ToT (ParameterWrapper deriv cp) :: T # Methods toVal :: ParameterWrapper deriv cp -> Value (ToT (ParameterWrapper deriv cp)) # fromVal :: Value (ToT (ParameterWrapper deriv cp)) -> ParameterWrapper deriv cp #
type Rep (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type Rep (ParameterWrapper deriv cp) = D1 ('MetaData "ParameterWrapper" "Lorentz.Entrypoints.Manual" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "ParameterWrapper" 'PrefixI 'True) (S1 ('MetaSel ('Just "unParameterWraper") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 cp)))
type ParameterEntrypointsDerivation (ParameterWrapper epd cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type ParameterEntrypointsDerivation (ParameterWrapper epd cp)
type Unwrappabled (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type Unwrappabled (ParameterWrapper deriv cp)
type AsRPC (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type AsRPC (ParameterWrapper deriv cp) = ParameterWrapper deriv (AsRPC cp)
type ToT (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual type ToT (ParameterWrapper deriv cp) = GValueType (GRep (ParameterWrapper deriv cp))

newtype ShouldHaveEntrypoints a Source #

A special type which wraps over a primitive type and states that it has entrypoints (one).

Assuming that any type can have entrypoints makes use of Lorentz entrypoints too annoying, so for declaring entrypoints for not sum types we require an explicit wrapper.

Constructors

ShouldHaveEntrypoints
Fields unHasEntrypoints :: a

Instances

Instances details

Generic (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type Rep (ShouldHaveEntrypoints a) :: Type -> Type # Methods from :: ShouldHaveEntrypoints a -> Rep (ShouldHaveEntrypoints a) x # to :: Rep (ShouldHaveEntrypoints a) x -> ShouldHaveEntrypoints a #
HasRPCRepr a => HasRPCRepr (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type AsRPC (ShouldHaveEntrypoints a)
WellTypedToT r => IsoValue (ShouldHaveEntrypoints r) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type ToT (ShouldHaveEntrypoints r) :: T # Methods toVal :: ShouldHaveEntrypoints r -> Value (ToT (ShouldHaveEntrypoints r)) # fromVal :: Value (ToT (ShouldHaveEntrypoints r)) -> ShouldHaveEntrypoints r #
type Rep (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers type Rep (ShouldHaveEntrypoints a) = D1 ('MetaData "ShouldHaveEntrypoints" "Lorentz.Entrypoints.Helpers" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "ShouldHaveEntrypoints" 'PrefixI 'True) (S1 ('MetaSel ('Just "unHasEntrypoints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
type AsRPC (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers type AsRPC (ShouldHaveEntrypoints a) = ShouldHaveEntrypoints (AsRPC a)
type ToT (ShouldHaveEntrypoints r) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers type ToT (ShouldHaveEntrypoints r) = GValueType (GRep (ShouldHaveEntrypoints r))

data DEntrypoint (kind :: Type) Source #

Gathers information about single entrypoint.

We assume that entry points might be of different kinds, which is designated by phantom type parameter. For instance, you may want to have several groups of entry points corresponding to various parts of a contract - specifying different kind type argument for each of those groups will allow you defining different DocItem instances with appropriate custom descriptions for them.

Constructors

DEntrypoint
Fields depName :: Text depSub :: SubDoc

Instances

Instances details

EntrypointKindHasDoc ep => DocItem (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement (DEntrypoint ep) :: DocItemPlacementKind # type DocItemReferenced (DEntrypoint ep) :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypoint ep -> DocItemRef (DocItemPlacement (DEntrypoint ep)) (DocItemReferenced (DEntrypoint ep)) # docItemToMarkdown :: HeaderLevel -> DEntrypoint ep -> Markdown # docItemToToc :: HeaderLevel -> DEntrypoint ep -> Markdown # docItemDependencies :: DEntrypoint ep -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypoint ep] -> [DEntrypoint ep] #
type DocItemPlacement (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement (DEntrypoint ep) = 'DocItemInlined
type DocItemReferenced (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced (DEntrypoint ep) = 'True

class Typeable ep => EntrypointKindHasDoc (ep :: Type) where Source #

Describes location of entrypoints of the given kind.

All such entrypoints will be placed under the same "entrypoints" section, and this instance defines characteristics of this section.

Minimal complete definition

entrypointKindOverrideSpecified | entrypointKindPos, entrypointKindSectionName

Associated Types

type EntrypointKindOverride ep Source #

Can be used to make a kind equivalent to some other kind; if changing this, entrypointKindPos and entrypointKindSectionName will be ignored.

type EntrypointKindOverride ep = ep

Methods

entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride ep == ep) ~ False) Source #

Warning: Normally you should never need to use this function

Implement this when specifying EntrypointKindOverride. This should never be normally used, but because MINIMAL pragma can't specify type families, we use this hack.

Default implementation is a bottom (i.e. a runtime error).

If implemented, it should be

entrypointKindOverrideSpecified = Dict

entrypointKindPos :: Natural Source #

Position of the respective entrypoints section in the doc. This shares the same positions space with all other doc items.

default entrypointKindPos :: EntrypointKindHasDoc (EntrypointKindOverride ep) => Natural Source #

entrypointKindSectionName :: Text Source #

Name of the respective entrypoints section.

default entrypointKindSectionName :: EntrypointKindHasDoc (EntrypointKindOverride ep) => Text Source #

entrypointKindSectionDescription :: Maybe Markdown Source #

Description in the respective entrypoints section.

Instances

Instances details

EntrypointKindHasDoc CommonContractBehaviourKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride CommonContractBehaviourKind Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride CommonContractBehaviourKind == CommonContractBehaviourKind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
EntrypointKindHasDoc PlainEntrypointsKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride PlainEntrypointsKind Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride PlainEntrypointsKind == PlainEntrypointsKind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
Typeable heps => EntrypointKindHasDoc (FlattenedEntrypointsKindHiding heps) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) == FlattenedEntrypointsKindHiding heps) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
EntrypointKindHasDoc kind => EntrypointKindHasDoc (CommonEntrypointsBehaviourKind kind) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) == CommonEntrypointsBehaviourKind kind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #

data DEntrypointReference Source #

Inserts a reference to an existing entrypoint.

This helps to avoid duplication in the generated documentation, in order not to overwhelm the reader.

Constructors

DEntrypointReference Text Anchor

Instances

Instances details

DocItem DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement DEntrypointReference :: DocItemPlacementKind # type DocItemReferenced DEntrypointReference :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointReference -> DocItemRef (DocItemPlacement DEntrypointReference) (DocItemReferenced DEntrypointReference) # docItemToMarkdown :: HeaderLevel -> DEntrypointReference -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointReference -> Markdown # docItemDependencies :: DEntrypointReference -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointReference] -> [DEntrypointReference] #
type DocItemPlacement DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointReference = 'DocItemInlined
type DocItemReferenced DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointReference = 'False

class EntryArrow kind name body where Source #

Provides arror for convenient entrypoint documentation

Methods

(#->) :: (Label name, Proxy kind) -> body -> body Source #

Lift entrypoint implementation.

Entrypoint names should go with "e" prefix.

Instances

Instances details

(name ~ AppendSymbol "e" epName, body ~ ((param ': s) :-> out), KnownSymbol epName, DocItem (DEntrypoint kind), NiceParameter param, TypeHasDoc param, KnownValue param) => EntryArrow (kind :: Type) name body Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods (#->) :: (Label name, Proxy kind) -> body -> body Source #

data PlainEntrypointsKind Source #

Default value for DEntrypoint type argument.

Instances

Instances details

EntrypointKindHasDoc PlainEntrypointsKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride PlainEntrypointsKind Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride PlainEntrypointsKind == PlainEntrypointsKind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
type EntrypointKindOverride PlainEntrypointsKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc type EntrypointKindOverride PlainEntrypointsKind = PlainEntrypointsKind

type FlattenedEntrypointsKind = FlattenedEntrypointsKindHiding '[] Source #

A convenience type synonym for FlattenedEntrypointsKindHiding not hiding any entrypoitns.

data FlattenedEntrypointsKindHiding (hiddenEntrypoints :: [Symbol]) Source #

Special entrypoint kind that flattens one level of recursive entrypoints.

With EpdRecursive, intermediary nodes are hidden from documentation.

With EpdDelegate, intermediary nodes will still be shown.

Any entrypoints can be omitted from docs by listing those in the type parameter (which is especially helpful with EpdDelegate).

For other entrypoint derivation strategies (e.g. EpdPlain), behaves like PlainEntrypointsKind (with the exception of hiding entrypoints from docs)

If you have several levels of recursion, each level will need to have this kind.

Note that list of entrypoints to be hidden is not checked by default. Use entryCaseFlattenedHiding to have a static check that entrypoints to be hidden do indeed exist.

Instances

Instances details

Typeable heps => EntrypointKindHasDoc (FlattenedEntrypointsKindHiding heps) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) == FlattenedEntrypointsKindHiding heps) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
type EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type EntrypointKindOverride (FlattenedEntrypointsKindHiding heps) = PlainEntrypointsKind

data CommonContractBehaviourKind Source #

Describes the behaviour common for all entrypoints.

For instance, if your contract runs some checks before calling any entrypoint, you probably want to wrap those checks into entrypointSection "Prior checks" (Proxy @CommonContractBehaviourKind).

Instances

Instances details

EntrypointKindHasDoc CommonContractBehaviourKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride CommonContractBehaviourKind Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride CommonContractBehaviourKind == CommonContractBehaviourKind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
type EntrypointKindOverride CommonContractBehaviourKind Source #
Instance details Defined in Lorentz.Entrypoints.Doc type EntrypointKindOverride CommonContractBehaviourKind = CommonContractBehaviourKind

data CommonEntrypointsBehaviourKind kind Source #

Describes the behaviour common for entrypoints of given kind.

This has very special use cases, like contracts with mix of upgradeable and permanent entrypoints.

Instances

Instances details

EntrypointKindHasDoc kind => EntrypointKindHasDoc (CommonEntrypointsBehaviourKind kind) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) Source # Methods entrypointKindOverrideSpecified :: Dict ((EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) == CommonEntrypointsBehaviourKind kind) ~ 'False) Source # entrypointKindPos :: Natural Source # entrypointKindSectionName :: Text Source # entrypointKindSectionDescription :: Maybe Markdown Source #
type EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type EntrypointKindOverride (CommonEntrypointsBehaviourKind kind) = CommonEntrypointsBehaviourKind kind

data SomeEntrypointArg Source #

Entrypoint argument type in typed representation.

Constructors

forall a.(NiceParameter a, TypeHasDoc a) => SomeEntrypointArg (Proxy a)

data DEntrypointArg Source #

Describes argument of an entrypoint.

Constructors

DEntrypointArg

Fields

epaArg :: Maybe SomeEntrypointArg
Argument of the entrypoint. Pass Nothing if no argument is required.
epaBuilding :: [ParamBuildingStep]
Describes a way to lift an entrypoint argument into full parameter which can be passed to the contract.
Steps are supposed to be applied in the order opposite to one in which they are given. E.g. suppose that an entrypoint is called as Run (Service1 arg); then the first step (actual last) should describe wrapping into Run constructor, and the second step (actual first) should be about wrapping into Service1 constructor.

Instances

Instances details

DocItem DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement DEntrypointArg :: DocItemPlacementKind # type DocItemReferenced DEntrypointArg :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypointArg -> DocItemRef (DocItemPlacement DEntrypointArg) (DocItemReferenced DEntrypointArg) # docItemToMarkdown :: HeaderLevel -> DEntrypointArg -> Markdown # docItemToToc :: HeaderLevel -> DEntrypointArg -> Markdown # docItemDependencies :: DEntrypointArg -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypointArg] -> [DEntrypointArg] #
type DocItemPlacement DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointArg = 'DocItemInlined
type DocItemReferenced DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointArg = 'False

class KnownSymbol con => DeriveCtorFieldDoc con (cf :: CtorField) where Source #

Pick a type documentation from CtorField.

Methods

deriveCtorFieldDoc :: DEntrypointArg Source #

Instances

Instances details

KnownSymbol con => DeriveCtorFieldDoc con 'NoFields Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods deriveCtorFieldDoc :: DEntrypointArg Source #
(NiceParameter ty, TypeHasDoc ty, KnownValue ty, KnownSymbol con) => DeriveCtorFieldDoc con ('OneField ty) Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods deriveCtorFieldDoc :: DEntrypointArg Source #

newtype ParamBuilder Source #

When describing the way of parameter construction - piece of incremental builder for this description.

Constructors

ParamBuilder
Fields unParamBuilder :: Markdown -> Markdown Argument stands for previously constructed parameter piece, and returned value - a piece constructed after our step.

Instances

Instances details

Buildable ParamBuilder Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods build :: ParamBuilder -> Doc buildList :: [ParamBuilder] -> Doc

data ParamBuildingDesc Source #

Constructors

ParamBuildingDesc
Fields pbdEnglish :: Markdown Plain english description of this step. pbdHaskell :: ParamBuilder How to construct parameter in Haskell code. pbdMichelson :: ParamBuilder How to construct parameter working on raw Michelson.

data ParamBuildingStep Source #

Describes a parameter building step.

This can be wrapping into (Haskell) constructor, or a more complex transformation.

Constructors

PbsWrapIn Text ParamBuildingDesc	Wraps something into constructor with given name. Constructor should be the one which corresponds to an entrypoint defined via field annotation, for more complex cases use `PbsCustom`.
PbsCallEntrypoint EpName	Directly call an entrypoint marked with a field annotation.
PbsCustom ParamBuildingDesc	Other action.
PbsUncallable [ParamBuildingStep]	This entrypoint cannot be called, which is possible when an explicit default entrypoint is present. This is not a true entrypoint but just some intermediate node in `or` tree and neither it nor any of its parents are marked with a field annotation. It contains dummy `ParamBuildingStep`s which were assigned before entrypoints were taken into account.

Instances

Instances details

Buildable ParamBuildingStep Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods build :: ParamBuildingStep -> Doc buildList :: [ParamBuildingStep] -> Doc

type DocumentEntrypoints kind a = (Generic a, GDocumentEntrypoints (BuildEPTree' a) kind (GRep a) '[]) Source #

Constraint for documentEntrypoints.

type family RequireFlatParamEps cp :: Constraint where ... Source #

Equations

RequireFlatParamEps cp = (NiceParameterFull cp, RequireFlatEpDerivation cp (GetParameterEpDerivation cp), RequireSumType cp)

type family RequireFlatEpDerivation cp deriv :: Constraint where ... Source #

Equations

RequireFlatEpDerivation _ EpdNone = ()
RequireFlatEpDerivation _ EpdPlain = ()
RequireFlatEpDerivation cp deriv = TypeError (('Text "Parameter is not flat" ':$$: (('Text "For parameter `" ':<>: 'ShowType cp) ':<>: 'Text "`")) ':$$: (('Text "With entrypoints derivation way `" ':<>: 'ShowType deriv) ':<>: 'Text "`"))

data EpName #

Instances

Instances details

FromJSON EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods parseJSON :: Value -> Parser EpName # parseJSONList :: Value -> Parser [EpName] #
ToJSON EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods toJSON :: EpName -> Value # toEncoding :: EpName -> Encoding # toJSONList :: [EpName] -> Value # toEncodingList :: [EpName] -> Encoding #
Generic EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpName :: Type -> Type # Methods from :: EpName -> Rep EpName x # to :: Rep EpName x -> EpName #
Show EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
NFData EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods rnf :: EpName -> () #
Eq EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Ord EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods compare :: EpName -> EpName -> Ordering # (<) :: EpName -> EpName -> Bool # (<=) :: EpName -> EpName -> Bool # (>) :: EpName -> EpName -> Bool # (>=) :: EpName -> EpName -> Bool # max :: EpName -> EpName -> EpName # min :: EpName -> EpName -> EpName #
HasCLReader EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods getReader :: ReadM EpName getMetavar :: String
Buildable EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods build :: EpName -> Doc buildList :: [EpName] -> Doc
type Rep EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints type Rep EpName = D1 ('MetaData "EpName" "Morley.Michelson.Untyped.Entrypoints" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "UnsafeEpName" 'PrefixI 'True) (S1 ('MetaSel ('Just "unEpName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

class ErrorHasDoc e => IsError e where Source #

Haskell type representing error.

Minimal complete definition

errorToVal, errorFromVal

Methods

errorToVal :: e -> (forall t. ErrorScope t => Value t -> r) -> r Source #

Converts a Haskell error into Value representation.

errorFromVal :: SingI t => Value t -> Either Text e Source #

Converts a Value into Haskell error.

failUsing :: IsError e => e -> s :-> t Source #

Fail with the given Haskell value.

Instances

Instances details

IsError UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: UnspecifiedError -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text UnspecifiedError Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError UnspecifiedError => UnspecifiedError -> s :-> t Source #
IsError MText Source #	Use this for internal errors only. "Normal" error scenarios should use the mechanism of custom errors, see below.
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text MText Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError MText => MText -> s :-> t Source #
(Bottom, TypeError ('Text "Use representative error messages") :: Constraint) => IsError () Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: () -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text () Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError () => () -> s :-> t Source #
(CustomErrorHasDoc tag, KnownError (CustomErrorRep tag), IsoValue (CustomErrorRep tag), IsCustomErrorArgRep (CustomErrorRep tag)) => IsError (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: CustomError tag -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (CustomError tag) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (CustomError tag) => CustomError tag -> s :-> t Source #
KnownSymbol reason => IsError (Impossible reason) Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: Impossible reason -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (Impossible reason) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (Impossible reason) => Impossible reason -> s :-> t Source #
(NiceConstant r, ErrorHasDoc (VoidResult r)) => IsError (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Methods errorToVal :: VoidResult r -> (forall (t :: T). ErrorScope t => Value t -> r0) -> r0 Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (VoidResult r) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (VoidResult r) => VoidResult r -> s :-> t Source #
(Typeable arg, IsError (CustomError tag), arg ~ ErrorArg tag, FailUnlessEqual arg () ('Text "This error requires argument of type " ':<>: 'ShowType (ErrorArg tag))) => IsError (arg -> CustomError tag) Source #	If `CustomError` constructor is not provided its argument, we assume that this is unit-arg error and interpret the passed value as complete.
Instance details Defined in Lorentz.Errors Methods errorToVal :: (arg -> CustomError tag) -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (arg -> CustomError tag) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (arg -> CustomError tag) => (arg -> CustomError tag) -> s :-> t Source #

type ErrorScope t = ConstantScope t Source #

Since 008 it's prohibited to fail with non-packable values and with the 'Contract t' type values, which is equivalent to our ConstantScope constraint. See https://gitlab.com/tezos/tezos/-/issues/1093#note_496066354 for more information.

class ConstantScopeC (ConstantScope t) t => ConstantScope (t :: T) #

Instances

Instances details

ConstantScopeC (ConstantScope t) t => ConstantScope t
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.Scopes
(WithDeMorganScope ForbidOp t a b, WithDeMorganScope ForbidBigMap t a b, WithDeMorganScope ForbidContract t a b, WithDeMorganScope ForbidTicket t a b, WithDeMorganScope ForbidSaplingState t a b, WellTyped a, WellTyped b) => WithDeMorganScope ConstantScope t a b
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.WithDeMorganScope Methods withDeMorganScope :: ConstantScope (t a b) => ((ConstantScope a, ConstantScope b) => ret) -> ret
SingI t => CheckScope (ConstantScope t)
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.CheckScope Methods checkScope :: Either BadTypeForScope (Dict (ConstantScope t))

class Typeable e => ErrorHasDoc (e :: Type) where Source #

Minimal complete definition

errorDocName, errorDocMdCause, errorDocHaskellRep, errorDocDependencies

Associated Types

type ErrorRequirements e :: Constraint Source #

Constraints which we require in a particular instance. You are not oblidged to often instantiate this correctly, it is only useful for some utilities.

type ErrorRequirements _ = ()

Methods

errorDocName :: Text Source #

Name of error as it appears in the corresponding section title.

errorDocMdCause :: Markdown Source #

What should happen for this error to be raised.

errorDocMdCauseInEntrypoint :: Markdown Source #

Brief version of errorDocMdCause.

This will appear along with the error when mentioned in entrypoint description. By default, the first sentence of the full description is used.

errorDocHaskellRep :: Markdown Source #

How this error is represented in Haskell.

errorDocClass :: ErrorClass Source #

Error class.

errorDocDependencies :: [SomeDocDefinitionItem] Source #

Which definitions documentation for this error mentions.

errorDocRequirements :: Dict (ErrorRequirements e) Source #

Captured constraints which we require in a particular instance. This is a way to encode a bidirectional instance in the nowaday Haskell, for class MyConstraint => ErrorHasDoc MyType instance it lets deducing MyConstraint by ErrorHasDoc MyType.

You are not oblidged to always instantiate, it is only useful for some utilities which otherwise would not compile.

default errorDocRequirements :: ErrorRequirements e => Dict (ErrorRequirements e) Source #

Instances

Instances details

ErrorHasDoc UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements UnspecifiedError Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements UnspecifiedError) Source #
ErrorHasDoc MText Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements MText Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements MText) Source #
(Bottom, TypeError ('Text "Use representative error messages") :: Constraint) => ErrorHasDoc () Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements () Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements ()) Source #
(CustomErrorHasDoc tag, IsCustomErrorArgRep (CustomErrorRep tag)) => ErrorHasDoc (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (CustomError tag) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (CustomError tag)) Source #
KnownSymbol reason => ErrorHasDoc (Impossible reason) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (Impossible reason) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (Impossible reason)) Source #
TypeHasDoc r => ErrorHasDoc (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ErrorRequirements (VoidResult r) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (VoidResult r)) Source #
(ErrorHasDoc err, KnownNat numTag, ErrorHasNumericDoc err) => ErrorHasDoc (NumericErrorWrapper numTag err) Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Associated Types type ErrorRequirements (NumericErrorWrapper numTag err) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (NumericErrorWrapper numTag err)) Source #
(Typeable arg, ErrorHasDoc (CustomError tag)) => ErrorHasDoc (arg -> CustomError tag) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (arg -> CustomError tag) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (arg -> CustomError tag)) Source #

data UnspecifiedError Source #

Use this type as replacement for () when you really want to leave error cause unspecified.

Constructors

UnspecifiedError

Instances

Instances details

Generic UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type Rep UnspecifiedError :: Type -> Type # Methods from :: UnspecifiedError -> Rep UnspecifiedError x # to :: Rep UnspecifiedError x -> UnspecifiedError #
ErrorHasDoc UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements UnspecifiedError Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements UnspecifiedError) Source #
IsError UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: UnspecifiedError -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text UnspecifiedError Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError UnspecifiedError => UnspecifiedError -> s :-> t Source #
IsoValue UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ToT UnspecifiedError :: T # Methods toVal :: UnspecifiedError -> Value (ToT UnspecifiedError) # fromVal :: Value (ToT UnspecifiedError) -> UnspecifiedError #
type Rep UnspecifiedError Source #
Instance details Defined in Lorentz.Errors type Rep UnspecifiedError = D1 ('MetaData "UnspecifiedError" "Lorentz.Errors" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "UnspecifiedError" 'PrefixI 'False) (U1 :: Type -> Type))
type ErrorRequirements UnspecifiedError Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements UnspecifiedError = ()
type ToT UnspecifiedError Source #
Instance details Defined in Lorentz.Errors type ToT UnspecifiedError = GValueType (GRep UnspecifiedError)

data Impossible (reason :: Symbol) Source #

Use this error when sure that failing at the current position is possible in no curcumstances (including invalid user input or misconfigured storage).

To use this as error, you have to briefly specify the reason why the error scenario is impossible (experimental feature).

Constructors

HasCallStack => Impossible

Instances

Instances details

KnownSymbol reason => ErrorHasDoc (Impossible reason) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (Impossible reason) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (Impossible reason)) Source #
KnownSymbol reason => IsError (Impossible reason) Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: Impossible reason -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (Impossible reason) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (Impossible reason) => Impossible reason -> s :-> t Source #
type ErrorRequirements (Impossible reason) Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements (Impossible reason) = ()

data SomeError Source #

Type wrapper for an IsError.

Constructors

forall e.(IsError e, Eq e) => SomeError e

Instances

Instances details

Eq SomeError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: SomeError -> SomeError -> Bool # (/=) :: SomeError -> SomeError -> Bool #
Buildable SomeError Source #
Instance details Defined in Lorentz.Errors Methods build :: SomeError -> Doc buildList :: [SomeError] -> Doc

data NoErrorArg Source #

To be used as ErrorArg instance when failing with just a string instead of pair string x

data UnitErrorArg Source #

To be used as ErrorArg instances. This is equivalent to using () but using UnitErrorArg is preferred since () behavior could be changed in the future.

type family ErrorArg (tag :: Symbol) :: Type Source #

Declares a custom error, defining error name - error argument relation.

If your error is supposed to carry no argument, then provide ().

Note that this relation is defined globally rather than on per-contract basis, so define errors accordingly. If your error has argument specific to your contract, call it such that error name reflects its belonging to this contract.

This is the basic [error format].

Instances

Instances details

type ErrorArg "nOT_SINGLE_TICKET_TOKEN" Source #
Instance details Defined in Lorentz.Tickets type ErrorArg "nOT_SINGLE_TICKET_TOKEN" = NoErrorArg
type ErrorArg "nOT_TICKET_TARGET" Source #
Instance details Defined in Lorentz.Tickets type ErrorArg "nOT_TICKET_TARGET" = NoErrorArg
type ErrorArg "no_view" Source #
Instance details Defined in Lorentz.Macro type ErrorArg "no_view" = MText
type ErrorArg "uparamArgumentUnpackFailed" Source #
Instance details Defined in Lorentz.UParam type ErrorArg "uparamArgumentUnpackFailed" = UnitErrorArg
type ErrorArg "uparamNoSuchEntrypoint" Source #
Instance details Defined in Lorentz.UParam type ErrorArg "uparamNoSuchEntrypoint" = MText
type ErrorArg "wRONG_TICKETER" Source #
Instance details Defined in Lorentz.Tickets type ErrorArg "wRONG_TICKETER" = NoErrorArg
type ErrorArg "zero_denominator" Source #
Instance details Defined in Lorentz.CustomArith.RationalArith type ErrorArg "zero_denominator" = ("numerator" :! Integer, "denominator" :! Natural)

data CustomError (tag :: Symbol) Source #

Material custom error.

Use this in pattern matches against error (e.g. in tests).

Constructors

CustomError
Fields ceTag :: Label tag ceArg :: CustomErrorRep tag

Instances

Instances details

Show (CustomErrorRep tag) => Show (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> CustomError tag -> ShowS # show :: CustomError tag -> String # showList :: [CustomError tag] -> ShowS #
Eq (CustomErrorRep tag) => Eq (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods (==) :: CustomError tag -> CustomError tag -> Bool # (/=) :: CustomError tag -> CustomError tag -> Bool #
(CustomErrorHasDoc tag, IsCustomErrorArgRep (CustomErrorRep tag)) => ErrorHasDoc (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (CustomError tag) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (CustomError tag)) Source #
(CustomErrorHasDoc tag, KnownError (CustomErrorRep tag), IsoValue (CustomErrorRep tag), IsCustomErrorArgRep (CustomErrorRep tag)) => IsError (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods errorToVal :: CustomError tag -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (CustomError tag) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (CustomError tag) => CustomError tag -> s :-> t Source #
(Bottom, WellTypedToT (CustomErrorRep tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag) Source #	This instance cannot be implemented, use `IsError` instance instead.
Instance details Defined in Lorentz.Errors Associated Types type ToT (CustomError tag) :: T # Methods toVal :: CustomError tag -> Value (ToT (CustomError tag)) # fromVal :: Value (ToT (CustomError tag)) -> CustomError tag #
Buildable (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods build :: CustomError tag -> Doc buildList :: [CustomError tag] -> Doc
Buildable (CustomError "uparamArgumentUnpackFailed")
Instance details Defined in Lorentz.UParam Methods build :: CustomError "uparamArgumentUnpackFailed" -> Doc buildList :: [CustomError "uparamArgumentUnpackFailed"] -> Doc
Buildable (CustomError "uparamNoSuchEntrypoint")
Instance details Defined in Lorentz.UParam Methods build :: CustomError "uparamNoSuchEntrypoint" -> Doc buildList :: [CustomError "uparamNoSuchEntrypoint"] -> Doc
(Typeable arg, ErrorHasDoc (CustomError tag)) => ErrorHasDoc (arg -> CustomError tag) Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (arg -> CustomError tag) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (arg -> CustomError tag)) Source #
(Typeable arg, IsError (CustomError tag), arg ~ ErrorArg tag, FailUnlessEqual arg () ('Text "This error requires argument of type " ':<>: 'ShowType (ErrorArg tag))) => IsError (arg -> CustomError tag) Source #	If `CustomError` constructor is not provided its argument, we assume that this is unit-arg error and interpret the passed value as complete.
Instance details Defined in Lorentz.Errors Methods errorToVal :: (arg -> CustomError tag) -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (arg -> CustomError tag) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (arg -> CustomError tag) => (arg -> CustomError tag) -> s :-> t Source #
type ErrorRequirements (CustomError tag) Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements (CustomError tag) = (CustomErrorHasDoc tag, IsCustomErrorArgRep (CustomErrorRep tag))
type ToT (CustomError tag) Source #
Instance details Defined in Lorentz.Errors type ToT (CustomError tag) = ToT (CustomErrorRep tag)
type ErrorRequirements (arg -> CustomError tag) Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements (arg -> CustomError tag) = ()

type CustomErrorRep tag = CustomErrorArgRep (ErrorArg tag) Source #

How CustomError is actually represented in Michelson.

class IsCustomErrorArgRep a where Source #

Typeclass implements various method that work with CustomErrorArgRep.

Methods

verifyErrorTag :: MText -> a -> Either Text a Source #

customErrorRepDocDeps :: [SomeDocDefinitionItem] Source #

customErrorHaskellRep :: (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #

Instances

Instances details

IsCustomErrorArgRep MText Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> MText -> Either Text MText Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #
TypeHasDoc errArg => IsCustomErrorArgRep (MText, errArg) Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> (MText, errArg) -> Either Text (MText, errArg) Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #

type MustHaveErrorArg errorTag expectedArgRep = FailUnlessEqual (CustomErrorRep errorTag) expectedArgRep ((('Text "Error argument type is " ':<>: 'ShowType expectedArgRep) ':<>: 'Text " but given error requires argument of type ") ':<>: 'ShowType (CustomErrorRep errorTag)) Source #

data ErrorClass Source #

Error class on how the error should be handled by the client.

Constructors

ErrClassActionException	Normal expected error. Examples: "insufficient balance", "wallet does not exist".
ErrClassBadArgument	Invalid argument passed to entrypoint. Examples: your entrypoint accepts an enum represented as `nat`, and unknown value is provided. This includes more complex cases which involve multiple entrypoints. E.g. API provides iterator interface, middleware should care about using it hiding complex details and exposing a simpler API to user; then an attempt to request non-existing element would also correspond to an error from this class.
ErrClassContractInternal	Unexpected error. Most likely it means that there is a bug in the contract or the contract has been deployed incorrectly.
ErrClassUnknown	It's possible to leave error class unspecified.

Instances

Instances details

Buildable ErrorClass Source #
Instance details Defined in Lorentz.Errors Methods build :: ErrorClass -> Doc buildList :: [ErrorClass] -> Doc
Lift ErrorClass Source #
Instance details Defined in Lorentz.Errors Methods lift :: Quote m => ErrorClass -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => ErrorClass -> Code m ErrorClass #

class (KnownSymbol tag, TypeHasDoc (CustomErrorRep tag), IsError (CustomError tag)) => CustomErrorHasDoc tag where Source #

Minimal complete definition

customErrDocMdCause, customErrClass

Methods

customErrDocMdCause :: Markdown Source #

What should happen for this error to be raised.

customErrDocMdCauseInEntrypoint :: Markdown Source #

Brief version of customErrDocMdCause. This will appear along with the error when mentioned in entrypoint description.

By default, the first sentence of the full description is used.

customErrClass :: ErrorClass Source #

Error class.

By default this returns "unknown error" class; though you should provide explicit implementation in order to avoid a warning.

customErrArgumentSemantics :: Maybe Markdown Source #

Clarification of error argument meaning.

Provide when it's not obvious, e.g. argument is not named with :!.

NOTE: This should not be an entire sentence, rather just the semantic backbone.

Bad: * Error argument stands for the previous value of approval.

Good: * the previous value of approval * pair, first argument of which is one thing, and the second is another

Instances

Instances details

CustomErrorHasDoc "nOT_SINGLE_TICKET_TOKEN" Source #
Instance details Defined in Lorentz.Tickets Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "nOT_TICKET_TARGET" Source #
Instance details Defined in Lorentz.Tickets Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "no_view" Source #
Instance details Defined in Lorentz.Macro Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "uparamArgumentUnpackFailed" Source #
Instance details Defined in Lorentz.UParam Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "uparamNoSuchEntrypoint" Source #
Instance details Defined in Lorentz.UParam Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "wRONG_TICKETER" Source #
Instance details Defined in Lorentz.Tickets Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #
CustomErrorHasDoc "zero_denominator" Source #
Instance details Defined in Lorentz.CustomArith.RationalArith Methods customErrDocMdCause :: Markdown Source # customErrDocMdCauseInEntrypoint :: Markdown Source # customErrClass :: ErrorClass Source # customErrArgumentSemantics :: Maybe Markdown Source #

data DError where Source #

Mentions that contract uses given error.

Constructors

DError :: ErrorHasDoc e => Proxy e -> DError

Instances

Instances details

Eq DError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DError -> DError -> Bool # (/=) :: DError -> DError -> Bool #
Ord DError Source #
Instance details Defined in Lorentz.Errors Methods compare :: DError -> DError -> Ordering # (<) :: DError -> DError -> Bool # (<=) :: DError -> DError -> Bool # (>) :: DError -> DError -> Bool # (>=) :: DError -> DError -> Bool # max :: DError -> DError -> DError # min :: DError -> DError -> DError #
DocItem DError Source #
Instance details Defined in Lorentz.Errors Associated Types type DocItemPlacement DError :: DocItemPlacementKind # type DocItemReferenced DError :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DError -> DocItemRef (DocItemPlacement DError) (DocItemReferenced DError) # docItemToMarkdown :: HeaderLevel -> DError -> Markdown # docItemToToc :: HeaderLevel -> DError -> Markdown # docItemDependencies :: DError -> [SomeDocDefinitionItem] # docItemsOrder :: [DError] -> [DError] #
type DocItemPlacement DError Source #
Instance details Defined in Lorentz.Errors type DocItemPlacement DError = 'DocItemInDefinitions
type DocItemReferenced DError Source #
Instance details Defined in Lorentz.Errors type DocItemReferenced DError = 'True

data DThrows where Source #

Documentation for custom errors.

Mentions that entrypoint throws given error.

Constructors

DThrows :: ErrorHasDoc e => Proxy e -> DThrows

Instances

Instances details

Eq DThrows Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DThrows -> DThrows -> Bool # (/=) :: DThrows -> DThrows -> Bool #
DocItem DThrows Source #
Instance details Defined in Lorentz.Errors Associated Types type DocItemPlacement DThrows :: DocItemPlacementKind # type DocItemReferenced DThrows :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DThrows -> DocItemRef (DocItemPlacement DThrows) (DocItemReferenced DThrows) # docItemToMarkdown :: HeaderLevel -> DThrows -> Markdown # docItemToToc :: HeaderLevel -> DThrows -> Markdown # docItemDependencies :: DThrows -> [SomeDocDefinitionItem] # docItemsOrder :: [DThrows] -> [DThrows] #
type DocItemPlacement DThrows Source #
Instance details Defined in Lorentz.Errors type DocItemPlacement DThrows = 'DocItemInlined
type DocItemReferenced DThrows Source #
Instance details Defined in Lorentz.Errors type DocItemReferenced DThrows = 'False

type ErrorTagMap = Bimap Natural MText Source #

This is a bidirectional map with correspondence between numeric and textual error tags.

type ErrorTagExclusions = HashSet MText Source #

Tags excluded from map.

data DDescribeErrorTagMap Source #

Adds a section which explains error tag mapping.

Constructors

DDescribeErrorTagMap
Fields detmSrcLoc :: Text Describes where the error tag map is defined in Haskell code.

Instances

Instances details

Eq DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods (==) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (/=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool #
Ord DDescribeErrorTagMap Source #
Instance details 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 #
DocItem DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Associated Types type DocItemPlacement DDescribeErrorTagMap :: DocItemPlacementKind # type DocItemReferenced DDescribeErrorTagMap :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DDescribeErrorTagMap -> DocItemRef (DocItemPlacement DDescribeErrorTagMap) (DocItemReferenced DDescribeErrorTagMap) # docItemToMarkdown :: HeaderLevel -> DDescribeErrorTagMap -> Markdown # docItemToToc :: HeaderLevel -> DDescribeErrorTagMap -> Markdown # docItemDependencies :: DDescribeErrorTagMap -> [SomeDocDefinitionItem] # docItemsOrder :: [DDescribeErrorTagMap] -> [DDescribeErrorTagMap] #
type DocItemPlacement DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemPlacement DDescribeErrorTagMap = 'DocItemInDefinitions
type DocItemReferenced DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemReferenced DDescribeErrorTagMap = 'True

data NumericErrorDocHandler Source #

Handler which changes documentation for one particular error type.

data NumericErrorDocHandlerError Source #

Errors for NumericErrorDocHandler

data NumericErrorWrapper (numTag :: Nat) (err :: Type) Source #

Some error with a numeric tag attached.

Instances

Instances details

(ErrorHasDoc err, KnownNat numTag, ErrorHasNumericDoc err) => ErrorHasDoc (NumericErrorWrapper numTag err) Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Associated Types type ErrorRequirements (NumericErrorWrapper numTag err) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (NumericErrorWrapper numTag err)) Source #
type ErrorRequirements (NumericErrorWrapper numTag err) Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc type ErrorRequirements (NumericErrorWrapper numTag err) = ()

type ConstraintDUPNLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDUPN n (ToTs inp) (ToTs out) (ToT a), ConstraintDUPN' Type n inp out a, SingI n) Source #

type ConstraintDIGLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDIG n (ToTs inp) (ToTs out) (ToT a), ConstraintDIG' Type n inp out a, SingI n) Source #

type ConstraintDUGLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (a :: Type) = (ConstraintDUG n (ToTs inp) (ToTs out) (ToT a), ConstraintDUG' Type n inp out a, SingI n) Source #

type ConstraintPairGetLorentz (n :: Nat) (pair :: Type) = (ConstraintGetN (ToPeano n) (ToT pair), ToT (PairGetHs (ToPeano n) pair) ~ GetN (ToPeano n) (ToT pair), SingIPeano n) Source #

type family PairGetHs (ix :: Peano) (pair :: Type) :: Type where ... Source #

Equations

PairGetHs 'Z val = val
PairGetHs ('S 'Z) (left, _) = left
PairGetHs ('S ('S n)) (_, right) = PairGetHs n right

type ConstraintPairUpdateLorentz (n :: Nat) (val :: Type) (pair :: Type) = (ConstraintUpdateN (ToPeano n) (ToT pair), ToT (PairUpdateHs (ToPeano n) val pair) ~ UpdateN (ToPeano n) (ToT val) (ToT pair), SingIPeano n) Source #

type family PairUpdateHs (ix :: Peano) (val :: Type) (pair :: Type) :: Type where ... Source #

Equations

PairUpdateHs 'Z val _ = val
PairUpdateHs ('S 'Z) val (_, right) = (val, right)
PairUpdateHs ('S ('S n)) val (left, right) = (left, PairUpdateHs n val right)

type ConstraintDIPNLorentz (n :: Peano) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]) = (ConstraintDIPN n (ToTs inp) (ToTs out) (ToTs s) (ToTs s'), ConstraintDIPN' Type n inp out s s', SingI n) Source #

data ReadTicket a Source #

Value returned by READ_TICKET instruction.

Constructors

ReadTicket
Fields rtTicketer :: Address rtData :: a rtAmount :: Natural

Instances

Instances details

Generic (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type Rep (ReadTicket a) :: Type -> Type # Methods from :: ReadTicket a -> Rep (ReadTicket a) x # to :: Rep (ReadTicket a) x -> ReadTicket a #
Show a => Show (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> ReadTicket a -> ShowS # show :: ReadTicket a -> String # showList :: [ReadTicket a] -> ShowS #
Eq a => Eq (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods (==) :: ReadTicket a -> ReadTicket a -> Bool # (/=) :: ReadTicket a -> ReadTicket a -> Bool #
Ord a => Ord (ReadTicket a) Source #
Instance details 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 #
IsoValue a => IsoValue (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (ReadTicket a) :: T # Methods toVal :: ReadTicket a -> Value (ToT (ReadTicket a)) # fromVal :: Value (ToT (ReadTicket a)) -> ReadTicket a #
type Rep (ReadTicket a) Source #
Instance details Defined in Lorentz.Value type Rep (ReadTicket a) = D1 ('MetaData "ReadTicket" "Lorentz.Value" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "ReadTicket" 'PrefixI 'True) (S1 ('MetaSel ('Just "rtTicketer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Constrained (NullConstraint :: AddressKind -> Constraint) KindedAddress)) :: (S1 ('MetaSel ('Just "rtData") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :: S1 ('MetaSel ('Just "rtAmount") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Natural))))
type ToT (ReadTicket a) Source #
Instance details Defined in Lorentz.Value type ToT (ReadTicket a) = GValueType (GRep (ReadTicket a))

class LorentzFunctor (c :: Type -> Type) a b where Source #

Methods

lmap :: KnownValue b => ('[a] :-> '[b]) -> (c a : s) :-> (c b : s) Source #

Instances

Instances details

(NiceComparable a, NiceComparable b) => LorentzFunctor Set a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Set a ': s) :-> (Set b ': s) Source #
LorentzFunctor Maybe a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Maybe a ': s) :-> (Maybe b ': s) Source #
LorentzFunctor [] a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> ([a] ': s) :-> ([b] ': s) Source #
KnownValue a => LorentzFunctor (Either a) a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Either a a ': s) :-> (Either a b ': s) Source #
NiceComparable k => LorentzFunctor (Map k) a b Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall (s :: [Type]). KnownValue b => ('[a] :-> '[b]) -> (Map k a ': s) :-> (Map k b ': s) Source #

data LIso a b Source #

Lorentz version of Control.Lens.Iso.

Constructors

LIso
Fields liTo :: forall s. (a : s) :-> (b : s) liFrom :: forall s. (b : s) :-> (a : s)

data WrappedLambda i o Source #

A helper type to construct Lorentz lambda values; Use this for lambda values outside of Lorentz contracts or with push.

Constructors

WrappedLambda (i :-> o)
RecLambda ((i ++ '[WrappedLambda i o]) :-> o)

Instances

Instances details

(CanCastTo (ZippedStack inp1) (ZippedStack inp2), CanCastTo (ZippedStack out1) (ZippedStack out2), CanCastTo (ZippedStack (inp1 ++ '[WrappedLambda inp1 out1])) (ZippedStack (inp2 ++ '[WrappedLambda inp2 out2]))) => CanCastTo (WrappedLambda inp1 out1 :: Type) (WrappedLambda inp2 out2 :: Type) Source #
Instance details Defined in Lorentz.Lambda Methods castDummy :: Proxy (WrappedLambda inp1 out1) -> Proxy (WrappedLambda inp2 out2) -> () Source #
Generic (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type Rep (WrappedLambda i o) :: Type -> Type # Methods from :: WrappedLambda i o -> Rep (WrappedLambda i o) x # to :: Rep (WrappedLambda i o) x -> WrappedLambda i o #
Show (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Methods showsPrec :: Int -> WrappedLambda i o -> ShowS # show :: WrappedLambda i o -> String # showList :: [WrappedLambda i o] -> ShowS #
Eq (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Methods (==) :: WrappedLambda i o -> WrappedLambda i o -> Bool # (/=) :: WrappedLambda i o -> WrappedLambda i o -> Bool #
Each '[HasAnnotation] '[ZippedStack i, ZippedStack o] => HasAnnotation (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (WrappedLambda i o)) Source # annOptions :: Maybe AnnOptions Source #
MapLorentzInstr (WrappedLambda inp out) Source #
Instance details Defined in Lorentz.Lambda Methods mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> WrappedLambda inp out -> WrappedLambda inp out Source #
HasRPCRepr (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type AsRPC (WrappedLambda i o)
Each '[Typeable :: [Type] -> Constraint, ReifyList TypeHasDoc] '[i, o] => TypeHasDoc (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type TypeDocFieldDescriptions (WrappedLambda i o) :: FieldDescriptions # Methods typeDocName :: Proxy (WrappedLambda i o) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (WrappedLambda i o) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (WrappedLambda i o) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (WrappedLambda i o) # typeDocMichelsonRep :: TypeDocMichelsonRep (WrappedLambda i o) #
(KnownList i, ZipInstr i, ZipInstr o) => IsoValue (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda Associated Types type ToT (WrappedLambda i o) :: T # Methods toVal :: WrappedLambda i o -> Value (ToT (WrappedLambda i o)) # fromVal :: Value (ToT (WrappedLambda i o)) -> WrappedLambda i o #
type Rep (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type Rep (WrappedLambda i o) = D1 ('MetaData "WrappedLambda" "Lorentz.Lambda" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "WrappedLambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (i :-> o))) :+: C1 ('MetaCons "RecLambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ((i ++ '[WrappedLambda i o]) :-> o))))
type AsRPC (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type AsRPC (WrappedLambda i o) = WrappedLambda i o
type TypeDocFieldDescriptions (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type TypeDocFieldDescriptions (WrappedLambda i o) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type ToT (WrappedLambda i o) = 'TLambda (ToT (ZippedStack i)) (ToT (ZippedStack o))

type ErrInstr s = forall serr. s :-> serr Source #

An instruction that always fails.

type ConstraintReplaceNLorentz (n :: Peano) (s :: [Type]) (a :: Type) (mid :: [Type]) (tail :: [Type]) = (ReplaceNConstraint' T n (ToTs s) (ToT a) (ToTs mid) (ToTs tail), ReplaceNConstraint' Type n s a mid tail) Source #

Constraint for replaceN that combines kind-agnostic constraint for Lorentz (Haskell) types and for our typed Michelson.

type ConstraintUpdateNLorentz (n :: Peano) (s :: [Type]) (a :: Type) (b :: Type) (mid :: [Type]) (tail :: [Type]) = (UpdateNConstraint' T n (ToTs s) (ToT a) (ToT b) (ToTs mid) (ToTs tail), UpdateNConstraint' Type n s a b mid tail) Source #

Constraint for updateN that combines kind-agnostic constraint for Lorentz (Haskell) types and for our typed Michelson.

class ReplaceN (n :: Peano) (s :: [Type]) (a :: Type) mid tail where Source #

Methods

replaceNImpl :: (a ': s) :-> s Source #

Instances

Instances details

s ~ (a ': xs) => ReplaceN ('S 'Z) s a (mid :: k1) (tail :: k2) Source #
Instance details Defined in Lorentz.Macro Methods replaceNImpl :: (a ': s) :-> s Source #
(ConstraintReplaceNLorentz ('S n) s a mid tail, SingI n) => ReplaceN ('S ('S n)) s a (mid :: [Type]) (tail :: [Type]) Source #
Instance details Defined in Lorentz.Macro Methods replaceNImpl :: (a ': s) :-> s Source #

class UpdateN (n :: Peano) (s :: [Type]) (a :: Type) (b :: Type) mid tail where Source #

Methods

updateNImpl :: ('[a, b] :-> '[b]) -> (a ': s) :-> s Source #

Instances

Instances details

s ~ (x ': (b ': tail)) => UpdateN ('S ('S 'Z)) s a b (mid :: k) (tail :: [Type]) Source #
Instance details Defined in Lorentz.Macro Methods updateNImpl :: ('[a, b] :-> '[b]) -> (a ': s) :-> s Source #
s ~ (b ': tail) => UpdateN ('S 'Z) s a b (mid :: k) (tail :: [Type]) Source #
Instance details Defined in Lorentz.Macro Methods updateNImpl :: ('[a, b] :-> '[b]) -> (a ': s) :-> s Source #
(ConstraintUpdateNLorentz ('S ('S n)) s a b mid tail, SingI n) => UpdateN ('S ('S ('S n))) s a b (mid :: [Type]) (tail :: [Type]) Source #
Instance details Defined in Lorentz.Macro Methods updateNImpl :: ('[a, b] :-> '[b]) -> (a ': s) :-> s Source #

data View_ (a :: Type) (r :: Type) Source #

view type synonym as described in A1.

Constructors

View_
Fields viewParam :: a viewCallbackTo :: ContractRef r

Instances

Instances details

(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (View_ a1 r1 :: Type) (View_ a2 r2 :: Type) Source #
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (View_ a1 r1) -> Proxy (View_ a2 r2) -> () Source #
Generic (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (View_ a r) :: Type -> Type # Methods from :: View_ a r -> Rep (View_ a r) x # to :: Rep (View_ a r) x -> View_ a r #
Show a => Show (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> View_ a r -> ShowS # show :: View_ a r -> String # showList :: [View_ a r] -> ShowS #
Eq a => Eq (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods (==) :: View_ a r -> View_ a r -> Bool # (/=) :: View_ a r -> View_ a r -> Bool #
(HasAnnotation a, HasAnnotation r) => HasAnnotation (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (View_ a r)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr a => HasRPCRepr (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type AsRPC (View_ a r)
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (View_ a r) :: FieldDescriptions # Methods typeDocName :: Proxy (View_ a r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (View_ a r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (View_ a r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (View_ a r) # typeDocMichelsonRep :: TypeDocMichelsonRep (View_ a r) #
(HasNoOpToT r, ForbidNestedBigMaps (ToT r), WellTypedToT a) => IsoValue (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (View_ a r) :: T # Methods toVal :: View_ a r -> Value (ToT (View_ a r)) # fromVal :: Value (ToT (View_ a r)) -> View_ a r #
(HasNoOpToT r, ForbidNestedBigMaps (ToT r)) => Buildable (View_ () r) Source #
Instance details Defined in Lorentz.Macro Methods build :: View_ () r -> Doc buildList :: [View_ () r] -> Doc
(Buildable a, HasNoOpToT r, ForbidNestedBigMaps (ToT r)) => Buildable (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods build :: View_ a r -> Doc buildList :: [View_ a r] -> Doc
type Rep (View_ a r) Source #
Instance details Defined in Lorentz.Macro type Rep (View_ a r) = D1 ('MetaData "View_" "Lorentz.Macro" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "View_" 'PrefixI 'True) (S1 ('MetaSel ('Just "viewParam") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Just "viewCallbackTo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (ContractRef r))))
type AsRPC (View_ a r) Source #
Instance details Defined in Lorentz.Macro type AsRPC (View_ a r) = View_ (AsRPC a) r
type TypeDocFieldDescriptions (View_ a r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (View_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (View_ a r) Source #
Instance details Defined in Lorentz.Macro type ToT (View_ a r) = GValueType (GRep (View_ a r))

data Void_ (a :: Type) (b :: Type) Source #

void type synonym as described in A1.

Constructors

Void_
Fields voidParam :: a Entry point argument. voidResProxy :: Lambda b b Type of result reported via `failWith`.

Instances

Instances details

(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (Void_ a1 r1 :: Type) (Void_ a2 r2 :: Type) Source #
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (Void_ a1 r1) -> Proxy (Void_ a2 r2) -> () Source #
Generic (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (Void_ a b) :: Type -> Type # Methods from :: Void_ a b -> Rep (Void_ a b) x # to :: Rep (Void_ a b) x -> Void_ a b #
Show a => Show (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> Void_ a b -> ShowS # show :: Void_ a b -> String # showList :: [Void_ a b] -> ShowS #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Void_ a b)) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr a => HasRPCRepr (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type AsRPC (Void_ a r)
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (Void_ a r) :: FieldDescriptions # Methods typeDocName :: Proxy (Void_ a r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Void_ a r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Void_ a r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Void_ a r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Void_ a r) #
(WellTypedToT r, WellTypedToT a) => IsoValue (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (Void_ a r) :: T # Methods toVal :: Void_ a r -> Value (ToT (Void_ a r)) # fromVal :: Value (ToT (Void_ a r)) -> Void_ a r #
Buildable a => Buildable (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods build :: Void_ a b -> Doc buildList :: [Void_ a b] -> Doc
type Rep (Void_ a b) Source #
Instance details Defined in Lorentz.Macro type Rep (Void_ a b) = D1 ('MetaData "Void_" "Lorentz.Macro" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "Void_" 'PrefixI 'True) (S1 ('MetaSel ('Just "voidParam") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Just "voidResProxy") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Lambda b b))))
type AsRPC (Void_ a r) Source #
Instance details Defined in Lorentz.Macro type AsRPC (Void_ a r) = Void_ (AsRPC a) r
type TypeDocFieldDescriptions (Void_ a r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (Void_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Void_ a r) Source #
Instance details Defined in Lorentz.Macro type ToT (Void_ a r) = GValueType (GRep (Void_ a r))

newtype VoidResult r Source #

Newtype over void result type used in tests to distinguish successful void result from other errors.

Usage example: lExpectFailWith (== VoidResult roleMaster)`

This error is special - it can contain arguments of different types depending on entrypoint which raises it.

Constructors

VoidResult
Fields unVoidResult :: r

Instances

Instances details

Generic (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (VoidResult r) :: Type -> Type # Methods from :: VoidResult r -> Rep (VoidResult r) x # to :: Rep (VoidResult r) x -> VoidResult r #
Eq r => Eq (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Methods (==) :: VoidResult r -> VoidResult r -> Bool # (/=) :: VoidResult r -> VoidResult r -> Bool #
TypeHasDoc r => ErrorHasDoc (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ErrorRequirements (VoidResult r) Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements (VoidResult r)) Source #
(NiceConstant r, ErrorHasDoc (VoidResult r)) => IsError (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Methods errorToVal :: VoidResult r -> (forall (t :: T). ErrorScope t => Value t -> r0) -> r0 Source # errorFromVal :: forall (t :: T). SingI t => Value t -> Either Text (VoidResult r) Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError (VoidResult r) => VoidResult r -> s :-> t Source #
(TypeHasDoc r, IsError (VoidResult r)) => TypeHasDoc (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type TypeDocFieldDescriptions (VoidResult r) :: FieldDescriptions # Methods typeDocName :: Proxy (VoidResult r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (VoidResult r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (VoidResult r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (VoidResult r) # typeDocMichelsonRep :: TypeDocMichelsonRep (VoidResult r) #
(Bottom, WellTypedToT (VoidResult r), TypeError ('Text "No IsoValue instance for VoidResult " ':<>: 'ShowType r) :: Constraint) => IsoValue (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (VoidResult r) :: T # Methods toVal :: VoidResult r -> Value (ToT (VoidResult r)) # fromVal :: Value (ToT (VoidResult r)) -> VoidResult r #
type Rep (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type Rep (VoidResult r) = D1 ('MetaData "VoidResult" "Lorentz.Macro" "lorentz-0.16.0-inplace" 'True) (C1 ('MetaCons "VoidResult" 'PrefixI 'True) (S1 ('MetaSel ('Just "unVoidResult") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 r)))
type ErrorRequirements (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type ErrorRequirements (VoidResult r) = ()
type TypeDocFieldDescriptions (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (VoidResult r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type ToT (VoidResult r) = TypeError ('Text "No IsoValue instance for VoidResult " ':<>: 'ShowType r) :: T

data IDiv Source #

Michelson supports only EDiv, which gives both the quotient and the remainder for integers. For convenience, we also offer IDiv, which gives just the quotient.

Instances

Instances details

(ArithOpHs EDiv n d (Maybe (q, r)), mq ~ Maybe q, KnownValue q) => ArithOpHs IDiv n d mq Source #
Instance details Defined in Lorentz.Macro Methods evalArithOpHs :: forall (s :: [Type]). (n ': (d ': s)) :-> (mq ': s) Source #

data IMod Source #

Michelson supports only EDiv, which gives both the quotient and the remainder for integers. For convenience, we also offer IMod, which gives just the remainder.

Instances

Instances details

(ArithOpHs EDiv n d (Maybe (q, r)), mr ~ Maybe r, KnownValue r) => ArithOpHs IMod n d mr Source #
Instance details Defined in Lorentz.Macro Methods evalArithOpHs :: forall (s :: [Type]). (n ': (d ': s)) :-> (mr ': s) Source #

class (MemOp (ToT c), ToT (MemOpKeyHs c) ~ MemOpKey (ToT c)) => MemOpHs c Source #

Lifted MemOpKey.

Associated Types

type MemOpKeyHs c :: Type Source #

Instances

Instances details

NiceComparable e => MemOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) Source #
NiceComparable k => MemOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) Source #
NiceComparable k => MemOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (BigMap k v) Source #

class (MapOp (ToT c), ToT (MapOpInpHs c) ~ MapOpInp (ToT c), ToT (MapOpResHs c ()) ~ MapOpRes (ToT c) (ToT ())) => MapOpHs c Source #

Lifted MapOp.

Associated Types

type MapOpInpHs c :: Type Source #

type MapOpResHs c :: Type -> Type Source #

Instances

Instances details

MapOpHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Maybe e) Source # type MapOpResHs (Maybe e) :: Type -> Type Source #
MapOpHs [e] Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs [e] Source # type MapOpResHs [e] :: Type -> Type Source #
NiceComparable k => MapOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Map k v) Source # type MapOpResHs (Map k v) :: Type -> Type Source #

class (IterOp (ToT c), ToT (IterOpElHs c) ~ IterOpEl (ToT c)) => IterOpHs c Source #

Lifted IterOp.

Associated Types

type IterOpElHs c :: Type Source #

Instances

Instances details

NiceComparable e => IterOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) Source #
IterOpHs [e] Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs [e] Source #
NiceComparable k => IterOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) Source #

class SizeOp (ToT c) => SizeOpHs c Source #

Lifted SizeOp.

This could be just a constraint alias, but to avoid T types appearance in error messages we make a full type class with concrete instances.

Instances

Instances details

SizeOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs [a] Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic

class (UpdOp (ToT c), ToT (UpdOpKeyHs c) ~ UpdOpKey (ToT c), ToT (UpdOpParamsHs c) ~ UpdOpParams (ToT c)) => UpdOpHs c Source #

Lifted UpdOp.

Associated Types

type UpdOpKeyHs c :: Type Source #

type UpdOpParamsHs c :: Type Source #

Instances

Instances details

NiceComparable a => UpdOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Set a) Source # type UpdOpParamsHs (Set a) Source #
NiceComparable k => UpdOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Map k v) Source # type UpdOpParamsHs (Map k v) Source #
NiceComparable k => UpdOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (BigMap k v) Source # type UpdOpParamsHs (BigMap k v) Source #

class (GetOp (ToT c), ToT (GetOpKeyHs c) ~ GetOpKey (ToT c), ToT (GetOpValHs c) ~ GetOpVal (ToT c)) => GetOpHs c Source #

Lifted GetOp.

Associated Types

type GetOpKeyHs c :: Type Source #

type GetOpValHs c :: Type Source #

Instances

Instances details

NiceComparable k => GetOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (Map k v) Source # type GetOpValHs (Map k v) Source #
NiceComparable k => GetOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (BigMap k v) Source # type GetOpValHs (BigMap k v) Source #

class ConcatOp (ToT c) => ConcatOpHs c Source #

Lifted ConcatOp.

Instances

Instances details

ConcatOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
ConcatOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic

class SliceOp (ToT c) => SliceOpHs c Source #

Lifted SliceOp.

Instances

Instances details

SliceOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SliceOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic

type family IsoMapOpRes c b where ... Source #

A useful property which holds for reasonable MapOp instances.

It's a separate thing from MapOpHs because it mentions b type parameter.

Equations

IsoMapOpRes c b = ToT (MapOpResHs c b) ~ MapOpRes (ToT c) (ToT b)

data RangeBoundaryInclusion Source #

Whether to include boundary in Range

Constructors

IncludeBoundary
ExcludeBoundary

Instances

Instances details

(Bottom, TypeError ('Text "This function can't be used to check whenter a range with both boundaries excluded is empty") :: Constraint) => CanCheckEmpty 'ExcludeBoundary 'ExcludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'ExcludeBoundary 'IncludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'IncludeBoundary 'ExcludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'IncludeBoundary 'IncludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)

newtype RangeIE a Source #

Range inclusive in lower boundary, but exclusive in upper boundary.

Constructors

MkRangeIE (Range' 'IncludeBoundary 'ExcludeBoundary a)

Warning: Avoid using data constructors directly, use mkRange instead.

Instances

Instances details

KnownValue a => NiceRange RangeIE 'IncludeBoundary 'ExcludeBoundary a Source #
Instance details Defined in Lorentz.Range
Generic (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeIE a) :: Type -> Type # Methods from :: RangeIE a -> Rep (RangeIE a) x # to :: Rep (RangeIE a) x -> RangeIE a #
Show a => Show (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeIE a -> ShowS # show :: RangeIE a -> String # showList :: [RangeIE a] -> ShowS #
Eq a => Eq (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeIE a -> RangeIE a -> Bool # (/=) :: RangeIE a -> RangeIE a -> Bool #
HasAnnotation a => HasAnnotation (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeIE a)) Source # annOptions :: Maybe AnnOptions Source #
TypeHasDoc a => TypeHasDoc (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeIE a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeIE a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeIE a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeIE a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeIE a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeIE a) #
IsoValue a => IsoValue (RangeIE a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeIE a) :: T # Methods toVal :: RangeIE a -> Value (ToT (RangeIE a)) # fromVal :: Value (ToT (RangeIE a)) -> RangeIE a #
Buildable a => Buildable (RangeIE a) Source #
Instance details Defined in Lorentz.Range Methods build :: RangeIE a -> Doc buildList :: [RangeIE a] -> Doc
type Rep (RangeIE a) Source #
Instance details Defined in Lorentz.Range type Rep (RangeIE a)
type TypeDocFieldDescriptions (RangeIE a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeIE a)
type ToT (RangeIE a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeIE a) = GValueType (GRep (RangeIE a))

newtype RangeEI a Source #

Range exclusive in lower boundary, but inclusive in upper boundary.

Constructors

MkRangeEI (Range' 'ExcludeBoundary 'IncludeBoundary a)

Warning: Avoid using data constructors directly, use mkRange instead.

Instances

Instances details

KnownValue a => NiceRange RangeEI 'ExcludeBoundary 'IncludeBoundary a Source #
Instance details Defined in Lorentz.Range
Generic (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeEI a) :: Type -> Type # Methods from :: RangeEI a -> Rep (RangeEI a) x # to :: Rep (RangeEI a) x -> RangeEI a #
Show a => Show (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeEI a -> ShowS # show :: RangeEI a -> String # showList :: [RangeEI a] -> ShowS #
Eq a => Eq (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeEI a -> RangeEI a -> Bool # (/=) :: RangeEI a -> RangeEI a -> Bool #
HasAnnotation a => HasAnnotation (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeEI a)) Source # annOptions :: Maybe AnnOptions Source #
TypeHasDoc a => TypeHasDoc (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeEI a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeEI a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeEI a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeEI a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeEI a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeEI a) #
IsoValue a => IsoValue (RangeEI a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeEI a) :: T # Methods toVal :: RangeEI a -> Value (ToT (RangeEI a)) # fromVal :: Value (ToT (RangeEI a)) -> RangeEI a #
Buildable a => Buildable (RangeEI a) Source #
Instance details Defined in Lorentz.Range Methods build :: RangeEI a -> Doc buildList :: [RangeEI a] -> Doc
type Rep (RangeEI a) Source #
Instance details Defined in Lorentz.Range type Rep (RangeEI a)
type TypeDocFieldDescriptions (RangeEI a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeEI a)
type ToT (RangeEI a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeEI a) = GValueType (GRep (RangeEI a))

newtype RangeEE a Source #

Range exclusive in both boundaries.

Constructors

MkRangeEE (Range' 'ExcludeBoundary 'ExcludeBoundary a)

Warning: Avoid using data constructors directly, use mkRange instead.

Instances

Instances details

KnownValue a => NiceRange RangeEE 'ExcludeBoundary 'ExcludeBoundary a Source #
Instance details Defined in Lorentz.Range
Generic (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeEE a) :: Type -> Type # Methods from :: RangeEE a -> Rep (RangeEE a) x # to :: Rep (RangeEE a) x -> RangeEE a #
Show a => Show (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods showsPrec :: Int -> RangeEE a -> ShowS # show :: RangeEE a -> String # showList :: [RangeEE a] -> ShowS #
Eq a => Eq (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods (==) :: RangeEE a -> RangeEE a -> Bool # (/=) :: RangeEE a -> RangeEE a -> Bool #
HasAnnotation a => HasAnnotation (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (RangeEE a)) Source # annOptions :: Maybe AnnOptions Source #
TypeHasDoc a => TypeHasDoc (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeEE a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeEE a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeEE a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeEE a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeEE a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeEE a) #
IsoValue a => IsoValue (RangeEE a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeEE a) :: T # Methods toVal :: RangeEE a -> Value (ToT (RangeEE a)) # fromVal :: Value (ToT (RangeEE a)) -> RangeEE a #
Buildable a => Buildable (RangeEE a) Source #
Instance details Defined in Lorentz.Range Methods build :: RangeEE a -> Doc buildList :: [RangeEE a] -> Doc
type Rep (RangeEE a) Source #
Instance details Defined in Lorentz.Range type Rep (RangeEE a)
type TypeDocFieldDescriptions (RangeEE a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeEE a)
type ToT (RangeEE a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeEE a) = GValueType (GRep (RangeEE a))

data OnRangeAssertFailure a Source #

Specify on how to fail on range overflow or underflow in assertInRange_.

This expects two always-failing Lorentz functions, one will be called on underflow, another on overflow.

See customErrorORAF for a simpler helper to use with custom Lorentz errors.

See mkOnRangeAssertFailureSimple if you don't care about distinguishing underflow and overflow.

Constructors

OnRangeAssertFailure
Fields orafUnderflow :: forall s any. (RangeFailureInfo a : s) :-> any orafOverflow :: forall s any. (RangeFailureInfo a : s) :-> any

data RangeFailureInfo a Source #

Information about the range check failure

Constructors

RangeFailureInfo
Fields rfiInclusive :: Bool Whether the boundary is inclusive or not rfiBoundary :: a The boundary that failed to check rfiValue :: a The value that failed to check

Instances

Instances details

TypeHasFieldNamingStrategy (RangeFailureInfo a :: Type) Source #
Instance details Defined in Lorentz.Range Methods typeFieldNamingStrategy :: Text -> Text #
Generic (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type Rep (RangeFailureInfo a) :: Type -> Type # Methods from :: RangeFailureInfo a -> Rep (RangeFailureInfo a) x # to :: Rep (RangeFailureInfo a) x -> RangeFailureInfo a #
TypeHasDoc a => TypeHasDoc (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type TypeDocFieldDescriptions (RangeFailureInfo a) :: FieldDescriptions # Methods typeDocName :: Proxy (RangeFailureInfo a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (RangeFailureInfo a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (RangeFailureInfo a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (RangeFailureInfo a) # typeDocMichelsonRep :: TypeDocMichelsonRep (RangeFailureInfo a) #
IsoValue a => IsoValue (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range Associated Types type ToT (RangeFailureInfo a) :: T # Methods toVal :: RangeFailureInfo a -> Value (ToT (RangeFailureInfo a)) # fromVal :: Value (ToT (RangeFailureInfo a)) -> RangeFailureInfo a #
type Rep (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range type Rep (RangeFailureInfo a) = D1 ('MetaData "RangeFailureInfo" "Lorentz.Range" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "RangeFailureInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "rfiInclusive") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Bool) :: (S1 ('MetaSel ('Just "rfiBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :: S1 ('MetaSel ('Just "rfiValue") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a))))
type TypeDocFieldDescriptions (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeFailureInfo a) = '['("RangeFailureInfo", '('Nothing :: Maybe Symbol, '['("rfiInclusive", "Whether the boundary is inclusive or not"), '("rfiBoundary", "The boundary that failed to check"), '("rfiValue", "The value that failed to check")]))]
type ToT (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range type ToT (RangeFailureInfo a) = GValueType (GRep (RangeFailureInfo a))

class (DefaultToInclusive r, Typeable r) => RangeBoundary r where Source #

Helper class for RangeBoundaryInclusion.

Minimal complete definition

rangeParens, inRangeComp, inRangeComp_, rangeName, isInclusive

Methods

isInclusive :: Bool Source #

Value-level representation as Bool

Instances

Instances details

RangeBoundary 'ExcludeBoundary Source #
Instance details Defined in Lorentz.Range Methods rangeParens :: (Text, Text) inRangeComp :: Ord a => a -> a -> Bool inRangeComp_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s) rangeName :: Text isInclusive :: Bool Source #
RangeBoundary 'IncludeBoundary Source #
Instance details Defined in Lorentz.Range Methods rangeParens :: (Text, Text) inRangeComp :: Ord a => a -> a -> Bool inRangeComp_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s) rangeName :: Text isInclusive :: Bool Source #

class (RangeBoundary lower, RangeBoundary upper, ToT (range a) ~ ToT (a, a), KnownValue (range a), Coercible range (Range' lower upper)) => NiceRange range lower upper a | range -> lower upper, lower upper -> range Source #

Helper class for the Range types that encapsulates common features.

Instances

Instances details

KnownValue a => NiceRange Range 'IncludeBoundary 'IncludeBoundary a Source #
Instance details Defined in Lorentz.Range
KnownValue a => NiceRange RangeEE 'ExcludeBoundary 'ExcludeBoundary a Source #
Instance details Defined in Lorentz.Range
KnownValue a => NiceRange RangeEI 'ExcludeBoundary 'IncludeBoundary a Source #
Instance details Defined in Lorentz.Range
KnownValue a => NiceRange RangeIE 'IncludeBoundary 'ExcludeBoundary a Source #
Instance details Defined in Lorentz.Range

class CanCheckEmpty l u Source #

Helper class to check if a range is empty. Gives up when both boundaries are exclusive.

Minimal complete definition

checkEmpty, checkEmpty_

Instances

Instances details

(Bottom, TypeError ('Text "This function can't be used to check whenter a range with both boundaries excluded is empty") :: Constraint) => CanCheckEmpty 'ExcludeBoundary 'ExcludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'ExcludeBoundary 'IncludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'IncludeBoundary 'ExcludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)
CanCheckEmpty 'IncludeBoundary 'IncludeBoundary Source #
Instance details Defined in Lorentz.Range Methods checkEmpty :: Ord a => a -> a -> Bool checkEmpty_ :: forall a (s :: [Type]). NiceComparable a => (a ': (a ': s)) :-> (Bool ': s)

class IsCondition cond arg argl argr outb out where Source #

Everything that can be put after if keyword.

The first type argument stands for the condition type, and all other type arguments define stack types around/within the if then else construction. For semantics of each type argument see Condition.

Methods

ifThenElse :: cond -> (argl :-> outb) -> (argr :-> outb) -> arg :-> out Source #

Defines semantics of if ... then ... else ... construction.

Instances

Instances details

(i ~ arg, o ~ argl, o ~ argr, r ~ Bool, outb ~ out) => IsCondition (Expr i o r) arg argl argr outb out Source #	An expression producing `Bool` can be placed as condition to 'if'.
Instance details Defined in Lorentz.Expr Methods ifThenElse :: Expr i o r -> (argl :-> outb) -> (argr :-> outb) -> arg :-> out Source #
(arg ~ arg0, argl ~ argl0, argr ~ argr0, outb ~ outb0, out ~ out0) => IsCondition (Condition arg argl argr outb out) arg0 argl0 argr0 outb0 out0 Source #
Instance details Defined in Lorentz.Rebound Methods ifThenElse :: Condition arg argl argr outb out -> (argl0 :-> outb0) -> (argr0 :-> outb0) -> arg0 :-> out0 Source #

class st ~ (Head st ': Tail st) => DupT (a :: Type) (st :: [Type]) where Source #

Allows duplicating stack elements referring them by type.

>>> :{
dupSample1 :: [Integer, MText, ()] :-> [MText, Integer, MText, ()]
dupSample1 = dupT @MText
:}

>>> pretty $ dupSample1 # zipInstr -$ 123 ::: [mt|Hello|] ::: ()
Hello : 123 : Hello : ()

>>> :{
dupSample2 :: [Integer, MText, ()] :-> [MText, Integer, MText, ()]
dupSample2 = dupT
:}

>>> pretty $ dupSample2 # zipInstr -$ 123 ::: [mt|Hello|] ::: ()
Hello : 123 : Hello : ()

>>> :{
dupSampleErr1 :: '[] :-> a
dupSampleErr1 = dupT @Bool
:}
...
... • Element of type 'Bool' is not present on stack
...   '[]
...

>>> :{
-- Should fully infer both wildcards
dupSampleErr2 :: _ :-> [Bool, Integer, _, ()]
dupSampleErr2 = dupT
:}
...
... • Found type wildcard ‘_’
...    standing for ‘'[Integer, Bool, ()] :: [*]’
...
... • Found type wildcard ‘_’ standing for ‘Bool’
...   To use the inferred type, enable PartialTypeSignatures
...

>>> :{
-- Should fully infer both wildcards
_dupSampleErr3 :: [Integer, _, ()] :-> (Bool ': _)
_dupSampleErr3 = dupT
:}
...
... • Found type wildcard ‘_’ standing for ‘Bool’
...
... • Found type wildcard ‘_’
...     standing for ‘'[Integer, Bool, ()] :: [*]’
...

Methods

dupT :: st :-> (a : st) Source #

Duplicate an element of stack referring it by type.

If stack contains multiple entries of this type, compile error is raised.

Instances

Instances details

(EnsureElem a st, TheOnlyC (StackElemNotFound st a) (StackElemAmbiguous st a) (FindIndices (DefaultEqSym1 a) st) indexGHC, succ_index ~ 'S (ToPeano indexGHC), ConstraintDUPNLorentz succ_index st (a ': st) a, Dupable a) => DupT a st Source #
Instance details Defined in Lorentz.Referenced Methods dupT :: st :-> (a ': st) Source #

class dipInp ~ (a ': Tail dipInp) => DipT a inp dipInp dipOut out | inp a -> dipInp, dipOut inp a -> out, inp out a -> dipOut where Source #

Allows diving into stack referring expected new tip by type.

>>> :{
dipSample1
  :: [Natural, ()] :-> '[()]
  -> [Integer, MText, Natural, ()] :-> [Integer, MText, ()]
dipSample1 = dipT @Natural
:}

>>> pretty $ dipSample1 drop # zipInstr -$ 123 ::: [mt|Hello|] ::: 321 ::: ()
123 : Hello : ()

>>> :{
dipSample2
  :: [Natural, ()] :-> '[()]
  -> [Integer, MText, Natural, ()] :-> [Integer, MText, ()]
dipSample2 = dipT -- No type application needed
:}

>>> pretty $ dipSample2 drop # zipInstr -$ 123 ::: [mt|Hello|] ::: 321 ::: ()
123 : Hello : ()

>>> :{
-- An implementation of dropT that demands a bit more from inference.
dipSample3
  :: forall a inp dinp dout out.
     ( DipT a inp dinp dout out
     , dinp ~ (a ': dout)
     )
  => inp :-> out
dipSample3 = dipT (drop @a)
:}

>>> :{
pretty $ dipSample3 @Natural @'[Integer, MText, Natural, ()] # zipInstr
  -$ 123 ::: [mt|Hello|] ::: 321 ::: ()
:}
123 : Hello : ()

>>> :{
_dipSampleErr1
  :: [Natural, ()] :-> '[()]
  -> [Integer, MText, ()] :-> [Integer, MText, ()]
_dipSampleErr1 = dipT @Natural
:}
...
... • Element of type 'Natural' is not present on stack
...   '[Integer, MText, ()]
...

>>> :{
_dipSampleErr2
  :: [Natural, ()] :-> '[()]
  -> [Integer, MText, Natural, (), Natural] :-> [Integer, MText, ()]
_dipSampleErr2 = dipT @Natural
:}
...
... • Ambiguous reference to element of type 'Natural' for stack
...   '[Integer, MText, Natural, (), Natural]
...

>>> :{
_dipSampleErr3
  :: '[] :-> '[()]
  -> [Integer, MText, Natural, ()] :-> [Integer, MText, ()]
_dipSampleErr3 = dipT @Natural
:}
...
... • dipT requires a Lorentz instruction that takes input on the stack.
...

Methods

dipT :: (dipInp :-> dipOut) -> inp :-> out Source #

Dip down until an element of the given type is on top of the stack.

If the stack does not contain an element of this type, or contains more than one, then a compile-time error is raised.

Instances

Instances details

(dipInp ~ (a ': tail_dipInp), EnsureElem a inp, RequireNonEmpty ('Text "dipT requires a Lorentz instruction that takes input on the stack.") dipInp, TheOnlyC (StackElemNotFound inp a) (StackElemAmbiguous inp a) (FindIndices (DefaultEqSym1 a) inp) indexGHC, index ~ ToPeano indexGHC, ConstraintDIPNLorentz index inp out dipInp dipOut) => DipT a inp dipInp dipOut out Source #
Instance details Defined in Lorentz.Referenced Methods dipT :: (dipInp :-> dipOut) -> inp :-> out Source #

class HasNamedVar s name var | s name -> var Source #

Indicates that stack s contains a name :! var value.

Minimal complete definition

varPosition

Instances

Instances details

(Bottom, StackElemNotFound name :: Constraint, var ~ NamedVariableNotFound name) => HasNamedVar ('[] :: [Type]) name var Source #
Instance details Defined in Lorentz.ReferencedByName Methods varPosition :: VarPosition '[] name var
ElemHasNamedVar (ty ': s) name var (VarNamePretty ty == 'VarNamed name) => HasNamedVar (ty ': s) name var Source #
Instance details Defined in Lorentz.ReferencedByName Methods varPosition :: VarPosition (ty ': s) name var

type family HasNamedVars s vs where ... Source #

Version of HasNamedVar for multiple variables.

type HasContext = HasNamedVars s ["x" := Integer, "f" := Lambda MText MText]

Equations

HasNamedVars _ '[] = ()
HasNamedVars s ((n := ty) ': vs) = (HasNamedVar s n ty, HasNamedVars s vs)

type VarIsUnnamed x = VarName x ~ 'VarUnnamed Source #

Requires type x to be an unnamed variable.

When e.g. dupL sees a polymorphic variable, it can't judge whether is it a variable we are seeking for or not; VarIsUnnamed helps to assure the type system that given variable won't be named.

data CompilationOptions Source #

Options to control Lorentz to Michelson compilation.

Constructors

CompilationOptions
Fields coOptimizerConf :: Maybe OptimizerConf Config for Michelson optimizer. coStringTransformer :: (Bool, MText -> MText) Function to transform strings with. See `transformStringsLorentz`. coBytesTransformer :: (Bool, ByteString -> ByteString) Function to transform byte strings with. See `transformBytesLorentz`.

data ContractData cp st vd Source #

Code for a contract along with compilation options for the Lorentz compiler.

It is expected that a Contract is one packaged entity, wholly controlled by its author. Therefore the author should be able to set all options that control contract's behavior.

This helps ensure that a given contract will be interpreted in the same way in all environments, like production and testing.

Raw ContractCode should not be used for distribution of contracts.

Constructors

(NiceParameterFull cp, NiceStorageFull st, NiceViewsDescriptor vd) => ContractData
Fields cdCode :: ContractCode cp st The contract itself. cdViews :: Rec (ContractView st) (RevealViews vd) Contract views. cdCompilationOptions :: CompilationOptions General compilation options for the Lorentz compiler.

Instances

Instances details

ContainsDoc (ContractData cp st vd) Source #
Instance details Defined in Lorentz.Run Methods buildDocUnfinalized :: ContractData cp st vd -> ContractDoc #
ContainsUpdateableDoc (ContractData cp st vd) Source #
Instance details Defined in Lorentz.Run Methods modifyDocEntirely :: (SomeDocItem -> SomeDocItem) -> ContractData cp st vd -> ContractData cp st vd #

data ContractView st (v :: ViewTyInfo) where Source #

Single contract view.

Constructors

ContractView :: (KnownSymbol name, NiceViewable arg, NiceViewable ret, HasAnnotation arg, HasAnnotation ret) => ViewCode arg st ret -> ContractView st ('ViewTyInfo name arg ret)

data ZippedStackRepr a b Source #

A type used to represent a zipped stack of at least two elements, isomorphic to a pair and represented as such in Michelson.

Constructors

a ::: b infixr 5

Instances

Instances details

(CanCastTo a1 a2, CanCastTo b1 b2) => CanCastTo (ZippedStackRepr a1 b1 :: Type) (ZippedStackRepr a2 b2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ZippedStackRepr a1 b1) -> Proxy (ZippedStackRepr a2 b2) -> () Source #
Generic (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep (ZippedStackRepr a b) :: Type -> Type # Methods from :: ZippedStackRepr a b -> Rep (ZippedStackRepr a b) x # to :: Rep (ZippedStackRepr a b) x -> ZippedStackRepr a b #
(Show a, Show b) => Show (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods showsPrec :: Int -> ZippedStackRepr a b -> ShowS # show :: ZippedStackRepr a b -> String # showList :: [ZippedStackRepr a b] -> ShowS #
(Eq a, Eq b) => Eq (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool # (/=) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ZippedStackRepr a b)) Source # annOptions :: Maybe AnnOptions Source #
(IsoValue a, IsoValue b) => IsoValue (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT (ZippedStackRepr a b) :: T # Methods toVal :: ZippedStackRepr a b -> Value (ToT (ZippedStackRepr a b)) # fromVal :: Value (ToT (ZippedStackRepr a b)) -> ZippedStackRepr a b #
(Buildable a, Buildable b) => Buildable (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods build :: ZippedStackRepr a b -> Doc buildList :: [ZippedStackRepr a b] -> Doc
type Rep (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip type Rep (ZippedStackRepr a b) = D1 ('MetaData "ZippedStackRepr" "Lorentz.Zip" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons ":::" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 b)))
type ToT (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip type ToT (ZippedStackRepr a b) = GValueType (GRep (ZippedStackRepr a b))

data ZSNil Source #

A type used to represent an empty zipped stack, isomorphic to a unit and represented as such in Michelson.

Constructors

ZSNil

Instances

Instances details

Generic ZSNil Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep ZSNil :: Type -> Type # Methods from :: ZSNil -> Rep ZSNil x # to :: Rep ZSNil x -> ZSNil #
Show ZSNil Source #
Instance details Defined in Lorentz.Zip Methods showsPrec :: Int -> ZSNil -> ShowS # show :: ZSNil -> String # showList :: [ZSNil] -> ShowS #
Eq ZSNil Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZSNil -> ZSNil -> Bool # (/=) :: ZSNil -> ZSNil -> Bool #
HasAnnotation ZSNil Source #
Instance details Defined in Lorentz.Zip Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ZSNil) Source # annOptions :: Maybe AnnOptions Source #
IsoValue ZSNil Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT ZSNil :: T # Methods toVal :: ZSNil -> Value (ToT ZSNil) # fromVal :: Value (ToT ZSNil) -> ZSNil #
Buildable ZSNil Source #
Instance details Defined in Lorentz.Zip Methods build :: ZSNil -> Doc buildList :: [ZSNil] -> Doc
type Rep ZSNil Source #
Instance details Defined in Lorentz.Zip type Rep ZSNil = D1 ('MetaData "ZSNil" "Lorentz.Zip" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "ZSNil" 'PrefixI 'False) (U1 :: Type -> Type))
type ToT ZSNil Source #
Instance details Defined in Lorentz.Zip type ToT ZSNil = GValueType (GRep ZSNil)

type FieldRefKind = FieldRefTag -> Type Source #

Open kind for various field references.

The simplest field reference could be Label, pointing to a field by its name, but we also support more complex scenarios like deep fields identifiers.

data FieldRefTag Source #

Instances

Instances details

KnownFieldRef SelfRef Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject SelfRef = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject SelfRef p Source #
StoreHasField store SelfRef store Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store SelfRef store Source #
(StoreHasField store field substore, StoreHasField substore subfield ty, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters substore) => StoreHasField store (field :-\| subfield :: FieldRefTag -> Type) ty Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store (field :-\| subfield) ty Source #
(StoreHasField store field substore, StoreHasSubmap substore subfield key value, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters store, Dupable substore) => StoreHasSubmap store (field :-\| subfield :: FieldRefTag -> Type) key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps store (field :-\| subfield) key value Source #
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source #
KnownFieldRef (FieldAlias alias :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (FieldAlias alias) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (FieldAlias alias) p Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (BigMap key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key value) SelfRef key value Source #
FieldRefHasFinalName r => FieldRefHasFinalName (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefFinalName (l :-\| r) :: Symbol Source # Methods fieldRefFinalName :: FieldRef (l :-\| r) -> Label (FieldRefFinalName (l :-\| r)) Source #
(KnownFieldRef l, KnownFieldRef r) => KnownFieldRef (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (l :-\| r) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (l :-\| r) p Source #
type FieldRefObject SelfRef Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject SelfRef = SelfRef
type FieldRefObject (FieldAlias alias :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject (FieldAlias alias :: FieldRefTag -> Type) = FieldAlias alias
type FieldRefFinalName (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefFinalName (l :-\| r :: FieldRefTag -> Type) = FieldRefFinalName r
type FieldRefObject (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject (l :-\| r :: FieldRefTag -> Type) = l :-\| r

class KnownFieldRef (ty :: k) where Source #

For a type-level field reference - an associated term-level representation.

This is similar to singletons Sing + SingI pair but has small differences:

Dedicated to field references, thus term-level thing has FieldRefKind kind.
The type of term-level value (FieldRefObject ty) determines the kind of the reference type.

Associated Types

type FieldRefObject ty = (fr :: FieldRefKind) | fr -> ty Source #

Methods

mkFieldRef :: FieldRefObject ty p Source #

Instances

Instances details

KnownSymbol name => KnownFieldRef (name :: Symbol) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject name = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject name p Source #
KnownFieldRef SelfRef Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject SelfRef = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject SelfRef p Source #
KnownFieldRef (FieldAlias alias :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (FieldAlias alias) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (FieldAlias alias) p Source #
(KnownFieldRef l, KnownFieldRef r) => KnownFieldRef (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (l :-\| r) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (l :-\| r) p Source #

type FieldRef name = FieldRefObject name 'FieldRefTag Source #

Some kind of reference to a field.

The idea behind this type is that in trivial case (name :: Symbol) it can be instantiated with a mere label, but it is generic enough to allow complex field references as well.

type FieldSymRef name = FieldRef (name :: Symbol) Source #

Version of FieldRef restricted to symbolic labels.

FieldSymRef name ≡ FieldName name 'FieldRefTag

class FieldRefHasFinalName fr where Source #

Provides access to the direct name of the referred field.

This is used in stToFieldNamed.

Associated Types

type FieldRefFinalName fr :: Symbol Source #

Methods

fieldRefFinalName :: FieldRef fr -> Label (FieldRefFinalName fr) Source #

Instances

Instances details

FieldRefHasFinalName (name :: Symbol) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefFinalName name :: Symbol Source # Methods fieldRefFinalName :: FieldRef name -> Label (FieldRefFinalName name) Source #
FieldRefHasFinalName r => FieldRefHasFinalName (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefFinalName (l :-\| r) :: Symbol Source # Methods fieldRefFinalName :: FieldRef (l :-\| r) -> Label (FieldRefFinalName (l :-\| r)) Source #

class StoreHasField store fname ftype | store fname -> ftype where Source #

Provides operations on fields for storage.

Methods

storeFieldOps :: StoreFieldOps store fname ftype Source #

Instances

Instances details

HasFieldOfType store fname ftype => StoreHasField store (fname :: Symbol) ftype Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store fname ftype Source #
StoreHasField store SelfRef store Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store SelfRef store Source #
(StoreHasField store field substore, StoreHasField substore subfield ty, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters substore) => StoreHasField store (field :-\| subfield :: FieldRefTag -> Type) ty Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store (field :-\| subfield) ty Source #

data StoreFieldOps store fname ftype Source #

Datatype containing the full implementation of StoreHasField typeclass.

We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the DerivingVia extension.)

Constructors

StoreFieldOps

Fields

sopToField :: forall s. FieldRef fname -> (store : s) :-> (ftype : s)
sopGetFieldOpen :: forall res s. HasDupableGetters store => ('[ftype] :-> '[res, ftype]) -> ('[ftype] :-> '[res]) -> FieldRef fname -> (store : s) :-> (res : (store : s))
See getFieldOpen for explanation of the signature.
sopSetFieldOpen :: forall new s. ('[new, ftype] :-> '[ftype]) -> FieldRef fname -> (new : (store : s)) :-> (store : s)
See setFieldOpen for explanation of the signature.

class StoreHasSubmap store mname key value | store mname -> key value where Source #

Provides operations on submaps of storage.

Methods

storeSubmapOps :: StoreSubmapOps store mname key value Source #

Instances

Instances details

(StoreHasField store name submap, StoreHasSubmap submap SelfRef key value, KnownSymbol name, HasDupableGetters store, Dupable submap) => StoreHasSubmap store (name :: Symbol) key value Source #	Provides access to the submap via the respective field. Tricky storages that consolidate submaps in a non-trivial way can define instances overlapping this one.
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps store name key value Source #
(StoreHasField store field substore, StoreHasSubmap substore subfield key value, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters store, Dupable substore) => StoreHasSubmap store (field :-\| subfield :: FieldRefTag -> Type) key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps store (field :-\| subfield) key value Source #
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (BigMap key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key value) SelfRef key value Source #

data StoreSubmapOps store mname key value Source #

Datatype containing the full implementation of StoreHasSubmap typeclass.

We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the DerivingVia extension.)

Constructors

StoreSubmapOps

Fields

sopMem :: forall s. FieldRef mname -> (key : (store : s)) :-> (Bool : s)
sopGet :: forall s. KnownValue value => FieldRef mname -> (key : (store : s)) :-> (Maybe value : s)
sopUpdate :: forall s. FieldRef mname -> (key : (Maybe value : (store : s))) :-> (store : s)
sopGetAndUpdate :: forall s. FieldRef mname -> (key : (Maybe value : (store : s))) :-> (Maybe value : (store : s))
sopDelete :: forall s. FieldRef mname -> (key : (store : s)) :-> (store : s)
sopInsert :: forall s. FieldRef mname -> (key : (value : (store : s))) :-> (store : s)

class StoreHasEntrypoint store epName epParam epStore | store epName -> epParam epStore where Source #

Provides operations on stored entrypoints.

store is the storage containing both the entrypoint epName (note: it has to be in a BigMap to take advantage of lazy evaluation) and the epStore field this operates on.

Methods

storeEpOps :: StoreEntrypointOps store epName epParam epStore Source #

data StoreEntrypointOps store epName epParam epStore Source #

Datatype containing the full implementation of StoreHasEntrypoint typeclass.

We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the DerivingVia extension.)

Constructors

StoreEntrypointOps
Fields sopToEpLambda :: forall s. Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : s) sopSetEpLambda :: forall s. HasDupableGetters store => Label epName -> (EntrypointLambda epParam epStore : (store : s)) :-> (store : s) sopToEpStore :: forall s. Label epName -> (store : s) :-> (epStore : s) sopSetEpStore :: forall s. Label epName -> (epStore : (store : s)) :-> (store : s)

type EntrypointLambda param store = Lambda (param, store) ([Operation], store) Source #

Type synonym for a Lambda that can be used as an entrypoint

type EntrypointsField param store = BigMap MText (EntrypointLambda param store) Source #

Type synonym of a BigMap mapping MText (entrypoint names) to EntrypointLambda.

This is useful when defining instances of StoreHasEntrypoint as a storage field containing one or more entrypoints (lambdas) of the same type.

data param ::-> store infix 9 Source #

Indicates a stored entrypoint with the given param and store types.

type family StorageContains store (content :: [NamedField]) :: Constraint where ... Source #

Concise way to write down constraints with expected content of a storage.

Use it like follows:

type StorageConstraint store = StorageContains store
  [ "fieldInt" := Int
  , "fieldNat" := Nat
  , "epsToNat" := Int ::-> Nat
  , "balances" := Address ~> Int
  ]

Note that this won't work with complex field references, they have to be included using e.g. StoreHasField manually.

Equations

StorageContains _ '[] = ()
StorageContains store ((n := Identity ty) ': ct) = (StoreHasField store n ty, StorageContains store ct)
StorageContains store ((n := (k ~> v)) ': ct) = (StoreHasSubmap store n k v, StorageContains store ct)
StorageContains store ((n := (ep ::-> es)) ': ct) = (StoreHasEntrypoint store n ep es, StorageContains store ct)
StorageContains store ((n := ty) ': ct) = (StoreHasField store n ty, StorageContains store ct)

data ((l :: k1) :-| (r :: k2)) (p :: FieldRefTag) infixr 8 Source #

Refer to a nested entry in storage.

Example: stToField (#a :-| #b) fetches field b in the type under field a.

If this syntax seems overly verbose, you can try using OverloadedRecordDot. See module documentation for comments on that.

Constructors

(FieldRef l) :-| (FieldRef r) infixr 8

Instances

Instances details

(KnownSymbol field, y ~ FieldRefObject ((l :-\| r) :-\| field), p ~ 'FieldRefTag) => HasField (field :: Symbol) ((l :-\| r) p) (y p) Source #
Instance details Defined in Lorentz.StoreClass Methods getField :: (l :-\| r) p -> y p #
(StoreHasField store field substore, StoreHasField substore subfield ty, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters substore) => StoreHasField store (field :-\| subfield :: FieldRefTag -> Type) ty Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store (field :-\| subfield) ty Source #
(StoreHasField store field substore, StoreHasSubmap substore subfield key value, KnownFieldRef field, KnownFieldRef subfield, HasDupableGetters store, Dupable substore) => StoreHasSubmap store (field :-\| subfield :: FieldRefTag -> Type) key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps store (field :-\| subfield) key value Source #
FieldRefHasFinalName r => FieldRefHasFinalName (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefFinalName (l :-\| r) :: Symbol Source # Methods fieldRefFinalName :: FieldRef (l :-\| r) -> Label (FieldRefFinalName (l :-\| r)) Source #
(KnownFieldRef l, KnownFieldRef r) => KnownFieldRef (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (l :-\| r) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (l :-\| r) p Source #
type FieldRefFinalName (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefFinalName (l :-\| r :: FieldRefTag -> Type) = FieldRefFinalName r
type FieldRefObject (l :-\| r :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject (l :-\| r :: FieldRefTag -> Type) = l :-\| r

data SelfRef (p :: FieldRefTag) Source #

Refer to no particular field, access itself.

Constructors

SelfRef

Instances

Instances details

(KnownSymbol field, y ~ FieldRefObject (SelfRef :-\| field), p ~ 'FieldRefTag) => HasField (field :: Symbol) (SelfRef p) (y p) Source #
Instance details Defined in Lorentz.StoreClass Methods getField :: SelfRef p -> y p #
KnownFieldRef SelfRef Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject SelfRef = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject SelfRef p Source #
StoreHasField store SelfRef store Source #
Instance details Defined in Lorentz.StoreClass Methods storeFieldOps :: StoreFieldOps store SelfRef store Source #
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source #
(NiceComparable key, KnownValue value) => StoreHasSubmap (BigMap key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key value) SelfRef key value Source #
type FieldRefObject SelfRef Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject SelfRef = SelfRef

data FieldAlias (alias :: k) (p :: FieldRefTag) Source #

Alias for a field reference.

This allows creating _custom_ field references; you will have to define the respective StoreHasField and StoreHasSubmap instances manually. Since this type occupies a different "namespace" than string labels and :-|, no overlappable instances will be necessary.

Example:

-- Shortcut for a deeply nested field X
data FieldX

instance StoreHasField Storage (FieldAlias FieldX) Integer where
  ...

accessX = stToField (stAlias @FieldX)

Note that alias type argument allows instantiations of any kind.

Instances

Instances details

KnownFieldRef (FieldAlias alias :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass Associated Types type FieldRefObject (FieldAlias alias) = (fr :: FieldRefKind) Source # Methods mkFieldRef :: forall (p :: FieldRefTag). FieldRefObject (FieldAlias alias) p Source #
type FieldRefObject (FieldAlias alias :: FieldRefTag -> Type) Source #
Instance details Defined in Lorentz.StoreClass type FieldRefObject (FieldAlias alias :: FieldRefTag -> Type) = FieldAlias alias

type FieldNickname alias = FieldAlias (alias :: Symbol) Source #

Kind-restricted version of FieldAlias to work solely with string labels.

type EntrypointKind = (Symbol, Type) Source #

An entrypoint is described by two types: its name and type of argument.

data ConstrainedSome (c :: Type -> Constraint) where Source #

This type can store any value that satisfies a certain constraint.

Constructors

ConstrainedSome :: c a => a -> ConstrainedSome c

Instances

Instances details

Show (ConstrainedSome Show) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> ConstrainedSome Show -> ShowS # show :: ConstrainedSome Show -> String # showList :: [ConstrainedSome Show] -> ShowS #
Buildable (ConstrainedSome Buildable) Source #
Instance details Defined in Lorentz.UParam Methods build :: ConstrainedSome Buildable -> Doc buildList :: [ConstrainedSome Buildable] -> Doc

class UnpackUParam (c :: Type -> Constraint) entries where Source #

This class is needed to implement unpackUParam.

Methods

unpackUParam :: UParam entries -> Either EntrypointLookupError (MText, ConstrainedSome c) Source #

Turn UParam into a Haskell value. Since we don't know its type in compile time, we have to erase it using ConstrainedSome. The user of this function can require arbitrary constraint to hold (depending on how they want to use the result).

Instances

Instances details

UnpackUParam c ('[] :: [EntrypointKind]) Source #
Instance details Defined in Lorentz.UParam Methods unpackUParam :: UParam '[] -> Either EntrypointLookupError (MText, ConstrainedSome c) Source #
(KnownSymbol name, UnpackUParam c entries, NiceUnpackedValue arg, c arg) => UnpackUParam c ((name ?: arg) ': entries) Source #
Instance details Defined in Lorentz.UParam Methods unpackUParam :: UParam ((name ?: arg) ': entries) -> Either EntrypointLookupError (MText, ConstrainedSome c) Source #

type SomeInterface = '['("SomeEntrypoints", Void)] Source #

Pseudo value for UParam type variable.

type UParam_ = UParam SomeInterface Source #

Homomorphic version of UParam, forgets the exact interface.

type EntrypointsImpl inp out entries = Rec (CaseClauseU inp out) entries Source #

Implementations of some entry points.

Note that this thing inherits properties of Rec, e.g. you can Data.Vinyl.Core.rappend implementations for two entrypoint sets when assembling scattered parts of a contract.

type UParamFallback inp out = ((MText, ByteString) : inp) :-> out Source #

An action invoked when user-provided entrypoint is not found.

data EntrypointLookupError Source #

Constructors

NoSuchEntrypoint MText
ArgumentUnpackFailed

Instances

Instances details

Generic EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep EntrypointLookupError :: Type -> Type # Methods from :: EntrypointLookupError -> Rep EntrypointLookupError x # to :: Rep EntrypointLookupError x -> EntrypointLookupError #
Show EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> EntrypointLookupError -> ShowS # show :: EntrypointLookupError -> String # showList :: [EntrypointLookupError] -> ShowS #
Eq EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods (==) :: EntrypointLookupError -> EntrypointLookupError -> Bool # (/=) :: EntrypointLookupError -> EntrypointLookupError -> Bool #
Buildable EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods build :: EntrypointLookupError -> Doc buildList :: [EntrypointLookupError] -> Doc
type Rep EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam type Rep EntrypointLookupError = D1 ('MetaData "EntrypointLookupError" "Lorentz.UParam" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "NoSuchEntrypoint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 MText)) :+: C1 ('MetaCons "ArgumentUnpackFailed" 'PrefixI 'False) (U1 :: Type -> Type))

class CaseUParam (entries :: [EntrypointKind]) Source #

Make up a "case" over entry points.

Minimal complete definition

unsafeCaseUParam

Instances

Instances details

CaseUParam ('[] :: [EntrypointKind]) Source #
Instance details Defined in Lorentz.UParam Methods unsafeCaseUParam :: forall (inp :: [Type]) (out :: [Type]). Rec (CaseClauseU inp out) '[] -> UParamFallback inp out -> (UParam '[] ': inp) :-> out
(KnownSymbol name, CaseUParam entries, Typeable entries, NiceUnpackedValue arg) => CaseUParam ((name ?: arg) ': entries) Source #
Instance details Defined in Lorentz.UParam Methods unsafeCaseUParam :: forall (inp :: [Type]) (out :: [Type]). Rec (CaseClauseU inp out) ((name ?: arg) ': entries) -> UParamFallback inp out -> (UParam ((name ?: arg) ': entries) ': inp) :-> out

type family LookupEntrypoint (name :: Symbol) (entries :: [EntrypointKind]) :: Type where ... Source #

Get type of entrypoint argument by its name.

Equations

LookupEntrypoint name ('(name, a) ': _) = a
LookupEntrypoint name (_ ': entries) = LookupEntrypoint name entries
LookupEntrypoint name '[] = TypeError (('Text "Entry point " ':<>: 'ShowType name) ':<>: 'Text " in not in the entry points list")

type family RequireUniqueEntrypoints (entries :: [EntrypointKind]) :: Constraint where ... Source #

Ensure that given entry points do no contain duplicated names.

Equations

RequireUniqueEntrypoints entries = RequireAllUnique "entrypoint" (Eval (Map Fst entries))

type UParamLinearize p = (NiceGeneric p, GUParamLinearize (GRep p)) Source #

Constraint required by uparamFromAdt.

type UParamLinearized p = GUParamLinearized (GRep p) Source #

Entry points template derived from given ADT sum.

type WellTypedToT a = (IsoValue a, WellTyped (ToT a)) #

data Mutez #

Instances

Instances details

FromJSON Mutez
Instance details Defined in Morley.Tezos.Core Methods parseJSON :: Value -> Parser Mutez # parseJSONList :: Value -> Parser [Mutez] #
ToJSON Mutez
Instance details Defined in Morley.Tezos.Core Methods toJSON :: Mutez -> Value # toEncoding :: Mutez -> Encoding # toJSONList :: [Mutez] -> Value # toEncodingList :: [Mutez] -> Encoding #
Bounded Mutez
Instance details Defined in Morley.Tezos.Core Methods minBound :: Mutez # maxBound :: Mutez #
Enum Mutez
Instance details Defined in Morley.Tezos.Core Methods succ :: Mutez -> Mutez # pred :: Mutez -> Mutez # toEnum :: Int -> Mutez # fromEnum :: Mutez -> Int # enumFrom :: Mutez -> [Mutez] # enumFromThen :: Mutez -> Mutez -> [Mutez] # enumFromTo :: Mutez -> Mutez -> [Mutez] # enumFromThenTo :: Mutez -> Mutez -> Mutez -> [Mutez] #
Generic Mutez
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Mutez :: Type -> Type # Methods from :: Mutez -> Rep Mutez x # to :: Rep Mutez x -> Mutez #
Show Mutez
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Mutez -> ShowS # show :: Mutez -> String # showList :: [Mutez] -> ShowS #
NFData Mutez
Instance details Defined in Morley.Tezos.Core Methods rnf :: Mutez -> () #
Eq Mutez
Instance details Defined in Morley.Tezos.Core Methods (==) :: Mutez -> Mutez -> Bool # (/=) :: Mutez -> Mutez -> Bool #
Ord Mutez
Instance details Defined in Morley.Tezos.Core Methods compare :: Mutez -> Mutez -> Ordering # (<) :: Mutez -> Mutez -> Bool # (<=) :: Mutez -> Mutez -> Bool # (>) :: Mutez -> Mutez -> Bool # (>=) :: Mutez -> Mutez -> Bool # max :: Mutez -> Mutez -> Mutez # min :: Mutez -> Mutez -> Mutez #
HasAnnotation Mutez Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Mutez) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Mutez
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Mutez
TypeHasDoc Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Mutez :: FieldDescriptions # Methods typeDocName :: Proxy Mutez -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Mutez -> WithinParens -> Markdown # typeDocDependencies :: Proxy Mutez -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Mutez # typeDocMichelsonRep :: TypeDocMichelsonRep Mutez #
IsoValue Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
HasCLReader Mutez
Instance details Defined in Morley.Tezos.Core Methods getReader :: ReadM Mutez getMetavar :: String
Buildable Mutez
Instance details Defined in Morley.Tezos.Core Methods build :: Mutez -> Doc buildList :: [Mutez] -> Doc
r ~ Mutez => ArithOpHs Add Mutez Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Maybe (Natural, Mutez) => ArithOpHs EDiv Mutez Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Maybe (Mutez, Mutez) => ArithOpHs EDiv Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Natural Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Mutez ': s)) :-> (r ': s) Source #
type Rep Mutez
Instance details Defined in Morley.Tezos.Core type Rep Mutez = D1 ('MetaData "Mutez" "Morley.Tezos.Core" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "UnsafeMutez" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMutez") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Word63)))
type AsRPC Mutez
Instance details Defined in Morley.AsRPC type AsRPC Mutez = Mutez
type TypeDocFieldDescriptions Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Mutez = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Mutez = 'TMutez

data Timestamp #

Instances

Instances details

FromJSON Timestamp
Instance details Defined in Morley.Tezos.Core Methods parseJSON :: Value -> Parser Timestamp # parseJSONList :: Value -> Parser [Timestamp] #
ToJSON Timestamp
Instance details Defined in Morley.Tezos.Core Methods toJSON :: Timestamp -> Value # toEncoding :: Timestamp -> Encoding # toJSONList :: [Timestamp] -> Value # toEncodingList :: [Timestamp] -> Encoding #
Data Timestamp
Instance details Defined in Morley.Tezos.Core Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Timestamp -> c Timestamp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Timestamp # toConstr :: Timestamp -> Constr # dataTypeOf :: Timestamp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Timestamp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Timestamp) # gmapT :: (forall b. Data b => b -> b) -> Timestamp -> Timestamp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Timestamp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Timestamp -> r # gmapQ :: (forall d. Data d => d -> u) -> Timestamp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Timestamp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp #
Generic Timestamp
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Timestamp :: Type -> Type # Methods from :: Timestamp -> Rep Timestamp x # to :: Rep Timestamp x -> Timestamp #
Show Timestamp
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Timestamp -> ShowS # show :: Timestamp -> String # showList :: [Timestamp] -> ShowS #
NFData Timestamp
Instance details Defined in Morley.Tezos.Core Methods rnf :: Timestamp -> () #
Eq Timestamp
Instance details Defined in Morley.Tezos.Core Methods (==) :: Timestamp -> Timestamp -> Bool # (/=) :: Timestamp -> Timestamp -> Bool #
Ord Timestamp
Instance details Defined in Morley.Tezos.Core Methods compare :: Timestamp -> Timestamp -> Ordering # (<) :: Timestamp -> Timestamp -> Bool # (<=) :: Timestamp -> Timestamp -> Bool # (>) :: Timestamp -> Timestamp -> Bool # (>=) :: Timestamp -> Timestamp -> Bool # max :: Timestamp -> Timestamp -> Timestamp # min :: Timestamp -> Timestamp -> Timestamp #
HasAnnotation Timestamp Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Timestamp) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Timestamp
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Timestamp
TypeHasDoc Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Timestamp :: FieldDescriptions # Methods typeDocName :: Proxy Timestamp -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Timestamp -> WithinParens -> Markdown # typeDocDependencies :: Proxy Timestamp -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Timestamp # typeDocMichelsonRep :: TypeDocMichelsonRep Timestamp #
IsoValue Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
Buildable Timestamp
Instance details Defined in Morley.Tezos.Core Methods build :: Timestamp -> Doc buildList :: [Timestamp] -> Doc
r ~ Timestamp => ArithOpHs Add Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Integer Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Timestamp Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Sub Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
type Rep Timestamp
Instance details Defined in Morley.Tezos.Core type Rep Timestamp = D1 ('MetaData "Timestamp" "Morley.Tezos.Core" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "Timestamp" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTimestamp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 POSIXTime)))
type AsRPC Timestamp
Instance details Defined in Morley.AsRPC type AsRPC Timestamp = Timestamp
type TypeDocFieldDescriptions Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Timestamp = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Timestamp = 'TTimestamp

data ChainId #

Instances

Instances details

FromJSON ChainId
Instance details Defined in Morley.Tezos.Core Methods parseJSON :: Value -> Parser ChainId # parseJSONList :: Value -> Parser [ChainId] #
ToJSON ChainId
Instance details Defined in Morley.Tezos.Core Methods toJSON :: ChainId -> Value # toEncoding :: ChainId -> Encoding # toJSONList :: [ChainId] -> Value # toEncodingList :: [ChainId] -> Encoding #
Generic ChainId
Instance details Defined in Morley.Tezos.Core Associated Types type Rep ChainId :: Type -> Type # Methods from :: ChainId -> Rep ChainId x # to :: Rep ChainId x -> ChainId #
Show ChainId
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> ChainId -> ShowS # show :: ChainId -> String # showList :: [ChainId] -> ShowS #
NFData ChainId
Instance details Defined in Morley.Tezos.Core Methods rnf :: ChainId -> () #
Eq ChainId
Instance details Defined in Morley.Tezos.Core Methods (==) :: ChainId -> ChainId -> Bool # (/=) :: ChainId -> ChainId -> Bool #
Ord ChainId
Instance details Defined in Morley.Tezos.Core Methods compare :: ChainId -> ChainId -> Ordering # (<) :: ChainId -> ChainId -> Bool # (<=) :: ChainId -> ChainId -> Bool # (>) :: ChainId -> ChainId -> Bool # (>=) :: ChainId -> ChainId -> Bool # max :: ChainId -> ChainId -> ChainId # min :: ChainId -> ChainId -> ChainId #
HasAnnotation ChainId Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ChainId) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr ChainId
Instance details Defined in Morley.AsRPC Associated Types type AsRPC ChainId
TypeHasDoc ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ChainId :: FieldDescriptions # Methods typeDocName :: Proxy ChainId -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ChainId -> WithinParens -> Markdown # typeDocDependencies :: Proxy ChainId -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ChainId # typeDocMichelsonRep :: TypeDocMichelsonRep ChainId #
IsoValue ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
Buildable ChainId
Instance details Defined in Morley.Tezos.Core Methods build :: ChainId -> Doc buildList :: [ChainId] -> Doc
type Rep ChainId
Instance details Defined in Morley.Tezos.Core type Rep ChainId = D1 ('MetaData "ChainId" "Morley.Tezos.Core" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "UnsafeChainId" 'PrefixI 'True) (S1 ('MetaSel ('Just "unChainId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ByteString)))
type AsRPC ChainId
Instance details Defined in Morley.AsRPC type AsRPC ChainId = ChainId
type TypeDocFieldDescriptions ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ChainId = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ChainId = 'TChainId

type KeyHash = Hash 'HashKindPublicKey #

data Bls12381Fr #

Instances

Instances details

Bounded Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods minBound :: Bls12381Fr # maxBound :: Bls12381Fr #
Enum Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods succ :: Bls12381Fr -> Bls12381Fr # pred :: Bls12381Fr -> Bls12381Fr # toEnum :: Int -> Bls12381Fr # fromEnum :: Bls12381Fr -> Int # enumFrom :: Bls12381Fr -> [Bls12381Fr] # enumFromThen :: Bls12381Fr -> Bls12381Fr -> [Bls12381Fr] # enumFromTo :: Bls12381Fr -> Bls12381Fr -> [Bls12381Fr] # enumFromThenTo :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr -> [Bls12381Fr] #
Num Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (+) :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # (-) :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # (*) :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # negate :: Bls12381Fr -> Bls12381Fr # abs :: Bls12381Fr -> Bls12381Fr # signum :: Bls12381Fr -> Bls12381Fr # fromInteger :: Integer -> Bls12381Fr #
Fractional Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (/) :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # recip :: Bls12381Fr -> Bls12381Fr # fromRational :: Rational -> Bls12381Fr #
Integral Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods quot :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # rem :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # div :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # mod :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # quotRem :: Bls12381Fr -> Bls12381Fr -> (Bls12381Fr, Bls12381Fr) # divMod :: Bls12381Fr -> Bls12381Fr -> (Bls12381Fr, Bls12381Fr) # toInteger :: Bls12381Fr -> Integer #
Real Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods toRational :: Bls12381Fr -> Rational #
Show Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381Fr -> ShowS # show :: Bls12381Fr -> String # showList :: [Bls12381Fr] -> ShowS #
NFData Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods rnf :: Bls12381Fr -> () #
Eq Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381Fr -> Bls12381Fr -> Bool # (/=) :: Bls12381Fr -> Bls12381Fr -> Bool #
Ord Bls12381Fr
Instance details 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 #
ToIntegerArithOpHs Bls12381Fr Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (Bls12381Fr ': s) :-> (Integer ': s) Source #
HasRPCRepr Bls12381Fr
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Bls12381Fr
IsoValue Bls12381Fr
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381Fr :: T # Methods toVal :: Bls12381Fr -> Value (ToT Bls12381Fr) # fromVal :: Value (ToT Bls12381Fr) -> Bls12381Fr #
CurveObject Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods zero :: Bls12381Fr negate :: Bls12381Fr -> Bls12381Fr add :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr generate :: MonadRandom m => m Bls12381Fr fromMichelsonBytes :: ByteString -> Either DeserializationError Bls12381Fr toMichelsonBytes :: Bls12381Fr -> ByteString
UnaryArithOpHs Neg Bls12381Fr Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381Fr Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': s) :-> (UnaryArithResHs Neg Bls12381Fr ': s) Source #
MultiplyPoint Bls12381Fr Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Bls12381Fr -> Bls12381G1 -> Bls12381G1
MultiplyPoint Bls12381Fr Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Bls12381Fr -> Bls12381G2 -> Bls12381G2
r ~ Bls12381Fr => ArithOpHs Add Bls12381Fr Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381Fr Bls12381G1 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G1 ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381Fr Bls12381G2 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G2 ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Integer ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381G1 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381G2 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Integer Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Natural Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Bls12381Fr ': s)) :-> (r ': s) Source #
type AsRPC Bls12381Fr
Instance details Defined in Morley.AsRPC type AsRPC Bls12381Fr = Bls12381Fr
type ToT Bls12381Fr
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381Fr = 'TBls12381Fr
type UnaryArithResHs Neg Bls12381Fr Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Bls12381Fr = Bls12381Fr

data Bls12381G1 #

Instances

Instances details

Show Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G1 -> ShowS # show :: Bls12381G1 -> String # showList :: [Bls12381G1] -> ShowS #
NFData Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods rnf :: Bls12381G1 -> () #
Eq Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G1 -> Bls12381G1 -> Bool # (/=) :: Bls12381G1 -> Bls12381G1 -> Bool #
HasRPCRepr Bls12381G1
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Bls12381G1
IsoValue Bls12381G1
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G1 :: T # Methods toVal :: Bls12381G1 -> Value (ToT Bls12381G1) # fromVal :: Value (ToT Bls12381G1) -> Bls12381G1 #
CurveObject Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods zero :: Bls12381G1 negate :: Bls12381G1 -> Bls12381G1 add :: Bls12381G1 -> Bls12381G1 -> Bls12381G1 generate :: MonadRandom m => m Bls12381G1 fromMichelsonBytes :: ByteString -> Either DeserializationError Bls12381G1 toMichelsonBytes :: Bls12381G1 -> ByteString
UnaryArithOpHs Neg Bls12381G1 Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381G1 Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': s) :-> (UnaryArithResHs Neg Bls12381G1 ': s) Source #
MultiplyPoint Bls12381Fr Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Bls12381Fr -> Bls12381G1 -> Bls12381G1
MultiplyPoint Integer Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G1 -> Bls12381G1
r ~ Bls12381G1 => ArithOpHs Add Bls12381G1 Bls12381G1 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': (Bls12381G1 ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381Fr Bls12381G1 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G1 ': s)) :-> (r ': s) Source #
r ~ Bls12381G1 => ArithOpHs Mul Bls12381G1 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G1 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
type AsRPC Bls12381G1
Instance details Defined in Morley.AsRPC type AsRPC Bls12381G1 = Bls12381G1
type ToT Bls12381G1
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381G1 = 'TBls12381G1
type UnaryArithResHs Neg Bls12381G1 Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Bls12381G1 = Bls12381G1

data Bls12381G2 #

Instances

Instances details

Show Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G2 -> ShowS # show :: Bls12381G2 -> String # showList :: [Bls12381G2] -> ShowS #
NFData Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods rnf :: Bls12381G2 -> () #
Eq Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G2 -> Bls12381G2 -> Bool # (/=) :: Bls12381G2 -> Bls12381G2 -> Bool #
HasRPCRepr Bls12381G2
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Bls12381G2
IsoValue Bls12381G2
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G2 :: T # Methods toVal :: Bls12381G2 -> Value (ToT Bls12381G2) # fromVal :: Value (ToT Bls12381G2) -> Bls12381G2 #
CurveObject Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods zero :: Bls12381G2 negate :: Bls12381G2 -> Bls12381G2 add :: Bls12381G2 -> Bls12381G2 -> Bls12381G2 generate :: MonadRandom m => m Bls12381G2 fromMichelsonBytes :: ByteString -> Either DeserializationError Bls12381G2 toMichelsonBytes :: Bls12381G2 -> ByteString
UnaryArithOpHs Neg Bls12381G2 Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Bls12381G2 Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': s) :-> (UnaryArithResHs Neg Bls12381G2 ': s) Source #
MultiplyPoint Bls12381Fr Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Bls12381Fr -> Bls12381G2 -> Bls12381G2
MultiplyPoint Integer Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G2 -> Bls12381G2
r ~ Bls12381G2 => ArithOpHs Add Bls12381G2 Bls12381G2 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': (Bls12381G2 ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381Fr Bls12381G2 r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Bls12381G2 ': s)) :-> (r ': s) Source #
r ~ Bls12381G2 => ArithOpHs Mul Bls12381G2 Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381G2 ': (Bls12381Fr ': s)) :-> (r ': s) Source #
type AsRPC Bls12381G2
Instance details Defined in Morley.AsRPC type AsRPC Bls12381G2 = Bls12381G2
type ToT Bls12381G2
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bls12381G2 = 'TBls12381G2
type UnaryArithResHs Neg Bls12381G2 Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Bls12381G2 = Bls12381G2

data Chest #

Instances

Instances details

Generic Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep Chest :: Type -> Type # Methods from :: Chest -> Rep Chest x # to :: Rep Chest x -> Chest #
Show Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Chest -> ShowS # show :: Chest -> String # showList :: [Chest] -> ShowS #
Binary Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods put :: Chest -> Put # get :: Get Chest # putList :: [Chest] -> Put #
NFData Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods rnf :: Chest -> () #
Eq Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Chest -> Chest -> Bool # (/=) :: Chest -> Chest -> Bool #
HasAnnotation Chest Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Chest) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr Chest
Instance details Defined in Morley.AsRPC Associated Types type AsRPC Chest
TypeHasDoc Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Chest :: FieldDescriptions # Methods typeDocName :: Proxy Chest -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Chest -> WithinParens -> Markdown # typeDocDependencies :: Proxy Chest -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Chest # typeDocMichelsonRep :: TypeDocMichelsonRep Chest #
IsoValue Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Chest :: T # Methods toVal :: Chest -> Value (ToT Chest) # fromVal :: Value (ToT Chest) -> Chest #
type Rep Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock type Rep Chest = D1 ('MetaData "Chest" "Morley.Tezos.Crypto.Timelock" "morley-1.20.0-inplace" 'False) (C1 ('MetaCons "Chest" 'PrefixI 'True) (S1 ('MetaSel ('Just "chestLockedVal") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Locked) :: (S1 ('MetaSel ('Just "chestPublicModulus") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 PublicModulus) :: S1 ('MetaSel ('Just "chestCiphertext") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Ciphertext))))
type AsRPC Chest
Instance details Defined in Morley.AsRPC type AsRPC Chest = Chest
type TypeDocFieldDescriptions Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Chest = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Chest = 'TChest

data ChestKey #

Instances

Instances details

Generic ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep ChestKey :: Type -> Type # Methods from :: ChestKey -> Rep ChestKey x # to :: Rep ChestKey x -> ChestKey #
Show ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> ChestKey -> ShowS # show :: ChestKey -> String # showList :: [ChestKey] -> ShowS #
Binary ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods put :: ChestKey -> Put # get :: Get ChestKey # putList :: [ChestKey] -> Put #
NFData ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods rnf :: ChestKey -> () #
Eq ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: ChestKey -> ChestKey -> Bool # (/=) :: ChestKey -> ChestKey -> Bool #
HasAnnotation ChestKey Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ChestKey) Source # annOptions :: Maybe AnnOptions Source #
HasRPCRepr ChestKey
Instance details Defined in Morley.AsRPC Associated Types type AsRPC ChestKey
TypeHasDoc ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ChestKey :: FieldDescriptions # Methods typeDocName :: Proxy ChestKey -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ChestKey -> WithinParens -> Markdown # typeDocDependencies :: Proxy ChestKey -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ChestKey # typeDocMichelsonRep :: TypeDocMichelsonRep ChestKey #
IsoValue ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChestKey :: T # Methods toVal :: ChestKey -> Value (ToT ChestKey) # fromVal :: Value (ToT ChestKey) -> ChestKey #
type Rep ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock type Rep ChestKey = D1 ('MetaData "ChestKey" "Morley.Tezos.Crypto.Timelock" "morley-1.20.0-inplace" 'False) (C1 ('MetaCons "ChestKey" 'PrefixI 'True) (S1 ('MetaSel ('Just "ckUnlockedVal") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Unlocked) :*: S1 ('MetaSel ('Just "ckProof") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Proof)))
type AsRPC ChestKey
Instance details Defined in Morley.AsRPC type AsRPC ChestKey = ChestKey
type TypeDocFieldDescriptions ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ChestKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ChestKey = 'TChestKey

data OpenChest Source #

Instances

Instances details

Generic OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type Rep OpenChest :: Type -> Type # Methods from :: OpenChest -> Rep OpenChest x # to :: Rep OpenChest x -> OpenChest #
Show OpenChest Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> OpenChest -> ShowS # show :: OpenChest -> String # showList :: [OpenChest] -> ShowS #
Eq OpenChest Source #
Instance details Defined in Lorentz.Value Methods (==) :: OpenChest -> OpenChest -> Bool # (/=) :: OpenChest -> OpenChest -> Bool #
HasAnnotation OpenChest Source #
Instance details Defined in Lorentz.Value Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT OpenChest) Source # annOptions :: Maybe AnnOptions Source #
TypeHasDoc OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type TypeDocFieldDescriptions OpenChest :: FieldDescriptions # Methods typeDocName :: Proxy OpenChest -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy OpenChest -> WithinParens -> Markdown # typeDocDependencies :: Proxy OpenChest -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep OpenChest # typeDocMichelsonRep :: TypeDocMichelsonRep OpenChest #
IsoValue OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type ToT OpenChest :: T # Methods toVal :: OpenChest -> Value (ToT OpenChest) # fromVal :: Value (ToT OpenChest) -> OpenChest #
type Rep OpenChest Source #
Instance details Defined in Lorentz.Value type Rep OpenChest = D1 ('MetaData "OpenChest" "Lorentz.Value" "lorentz-0.16.0-inplace" 'False) (C1 ('MetaCons "ChestContent" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ByteString)) :+: C1 ('MetaCons "ChestOpenFailed" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Bool)))
type TypeDocFieldDescriptions OpenChest Source #
Instance details Defined in Lorentz.Value type TypeDocFieldDescriptions OpenChest = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT OpenChest Source #
Instance details Defined in Lorentz.Value type ToT OpenChest = GValueType (GRep OpenChest)

type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg) #

type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg) #

newtype PrintAsValue a Source #

Provides Buildable instance that prints Lorentz value via Michelson's Value.

Result won't be very pretty, but this avoids requiring Show or Buildable instances.

Constructors

PrintAsValue a

Instances

Instances details

NiceUntypedValue a => Buildable (PrintAsValue a) Source #
Instance details Defined in Lorentz.Value Methods build :: PrintAsValue a -> Doc buildList :: [PrintAsValue a] -> Doc

data ViewTyInfo Source #

Type-level information about a view.

Constructors

ViewTyInfo Symbol Type Type

type (>->) arg ret = '(arg, ret) infix 5 Source #

data ViewsList (vl :: [ViewTyInfo]) Source #

A views descriptor that directly carries the full list of views.

Instances

Instances details

type RevealViews (ViewsList info) Source #
Instance details Defined in Lorentz.ViewBase type RevealViews (ViewsList info) = info

type family RevealViews (desc :: Type) :: [ViewTyInfo] Source #

Get a list of views by a descriptor object.

The problem this type family solves: it is unpleasant to carry around a list of views because it may be large, and if we merely hide this list under a type alias, error messages will still mention the type alias expanded. We want e.g. Contract Parameter Storage Views to be carried as-is. Parameter and Storage are usually datatypes and they are fine, while for Views to be not automatically expanded we have to take special care.

You can still provide the list of ViewTyInfos to this type family using ViewsList, but generally prefer creating a dedicated datatype that would expand to a views list.

Instances

Instances details

type RevealViews () Source #
Instance details Defined in Lorentz.ViewBase type RevealViews () = '[] :: [ViewTyInfo]
type RevealViews (ViewsList info) Source #
Instance details Defined in Lorentz.ViewBase type RevealViews (ViewsList info) = info

type family LookupView (name :: Symbol) (views :: [ViewTyInfo]) :: (Type, Type) where ... Source #

Find a view in a contract by name.

Equations

LookupView name '[] = TypeError (('Text "View " ':<>: 'ShowType name) ':<>: 'Text " is not found")
LookupView name ('ViewTyInfo name arg ret ': _) = '(arg, ret)
LookupView name ('ViewTyInfo _ _ _ ': vs) = LookupView name vs

type LookupRevealView name viewRef = LookupView name (RevealViews viewRef) Source #

Reveal views and find a view there.

type HasView vd name arg ret = LookupRevealView name vd ~ '(arg, ret) Source #

Constraint indicating that presence of the view with the specified parameters is implied by the views descriptor.

type family ViewsNames (vs :: [ViewTyInfo]) :: [Symbol] where ... Source #

Map views to get their names.

Equations

ViewsNames '[] = '[]
ViewsNames ('ViewTyInfo name _ _ ': vs) = name ': ViewsNames vs

newtype ViewName #

Constructors

UnsafeViewName
Fields unViewName :: Text

Bundled Patterns

pattern ViewName :: Text -> ViewName

Instances

Instances details

FromJSON ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods parseJSON :: Value -> Parser ViewName # parseJSONList :: Value -> Parser [ViewName] #
FromJSONKey ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods fromJSONKey :: FromJSONKeyFunction ViewName # fromJSONKeyList :: FromJSONKeyFunction [ViewName] #
ToJSON ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods toJSON :: ViewName -> Value # toEncoding :: ViewName -> Encoding # toJSONList :: [ViewName] -> Value # toEncodingList :: [ViewName] -> Encoding #
ToJSONKey ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods toJSONKey :: ToJSONKeyFunction ViewName # toJSONKeyList :: ToJSONKeyFunction [ViewName] #
Data ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ViewName -> c ViewName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ViewName # toConstr :: ViewName -> Constr # dataTypeOf :: ViewName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ViewName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ViewName) # gmapT :: (forall b. Data b => b -> b) -> ViewName -> ViewName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ViewName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ViewName -> r # gmapQ :: (forall d. Data d => d -> u) -> ViewName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ViewName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ViewName -> m ViewName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ViewName -> m ViewName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ViewName -> m ViewName #
Generic ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Associated Types type Rep ViewName :: Type -> Type # Methods from :: ViewName -> Rep ViewName x # to :: Rep ViewName x -> ViewName #
Show ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods showsPrec :: Int -> ViewName -> ShowS # show :: ViewName -> String # showList :: [ViewName] -> ShowS #
NFData ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods rnf :: ViewName -> () #
Eq ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods (==) :: ViewName -> ViewName -> Bool # (/=) :: ViewName -> ViewName -> Bool #
Ord ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods compare :: ViewName -> ViewName -> Ordering # (<) :: ViewName -> ViewName -> Bool # (<=) :: ViewName -> ViewName -> Bool # (>) :: ViewName -> ViewName -> Bool # (>=) :: ViewName -> ViewName -> Bool # max :: ViewName -> ViewName -> ViewName # min :: ViewName -> ViewName -> ViewName #
ToExpression ViewName
Instance details Defined in Morley.Micheline.Class Methods toExpression :: ViewName -> Expression
RenderDoc ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods renderDoc :: RenderContext -> ViewName -> Doc isRenderable :: ViewName -> Bool
HasCLReader ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods getReader :: ReadM ViewName getMetavar :: String
Buildable ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName Methods build :: ViewName -> Doc buildList :: [ViewName] -> Doc
FromExp x ViewName
Instance details Defined in Morley.Micheline.Class Methods fromExp :: Exp x -> Either (FromExpError x) ViewName
type Rep ViewName
Instance details Defined in Morley.Michelson.Internal.ViewName type Rep ViewName = D1 ('MetaData "ViewName" "Morley.Michelson.Internal.ViewName" "morley-1.20.0-inplace" 'True) (C1 ('MetaCons "UnsafeViewName" 'PrefixI 'True) (S1 ('MetaSel ('Just "unViewName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data ViewInterface Source #

Interface of a single view at term-level.

Constructors

ViewInterface
Fields viName :: ViewName viArg :: T viRet :: T

type DemoteViewsDescriptor vd = DemoteViewTyInfo (RevealViews vd) Source #

data ViewInterfaceMatchError Source #

Constructors

VIMViewNotFound ViewName
VIMViewArgMismatch (MismatchError T)
VIMViewRetMismatch (MismatchError T)

Instances

Instances details

Exception ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods toException :: ViewInterfaceMatchError -> SomeException # fromException :: SomeException -> Maybe ViewInterfaceMatchError # displayException :: ViewInterfaceMatchError -> String #
Show ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods showsPrec :: Int -> ViewInterfaceMatchError -> ShowS # show :: ViewInterfaceMatchError -> String # showList :: [ViewInterfaceMatchError] -> ShowS #
Eq ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods (==) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool # (/=) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool #
Buildable ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods build :: ViewInterfaceMatchError -> Doc buildList :: [ViewInterfaceMatchError] -> Doc

type family TypeDocFieldDescriptions a :: FieldDescriptions #

Instances

Instances details

type TypeDocFieldDescriptions ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Never Source #
Instance details Defined in Lorentz.Value type TypeDocFieldDescriptions Never = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions OpenChest Source #
Instance details Defined in Lorentz.Value type TypeDocFieldDescriptions OpenChest = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Operation
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Operation = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Address = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ChainId = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Mutez = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Timestamp = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions KeyHash = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions PublicKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Signature = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Chest = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ChestKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions ()
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions () = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Set a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (FutureContract p) Source #
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (FutureContract p) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (ChestT a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (ChestT a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (OpenChestT a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Packed a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (Packed a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (TSignature a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (TSignature a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (VoidResult r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (VoidResult r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Range a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (Range a)
type TypeDocFieldDescriptions (RangeEE a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeEE a)
type TypeDocFieldDescriptions (RangeEI a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeEI a)
type TypeDocFieldDescriptions (RangeFailureInfo a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeFailureInfo a) = '['("RangeFailureInfo", '('Nothing :: Maybe Symbol, '['("rfiInclusive", "Whether the boundary is inclusive or not"), '("rfiBoundary", "The boundary that failed to check"), '("rfiValue", "The value that failed to check")]))]
type TypeDocFieldDescriptions (RangeIE a) Source #
Instance details Defined in Lorentz.Range type TypeDocFieldDescriptions (RangeIE a)
type TypeDocFieldDescriptions (UParam interface) Source #
Instance details Defined in Lorentz.UParam type TypeDocFieldDescriptions (UParam interface) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (ContractRef cp)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Ticket a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions [a]
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions [a] = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Either l r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (TAddress p vd) Source #
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (TAddress p vd) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes type TypeDocFieldDescriptions (Hash alg a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Extensible x) Source #
Instance details Defined in Lorentz.Extensible type TypeDocFieldDescriptions (Extensible x) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (WrappedLambda i o) Source #
Instance details Defined in Lorentz.Lambda type TypeDocFieldDescriptions (WrappedLambda i o) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (View_ a r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (View_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Void_ a r) Source #
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (Void_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (BigMap k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (STicket action td) Source #
Instance details Defined in Lorentz.Tickets type TypeDocFieldDescriptions (STicket action td) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (NamedF f a n)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (NamedF f a n) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c, d)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c, d) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c, d, e)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c, d, e) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c, d, e, f)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c, d, e, f) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c, d, e, f, g)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c, d, e, f, g) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

type family DocItemPlacement d :: DocItemPlacementKind #

Instances

Instances details

type DocItemPlacement DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes type DocItemPlacement DHashAlgorithm = 'DocItemInDefinitions
type DocItemPlacement DEntrypointExample Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DEntrypointExample = 'DocItemInlined
type DocItemPlacement DView Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DView = 'DocItemInlined
type DocItemPlacement DViewArg Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewArg = 'DocItemInlined
type DocItemPlacement DViewDesc Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewDesc = 'DocItemInDefinitions
type DocItemPlacement DViewRet Source #
Instance details Defined in Lorentz.Doc type DocItemPlacement DViewRet = 'DocItemInlined
type DocItemPlacement DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointArg = 'DocItemInlined
type DocItemPlacement DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointReference = 'DocItemInlined
type DocItemPlacement DError Source #
Instance details Defined in Lorentz.Errors type DocItemPlacement DError = 'DocItemInDefinitions
type DocItemPlacement DThrows Source #
Instance details Defined in Lorentz.Errors type DocItemPlacement DThrows = 'DocItemInlined
type DocItemPlacement DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemPlacement DDescribeErrorTagMap = 'DocItemInDefinitions
type DocItemPlacement DAnchor
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DAnchor = 'DocItemInlined
type DocItemPlacement DComment
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DComment = 'DocItemInlined
type DocItemPlacement DConversionInfo
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DConversionInfo = 'DocItemInlined
type DocItemPlacement DDescription
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DDescription = 'DocItemInlined
type DocItemPlacement DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DGeneralInfoSection = 'DocItemInlined
type DocItemPlacement DGitRevision
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DGitRevision = 'DocItemInlined
type DocItemPlacement DName
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DName = 'DocItemInlined
type DocItemPlacement DToc
Instance details Defined in Morley.Michelson.Doc type DocItemPlacement DToc = 'DocItemInlined
type DocItemPlacement DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemPlacement DStorageType = 'DocItemInlined
type DocItemPlacement DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemPlacement DType = 'DocItemInDefinitions
type DocItemPlacement (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement (DEntrypoint ep) = 'DocItemInlined

type family DocItemReferenced d :: DocItemReferencedKind #

Instances

Instances details

type DocItemReferenced DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes type DocItemReferenced DHashAlgorithm = 'True
type DocItemReferenced DEntrypointExample Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DEntrypointExample = 'False
type DocItemReferenced DView Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DView = 'True
type DocItemReferenced DViewArg Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewArg = 'False
type DocItemReferenced DViewDesc Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewDesc = 'True
type DocItemReferenced DViewRet Source #
Instance details Defined in Lorentz.Doc type DocItemReferenced DViewRet = 'False
type DocItemReferenced DEntrypointArg Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointArg = 'False
type DocItemReferenced DEntrypointReference Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointReference = 'False
type DocItemReferenced DError Source #
Instance details Defined in Lorentz.Errors type DocItemReferenced DError = 'True
type DocItemReferenced DThrows Source #
Instance details Defined in Lorentz.Errors type DocItemReferenced DThrows = 'False
type DocItemReferenced DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemReferenced DDescribeErrorTagMap = 'True
type DocItemReferenced DAnchor
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DAnchor = 'False
type DocItemReferenced DComment
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DComment = 'False
type DocItemReferenced DConversionInfo
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DConversionInfo = 'False
type DocItemReferenced DDescription
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DDescription = 'False
type DocItemReferenced DGeneralInfoSection
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DGeneralInfoSection = 'False
type DocItemReferenced DGitRevision
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DGitRevision = 'False
type DocItemReferenced DName
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DName = 'False
type DocItemReferenced DToc
Instance details Defined in Morley.Michelson.Doc type DocItemReferenced DToc = 'False
type DocItemReferenced DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemReferenced DStorageType = 'True
type DocItemReferenced DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type DocItemReferenced DType = 'True
type DocItemReferenced (DEntrypoint ep) Source #
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced (DEntrypoint ep) = 'True

data GenericStrategy #

pattern I :: Instr (ToTs inp) (ToTs out) -> inp :-> out Source #

pattern FI :: (forall out'. Instr (ToTs inp) out') -> inp :-> out Source #

pattern DEntrypointDocItem :: DEntrypoint kind -> SomeDocItem Source #

Pattern that checks whether given SomeDocItem hides DEntrypoint inside (of any entrypoint kind).

In case a specific kind is necessary, use plain (cast -> Just DEntrypoint{..}) construction instead.

pattern DefEpName :: EpName #

some :: (a : s) :-> (Maybe a : s) Source #

div :: forall r n m s. ArithOpHs Div n m r => (n : (m : s)) :-> (r : s) Source #

Operation that represents division of two values with a given result

return :: Monad m => a -> m a #

Inject a value into the monadic type.

(>>) :: (a :-> b) -> (b :-> c) -> a :-> c Source #

Aliases for (#) used by do-blocks.

abs :: UnaryArithOpHs Abs n => (n : s) :-> (UnaryArithResHs Abs n : s) Source #

negate :: Num a => a -> a #

Unary negation.

fromInteger :: (HasCallStack, Integral a) => Integer -> a #

compare :: NiceComparable n => (n : (n : s)) :-> (Integer : s) Source #

fromString :: IsString a => String -> a #

pure :: Applicative f => a -> f a #

Lift a value.

get :: (GetOpHs c, KnownValue (GetOpValHs c)) => (GetOpKeyHs c : (c : s)) :-> (Maybe (GetOpValHs c) : s) Source #

map :: (MapOpHs c, IsoMapOpRes c b, KnownValue b, HasCallStack) => ((MapOpInpHs c : s) :-> (b : s)) -> (c : s) :-> (MapOpResHs c b : s) Source #

($) :: 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 $ x). However, $ 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) xs, or zipWith ($) fs xs.

Note that ($) is representation-polymorphic in its result type, so that foo $ True where foo :: Bool -> Int# is well-typed.

not :: UnaryArithOpHs Not n => (n : s) :-> (UnaryArithResHs Not n : s) Source #

error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a #

error that takes Text as an argument.

undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a #

undefined that leaves a warning in code on every usage.

(.) :: (b -> c) -> (a -> b) -> a -> c infixr 9 #

Function composition.

take :: Expr (a : s) s a Source #

Consume an element at the top of stack. This is just an alias for nop.

drop :: (a : s) :-> s Source #

concat :: ConcatOpHs c => (c : (c : s)) :-> (c : s) Source #

and :: ArithOpHs And n m r => (n : (m : s)) :-> (r : s) Source #

or :: ArithOpHs Or n m r => (n : (m : s)) :-> (r : s) Source #

failWith :: forall a s t. NiceConstant a => (a : s) :-> t Source #

assert :: IsError err => err -> (Bool : s) :-> s Source #

loop :: (s :-> (Bool : s)) -> (Bool : s) :-> s Source #

(|||) :: ArithOpHs Or a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 1 Source #

Bitwise/logical OR on expressions.

In case you find this operator looking weird, see |.|.|

pack :: forall a s. NicePackedValue a => (a : s) :-> (Packed a : s) Source #

unpack :: forall a s. NiceUnpackedValue a => (Packed a : s) :-> (Maybe a : s) Source #

view :: forall name arg ret p vd s. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret, HasView vd name arg ret) => (arg : (TAddress p vd : s)) :-> (ret : s) Source #

Call a view.

Accepts the view name via a type annotation. This internally asserts the view to be present, as if the supplied TAddress argument is valid, the view is guaranteed to be called successfully.

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

size :: SizeOpHs c => (c : s) :-> (Natural : s) Source #

sha256 :: BytesLike bs => (bs : s) :-> (Hash Sha256 bs : s) Source #

sha512 :: BytesLike bs => (bs : s) :-> (Hash Sha512 bs : s) Source #

xor :: ArithOpHs Xor n m r => (n : (m : s)) :-> (r : s) Source #

eq :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

apply :: forall a b c s. (NiceConstant a, KnownValue b) => (a : (Lambda (a, b) c : s)) :-> (Lambda b c : s) Source #

right :: forall a b s. KnownValue a => (b : s) :-> (Either a b : s) Source #

left :: forall a b s. KnownValue b => (a : s) :-> (Either a b : s) Source #

unit :: s :-> (() : s) Source #

pair :: (a : (b : s)) :-> ((a, b) : s) Source #

int :: ToIntegerArithOpHs i => (i : s) :-> (Integer : s) Source #

pairE :: (Expr s0 s1 a, Expr s1 s2 b) -> Expr s0 s2 (a, b) Source #

An alias for |@|.

trivialContract :: ((), storage) :-> ([Operation], Storage)
trivialContract =
  pairE
    ( nil
    , cdr
    )

(!) :: WithParam p fn fn' => fn -> Param p -> fn' infixl 9 #

Supply a parameter to a function:

function ! #param_name value

function ! #x 7 ! #y 42 ! defaults

This is an infix version of with.

inRange :: (NiceRange range lower upper a, Ord a) => range a -> a -> Bool Source #

Check if a value is in range.

>>> let range = mkRange -2 2
>>> inRange range <$> [-4..4]
[False,False,True,True,True,True,True,False,False]

swap :: (a : (b : s)) :-> (b : (a : s)) Source #

fromLabel :: IsLabel x a => a #

getField :: forall dt name st. (InstrGetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (dt : st) :-> (GetFieldType dt name : (dt ': st)) Source #

Extract a field of a datatype, leaving the original datatype on stack.

>>> :{
 (getField @TestProduct #fieldB # L.swap # toField @TestProduct #fieldB # mul) -$
    testProduct { fieldB = 3 }
:}
9

withDict :: HasDict c e => e -> (c => r) -> r #

From a Dict, takes a value in an environment where the instance witnessed by the Dict is in scope, and evaluates it.

Essentially a deconstruction of a Dict into its continuation-style form.

Can also be used to deconstruct an entailment, a :- b, using a context a.

withDict :: Dict c -> (c => r) -> r
withDict :: a => (a :- c) -> (c => r) -> r

cast :: KnownValue a => (a : s) :-> (a : s) Source #

dup :: forall a s. Dupable a => (a : s) :-> (a : (a : s)) Source #

Copies a stack argument.

Hit the Dupable constraint? Polymorphism and abstractions do not play very well with this constraint, you can enjoy suffering from the linear types feature under various sauces:

The most trivial option is to just propagate Dupable constraint when you want to use dup, this suits for case when you are not planning to work with non-dupable types like tickets.
Sometimes it is possible to avoid dup and use other instructions instead (e.g. unpair allows splitting a pair without using dups, getAndUpdate allows accessing a map value without implicit duplication). But you may have to learn to write code in a completely different way, and the result may be less efficient comparing to the option with using dup.
Use decideOnDupable to provide two code paths - when type is dupable and when it is not.

cons :: (a : (List a : s)) :-> (List a : s) Source #

setField :: forall dt name st. InstrSetFieldC dt name => Label name -> (GetFieldType dt name ': (dt ': st)) :-> (dt ': st) Source #

Set a field of a datatype.

>>> setField @TestProduct #fieldB -$ 23 ::: testProduct
TestProduct {fieldA = True, fieldB = 23, fieldC = ()}

sub :: ArithOpHs Sub n m r => (n : (m : s)) :-> (r : s) Source #

update :: UpdOpHs c => (UpdOpKeyHs c : (UpdOpParamsHs c : (c : s))) :-> (c : s) Source #

emit :: forall t s. (NicePackedValue t, HasAnnotation t) => FieldAnn -> (t : s) :-> (Operation : s) Source #

Version of emit that adds the type annotation, only when t has annotations.

add :: ArithOpHs Add n m r => (n : (m : s)) :-> (r : s) Source #

mul :: ArithOpHs Mul n m r => (n : (m : s)) :-> (r : s) Source #

isEmpty :: SizeOpHs c => (c : s) :-> (Bool : s) Source #

Check whether container is empty.

contract :: forall p vd addr s. (NiceParameterFull p, ForbidExplicitDefaultEntrypoint p, ToTAddress_ p vd addr) => (addr : s) :-> (Maybe (ContractRef p) : s) Source #

Get a reference to a contract by its address.

This instruction carries the behaviour of CONTRACT before introduction of lightweight entrypoints feature. The contract must not have explicit "default" entrypoint for this to work.

If you are going to call a specific entrypoint of the contract, see contractCalling.

balance :: s :-> (Mutez : s) Source #

bytes :: (BytesLike bs, ToBytesArithOpHs i) => (i : s) :-> (bs : s) Source #

iter :: (IterOpHs c, HasCallStack) => ((IterOpElHs c : s) :-> s) -> (c : s) :-> s Source #

never :: (Never : s) :-> s' Source #

push :: forall t s. NiceConstant t => t -> s :-> (t : s) Source #

none :: forall a s. KnownValue a => s :-> (Maybe a : s) Source #

(#) :: (a :-> b) -> (b :-> c) -> a :-> c infixl 8 Source #

Function composition for instructions.

Note that, unlike Morley's :# operator, (#) is left-associative.

(<.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsLt.

In this and similar operators you provide names of accepted stack operands as a safety measure of that they go in the expected order.

non :: (NiceConstant a, NiceComparable a) => a -> (a : s) :-> (Maybe a : s) Source #

Retain the value if it is not equal to the given one.

>>> non (0 :: Integer) -$ 5
Just 5
>>> non (0 :: Integer) -$ 0
Nothing

non' :: NiceConstant a => ('[a] :-> '[Bool]) -> (a : s) :-> (Maybe a : s) Source #

Version of non with a custom predicate.

>>> non' @Integer eq0 -$ 5
Just 5
>>> non' @Integer eq0 -$ 0
Nothing

listE :: KnownValue a => [Expr s s a] -> Expr s s [a] Source #

Construct a list given the constructor for each element.

ge :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

nat :: BytesLike bs => (bs : s) :-> (Natural : s) Source #

nil :: KnownValue p => s :-> (List p : s) Source #

toCamel :: Text -> Text #

toPascal :: Text -> Text #

O(n) Convert casing to PascalCasePhrase. Subject to fusion.

toSnake :: Text -> Text #

slice :: (SliceOpHs c, KnownValue c) => (Natural : (Natural : (c : s))) :-> (Maybe c : s) Source #

asAddressOf :: contract cp st vd -> Address -> TAddress cp vd Source #

For a contract and an address of its instance, construct a typed address.

asAddressOf_ :: contract cp st vd -> (Address : s) :-> (TAddress cp vd : s) Source #

callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname) Source #

Turn any typed address to ContractRef in Haskell world.

This is an analogy of address to contract convertion in Michelson world, thus you have to supply an entrypoint (or call the default one explicitly).

callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp) Source #

Specialization of callingAddress to call the default entrypoint.

toTAddress_ :: forall cp addr vd s. ToTAddress_ cp vd addr => (addr : s) :-> (TAddress cp vd : s) Source #

Cast something appropriate to TAddress.

convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2 Source #

coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b #

toField :: forall dt name st. InstrGetFieldC dt name => Label name -> (dt : st) :-> (GetFieldType dt name : st) Source #

Extract a field of a datatype replacing the value of this datatype with the extracted field.

For this and the following functions you have to specify field name which is either record name or name attached with (:!) operator.

>>> :{
 (toField @TestProductWithNonDup #fieldTP -$ testProductWithNonDup) == testProduct
:}
True

toFieldNamed :: forall dt name st. InstrGetFieldC dt name => Label name -> (dt : st) :-> ((name :! GetFieldType dt name) : st) Source #

Like toField, but leaves field named.

getFieldNamed :: forall dt name st. (InstrGetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (dt : st) :-> ((name :! GetFieldType dt name) : (dt ': st)) Source #

Like getField, but leaves field named.

modifyField :: forall dt name st. (InstrGetFieldC dt name, InstrSetFieldC dt name, Dupable (GetFieldType dt name), HasDupableGetters dt) => Label name -> (forall st0. (GetFieldType dt name ': st0) :-> (GetFieldType dt name ': st0)) -> (dt : st) :-> (dt : st) Source #

Apply given modifier to a datatype field.

>>> modifyField @TestProduct #fieldB (dup # mul) -$ testProduct { fieldB = 8 }
TestProduct {fieldA = True, fieldB = 64, fieldC = ()}

construct :: forall dt st. (InstrConstructC dt, RMap (ConstructorFieldTypes dt)) => Rec (FieldConstructor st) (ConstructorFieldTypes dt) -> st :-> (dt : st) Source #

Make up a datatype. You provide a pack of individual fields constructors.

Each element of the accepted record should be an instruction wrapped with fieldCtor function. This instruction will have access to the stack at the moment of calling construct. Instructions have to output fields of the built datatype, one per instruction; instructions order is expected to correspond to the order of fields in the datatype.

>>> :{
 let ctor =
       (fieldCtor (push True)) :&
       (fieldCtor (push (42 :: Integer))) :&
       (fieldCtor (push ())) :&
       RNil
:}

>>> construct @TestProduct ctor -$ ZSNil
TestProduct {fieldA = True, fieldB = 42, fieldC = ()}

constructT :: forall dt fctors st. (InstrConstructC dt, RMap (ConstructorFieldTypes dt), fctors ~ Rec (FieldConstructor st) (ConstructorFieldTypes dt), RecFromTuple fctors) => IsoRecTuple fctors -> st :-> (dt : st) Source #

Version of construct which accepts tuple of field constructors.

>>> let ctor = (fieldCtor (push True), fieldCtor (push @Integer 42), fieldCtor (push ()))
>>> constructT @TestProduct ctor -$ ZSNil
TestProduct {fieldA = True, fieldB = 42, fieldC = ()}

constructStack :: forall dt fields st. (InstrConstructC dt, fields ~ ConstructorFieldTypes dt, (ToTs fields ++ ToTs st) ~ ToTs (fields ++ st)) => (fields ++ st) :-> (dt : st) Source #

Construct an object from fields on the stack.

>>> constructStack @TestProduct -$ True ::: 42 ::: ()
TestProduct {fieldA = True, fieldB = 42, fieldC = ()}

deconstruct :: forall dt fields st. (InstrDeconstructC dt (ToTs st), fields ~ GFieldTypes (GRep dt) '[], (ToTs fields ++ ToTs st) ~ ToTs (fields ++ st)) => (dt : st) :-> (fields ++ st) Source #

Decompose a complex object into its fields

>>> deconstruct @TestProduct # constructStack @TestProduct -$ testProduct
TestProduct {fieldA = True, fieldB = 42, fieldC = ()}

Will show human-readable error on a missing Generic instance:

>>> data Foo = Foo () ()
>>> deconstruct @Foo
...
... GHC.Generics.Rep Foo
... is stuck. Likely
... Generic Foo
... instance is missing or out of scope.
...

>>> data Foo = Foo () () deriving (Generic, IsoValue)
>>> pretty $ deconstruct @Foo
[UNPAIR, DIP {  }]

fieldCtor :: HasCallStack => (st :-> (f : st)) -> FieldConstructor st f Source #

Lift an instruction to field constructor.

wrap_ :: forall dt name st. InstrWrapC dt name => Label name -> AppendCtorField (GetCtorField dt name) st :-> (dt : st) Source #

Wrap entry in constructor. Useful for sum types.

>>> wrap_ @TestSum #cTestSumB -$ (False, ())
TestSumB (False,())

wrapOne :: forall dt name st. InstrWrapOneC dt name => Label name -> (CtorOnlyField name dt ': st) :-> (dt : st) Source #

Wrap entry in single-field constructor. Useful for sum types.

>>> wrapOne @TestSum #cTestSumA -$ 42
TestSumA 42

case_ :: forall dt out inp. (InstrCaseC dt, RMap (CaseClauses dt)) => Rec (CaseClauseL inp out) (CaseClauses dt) -> (dt : inp) :-> out Source #

Pattern match on the given sum type.

You have to provide a Rec containing case branches. To construct a case branch use /-> operator.

>>> :{
 let caseTestSum = case_ @TestSum $
       (#cTestSumA /-> nop) :&
       (#cTestSumB /-> L.drop # push 23) :&
       RNil
:}

>>> caseTestSum -$ TestSumA 42
42
>>> caseTestSum -$ TestSumB (False, ())
23

caseT :: forall dt out inp clauses. CaseTC dt out inp clauses => IsoRecTuple clauses -> (dt : inp) :-> out Source #

Like case_, accepts a tuple of clauses, which may be more convenient.

If user is experiencing problems with wierd errors about tuples while using this function, he should take look at Morley.Util.TypeTuple.Instances and ensure that his tuple isn't bigger than generated instances, if so, he should probably extend number of generated instances.

>>> :{
 let caseTTestSum = caseT @TestSum $
       ( #cTestSumA /-> nop
       , #cTestSumB /-> L.drop # push 23
       )
:}

>>> caseTTestSum -$ TestSumA 42
42
>>> caseTTestSum -$ TestSumB (False, ())
23

unsafeUnwrap_ :: forall dt name st. InstrUnwrapC dt name => Label name -> (dt : st) :-> (CtorOnlyField name dt ': st) Source #

Unwrap a constructor with the given name. Useful for sum types.

>>> unsafeUnwrap_ @TestSum #cTestSumA -$? TestSumA 42
Right 42
>>> pretty $ unsafeUnwrap_ @TestSum #cTestSumA -$? TestSumB (False, ())
<Left: Reached FAILWITH instruction with '"BadCtor"' at line 1 char 1.>

getFieldOpen :: forall dt name res st. (InstrGetFieldC dt name, HasDupableGetters dt) => ('[GetFieldType dt name] :-> '[res, GetFieldType dt name]) -> ('[GetFieldType dt name] :-> '[res]) -> Label name -> (dt : st) :-> (res : (dt ': st)) Source #

"Open" version of getField, an advanced method suitable for chaining getters.

It accepts two continuations accepting the extracted field, one that leaves the field on stack (and does a duplication of res inside) and another one that consumes the field. Normally these are just getField and toField for some nested field.

Unlike the straightforward chaining of getField/toField methods, getFieldOpen does not require the immediate field to be dupable; rather, in the best case only res has to be dupable.

setFieldOpen :: forall dt name new st. InstrSetFieldC dt name => ('[new, GetFieldType dt name] :-> '[GetFieldType dt name]) -> Label name -> (new ': (dt ': st)) :-> (dt ': st) Source #

"Open" version of setField, an advanced method suitable for chaining setters.

It accepts a continuation accepting the field extracted for the update and the new value that is being set. Normally this continuation is just setField for some nested field.

dropPrefix :: Text -> Text #

appendTo :: Text -> [Text] -> Text -> Text Source #

appendTo suffix fields field appends the given suffix to field if the field exists in the fields list.

stripFieldPrefix :: Text -> Text #

ctorNameToAnnWithOptions :: forall ctor. (KnownSymbol ctor, HasCallStack) => AnnOptions -> FieldAnn Source #

gGetAnnotationNoField :: forall a. (GHasAnnotation (GRep a), GValueType (GRep a) ~ ToT a) => FollowEntrypointFlag -> Notes (ToT a) Source #

Use this in the instance of HasAnnotation when field annotations should not be generated.

insertTypeAnn :: forall (b :: T). TypeAnn -> Notes b -> Notes b #

iGenericIf :: (forall s'. Instr (ToTs a) s' -> Instr (ToTs b) s' -> Instr (ToTs c) s') -> (a :-> s) -> (b :-> s) -> c :-> s Source #

iAnyCode :: (inp :-> out) -> Instr (ToTs inp) (ToTs out) Source #

iNonFailingCode :: HasCallStack => (inp :-> out) -> Instr (ToTs inp) (ToTs out) Source #

iMapAnyCode :: (forall o'. Instr (ToTs i1) o' -> Instr (ToTs i2) o') -> (i1 :-> o) -> i2 :-> o Source #

iForceNotFail :: (i :-> o) -> i :-> o Source #

parseLorentzValue :: forall v. KnownValue v => MichelsonSource -> Text -> Either ParseLorentzError v Source #

Parse textual representation of a Michelson value and turn it into corresponding Haskell value.

Note: it won't work in some complex cases, e. g. if there is a lambda which uses an instruction which depends on current contract's type. Obviously it can not work, because we don't have any information about a contract to which this value belongs (there is no such contract at all).

transformStringsLorentz :: Bool -> (MText -> MText) -> (inp :-> out) -> inp :-> out Source #

Lorentz version of transformStrings.

transformBytesLorentz :: Bool -> (ByteString -> ByteString) -> (inp :-> out) -> inp :-> out Source #

Lorentz version of transformBytes.

optimizeLorentz :: (inp :-> out) -> inp :-> out Source #

optimizeLorentzWithConf :: OptimizerConf -> (inp :-> out) -> inp :-> out Source #

mkContractCode :: (IsNotInView => '[(cp, st)] :-> ContractOut st) -> ContractCode cp st Source #

A helper to construct ContractCode that provides IsNotInView constraint.

toMichelsonContract :: Contract cp st vd -> Contract (ToT cp) (ToT st) Source #

Demote Lorentz Contract to Michelson typed Contract.

lSign :: (MonadRandom m, BytesLike a) => SecretKey -> a -> m (TSignature a) Source #

Sign data using SecretKey

toHashHs :: forall alg bs. (BytesLike bs, KnownHashAlgorithm alg) => bs -> Hash alg bs Source #

Evaluate hash in Haskell world.

openChestT :: BytesLike a => (ChestKey : (ChestT a : (Natural : s))) :-> (OpenChestT a : s) Source #

Deprecated: Due to a vulnerability discovered in time-lock protocol, OPEN_CHEST is temporarily deprecated since Lima

castDummyG :: (Generic a, Generic b, GCanCastTo (GRep a) (GRep b)) => Proxy a -> Proxy b -> () Source #

Implementation of castDummy for types composed from smaller types. It helps to ensure that all necessary constraints are requested in instance head.

Shows human-readable errors when up is stuck.

>>> data Foo = Foo
>>> castDummyG (Proxy @Foo) (Proxy @())
...
... GHC.Generics.Rep Foo
... is stuck. Likely
... Generic Foo
... instance is missing or out of scope.
...

>>> data Foo = Foo deriving Generic
>>> castDummyG (Proxy @Foo) (Proxy @())
()

checkedCoerce :: forall a b. (CanCastTo a b, Coercible a b) => a -> b Source #

Coercion in Haskell world which respects CanCastTo.

checkedCoerce_ :: forall a b s. Castable_ a b => (a : s) :-> (b : s) Source #

Coerce between types which have an explicit permission for that in the face of CanCastTo constraint.

checkedCoercing_ :: forall a b s. Coercible_ a b => ((b ': s) :-> (b ': s)) -> (a ': s) :-> (a ': s) Source #

Pretends that the top item of the stack was coerced.

allowCheckedCoerceTo :: forall b a. Dict (CanCastTo a b) Source #

Locally provide given CanCastTo instance.

allowCheckedCoerce :: forall a b. Dict (CanCastTo a b, CanCastTo b a) Source #

Locally provide bidirectional CanCastTo instance.

coerceUnwrap :: forall a s. Unwrappable a => (a : s) :-> (Unwrappabled a : s) Source #

Specialized version of forcedCoerce_ to unwrap a haskell newtype.

unsafeCoerceWrap :: forall a s. Unwrappable a => (Unwrappabled a : s) :-> (a : s) Source #

Specialized version of forcedCoerce_ to wrap a haskell newtype.

Works under Unwrappable constraint, thus is not safe.

coerceWrap :: forall a s. Wrappable a => (Unwrappabled a : s) :-> (a : s) Source #

Specialized version of forcedCoerce_ to wrap into a haskell newtype.

Requires Wrappable constraint.

toNamed :: Label name -> (a : s) :-> ((name :! a) : s) Source #

Lift given value to a named value.

fromNamed :: Label name -> ((name :! a) : s) :-> (a : s) Source #

Unpack named value.

forcedCoerce :: Coercible a b => a -> b Source #

Coercion for Haskell world.

We discourage using this function on Lorentz types, consider using coerce instead. One of the reasons for that is that in Lorentz it's common to declare types as newtypes consisting of existing primitives, and forcedCoerce tends to ignore all phantom type variables of newtypes thus violating their invariants.

forcedCoerce_ :: MichelsonCoercible a b => (a : s) :-> (b : s) Source #

Convert between values of types that have the same representation.

This function is not safe in a sense that this allows * breaking invariants of casted type (example: UStore from morley-upgradeable), or * may stop compile on code changes (example: coercion of pair to a datatype with two fields will break if new field is added). Still, produced Michelson code will always be valid.

Prefer using one of more specific functions from this module.

gForcedCoerce_ :: MichelsonCoercible (t a) (t b) => (t a : s) :-> (t b : s) Source #

fakeCoerce :: s1 :-> s2 Source #

Convert between two stacks via failing.

fakeCoercing :: (s1 :-> s2) -> s1' :-> s2' Source #

decideOnDupable :: forall a. KnownValue a => DupableDecision a Source #

Check whether given value is dupable, returning a proof of that when it is.

This lets defining methods that behave differently depending on whether given value is dupable or not. This may be suitable when for the dupable case you can provide a more efficient implementation, but you also want your implementation to be generic.

Example:

code = case decideOnDupable @a of
  IsDupable -> do dup; ...
  IsNotDupable -> ...

convertFixedToRational :: forall a s. HasResolution a => (Fixed a : s) :-> (Rational : s) Source #

Converts Rational to Fixed using value inside as numerator and base as denominator

convertNFixedToRational :: forall a s. HasResolution a => (NFixed a : s) :-> (Rational : s) Source #

Converts Rational to NFixed using value inside as numerator and base as denominator

convertRationalToFixed :: forall a s. HasResolution a => (Rational : s) :-> (Fixed a : s) Source #

Converts Fixed to Rational according to formulae: numerator * base / denominator Note: Since result's base is determined by user, it is recommended to use higher value in order to achieve better accuracy

convertRationalToNFixed :: forall a s. HasResolution a => (Rational : s) :-> (Maybe (NFixed a) : s) Source #

unsafeConvertRationalToNFixed :: forall a s. HasResolution a => (Rational : s) :-> (NFixed a : s) Source #

convertFixedToNRational :: forall a s. HasResolution a => (Fixed a : s) :-> (Maybe NRational : s) Source #

Converts Fixed to NRational if it is greater than zero. If not, returns Nothing

unsafeConvertFixedToNRational :: forall a s. HasResolution a => (Fixed a : s) :-> (NRational : s) Source #

Converts Fixed to NRational, using abs on numerator.

convertNFixedToNRational :: forall a s. HasResolution a => (NFixed a : s) :-> (NRational : s) Source #

Converts NFixed to NRational.

convertNRationalToFixed :: forall a s. HasResolution a => (NRational : s) :-> (Fixed a : s) Source #

Converts NRational to Fixed.

convertNRationalToNFixed :: forall a s. HasResolution a => (NRational : s) :-> (NFixed a : s) Source #

Converts NRational to NFixed.

castNFixedToFixed :: (NFixed p : s) :-> (Fixed p : s) Source #

castFixedToNFixed :: (Fixed p : s) :-> (Maybe (NFixed p) : s) Source #

unsafeCastFixedToNFixed :: (Fixed p : s) :-> (NFixed p : s) Source #

resolution_ :: forall a. HasResolution a => Natural Source #

Special function to get resolution without argument

toFixed :: forall a f base t s. (a ~ f (base t), LorentzFixedBase base, Unwrappable a, KnownNat t, ArithOpHs Mul Natural (Unwrappabled a) (Unwrappabled a)) => (Unwrappabled a : s) :-> (a : s) Source #

Convert from the corresponding integral type.

fromFixed :: forall a f base t s. (a ~ f (base t), ToT (f (base 0)) ~ ToT (Unwrappabled a), LorentzRounding a (f (base 0))) => (a : s) :-> (Unwrappabled a : s) Source #

Convert to the corresponding integral type by banker's rounding.

gcdEuclid :: (Natural : (Natural : s)) :-> (Natural : s) Source #

For a given Natural values, calculates their gcd, using Euclid algorithm.

euclidExtendedNormalization :: forall s. (Rational : s) :-> (Rational : s) Source #

Reduce Rational value, using extended Euclid algorithm. Consumes slightly more gas, than reduce, but contract with it is cheaper in terms of origination.

tripleMul :: forall r a s. (ArithOpHs Mul a a a, Unwrappabled r ~ (a, Natural), LorentzRational r) => (r : (r : (r : s))) :-> (r : s) Source #

Special multiplication helper, in case you want to multiply three 'Rational values' given values (a b) * (c d) * (e / f) performs (a * c * e) / (b * d * f).

mkRational :: (Integer, Natural) -> Either Text Rational Source #

(%!) :: Integer -> Natural -> Rational infixl 7 Source #

mkNRational :: (Natural, Natural) -> Either Text NRational Source #

(%%!) :: Natural -> Natural -> NRational infixl 7 Source #

mkRational_ :: (forall s0. ErrInstr (("numerator" :! Integer, "denominator" :! Natural) : s0)) -> (Integer : (Natural : s)) :-> (Rational : s) Source #

doc :: DocItem di => di -> s :-> s Source #

Put a document item.

docGroup :: DocItem di => (SubDoc -> di) -> (inp :-> out) -> inp :-> out Source #

Group documentation built in the given piece of code into block dedicated to one thing, e.g. to one entrypoint.

Examples of doc items you can pass here: DName, DGeneralInfoSection.

dStorage :: TypeHasDoc store => DStorageType #

contractGeneralDefault :: s :-> s Source #

Inserts general information about the contract using the default format.

This includes git revision and some other information common for all contracts. Git revision is left unknown in the library code and is supposed to be updated in an executable using e.g. attachDocCommons.

cutLorentzNonDoc :: (inp :-> out) -> s :-> s Source #

Leave only instructions related to documentation.

This function is useful when your method executes a lambda coming from outside, but you know its properties and want to propagate its documentation to your contract code.

docItemPosition :: DocItem d => DocItemPos #

mkDEntrypointExample :: forall a. NiceParameter a => a -> DEntrypointExample Source #

mkDGitRevision :: ExpQ #

morleyRepoSettings :: GitRepoSettings #

dTypeDep :: TypeHasDoc t => SomeDocDefinitionItem #

docDefinitionRef :: (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => Markdown -> d -> Markdown #

contractDocToMarkdown :: ContractDoc -> LText #

subDocToMarkdown :: HeaderLevel -> SubDoc -> Markdown #

docItemSectionRef :: DocItem di => Maybe Markdown #

finalizedAsIs :: a -> WithFinalizedDoc a #

buildDoc :: ContainsDoc a => WithFinalizedDoc a -> ContractDoc #

buildMarkdownDoc :: ContainsDoc a => WithFinalizedDoc a -> LText #

modifyDoc :: (ContainsUpdateableDoc a, DocItem i1, DocItem i2) => (i1 -> Maybe i2) -> a -> a #

attachDocCommons :: ContainsUpdateableDoc a => DGitRevision -> a -> WithFinalizedDoc a #

typeDocBuiltMichelsonRep :: TypeHasDoc a => Proxy a -> Doc #

genericTypeDocDependencies :: (Generic a, GTypeHasDoc (GRep a)) => Proxy a -> [SomeDocDefinitionItem] #

customTypeDocMdReference :: (Text, DType) -> [DType] -> WithinParens -> Markdown #

homomorphicTypeDocMdReference :: (Typeable t, TypeHasDoc t, IsHomomorphic t) => Proxy t -> WithinParens -> Markdown #

poly1TypeDocMdReference :: forall (t :: Type -> Type) r a. (r ~ t a, Typeable t, Each '[TypeHasDoc] '[r, a], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown #

poly2TypeDocMdReference :: forall (t :: Type -> Type -> Type) r a b. (r ~ t a b, Typeable t, Each '[TypeHasDoc] '[r, a, b], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown #

homomorphicTypeDocHaskellRep :: (Generic a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep a #

concreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a), HaveCommonTypeCtor b a) => TypeDocHaskellRep b #

unsafeConcreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep b #

haskellAddNewtypeField :: Text -> TypeDocHaskellRep a -> TypeDocHaskellRep a #

haskellRepNoFields :: TypeDocHaskellRep a -> TypeDocHaskellRep a #

homomorphicTypeDocMichelsonRep :: KnownIsoT a => TypeDocMichelsonRep a #

concreteTypeDocMichelsonRep :: (Typeable a, KnownIsoT a, HaveCommonTypeCtor b a) => TypeDocMichelsonRep b #

unsafeConcreteTypeDocMichelsonRep :: forall {k} a (b :: k). (Typeable a, KnownIsoT a) => TypeDocMichelsonRep b #

mdTocFromRef :: (DocItem d, DocItemReferenced d ~ 'True) => HeaderLevel -> Markdown -> d -> Markdown #

parameterEntrypointsToNotes :: forall cp. ParameterDeclaresEntrypoints cp => ParamNotes (ToT cp) Source #

Derive annotations for given parameter.

parameterEntrypointCall :: forall cp name. ParameterDeclaresEntrypoints cp => Label name -> EntrypointCall cp (GetEntrypointArg cp name) Source #

Prepare call to given entrypoint.

This does not treat calls to default entrypoint in a special way. To call default entrypoint properly use parameterEntrypointCallDefault.

parameterEntrypointCallDefault :: forall cp. ParameterDeclaresEntrypoints cp => EntrypointCall cp (GetDefaultEntrypointArg cp) Source #

Call the default entrypoint.

sepcCallRootChecked :: forall cp. (NiceParameter cp, ForbidExplicitDefaultEntrypoint cp) => SomeEntrypointCall cp Source #

Call root entrypoint safely.

eprName :: forall mname. EntrypointRef mname -> EpName Source #

parameterEntrypointCallCustom :: forall cp mname. ParameterDeclaresEntrypoints cp => EntrypointRef mname -> EntrypointCall cp (GetEntrypointArgCustom cp mname) Source #

Universal entrypoint calling.

entrypointSection :: EntrypointKindHasDoc kind => Text -> Proxy kind -> (i :-> o) -> i :-> o Source #

Mark code as part of entrypoint with given name.

This is automatically called at most of the appropriate situations, like entryCase calls.

diEntrypointToMarkdown :: HeaderLevel -> DEntrypoint level -> Markdown Source #

Default implementation of docItemToMarkdown for entrypoints.

mkPbsWrapIn :: Text -> ParamBuilder -> ParamBuildingStep Source #

Make a ParamBuildingStep that tells about wrapping an argument into a constructor with given name and uses given ParamBuilder as description of Michelson part.

clarifyParamBuildingSteps :: ParamBuildingStep -> (inp :-> out) -> inp :-> out Source #

Go over contract code and update every occurrence of DEntrypointArg documentation item, adding the given step to its "how to build parameter" description.

emptyDEpArg :: DEntrypointArg Source #

mkUType :: forall (x :: T). Notes x -> Ty #

mkDEpUType :: forall t. HasAnnotation t => Ty Source #

mkDEntrypointArgSimple :: forall t. (NiceParameter t, TypeHasDoc t) => DEntrypointArg Source #

documentEntrypoint :: forall kind epName param s out. (KnownSymbol epName, DocItem (DEntrypoint kind), NiceParameter param, TypeHasDoc param) => ((param : s) :-> out) -> (param : s) :-> out Source #

Wrapper for documenting single entrypoint which parameter isn't going to be unwrapped from some datatype.

entryCase unwraps a datatype, however, sometimes we want to have entrypoint parameter to be not wrapped into some datatype.

entryCase :: forall dt entrypointKind out inp clauses. (CaseTC dt out inp clauses, DocumentEntrypoints entrypointKind dt) => Proxy entrypointKind -> IsoRecTuple clauses -> (dt : inp) :-> out Source #

Version of entryCase_ for tuples.

entryCase_ :: forall dt entrypointKind out inp. (InstrCaseC dt, RMap (CaseClauses dt), DocumentEntrypoints entrypointKind dt) => Proxy entrypointKind -> Rec (CaseClauseL inp out) (CaseClauses dt) -> (dt : inp) :-> out Source #

Like case_, to be used for pattern-matching on a parameter or its part.

Modifies documentation accordingly. Including description of entrypoints' arguments, thus for them you will need to supply TypeHasDoc instance.

finalizeParamCallingDoc :: forall cp inp out. (NiceParameterFull cp, RequireSumType cp, HasCallStack) => ((cp : inp) :-> out) -> (cp : inp) :-> out Source #

Version of 'finalizeParamCallingDoc'' more convenient for manual call in a contract.

finalizeParamCallingDoc' :: forall cp inp out. (NiceParameterFull cp, HasCallStack) => Proxy cp -> (inp :-> out) -> inp :-> out Source #

Modify param building steps with respect to entrypoints that given parameter declares.

Each contract with entrypoints should eventually call this function, otherwise, in case if contract uses built-in entrypoints feature, the resulting parameter building steps in the generated documentation will not consider entrypoints and thus may be incorrect.

Calling this twice over the same code is also prohibited.

This method is for internal use, if you want to apply it to a contract manually, use finalizeParamCallingDoc.

areFinalizedParamBuildingSteps :: [ParamBuildingStep] -> Bool Source #

Whether finalizeParamCallingDoc has already been applied to these steps.

entryCaseSimple_ :: forall cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints PlainEntrypointsKind cp, RequireFlatParamEps cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out Source #

Version of entryCase_ for contracts with flat parameter.

entryCaseSimple :: forall cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints PlainEntrypointsKind cp, RequireFlatParamEps cp) => IsoRecTuple clauses -> (cp : inp) :-> out Source #

Version of entryCase for contracts with flat parameter.

entryCaseFlattened_ :: forall cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints FlattenedEntrypointsKind cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out Source #

Version of entryCase_ for contracts with recursive parameter that needs to be flattened. Use it with EpdRecursive when you don't need intermediary nodes in autodoc.

entryCaseFlattened :: forall cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints FlattenedEntrypointsKind cp) => IsoRecTuple clauses -> (cp : inp) :-> out Source #

Version of entryCase for contracts with recursive parameter that needs to be flattened. Use it with EpdRecursive when you don't need intermediary nodes in autodoc.

entryCaseFlattenedHiding_ :: forall heps cp out inp. (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints (FlattenedEntrypointsKindHiding heps) cp, HasEntrypoints (ParameterEntrypointsDerivation cp) cp heps) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp : inp) :-> out Source #

Version of entryCase_ for contracts with recursive delegate parameter that needs to be flattened. Use it with EpdDelegate when you don't need hierarchical entrypoints in autodoc. You can also hide particular entrypoints with the type parameter. Consider using entryCaseFlattened_ if you don't want to hide any entrypoints.

entryCaseFlattenedHiding :: forall heps cp out inp clauses. (CaseTC cp out inp clauses, DocumentEntrypoints (FlattenedEntrypointsKindHiding heps) cp, HasEntrypoints (ParameterEntrypointsDerivation cp) cp heps) => IsoRecTuple clauses -> (cp : inp) :-> out Source #

Version of entryCase for contracts with recursive delegate parameter that needs to be flattened. Use it with EpdDelegate when you don't need hierarchical entrypoints in autodoc. You can also hide particular entrypoints with the first type parameter. Consider using entryCaseFlattened if you don't want to hide any entrypoints.

 entryCaseFlattenedHiding @'[Ep1, Ep2] ...

isoErrorToVal :: (KnownError e, IsoValue e) => e -> (forall t. ErrorScope t => Value t -> r) -> r Source #

Implementation of errorToVal via IsoValue.

isoErrorFromVal :: (SingI t, KnownIsoT e, IsoValue e) => Value t -> Either Text e Source #

Implementation of errorFromVal via IsoValue.

simpleFailUsing :: forall e s t. IsError e => e -> s :-> t Source #

Basic implementation for failUsing.

typeDocMdDescriptionReferToError :: forall e. IsError e => Markdown Source #

Implementation of typeDocMdDescription (of TypeHasDoc typeclass) for Haskell types which sole purpose is to be error.

isInternalErrorClass :: ErrorClass -> Bool Source #

Whether given error class is about internal errors.

Internal errors are not enlisted on per-entrypoint basis, only once for the entire contract.

failUnexpected :: MText -> s :-> t Source #

Fail, providing a reference to the place in the code where this function is called.

Like error in Haskell code, this instruction is for internal errors only.

failCustom :: forall tag err s any. (MustHaveErrorArg tag (MText, err), CustomErrorHasDoc tag, KnownError err) => Label tag -> (err : s) :-> any Source #

Fail with given custom error.

failCustom_ :: forall tag s any. (MustHaveErrorArg tag (MText, ()), CustomErrorHasDoc tag) => Label tag -> s :-> any Source #

Specialization of failCustom for unit-arg errors.

failCustomNoArg :: forall tag s any. (MustHaveErrorArg tag MText, CustomErrorHasDoc tag) => Label tag -> s :-> any Source #

Fail with given custom error.

errorTagToText :: forall tag. KnownSymbol tag => Text Source #

errorTagToMText :: Label tag -> MText Source #

Demote error tag to term level.

gatherErrorTags :: (inp :-> out) -> HashSet MText Source #

Find all textual error tags that are used in typical FAILWITH patterns within given instruction. Map them to natural numbers.

addNewErrorTags :: ErrorTagMap -> HashSet MText -> ErrorTagMap Source #

Add more error tags to an existing ErrorTagMap. It is useful when your contract consists of multiple parts (e. g. in case of contract upgrade), you have existing map for some part and want to add tags from another part to it. You can pass empty map as existing one if you just want to build ErrorTagMap from a set of textual tags. See buildErrorTagMap.

buildErrorTagMap :: HashSet MText -> ErrorTagMap Source #

Build ErrorTagMap from a set of textual tags.

excludeErrorTags :: HasCallStack => ErrorTagExclusions -> ErrorTagMap -> ErrorTagMap Source #

Remove some error tags from map. This way you say to remain these string tags intact, while others will be converted to numbers when this map is applied.

Note that later you have to apply this map using applyErrorTagMapWithExclusions, otherwise an error would be raised.

applyErrorTagMap :: HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out Source #

For each typical FAILWITH that uses a string to represent error tag this function changes error tag to be a number using the supplied conversion map. It assumes that supplied map contains all such strings (and will error out if it does not). It will always be the case if you gather all error tags using gatherErrorTags and build ErrorTagMap from them using addNewErrorTags.

applyErrorTagMapWithExclusions :: HasCallStack => ErrorTagMap -> ErrorTagExclusions -> (inp :-> out) -> inp :-> out Source #

Similar to applyErrorTagMap, but for case when you have excluded some tags from map via excludeErrorTags. Needed, because both excludeErrorTags and this function do not tolerate unknown errors in contract code (for your safety).

useNumericErrors :: HasCallStack => (inp :-> out) -> (inp :-> out, ErrorTagMap) Source #

This function implements the simplest scenario of using this module's functionality: 1. Gather all error tags from a single instruction. 2. Turn them into error conversion map. 3. Apply this conversion.

errorFromValNumeric :: (SingI t, IsError e) => ErrorTagMap -> Value t -> Either Text e Source #

If you apply numeric error representation in your contract, errorFromVal will stop working because it doesn't know about this transformation. This function takes this transformation into account. If a number is used as a tag, but it is not found in the passed map, we conservatively preserve that number (because this whole approach is rather a heuristic).

errorToValNumeric :: IsError e => ErrorTagMap -> e -> (forall t. ConstantScope t => Value t -> r) -> r Source #

If you apply numeric error representation in your contract, errorToVal will stop working because it doesn't know about this transformation. This function takes this transformation into account. If a string is used as a tag, but it is not found in the passed map, we conservatively preserve that string (because this whole approach is rather a heuristic).

applyErrorTagToErrorsDoc :: HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out Source #

Modify documentation generated for given code so that all CustomError mention not their textual error tag rather respective numeric one from the given map.

If some documented error is not present in the map, it remains unmodified. This function may fail with error if contract uses some uncommon errors, see applyErrorTagToErrorsDocWith for details.

applyErrorTagToErrorsDocWith :: HasCallStack => [NumericErrorDocHandler] -> ErrorTagMap -> (inp :-> out) -> inp :-> out Source #

Extended version of applyErrorTagToErrorsDoc which accepts error handlers.

In most cases that function should be enough for your purposes, but it uses a fixed set of base handlers which may be not enough in case when you define your own errors. In this case define and pass all the necessary handlers to this function.

It fails with error if some of the errors used in the contract cannot be handled with given handlers.

customErrorDocHandler :: NumericErrorDocHandler Source #

Handler for all CustomErrors.

voidResultDocHandler :: NumericErrorDocHandler Source #

Handler for VoidResult.

baseErrorDocHandlers :: [NumericErrorDocHandler] Source #

Handlers for most common errors defined in Lorentz.

unaryExpr :: (forall s. (a : s) :-> (r : s)) -> Expr s0 s1 a -> Expr s0 s1 r Source #

Lift an instruction to an unary operation on expressions.

($:) :: (forall s. (a : s) :-> (r : s)) -> Expr s0 s1 a -> Expr s0 s1 r infixr 9 Source #

An alias for unaryExpr.

binaryExpr :: (forall s. (a : (b : s)) :-> (r : s)) -> Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r Source #

Lift an instruction to a binary operation on expressions.

(|+|) :: ArithOpHs Add a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 6 Source #

Expressions addition.

(|-|) :: ArithOpHs Sub a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 6 Source #

Expressions subtraction.

(|*|) :: ArithOpHs Mul a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 7 Source #

Expressions multiplication.

(|==|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|/=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|<|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|>|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|<=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|>=|) :: NiceComparable a => Expr s0 s1 a -> Expr s1 s2 a -> Expr s0 s2 Bool infix 4 Source #

Expressions comparison.

(|&|) :: ArithOpHs And a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 2 Source #

Bitwise/logical AND on expressions.

(|.|.|) :: ArithOpHs Or a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 1 Source #

An alias for |||.

(|^|) :: ArithOpHs Xor a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infixl 3 Source #

Bitwise/logical XOR on expressions.

(|<<|) :: ArithOpHs Lsl a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infix 8 Source #

Left shift on expressions.

(|>>|) :: ArithOpHs Lsr a b r => Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 r infix 8 Source #

Right shift on expressions.

(|:|) :: Expr s0 s1 a -> Expr s1 s2 [a] -> Expr s0 s2 [a] infixr 1 Source #

cons on expressions.

one :: a : s :-> [a] : s
one = take |:| nil

(|@|) :: Expr s0 s1 a -> Expr s1 s2 b -> Expr s0 s2 (a, b) infixr 0 Source #

Construct a simple pair.

trivialContract :: ((), storage) :-> ([Operation], Storage)
trivialContract = nil |@| cdr

This is useful as pair appears even in simple contracts. For more advanced types, use constructT.

(|%!|) :: Expr s0 s1 Integer -> Expr s1 s2 Natural -> Expr s0 s2 Rational infixl 7 Source #

Construct a Rational value from a given nominator and denominator. In case denominator is 0, fails with custom exception.

transferTokensE :: (NiceParameter p, IsNotInView) => ("arg" :! Expr s0 s1 p) -> ("amount" :! Expr s1 s2 Mutez) -> ("contract" :! Expr s2 s3 (ContractRef p)) -> Expr s0 s3 Operation Source #

Version of transferTokens instruction that accepts all the arguments as expressions.

transferTokensE
  ! #arg L.unit
  ! #amount (push zeroMutez)
  ! #contract take
  |:| nil

You can provide arguments in arbitrary order, but direction of stack changes flow is fixed: stack change in arg expression affects stack available in amount expression, and stack changes in amount expression affect stack changes in contract expression.

createContractE :: IsNotInView => ("delegate" :! Expr s0 s1 (Maybe KeyHash)) -> ("balance" :! Expr s1 s2 Mutez) -> ("storage" :! Expr s2 s3 st) -> ("contract" :! Contract p st vd) -> Expr s0 (TAddress p vd : s3) Operation Source #

Version of createContract instruction that accepts all the arguments as expressions.

createContractE
  ! #delegate none
  ! #balance (push zeroMutez)
  ! #storage unit
  ! #contract myContract

Note that this returns an operation, and pushes the address of the newly created contract as a side-effect.

viewE :: forall name arg ret p vd s0 s1 s2. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret, HasView vd name arg ret) => ("arg" :! Expr s0 s1 arg) -> ("address" :! Expr s1 s2 (TAddress p vd)) -> Expr s0 s2 ret Source #

Version of view instruction that accepts all the arguments as expressions.

viewE @"myview"
  ! #arg (push zeroMutez)
  ! #address (push addr)

stackRef :: forall (gn :: Nat) st n. (n ~ ToPeano gn, SingI n, RequireLongerThan st n) => PrintComment st Source #

Include a value at given position on stack into comment produced by printComment.

stackRef @0

the top of the stack

printComment :: PrintComment (ToTs s) -> s :-> s Source #

Print a comment. It will be visible in tests.

printComment "Hello world!"
printComment $ "On top of the stack I see " <> stackRef @0

justComment :: Text -> s :-> s Source #

comment :: CommentType -> s :-> s Source #

commentAroundFun :: Text -> (i :-> o) -> i :-> o Source #

commentAroundStmt :: Text -> (i :-> o) -> i :-> o Source #

testAssert :: HasCallStack => Text -> PrintComment (ToTs inp) -> (inp :-> (Bool : out)) -> inp :-> inp Source #

Test an invariant, fail if it does not hold.

This won't be included into production contract and is executed only in tests.

stackType :: forall s. s :-> s Source #

Fix the current type of the stack to be given one.

stackType @'[Natural]
stackType @(Integer : Natural : s)
stackType @'["balance" :! Integer, "toSpend" :! Integer, BigMap Address Integer]

Note that you can omit arbitrary parts of the type.

stackType @'["balance" :! Integer, "toSpend" :! _, BigMap _ _]

nop :: s :-> s Source #

dropN :: forall (n :: Nat) (s :: [Type]). (SingIPeano n, RequireLongerOrSameLength (ToTs s) (ToPeano n), Drop (ToPeano n) (ToTs s) ~ ToTs (Drop (ToPeano n) s)) => s :-> Drop (ToPeano n) s Source #

Drop top n elements from the stack.

dupNPeano :: forall (n :: Peano) a inp out. (ConstraintDUPNLorentz n inp out a, Dupable a) => inp :-> out Source #

dupN :: forall (n :: Nat) a inp out. (ConstraintDUPNLorentz (ToPeano n) inp out a, Dupable a) => inp :-> out Source #

digPeano :: forall (n :: Peano) inp out a. ConstraintDIGLorentz n inp out a => inp :-> out Source #

Version of dig which uses Peano number. It is intended for internal usage in Lorentz.

dig :: forall (n :: Nat) inp out a. ConstraintDIGLorentz (ToPeano n) inp out a => inp :-> out Source #

dugPeano :: forall (n :: Peano) inp out a. ConstraintDUGLorentz n inp out a => inp :-> out Source #

Version of dug which uses Peano number. It is intended for internal usage in Lorentz.

dug :: forall (n :: Nat) inp out a. ConstraintDUGLorentz (ToPeano n) inp out a => inp :-> out Source #

ifNone :: (s :-> s') -> ((a : s) :-> s') -> (Maybe a : s) :-> s' Source #

car :: ((a, b) : s) :-> (a : s) Source #

cdr :: ((a, b) : s) :-> (b : s) Source #

unpair :: ((a, b) : s) :-> (a : (b : s)) Source #

ifLeft :: ((a : s) :-> s') -> ((b : s) :-> s') -> (Either a b : s) :-> s' Source #

emptySet :: NiceComparable e => s :-> (Set e : s) Source #

emptyMap :: (NiceComparable k, KnownValue v) => s :-> (Map k v : s) Source #

emptyBigMap :: (NiceComparable k, NiceNoBigMap v) => s :-> (BigMap k v : s) Source #

mem :: MemOpHs c => (MemOpKeyHs c : (c : s)) :-> (Bool : s) Source #

pairGet :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz n pair => (pair : s) :-> (PairGetHs (ToPeano n) pair : s) Source #

getAndUpdate :: (GetOpHs c, UpdOpHs c, KnownValue (GetOpValHs c), UpdOpKeyHs c ~ GetOpKeyHs c) => (UpdOpKeyHs c : (UpdOpParamsHs c : (c : s))) :-> (Maybe (GetOpValHs c) : (c : s)) Source #

pairUpdate :: forall (n :: Nat) (val :: Type) (pair :: Type) (s :: [Type]). ConstraintPairUpdateLorentz n val pair => (val : (pair : s)) :-> (PairUpdateHs (ToPeano n) val pair : s) Source #

failingWhenPresent :: forall c k s v st e. (MemOpHs c, k ~ MemOpKeyHs c, NiceConstant e, Dupable c, Dupable (MemOpKeyHs c), st ~ (k : (v : (c : s)))) => (forall s0. (k : s0) :-> (e : s0)) -> st :-> st Source #

Helper instruction.

Checks whether given key present in the storage and fails if it is. This instruction leaves stack intact.

updateNew :: forall c k s e. (UpdOpHs c, GetOpHs c, k ~ UpdOpKeyHs c, k ~ GetOpKeyHs c, KnownValue (GetOpValHs c), NiceConstant e, Dupable k) => (forall s0. (k : s0) :-> (e : s0)) -> (k : (UpdOpParamsHs c : (c : s))) :-> (c : s) Source #

Like update, but throw an error on attempt to overwrite existing entry.

if_ :: (s :-> s') -> (s :-> s') -> (Bool : s) :-> s' Source #

ifCons :: ((a : (List a : s)) :-> s') -> (s :-> s') -> (List a : s) :-> s' Source #

loopLeft :: ((a : s) :-> (Either a b : s)) -> (Either a b : s) :-> (b : s) Source #

lambda :: ZipInstrs [i, o] => (IsNotInView => i :-> o) -> s :-> (WrappedLambda i o : s) Source #

lambdaRec :: forall i o s. (ZipInstrs [i, o], KnownList i) => (IsNotInView => (i ++ '[WrappedLambda i o]) :-> o) -> s :-> (WrappedLambda i o : s) Source #

exec :: (a : (Lambda a b : s)) :-> (b : s) Source #

execute :: forall i o s. Each [KnownList, ZipInstr] [i, o] => (WrappedLambda i o : (i ++ s)) :-> (o ++ s) Source #

Similar to exec but works for lambdas with arbitrary size of input and output.

Note that this instruction has its arguments flipped, lambda goes first. This seems to be the only reasonable way to achieve good inference.

applicate :: forall a b c inp2nd inpTail s. (NiceConstant a, ZipInstr b, b ~ (inp2nd : inpTail)) => (a : (WrappedLambda (a : b) c : s)) :-> (WrappedLambda b c : s) Source #

Version of apply that works for lambdas with arbitrary length input and output.

dip :: forall a s s'. HasCallStack => (s :-> s') -> (a : s) :-> (a : s') Source #

dipNPeano :: forall (n :: Peano) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]). ConstraintDIPNLorentz n inp out s s' => (s :-> s') -> inp :-> out Source #

Version of dipN which uses Peano number. It is intended for internal usage in Lorentz.

dipN :: forall (n :: Nat) (inp :: [Type]) (out :: [Type]) (s :: [Type]) (s' :: [Type]). ConstraintDIPNLorentz (ToPeano n) inp out s s' => (s :-> s') -> inp :-> out Source #

packRaw :: forall a s. NicePackedValue a => (a : s) :-> (ByteString : s) Source #

unpackRaw :: forall a s. NiceUnpackedValue a => (ByteString : s) :-> (Maybe a : s) Source #

concat' :: ConcatOpHs c => (List c : s) :-> (c : s) Source #

isNat :: (Integer : s) :-> (Maybe Natural : s) Source #

rsub :: ArithOpHs Sub n m r => (m : (n : s)) :-> (r : s) Source #

ediv :: ArithOpHs EDiv n m r => (n : (m : s)) :-> (r : s) Source #

subMutez :: (Mutez : (Mutez : s)) :-> (Maybe Mutez : s) Source #

rsubMutez :: (Mutez : (Mutez : s)) :-> (Maybe Mutez : s) Source #

neg :: UnaryArithOpHs Neg n => (n : s) :-> (UnaryArithResHs Neg n : s) Source #

lsl :: ArithOpHs Lsl n m r => (n : (m : s)) :-> (r : s) Source #

lsr :: ArithOpHs Lsr n m r => (n : (m : s)) :-> (r : s) Source #

eq0 :: UnaryArithOpHs Eq' n => (n : s) :-> (UnaryArithResHs Eq' n : s) Source #

neq0 :: UnaryArithOpHs Neq n => (n : s) :-> (UnaryArithResHs Neq n : s) Source #

lt0 :: UnaryArithOpHs Lt n => (n : s) :-> (UnaryArithResHs Lt n : s) Source #

gt0 :: UnaryArithOpHs Gt n => (n : s) :-> (UnaryArithResHs Gt n : s) Source #

le0 :: UnaryArithOpHs Le n => (n : s) :-> (UnaryArithResHs Le n : s) Source #

ge0 :: UnaryArithOpHs Ge n => (n : s) :-> (UnaryArithResHs Ge n : s) Source #

view' :: forall name ret arg s. (HasCallStack, KnownSymbol name, KnownValue arg, NiceViewable ret) => (arg : (Address : s)) :-> (Maybe ret : s) Source #

Manual variation of VIEW instruction. It is pretty much like Michelson's VIEW, you must make sure that the compiler can infer the argument and return types of the view.

In most cases prefer view instead.

self :: forall p s. (NiceParameterFull p, ForbidExplicitDefaultEntrypoint p, IsNotInView) => s :-> (ContractRef p : s) Source #

Get a reference to the current contract.

Note that, similar to CONTRACT instruction, in Michelson SELF instruction can accept an entrypoint as field annotation, and without annotation specified it creates a contract value which calls the default entrypoint.

This particular function carries the behaviour of SELF before introduction of lightweight entrypoints feature. Thus the contract must not have explicit "default" entrypoint for this to work.

If you are going to call a specific entrypoint of the contract, see selfCalling.

selfCalling :: forall p mname s. (NiceParameterFull p, IsNotInView) => EntrypointRef mname -> s :-> (ContractRef (GetEntrypointArgCustom p mname) : s) Source #

Make a reference to the current contract, maybe a specific entrypoint.

Note that, since information about parameter of the current contract is not carried around, in this function you need to specify parameter type p explicitly.

contractCalling :: forall cp epRef epArg addr vd s. (HasEntrypointArg cp epRef epArg, ToTAddress_ cp vd addr) => epRef -> (addr : s) :-> (Maybe (ContractRef epArg) : s) Source #

Make a reference to a contract, maybe a specific entrypoint.

When calling this function, make sure that parameter type is known. It's recommended that you supply TAddress with a concrete parameter as the stack argument.

unsafeContractCalling :: forall arg s. NiceParameter arg => EpName -> (Address : s) :-> (Maybe (ContractRef arg) : s) Source #

Specialized version of contractCalling for the case when you do not have compile-time evidence of appropriate HasEntrypointArg. For instance, if you have untyped EpName you can not have this evidence (the value is only available in runtime). If you have typed EntrypointRef, use eprName to construct EpName.

runFutureContract :: forall p s. NiceParameter p => (FutureContract p : s) :-> (Maybe (ContractRef p) : s) Source #

Version of contract instruction which may accept address with already specified entrypoint name.

Also you cannot specify entrypoint name here because this could result in conflict.

epAddressToContract :: forall p s. NiceParameter p => (EpAddress : s) :-> (Maybe (ContractRef p) : s) Source #

Similar to runFutureContract, works with EpAddress.

Validity of such operation cannot be ensured at compile time.

transferTokens :: forall p s. (NiceParameter p, IsNotInView) => (p : (Mutez : (ContractRef p : s))) :-> (Operation : s) Source #

setDelegate :: IsNotInView => (Maybe KeyHash : s) :-> (Operation : s) Source #

createContract :: forall p g vd s. IsNotInView => Contract p g vd -> (Maybe KeyHash : (Mutez : (g : s))) :-> (Operation : (TAddress p vd : s)) Source #

implicitAccount :: (KeyHash : s) :-> (ContractRef () : s) Source #

now :: s :-> (Timestamp : s) Source #

minBlockTime :: s :-> (Natural : s) Source #

amount :: s :-> (Mutez : s) Source #

votingPower :: (KeyHash : s) :-> (Natural : s) Source #

totalVotingPower :: s :-> (Natural : s) Source #

checkSignature :: BytesLike bs => (PublicKey : (TSignature bs : (bs : s))) :-> (Bool : s) Source #

blake2B :: BytesLike bs => (bs : s) :-> (Hash Blake2b bs : s) Source #

sha3 :: BytesLike bs => (bs : s) :-> (Hash Sha3 bs : s) Source #

keccak :: BytesLike bs => (bs : s) :-> (Hash Keccak bs : s) Source #

hashKey :: (PublicKey : s) :-> (KeyHash : s) Source #

pairingCheck :: ([(Bls12381G1, Bls12381G2)] : s) :-> (Bool : s) Source #

source :: s :-> (Address : s) Source #

Warning: Using source is considered a bad practice. Consider using sender instead until further investigation

sender :: s :-> (Address : s) Source #

address :: (ContractRef a : s) :-> (Address : s) Source #

selfAddress :: s :-> (Address : s) Source #

ticket :: NiceComparable a => (a : (Natural : s)) :-> (Maybe (Ticket a) : s) Source #

readTicket :: (Ticket a : s) :-> (ReadTicket a : (Ticket a : s)) Source #

Note: for more advanced helpers for tickets see Lorentz.Tickets module.

splitTicket :: (Ticket a : ((Natural, Natural) : s)) :-> (Maybe (Ticket a, Ticket a) : s) Source #

Note: for more advanced helpers for tickets see Lorentz.Tickets module.

splitTicketNamed :: forall n1 n2 a s. (Ticket a : ((n1 :! Natural, n2 :! Natural) : s)) :-> (Maybe (n1 :! Ticket a, n2 :! Ticket a) : s) Source #

Version of splitTicket with entries named.

joinTickets :: ((Ticket a, Ticket a) : s) :-> (Maybe (Ticket a) : s) Source #

Note: for more advanced helpers for tickets see Lorentz.Tickets module.

openChest :: (ChestKey : (Chest : (Natural : s))) :-> (OpenChest : s) Source #

Deprecated: Due to a vulnerability discovered in time-lock protocol, OPEN_CHEST is temporarily deprecated since Lima

chainId :: s :-> (ChainId : s) Source #

level :: s :-> (Natural : s) Source #

framed :: forall s i o. (KnownList i, KnownList o) => (i :-> o) -> (i ++ s) :-> (o ++ s) Source #

Execute given instruction on truncated stack.

This instruction requires you to specify the piece of stack to truncate as type argument.

The complexity of this operation is linear in the number of instructions. If possible, avoid nested uses as that would imply multiple traversals. Worst case, complexity can become quadratic.

emit' :: forall t s. NicePackedValue t => FieldAnn -> Maybe (Notes (ToT t)) -> (t : s) :-> (Operation : s) Source #

emitAuto :: forall t s. NicePackedValue t => FieldAnn -> (t : s) :-> (Operation : s) Source #

Version of emit that omits the type annotation, letting the runtime infer it instead.

invertIso :: LIso a b -> LIso b a Source #

Invert an isomorphism.

involutedIso :: Fn a a -> LIso a a Source #

Given a function that is its own inverse, make an LIso using it in both directions.

checkedCoerceIso :: Coercible_ a b => LIso a b Source #

The isomorphism between two values with identical representation and semantics.

forcedCoerceIso :: MichelsonCoercible a b => LIso a b Source #

The isomorphism between two values with identical representation.

The same precautions as for forcedCoerce apply here.

namedIso :: Label n -> LIso a (n :! a) Source #

The isomorphism between raw and named value.

nonIso :: (NiceConstant a, NiceComparable a) => a -> LIso (Maybe a) a Source #

Absence of value on the left hand side is associated with the given value on the right hand side.

nonDefIso :: (LDefault a, NiceConstant a) => LIso (Maybe a) a Source #

Absence of value on the left hand side is associated with the default value on the right hand side.

This is more general version of nonIso ldef since it can work with e.g. containers.

mkLambda :: (IsNotInView => i :-> o) -> WrappedLambda i o Source #

A constructor providing the required constraint for WrappedLambda. This is the only way to construct a lambda that uses operations forbidden in views.

mkLambdaRec :: (IsNotInView => (i ++ '[WrappedLambda i o]) :-> o) -> WrappedLambda i o Source #

A constructor providing the required constraint for WrappedLambda. This is the only way to construct a lambda that uses operations forbidden in views.

neq :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

lt :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

gt :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

le :: NiceComparable n => (n : (n : s)) :-> (Bool : s) Source #

ifEq0 :: IfCmp0Constraints a Eq' => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifGe0 :: IfCmp0Constraints a Ge => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifGt0 :: IfCmp0Constraints a Gt => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifLe0 :: IfCmp0Constraints a Le => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifLt0 :: IfCmp0Constraints a Lt => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifNeq0 :: IfCmp0Constraints a Neq => (s :-> s') -> (s :-> s') -> (a : s) :-> s' Source #

ifEq :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

ifGe :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

ifGt :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

ifLe :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

ifLt :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

ifNeq :: NiceComparable a => (s :-> s') -> (s :-> s') -> (a : (a : s)) :-> s' Source #

fail_ :: a :-> c Source #

Warning: fail_ remains in code

Analog of the FAIL macro in Michelson. Its usage is discouraged because it doesn't carry any information about failure.

assertEq0 :: (IfCmp0Constraints a Eq', IsError err) => err -> (a : s) :-> s Source #

assertNeq0 :: (IfCmp0Constraints a Neq, IsError err) => err -> (a : s) :-> s Source #

assertLt0 :: (IfCmp0Constraints a Lt, IsError err) => err -> (a : s) :-> s Source #

assertGt0 :: (IfCmp0Constraints a Gt, IsError err) => err -> (a : s) :-> s Source #

assertLe0 :: (IfCmp0Constraints a Le, IsError err) => err -> (a : s) :-> s Source #

assertGe0 :: (IfCmp0Constraints a Ge, IsError err) => err -> (a : s) :-> s Source #

assertEq :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertNeq :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertLt :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertGt :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertLe :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertGe :: (NiceComparable a, IsError err) => err -> (a : (a : s)) :-> s Source #

assertNone :: IsError err => err -> (Maybe a : s) :-> s Source #

assertSome :: IsError err => err -> (Maybe a : s) :-> (a : s) Source #

assertLeft :: IsError err => err -> (Either a b : s) :-> (a : s) Source #

assertRight :: IsError err => err -> (Either a b : s) :-> (b : s) Source #

assertUsing :: IsError a => a -> (Bool : s) :-> s Source #

dropX :: forall (n :: Nat) a inp out s s'. (ConstraintDIPNLorentz (ToPeano n) inp out s s', s ~ (a ': s'), SingIPeano n) => inp :-> out Source #

Custom Lorentz macro that drops element with given index (starting from 0) from the stack.

cloneX :: forall (n :: Nat) a s. CloneX (ToPeano n) a s => (a : s) :-> (a : CloneXT (ToPeano n) a s) Source #

Duplicate the top of the stack n times.

For example, `cloneX @3` has type `a : s :-> a : a : a : a : s`.

duupX :: forall (n :: Nat) a s s'. (ConstraintDUPNLorentz (ToPeano n) s s' a, Dupable a) => s :-> (a ': s) Source #

DUU+P macro. For example, duupX 3 is DUUUP@, it puts the 3-rd (starting from 1) element to the top of the stack.

Note that DUU+P has since been added as the DUP n instruction and so this macro is defined simply as follows:

duupX = dupN @n

framedN :: forall n nNat s i i' o o'. (nNat ~ ToPeano n, i' ~ Take nNat i, s ~ Drop nNat i, i ~ (i' ++ s), o ~ (o' ++ s), KnownList i', KnownList o') => (i' :-> o') -> i :-> o Source #

Version of framed which accepts number of elements on input stack which should be preserved.

You can treat this macro as calling a Michelson function with given number of arguments.

Given a stack of 3 elements, >>> arg = (1 :: Integer) ::: (2 :: Integer) ::: (3 :: Integer)

framedN will have access to exactly the number of elements specified, >>> framedN 1 drop -$ arg 2 ::: 3 >>> framedN1 (drop # drop) -$ arg ... ... error: ... Couldn't match type: '[] ... with: Integer : o'0 ...

When the number of elements is larger than the size of the stack, framedN will have access to all of them: >>> framedN @5 (drop # drop) -$ arg 3

But not more than there are on stack: >>> framedN @5 (drop # drop # drop # drop) -$ arg ... ... error: ... Couldn't match type ‘ZippedStackRepr a1 (ZippedStackRepr a0 out)’ ... with ‘Integer’ ...

carN :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz ((2 * n) + 1) pair => (pair : s) :-> (PairGetHs (ToPeano ((2 * n) + 1)) pair : s) Source #

cdrN :: forall (n :: Nat) (pair :: Type) (s :: [Type]). ConstraintPairGetLorentz (2 * n) pair => (pair : s) :-> (PairGetHs (ToPeano (2 * n)) pair : s) Source #

caar :: (((a, b1), b2) : s) :-> (a : s) Source #

>>> caar == car # car
True

>>> caar -$ ((True, 1), ())
True

cadr :: (((a, b1), b2) : s) :-> (b1 : s) Source #

>>> cadr == car # cdr
True

>>> cadr -$ ((True, 1), ())
1

cdar :: ((a1, (a2, b)) : s) :-> (a2 : s) Source #

>>> cdar == cdr # car
True

>>> cdar -$ (True, (1, ()))
1

cddr :: ((a1, (a2, b)) : s) :-> (b : s) Source #

>>> cddr == cdr # cdr
True

>>> cddr -$ (True, (1, ()))
()

ifRight :: ((b : s) :-> s') -> ((a : s) :-> s') -> (Either a b : s) :-> s' Source #

>>> ifRight (not @Bool) (dup @Integer # compare # eq0) == ifLeft (dup @Integer # compare # eq0) (not @Bool)
True

>>> ifRight not (dup # compare # eq0) -$ (Right True :: Either Integer Bool)
False

>>> ifRight not (dup # compare # eq0) -$ (Left 1 :: Either Integer Bool)
True

ifSome :: ((a : s) :-> s') -> (s :-> s') -> (Maybe a : s) :-> s' Source #

>>> ifSome (dup @Integer # compare # eq0) (push False) == ifNone (push False) (dup @Integer # compare # eq0)
True

>>> ifSome (dup # compare # eq0) (push False) -$ (Just 1 :: Maybe Integer)
True

>>> ifSome (dup # compare # eq0) (push False) -$ (Nothing :: Maybe Integer)
False

when_ :: (s :-> s) -> (Bool : s) :-> s Source #

>>> when_ (push 5 # add @Integer @Integer) == if_ (push 5 # add @Integer @Integer) nop
True

>>> when_ (push 5 # add @Integer) -$ True ::: 3
8

>>> when_ (push 5 # add @Integer) -$ False ::: 3
3

unless_ :: (s :-> s) -> (Bool : s) :-> s Source #

>>> unless_ (push 5 # add @Integer @Integer) == if_ nop (push 5 # add @Integer @Integer)
True

>>> unless_ (push 5 # add @Integer) -$ True ::: 3
3

>>> unless_ (push 5 # add @Integer) -$ False ::: 3
8

whenSome :: ((a : s) :-> s) -> (Maybe a : s) :-> s Source #

>>> whenSome drop == ifSome drop nop
True

>>> whenSome drop -$ Just 1 ::: ()
()

whenNone :: (s :-> (a : s)) -> (Maybe a : s) :-> (a : s) Source #

>>> whenNone (push True) == ifNone (push True) nop
True

>>> whenNone (push 1) -$ (Nothing :: Maybe Integer)
1

mapCar :: (forall s0. (a : s0) :-> (a1 : s0)) -> ((a, b) : s) :-> ((a1, b) : s) Source #

>>> mapCar (not @Bool) == unpair # (not @Bool) # pair
True

>>> mapCar not -$ (True, 1)
(False,1)

mapCdr :: (forall s0. (b : s0) :-> (b1 : s0)) -> ((a, b) : s) :-> ((a, b1) : s) Source #

>>> mapCdr (not @Bool) == unpair # dip (not @Bool) # pair
True

>>> mapCdr not -$ (1, True)
(1,False)

papair :: (a : (b : (c : s))) :-> (((a, b), c) : s) Source #

>>> papair == pair # pair
True

>>> papair -$ True ::: 1 ::: ()
((True,1),())

ppaiir :: (a : (b : (c : s))) :-> ((a, (b, c)) : s) Source #

>>> ppaiir == dip pair # pair
True

>>> ppaiir -$ True ::: 1 ::: ()
(True,(1,()))

setCar :: ((a, b1) : (b2 : s)) :-> ((b2, b1) : s) Source #

>>> setCar == cdr # swap # pair
True

>>> setCar -$ (True, 1) ::: ()
((),1)

setCdr :: ((a, b1) : (b2 : s)) :-> ((a, b2) : s) Source #

>>> setCdr == car # pair
True

>>> setCdr -$ (True, 1) ::: ()
(True,())

setInsert :: NiceComparable e => (e : (Set e : s)) :-> (Set e : s) Source #

Insert given element into set.

This is a separate function from mapUpdate because stacks they operate with differ in length.

deleteMap :: forall k v s. (MapInstrs map, NiceComparable k, KnownValue v) => (k : (map k v : s)) :-> (map k v : s) Source #

Delete element from the map.

mapInsert :: (MapInstrs map, NiceComparable k) => (k : (v : (map k v : s))) :-> (map k v : s) Source #

Insert given element into map.

mapInsertNew :: (MapInstrs map, IsoValue (map k v), NiceComparable k, NiceConstant e, Dupable k, KnownValue v) => (forall s0. (k : s0) :-> (e : s0)) -> (k : (v : (map k v : s))) :-> (map k v : s) Source #

Insert given element into map, ensuring that it does not overwrite any existing entry.

As first argument accepts container name (for error message).

setInsertNew :: (NiceConstant err, NiceComparable e, Dupable e, Dupable (Set e)) => (forall s0. (e : s0) :-> (err : s0)) -> (e : (Set e : s)) :-> (Set e : s) Source #

Insert given element into set, ensuring that it does not overwrite any existing entry.

As first argument accepts container name.

setDelete :: NiceComparable e => (e : (Set e : s)) :-> (Set e : s) Source #

Delete given element from the set.

replaceN :: forall (n :: Nat) a (s :: [Type]) (s1 :: [Type]) (tail :: [Type]). (ConstraintReplaceNLorentz (ToPeano (n - 1)) s a s1 tail, ReplaceN (ToPeano n) s a s1 tail) => (a ': s) :-> s Source #

Replace nth element (0-indexed) with the one on the top of the stack. For example, `replaceN 3` replaces the 3rd element with the 0th one. `replaceN0` is not a valid operation (and it is not implemented). `replaceN 1` is equivalent to `swap # drop` (and is the only one implemented like this). In all other cases `replaceNn` will drop the nth element (`dipN n drop`) and then put the 0th one in its place (`dug(n-1)`).

updateN :: forall (n :: Nat) a b (s :: [Type]) (mid :: [Type]) (tail :: [Type]). (ConstraintUpdateNLorentz (ToPeano (n - 1)) s a b mid tail, UpdateN (ToPeano n) s a b mid tail) => ('[a, b] :-> '[b]) -> (a ': s) :-> s Source #

Replaces the nth element (0-indexed) with the result of the given "updating" instruction (binary with the return type equal to the second argument) applied to the 0th element and the nth element itself. For example, updateN @3 cons replaces the 3rd element with the result of cons applied to the topmost element and the 3rd one. updateN @0 instr is not a valid operation (and it is not implemented). updateN @1 instr is equivalent to instr (and so is implemented). updateN @2 instr is equivalent to swap # dip instr (and so is implemented). In all other cases updateN @n instr will put the topmost element right above the nth one (dug @(n-1)) and then apply the function to them in place (dipN @(n-1) instr).

view_ :: (NiceParameter r, Dupable storage, IsNotInView) => (forall s0. (a : (storage : s0)) :-> (r : s0)) -> (View_ a r : (storage : s)) :-> ((List Operation, storage) : s) Source #

mkView_ :: ToContractRef r contract => a -> contract -> View_ a r Source #

Polymorphic version of View_ constructor.

wrapView_ :: ((a, ContractRef r) : s) :-> (View_ a r : s) Source #

Wrap internal representation of view into View_ itself.

View_ is part of public standard and should not change often.

unwrapView_ :: (View_ a r : s) :-> ((a, ContractRef r) : s) Source #

Unwrap View_ into its internal representation.

View_ is part of public standard and should not change often.

void_ :: forall a b s s' anything. (IsError (VoidResult b), NiceConstant b) => ((a : s) :-> (b : s')) -> (Void_ a b : s) :-> anything Source #

mkVoid :: forall b a. a -> Void_ a b Source #

wrapVoid :: ((a, Lambda b b) : s) :-> (Void_ a b : s) Source #

Wrap internal representation of void into Void_ itself.

Void_ is part of public standard and should not change often.

unwrapVoid :: (Void_ a b : s) :-> ((a, Lambda b b) : s) Source #

Unwrap Void_ into its internal representation.

Void_ is part of public standard and should not change often.

voidResultTag :: MText Source #

dupTop2 :: forall (a :: Type) (b :: Type) (s :: [Type]). (Dupable a, Dupable b) => (a ': (b ': s)) :-> (a ': (b ': (a ': (b ': s)))) Source #

Duplicate two topmost items on top of the stack.

fromOption :: NiceConstant a => a -> (Maybe a : s) :-> (a : s) Source #

isSome :: (Maybe a : s) :-> (Bool : s) Source #

buildView_ :: (HasNoOpToT r, ForbidNestedBigMaps (ToT r)) => (a -> Doc) -> View_ a r -> Doc Source #

buildViewTuple_ :: (HasNoOpToT r, ForbidNestedBigMaps (ToT r), TupleF a) => View_ a r -> Doc Source #

addressToEpAddress :: (Address : s) :-> (EpAddress : s) Source #

pushContractRef :: NiceParameter arg => (forall s0. (FutureContract arg : s) :-> s0) -> ContractRef arg -> s :-> (ContractRef arg : s) Source #

Push a value of contract type.

Doing this via push instruction is not possible, so we need to perform extra actions here.

Aside from contract value itself you will need to specify which error to throw in case this value is not valid.

idiv :: ArithOpHs IDiv n d q => (n : (d : s)) :-> (q : s) Source #

Integer division.

>>> idiv -$ (5 :: Integer) ::: (2 :: Integer)
Just 2

>>> idiv -$ (5 :: Integer) ::: (0 :: Integer)
Nothing

imod :: ArithOpHs IMod n d r => (n : (d : s)) :-> (r : s) Source #

Integer modulus.

>>> imod -$ (5 :: Integer) ::: (2 :: Integer)
Just 1

>>> imod -$ (5 :: Integer) ::: (0 :: Integer)
Nothing

lPackValueRaw :: forall a. NicePackedValue a => a -> ByteString Source #

lUnpackValueRaw :: forall a. NiceUnpackedValue a => ByteString -> Either UnpackError a Source #

lPackValue :: forall a. NicePackedValue a => a -> Packed a Source #

lUnpackValue :: forall a. NiceUnpackedValue a => Packed a -> Either UnpackError a Source #

lEncodeValue :: forall a. NiceUntypedValue a => a -> ByteString Source #

valueToScriptExpr :: forall t. NicePackedValue t => t -> ByteString Source #

This function transforms Lorentz values into script_expr.

script_expr is used in RPC as an argument in entrypoint designed for getting value by key from the big_map in Babylon. In order to convert value to the script_expr we have to pack it, take blake2b hash and add specific expr prefix. Take a look at https://gitlab.com/tezos/tezos/blob/6e25ae8eb385d9975a30388c7a7aa2a9a65bf184/src/proto_005_PsBabyM1/lib_protocol/script_expr_hash.ml and https://gitlab.com/tezos/tezos/blob/6e25ae8eb385d9975a30388c7a7aa2a9a65bf184/src/proto_005_PsBabyM1/lib_protocol/contract_services.ml#L136 for more information.

expressionToScriptExpr :: Expression -> ByteString Source #

Similar to valueToScriptExpr, but for values encoded as Expressions. This is only used in tests.

printLorentzValue :: forall v. NiceUntypedValue v => Bool -> v -> LText Source #

Pretty-print a Haskell value as Michelson one.

printLorentzContract :: Bool -> Contract cp st vd -> LText Source #

Pretty-print a Lorentz contract into Michelson code.

mkRange :: forall range lower upper a. NiceRange range lower upper a => a -> a -> range a Source #

Construct a Range. Bear in mind, no checks are performed, so this can construct empty ranges.

You can control whether boundaries are included or excluded by choosing the appropriate type out of Range, RangeIE, RangeEI and RangeEE, either via a type application or a type annotation. Alternatively, you can set lower and upper type arguments to IncludeBoundary or ExcludeBoundary. If unspecified, the default is to include both boundaries.

>>> pretty $ mkRange 123 456
[123, 456]

>>> pretty $ mkRange 123 123
[123, 123]

>>> pretty $ mkRange 123 0 -- note this range is empty!
[123, 0]

>>> pretty (mkRange 123 456 :: RangeEE Integer)
(123, 456)

>>> pretty $ mkRange @RangeIE 123 456
[123, 456)

>>> pretty $ mkRange @_ @'IncludeBoundary @'ExcludeBoundary 123 456
[123, 456)

>>> pretty $ mkRange @RangeEI 123 456
(123, 456]

>>> pretty $ mkRange @_ @'ExcludeBoundary @'IncludeBoundary 123 456
(123, 456]

mkRange_ :: NiceRange range lower upper a => (("min" :! a) : (("max" :! a) : s)) :-> (range a : s) Source #

The Lorentz version of mkRange

>>> pretty $ mkRange_ -$ (#min :! (123 :: Integer)) ::: (#max :! (123 :: Integer))
[123, 123]

>>> pretty $ mkRange_ @RangeEE -$ (#min :! (123 :: Integer)) ::: (#max :! (123 :: Integer))
(123, 123)

Notice the latter range is empty by construction.

mkRangeFor :: (NiceRange range lower upper a, Num a) => a -> a -> range a Source #

Construct a range by specifying the start and length instead of lower and upper bounds. lower = start, and upper = start + length.

Note this can still construct empty ranges if length is negative.

See mkRange for the information on how to control boundary inclusion.

>>> pretty $ mkRangeFor 123 123
[123, 246]

>>> pretty $ mkRangeFor 123 (-123) -- empty range
[123, 0]

mkRangeFor_ :: (NiceRange range lower upper a, Dupable a, ArithOpHs Add a b a) => (("start" :! a) : (("length" :! b) : s)) :-> (range a : s) Source #

The Lorentz version of mkRangeFor. Note that length can be of different type from start.

>>> pretty $ mkRangeFor_ -$ (#start :! (123 :: Integer)) ::: (#length :! (123 :: Natural))
[123, 246]

mkRangeForSafe_ :: forall a b s. (Dupable a, ArithOpHs Add a b a, ToT b ~ 'TNat) => (("start" :! a) : (("length" :! b) : s)) :-> (Range a : s) Source #

A version of mkRangeFor_ that requires length to be isomorphic to a nat and the range to be inclusive in both bounds. This guarantees that the range is non-empty.

>>> pretty $ mkRangeForSafe_ -$ (#start :! (123 :: Integer)) ::: (#length :! (1 :: Natural))
[123, 124]

fromRange_ :: NiceRange range lower upper a => (range a : s) :-> ((a, a) : s) Source #

Convert a Range to a pair of (lower, upper)

>>> mkRangeForSafe_ # fromRange_ -$ #start :! (123 :: Integer) ::: #length :! (456 :: Natural)
(123,579)

toRange_ :: NiceRange range lower upper a => ((a, a) : s) :-> (range a : s) Source #

Convert a pair of (lower, upper) to Range. This has the potential to construct an empty range.

>>> pretty (toRange_ -$ (123, 456) :: Range Integer)
[123, 456]

>>> pretty (toRange_ -$ (123, -100500) :: Range Integer) -- empty range
[123, -100500]

rangeLower :: forall range lower upper a. NiceRange range lower upper a => range a -> a Source #

Get a range's lower bound

rangeUpper :: forall range lower upper a. NiceRange range lower upper a => range a -> a Source #

Get a range's upper bound.

rangeLower_ :: NiceRange range lower upper a => (range a : s) :-> (a : s) Source #

Get the lower bound of a Range

>>> mkRange_ # rangeLower_ -$ #min :! (123 :: Integer) ::: #max :! (456 :: Integer)
123

rangeUpper_ :: NiceRange range lower upper a => (range a : s) :-> (a : s) Source #

Get the upper bound of a Range

>>> mkRange_ # rangeUpper_ -$ #min :! (123 :: Integer) ::: #max :! (456 :: Integer)
456

inRange_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (range a : (a : s)) :-> (Bool : s) Source #

Lorentz version of inRange.

>>> range = mkRange 0 10 :: RangeEE Integer
>>> testCode = push range # inRange_
>>> testCode -$ 123
False
>>> testCode -$ 10
False
>>> testCode -$ 0
False
>>> testCode -$ -123
False
>>> testCode -$ 1
True
>>> testCode -$ 5
True

inRangeCmp :: forall range lower upper a. (NiceRange range lower upper a, Ord a) => range a -> a -> Ordering Source #

Check if a value is in range, and return Ordering. This function returns EQ if the value is in range, LT if it underflows, and 'GT if it overflows.

>>> inRangeCmp (mkRange -2 2) <$> [-4..4]
[LT,LT,EQ,EQ,EQ,EQ,EQ,GT,GT]

>>> inRangeCmp (mkRange @RangeIE -2 2) <$> [-4..4]
[LT,LT,EQ,EQ,EQ,EQ,GT,GT,GT]

inRangeCmp_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (range a : (a : s)) :-> (Integer : s) Source #

Lorentz version of inRangeCmp. Instead of Ordering, returns an Integer, -1 if the value underflows, 0 if it's in range and 1 if it overflows.

Use inRange_ if you don't particularly care whether the range is under- or overflowed.

>>> range = mkRange 0 10 :: Range Integer
>>> testCode = push range # inRangeCmp_
>>> testCode -$ 123
1
>>> testCode -$ -123
-1
>>> testCode -$ 5
0

>>> push (mkRange 0 10 :: RangeIE Integer) # inRangeCmp_ -$ 0
0
>>> push (mkRange 0 10 :: RangeIE Integer) # inRangeCmp_ -$ 10
1

>>> push (mkRange 0 10 :: RangeEI Integer) # inRangeCmp_ -$ 0
-1
>>> push (mkRange 0 10 :: RangeEI Integer) # inRangeCmp_ -$ 10
0

>>> push (mkRange 0 10 :: RangeEE Integer) # inRangeCmp_ -$ 0
-1
>>> push (mkRange 0 10 :: RangeEE Integer) # inRangeCmp_ -$ 10
1

When lower and upper boundaries are the same and at least one boundary is exclusive, it is ambiguous whether the value on the boundary overflows or underflows. In this case, lower boundary takes precedence if it's exclusive.

>>> push (mkRange 0 0 :: RangeIE Integer) # inRangeCmp_ -$ 0
1

>>> push (mkRange 0 0 :: RangeEI Integer) # inRangeCmp_ -$ 0
-1

>>> push (mkRange 0 0 :: RangeEE Integer) # inRangeCmp_ -$ 0
-1

assertInRange_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => OnRangeAssertFailure a -> (range a : (a : s)) :-> s Source #

Assert a value is in range; throw errors if it's under- or overflowing. See OnRangeAssertFailure for information on how to specify errors.

If you don't need verbose error reporting, consider using assertInRangeSimple_.

assertInRangeSimple_ :: forall range lower upper a s. (NiceRange range lower upper a, NiceComparable a, Dupable a) => (forall s' any. s' :-> any) -> (range a : (a : s)) :-> s Source #

A cheaper version of assertInRange_ without fancy error reporting.

>>> let range = mkRange 123 456 :: Range Integer
>>> let err = failUsing [mt|failure|]
>>> assertInRangeSimple_ err -$ range ::: 123 ::: ()
()
>>> assertInRangeSimple_ err -$ range ::: 1 ::: ()
*** Exception: Reached FAILWITH instruction with '"failure"' ...
...

isRangeEmpty :: forall range lower upper a. (NiceRange range lower upper a, Ord a, CanCheckEmpty lower upper) => range a -> Bool Source #

Check if a range is empty by construction. Note, however, this function is not suitable for checking whether a range with both boundaries excluded is empty, and hence will produce a type error when such a check is attempted.

>>> isRangeEmpty $ mkRange 0 1
False
>>> isRangeEmpty $ mkRange 0 0
False
>>> isRangeEmpty $ mkRange 0 -1
True

>>> isRangeEmpty $ mkRange @RangeIE 0 1
False
>>> isRangeEmpty $ mkRange @RangeIE 0 0
True
>>> isRangeEmpty $ mkRange @RangeIE 0 -1
True

>>> isRangeEmpty $ mkRange @RangeEI 0 1
False
>>> isRangeEmpty $ mkRange @RangeEI 0 0
True
>>> isRangeEmpty $ mkRange @RangeEI 0 -1
True

>>> isRangeEmpty $ mkRange @RangeEE 0 1
...
... error:
... This function can't be used to check whenter a range with both boundaries excluded is empty
...

isRangeEmpty_ :: forall range lower upper a s. (NiceRange range lower upper a, CanCheckEmpty lower upper, NiceComparable a) => (range a : s) :-> (Bool : s) Source #

Lorentz version of isRangeEmpty. Same caveats apply.

>>> mkRange_ # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 1)
False
>>> mkRange_ # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 0)
False
>>> mkRange_ # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! -1)
True

>>> mkRange_ @RangeIE # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 1)
False
>>> mkRange_ @RangeIE # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 0)
True
>>> mkRange_ @RangeIE # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! -1)
True

>>> mkRange_ @RangeEI # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 1)
False
>>> mkRange_ @RangeEI # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 0)
True
>>> mkRange_ @RangeEI # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! -1)
True

>>> mkRange_ @RangeEE # isRangeEmpty_ -$ (#min :! 0) ::: (#max :! 1)
...
... error:
... This function can't be used to check whenter a range with both boundaries excluded is empty
...

assertRangeNonEmpty_ :: (NiceRange range lower upper a, CanCheckEmpty lower upper, NiceComparable a, Dupable (range a)) => (forall s' any. (range a : s') :-> any) -> (range a : s) :-> (range a : s) Source #

Assert a range is non-empty, run a failing function passed as the first argument if it is. Note, however, this function is not suitable for checking whether a range with both boundaries excluded is empty, and hence will produce a type error when such a check is attempted.

>>> let err = push [mt|empty range|] # pair # failWith @(MText, Range Integer)
>>> pretty $ mkRange_ # assertRangeNonEmpty_ err -$ (#min :! 0) ::: (#max :! 1)
[0, 1]

>>> pretty $ mkRange_ # assertRangeNonEmpty_ err -$ (#min :! 0) ::: (#max :! 0)
[0, 0]

>>> pretty $ mkRange_ # assertRangeNonEmpty_ err -$ (#min :! 0) ::: (#max :! -1)
*** Exception: Reached FAILWITH instruction with 'Pair "empty range" (Pair 0 -1)' ...
...

>>> mkRange_ @RangeEE # assertRangeNonEmpty_ err -$ (#min :! 0) ::: (#max :! 1)
...
... error:
... This function can't be used to check whenter a range with both boundaries excluded is empty
...

mkOnRangeAssertFailureSimple :: (forall s any. (RangeFailureInfo a : s) :-> any) -> OnRangeAssertFailure a Source #

Construct OnRangeAssertFailure that performs the same action on both overflow and underflow

customErrorORAF :: (NiceConstant a, ErrorArg underflow ~ RangeFailureInfo a, ErrorArg overflow ~ RangeFailureInfo a, CustomErrorHasDoc underflow, CustomErrorHasDoc overflow) => ("underflow" :! Label underflow) -> ("overflow" :! Label overflow) -> OnRangeAssertFailure a Source #

Construct OnRangeAssertFailure that throws custom errors. Errors used must be defined somewhere using errorDocArg or equivalent, and must accept RangeFailureInfo as the argument.

>>> :{
type RFII = RangeFailureInfo Integer
--
[errorDocArg| "overflowInt" exception "Integer range overflow" RFII |]
[errorDocArg| "underflowInt" exception "Integer range underflow" RFII |]
--
testCode :: Range Integer : Integer : s :-> s
testCode = assertInRange_ $ customErrorORAF ! #underflow #underflowInt ! #overflow #overflowInt
:}

>>> testCode -$ mkRange 0 10 ::: 123 ::: ()
*** Exception: Reached FAILWITH instruction with 'Pair "OverflowInt" (Pair True (Pair 10 123))'
...
>>> testCode -$ mkRange 0 10 ::: -1 ::: ()
*** Exception: Reached FAILWITH instruction with 'Pair "UnderflowInt" (Pair True (Pair 0 -1))'
...
>>> testCode -$ mkRange 0 10 ::: 5 ::: ()
()

customErrorORAFSimple :: (NiceConstant a, ErrorArg err ~ RangeFailureInfo a, CustomErrorHasDoc err) => Label err -> OnRangeAssertFailure a Source #

A version of customErrorORAF that uses the same error for both underflow and overflow.

>>> :{
type RFII = RangeFailureInfo Integer
[errorDocArg| "rangeError" exception "Integer range check error" RFII |]
--
testCode :: Range Integer : Integer : s :-> s
testCode = assertInRange_ $ customErrorORAFSimple #rangeError
:}

>>> testCode -$ mkRange 0 10 ::: 123 ::: ()
*** Exception: Reached FAILWITH instruction with 'Pair "RangeError" (Pair True (Pair 10 123))'
...
>>> testCode -$ mkRange 0 10 ::: -1 ::: ()
*** Exception: Reached FAILWITH instruction with 'Pair "RangeError" (Pair True (Pair 0 -1))' ...
...
>>> testCode -$ mkRange 0 10 ::: 5 ::: ()
()

(>.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsGt.

(<=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsLe.

(>=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsGe.

(==.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsEq.

(/=.) :: NiceComparable a => Label n1 -> Label n2 -> Condition ((n1 :! a) ': ((n2 :! a) ': s)) s s o o infix 4 Source #

Named version of IsNeq.

keepIfArgs :: (Dupable a, Dupable b) => (forall st o. Condition (a ': (b ': st)) st st o o) -> Condition (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) (a ': (b ': s)) s Source #

Condition modifier, makes stack operands of binary comparison to be available within if branches.

dropT :: forall a inp dinp dout out. (DipT a inp dinp dout out, dinp ~ (a ': dout)) => inp :-> out Source #

Remove element with the given type from the stack.

>>> :{
dropSample1 :: [Integer, (), Natural] :-> [Integer, Natural]
dropSample1 = dropT @()
:}

>>> pretty $ dropSample1 # zipInstr -$ 123 ::: () ::: 321
123 : 321

>>> :{
dropSampleErr1 :: [Integer, Natural] :-> [Integer, Natural]
dropSampleErr1 = dropT @()
:}
...
... • Element of type '()' is not present on stack
...   '[Integer, Natural]
...

>>> :{
dropSampleErr1 :: [Integer, Integer] :-> '[Integer]
dropSampleErr1 = dropT @Integer
:}
...
... • Ambiguous reference to element of type 'Integer' for stack
...   '[Integer, Integer]
...

dupL :: forall var name s. (HasNamedVar s name var, Dupable var) => Label name -> s :-> (var : s) Source #

Take the element with given label on stack and copy it on top.

If there are multiple variables with given label, the one closest to the top of the stack is picked.

>>> dupL #foo # pair -$ (#foo :! (123 :: Integer))
(123,fromLabel @"foo" :! 123)

>>> (dupL #bar # ppaiir) -$ (#foo :! (123 :: Integer)) ::: (#bar :! (321 :: Integer))
(321,(fromLabel @"foo" :! 123,fromLabel @"bar" :! 321))

>>> (dupL #baz # ppaiir) -$ (#foo :! (123 :: Integer)) ::: (#bar :! (321 :: Integer))
...
... Element with name "baz" is not present on stack
...

dupLNamed :: forall var name s. (HasNamedVar s name var, Dupable var) => Label name -> s :-> ((name :! var) : s) Source #

Version of dupL that leaves a named variable on stack.

>>> dupLNamed #foo # pair -$ (#foo :! (123 :: Integer))
(fromLabel @"foo" :! 123,fromLabel @"foo" :! 123)

>>> (dupLNamed #bar # ppaiir) -$ (#foo :! (123 :: Integer)) ::: (#bar :! (321 :: Integer))
(fromLabel @"bar" :! 321,(fromLabel @"foo" :! 123,fromLabel @"bar" :! 321))

>>> (dupLNamed #baz # ppaiir) -$ (#foo :! (123 :: Integer)) ::: (#bar :! (321 :: Integer))
...
... Element with name "baz" is not present on stack
...

defaultContract :: (NiceParameterFull cp, NiceStorageFull st) => (IsNotInView => '[(cp, st)] :-> ContractOut st) -> Contract cp st () Source #

Construct and compile Lorentz contract.

This is an alias for mkContract.

defaultCompilationOptions :: CompilationOptions Source #

Runs Michelson optimizer with default config and does not touch strings and bytes.

intactCompilationOptions :: CompilationOptions Source #

Leave contract without any modifications. For testing purposes.

coBytesTransformerL :: Lens' CompilationOptions (Bool, ByteString -> ByteString) Source #

coOptimizerConfL :: Lens' CompilationOptions (Maybe OptimizerConf) Source #

coStringTransformerL :: Lens' CompilationOptions (Bool, MText -> MText) Source #

compileLorentz :: (inp :-> out) -> Instr (ToTs inp) (ToTs out) Source #

For use outside of Lorentz. Will use defaultCompilationOptions.

compileLorentzWithOptions :: CompilationOptions -> (inp :-> out) -> Instr (ToTs inp) (ToTs out) Source #

Compile Lorentz code, optionally running the optimizer, string and byte transformers.

mkContract :: (NiceParameterFull cp, NiceStorageFull st) => ContractCode cp st -> Contract cp st () Source #

Construct and compile Lorentz contract.

Note that this accepts code with initial and final stacks unpaired for simplicity.

mkContractWith :: (NiceParameterFull cp, NiceStorageFull st) => CompilationOptions -> ContractCode cp st -> Contract cp st () Source #

Version of mkContract that accepts custom compilation options.

defaultContractData :: forall cp st. (NiceParameterFull cp, NiceStorageFull st) => (IsNotInView => '[(cp, st)] :-> ContractOut st) -> ContractData cp st () Source #

Compile contract with defaultCompilationOptions.

compileLorentzContract :: forall cp st vd. ContractData cp st vd -> Contract cp st vd Source #

Compile a whole contract to Michelson.

Note that compiled contract can be ill-typed in terms of Michelson code when some of the compilation options are used. However, compilation with defaultCompilationOptions should be valid.

mkView :: forall name arg ret st. (KnownSymbol name, NiceViewable arg, NiceViewable ret, HasAnnotation arg, HasAnnotation ret, TypeHasDoc arg, TypeHasDoc ret) => ViewCode arg st ret -> ContractView st ('ViewTyInfo name arg ret) Source #

Construct a view.

mkView @"add" @(Integer, Integer) do
 car; unpair; add

setViews :: forall vd cp st. (RecFromTuple (Rec (ContractView st) (RevealViews vd)), NiceViewsDescriptor vd) => IsoRecTuple (Rec (ContractView st) (RevealViews vd)) -> ContractData cp st () -> ContractData cp st vd Source #

Set all the contract's views.

compileLorentzContract $
  defaultContractData do
    ...
  & setViews
    ( mkView "myView" () do
        ...
    , mkView "anotherView" Integer do
        ...
    )

setViewsRec :: forall vd cp st. NiceViewsDescriptor vd => Rec (ContractView st) (RevealViews vd) -> ContractData cp st () -> ContractData cp st vd Source #

Version of setViews that accepts a Rec.

May be useful if you have too many views or want to combine views sets.

noViews :: contract cp st () -> contract cp st () Source #

Restrict type of Contract, ContractData or other similar type to have no views.

cdCodeL :: forall cp st vd cp1. NiceParameterFull cp1 => Lens (ContractData cp st vd) (ContractData cp1 st vd) (ContractCode cp st) (ContractCode cp1 st) Source #

cdCompilationOptionsL :: forall cp st vd. Lens' (ContractData cp st vd) CompilationOptions Source #

interpretLorentzInstr :: (IsoValuesStack inp, IsoValuesStack out) => ContractEnv -> (IsNotInView => inp :-> out) -> Rec Identity inp -> Either (MichelsonFailureWithStack Void) (Rec Identity out) Source #

Interpret a Lorentz instruction, for test purposes. Note that this does not run the optimizer.

interpretLorentzLambda :: (IsoValue inp, IsoValue out) => ContractEnv -> (IsNotInView => Fn inp out) -> inp -> Either (MichelsonFailureWithStack Void) out Source #

Like interpretLorentzInstr, but works on singleton input and output stacks.

analyzeLorentz :: (inp :-> out) -> AnalyzerRes Source #

Lorentz version of analyzer.

(-$?) :: (ZipInstr inps, IsoValue out) => (IsNotInView => inps :-> '[out]) -> ZippedStack inps -> Either (MichelsonFailureWithStack Void) out infixr 2 Source #

Run a lambda with given input.

Note that this always returns one value, but can accept multiple input values (in such case they are grouped into nested pairs).

For testing and demonstration purposes.

(-$) :: (ZipInstr inps, IsoValue out, HasCallStack) => (IsNotInView => inps :-> '[out]) -> ZippedStack inps -> out infixr 2 Source #

Like -$?, assumes that no failure is possible.

For testing and demonstration purposes. Note, that we specify the result type of polymorphic operations to avoid ambiguity arising from polymorphic literals.

Use ZippedStackRepr to represent stack of two or more elements, and ZSNil for empty stacks. Stacks of one element are represented by the element itself.

>>> nop -$ 5
5
>>> sub -$ 3 ::: 2 :: Integer
1
>>> push (9 :: Integer) -$ ZSNil
9
>>> add # add -$ 1 ::: 2 ::: 3 :: Integer
6

(&?-) :: (ZipInstr inps, IsoValue out) => ZippedStack inps -> (IsNotInView => inps :-> '[out]) -> Either (MichelsonFailureWithStack Void) out infixl 2 Source #

Version of (-$?) with arguments flipped.

(&-) :: (ZipInstr inps, IsoValue out, HasCallStack) => ZippedStack inps -> (IsNotInView => inps :-> '[out]) -> out infixl 2 Source #

Version of (-$) with arguments flipped.

(<-$>) :: (ZipInstr inps, IsoValue out, HasCallStack) => (inps :-> '[out]) -> [ZippedStack inps] -> [out] infixl 2 Source #

Version of (-$) applicable to a series of values.

fieldNameToLabel :: FieldSymRef n -> Label n Source #

Convert a symbolic FieldRef to a label, useful for compatibility with other interfaces.

fieldNameFromLabel :: Label n -> FieldSymRef n Source #

Convert a label to FieldRef, useful for compatibility with other interfaces.

stToField :: StoreHasField store fname ftype => FieldRef fname -> (store : s) :-> (ftype : s) Source #

Pick storage field.

stGetField :: (StoreHasField store fname ftype, Dupable ftype, HasDupableGetters store) => FieldRef fname -> (store : s) :-> (ftype : (store : s)) Source #

Get storage field, preserving the storage itself on stack.

stToFieldNamed :: (StoreHasField store fname ftype, FieldRefHasFinalName fname) => FieldRef fname -> (store : s) :-> ((FieldRefFinalName fname :! ftype) : s) Source #

Pick storage field retaining a name label attached.

For complex refs this tries to attach the immediate name of the referred field.

stGetFieldNamed :: (StoreHasField store fname ftype, FieldRefHasFinalName fname, Dupable ftype, HasDupableGetters store) => FieldRef fname -> (store : s) :-> ((FieldRefFinalName fname :! ftype) : (store : s)) Source #

Version of stToFieldNamed that preserves the storage on stack.

stSetField :: StoreHasField store fname ftype => FieldRef fname -> (ftype : (store : s)) :-> (store : s) Source #

Update storage field.

stMem :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (store : s)) :-> (Bool : s) Source #

Check value presence in storage.

stGet :: (StoreHasSubmap store mname key value, KnownValue value) => FieldRef mname -> (key : (store : s)) :-> (Maybe value : s) Source #

Get value in storage.

stUpdate :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (Maybe value : (store : s))) :-> (store : s) Source #

Update a value in storage.

stGetAndUpdate :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (Maybe value : (store : s))) :-> (Maybe value : (store : s)) Source #

Atomically get and update a value in storage.

stDelete :: forall store mname key value s. StoreHasSubmap store mname key value => FieldRef mname -> (key : (store : s)) :-> (store : s) Source #

Delete a value in storage.

stInsert :: StoreHasSubmap store mname key value => FieldRef mname -> (key : (value : (store : s))) :-> (store : s) Source #

Add a value in storage.

stInsertNew :: (StoreHasSubmap store mname key value, Dupable key) => FieldRef mname -> (forall s0 any. (key : s0) :-> any) -> (key : (value : (store : s))) :-> (store : s) Source #

Add a value in storage, but fail if it will overwrite some existing entry.

stEntrypoint :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (epParam : (store : s)) :-> (([Operation], store) : s) Source #

Extracts and executes the epName entrypoint lambda from storage, returing the updated full storage (store) and the produced Operations.

stToEpLambda :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : s) Source #

Pick stored entrypoint lambda.

stGetEpLambda :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (store : s) :-> (EntrypointLambda epParam epStore : (store : s)) Source #

Get stored entrypoint lambda, preserving the storage itself on the stack.

stSetEpLambda :: (StoreHasEntrypoint store epName epParam epStore, HasDupableGetters store) => Label epName -> (EntrypointLambda epParam epStore : (store : s)) :-> (store : s) Source #

Stores the entrypoint lambda in the storage. Fails if already set.

stToEpStore :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (store : s) :-> (epStore : s) Source #

Pick the sub-storage that the entrypoint operates on.

stGetEpStore :: (StoreHasEntrypoint store epName epParam epStore, Dupable store) => Label epName -> (store : s) :-> (epStore : (store : s)) Source #

Get the sub-storage that the entrypoint operates on, preserving the storage itself on the stack.

stSetEpStore :: StoreHasEntrypoint store epName epParam epStore => Label epName -> (epStore : (store : s)) :-> (store : s) Source #

Update the sub-storage that the entrypoint operates on.

sopGetField :: (Dupable ftype, HasDupableGetters store) => StoreFieldOps store fname ftype -> FieldRef fname -> (store : s) :-> (ftype : (store : s)) Source #

Simplified version of sopGetFieldOpen where res is ftype.

sopSetField :: StoreFieldOps store fname ftype -> FieldRef fname -> (ftype : (store : s)) :-> (store : s) Source #

Simplified version of sopSetFieldOpen where res is ftype.

storeFieldOpsADT :: HasFieldOfType dt fname ftype => StoreFieldOps dt (fname :: Symbol) ftype Source #

Implementation of StoreHasField for case of datatype keeping a pack of fields.

storeEntrypointOpsADT :: (HasFieldOfType store epmName (EntrypointsField epParam epStore), HasFieldOfType store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore Source #

Implementation of StoreHasEntrypoint for a datatype keeping a pack of fields, among which one contains the entrypoint and another is what such entrypoint operates on.

storeEntrypointOpsFields :: (StoreHasField store epmName (EntrypointsField epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore Source #

Implementation of StoreHasEntrypoint for a datatype that has a StoreHasField for an EntrypointsField that contains the entrypoint and a StoreHasField for the field such entrypoint operates on.

storeEntrypointOpsSubmapField :: (StoreHasSubmap store epmName MText (EntrypointLambda epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore Source #

Implementation of StoreHasEntrypoint for a datatype that has a StoreHasSubmap that contains the entrypoint and a StoreHasField for the field such entrypoint operates on.

storeFieldOpsDeeper :: (HasFieldOfType storage fieldsPartName fields, StoreHasField fields fname ftype, HasDupableGetters fields) => FieldRef fieldsPartName -> StoreFieldOps storage fname ftype Source #

Implementation of StoreHasField for a data type which has an instance of StoreHasField inside. For instance, it can be used for top-level storage.

storeSubmapOpsDeeper :: (HasFieldOfType storage bigMapPartName fields, StoreHasSubmap fields SelfRef key value, HasDupableGetters storage, Dupable fields) => FieldRef bigMapPartName -> StoreSubmapOps storage mname key value Source #

Implementation of StoreHasSubmap for a data type which has an instance of StoreHasSubmap inside. For instance, it can be used for top-level storage.

storeEntrypointOpsDeeper :: (HasFieldOfType store nameInStore substore, StoreHasEntrypoint substore epName epParam epStore, HasDupableGetters store, Dupable substore) => FieldRef nameInStore -> StoreEntrypointOps store epName epParam epStore Source #

Implementation of StoreHasEntrypoint for a data type which has an instance of StoreHasEntrypoint inside. For instance, it can be used for top-level storage.

storeFieldOpsReferTo :: FieldRef name -> StoreFieldOps storage name field -> StoreFieldOps storage desiredName field Source #

Pretend that given StoreFieldOps implementation is made up for field with name desiredName, not its actual name. Logic of the implementation remains the same.