Safe Haskell	None
Language	Haskell2010

Indigo.Lorentz

Description

This module is intended to be imported instead of Lorentz by Indigo modules.

The idea is to avoid repeating common hiding rules and to not export any of Lorentz's Instructions and Macros.

Synopsis

data Bool
- = False
- | True
data Integer
data Natural
data Maybe a
- = Nothing
- | Just a
data ByteString
data Map k a
withDict :: HasDict c e => e -> (c => r) -> r
data Set a
class Default a where
- def :: a
argDef :: forall (name :: Symbol) a. Name name -> a -> (name :? a) -> a
argF :: forall (name :: Symbol) f a. Name name -> NamedF f a name -> f a
arg :: forall (name :: Symbol) a. Name name -> (name :! a) -> a
type (:!) (name :: Symbol) a = NamedF Identity a name
type (:?) (name :: Symbol) a = NamedF Maybe a name
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)
constructStack :: forall dt (fields :: [Type]) (st :: [Type]). (InstrConstructC dt, ToTs fields ~ ToTs (ConstructorFieldTypes dt), KnownList fields) => (fields ++ st) :-> (dt & st)
deconstruct :: forall dt (fields :: [Type]) (st :: [Type]). (InstrDeconstructC dt, KnownList fields, ToTs fields ~ ToTs (ConstructorFieldTypes dt)) => (dt & st) :-> (fields ++ st)
fieldCtor :: forall (st :: [Type]) f. HasCallStack => (st :-> (f & st)) -> FieldConstructor st f
getField :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> (GetFieldType dt name & (dt ': st))
getFieldNamed :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> ((name :! GetFieldType dt name) & (dt ': st))
modifyField :: forall dt (name :: Symbol) (st :: [Type]). (InstrGetFieldC dt name, InstrSetFieldC dt name) => Label name -> (forall (st0 :: [Type]). (GetFieldType dt name ': st0) :-> (GetFieldType dt name ': st0)) -> (dt & st) :-> (dt & st)
toField :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> (GetFieldType dt name & st)
toFieldNamed :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> ((name :! GetFieldType dt name) & st)
unwrapUnsafe_ :: forall dt (name :: Symbol) (st :: [Type]). InstrUnwrapC dt name => Label name -> (dt & st) :-> (CtorOnlyField name dt ': st)
wrap_ :: forall dt (name :: Symbol) (st :: [Type]). InstrWrapC dt name => Label name -> AppendCtorField (GetCtorField dt name) st :-> (dt & st)
type (:=) (n :: Symbol) ty = 'NamedField n ty
class CaseArrow (name :: Symbol) body clause | clause -> name, clause -> body where
- (/->) :: Label name -> body -> clause
data CaseClauseL (inp :: [Type]) (out :: [Type]) (param :: CaseClauseParam) where
- CaseClauseL :: forall (x :: CtorField) (inp :: [Type]) (out :: [Type]) (ctor :: Symbol). (AppendCtorField x inp :-> out) -> CaseClauseL inp out ('CaseClauseParam ctor x)
type CaseTC dt (out :: [Type]) (inp :: [Type]) clauses = (InstrCaseC dt, RMap (CaseClauses dt), RecFromTuple clauses, clauses ~ Rec (CaseClauseL inp out) (CaseClauses dt))
type HasFieldOfType dt (fname :: Symbol) fieldTy = (HasField dt fname, GetFieldType dt fname ~ fieldTy)
type family HasFieldsOfType dt (fs :: [NamedField]) where ...
data NamedField = NamedField Symbol Type
type ConstructorFieldTypes dt = GFieldTypes (Rep dt)
type InstrConstructC dt = (GenericIsoValue dt, GInstrConstruct (Rep dt))
newtype (inp :: [Type]) :-> (out :: [Type]) = LorentzInstr {
- unLorentzInstr :: RemFail Instr (ToTs inp) (ToTs out)
}
data Label (name :: Symbol) where
- Label :: forall (name :: Symbol). KnownSymbol name => Label name
type (&) a (b :: [Type]) = a ': b
class HasAnnotation a
type family ToT a :: T
data Address
newtype BigMap k v = BigMap {
- unBigMap :: Map k v
}
data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
}
data EpAddress = EpAddress {
- eaAddress :: Address
- eaEntrypoint :: EpName
}
data KeyHash
data MText
data Mutez
type Operation = Operation' Instr
data PublicKey
data Signature
data Timestamp
class (ArithOp aop (ToT n) (ToT m), NiceComparable n, NiceComparable m, ToT (ArithResHs aop n m) ~ ArithRes aop (ToT n) (ToT m)) => ArithOpHs aop n m where
- type ArithResHs aop n m
type family ArithResHs aop n m
class (UnaryArithOp aop (ToT n), NiceComparable n, ToT (UnaryArithResHs aop n) ~ UnaryArithRes aop (ToT n)) => UnaryArithOpHs aop n where
- type UnaryArithResHs aop n
type family UnaryArithResHs aop n
type NiceComparable n = (KnownValue n, Comparable (ToT n))
(#) :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]). (a :-> b) -> (b :-> c) -> a :-> c
(##) :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]). (a :-> b) -> (b :-> c) -> a :-> c
pattern FI :: (forall (out' :: [T]). Instr (ToTs inp) out') -> inp :-> out
pattern I :: Instr (ToTs inp) (ToTs out) -> inp :-> out
iAnyCode :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> Instr (ToTs inp) (ToTs out)
iForceNotFail :: forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o
iGenericIf :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]) (s :: [Type]). (forall (s' :: [T]). Instr (ToTs a) s' -> Instr (ToTs b) s' -> Instr (ToTs c) s') -> (a :-> s) -> (b :-> s) -> c :-> s
iMapAnyCode :: forall (i1 :: [Type]) (i2 :: [Type]) (o :: [Type]). (forall (o' :: [T]). Instr (ToTs i1) o' -> Instr (ToTs i2) o') -> (i1 :-> o) -> i2 :-> o
iNonFailingCode :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => (inp :-> out) -> Instr (ToTs inp) (ToTs out)
iWithVarAnnotations :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => [Text] -> (inp :-> out) -> inp :-> out
optimizeLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> inp :-> out
optimizeLorentzWithConf :: forall (inp :: [Type]) (out :: [Type]). OptimizerConf -> (inp :-> out) -> inp :-> out
parseLorentzValue :: KnownValue v => Text -> Either ParseLorentzError v
transformBytesLorentz :: forall (inp :: [Type]) (out :: [Type]). Bool -> (ByteString -> ByteString) -> (inp :-> out) -> inp :-> out
transformStringsLorentz :: forall (inp :: [Type]) (out :: [Type]). Bool -> (MText -> MText) -> (inp :-> out) -> inp :-> out
type (%>) = (:->)
type ContractCode cp st = '[(cp, st)] :-> ContractOut st
type ContractOut st = '[([Operation], st)]
type Lambda i o = '[i] :-> '[o]
class MapLorentzInstr instr where
- mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> instr -> instr
data SomeContractCode where
- SomeContractCode :: forall cp st. (NiceParameterFull cp, NiceStorage st) => ContractCode cp st -> SomeContractCode
type NiceParameterFull cp = (Typeable cp, ParameterDeclaresEntrypoints cp)
type NiceStorage a = (HasAnnotation a, KnownValue a, ProperStorageBetterErrors (ToT a))
class (IsoValue a, Typeable a) => KnownValue a
allowCheckedCoerce :: forall k1 k2 (a :: k1) (b :: k2). Dict (CanCastTo a b, CanCastTo b a)
allowCheckedCoerceTo :: forall k1 k2 (b :: k1) (a :: k2). Dict (CanCastTo a b)
castDummyG :: (Generic a, Generic b, GCanCastTo (Rep a) (Rep b)) => Proxy a -> Proxy b -> ()
checkedCoerce :: (CanCastTo a b, Coercible a b) => a -> b
checkedCoerce_ :: forall a b (s :: [Type]). Castable_ a b => (a ': s) :-> (b ': s)
checkedCoercing_ :: forall a b (s :: [Type]). Coercible_ a b => ((b ': s) :-> (b ': s)) -> (a ': s) :-> (a ': s)
coerceUnwrap :: forall a (s :: [Type]). Wrappable a => (a ': s) :-> (Unwrappable a ': s)
coerceWrap :: forall a (s :: [Type]). Wrappable a => (Unwrappable a ': s) :-> (a ': s)
fakeCoerce :: forall (s1 :: [Type]) (s2 :: [Type]). s1 :-> s2
fakeCoercing :: forall (s1 :: [Type]) (s2 :: [Type]) (s1' :: [Type]) (s2' :: [Type]). (s1 :-> s2) -> s1' :-> s2'
forcedCoerce :: Coercible a b => a -> b
forcedCoerce_ :: forall a b (s :: [Type]). MichelsonCoercible a b => (a & s) :-> (b & s)
fromNamed :: forall (name :: Symbol) a (s :: [Type]). Label name -> (NamedF Identity a name ': s) :-> (a ': s)
gForcedCoerce_ :: forall k t (a :: k) (b :: k) (s :: [Type]). MichelsonCoercible (t a) (t b) => (t a ': s) :-> (t b ': s)
toNamed :: forall (name :: Symbol) a (s :: [Type]). Label name -> (a ': s) :-> (NamedF Identity a name ': s)
class CanCastTo (a :: k) (b :: k1) where
- castDummy :: Proxy a -> Proxy 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 (Unwrappable s) => Wrappable s where
- type Unwrappable s
type family Unwrappable s
newtype TAddress (p :: k) = TAddress {
- unTAddress :: Address
}
newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
}
type Entrypoint param store = '[param, store] :-> ContractOut store
type Entrypoint_ store = '[store] :-> ContractOut store
niceConstantEvi :: NiceConstant a :- ConstantScope (ToT a)
nicePackedValueEvi :: NicePackedValue a :- PackedValScope (ToT a)
niceParameterEvi :: NiceParameter a :- ParameterScope (ToT a)
nicePrintedValueEvi :: NicePrintedValue a :- PrintedValScope (ToT a)
niceStorageEvi :: NiceStorage a :- StorageScope (ToT a)
niceUnpackedValueEvi :: NiceUnpackedValue a :- UnpackedValScope (ToT a)
class (IsoValue a, HasNoNestedBigMaps (ToT a)) => CanHaveBigMap a
type NiceConstant a = (KnownValue a, ProperConstantBetterErrors (ToT a))
type NiceFullPackedValue a = (NicePackedValue a, NiceUnpackedValue a)
type NicePackedValue a = (KnownValue a, ProperPackedValBetterErrors (ToT a))
type NiceParameter a = (KnownValue a, ProperParameterBetterErrors (ToT a))
type NicePrintedValue a = (KnownValue a, ProperPrintedValBetterErrors (ToT a))
type NiceUnpackedValue a = (KnownValue a, ProperUnpackedValBetterErrors (ToT a))
class (IsoValue a, ForbidBigMap (ToT a)) => NoBigMap a
class (IsoValue a, ForbidContract (ToT a)) => NoContractType a
class (IsoValue a, ForbidOp (ToT a)) => NoOperation a
buildLorentzDoc :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> ContractDoc
buildLorentzDocWithGitRev :: forall (inp :: [Type]) (out :: [Type]). DGitRevision -> (inp :-> out) -> ContractDoc
cutLorentzNonDoc :: forall (inp :: [Type]) (out :: [Type]) (s :: [Type]). (inp :-> out) -> s :-> s
mkDEntrypointExample :: NiceParameter a => a -> DEntrypointExample
renderLorentzDoc :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> LText
contractDocToMarkdown :: ContractDoc -> LText
docDefinitionRef :: (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => Markdown -> d -> Markdown
docItemPosition :: DocItem d => DocItemPos
mdTocFromRef :: (DocItem d, DocItemReferenced d ~ 'True) => HeaderLevel -> Markdown -> d -> Markdown
mkDGitRevision :: ExpQ
morleyRepoSettings :: GitRepoSettings
subDocToMarkdown :: HeaderLevel -> SubDoc -> Markdown
concreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (Rep a), HaveCommonTypeCtor b a) => TypeDocHaskellRep b
concreteTypeDocHaskellRepUnsafe :: (Typeable a, GenericIsoValue a, GTypeHasDoc (Rep a)) => TypeDocHaskellRep b
concreteTypeDocMichelsonRep :: forall k a (b :: k). (Typeable a, SingI (ToT a), HaveCommonTypeCtor b a) => TypeDocMichelsonRep b
concreteTypeDocMichelsonRepUnsafe :: forall k a (b :: k). (Typeable a, SingI (ToT a)) => TypeDocMichelsonRep b
customTypeDocMdReference :: (Text, DType) -> [DType] -> WithinParens -> Markdown
dTypeDep :: TypeHasDoc t => SomeDocDefinitionItem
genericTypeDocDependencies :: (Generic a, GTypeHasDoc (Rep a)) => Proxy a -> [SomeDocDefinitionItem]
haskellAddNewtypeField :: Text -> TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepNoFields :: TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepStripFieldPrefix :: HasCallStack => TypeDocHaskellRep a -> TypeDocHaskellRep a
homomorphicTypeDocHaskellRep :: (Generic a, GTypeHasDoc (Rep a)) => TypeDocHaskellRep a
homomorphicTypeDocMdReference :: (Typeable t, TypeHasDoc t, IsHomomorphic t) => Proxy t -> WithinParens -> Markdown
homomorphicTypeDocMichelsonRep :: SingI (ToT a) => TypeDocMichelsonRep a
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
data DEntrypointExample = ParameterScope t => DEntrypointExample (Value t)
data ContractDoc = ContractDoc {
- cdContents :: DocBlock
- cdDefinitions :: DocBlock
- cdDefinitionsSet :: Set SomeDocDefinitionItem
- cdDefinitionIds :: Set DocItemId
}
data DAnchor = DAnchor Anchor
data DComment = DComment Text
data DDescription = DDescription Markdown
data DGitRevision
- = DGitRevisionKnown DGitRevisionInfo
- | DGitRevisionUnknown
data DocElem d = DocElem {
- deItem :: d
- deSub :: Maybe SubDoc
}
type DocGrouping = SubDoc -> SomeDocItem
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]
type family DocItemPlacement d :: DocItemPlacementKind
type family DocItemReferenced d :: DocItemReferencedKind
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
newtype GitRepoSettings = GitRepoSettings {
- grsMkGitRevision :: Text -> Text
}
data SomeDocDefinitionItem where
- SomeDocDefinitionItem :: forall d. (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => d -> SomeDocDefinitionItem
data SomeDocItem where
- SomeDocItem :: forall d. DocItem d => d -> SomeDocItem
newtype SubDoc = SubDoc DocBlock
data DType where
- DType :: forall a. TypeHasDoc a => Proxy a -> DType
class HaveCommonTypeCtor (a :: k) (b :: k1)
class IsHomomorphic (a :: k)
data SomeTypeWithDoc where
- SomeTypeWithDoc :: forall td. TypeHasDoc td => Proxy td -> SomeTypeWithDoc
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
type family TypeDocFieldDescriptions a :: FieldDescriptions
type Markdown = Builder
type Value = Value' Instr
eprName :: forall (mname :: Maybe Symbol). EntrypointRef mname -> EpName
parameterEntrypointCall :: forall cp (name :: Symbol). ParameterDeclaresEntrypoints cp => Label name -> EntrypointCall cp (GetEntrypointArg cp name)
parameterEntrypointCallCustom :: forall cp (mname :: Maybe Symbol). ParameterDeclaresEntrypoints cp => EntrypointRef mname -> EntrypointCall cp (GetEntrypointArgCustom cp mname)
parameterEntrypointCallDefault :: ParameterDeclaresEntrypoints cp => EntrypointCall cp (GetDefaultEntrypointArg cp)
parameterEntrypointsToNotes :: ParameterDeclaresEntrypoints cp => ParamNotes (ToT cp)
sepcCallRootChecked :: (NiceParameter cp, ForbidExplicitDefaultEntrypoint cp) => SomeEntrypointCall cp
type (:>) (n :: Symbol) ty = 'NamedEp n ty
type family AllParameterEntrypoints cp :: [(Symbol, Type)] where ...
data EntrypointRef (mname :: Maybe Symbol) where
- CallDefault :: EntrypointRef ('Nothing :: Maybe Symbol)
- Call :: forall (name :: Symbol). NiceEntrypointName name => EntrypointRef ('Just name)
class EntrypointsDerivation (deriv :: k) cp where
- type EpdAllEntrypoints (deriv :: k) cp :: [(Symbol, Type)]
- type EpdLookupEntrypoint (deriv :: k) cp :: Symbol -> Exp (Maybe Type)
- epdNotes :: (Notes (ToT cp), RootAnn)
- epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint deriv cp name))
- epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints deriv cp)
type family EpdAllEntrypoints (deriv :: k) cp :: [(Symbol, Type)]
type family EpdLookupEntrypoint (deriv :: k) cp :: Symbol -> Exp (Maybe Type)
data EpdNone
type ForbidExplicitDefaultEntrypoint cp = Eval (LiftM3 (UnMaybe :: Exp Constraint -> (Type -> Exp Constraint) -> Maybe Type -> Constraint -> Type) (Pure (Pure ())) (TError ('Text "Parameter used here must have no explicit \"default\" entrypoint" :$$: (('Text "In parameter type `" :<>: 'ShowType cp) :<>: 'Text "`")) :: (Type -> Exp Constraint) -> Type) (LookupParameterEntrypoint cp DefaultEpName))
type GetDefaultEntrypointArg cp = Eval (LiftM2 (FromMaybe :: Type -> Maybe Type -> Type -> Type) (Pure cp) (LookupParameterEntrypoint cp DefaultEpName))
type GetEntrypointArg cp (name :: Symbol) = Eval (LiftM2 (FromMaybe :: Type -> Maybe Type -> Type -> Type) (TError (('Text "Entrypoint not found: " :<>: 'ShowType name) :$$: (('Text "In contract parameter `" :<>: 'ShowType cp) :<>: 'Text "`")) :: Type -> Type) (LookupParameterEntrypoint cp name))
type family GetEntrypointArgCustom cp (mname :: Maybe Symbol) where ...
type HasDefEntrypointArg (cp :: k) defEpName defArg = (defEpName ~ EntrypointRef ('Nothing :: Maybe Symbol), HasEntrypointArg cp defEpName defArg)
class HasEntrypointArg (cp :: k) name arg where
- useHasEntrypointArg :: name -> (Dict (ParameterScope (ToT arg)), EpName)
type HasEntrypointOfType param (con :: Symbol) exp = (GetEntrypointArgCustom param ('Just con) ~ exp, ParameterDeclaresEntrypoints param)
type family LookupParameterEntrypoint cp :: Symbol -> Exp (Maybe Type) where ...
type NoExplicitDefaultEntrypoint cp = Eval (LookupParameterEntrypoint cp DefaultEpName) ~ ('Nothing :: Maybe Type)
type family ParameterContainsEntrypoints param (fields :: [NamedEp]) where ...
type ParameterDeclaresEntrypoints cp = (If (CanHaveEntrypoints cp) (ParameterHasEntrypoints cp) (), NiceParameter cp, EntrypointsDerivation (GetParameterEpDerivation cp) cp)
class (EntrypointsDerivation (ParameterEntrypointsDerivation cp) cp, RequireAllUniqueEntrypoints cp) => ParameterHasEntrypoints cp where
- type ParameterEntrypointsDerivation cp
type family ParameterEntrypointsDerivation cp
type RequireAllUniqueEntrypoints cp = RequireAllUniqueEntrypoints' (ParameterEntrypointsDerivation cp) cp
newtype TrustEpName = TrustEpName EpName
newtype ShouldHaveEntrypoints a = ShouldHaveEntrypoints {
- unHasEntrypoints :: a
}
data EpdDelegate
data EpdPlain
data EpdRecursive
data EpdWithRoot (r :: Symbol) (epd :: k)
newtype ParameterWrapper deriv cp = ParameterWrapper {
- unParameterWraper :: cp
}
areFinalizedParamBuildingSteps :: [ParamBuildingStep] -> Bool
clarifyParamBuildingSteps :: forall (inp :: [Type]) (out :: [Type]). ParamBuildingStep -> (inp :-> out) -> inp :-> out
constructDEpArg :: (TypeHasDoc arg, HasAnnotation arg, KnownValue arg) => DEntrypointArg
diEntrypointToMarkdown :: HeaderLevel -> DEntrypoint level -> Markdown
documentEntrypoint :: forall kind (epName :: Symbol) param (s :: [Type]) (out :: [Type]). (KnownSymbol epName, DocItem (DEntrypoint kind), TypeHasDoc param, HasAnnotation param, KnownValue param) => ((param & s) :-> out) -> (param & s) :-> out
emptyDEpArg :: DEntrypointArg
entryCaseSimple_ :: forall cp (out :: [Type]) (inp :: [Type]). (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints PlainEntrypointsKind cp, NiceParameterFull cp, RequireFlatParamEps cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp & inp) :-> out
mkDEntrypointArgSimple :: (KnownValue t, HasAnnotation t, TypeHasDoc t) => DEntrypointArg
mkDEpUType :: (KnownValue t, HasAnnotation t) => Type
mkPbsWrapIn :: Text -> ParamBuilder -> ParamBuildingStep
mkUType :: forall (x :: T). SingI x => Notes x -> Type
data DEntrypoint kind = DEntrypoint {
- depName :: Text
- depSub :: SubDoc
}
data DEntrypointArg = DEntrypointArg {
- epaArg :: Maybe DType
- epaBuilding :: [ParamBuildingStep]
- epaType :: Type
}
data DEntrypointReference = DEntrypointReference Text Anchor
class KnownSymbol con => DeriveCtorFieldDoc (con :: Symbol) (cf :: CtorField) where
- deriveCtorFieldDoc :: DEntrypointArg
type DocumentEntrypoints kind a = (Generic a, GDocumentEntrypoints kind (Rep a))
class EntryArrow (kind :: k) (name :: Symbol) body where
- (#->) :: (Label name, Proxy kind) -> body -> body
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]
data PlainEntrypointsKind
type family RequireFlatEpDerivation (cp :: t) deriv where ...
type family RequireFlatParamEps cp where ...
data EpName
customErrorDocHaskellRepGeneral :: forall (tag :: Symbol). (SingI (ToT (ErrorArg tag)), IsError (CustomError tag), TypeHasDoc (ErrorArg tag), CustomErrorHasDoc tag) => Text -> Proxy tag -> Markdown
errorTagToMText :: forall (tag :: Symbol). Label tag -> MText
errorTagToText :: forall (tag :: Symbol). KnownSymbol tag => Text
failUnexpected :: forall (s :: [Type]) (t :: [Type]). MText -> s :-> t
failUsing :: forall e (s :: [Type]) (t :: [Type]). IsError e => e -> s :-> t
isoErrorFromVal :: forall (t :: T) e. (Typeable t, Typeable (ToT e), IsoValue e) => Value t -> Either Text e
isoErrorToVal :: (KnownError e, IsoValue e) => e -> (forall (t :: T). ErrorScope t => Value t -> r) -> r
typeDocMdDescriptionReferToError :: IsError e => Markdown
data CustomError (tag :: Symbol) = CustomError {
- ceTag :: Label tag
- ceArg :: ErrorArg tag
}
class (KnownSymbol tag, TypeHasDoc (ErrorArg tag), IsError (CustomError tag)) => CustomErrorHasDoc (tag :: Symbol) where
- customErrDocMdCause :: Markdown
- customErrDocMdCauseInEntrypoint :: Markdown
- customErrClass :: ErrorClass
- customErrArgumentSemantics :: Maybe Markdown
data DError where
- DError :: forall e. ErrorHasDoc e => Proxy e -> DError
data DThrows where
- DThrows :: forall e. ErrorHasDoc e => Proxy e -> DThrows
type family ErrorArg (tag :: Symbol)
data ErrorClass
- = ErrClassActionException
- | ErrClassBadArgument
- | ErrClassContractInternal
- | ErrClassUnknown
class Typeable e => ErrorHasDoc e where
- type ErrorRequirements e
- errorDocName :: Text
- errorDocMdCause :: Markdown
- errorDocMdCauseInEntrypoint :: Markdown
- errorDocHaskellRep :: Markdown
- errorDocClass :: ErrorClass
- errorDocDependencies :: [SomeDocDefinitionItem]
- errorDocRequirements :: Dict (ErrorRequirements e)
type family ErrorRequirements e
type ErrorScope (t :: T) = (Typeable t, ConstantScope t)
class (Typeable e, ErrorHasDoc e) => IsError e where
- errorToVal :: e -> (forall (t :: T). ErrorScope t => Value t -> r) -> r
- errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text e
type RequireNoArgError (tag :: Symbol) (msg :: ErrorMessage) = (TypeErrorUnless (ErrorArg tag == ()) msg, msg ~ ('Text "Expected no-arg error, but given error requires argument of type " :<>: 'ShowType (ErrorArg tag)))
data SomeError = (IsError e, Eq e) => SomeError e
data UnspecifiedError = UnspecifiedError
class WellTypedToT a => IsoValue a where
- type ToT a :: T
- toVal :: a -> Value (ToT a)
- fromVal :: Value (ToT a) -> a
type WellTypedIsoValue a = (WellTyped (ToT a), IsoValue a)
addNewErrorTags :: ErrorTagMap -> HashSet MText -> ErrorTagMap
applyErrorTagMap :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out
applyErrorTagMapWithExclusions :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> ErrorTagExclusions -> (inp :-> out) -> inp :-> out
buildErrorTagMap :: HashSet MText -> ErrorTagMap
errorFromValNumeric :: forall (t :: T) e. (KnownT t, IsError e) => ErrorTagMap -> Value t -> Either Text e
errorToValNumeric :: IsError e => ErrorTagMap -> e -> (forall (t :: T). ErrorScope t => Value t -> r) -> r
excludeErrorTags :: HasCallStack => ErrorTagExclusions -> ErrorTagMap -> ErrorTagMap
gatherErrorTags :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> HashSet MText
useNumericErrors :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => (inp :-> out) -> (inp :-> out, ErrorTagMap)
applyErrorTagToErrorsDoc :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out
applyErrorTagToErrorsDocWith :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => [NumericErrorDocHandler] -> ErrorTagMap -> (inp :-> out) -> inp :-> out
baseErrorDocHandlers :: [NumericErrorDocHandler]
customErrorDocHandler :: NumericErrorDocHandler
voidResultDocHandler :: NumericErrorDocHandler
type ErrorTagExclusions = HashSet MText
type ErrorTagMap = Bimap Natural MText
data DDescribeErrorTagMap = DDescribeErrorTagMap {
- detmSrcLoc :: Text
}
data NumericErrorDocHandler
data NumericErrorDocHandlerError
data NumericErrorWrapper (numTag :: Nat) err
printComment :: forall (s :: [Type]). PrintComment (ToTs s) -> s :-> s
stackRef :: forall (gn :: Nat) (st :: [T]) (n :: Peano). (n ~ ToPeano gn, SingI n, KnownPeano n, RequireLongerThan st n) => PrintComment st
stackType :: forall (s :: [Type]). s :-> s
testAssert :: forall (out :: [Type]) (inp :: [Type]). (Typeable (ToTs out), HasCallStack) => Text -> PrintComment (ToTs inp) -> (inp :-> (Bool & out)) -> inp :-> inp
class NonZero t
data ChainId
class ConcatOp (ToT c) => ConcatOpHs c
type List = []
class (EDivOp (ToT n) (ToT m), NiceComparable n, NiceComparable m, ToT (EDivOpResHs n m) ~ EDivOpRes (ToT n) (ToT m), ToT (EModOpResHs n m) ~ EModOpRes (ToT n) (ToT m)) => EDivOpHs n m where
- type EDivOpResHs n m
- type EModOpResHs n m
type family EDivOpResHs n m
type family EModOpResHs n m
class (MemOp (ToT c), ToT (MemOpKeyHs c) ~ MemOpKey (ToT c)) => MemOpHs c where
- type MemOpKeyHs c
type family MemOpKeyHs c
class (GetOp (ToT c), ToT (GetOpKeyHs c) ~ GetOpKey (ToT c), ToT (GetOpValHs c) ~ GetOpVal (ToT c)) => GetOpHs c where
- type GetOpKeyHs c
- type GetOpValHs c
type family GetOpValHs c
type family GetOpKeyHs c
class (IterOp (ToT c), ToT (IterOpElHs c) ~ IterOpEl (ToT c)) => IterOpHs c where
- type IterOpElHs c
type family IterOpElHs c
class (MapOp (ToT c), ToT (MapOpInpHs c) ~ MapOpInp (ToT c), ToT (MapOpResHs c ()) ~ MapOpRes (ToT c) (ToT ())) => MapOpHs c where
- type MapOpInpHs c
- type MapOpResHs c :: Type -> Type
type family IsoMapOpRes c b where ...
type family MapOpInpHs c
type family MapOpResHs c :: Type -> Type
class SizeOp (ToT c) => SizeOpHs c
class SliceOp (ToT c) => SliceOpHs c
class (UpdOp (ToT c), ToT (UpdOpKeyHs c) ~ UpdOpKey (ToT c), ToT (UpdOpParamsHs c) ~ UpdOpParams (ToT c)) => UpdOpHs c where
- type UpdOpKeyHs c
- type UpdOpParamsHs c
type family UpdOpKeyHs c
type family UpdOpParamsHs c
voidResultTag :: MText
data View a r
data VoidResult r
data Void_ a b
class ToContractRef cp contract where
- toContractRef :: contract -> ContractRef cp
expressionToScriptExpr :: Expression -> ByteString
lEncodeValue :: NicePrintedValue a => a -> ByteString
lPackValue :: NicePackedValue a => a -> ByteString
lUnpackValue :: NiceUnpackedValue a => ByteString -> Either UnpackError a
valueToScriptExpr :: NicePackedValue t => t -> ByteString
printLorentzContract :: (NiceParameterFull cp, NiceStorage st) => Bool -> Contract cp st -> LText
printLorentzValue :: NicePrintedValue v => Bool -> v -> LText
dipT :: forall a (inp :: [Type]) (dinp :: [Type]) (dout :: [Type]) (out :: [Type]). DipT inp a inp dinp dout out => (dinp :-> dout) -> inp :-> out
dropT :: forall a (inp :: [Type]) (dinp :: [Type]) (dout :: [Type]) (out :: [Type]). (DipT inp a inp dinp dout out, dinp ~ (a ': dout)) => inp :-> out
dupT :: forall a (st :: [Type]). DupT st a st => st :-> (a ': st)
analyzeLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> AnalyzerRes
compileLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> Instr (ToTs inp) (ToTs out)
compileLorentzContract :: (NiceParameterFull cp, NiceStorage st) => Contract cp st -> Contract (ToT cp) (ToT st)
compileLorentzWithOptions :: forall (inp :: [Type]) (out :: [Type]). CompilationOptions -> (inp :-> out) -> Instr (ToTs inp) (ToTs out)
defaultCompilationOptions :: CompilationOptions
defaultContract :: ContractCode cp st -> Contract cp st
interpretLorentzInstr :: forall (inp :: [Type]) (out :: [Type]). (IsoValuesStack inp, IsoValuesStack out) => ContractEnv -> (inp :-> out) -> Rec Identity inp -> Either MichelsonFailed (Rec Identity out)
interpretLorentzLambda :: (IsoValue inp, IsoValue out) => ContractEnv -> Lambda inp out -> inp -> Either MichelsonFailed out
data CompilationOptions = CompilationOptions {
- coOptimizerConf :: Maybe OptimizerConf
- coStringTransformer :: (Bool, MText -> MText)
- coBytesTransformer :: (Bool, ByteString -> ByteString)
}
composeStoreEntrypointOps :: forall (nameInStore :: Symbol) store substore (epName :: Symbol) epParam epStore. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreEntrypointOps substore epName epParam epStore -> StoreEntrypointOps store epName epParam epStore
composeStoreFieldOps :: forall (nameInStore :: Symbol) store substore (nameInSubstore :: Symbol) field. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreFieldOps substore nameInSubstore field -> StoreFieldOps store nameInSubstore field
composeStoreSubmapOps :: forall (nameInStore :: Symbol) store substore (mname :: Symbol) key value. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreSubmapOps substore mname key value -> StoreSubmapOps store mname key value
mkStoreEp :: forall (epName :: Symbol) epParam epStore. Label epName -> EntrypointLambda epParam epStore -> EntrypointsField epParam epStore
stDelete :: forall store (mname :: Symbol) key value (s :: [Type]). (StoreHasSubmap store mname key value, KnownValue value) => Label mname -> (key ': (store ': s)) :-> (store ': s)
stEntrypoint :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (epParam ': (store ': s)) :-> (([Operation], store) ': s)
stGet :: forall store (mname :: Symbol) key value (s :: [Type]). (StoreHasSubmap store mname key value, KnownValue value) => Label mname -> (key ': (store ': s)) :-> (Maybe value ': s)
stGetEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': (store ': s))
stGetEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (epStore ': (store ': s))
stGetField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (store ': s) :-> (ftype ': (store ': s))
stInsert :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (value ': (store ': s))) :-> (store ': s)
stInsertNew :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (forall (s0 :: [Type]) (any :: [Type]). (key ': s0) :-> any) -> (key ': (value ': (store ': s))) :-> (store ': s)
stMem :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (store ': s)) :-> (Bool ': s)
stSetEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (EntrypointLambda epParam epStore ': (store ': s)) :-> (store ': s)
stSetEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (epStore ': (store ': s)) :-> (store ': s)
stSetField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (ftype ': (store ': s)) :-> (store ': s)
stToEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': s)
stToEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (epStore ': s)
stToField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (store ': s) :-> (ftype ': s)
stUpdate :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (Maybe value ': (store ': s))) :-> (store ': s)
storeEntrypointOpsADT :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (HasFieldOfType store epmName (EntrypointsField epParam epStore), HasFieldOfType store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeEntrypointOpsDeeper :: forall store (nameInStore :: Symbol) substore (epName :: Symbol) epParam epStore. (HasFieldOfType store nameInStore substore, StoreHasEntrypoint substore epName epParam epStore) => Label nameInStore -> StoreEntrypointOps store epName epParam epStore
storeEntrypointOpsFields :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (StoreHasField store epmName (EntrypointsField epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeEntrypointOpsReferTo :: forall (epName :: Symbol) store epParam epStore (desiredName :: Symbol). Label epName -> StoreEntrypointOps store epName epParam epStore -> StoreEntrypointOps store desiredName epParam epStore
storeEntrypointOpsSubmapField :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (StoreHasSubmap store epmName MText (EntrypointLambda epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore
storeFieldOpsADT :: forall dt (fname :: Symbol) ftype. HasFieldOfType dt fname ftype => StoreFieldOps dt fname ftype
storeFieldOpsDeeper :: forall storage (fieldsPartName :: Symbol) fields (fname :: Symbol) ftype. (HasFieldOfType storage fieldsPartName fields, StoreHasField fields fname ftype) => Label fieldsPartName -> StoreFieldOps storage fname ftype
storeFieldOpsReferTo :: forall (name :: Symbol) storage field (desiredName :: Symbol). Label name -> StoreFieldOps storage name field -> StoreFieldOps storage desiredName field
storeSubmapOpsDeeper :: forall storage (bigMapPartName :: Symbol) fields (mname :: Symbol) key value. (HasFieldOfType storage bigMapPartName fields, StoreHasSubmap fields mname key value) => Label bigMapPartName -> StoreSubmapOps storage mname key value
storeSubmapOpsReferTo :: forall (name :: Symbol) storage key value (desiredName :: Symbol). Label name -> StoreSubmapOps storage name key value -> StoreSubmapOps storage desiredName key value
data (param :: k) ::-> (store :: k1)
type EntrypointLambda param store = Lambda (param, store) ([Operation], store)
type EntrypointsField param store = BigMap MText (EntrypointLambda param store)
type family StorageContains store (content :: [NamedField]) where ...
data StoreEntrypointOps store (epName :: Symbol) epParam epStore = StoreEntrypointOps {
- sopToEpLambda :: forall (s :: [Type]). Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': s)
- sopSetEpLambda :: forall (s :: [Type]). Label epName -> (EntrypointLambda epParam epStore ': (store ': s)) :-> (store ': s)
- sopToEpStore :: forall (s :: [Type]). Label epName -> (store ': s) :-> (epStore ': s)
- sopSetEpStore :: forall (s :: [Type]). Label epName -> (epStore ': (store ': s)) :-> (store ': s)
}
data StoreFieldOps store (fname :: Symbol) ftype = StoreFieldOps {
- sopToField :: forall (s :: [Type]). Label fname -> (store ': s) :-> (ftype ': s)
- sopSetField :: forall (s :: [Type]). Label fname -> (ftype ': (store ': s)) :-> (store ': s)
}
class StoreHasEntrypoint store (epName :: Symbol) epParam epStore | store epName -> epParam epStore where
- storeEpOps :: StoreEntrypointOps store epName epParam epStore
class StoreHasField store (fname :: Symbol) ftype | store fname -> ftype where
- storeFieldOps :: StoreFieldOps store fname ftype
class StoreHasSubmap store (mname :: Symbol) key value | store mname -> key value where
- storeSubmapOps :: StoreSubmapOps store mname key value
data StoreSubmapOps store (mname :: Symbol) key value = StoreSubmapOps {
- sopMem :: forall (s :: [Type]). Label mname -> (key ': (store ': s)) :-> (Bool ': s)
- sopGet :: forall (s :: [Type]). KnownValue value => Label mname -> (key ': (store ': s)) :-> (Maybe value ': s)
- sopUpdate :: forall (s :: [Type]). Label mname -> (key ': (Maybe value ': (store ': s))) :-> (store ': s)
- sopDelete :: forall (s :: [Type]). Maybe (Label mname -> (key ': (store ': s)) :-> (store ': s))
- sopInsert :: forall (s :: [Type]). Maybe (Label mname -> (key ': (value ': (store ': s))) :-> (store ': s))
}
data (k2 :: k) ~> (v :: k1)
caseUParam :: forall (entries :: [EntrypointKind]) (inp :: [Type]) (out :: [Type]). (CaseUParam entries, RequireUniqueEntrypoints entries) => Rec (CaseClauseU inp out) entries -> UParamFallback inp out -> (UParam entries ': inp) :-> out
caseUParamT :: forall (entries :: [EntrypointKind]) (inp :: [Type]) (out :: [Type]) clauses. (clauses ~ Rec (CaseClauseU inp out) entries, RecFromTuple clauses, CaseUParam entries) => IsoRecTuple clauses -> UParamFallback inp out -> (UParam entries ': inp) :-> out
mkUParam :: forall a (name :: Symbol) (entries :: [EntrypointKind]). (NicePackedValue a, LookupEntrypoint name entries ~ a, RequireUniqueEntrypoints entries) => Label name -> a -> UParam entries
pbsUParam :: forall (ctorName :: Symbol). KnownSymbol ctorName => ParamBuildingStep
unwrapUParam :: forall (entries :: [EntrypointKind]) (s :: [Type]). (UParam entries ': s) :-> ((MText, ByteString) ': s)
uparamFallbackFail :: forall (inp :: [Type]) (out :: [Type]). UParamFallback inp out
uparamFromAdt :: UParamLinearize up => up -> UParam (UParamLinearized up)
type (?:) (n :: Symbol) (a :: k) = '(n, a)
class CaseUParam (entries :: [EntrypointKind])
data ConstrainedSome (c :: Type -> Constraint) where
- ConstrainedSome :: forall (c :: Type -> Constraint) a. c a => a -> ConstrainedSome c
type EntrypointKind = (Symbol, Type)
data EntrypointLookupError
- = NoSuchEntrypoint MText
- | ArgumentUnpackFailed
type EntrypointsImpl (inp :: [Type]) (out :: [Type]) (entries :: [EntrypointKind]) = Rec (CaseClauseU inp out) entries
type family LookupEntrypoint (name :: Symbol) (entries :: [EntrypointKind]) where ...
type family RequireUniqueEntrypoints (entries :: [EntrypointKind]) where ...
type SomeInterface = '['("SomeEntrypoints", Void)]
newtype UParam (entries :: [EntrypointKind]) = UParamUnsafe (MText, ByteString)
type UParamFallback (inp :: [Type]) (out :: [Type]) = ((MText, ByteString) ': inp) :-> out
type UParamLinearize p = (Generic p, GUParamLinearize (Rep p))
type UParamLinearized p = GUParamLinearized (Rep p)
type UParam_ = UParam SomeInterface
class UnpackUParam (c :: Type -> Constraint) (entries :: [EntrypointKind]) where
- unpackUParam :: UParam entries -> Either EntrypointLookupError (MText, ConstrainedSome c)
fillUStore :: UStoreTraversable FillUStoreTW template => template -> UStoreMigration () template
mkUStore :: UStoreTraversable MkUStoreTW template => template -> UStore template
ustoreDecompose :: UStoreTraversable DecomposeUStoreTW template => UStore template -> Either Text (UStoreContent, template)
ustoreDecomposeFull :: UStoreTraversable DecomposeUStoreTW template => UStore template -> Either Text template
ustoreDelete :: forall store (name :: Symbol) (s :: [Type]). KeyAccessC store name => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (UStore store ': s)
ustoreGet :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (Maybe (GetUStoreValue store name) ': s)
ustoreGetField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (UStore store ': s) :-> (GetUStoreField store name ': (UStore store ': s))
ustoreInsert :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (GetUStoreValue store name ': (UStore store ': s))) :-> (UStore store ': s)
ustoreInsertNew :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (forall (s0 :: [Type]) (any :: [Type]). (GetUStoreKey store name ': s0) :-> any) -> (GetUStoreKey store name ': (GetUStoreValue store name ': (UStore store ': s))) :-> (UStore store ': s)
ustoreMem :: forall store (name :: Symbol) (s :: [Type]). KeyAccessC store name => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (Bool ': s)
ustoreSetField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (GetUStoreField store name ': (UStore store ': s)) :-> (UStore store ': s)
ustoreToField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (UStore store ': s) :-> (GetUStoreField store name ': s)
ustoreUpdate :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (Maybe (GetUStoreValue store name) ': (UStore store ': s))) :-> (UStore store ': s)
liftUStore :: forall template (name :: Symbol) (s :: [Type]). (Generic template, RequireAllUniqueFields template) => Label name -> (UStore (GetFieldType template name) ': s) :-> (UStore template ': s)
unliftUStore :: forall template (name :: Symbol) (s :: [Type]). Generic template => Label name -> (UStore template ': s) :-> (UStore (GetFieldType template name) ': s)
migrationToLambda :: UStoreMigration oldTemplate newTemplate -> Lambda (UStore oldTemplate) (UStore newTemplate)
migrationToScript :: UStoreMigration os ns -> MigrationScript os ns
migrationToScriptI :: UStoreMigration os ns -> Identity (MigrationScript os ns)
mkUStoreMigration :: forall oldTempl newTempl (_1 :: [Symbol]). Lambda (MUStore oldTempl newTempl (BuildDiff oldTempl newTempl) ('[] :: [Symbol])) (MUStore oldTempl newTempl ('[] :: [DiffItem]) _1) -> UStoreMigration oldTempl newTempl
migrateAddField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcAdd field diff, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s)
migrateExtractField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcRemove field diff, HasUField field fieldTy oldTempl, RequireUntouched field (IsElem field touched)) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (fieldTy ': (MUStore oldTempl newTempl newDiff (field ': touched) ': s))
migrateGetField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (s :: [Type]). (HasUField field fieldTy oldTempl, RequireUntouched field (IsElem field touched)) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s))
migrateModifyField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (s :: [Type]). (HasUField field fieldTy oldTempl, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl diff touched ': s)
migrateOverwriteField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy oldFieldTy (marker :: UStoreMarkerType) (oldMarker :: UStoreMarkerType) (newDiff :: [DiffItem]) (newDiff0 :: [DiffItem]) (s :: [Type]). ('(UStoreFieldExt oldMarker oldFieldTy, newDiff0) ~ CoverDiff 'DcRemove field diff, '(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcAdd field newDiff0, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s)
migrateRemoveField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcRemove field diff, HasUField field fieldTy oldTempl) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s)
mustoreToOld :: forall (touched :: [Symbol]) oldTemplate newTemplate (remDiff :: [DiffItem]) (s :: [Type]). RequireBeInitial touched => (MUStore oldTemplate newTemplate remDiff touched ': s) :-> (UStore oldTemplate ': s)
class KnownUStoreMarker marker => UStoreMarkerHasDoc (marker :: UStoreMarkerType) where
- ustoreMarkerKeyEncoding :: Text -> Text
class Typeable template => UStoreTemplateHasDoc template where
- ustoreTemplateDocName :: Text
- ustoreTemplateDocDescription :: Markdown
- ustoreTemplateDocContents :: Markdown
- ustoreTemplateDocDependencies :: [SomeTypeWithDoc]
data DecomposeUStoreTW
data FillUStoreTW
data MkUStoreTW
type HasUField (name :: Symbol) ty store = (FieldAccessC store name, GetUStoreField store name ~ ty)
type HasUStore (name :: Symbol) key value store = (KeyAccessC store name, ValueAccessC store name, GetUStoreKey store name ~ key, GetUStoreValue store name ~ value)
type HasUStoreForAllIn store constrained = (Generic store, GHasStoreForAllIn constrained (Rep store))
newtype MigrationScript oldStore newStore = MigrationScript {
- unMigrationScript :: Lambda UStore_ UStore_
}
type MigrationScript_ = MigrationScript SomeUTemplate SomeUTemplate
data UStoreMigration oldTempl newTempl
type UStoreTraversable way a = (Generic a, GUStoreTraversable way (Rep a), UStoreTraversalWay way)
type GetUStoreField store (name :: Symbol) = FSValue (GetUStore name store)
type GetUStoreFieldMarker store (name :: Symbol) = FSMarker (GetUStore name store)
type GetUStoreKey store (name :: Symbol) = MSKey (GetUStore name store)
type GetUStoreValue store (name :: Symbol) = MSValue (GetUStore name store)
class KnownUStoreMarker (marker :: UStoreMarkerType) where
- type ShowUStoreField (marker :: UStoreMarkerType) v :: ErrorMessage
- mkFieldMarkerUKey :: MText -> ByteString
type family ShowUStoreField (marker :: UStoreMarkerType) v :: ErrorMessage
type PickMarkedFields (marker :: UStoreMarkerType) template = GPickMarkedFields marker (Rep template)
data UStore a
type UStoreField = UStoreFieldExt UMarkerPlainField
newtype UStoreFieldExt (m :: UStoreMarkerType) v = UStoreField {
- unUStoreField :: v
}
type UStoreMarkerType = UStoreMarker -> Type
newtype k |~> v = UStoreSubMap {
- unUStoreSubMap :: Map k v
}
callingDefTAddress :: NiceParameterFull cp => TAddress cp -> ContractRef (GetDefaultEntrypointArg cp)
callingTAddress :: forall cp (mname :: Maybe Symbol). NiceParameterFull cp => TAddress cp -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2
mt :: QuasiQuoter
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
pattern DefEpName :: EpName
oneMutez :: Mutez
timestampFromSeconds :: Integer -> Timestamp
timestampFromUTCTime :: UTCTime -> Timestamp
timestampQuote :: QuasiQuoter
toMutez :: Word32 -> Mutez
zeroMutez :: Mutez
cstr :: forall (n :: Nat). KnownNat n => [Natural] -> CstrDepth
customGeneric :: String -> GenericStrategy -> Q [Dec]
fld :: forall (n :: Nat). KnownNat n => Natural
leftBalanced :: GenericStrategy
leftComb :: GenericStrategy
rightBalanced :: GenericStrategy
rightComb :: GenericStrategy
withDepths :: [CstrDepth] -> GenericStrategy
class FromContractRef cp contract where
- fromContractRef :: ContractRef cp -> contract
class ToAddress a where
- toAddress :: a -> Address
class ToTAddress cp a where
- toTAddress :: a -> TAddress cp
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)

Documentation

data Bool #

Constructors

False
True

Instances

Instances details

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] #
Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> 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 #
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 #
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 #
Generic Bool	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Lift Bool
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Bool -> Q Exp #
Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
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
Storable Bool	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Bool -> Int # alignment :: Bool -> Int # peekElemOff :: Ptr Bool -> Int -> IO Bool # pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () # peekByteOff :: Ptr b -> Int -> IO Bool # pokeByteOff :: Ptr b -> Int -> Bool -> IO () # peek :: Ptr Bool -> IO Bool # poke :: Ptr Bool -> Bool -> IO () #
Bits Bool	Interpret `Bool` as 1-bit bit-field Since: base-4.7.0.0
Instance details Defined in Data.Bits Methods (.&.) :: Bool -> Bool -> Bool # (.\|.) :: Bool -> Bool -> Bool # xor :: Bool -> Bool -> Bool # complement :: Bool -> Bool # shift :: Bool -> Int -> Bool # rotate :: Bool -> Int -> Bool # zeroBits :: Bool # bit :: Int -> Bool # setBit :: Bool -> Int -> Bool # clearBit :: Bool -> Int -> Bool # complementBit :: Bool -> Int -> Bool # testBit :: Bool -> Int -> Bool # bitSizeMaybe :: Bool -> Maybe Int # bitSize :: Bool -> Int # isSigned :: Bool -> Bool # shiftL :: Bool -> Int -> Bool # unsafeShiftL :: Bool -> Int -> Bool # shiftR :: Bool -> Int -> Bool # unsafeShiftR :: Bool -> Int -> Bool # rotateL :: Bool -> Int -> Bool # rotateR :: Bool -> Int -> Bool # popCount :: Bool -> Int #
FiniteBits Bool	Since: base-4.7.0.0
Instance details Defined in Data.Bits Methods finiteBitSize :: Bool -> Int # countLeadingZeros :: Bool -> Int # countTrailingZeros :: Bool -> Int #
NFData Bool
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
Unbox Bool
Instance details Defined in Data.Vector.Unboxed.Base
PShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg0 arg1 arg2 :: Symbol # type Show_ arg0 :: Symbol # type ShowList arg0 arg1 :: Symbol #
SShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (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) #
PEnum Bool
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg0 :: a0 # type Pred arg0 :: a0 # type ToEnum arg0 :: a0 # type FromEnum arg0 :: Nat # type EnumFromTo arg0 arg1 :: [a0] # type EnumFromThenTo arg0 arg1 arg2 :: [a0] #
SEnum Bool
Instance details Defined in Data.Singletons.Prelude.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 :: Nat). 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) #
PBounded Bool
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a0 # type MaxBound :: a0 #
SBounded Bool
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
POrd Bool
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg0 arg1 :: Ordering # type arg0 < arg1 :: Bool # type arg0 <= arg1 :: Bool # type arg0 > arg1 :: Bool # type arg0 >= arg1 :: Bool # type Max arg0 arg1 :: a0 # type Min arg0 arg1 :: a0 #
SOrd Bool
Instance details Defined in Data.Singletons.Prelude.Ord 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) #
SEq Bool
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a == b) # (%/=) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a /= b) #
PEq Bool
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
HasAnnotation Bool
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool)
TypeHasDoc Bool
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
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
TestCoercion SBool
Instance details Defined in Data.Singletons.Prelude.Instances Methods testCoercion :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (Coercion a b) #
TestEquality SBool
Instance details Defined in Data.Singletons.Prelude.Instances Methods testEquality :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (a :~: b) #
Vector Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # 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 :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) #
UnaryArithOpHs Not Bool
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool #
ArithOpHs And Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Bool Bool #
ArithOpHs Or Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Bool Bool #
ArithOpHs Xor Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Bool 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 #
() :=> (Eq Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Bool #
() :=> (Ord Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord 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 #
() :=> (Bits Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Bool #
SuppressUnusedWarnings NotSym0
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679922900Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings All_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Any_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679628770Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679922887Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680297229Sym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SingI NotSym0
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing NotSym0 #
SingI (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (\|\|@#@$) #
SingI (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (&&@#@$) #
SingI (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing (<=?@#@$) #
SingI AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AllSym0 #
SingI AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AnySym0 #
SingI ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 #
SingI OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing OrSym0 #
SingI AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AndSym0 #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679601577 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679601332 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679628770Sym1 a6989586621679628768 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679754468 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680297229Sym1 a6989586621680297226 :: TyFun Bool (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679754497 () ~> f6989586621679754497 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621680980258 () ~> f6989586621680980258 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680368539] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680368562] ([a6989586621680368562] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621680054761] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621680054726] ([a6989586621680054726] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621680054727] ([a6989586621680054727] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621680054725] ([a6989586621680054725] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679712805) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679712806) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680368550 ([a6989586621680368550] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680054723 ([a6989586621680054723] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680054724 ([a6989586621680054724] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680417431 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680417996Scrutinee_6989586621680417758Sym0 :: TyFun (t6989586621680417511 Bool) All -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680417987Scrutinee_6989586621680417760Sym0 :: TyFun (t6989586621680417511 Bool) Any -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409448Scrutinee_6989586621680409386Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409421Scrutinee_6989586621680409384Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680417432 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679603698 (k6989586621679603698 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679600564 (a6989586621679600564 ~> (Bool ~> a6989586621679600564)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617628Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617610Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617592Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617574Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617672Scrutinee_6989586621679617463Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617654Scrutinee_6989586621679617461Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617563Scrutinee_6989586621679617451Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617558Scrutinee_6989586621679617449Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680570779Sym0 :: TyFun a6989586621680417528 (Identity a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680570906Sym0 :: TyFun (Identity a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680368568 ~> Bool) ([a6989586621680368568] ~> [a6989586621680368568]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680368566 ~> Bool) ([a6989586621680368566] ~> ([a6989586621680368566], [a6989586621680368566])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680368564 ~> Bool) ([a6989586621680368564] ~> ([a6989586621680368564], [a6989586621680368564])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680368556 ~> (a6989586621680368556 ~> Bool)) ([a6989586621680368556] ~> [a6989586621680368556]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680368565 ~> Bool) ([a6989586621680368565] ~> [a6989586621680368565]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680368567 ~> Bool) ([a6989586621680368567] ~> [a6989586621680368567]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621680054640 ~> (a6989586621680054640 ~> Bool)) ([a6989586621680054640] ~> ([a6989586621680054640] ~> [a6989586621680054640])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621680054667 ~> Bool) ([a6989586621680054667] ~> [a6989586621680054667]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621680054664 ~> Bool) ([a6989586621680054664] ~> ([a6989586621680054664], [a6989586621680054664])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621680054650 ~> Bool) (a6989586621680054650 ~> (([a6989586621680054650], [a6989586621680054650]) ~> ([a6989586621680054650], [a6989586621680054650]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621680054651 ~> Bool) ([a6989586621680054651] ~> ([a6989586621680054651], [a6989586621680054651])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621680054642 ~> (a6989586621680054642 ~> Bool)) ([a6989586621680054642] ~> [a6989586621680054642]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059047ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059047YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059047X_6989586621680059048Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059004ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059004YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059004X_6989586621680059005Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621680054668 ~> (a6989586621680054668 ~> Bool)) ([a6989586621680054668] ~> ([a6989586621680054668] ~> [a6989586621680054668])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621680054654 ~> (a6989586621680054654 ~> Bool)) ([a6989586621680054654] ~> [[a6989586621680054654]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621680054670 ~> Bool) ([a6989586621680054670] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621680054675 ~> Bool) ([a6989586621680054675] ~> [a6989586621680054675]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621680054641 ~> (a6989586621680054641 ~> Bool)) (a6989586621680054641 ~> ([a6989586621680054641] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621680054666 ~> Bool) ([a6989586621680054666] ~> [a6989586621680054666]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621680054665 ~> Bool) ([a6989586621680054665] ~> [a6989586621680054665]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621680054680 ~> (a6989586621680054680 ~> Bool)) ([a6989586621680054680] ~> ([a6989586621680054680] ~> [a6989586621680054680])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621680054681 ~> (a6989586621680054681 ~> Bool)) (a6989586621680054681 ~> ([a6989586621680054681] ~> [a6989586621680054681])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621680054663 ~> Bool) ([a6989586621680054663] ~> ([a6989586621680054663], [a6989586621680054663])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680054744 ~> Bool) ([a6989586621680054744] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680054745 ~> Bool) ([a6989586621680054745] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679736119 ~> Bool) ((a6989586621679736119 ~> a6989586621679736119) ~> (a6989586621679736119 ~> a6989586621679736119)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
SingI x => SingI ((\|\|@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((\|\|@#@$$) x) #
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((&&@#@$$) x) #
SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing GuardSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing WhenSym0 #
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 #
SingI (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnullSym0 #
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListisPrefixOfSym0 #
SingI (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NullSym0 #
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 #
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 #
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListelemSym0 #
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NotElemSym0 #
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemSym0 #
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing OrSym0 #
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AndSym0 #
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (==@#@$) #
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (/=@#@$) #
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing Bool_Sym0 #
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>@#@$) #
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>=@#@$) #
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<@#@$) #
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<=@#@$) #
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListtakeWhileSym0 #
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListspanSym0 #
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListpartitionSym0 #
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnubBySym0 #
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListfilterSym0 #
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListdropWhileSym0 #
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 #
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 #
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SpanSym0 #
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SelectSym0 #
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 #
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NubBySym0 #
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 #
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 #
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing Elem_bySym0 #
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 #
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileEndSym0 #
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteFirstsBySym0 #
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 #
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing BreakSym0 #
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AnySym0 #
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AllSym0 #
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing UntilSym0 #
SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680369522 :: TyFun [a6989586621680368562] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym1 a6989586621680369457 :: TyFun [a6989586621680368550] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680059593 :: TyFun [a6989586621680054723] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680059613 :: TyFun [a6989586621680054726] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680059619 :: TyFun [a6989586621680054727] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680059607 :: TyFun [a6989586621680054725] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621680059600 :: TyFun [a6989586621680054724] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680059850 :: TyFun [a6989586621680054744] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680059857 :: TyFun [a6989586621680054745] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680401497 b6989586621680401498) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680401499 b6989586621680401500) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058817Scrutinee_6989586621680055341Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym1 a6989586621680058736 :: TyFun a6989586621680054641 ([a6989586621680054641] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680417422 (t6989586621680417421 a6989586621680417422 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409448Scrutinee_6989586621680409386Sym1 x6989586621680409441 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409421Scrutinee_6989586621680409384Sym1 x6989586621680409414 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680419218Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680419051Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418884Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418543Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418423Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679603699 :: TyFun k6989586621679603698 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$$) x6989586621679603705 :: TyFun a6989586621679603704 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$$) x6989586621679603707 :: TyFun a6989586621679603704 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679600570 :: TyFun a6989586621679600564 (Bool ~> a6989586621679600564) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617628Sym1 a6989586621679617626 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617610Sym1 a6989586621679617608 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617592Sym1 a6989586621679617590 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679617574Sym1 a6989586621679617572 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617672Scrutinee_6989586621679617463Sym1 x6989586621679617670 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617654Scrutinee_6989586621679617461Sym1 x6989586621679617652 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617563Scrutinee_6989586621679617451Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679617558Scrutinee_6989586621679617449Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$$) arg6989586621679617532 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$$) arg6989586621679617536 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$$) arg6989586621679617524 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$$) arg6989586621679617528 :: TyFun a6989586621679617431 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680733389Sym0 :: TyFun (Arg a6989586621680732234 b6989586621680732235) (Arg a6989586621680732234 b6989586621680732235 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680570779Sym1 a6989586621680570777 :: TyFun (Identity a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058900ZsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058900YsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058900X_6989586621680058901Sym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] ([a6989586621680054664], [a6989586621680054664]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058752NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680059080Sym0 :: TyFun (a6989586621680054761 ~> Bool) (TyFun k (TyFun a6989586621680054761 (TyFun [a6989586621680054761] [a6989586621680054761] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680417977Scrutinee_6989586621680417762Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) Any -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680417964Scrutinee_6989586621680417764Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) All -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680417879Scrutinee_6989586621680417770Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) (First a6989586621680417514) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680417880Sym0 :: TyFun (a6989586621679083079 ~> Bool) (TyFun k (TyFun a6989586621679083079 (First a6989586621679083079) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680417430 ~> Bool) (t6989586621680417429 a6989586621680417430 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680417428 ~> Bool) (t6989586621680417427 a6989586621680417428 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679736255GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621680980254 ~> Bool) (m6989586621680980253 a6989586621680980254 ~> m6989586621680980253 a6989586621680980254) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621680980292 ~> m6989586621680980291 Bool) ([a6989586621680980292] ~> m6989586621680980291 [a6989586621680980292]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListisPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListelemSym1 d) #
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (NotElemSym1 d) #
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) #
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) #
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemSym1 d) #
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AnySym1 d) #
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AllSym1 d) #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 #
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym1 d) #
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 #
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing ElemSym0 #
(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((==@#@$$) x) #
(SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((/=@#@$$) x) #
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (Bool_Sym1 d) #
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>@#@$$) d) #
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>=@#@$$) d) #
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<@#@$$) d) #
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<=@#@$$) d) #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AnySym0 #
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AllSym0 #
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 #
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 #
SuppressUnusedWarnings (Bool_Sym2 a6989586621679600571 a6989586621679600570 :: TyFun Bool a6989586621679600564 -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym2 a6989586621680058737 a6989586621680058736 :: TyFun [a6989586621680054641] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059084Scrutinee_6989586621680055319Sym0 :: TyFun k1 (TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058979Scrutinee_6989586621680055325Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058965Scrutinee_6989586621680055327Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058885Scrutinee_6989586621680055337Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058817Scrutinee_6989586621680055341Sym1 n6989586621680058815 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058798Scrutinee_6989586621680055343Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058783Scrutinee_6989586621680055345Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058762Scrutinee_6989586621680055347Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680419345Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680419178Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680419011Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680418862Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680418686Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680418379Sym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680417511 a6989586621680417526) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680417900 t6989586621680417421 :: TyFun (t6989586621680417421 a6989586621680417422) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680418386Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680419218Sym1 a6989586621680419216 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680419051Sym1 a6989586621680419049 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418884Sym1 a6989586621680418882 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418543Sym1 a6989586621680418541 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680418423Sym1 a6989586621680418421 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 arg6989586621680418174 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680417971 t6989586621680417429 :: TyFun (t6989586621680417429 a6989586621680417430) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680417958 t6989586621680417427 :: TyFun (t6989586621680417427 a6989586621680417428) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980750Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680733389Sym1 a6989586621680733387 :: TyFun (Arg a6989586621680732234 b6989586621680732235) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980747Sym0 :: TyFun (k2 ~> f6989586621679754551 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679754551 [k2]) (f6989586621679754551 [k2]) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980579Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679754575 k1) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool 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.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym2 d1 d2) #
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NullSym0 #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d t) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (ElemSym1 d t) #
(SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AnySym1 d t) #
(SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AllSym1 d t) #
SuppressUnusedWarnings (Let6989586621680059084Scrutinee_6989586621680055319Sym1 x6989586621680059082 :: TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058979Scrutinee_6989586621680055325Sym1 n6989586621680058976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058965Scrutinee_6989586621680055327Sym1 n6989586621680058962 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058885Scrutinee_6989586621680055337Sym1 key6989586621680058881 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058798Scrutinee_6989586621680055343Sym1 x6989586621680058795 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058783Scrutinee_6989586621680055345Sym1 x6989586621680058780 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058762Scrutinee_6989586621680055347Sym1 y6989586621680058759 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680418386Sym1 a_69895866216804183816989586621680418385 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899506Scrutinee_6989586621679899272Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980750Sym1 x6989586621680980749 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058783Scrutinee_6989586621680055345Sym2 xs6989586621680058781 x6989586621680058780 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058762Scrutinee_6989586621680055347Sym2 ys6989586621680058760 y6989586621680058759 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058979Scrutinee_6989586621680055325Sym2 x6989586621680058977 n6989586621680058976 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058965Scrutinee_6989586621680055327Sym2 x6989586621680058963 n6989586621680058962 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058885Scrutinee_6989586621680055337Sym2 x6989586621680058882 key6989586621680058881 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058798Scrutinee_6989586621680055343Sym2 xs6989586621680058796 x6989586621680058795 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680418386Sym2 t6989586621680418393 a_69895866216804183816989586621680418385 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899506Scrutinee_6989586621679899272Sym1 x6989586621679899505 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym0 :: 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.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym0 :: 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.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980750Sym2 p6989586621680980745 x6989586621680980749 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059084Scrutinee_6989586621680055319Sym2 xs6989586621680059083 x6989586621680059082 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680059152Sym0 :: TyFun (b6989586621679754579 ~> (a6989586621680054744 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680054744 (TyFun [a6989586621680054744] (TyFun b6989586621679754579 (m6989586621679754575 b6989586621679754579) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680980750Sym3 a_69895866216809807436989586621680980746 p6989586621680980745 x6989586621680980749 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680059084Scrutinee_6989586621680055319Sym3 p6989586621680059078 xs6989586621680059083 x6989586621680059082 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058885Scrutinee_6989586621680055337Sym3 y6989586621680058883 x6989586621680058882 key6989586621680058881 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058783Scrutinee_6989586621680055345Sym3 ls6989586621680058782 xs6989586621680058781 x6989586621680058780 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899506Scrutinee_6989586621679899272Sym2 x06989586621679899496 x6989586621679899505 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym1 x16989586621679899424 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym1 x16989586621679899367 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058762Scrutinee_6989586621680055347Sym3 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680058762Scrutinee_6989586621680055347Sym4 eq6989586621680058750 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899506Scrutinee_6989586621679899272Sym3 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym2 x26989586621679899425 x16989586621679899424 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym2 x26989586621679899368 x16989586621679899367 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899506Scrutinee_6989586621679899272Sym4 arg_69895866216798992686989586621679899492 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k4 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym3 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym3 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym4 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym4 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899429Scrutinee_6989586621679899286Sym5 arg_69895866216798992826989586621679899420 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k5 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679899372Scrutinee_6989586621679899296Sym5 arg_69895866216798992926989586621679899363 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k5 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
type Rep Bool
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 DemoteRep Bool
Instance details Defined in GHC.Generics type DemoteRep Bool = Bool
newtype Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621679895528Sym0
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621679895526Sym0
type Sing
Instance details Defined in Data.Singletons.Prelude.Instances type Sing = SBool
type Demote Bool
Instance details Defined in Data.Singletons.Prelude.Instances type Demote Bool = Bool
type ToT Bool
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
type TypeDocFieldDescriptions Bool
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type Show_ (arg0 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg0 :: Bool) = Apply (Show__6989586621680279216Sym0 :: TyFun Bool Symbol -> Type) arg0
type FromEnum (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type FromEnum (a :: Bool) = Apply FromEnum_6989586621679922900Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Enum type ToEnum a = Apply ToEnum_6989586621679922887Sym0 a
type Pred (arg0 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Pred (arg0 :: Bool) = Apply (Pred_6989586621679899553Sym0 :: TyFun Bool Bool -> Type) arg0
type Succ (arg0 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Succ (arg0 :: Bool) = Apply (Succ_6989586621679899538Sym0 :: TyFun Bool Bool -> Type) arg0
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
type UnaryArithResHs Not Bool
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Bool = Bool
type ShowList (arg1 :: [Bool]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Bool]) arg2 = Apply (Apply (ShowList_6989586621680279224Sym0 :: TyFun [Bool] (Symbol ~> Symbol) -> Type) arg1) arg2
type EnumFromTo (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (EnumFromTo_6989586621679899563Sym0 :: TyFun Bool (Bool ~> [Bool]) -> Type) arg1) arg2
type Min (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Min_6989586621679617664Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Max (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Max_6989586621679617646Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) >= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) >= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679617628Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) > (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) > (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679617610Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) <= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) <= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679617592Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) < (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) < (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679617574Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Bool) (a2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a1 :: Bool) (a2 :: Bool) = Apply (Apply Compare_6989586621679628770Sym0 a1) a2
type (x :: Bool) /= (y :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Bool) /= (y :: Bool) = Not (x == y)
type (a :: Bool) == (b :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (a :: Bool) == (b :: Bool) = Equals_6989586621679605203 a b
type ArithResHs And Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs And Bool Bool = Bool
type ArithResHs Or Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs Or Bool Bool = Bool
type ArithResHs Xor Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs Xor Bool Bool = Bool
type ShowsPrec a1 (a2 :: Bool) a3
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Bool) a3 = Apply (Apply (Apply ShowsPrec_6989586621680297229Sym0 a1) a2) a3
type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) = Apply (Apply (Apply (EnumFromThenTo_6989586621679899576Sym0 :: TyFun Bool (Bool ~> (Bool ~> [Bool])) -> Type) arg1) arg2) arg3
type Apply NotSym0 (a6989586621679601878 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply NotSym0 (a6989586621679601878 :: Bool) = Not a6989586621679601878
type Apply FromEnum_6989586621679922900Sym0 (a6989586621679922899 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply FromEnum_6989586621679922900Sym0 (a6989586621679922899 :: Bool) = FromEnum_6989586621679922900 a6989586621679922899
type Apply All_Sym0 (a6989586621679991069 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply All_Sym0 (a6989586621679991069 :: Bool) = All_ a6989586621679991069
type Apply AllSym0 (t6989586621679958404 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AllSym0 (t6989586621679958404 :: Bool) = 'All t6989586621679958404
type Apply Any_Sym0 (a6989586621679991068 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply Any_Sym0 (a6989586621679991068 :: Bool) = Any_ a6989586621679991068
type Apply AnySym0 (t6989586621679958417 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AnySym0 (t6989586621679958417 :: Bool) = 'Any t6989586621679958417
type Apply ToEnum_6989586621679922887Sym0 (a6989586621679922886 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply ToEnum_6989586621679922887Sym0 (a6989586621679922886 :: Nat) = ToEnum_6989586621679922887 a6989586621679922886
type Apply GetAllSym0 (a6989586621679958401 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAllSym0 (a6989586621679958401 :: All) = GetAll a6989586621679958401
type Apply GetAnySym0 (a6989586621679958414 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAnySym0 (a6989586621679958414 :: Any) = GetAny a6989586621679958414
type Apply ((\|\|@#@$$) a6989586621679601577 :: TyFun Bool Bool -> Type) (b6989586621679601578 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((\|\|@#@$$) a6989586621679601577 :: TyFun Bool Bool -> Type) (b6989586621679601578 :: Bool) = a6989586621679601577 \|\| b6989586621679601578
type Apply ((&&@#@$$) a6989586621679601332 :: TyFun Bool Bool -> Type) (b6989586621679601333 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((&&@#@$$) a6989586621679601332 :: TyFun Bool Bool -> Type) (b6989586621679601333 :: Bool) = a6989586621679601332 && b6989586621679601333
type Apply (Compare_6989586621679628770Sym1 a6989586621679628768 :: TyFun Bool Ordering -> Type) (a6989586621679628769 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679628770Sym1 a6989586621679628768 :: TyFun Bool Ordering -> Type) (a6989586621679628769 :: Bool) = Compare_6989586621679628770 a6989586621679628768 a6989586621679628769
type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) = a3530822107858468865 <=? b3530822107858468866
type Apply (Let6989586621680409421Scrutinee_6989586621680409384Sym1 x6989586621680409414 :: TyFun k1 Bool -> Type) (y6989586621680409415 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409421Scrutinee_6989586621680409384Sym1 x6989586621680409414 :: TyFun k1 Bool -> Type) (y6989586621680409415 :: k1) = Let6989586621680409421Scrutinee_6989586621680409384 x6989586621680409414 y6989586621680409415
type Apply (Let6989586621680409448Scrutinee_6989586621680409386Sym1 x6989586621680409441 :: TyFun k1 Bool -> Type) (y6989586621680409442 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409448Scrutinee_6989586621680409386Sym1 x6989586621680409441 :: TyFun k1 Bool -> Type) (y6989586621680409442 :: k1) = Let6989586621680409448Scrutinee_6989586621680409386 x6989586621680409441 y6989586621680409442
type Apply ((==@#@$$) x6989586621679603705 :: TyFun a Bool -> Type) (y6989586621679603706 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$$) x6989586621679603705 :: TyFun a Bool -> Type) (y6989586621679603706 :: a) = x6989586621679603705 == y6989586621679603706
type Apply ((/=@#@$$) x6989586621679603707 :: TyFun a Bool -> Type) (y6989586621679603708 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$$) x6989586621679603707 :: TyFun a Bool -> Type) (y6989586621679603708 :: a) = x6989586621679603707 /= y6989586621679603708
type Apply (DefaultEqSym1 a6989586621679603699 :: TyFun k Bool -> Type) (b6989586621679603700 :: k)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679603699 :: TyFun k Bool -> Type) (b6989586621679603700 :: k) = DefaultEq a6989586621679603699 b6989586621679603700
type Apply (Let6989586621679617558Scrutinee_6989586621679617449Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type) (y6989586621679617557 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617558Scrutinee_6989586621679617449Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type) (y6989586621679617557 :: k1) = Let6989586621679617558Scrutinee_6989586621679617449 x6989586621679617556 y6989586621679617557
type Apply (TFHelper_6989586621679617628Sym1 a6989586621679617626 :: TyFun a Bool -> Type) (a6989586621679617627 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617628Sym1 a6989586621679617626 :: TyFun a Bool -> Type) (a6989586621679617627 :: a) = TFHelper_6989586621679617628 a6989586621679617626 a6989586621679617627
type Apply (TFHelper_6989586621679617610Sym1 a6989586621679617608 :: TyFun a Bool -> Type) (a6989586621679617609 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617610Sym1 a6989586621679617608 :: TyFun a Bool -> Type) (a6989586621679617609 :: a) = TFHelper_6989586621679617610 a6989586621679617608 a6989586621679617609
type Apply (TFHelper_6989586621679617592Sym1 a6989586621679617590 :: TyFun a Bool -> Type) (a6989586621679617591 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617592Sym1 a6989586621679617590 :: TyFun a Bool -> Type) (a6989586621679617591 :: a) = TFHelper_6989586621679617592 a6989586621679617590 a6989586621679617591
type Apply (TFHelper_6989586621679617574Sym1 a6989586621679617572 :: TyFun a Bool -> Type) (a6989586621679617573 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617574Sym1 a6989586621679617572 :: TyFun a Bool -> Type) (a6989586621679617573 :: a) = TFHelper_6989586621679617574 a6989586621679617572 a6989586621679617573
type Apply ((<=@#@$$) arg6989586621679617528 :: TyFun a Bool -> Type) (arg6989586621679617529 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$$) arg6989586621679617528 :: TyFun a Bool -> Type) (arg6989586621679617529 :: a) = arg6989586621679617528 <= arg6989586621679617529
type Apply ((>=@#@$$) arg6989586621679617536 :: TyFun a Bool -> Type) (arg6989586621679617537 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$$) arg6989586621679617536 :: TyFun a Bool -> Type) (arg6989586621679617537 :: a) = arg6989586621679617536 >= arg6989586621679617537
type Apply ((>@#@$$) arg6989586621679617532 :: TyFun a Bool -> Type) (arg6989586621679617533 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$$) arg6989586621679617532 :: TyFun a Bool -> Type) (arg6989586621679617533 :: a) = arg6989586621679617532 > arg6989586621679617533
type Apply (Let6989586621679617672Scrutinee_6989586621679617463Sym1 x6989586621679617670 :: TyFun k1 Bool -> Type) (y6989586621679617671 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617672Scrutinee_6989586621679617463Sym1 x6989586621679617670 :: TyFun k1 Bool -> Type) (y6989586621679617671 :: k1) = Let6989586621679617672Scrutinee_6989586621679617463 x6989586621679617670 y6989586621679617671
type Apply (Let6989586621679617654Scrutinee_6989586621679617461Sym1 x6989586621679617652 :: TyFun k1 Bool -> Type) (y6989586621679617653 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617654Scrutinee_6989586621679617461Sym1 x6989586621679617652 :: TyFun k1 Bool -> Type) (y6989586621679617653 :: k1) = Let6989586621679617654Scrutinee_6989586621679617461 x6989586621679617652 y6989586621679617653
type Apply (Let6989586621679617563Scrutinee_6989586621679617451Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type) (y6989586621679617557 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617563Scrutinee_6989586621679617451Sym1 x6989586621679617556 :: TyFun k1 Bool -> Type) (y6989586621679617557 :: k1) = Let6989586621679617563Scrutinee_6989586621679617451 x6989586621679617556 y6989586621679617557
type Apply ((<@#@$$) arg6989586621679617524 :: TyFun a Bool -> Type) (arg6989586621679617525 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$$) arg6989586621679617524 :: TyFun a Bool -> Type) (arg6989586621679617525 :: a) = arg6989586621679617524 < arg6989586621679617525
type Apply (Bool_Sym2 a6989586621679600571 a6989586621679600570 :: TyFun Bool a -> Type) (a6989586621679600572 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym2 a6989586621679600571 a6989586621679600570 :: TyFun Bool a -> Type) (a6989586621679600572 :: Bool) = Bool_ a6989586621679600571 a6989586621679600570 a6989586621679600572
type Apply (Let6989586621680058817Scrutinee_6989586621680055341Sym1 n6989586621680058815 :: TyFun k Bool -> Type) (x6989586621680058816 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058817Scrutinee_6989586621680055341Sym1 n6989586621680058815 :: TyFun k Bool -> Type) (x6989586621680058816 :: k) = Let6989586621680058817Scrutinee_6989586621680055341 n6989586621680058815 x6989586621680058816
type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym2 xs6989586621680058796 x6989586621680058795 :: TyFun k3 Bool -> Type) (n6989586621680058797 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym2 xs6989586621680058796 x6989586621680058795 :: TyFun k3 Bool -> Type) (n6989586621680058797 :: k3) = Let6989586621680058798Scrutinee_6989586621680055343 xs6989586621680058796 x6989586621680058795 n6989586621680058797
type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym2 x6989586621680058963 n6989586621680058962 :: TyFun k3 Bool -> Type) (xs6989586621680058964 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym2 x6989586621680058963 n6989586621680058962 :: TyFun k3 Bool -> Type) (xs6989586621680058964 :: k3) = Let6989586621680058965Scrutinee_6989586621680055327 x6989586621680058963 n6989586621680058962 xs6989586621680058964
type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym2 x6989586621680058977 n6989586621680058976 :: TyFun k3 Bool -> Type) (xs6989586621680058978 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym2 x6989586621680058977 n6989586621680058976 :: TyFun k3 Bool -> Type) (xs6989586621680058978 :: k3) = Let6989586621680058979Scrutinee_6989586621680055325 x6989586621680058977 n6989586621680058976 xs6989586621680058978
type Apply (Lambda_6989586621680418386Sym2 t6989586621680418393 a_69895866216804183816989586621680418385 :: TyFun k3 Bool -> Type) (t6989586621680418394 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680418386Sym2 t6989586621680418393 a_69895866216804183816989586621680418385 :: TyFun k3 Bool -> Type) (t6989586621680418394 :: k3) = Lambda_6989586621680418386 t6989586621680418393 a_69895866216804183816989586621680418385 t6989586621680418394
type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym3 y6989586621680058883 x6989586621680058882 key6989586621680058881 :: TyFun k3 Bool -> Type) (xys6989586621680058884 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym3 y6989586621680058883 x6989586621680058882 key6989586621680058881 :: TyFun k3 Bool -> Type) (xys6989586621680058884 :: k3) = Let6989586621680058885Scrutinee_6989586621680055337 y6989586621680058883 x6989586621680058882 key6989586621680058881 xys6989586621680058884
type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym3 ls6989586621680058782 xs6989586621680058781 x6989586621680058780 :: TyFun k3 Bool -> Type) (l6989586621680058773 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym3 ls6989586621680058782 xs6989586621680058781 x6989586621680058780 :: TyFun k3 Bool -> Type) (l6989586621680058773 :: k3) = Let6989586621680058783Scrutinee_6989586621680055345 ls6989586621680058782 xs6989586621680058781 x6989586621680058780 l6989586621680058773
type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym3 p6989586621680059078 xs6989586621680059083 x6989586621680059082 :: TyFun k Bool -> Type) (a_69895866216800590766989586621680059079 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym3 p6989586621680059078 xs6989586621680059083 x6989586621680059082 :: TyFun k Bool -> Type) (a_69895866216800590766989586621680059079 :: k) = Let6989586621680059084Scrutinee_6989586621680055319 p6989586621680059078 xs6989586621680059083 x6989586621680059082 a_69895866216800590766989586621680059079
type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym4 eq6989586621680058750 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun k3 Bool -> Type) (l6989586621680058751 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym4 eq6989586621680058750 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun k3 Bool -> Type) (l6989586621680058751 :: k3) = Let6989586621680058762Scrutinee_6989586621680055347 eq6989586621680058750 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 l6989586621680058751
type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym4 arg_69895866216798992686989586621679899492 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k4 Bool -> Type) (arg_69895866216798992706989586621679899493 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym4 arg_69895866216798992686989586621679899492 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k4 Bool -> Type) (arg_69895866216798992706989586621679899493 :: k4) = Let6989586621679899506Scrutinee_6989586621679899272 arg_69895866216798992686989586621679899492 y6989586621679899497 x06989586621679899496 x6989586621679899505 arg_69895866216798992706989586621679899493
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym5 arg_69895866216798992926989586621679899363 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k5 Bool -> Type) (arg_69895866216798992946989586621679899364 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym5 arg_69895866216798992926989586621679899363 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k5 Bool -> Type) (arg_69895866216798992946989586621679899364 :: k5) = Let6989586621679899372Scrutinee_6989586621679899296 arg_69895866216798992926989586621679899363 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 arg_69895866216798992946989586621679899364
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym5 arg_69895866216798992826989586621679899420 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k5 Bool -> Type) (arg_69895866216798992846989586621679899421 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym5 arg_69895866216798992826989586621679899420 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k5 Bool -> Type) (arg_69895866216798992846989586621679899421 :: k5) = Let6989586621679899429Scrutinee_6989586621679899286 arg_69895866216798992826989586621679899420 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 arg_69895866216798992846989586621679899421
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 (f6989586621679754468 ()) -> Type) (a6989586621679754634 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (GuardSym0 :: TyFun Bool (f6989586621679754468 ()) -> Type) (a6989586621679754634 :: Bool) = Guard a6989586621679754634 :: f6989586621679754468 ()
type Eval (Null (a2 ': as) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null (a2 ': as) :: Bool -> Type) = 'False
type Eval (Null ('[] :: [a]) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null ('[] :: [a]) :: Bool -> Type) = 'True
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 (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) = b <=? a
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) = Eval (Not =<< (a <= b))
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 (IsNothing ('Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsNothing ('Just _a) :: Bool -> Type) = 'False
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 (IsJust ('Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsJust ('Just _a) :: Bool -> Type) = 'True
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 ('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 && 'True :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && 'True :: Bool -> Type) = a
type Eval (a && 'False :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && 'False :: Bool -> Type) = 'False
type Apply (\|\|@#@$) (a6989586621679601577 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (\|\|@#@$) (a6989586621679601577 :: Bool) = (\|\|@#@$$) a6989586621679601577
type Apply (&&@#@$) (a6989586621679601332 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (&&@#@$) (a6989586621679601332 :: Bool) = (&&@#@$$) a6989586621679601332
type Apply Compare_6989586621679628770Sym0 (a6989586621679628768 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679628770Sym0 (a6989586621679628768 :: Bool) = Compare_6989586621679628770Sym1 a6989586621679628768
type Apply ShowParenSym0 (a6989586621680279125 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowParenSym0 (a6989586621680279125 :: Bool) = ShowParenSym1 a6989586621680279125
type Apply ShowsPrec_6989586621680297229Sym0 (a6989586621680297226 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowsPrec_6989586621680297229Sym0 (a6989586621680297226 :: Nat) = ShowsPrec_6989586621680297229Sym1 a6989586621680297226
type Apply (<=?@#@$) (a3530822107858468865 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply (<=?@#@$) (a3530822107858468865 :: Nat) = (<=?@#@$$) a3530822107858468865
type Apply (ShowsPrec_6989586621680297229Sym1 a6989586621680297226 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680297227 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680297229Sym1 a6989586621680297226 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680297227 :: Bool) = ShowsPrec_6989586621680297229Sym2 a6989586621680297226 a6989586621680297227
type Apply (WhenSym0 :: TyFun Bool (f6989586621679754497 () ~> f6989586621679754497 ()) -> Type) (a6989586621679754882 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (WhenSym0 :: TyFun Bool (f6989586621679754497 () ~> f6989586621679754497 ()) -> Type) (a6989586621679754882 :: Bool) = WhenSym1 a6989586621679754882 f6989586621679754497 :: TyFun (f6989586621679754497 ()) (f6989586621679754497 ()) -> Type
type Apply (UnlessSym0 :: TyFun Bool (f6989586621680980258 () ~> f6989586621680980258 ()) -> Type) (a6989586621680980610 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621680980258 () ~> f6989586621680980258 ()) -> Type) (a6989586621680980610 :: Bool) = UnlessSym1 a6989586621680980610 f6989586621680980258 :: TyFun (f6989586621680980258 ()) (f6989586621680980258 ()) -> Type
type Apply (ListelemSym0 :: TyFun a6989586621680368550 ([a6989586621680368550] ~> Bool) -> Type) (a6989586621680369457 :: a6989586621680368550)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym0 :: TyFun a6989586621680368550 ([a6989586621680368550] ~> Bool) -> Type) (a6989586621680369457 :: a6989586621680368550) = ListelemSym1 a6989586621680369457
type Apply (NotElemSym0 :: TyFun a6989586621680054723 ([a6989586621680054723] ~> Bool) -> Type) (a6989586621680059593 :: a6989586621680054723)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym0 :: TyFun a6989586621680054723 ([a6989586621680054723] ~> Bool) -> Type) (a6989586621680059593 :: a6989586621680054723) = NotElemSym1 a6989586621680059593
type Apply (ElemSym0 :: TyFun a6989586621680054724 ([a6989586621680054724] ~> Bool) -> Type) (a6989586621680059600 :: a6989586621680054724)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym0 :: TyFun a6989586621680054724 ([a6989586621680054724] ~> Bool) -> Type) (a6989586621680059600 :: a6989586621680054724) = ElemSym1 a6989586621680059600
type Apply (Let6989586621680409421Scrutinee_6989586621680409384Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680409414 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409421Scrutinee_6989586621680409384Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680409414 :: k1) = Let6989586621680409421Scrutinee_6989586621680409384Sym1 x6989586621680409414
type Apply (Let6989586621680409448Scrutinee_6989586621680409386Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680409441 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409448Scrutinee_6989586621680409386Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680409441 :: k1) = Let6989586621680409448Scrutinee_6989586621680409386Sym1 x6989586621680409441
type Apply ((==@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type) (x6989586621679603705 :: a6989586621679603704)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type) (x6989586621679603705 :: a6989586621679603704) = (==@#@$$) x6989586621679603705
type Apply ((/=@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type) (x6989586621679603707 :: a6989586621679603704)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$) :: TyFun a6989586621679603704 (a6989586621679603704 ~> Bool) -> Type) (x6989586621679603707 :: a6989586621679603704) = (/=@#@$$) x6989586621679603707
type Apply (DefaultEqSym0 :: TyFun k6989586621679603698 (k6989586621679603698 ~> Bool) -> Type) (a6989586621679603699 :: k6989586621679603698)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679603698 (k6989586621679603698 ~> Bool) -> Type) (a6989586621679603699 :: k6989586621679603698) = DefaultEqSym1 a6989586621679603699
type Apply (Bool_Sym0 :: TyFun a6989586621679600564 (a6989586621679600564 ~> (Bool ~> a6989586621679600564)) -> Type) (a6989586621679600570 :: a6989586621679600564)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym0 :: TyFun a6989586621679600564 (a6989586621679600564 ~> (Bool ~> a6989586621679600564)) -> Type) (a6989586621679600570 :: a6989586621679600564) = Bool_Sym1 a6989586621679600570
type Apply (Let6989586621679617558Scrutinee_6989586621679617449Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617556 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617558Scrutinee_6989586621679617449Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617556 :: k1) = Let6989586621679617558Scrutinee_6989586621679617449Sym1 x6989586621679617556
type Apply (TFHelper_6989586621679617628Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617626 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617628Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617626 :: a6989586621679617431) = TFHelper_6989586621679617628Sym1 a6989586621679617626
type Apply (TFHelper_6989586621679617610Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617608 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617610Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617608 :: a6989586621679617431) = TFHelper_6989586621679617610Sym1 a6989586621679617608
type Apply (TFHelper_6989586621679617592Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617590 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617592Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617590 :: a6989586621679617431) = TFHelper_6989586621679617592Sym1 a6989586621679617590
type Apply (TFHelper_6989586621679617574Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617572 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679617574Sym0 :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (a6989586621679617572 :: a6989586621679617431) = TFHelper_6989586621679617574Sym1 a6989586621679617572
type Apply ((<=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617528 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617528 :: a6989586621679617431) = (<=@#@$$) arg6989586621679617528
type Apply ((>=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617536 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617536 :: a6989586621679617431) = (>=@#@$$) arg6989586621679617536
type Apply ((>@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617532 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617532 :: a6989586621679617431) = (>@#@$$) arg6989586621679617532
type Apply (Let6989586621679617672Scrutinee_6989586621679617463Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617670 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617672Scrutinee_6989586621679617463Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617670 :: k1) = Let6989586621679617672Scrutinee_6989586621679617463Sym1 x6989586621679617670
type Apply (Let6989586621679617654Scrutinee_6989586621679617461Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617652 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617654Scrutinee_6989586621679617461Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617652 :: k1) = Let6989586621679617654Scrutinee_6989586621679617461Sym1 x6989586621679617652
type Apply (Let6989586621679617563Scrutinee_6989586621679617451Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617556 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679617563Scrutinee_6989586621679617451Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679617556 :: k1) = Let6989586621679617563Scrutinee_6989586621679617451Sym1 x6989586621679617556
type Apply ((<@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617524 :: a6989586621679617431)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$) :: TyFun a6989586621679617431 (a6989586621679617431 ~> Bool) -> Type) (arg6989586621679617524 :: a6989586621679617431) = (<@#@$$) arg6989586621679617524
type Apply (Elem_6989586621680570779Sym0 :: TyFun a6989586621680417528 (Identity a6989586621680417528 ~> Bool) -> Type) (a6989586621680570777 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680570779Sym0 :: TyFun a6989586621680417528 (Identity a6989586621680417528 ~> Bool) -> Type) (a6989586621680570777 :: a6989586621680417528) = Elem_6989586621680570779Sym1 a6989586621680570777
type Apply (Let6989586621680058817Scrutinee_6989586621680055341Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680058815 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058817Scrutinee_6989586621680055341Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680058815 :: k1) = Let6989586621680058817Scrutinee_6989586621680055341Sym1 n6989586621680058815 :: TyFun k Bool -> Type
type Apply (Elem_bySym1 a6989586621680058736 :: TyFun a6989586621680054641 ([a6989586621680054641] ~> Bool) -> Type) (a6989586621680058737 :: a6989586621680054641)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym1 a6989586621680058736 :: TyFun a6989586621680054641 ([a6989586621680054641] ~> Bool) -> Type) (a6989586621680058737 :: a6989586621680054641) = Elem_bySym2 a6989586621680058736 a6989586621680058737
type Apply (Elem_6989586621680418423Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418421 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418423Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418421 :: a6989586621680417528) = Elem_6989586621680418423Sym1 a6989586621680418421 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (ElemSym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (arg6989586621680418174 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (arg6989586621680418174 :: a6989586621680417528) = ElemSym1 arg6989586621680418174 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (NotElemSym0 :: TyFun a6989586621680417422 (t6989586621680417421 a6989586621680417422 ~> Bool) -> Type) (a6989586621680417900 :: a6989586621680417422)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680417422 (t6989586621680417421 a6989586621680417422 ~> Bool) -> Type) (a6989586621680417900 :: a6989586621680417422) = NotElemSym1 a6989586621680417900 t6989586621680417421 :: TyFun (t6989586621680417421 a6989586621680417422) Bool -> Type
type Apply (Elem_6989586621680418543Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418541 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418543Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418541 :: a6989586621680417528) = Elem_6989586621680418543Sym1 a6989586621680418541 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (Elem_6989586621680418884Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418882 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418884Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680418882 :: a6989586621680417528) = Elem_6989586621680418884Sym1 a6989586621680418882 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (Elem_6989586621680419051Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680419049 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680419051Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680419049 :: a6989586621680417528) = Elem_6989586621680419051Sym1 a6989586621680419049 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (Elem_6989586621680419218Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680419216 :: a6989586621680417528)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680419218Sym0 :: TyFun a6989586621680417528 (t6989586621680417511 a6989586621680417528 ~> Bool) -> Type) (a6989586621680419216 :: a6989586621680417528) = Elem_6989586621680419218Sym1 a6989586621680419216 t6989586621680417511 :: TyFun (t6989586621680417511 a6989586621680417528) Bool -> Type
type Apply (Bool_Sym1 a6989586621679600570 :: TyFun a6989586621679600564 (Bool ~> a6989586621679600564) -> Type) (a6989586621679600571 :: a6989586621679600564)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym1 a6989586621679600570 :: TyFun a6989586621679600564 (Bool ~> a6989586621679600564) -> Type) (a6989586621679600571 :: a6989586621679600564) = Bool_Sym2 a6989586621679600570 a6989586621679600571
type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680058795 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680058795 :: k1) = Let6989586621680058798Scrutinee_6989586621680055343Sym1 x6989586621680058795 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680058881 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680058881 :: k1) = Let6989586621680058885Scrutinee_6989586621680055337Sym1 key6989586621680058881 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680058962 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680058962 :: k1) = Let6989586621680058965Scrutinee_6989586621680055327Sym1 n6989586621680058962 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680058976 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680058976 :: k1) = Let6989586621680058979Scrutinee_6989586621680055325Sym1 n6989586621680058976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680058759 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680058759 :: k1) = Let6989586621680058762Scrutinee_6989586621680055347Sym1 y6989586621680058759 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680058780 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680058780 :: k1) = Let6989586621680058783Scrutinee_6989586621680055345Sym1 x6989586621680058780 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym0 :: TyFun k1 (TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680059082 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym0 :: TyFun k1 (TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680059082 :: k1) = Let6989586621680059084Scrutinee_6989586621680055319Sym1 x6989586621680059082 :: TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680418386Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216804183816989586621680418385 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680418386Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216804183816989586621680418385 :: k1) = Lambda_6989586621680418386Sym1 a_69895866216804183816989586621680418385 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Lambda_6989586621680980750Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680980749 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980750Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680980749 :: k1) = Lambda_6989586621680980750Sym1 x6989586621680980749 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym1 x6989586621680058795 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680058796 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058798Scrutinee_6989586621680055343Sym1 x6989586621680058795 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680058796 :: k2) = Let6989586621680058798Scrutinee_6989586621680055343Sym2 x6989586621680058795 xs6989586621680058796 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym1 key6989586621680058881 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680058882 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym1 key6989586621680058881 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680058882 :: k1) = Let6989586621680058885Scrutinee_6989586621680055337Sym2 key6989586621680058881 x6989586621680058882 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym1 n6989586621680058962 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680058963 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058965Scrutinee_6989586621680055327Sym1 n6989586621680058962 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680058963 :: k2) = Let6989586621680058965Scrutinee_6989586621680055327Sym2 n6989586621680058962 x6989586621680058963 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym1 n6989586621680058976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680058977 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058979Scrutinee_6989586621680055325Sym1 n6989586621680058976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680058977 :: k2) = Let6989586621680058979Scrutinee_6989586621680055325Sym2 n6989586621680058976 x6989586621680058977 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym1 y6989586621680058759 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680058760 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym1 y6989586621680058759 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680058760 :: k2) = Let6989586621680058762Scrutinee_6989586621680055347Sym2 y6989586621680058759 ys6989586621680058760 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym1 x6989586621680058780 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680058781 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym1 x6989586621680058780 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680058781 :: k2) = Let6989586621680058783Scrutinee_6989586621680055345Sym2 x6989586621680058780 xs6989586621680058781 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type
type Apply (Lambda_6989586621680418386Sym1 a_69895866216804183816989586621680418385 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (t6989586621680418393 :: k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680418386Sym1 a_69895866216804183816989586621680418385 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (t6989586621680418393 :: k2) = Lambda_6989586621680418386Sym2 a_69895866216804183816989586621680418385 t6989586621680418393 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679899505 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679899505 :: k1) = Let6989586621679899506Scrutinee_6989586621679899272Sym1 x6989586621679899505 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680980750Sym1 x6989586621680980749 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (p6989586621680980745 :: k2)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980750Sym1 x6989586621680980749 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (p6989586621680980745 :: k2) = Lambda_6989586621680980750Sym2 x6989586621680980749 p6989586621680980745 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type
type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym2 x6989586621680058882 key6989586621680058881 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680058883 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058885Scrutinee_6989586621680055337Sym2 x6989586621680058882 key6989586621680058881 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680058883 :: k2) = Let6989586621680058885Scrutinee_6989586621680055337Sym3 x6989586621680058882 key6989586621680058881 y6989586621680058883 :: TyFun k3 Bool -> Type
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679899367 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679899367 :: k1) = Let6989586621679899372Scrutinee_6989586621679899296Sym1 x16989586621679899367 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679899424 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679899424 :: k1) = Let6989586621679899429Scrutinee_6989586621679899286Sym1 x16989586621679899424 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym1 x6989586621679899505 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679899496 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym1 x6989586621679899505 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679899496 :: k2) = Let6989586621679899506Scrutinee_6989586621679899272Sym2 x6989586621679899505 x06989586621679899496 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680980750Sym2 p6989586621680980745 x6989586621680980749 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216809807436989586621680980746 :: k3)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980750Sym2 p6989586621680980745 x6989586621680980749 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216809807436989586621680980746 :: k3) = Lambda_6989586621680980750Sym3 p6989586621680980745 x6989586621680980749 a_69895866216809807436989586621680980746
type Apply (Lambda_6989586621680980750Sym3 a_69895866216809807436989586621680980746 p6989586621680980745 x6989586621680980749 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621680980756 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980750Sym3 a_69895866216809807436989586621680980746 p6989586621680980745 x6989586621680980749 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621680980756 :: Bool) = Lambda_6989586621680980750 a_69895866216809807436989586621680980746 p6989586621680980745 x6989586621680980749 t6989586621680980756
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym1 x16989586621679899367 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679899368 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym1 x16989586621679899367 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679899368 :: k2) = Let6989586621679899372Scrutinee_6989586621679899296Sym2 x16989586621679899367 x26989586621679899368 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym1 x16989586621679899424 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679899425 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym1 x16989586621679899424 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679899425 :: k2) = Let6989586621679899429Scrutinee_6989586621679899286Sym2 x16989586621679899424 x26989586621679899425 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym2 x06989586621679899496 x6989586621679899505 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679899497 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym2 x06989586621679899496 x6989586621679899505 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679899497 :: k1) = Let6989586621679899506Scrutinee_6989586621679899272Sym3 x06989586621679899496 x6989586621679899505 y6989586621679899497 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym2 x26989586621679899368 x16989586621679899367 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679899369 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym2 x26989586621679899368 x16989586621679899367 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679899369 :: k1) = Let6989586621679899372Scrutinee_6989586621679899296Sym3 x26989586621679899368 x16989586621679899367 y6989586621679899369 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym2 x26989586621679899425 x16989586621679899424 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679899426 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym2 x26989586621679899425 x16989586621679899424 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679899426 :: k1) = Let6989586621679899429Scrutinee_6989586621679899286Sym3 x26989586621679899425 x16989586621679899424 y6989586621679899426 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym3 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216798992686989586621679899492 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899506Scrutinee_6989586621679899272Sym3 y6989586621679899497 x06989586621679899496 x6989586621679899505 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216798992686989586621679899492 :: k3) = Let6989586621679899506Scrutinee_6989586621679899272Sym4 y6989586621679899497 x06989586621679899496 x6989586621679899505 arg_69895866216798992686989586621679899492 :: TyFun k4 Bool -> Type
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym3 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216798992906989586621679899362 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym3 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216798992906989586621679899362 :: k3) = Let6989586621679899372Scrutinee_6989586621679899296Sym4 y6989586621679899369 x26989586621679899368 x16989586621679899367 arg_69895866216798992906989586621679899362 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym3 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216798992806989586621679899419 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym3 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216798992806989586621679899419 :: k3) = Let6989586621679899429Scrutinee_6989586621679899286Sym4 y6989586621679899426 x26989586621679899425 x16989586621679899424 arg_69895866216798992806989586621679899419 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym4 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216798992926989586621679899363 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899372Scrutinee_6989586621679899296Sym4 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216798992926989586621679899363 :: k4) = Let6989586621679899372Scrutinee_6989586621679899296Sym5 arg_69895866216798992906989586621679899362 y6989586621679899369 x26989586621679899368 x16989586621679899367 arg_69895866216798992926989586621679899363 :: TyFun k5 Bool -> Type
type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym4 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216798992826989586621679899420 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679899429Scrutinee_6989586621679899286Sym4 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216798992826989586621679899420 :: k4) = Let6989586621679899429Scrutinee_6989586621679899286Sym5 arg_69895866216798992806989586621679899419 y6989586621679899426 x26989586621679899425 x16989586621679899424 arg_69895866216798992826989586621679899420 :: TyFun k5 Bool -> Type
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 (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 (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 (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 (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 (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 (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 (TyEq a b :: Bool -> Type)
Instance details Defined in Fcf.Utils type Eval (TyEq a b :: Bool -> Type) = TyEqImpl a b
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 (TyEqSing a b :: Bool -> Type)
Instance details Defined in Util.Fcf type Eval (TyEqSing a b :: Bool -> Type) = DefaultEq a b
type Apply OrSym0 (a6989586621680059864 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply OrSym0 (a6989586621680059864 :: [Bool]) = Or a6989586621680059864
type Apply AndSym0 (a6989586621680059868 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply AndSym0 (a6989586621680059868 :: [Bool]) = And a6989586621680059868
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680369375 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680369375 :: [a]) = Listnull a6989586621680369375
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680060088 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680060088 :: [a]) = Null a6989586621680060088
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713002 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713002 :: Maybe a) = IsNothing a6989586621679713002
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713004 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713004 :: Maybe a) = IsJust a6989586621679713004
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680417993 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680417993 :: t Bool) = And a6989586621680417993
type Apply (Let6989586621680417996Scrutinee_6989586621680417758Sym0 :: TyFun (t6989586621680417511 Bool) All -> Type) (x6989586621680417995 :: t6989586621680417511 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680417996Scrutinee_6989586621680417758Sym0 :: TyFun (t6989586621680417511 Bool) All -> Type) (x6989586621680417995 :: t6989586621680417511 Bool) = Let6989586621680417996Scrutinee_6989586621680417758 x6989586621680417995
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680417984 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680417984 :: t Bool) = Or a6989586621680417984
type Apply (Let6989586621680417987Scrutinee_6989586621680417760Sym0 :: TyFun (t6989586621680417511 Bool) Any -> Type) (x6989586621680417986 :: t6989586621680417511 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680417987Scrutinee_6989586621680417760Sym0 :: TyFun (t6989586621680417511 Bool) Any -> Type) (x6989586621680417986 :: t6989586621680417511 Bool) = Let6989586621680417987Scrutinee_6989586621680417760 x6989586621680417986
type Apply (Null_6989586621680570906Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680570905 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Null_6989586621680570906Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680570905 :: Identity a) = Null_6989586621680570906 a6989586621680570905
type Apply (ListelemSym1 a6989586621680369457 :: TyFun [a] Bool -> Type) (a6989586621680369458 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym1 a6989586621680369457 :: TyFun [a] Bool -> Type) (a6989586621680369458 :: [a]) = Listelem a6989586621680369457 a6989586621680369458
type Apply (ListisPrefixOfSym1 a6989586621680369522 :: TyFun [a] Bool -> Type) (a6989586621680369523 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym1 a6989586621680369522 :: TyFun [a] Bool -> Type) (a6989586621680369523 :: [a]) = ListisPrefixOf a6989586621680369522 a6989586621680369523
type Apply (NotElemSym1 a6989586621680059593 :: TyFun [a] Bool -> Type) (a6989586621680059594 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym1 a6989586621680059593 :: TyFun [a] Bool -> Type) (a6989586621680059594 :: [a]) = NotElem a6989586621680059593 a6989586621680059594
type Apply (ElemSym1 a6989586621680059600 :: TyFun [a] Bool -> Type) (a6989586621680059601 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym1 a6989586621680059600 :: TyFun [a] Bool -> Type) (a6989586621680059601 :: [a]) = Elem a6989586621680059600 a6989586621680059601
type Apply (IsPrefixOfSym1 a6989586621680059619 :: TyFun [a] Bool -> Type) (a6989586621680059620 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680059619 :: TyFun [a] Bool -> Type) (a6989586621680059620 :: [a]) = IsPrefixOf a6989586621680059619 a6989586621680059620
type Apply (AnySym1 a6989586621680059850 :: TyFun [a] Bool -> Type) (a6989586621680059851 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym1 a6989586621680059850 :: TyFun [a] Bool -> Type) (a6989586621680059851 :: [a]) = Any a6989586621680059850 a6989586621680059851
type Apply (IsInfixOfSym1 a6989586621680059607 :: TyFun [a] Bool -> Type) (a6989586621680059608 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621680059607 :: TyFun [a] Bool -> Type) (a6989586621680059608 :: [a]) = IsInfixOf a6989586621680059607 a6989586621680059608
type Apply (AllSym1 a6989586621680059857 :: TyFun [a] Bool -> Type) (a6989586621680059858 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym1 a6989586621680059857 :: TyFun [a] Bool -> Type) (a6989586621680059858 :: [a]) = All a6989586621680059857 a6989586621680059858
type Apply (IsSuffixOfSym1 a6989586621680059613 :: TyFun [a] Bool -> Type) (a6989586621680059614 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680059613 :: TyFun [a] Bool -> Type) (a6989586621680059614 :: [a]) = IsSuffixOf a6989586621680059613 a6989586621680059614
type Apply (Elem_6989586621680570779Sym1 a6989586621680570777 :: TyFun (Identity a) Bool -> Type) (a6989586621680570778 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680570779Sym1 a6989586621680570777 :: TyFun (Identity a) Bool -> Type) (a6989586621680570778 :: Identity a) = Elem_6989586621680570779 a6989586621680570777 a6989586621680570778
type Apply (Elem_bySym2 a6989586621680058737 a6989586621680058736 :: TyFun [a] Bool -> Type) (a6989586621680058738 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym2 a6989586621680058737 a6989586621680058736 :: TyFun [a] Bool -> Type) (a6989586621680058738 :: [a]) = Elem_by a6989586621680058737 a6989586621680058736 a6989586621680058738
type Apply (Elem_6989586621680418423Sym1 a6989586621680418421 t :: TyFun (t a) Bool -> Type) (a6989586621680418422 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418423Sym1 a6989586621680418421 t :: TyFun (t a) Bool -> Type) (a6989586621680418422 :: t a) = Elem_6989586621680418423 a6989586621680418421 a6989586621680418422
type Apply (Null_6989586621680418379Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418378 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680418379Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418378 :: t a) = Null_6989586621680418379 a6989586621680418378
type Apply (AnySym1 a6989586621680417971 t :: TyFun (t a) Bool -> Type) (a6989586621680417972 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym1 a6989586621680417971 t :: TyFun (t a) Bool -> Type) (a6989586621680417972 :: t a) = Any a6989586621680417971 a6989586621680417972
type Apply (ElemSym1 arg6989586621680418174 t :: TyFun (t a) Bool -> Type) (arg6989586621680418175 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym1 arg6989586621680418174 t :: TyFun (t a) Bool -> Type) (arg6989586621680418175 :: t a) = Elem arg6989586621680418174 arg6989586621680418175
type Apply (NotElemSym1 a6989586621680417900 t :: TyFun (t a) Bool -> Type) (a6989586621680417901 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680417900 t :: TyFun (t a) Bool -> Type) (a6989586621680417901 :: t a) = NotElem a6989586621680417900 a6989586621680417901
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680418170 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680418170 :: t a) = Null arg6989586621680418170
type Apply (AllSym1 a6989586621680417958 t :: TyFun (t a) Bool -> Type) (a6989586621680417959 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym1 a6989586621680417958 t :: TyFun (t a) Bool -> Type) (a6989586621680417959 :: t a) = All a6989586621680417958 a6989586621680417959
type Apply (Elem_6989586621680418543Sym1 a6989586621680418541 t :: TyFun (t a) Bool -> Type) (a6989586621680418542 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418543Sym1 a6989586621680418541 t :: TyFun (t a) Bool -> Type) (a6989586621680418542 :: t a) = Elem_6989586621680418543 a6989586621680418541 a6989586621680418542
type Apply (Null_6989586621680418686Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418685 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680418686Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418685 :: t a) = Null_6989586621680418686 a6989586621680418685
type Apply (Null_6989586621680418862Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418861 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680418862Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680418861 :: t a) = Null_6989586621680418862 a6989586621680418861
type Apply (Elem_6989586621680418884Sym1 a6989586621680418882 t :: TyFun (t a) Bool -> Type) (a6989586621680418883 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680418884Sym1 a6989586621680418882 t :: TyFun (t a) Bool -> Type) (a6989586621680418883 :: t a) = Elem_6989586621680418884 a6989586621680418882 a6989586621680418883
type Apply (Null_6989586621680419011Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419010 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680419011Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419010 :: t a) = Null_6989586621680419011 a6989586621680419010
type Apply (Elem_6989586621680419051Sym1 a6989586621680419049 t :: TyFun (t a) Bool -> Type) (a6989586621680419050 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680419051Sym1 a6989586621680419049 t :: TyFun (t a) Bool -> Type) (a6989586621680419050 :: t a) = Elem_6989586621680419051 a6989586621680419049 a6989586621680419050
type Apply (Null_6989586621680419178Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419177 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680419178Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419177 :: t a) = Null_6989586621680419178 a6989586621680419177
type Apply (Elem_6989586621680419218Sym1 a6989586621680419216 t :: TyFun (t a) Bool -> Type) (a6989586621680419217 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680419218Sym1 a6989586621680419216 t :: TyFun (t a) Bool -> Type) (a6989586621680419217 :: t a) = Elem_6989586621680419218 a6989586621680419216 a6989586621680419217
type Apply (Null_6989586621680419345Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419344 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680419345Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680419344 :: t a) = Null_6989586621680419345 a6989586621680419344
type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680368562] ([a6989586621680368562] ~> Bool) -> Type) (a6989586621680369522 :: [a6989586621680368562])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680368562] ([a6989586621680368562] ~> Bool) -> Type) (a6989586621680369522 :: [a6989586621680368562]) = ListisPrefixOfSym1 a6989586621680369522
type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680054727] ([a6989586621680054727] ~> Bool) -> Type) (a6989586621680059619 :: [a6989586621680054727])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680054727] ([a6989586621680054727] ~> Bool) -> Type) (a6989586621680059619 :: [a6989586621680054727]) = IsPrefixOfSym1 a6989586621680059619
type Apply (IsInfixOfSym0 :: TyFun [a6989586621680054725] ([a6989586621680054725] ~> Bool) -> Type) (a6989586621680059607 :: [a6989586621680054725])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621680054725] ([a6989586621680054725] ~> Bool) -> Type) (a6989586621680059607 :: [a6989586621680054725]) = IsInfixOfSym1 a6989586621680059607
type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680054726] ([a6989586621680054726] ~> Bool) -> Type) (a6989586621680059613 :: [a6989586621680054726])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680054726] ([a6989586621680054726] ~> Bool) -> Type) (a6989586621680059613 :: [a6989586621680054726]) = IsSuffixOfSym1 a6989586621680059613
type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym1 x6989586621680059082 :: TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680059083 :: [a6989586621680054761])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym1 x6989586621680059082 :: TyFun [a6989586621680054761] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680059083 :: [a6989586621680054761]) = Let6989586621680059084Scrutinee_6989586621680055319Sym2 x6989586621680059082 xs6989586621680059083 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type
type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym2 ys6989586621680058760 y6989586621680058759 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680058761 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym2 ys6989586621680058760 y6989586621680058759 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680058761 :: [k1]) = Let6989586621680058762Scrutinee_6989586621680055347Sym3 ys6989586621680058760 y6989586621680058759 xs6989586621680058761 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym2 xs6989586621680058781 x6989586621680058780 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680058782 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058783Scrutinee_6989586621680055345Sym2 xs6989586621680058781 x6989586621680058780 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680058782 :: [k1]) = Let6989586621680058783Scrutinee_6989586621680055345Sym3 xs6989586621680058781 x6989586621680058780 ls6989586621680058782 :: TyFun k3 Bool -> Type
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680401746 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680401746 :: Either a b) = IsRight a6989586621680401746
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680401748 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680401748 :: Either a b) = IsLeft a6989586621680401748
type Apply (TFHelper_6989586621680733389Sym1 a6989586621680733387 :: TyFun (Arg a b) Bool -> Type) (a6989586621680733388 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621680733389Sym1 a6989586621680733387 :: TyFun (Arg a b) Bool -> Type) (a6989586621680733388 :: Arg a b) = TFHelper_6989586621680733389 a6989586621680733387 a6989586621680733388
type Apply (ListnubBySym0 :: TyFun (a6989586621680368556 ~> (a6989586621680368556 ~> Bool)) ([a6989586621680368556] ~> [a6989586621680368556]) -> Type) (a6989586621680369487 :: a6989586621680368556 ~> (a6989586621680368556 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnubBySym0 :: TyFun (a6989586621680368556 ~> (a6989586621680368556 ~> Bool)) ([a6989586621680368556] ~> [a6989586621680368556]) -> Type) (a6989586621680369487 :: a6989586621680368556 ~> (a6989586621680368556 ~> Bool)) = ListnubBySym1 a6989586621680369487
type Apply (ListpartitionSym0 :: TyFun (a6989586621680368564 ~> Bool) ([a6989586621680368564] ~> ([a6989586621680368564], [a6989586621680368564])) -> Type) (a6989586621680369542 :: a6989586621680368564 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListpartitionSym0 :: TyFun (a6989586621680368564 ~> Bool) ([a6989586621680368564] ~> ([a6989586621680368564], [a6989586621680368564])) -> Type) (a6989586621680369542 :: a6989586621680368564 ~> Bool) = ListpartitionSym1 a6989586621680369542
type Apply (ListfilterSym0 :: TyFun (a6989586621680368565 ~> Bool) ([a6989586621680368565] ~> [a6989586621680368565]) -> Type) (a6989586621680369552 :: a6989586621680368565 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListfilterSym0 :: TyFun (a6989586621680368565 ~> Bool) ([a6989586621680368565] ~> [a6989586621680368565]) -> Type) (a6989586621680369552 :: a6989586621680368565 ~> Bool) = ListfilterSym1 a6989586621680369552
type Apply (ListspanSym0 :: TyFun (a6989586621680368566 ~> Bool) ([a6989586621680368566] ~> ([a6989586621680368566], [a6989586621680368566])) -> Type) (a6989586621680369562 :: a6989586621680368566 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListspanSym0 :: TyFun (a6989586621680368566 ~> Bool) ([a6989586621680368566] ~> ([a6989586621680368566], [a6989586621680368566])) -> Type) (a6989586621680369562 :: a6989586621680368566 ~> Bool) = ListspanSym1 a6989586621680369562
type Apply (ListdropWhileSym0 :: TyFun (a6989586621680368567 ~> Bool) ([a6989586621680368567] ~> [a6989586621680368567]) -> Type) (a6989586621680369572 :: a6989586621680368567 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListdropWhileSym0 :: TyFun (a6989586621680368567 ~> Bool) ([a6989586621680368567] ~> [a6989586621680368567]) -> Type) (a6989586621680369572 :: a6989586621680368567 ~> Bool) = ListdropWhileSym1 a6989586621680369572
type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680368568 ~> Bool) ([a6989586621680368568] ~> [a6989586621680368568]) -> Type) (a6989586621680369582 :: a6989586621680368568 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680368568 ~> Bool) ([a6989586621680368568] ~> [a6989586621680368568]) -> Type) (a6989586621680369582 :: a6989586621680368568 ~> Bool) = ListtakeWhileSym1 a6989586621680369582
type Apply (Elem_bySym0 :: TyFun (a6989586621680054641 ~> (a6989586621680054641 ~> Bool)) (a6989586621680054641 ~> ([a6989586621680054641] ~> Bool)) -> Type) (a6989586621680058736 :: a6989586621680054641 ~> (a6989586621680054641 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym0 :: TyFun (a6989586621680054641 ~> (a6989586621680054641 ~> Bool)) (a6989586621680054641 ~> ([a6989586621680054641] ~> Bool)) -> Type) (a6989586621680058736 :: a6989586621680054641 ~> (a6989586621680054641 ~> Bool)) = Elem_bySym1 a6989586621680058736
type Apply (NubBySym0 :: TyFun (a6989586621680054642 ~> (a6989586621680054642 ~> Bool)) ([a6989586621680054642] ~> [a6989586621680054642]) -> Type) (a6989586621680058746 :: a6989586621680054642 ~> (a6989586621680054642 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NubBySym0 :: TyFun (a6989586621680054642 ~> (a6989586621680054642 ~> Bool)) ([a6989586621680054642] ~> [a6989586621680054642]) -> Type) (a6989586621680058746 :: a6989586621680054642 ~> (a6989586621680054642 ~> Bool)) = NubBySym1 a6989586621680058746
type Apply (SelectSym0 :: TyFun (a6989586621680054650 ~> Bool) (a6989586621680054650 ~> (([a6989586621680054650], [a6989586621680054650]) ~> ([a6989586621680054650], [a6989586621680054650]))) -> Type) (a6989586621680058852 :: a6989586621680054650 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SelectSym0 :: TyFun (a6989586621680054650 ~> Bool) (a6989586621680054650 ~> (([a6989586621680054650], [a6989586621680054650]) ~> ([a6989586621680054650], [a6989586621680054650]))) -> Type) (a6989586621680058852 :: a6989586621680054650 ~> Bool) = SelectSym1 a6989586621680058852
type Apply (PartitionSym0 :: TyFun (a6989586621680054651 ~> Bool) ([a6989586621680054651] ~> ([a6989586621680054651], [a6989586621680054651])) -> Type) (a6989586621680058870 :: a6989586621680054651 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621680054651 ~> Bool) ([a6989586621680054651] ~> ([a6989586621680054651], [a6989586621680054651])) -> Type) (a6989586621680058870 :: a6989586621680054651 ~> Bool) = PartitionSym1 a6989586621680058870
type Apply (BreakSym0 :: TyFun (a6989586621680054663 ~> Bool) ([a6989586621680054663] ~> ([a6989586621680054663], [a6989586621680054663])) -> Type) (a6989586621680058986 :: a6989586621680054663 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (BreakSym0 :: TyFun (a6989586621680054663 ~> Bool) ([a6989586621680054663] ~> ([a6989586621680054663], [a6989586621680054663])) -> Type) (a6989586621680058986 :: a6989586621680054663 ~> Bool) = BreakSym1 a6989586621680058986
type Apply (Let6989586621680059004YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059004YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool) = Let6989586621680059004YsSym1 p6989586621680058991
type Apply (Let6989586621680059004ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059004ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool) = Let6989586621680059004ZsSym1 p6989586621680058991
type Apply (Let6989586621680059004X_6989586621680059005Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059004X_6989586621680059005Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680058991 :: k ~> Bool) = Let6989586621680059004X_6989586621680059005Sym1 p6989586621680058991
type Apply (SpanSym0 :: TyFun (a6989586621680054664 ~> Bool) ([a6989586621680054664] ~> ([a6989586621680054664], [a6989586621680054664])) -> Type) (a6989586621680059029 :: a6989586621680054664 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SpanSym0 :: TyFun (a6989586621680054664 ~> Bool) ([a6989586621680054664] ~> ([a6989586621680054664], [a6989586621680054664])) -> Type) (a6989586621680059029 :: a6989586621680054664 ~> Bool) = SpanSym1 a6989586621680059029
type Apply (Let6989586621680059047YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059047YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool) = Let6989586621680059047YsSym1 p6989586621680059034
type Apply (Let6989586621680059047ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059047ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool) = Let6989586621680059047ZsSym1 p6989586621680059034
type Apply (Let6989586621680059047X_6989586621680059048Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059047X_6989586621680059048Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680059034 :: k ~> Bool) = Let6989586621680059047X_6989586621680059048Sym1 p6989586621680059034
type Apply (GroupBySym0 :: TyFun (a6989586621680054654 ~> (a6989586621680054654 ~> Bool)) ([a6989586621680054654] ~> [[a6989586621680054654]]) -> Type) (a6989586621680058893 :: a6989586621680054654 ~> (a6989586621680054654 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (GroupBySym0 :: TyFun (a6989586621680054654 ~> (a6989586621680054654 ~> Bool)) ([a6989586621680054654] ~> [[a6989586621680054654]]) -> Type) (a6989586621680058893 :: a6989586621680054654 ~> (a6989586621680054654 ~> Bool)) = GroupBySym1 a6989586621680058893
type Apply (DropWhileSym0 :: TyFun (a6989586621680054666 ~> Bool) ([a6989586621680054666] ~> [a6989586621680054666]) -> Type) (a6989586621680059098 :: a6989586621680054666 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621680054666 ~> Bool) ([a6989586621680054666] ~> [a6989586621680054666]) -> Type) (a6989586621680059098 :: a6989586621680054666 ~> Bool) = DropWhileSym1 a6989586621680059098
type Apply (TakeWhileSym0 :: TyFun (a6989586621680054667 ~> Bool) ([a6989586621680054667] ~> [a6989586621680054667]) -> Type) (a6989586621680059116 :: a6989586621680054667 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621680054667 ~> Bool) ([a6989586621680054667] ~> [a6989586621680054667]) -> Type) (a6989586621680059116 :: a6989586621680054667 ~> Bool) = TakeWhileSym1 a6989586621680059116
type Apply (FilterSym0 :: TyFun (a6989586621680054675 ~> Bool) ([a6989586621680054675] ~> [a6989586621680054675]) -> Type) (a6989586621680059230 :: a6989586621680054675 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621680054675 ~> Bool) ([a6989586621680054675] ~> [a6989586621680054675]) -> Type) (a6989586621680059230 :: a6989586621680054675 ~> Bool) = FilterSym1 a6989586621680059230
type Apply (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type) (a6989586621680059222 :: a6989586621680054674 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type) (a6989586621680059222 :: a6989586621680054674 ~> Bool) = FindSym1 a6989586621680059222
type Apply (DeleteBySym0 :: TyFun (a6989586621680054681 ~> (a6989586621680054681 ~> Bool)) (a6989586621680054681 ~> ([a6989586621680054681] ~> [a6989586621680054681])) -> Type) (a6989586621680059350 :: a6989586621680054681 ~> (a6989586621680054681 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteBySym0 :: TyFun (a6989586621680054681 ~> (a6989586621680054681 ~> Bool)) (a6989586621680054681 ~> ([a6989586621680054681] ~> [a6989586621680054681])) -> Type) (a6989586621680059350 :: a6989586621680054681 ~> (a6989586621680054681 ~> Bool)) = DeleteBySym1 a6989586621680059350
type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680054680 ~> (a6989586621680054680 ~> Bool)) ([a6989586621680054680] ~> ([a6989586621680054680] ~> [a6989586621680054680])) -> Type) (a6989586621680059337 :: a6989586621680054680 ~> (a6989586621680054680 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680054680 ~> (a6989586621680054680 ~> Bool)) ([a6989586621680054680] ~> ([a6989586621680054680] ~> [a6989586621680054680])) -> Type) (a6989586621680059337 :: a6989586621680054680 ~> (a6989586621680054680 ~> Bool)) = DeleteFirstsBySym1 a6989586621680059337
type Apply (UnionBySym0 :: TyFun (a6989586621680054640 ~> (a6989586621680054640 ~> Bool)) ([a6989586621680054640] ~> ([a6989586621680054640] ~> [a6989586621680054640])) -> Type) (a6989586621680058727 :: a6989586621680054640 ~> (a6989586621680054640 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnionBySym0 :: TyFun (a6989586621680054640 ~> (a6989586621680054640 ~> Bool)) ([a6989586621680054640] ~> ([a6989586621680054640] ~> [a6989586621680054640])) -> Type) (a6989586621680058727 :: a6989586621680054640 ~> (a6989586621680054640 ~> Bool)) = UnionBySym1 a6989586621680058727
type Apply (FindIndicesSym0 :: TyFun (a6989586621680054670 ~> Bool) ([a6989586621680054670] ~> [Nat]) -> Type) (a6989586621680059172 :: a6989586621680054670 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndicesSym0 :: TyFun (a6989586621680054670 ~> Bool) ([a6989586621680054670] ~> [Nat]) -> Type) (a6989586621680059172 :: a6989586621680054670 ~> Bool) = FindIndicesSym1 a6989586621680059172
type Apply (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type) (a6989586621680059198 :: a6989586621680054671 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type) (a6989586621680059198 :: a6989586621680054671 ~> Bool) = FindIndexSym1 a6989586621680059198
type Apply (AnySym0 :: TyFun (a6989586621680054744 ~> Bool) ([a6989586621680054744] ~> Bool) -> Type) (a6989586621680059850 :: a6989586621680054744 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym0 :: TyFun (a6989586621680054744 ~> Bool) ([a6989586621680054744] ~> Bool) -> Type) (a6989586621680059850 :: a6989586621680054744 ~> Bool) = AnySym1 a6989586621680059850
type Apply (IntersectBySym0 :: TyFun (a6989586621680054668 ~> (a6989586621680054668 ~> Bool)) ([a6989586621680054668] ~> ([a6989586621680054668] ~> [a6989586621680054668])) -> Type) (a6989586621680059130 :: a6989586621680054668 ~> (a6989586621680054668 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621680054668 ~> (a6989586621680054668 ~> Bool)) ([a6989586621680054668] ~> ([a6989586621680054668] ~> [a6989586621680054668])) -> Type) (a6989586621680059130 :: a6989586621680054668 ~> (a6989586621680054668 ~> Bool)) = IntersectBySym1 a6989586621680059130
type Apply (AllSym0 :: TyFun (a6989586621680054745 ~> Bool) ([a6989586621680054745] ~> Bool) -> Type) (a6989586621680059857 :: a6989586621680054745 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym0 :: TyFun (a6989586621680054745 ~> Bool) ([a6989586621680054745] ~> Bool) -> Type) (a6989586621680059857 :: a6989586621680054745 ~> Bool) = AllSym1 a6989586621680059857
type Apply (DropWhileEndSym0 :: TyFun (a6989586621680054665 ~> Bool) ([a6989586621680054665] ~> [a6989586621680054665]) -> Type) (a6989586621680059072 :: a6989586621680054665 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621680054665 ~> Bool) ([a6989586621680054665] ~> [a6989586621680054665]) -> Type) (a6989586621680059072 :: a6989586621680054665 ~> Bool) = DropWhileEndSym1 a6989586621680059072
type Apply (UntilSym0 :: TyFun (a6989586621679736119 ~> Bool) ((a6989586621679736119 ~> a6989586621679736119) ~> (a6989586621679736119 ~> a6989586621679736119)) -> Type) (a6989586621679736244 :: a6989586621679736119 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (UntilSym0 :: TyFun (a6989586621679736119 ~> Bool) ((a6989586621679736119 ~> a6989586621679736119) ~> (a6989586621679736119 ~> a6989586621679736119)) -> Type) (a6989586621679736244 :: a6989586621679736119 ~> Bool) = UntilSym1 a6989586621679736244
type Apply (TFHelper_6989586621680733389Sym0 :: TyFun (Arg a6989586621680732234 b6989586621680732235) (Arg a6989586621680732234 b6989586621680732235 ~> Bool) -> Type) (a6989586621680733387 :: Arg a6989586621680732234 b6989586621680732235)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621680733389Sym0 :: TyFun (Arg a6989586621680732234 b6989586621680732235) (Arg a6989586621680732234 b6989586621680732235 ~> Bool) -> Type) (a6989586621680733387 :: Arg a6989586621680732234 b6989586621680732235) = TFHelper_6989586621680733389Sym1 a6989586621680733387
type Apply (Let6989586621680058752NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680058750 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058752NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680058750 :: k1 ~> (k1 ~> Bool)) = Let6989586621680058752NubBy'Sym1 eq6989586621680058750 :: TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type
type Apply (Let6989586621680058900YsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058900YsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool)) = Let6989586621680058900YsSym1 eq6989586621680058897
type Apply (Let6989586621680058900ZsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058900ZsSym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] [a6989586621680054664] -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool)) = Let6989586621680058900ZsSym1 eq6989586621680058897
type Apply (Let6989586621680058900X_6989586621680058901Sym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] ([a6989586621680054664], [a6989586621680054664]) -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058900X_6989586621680058901Sym0 :: TyFun (k1 ~> (a6989586621680054664 ~> Bool)) (TyFun k1 (TyFun [a6989586621680054664] ([a6989586621680054664], [a6989586621680054664]) -> Type) -> Type) -> Type) (eq6989586621680058897 :: k1 ~> (a6989586621680054664 ~> Bool)) = Let6989586621680058900X_6989586621680058901Sym1 eq6989586621680058897
type Apply (Lambda_6989586621680059080Sym0 :: TyFun (a6989586621680054761 ~> Bool) (TyFun k (TyFun a6989586621680054761 (TyFun [a6989586621680054761] [a6989586621680054761] -> Type) -> Type) -> Type) -> Type) (p6989586621680059078 :: a6989586621680054761 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680059080Sym0 :: TyFun (a6989586621680054761 ~> Bool) (TyFun k (TyFun a6989586621680054761 (TyFun [a6989586621680054761] [a6989586621680054761] -> Type) -> Type) -> Type) -> Type) (p6989586621680059078 :: a6989586621680054761 ~> Bool) = Lambda_6989586621680059080Sym1 p6989586621680059078 :: TyFun k (TyFun a6989586621680054761 (TyFun [a6989586621680054761] [a6989586621680054761] -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680417880Sym0 :: TyFun (a6989586621679083079 ~> Bool) (TyFun k (TyFun a6989586621679083079 (First a6989586621679083079) -> Type) -> Type) -> Type) (p6989586621680417877 :: a6989586621679083079 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680417880Sym0 :: TyFun (a6989586621679083079 ~> Bool) (TyFun k (TyFun a6989586621679083079 (First a6989586621679083079) -> Type) -> Type) -> Type) (p6989586621680417877 :: a6989586621679083079 ~> Bool) = Lambda_6989586621680417880Sym1 p6989586621680417877 :: TyFun k (TyFun a6989586621679083079 (First a6989586621679083079) -> Type) -> Type
type Apply (AnySym0 :: TyFun (a6989586621680417430 ~> Bool) (t6989586621680417429 a6989586621680417430 ~> Bool) -> Type) (a6989586621680417971 :: a6989586621680417430 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym0 :: TyFun (a6989586621680417430 ~> Bool) (t6989586621680417429 a6989586621680417430 ~> Bool) -> Type) (a6989586621680417971 :: a6989586621680417430 ~> Bool) = AnySym1 a6989586621680417971 t6989586621680417429 :: TyFun (t6989586621680417429 a6989586621680417430) Bool -> Type
type Apply (Let6989586621680417977Scrutinee_6989586621680417762Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) Any -> Type) -> Type) (p6989586621680417975 :: a6989586621680417514 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680417977Scrutinee_6989586621680417762Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) Any -> Type) -> Type) (p6989586621680417975 :: a6989586621680417514 ~> Bool) = Let6989586621680417977Scrutinee_6989586621680417762Sym1 p6989586621680417975 :: TyFun (t6989586621680417511 a6989586621680417514) Any -> Type
type Apply (AllSym0 :: TyFun (a6989586621680417428 ~> Bool) (t6989586621680417427 a6989586621680417428 ~> Bool) -> Type) (a6989586621680417958 :: a6989586621680417428 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym0 :: TyFun (a6989586621680417428 ~> Bool) (t6989586621680417427 a6989586621680417428 ~> Bool) -> Type) (a6989586621680417958 :: a6989586621680417428 ~> Bool) = AllSym1 a6989586621680417958 t6989586621680417427 :: TyFun (t6989586621680417427 a6989586621680417428) Bool -> Type
type Apply (Let6989586621680417964Scrutinee_6989586621680417764Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) All -> Type) -> Type) (p6989586621680417962 :: a6989586621680417514 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680417964Scrutinee_6989586621680417764Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) All -> Type) -> Type) (p6989586621680417962 :: a6989586621680417514 ~> Bool) = Let6989586621680417964Scrutinee_6989586621680417764Sym1 p6989586621680417962 :: TyFun (t6989586621680417511 a6989586621680417514) All -> Type
type Apply (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type) (a6989586621680417873 :: a6989586621680417420 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type) (a6989586621680417873 :: a6989586621680417420 ~> Bool) = FindSym1 a6989586621680417873 t6989586621680417419 :: TyFun (t6989586621680417419 a6989586621680417420) (Maybe a6989586621680417420) -> Type
type Apply (Let6989586621680417879Scrutinee_6989586621680417770Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) (First a6989586621680417514) -> Type) -> Type) (p6989586621680417877 :: a6989586621680417514 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680417879Scrutinee_6989586621680417770Sym0 :: TyFun (a6989586621680417514 ~> Bool) (TyFun (t6989586621680417511 a6989586621680417514) (First a6989586621680417514) -> Type) -> Type) (p6989586621680417877 :: a6989586621680417514 ~> Bool) = Let6989586621680417879Scrutinee_6989586621680417770Sym1 p6989586621680417877 :: TyFun (t6989586621680417511 a6989586621680417514) (First a6989586621680417514) -> Type
type Apply (Let6989586621679736255GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679736252 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (Let6989586621679736255GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679736252 :: k1 ~> Bool) = Let6989586621679736255GoSym1 p6989586621679736252 :: TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type
type Apply (MfilterSym0 :: TyFun (a6989586621680980254 ~> Bool) (m6989586621680980253 a6989586621680980254 ~> m6989586621680980253 a6989586621680980254) -> Type) (a6989586621680980573 :: a6989586621680980254 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621680980254 ~> Bool) (m6989586621680980253 a6989586621680980254 ~> m6989586621680980253 a6989586621680980254) -> Type) (a6989586621680980573 :: a6989586621680980254 ~> Bool) = MfilterSym1 a6989586621680980573 m6989586621680980253 :: TyFun (m6989586621680980253 a6989586621680980254) (m6989586621680980253 a6989586621680980254) -> Type
type Apply (FilterMSym0 :: TyFun (a6989586621680980292 ~> m6989586621680980291 Bool) ([a6989586621680980292] ~> m6989586621680980291 [a6989586621680980292]) -> Type) (a6989586621680980739 :: a6989586621680980292 ~> m6989586621680980291 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621680980292 ~> m6989586621680980291 Bool) ([a6989586621680980292] ~> m6989586621680980291 [a6989586621680980292]) -> Type) (a6989586621680980739 :: a6989586621680980292 ~> m6989586621680980291 Bool) = FilterMSym1 a6989586621680980739
type Apply (Lambda_6989586621680980579Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679754575 k1) -> Type) -> Type) -> Type) (p6989586621680980577 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980579Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679754575 k1) -> Type) -> Type) -> Type) (p6989586621680980577 :: k1 ~> Bool) = Lambda_6989586621680980579Sym1 p6989586621680980577 :: TyFun k (TyFun k1 (m6989586621679754575 k1) -> Type) -> Type
type Apply (Lambda_6989586621680980747Sym0 :: TyFun (k2 ~> f6989586621679754551 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679754551 [k2]) (f6989586621679754551 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621680980745 :: k2 ~> f6989586621679754551 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621680980747Sym0 :: TyFun (k2 ~> f6989586621679754551 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679754551 [k2]) (f6989586621679754551 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621680980745 :: k2 ~> f6989586621679754551 Bool) = Lambda_6989586621680980747Sym1 p6989586621680980745 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679754551 [k2]) (f6989586621679754551 [k2]) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680059152Sym0 :: TyFun (b6989586621679754579 ~> (a6989586621680054744 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680054744 (TyFun [a6989586621680054744] (TyFun b6989586621679754579 (m6989586621679754575 b6989586621679754579) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680059136 :: b6989586621679754579 ~> (a6989586621680054744 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680059152Sym0 :: TyFun (b6989586621679754579 ~> (a6989586621680054744 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680054744 (TyFun [a6989586621680054744] (TyFun b6989586621679754579 (m6989586621679754575 b6989586621679754579) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680059136 :: b6989586621679754579 ~> (a6989586621680054744 ~> Bool)) = Lambda_6989586621680059152Sym1 eq6989586621680059136 :: TyFun k1 (TyFun k2 (TyFun a6989586621680054744 (TyFun [a6989586621680054744] (TyFun b6989586621679754579 (m6989586621679754575 b6989586621679754579) -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym2 xs6989586621680059083 x6989586621680059082 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680059078 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680059084Scrutinee_6989586621680055319Sym2 xs6989586621680059083 x6989586621680059082 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680059078 :: k1 ~> Bool) = Let6989586621680059084Scrutinee_6989586621680055319Sym3 xs6989586621680059083 x6989586621680059082 p6989586621680059078 :: TyFun k Bool -> Type
type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym3 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680058750 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680058762Scrutinee_6989586621680055347Sym3 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680058750 :: k1 ~> (k1 ~> Bool)) = Let6989586621680058762Scrutinee_6989586621680055347Sym4 xs6989586621680058761 ys6989586621680058760 y6989586621680058759 eq6989586621680058750 :: TyFun k3 Bool -> Type

data Integer #

Invariant: Jn# and Jp# are used iff value doesn't fit in S#

Useful properties resulting from the invariants:

```
abs (S# _) <= abs (Jp# _)
```
```
abs (S# _) <  abs (Jn# _)
```

Instances

Instances details

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] #
Eq Integer
Instance details Defined in GHC.Integer.Type Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
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 #
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 #
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 #
Ord Integer
Instance details Defined in GHC.Integer.Type 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 #
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] #
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 #
Lift Integer
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Integer -> Q Exp #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
ToJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods toJSON :: TezosBigNum -> Value # toEncoding :: TezosBigNum -> Encoding # toJSONList :: [TezosBigNum] -> Value # toEncodingList :: [TezosBigNum] -> Encoding #
FromJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods parseJSON :: Value -> Parser TezosBigNum # parseJSONList :: Value -> Parser [TezosBigNum] #
Bits Integer	Since: base-2.1
Instance details Defined in Data.Bits Methods (.&.) :: Integer -> Integer -> Integer # (.\|.) :: Integer -> Integer -> Integer # xor :: Integer -> Integer -> Integer # complement :: Integer -> Integer # shift :: Integer -> Int -> Integer # rotate :: Integer -> Int -> Integer # zeroBits :: Integer # bit :: Int -> Integer # setBit :: Integer -> Int -> Integer # clearBit :: Integer -> Int -> Integer # complementBit :: Integer -> Int -> Integer # testBit :: Integer -> Int -> Bool # bitSizeMaybe :: Integer -> Maybe Int # bitSize :: Integer -> Int # isSigned :: Integer -> Bool # shiftL :: Integer -> Int -> Integer # unsafeShiftL :: Integer -> Int -> Integer # shiftR :: Integer -> Int -> Integer # unsafeShiftR :: Integer -> Int -> Integer # rotateL :: Integer -> Int -> Integer # rotateR :: Integer -> Int -> Integer # popCount :: Integer -> Int #
Subtractive Integer
Instance details Defined in Basement.Numerical.Subtractive Associated Types type Difference Integer # Methods (-) :: Integer -> Integer -> Difference Integer #
NFData Integer
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
HasAnnotation Integer
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer)
TypeHasDoc Integer
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
NonZero Integer
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s)
UnaryArithOpHs Abs Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer #
UnaryArithOpHs Eq' Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer #
UnaryArithOpHs Ge Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer #
UnaryArithOpHs Gt Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer #
UnaryArithOpHs Le Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer #
UnaryArithOpHs Lt Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer #
UnaryArithOpHs Neg Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer #
UnaryArithOpHs Neq Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer #
UnaryArithOpHs Not Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer #
EDivOpHs Integer Integer
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Integer # type EModOpResHs Integer Integer #
EDivOpHs Integer Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural # type EModOpResHs Integer Natural #
EDivOpHs Natural Integer
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer # type EModOpResHs Natural Integer #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
ArithOpHs Add Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Integer #
ArithOpHs Add Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural #
ArithOpHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp #
ArithOpHs Add Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer #
ArithOpHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer #
ArithOpHs And Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural #
ArithOpHs Mul Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Integer #
ArithOpHs Mul Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural #
ArithOpHs Mul Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer #
ArithOpHs Sub Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Integer #
ArithOpHs Sub Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural #
ArithOpHs Sub Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer #
ArithOpHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer #
() :=> (Enum Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Integer #
() :=> (Eq Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Integer #
() :=> (Integral Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Integer #
() :=> (Num Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Integer #
() :=> (Ord Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Integer #
() :=> (Real Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Real Integer #
() :=> (Bits Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Integer #
type Difference Integer
Instance details Defined in Basement.Numerical.Subtractive type Difference Integer = Integer
type ToT Integer
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type TypeDocFieldDescriptions Integer
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type UnaryArithResHs Abs Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Eq' Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Ge Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type UnaryArithResHs Gt Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Lt Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Neg Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Neq Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Not Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer
type EDivOpResHs Integer Integer
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Integer = Integer
type EDivOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EModOpResHs Integer Integer
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Integer = Natural
type EModOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type ArithResHs Add Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Integer = Integer
type ArithResHs Add Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs And Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Natural
type ArithResHs Mul Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Integer = Integer
type ArithResHs Mul Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs Sub Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Integer = Integer
type ArithResHs Sub Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp

data Natural #

Type representing arbitrary-precision non-negative integers.

>>> 2^100 :: Natural
1267650600228229401496703205376

Operations whose result would be negative throw (Underflow :: ArithException),

>>> -1 :: Natural
*** Exception: arithmetic underflow

Since: base-4.8.0.0

Instances

Instances details

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] #
Eq Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
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 #
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 #
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 #
Ord Natural	Since: base-4.8.0.0
Instance details Defined in GHC.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 #
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] #
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 #
Lift Natural
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Natural -> Q Exp #
Hashable Natural
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Natural -> Int # hash :: Natural -> Int #
Bits Natural	Since: base-4.8.0
Instance details Defined in Data.Bits Methods (.&.) :: Natural -> Natural -> Natural # (.\|.) :: Natural -> Natural -> Natural # xor :: Natural -> Natural -> Natural # complement :: Natural -> Natural # shift :: Natural -> Int -> Natural # rotate :: Natural -> Int -> Natural # zeroBits :: Natural # bit :: Int -> Natural # setBit :: Natural -> Int -> Natural # clearBit :: Natural -> Int -> Natural # complementBit :: Natural -> Int -> Natural # testBit :: Natural -> Int -> Bool # bitSizeMaybe :: Natural -> Maybe Int # bitSize :: Natural -> Int # isSigned :: Natural -> Bool # shiftL :: Natural -> Int -> Natural # unsafeShiftL :: Natural -> Int -> Natural # shiftR :: Natural -> Int -> Natural # unsafeShiftR :: Natural -> Int -> Natural # rotateL :: Natural -> Int -> Natural # rotateR :: Natural -> Int -> Natural # popCount :: Natural -> Int #
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 -> () #
HasAnnotation Natural
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural)
TypeHasDoc Natural
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
NonZero Natural
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s)
UnaryArithOpHs Neg Natural
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural #
UnaryArithOpHs Not Natural
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural #
EDivOpHs Integer Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural # type EModOpResHs Integer Natural #
EDivOpHs Natural Integer
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer # type EModOpResHs Natural Integer #
EDivOpHs Natural Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Natural # type EModOpResHs Natural Natural #
EDivOpHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural # type EModOpResHs Mutez Natural #
ArithOpHs Add Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural #
ArithOpHs Add Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer #
ArithOpHs Add Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Natural #
ArithOpHs And Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural #
ArithOpHs And Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Natural Natural #
ArithOpHs Lsl Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsl Natural Natural #
ArithOpHs Lsr Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsr Natural Natural #
ArithOpHs Mul Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural #
ArithOpHs Mul Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer #
ArithOpHs Mul Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Natural #
ArithOpHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez #
ArithOpHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural #
ArithOpHs Or Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Natural Natural #
ArithOpHs Sub Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural #
ArithOpHs Sub Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer #
ArithOpHs Sub Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Natural #
ArithOpHs Xor Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Natural Natural #
() :=> (Enum Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Natural #
() :=> (Eq Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Natural #
() :=> (Integral Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Natural #
() :=> (Num Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Natural #
() :=> (Ord Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Natural #
() :=> (Read Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Read 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 #
() :=> (Bits Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Natural #
type Difference Natural
Instance details Defined in Basement.Numerical.Subtractive type Difference Natural = Maybe Natural
type ToT Natural
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type TypeDocFieldDescriptions Natural
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type UnaryArithResHs Neg Natural
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Not Natural
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer
type EDivOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EDivOpResHs Natural Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Natural = Natural
type EDivOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EModOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type EModOpResHs Natural Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Natural = Natural
type EModOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type ArithResHs Add Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Natural = Natural
type ArithResHs And Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Natural
type ArithResHs And Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs And Natural Natural = Natural
type ArithResHs Lsl Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Lsl Natural Natural = Natural
type ArithResHs Lsr Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Lsr Natural Natural = Natural
type ArithResHs Mul Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs Mul Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Natural = Natural
type ArithResHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez
type ArithResHs Or Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Or Natural Natural = Natural
type ArithResHs Sub Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Natural = Integer
type ArithResHs Xor Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Xor Natural Natural = Natural

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

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 #
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 #
MonadFail Maybe	Since: base-4.9.0.0
Instance details Defined in Control.Monad.Fail Methods fail :: String -> 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 #
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] #
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 #
InjValue Maybe
Instance details Defined in Named.Internal Methods injValue :: a -> Maybe a #
PTraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg0 arg1 :: f0 (t0 b0) # type SequenceA arg0 :: f0 (t0 a0) # type MapM arg0 arg1 :: m0 (t0 b0) # type Sequence arg0 :: m0 (t0 a0) #
STraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable 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 (t :: Maybe (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # 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 (t :: Maybe (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) #
PFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg0 :: m0 # type FoldMap arg0 arg1 :: m0 # type Foldr arg0 arg1 arg2 :: b0 # type Foldr' arg0 arg1 arg2 :: b0 # type Foldl arg0 arg1 arg2 :: b0 # type Foldl' arg0 arg1 arg2 :: b0 # type Foldr1 arg0 arg1 :: a0 # type Foldl1 arg0 arg1 :: a0 # type ToList arg0 :: [a0] # type Null arg0 :: Bool # type Length arg0 :: Nat # type Elem arg0 arg1 :: Bool # type Maximum arg0 :: a0 # type Minimum arg0 :: a0 # type Sum arg0 :: a0 # type Product arg0 :: a0 #
SFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Maybe m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # 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 (t :: Maybe a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Maybe a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Maybe a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply ProductSym0 t) #
PMonadFail Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Associated Types type Fail arg0 :: m0 a0 #
SMonadFail Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Methods sFail :: forall a (t :: [Char]). Sing t -> Sing (Apply FailSym0 t) #
PFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg0 arg1 :: f0 b0 # type arg0 <$ arg1 :: f0 a0 #
PApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg0 :: f0 a0 # type arg0 <> arg1 :: f0 b0 # type LiftA2 arg0 arg1 arg2 :: f0 c0 # type arg0 > arg1 :: f0 b0 # type arg0 <* arg1 :: f0 a0 #
PMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg0 >>= arg1 :: m0 b0 # type arg0 >> arg1 :: m0 b0 # type Return arg0 :: m0 a0 #
PAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Empty :: f0 a0 # type arg0 <\|> arg1 :: f0 a0 #
PMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Mzero :: m0 a0 # type Mplus arg0 arg1 :: m0 a0 #
SFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.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) #
SApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.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) #
SMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.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) #
SAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sEmpty :: Sing EmptySym0 # (%<\|>) :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<\|>@#@$) t1) t2) #
SMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sMzero :: Sing MzeroSym0 # sMplus :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MplusSym0 t1) t2) #
LorentzFunctor Maybe
Instance details Defined in Lorentz.Instr Methods lmap :: forall b a (s :: [Type]). KnownValue b => ((a ': s) :-> (b ': s)) -> (Maybe a ': s) :-> (Maybe b ': s)
KnownNamedFunctor Maybe
Instance details Defined in Util.Named Methods namedL :: forall (name :: Symbol) a. Label name -> Iso' (NamedF Maybe a name) (ApplyNamedFunctor 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 #
() :=> (Functor Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Functor Maybe #
() :=> (Applicative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative Maybe #
() :=> (Alternative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Alternative Maybe #
() :=> (MonadPlus Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- MonadPlus Maybe #
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 #
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) #
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 #
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 #
Generic (Maybe a)	Since: base-4.6.0.0
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 #
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 => 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 #
Lift a => Lift (Maybe a)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Maybe a -> Q Exp #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
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)
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #
PMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a0 # type Mappend arg0 arg1 :: a0 # type Mconcat arg0 :: a0 #
SSemigroup a => SMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid 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) #
PShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg0 arg1 arg2 :: Symbol # type Show_ arg0 :: Symbol # type ShowList arg0 arg1 :: Symbol #
SShow a => SShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (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) #
PSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg0 <> arg1 :: a0 # type Sconcat arg0 :: a0 #
SSemigroup a => SSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.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) #
POrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg0 arg1 :: Ordering # type arg0 < arg1 :: Bool # type arg0 <= arg1 :: Bool # type arg0 > arg1 :: Bool # type arg0 >= arg1 :: Bool # type Max arg0 arg1 :: a0 # type Min arg0 arg1 :: a0 #
SOrd a => SOrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord 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) #
SEq a => SEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 == b) # (%/=) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 /= b) #
PEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
(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 # maximum :: Maybe a -> Element (Maybe a) # minimum :: Maybe a -> Element (Maybe a) # 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 # foldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # foldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # 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)) #
HasAnnotation a => HasAnnotation (Maybe a)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a))
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a)
Instance details Defined in 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 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 #
Generic1 Maybe	Since: base-4.6.0.0
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 #
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 #
SingI ('Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'Nothing
SDecide a => TestCoercion (SMaybe :: Maybe a -> Type)
Instance details Defined in Data.Singletons.Prelude.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.Prelude.Instances Methods testEquality :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (a0 :~: b) #
(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) #
(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) #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (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 #
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () #
SingI a2 => SingI ('Just a2 :: Maybe a1)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing ('Just a2)
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679712800] [a6989586621679712800] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679712801] (Maybe a6989586621679712801) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680176855] ([a6989586621680176855] ~> Maybe [a6989586621680176855]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816344Sym0 :: TyFun (Maybe a6989586621679754628) (Maybe a6989586621679754628 ~> Maybe a6989586621679754628) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679712802) [a6989586621679712802] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679712805) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679712806) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679712804) a6989586621679712804 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680408656) (MinInternal a6989586621680408656) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680407982) (MaxInternal a6989586621680407982) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679628257Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679058445) (Option a6989586621679058445) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679083072) (Last a6989586621679083072) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679083079) (First a6989586621679083079) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680297105Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621679816059Sym0 :: TyFun a6989586621679754552 (Maybe a6989586621679754552) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679816352LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679712803 (Maybe a6989586621679712803 ~> a6989586621679712803) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680054673 ([a6989586621680054673] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679058445) (Maybe a6989586621679058445) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679083079) (Maybe a6989586621679083079) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679083072) (Maybe a6989586621679083072) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 #
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing LastSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing FirstSym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing JustSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680178551 :: TyFun [a6989586621680176855] (Maybe [a6989586621680176855]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680059222 :: TyFun [a6989586621680054674] (Maybe a6989586621680054674) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621680059198 :: TyFun [a6989586621680054671] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680059214 :: TyFun [a6989586621680054673] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680297105Sym1 a6989586621680297102 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816344Sym1 a6989586621679816342 :: TyFun (Maybe a6989586621679754628) (Maybe a6989586621679754628) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816254Sym0 :: TyFun (Maybe a6989586621679754578) (Maybe b6989586621679754579 ~> Maybe b6989586621679754579) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816242Sym0 :: TyFun (Maybe a6989586621679754576) ((a6989586621679754576 ~> Maybe b6989586621679754577) ~> Maybe b6989586621679754577) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816099Sym0 :: TyFun (Maybe a6989586621679754558) (Maybe b6989586621679754559 ~> Maybe b6989586621679754559) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679712989 :: TyFun (Maybe a6989586621679712803) a6989586621679712803 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679628257Sym1 a6989586621679628255 :: TyFun (Maybe a3530822107858468865) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816069Sym0 :: TyFun (Maybe (a6989586621679754553 ~> b6989586621679754554)) (Maybe a6989586621679754553 ~> Maybe b6989586621679754554) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679815921Sym0 :: TyFun a6989586621679754549 (Maybe b6989586621679754550 ~> Maybe a6989586621679754549) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679711366 ((a6989586621679711367 ~> b6989586621679711366) ~> (Maybe a6989586621679711367 ~> b6989586621679711366)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680054652 ([(a6989586621680054652, b6989586621680054653)] ~> Maybe b6989586621680054653) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409443NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409443MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409416NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409416MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621680973094 a6989586621680973095) (f6989586621680973094 (Maybe a6989586621680973095)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679815908Sym0 :: TyFun (a6989586621679754547 ~> b6989586621679754548) (Maybe a6989586621679754547 ~> Maybe b6989586621679754548) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679712798 ~> Maybe b6989586621679712799) ([a6989586621679712798] ~> [b6989586621679712799]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680054730 ~> Maybe (a6989586621680054731, b6989586621680054730)) (b6989586621680054730 ~> [a6989586621680054731]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SuppressUnusedWarnings (LookupSym1 a6989586621680058876 b6989586621680054653 :: TyFun [(a6989586621680054652, b6989586621680054653)] (Maybe b6989586621680054653) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816254Sym1 a6989586621679816252 b6989586621679754579 :: TyFun (Maybe b6989586621679754579) (Maybe b6989586621679754579) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816099Sym1 a6989586621679816097 b6989586621679754559 :: TyFun (Maybe b6989586621679754559) (Maybe b6989586621679754559) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816069Sym1 a6989586621679816067 :: TyFun (Maybe a6989586621679754553) (Maybe b6989586621679754554) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679815921Sym1 a6989586621679815919 b6989586621679754550 :: TyFun (Maybe b6989586621679754550) (Maybe a6989586621679754549) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679815908Sym1 a6989586621679815906 :: TyFun (Maybe a6989586621679754547) (Maybe b6989586621679754548) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409443NSym1 x6989586621680409441 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409443MSym1 x6989586621680409441 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409416NSym1 x6989586621680409414 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680409416MSym1 x6989586621680409414 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680417873 t6989586621680417419 :: TyFun (t6989586621680417419 a6989586621680417420) (Maybe a6989586621680417420) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333923Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333835Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680634283Sym0 :: TyFun (a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (Maybe a6989586621680628189 ~> f6989586621680628188 (Maybe b6989586621680628190)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679816242Sym1 a6989586621679816240 b6989586621679754577 :: TyFun (a6989586621679754576 ~> Maybe b6989586621679754577) (Maybe b6989586621679754577) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679816083Sym0 :: TyFun (a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (Maybe a6989586621679754555 ~> (Maybe b6989586621679754556 ~> Maybe c6989586621679754557)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679711384 a6989586621679711367 :: TyFun (a6989586621679711367 ~> b6989586621679711366) (Maybe a6989586621679711367 ~> b6989586621679711366) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679712966RsSym0 :: TyFun (a6989586621679712798 ~> Maybe k1) (TyFun k (TyFun [a6989586621679712798] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418354MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418329MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) #
(SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FindSym1 d t) #
SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) #
SuppressUnusedWarnings (Traverse_6989586621680634283Sym1 a6989586621680634281 :: TyFun (Maybe a6989586621680628189) (f6989586621680628188 (Maybe b6989586621680628190)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679816083Sym1 a6989586621679816080 :: TyFun (Maybe a6989586621679754555) (Maybe b6989586621679754556 ~> Maybe c6989586621679754557) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679711385 a6989586621679711384 :: TyFun (Maybe a6989586621679711367) b6989586621679711366 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418354MfSym1 f6989586621680418352 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418329MfSym1 f6989586621680418327 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333923Sym1 a6989586621680333921 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333835Sym1 a6989586621680333833 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) #
SuppressUnusedWarnings (LiftA2_6989586621679816083Sym2 a6989586621679816081 a6989586621679816080 :: TyFun (Maybe b6989586621679754556) (Maybe c6989586621679754557) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418354MfSym2 xs6989586621680418353 f6989586621680418352 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418329MfSym2 xs6989586621680418328 f6989586621680418327 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333923Sym2 k6989586621680333922 a6989586621680333921 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680333835Sym2 k6989586621680333834 a6989586621680333833 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418329MfSym3 a6989586621680418330 xs6989586621680418328 f6989586621680418327 :: TyFun (Maybe k3) (Maybe k2) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680418354MfSym3 a6989586621680418355 xs6989586621680418353 f6989586621680418352 :: TyFun k3 (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name))
Wrappable (NamedF Maybe a name)
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Maybe a name) #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in 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 Empty
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Empty = Empty_6989586621679816340Sym0 :: Maybe a
type Mzero
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mzero = Mzero_6989586621679755094Sym0 :: Maybe a0
type Product (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg0 :: Maybe a0) = Apply (Product_6989586621680418477Sym0 :: TyFun (Maybe a0) a0 -> Type) arg0
type Sum (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg0 :: Maybe a0) = Apply (Sum_6989586621680418464Sym0 :: TyFun (Maybe a0) a0 -> Type) arg0
type Minimum (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg0 :: Maybe a0) = Apply (Minimum_6989586621680418451Sym0 :: TyFun (Maybe a0) a0 -> Type) arg0
type Maximum (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg0 :: Maybe a0) = Apply (Maximum_6989586621680418438Sym0 :: TyFun (Maybe a0) a0 -> Type) arg0
type Length (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (arg0 :: Maybe a0) = Apply (Length_6989586621680418400Sym0 :: TyFun (Maybe a0) Nat -> Type) arg0
type Null (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (arg0 :: Maybe a0) = Apply (Null_6989586621680418379Sym0 :: TyFun (Maybe a0) Bool -> Type) arg0
type ToList (arg0 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg0 :: Maybe a0) = Apply (ToList_6989586621680418370Sym0 :: TyFun (Maybe a0) [a0] -> Type) arg0
type Fold (arg0 :: Maybe m0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg0 :: Maybe m0) = Apply (Fold_6989586621680418187Sym0 :: TyFun (Maybe m0) m0 -> Type) arg0
type Fail a2
Instance details Defined in Data.Singletons.Prelude.Monad.Fail type Fail a2 = Apply (Fail_6989586621679877866Sym0 :: TyFun [Char] (Maybe a1) -> Type) a2
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621679816059Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Return (arg0 :: a0)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg0 :: a0) = Apply (Return_6989586621679755078Sym0 :: TyFun a0 (Maybe a0) -> Type) arg0
type Sequence (arg0 :: Maybe (m0 a0))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg0 :: Maybe (m0 a0)) = Apply (Sequence_6989586621680628251Sym0 :: TyFun (Maybe (m0 a0)) (m0 (Maybe a0)) -> Type) arg0
type SequenceA (arg0 :: Maybe (f0 a0))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg0 :: Maybe (f0 a0)) = Apply (SequenceA_6989586621680628226Sym0 :: TyFun (Maybe (f0 a0)) (f0 (Maybe a0)) -> Type) arg0
type Elem (arg1 :: a0) (arg2 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a0) (arg2 :: Maybe a0) = Apply (Apply (Elem_6989586621680418423Sym0 :: TyFun a0 (Maybe a0 ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) = Apply (Apply (Foldl1_6989586621680418346Sym0 :: TyFun (a0 ~> (a0 ~> a0)) (Maybe a0 ~> a0) -> Type) arg1) arg2
type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) = Apply (Apply (Foldr1_6989586621680418321Sym0 :: TyFun (a0 ~> (a0 ~> a0)) (Maybe a0 ~> a0) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679754628) <\|> (a2 :: Maybe a6989586621679754628)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679754628) <\|> (a2 :: Maybe a6989586621679754628) = Apply (Apply (TFHelper_6989586621679816344Sym0 :: TyFun (Maybe a6989586621679754628) (Maybe a6989586621679754628 ~> Maybe a6989586621679754628) -> Type) a1) a2
type Mplus (arg1 :: Maybe a0) (arg2 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mplus (arg1 :: Maybe a0) (arg2 :: Maybe a0) = Apply (Apply (Mplus_6989586621679755098Sym0 :: TyFun (Maybe a0) (Maybe a0 ~> Maybe a0) -> Type) arg1) arg2
type FoldMap (a1 :: a6989586621680417514 ~> k2) (a2 :: Maybe a6989586621680417514)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a1 :: a6989586621680417514 ~> k2) (a2 :: Maybe a6989586621680417514) = Apply (Apply (FoldMap_6989586621680418491Sym0 :: TyFun (a6989586621680417514 ~> k2) (Maybe a6989586621680417514 ~> k2) -> Type) a1) a2
type (a1 :: k1) <$ (a2 :: Maybe b6989586621679754550)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: k1) <$ (a2 :: Maybe b6989586621679754550) = Apply (Apply (TFHelper_6989586621679815921Sym0 :: TyFun k1 (Maybe b6989586621679754550 ~> Maybe k1) -> Type) a1) a2
type Fmap (a1 :: a6989586621679754547 ~> b6989586621679754548) (a2 :: Maybe a6989586621679754547)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a1 :: a6989586621679754547 ~> b6989586621679754548) (a2 :: Maybe a6989586621679754547) = Apply (Apply (Fmap_6989586621679815908Sym0 :: TyFun (a6989586621679754547 ~> b6989586621679754548) (Maybe a6989586621679754547 ~> Maybe b6989586621679754548) -> Type) a1) a2
type (arg1 :: Maybe a0) <* (arg2 :: Maybe b0)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Maybe a0) <* (arg2 :: Maybe b0) = Apply (Apply (TFHelper_6989586621679755031Sym0 :: TyFun (Maybe a0) (Maybe b0 ~> Maybe a0) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679754558) *> (a2 :: Maybe b6989586621679754559)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679754558) *> (a2 :: Maybe b6989586621679754559) = Apply (Apply (TFHelper_6989586621679816099Sym0 :: TyFun (Maybe a6989586621679754558) (Maybe b6989586621679754559 ~> Maybe b6989586621679754559) -> Type) a1) a2
type (a1 :: Maybe (a6989586621679754553 ~> b6989586621679754554)) <*> (a2 :: Maybe a6989586621679754553)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe (a6989586621679754553 ~> b6989586621679754554)) <*> (a2 :: Maybe a6989586621679754553) = Apply (Apply (TFHelper_6989586621679816069Sym0 :: TyFun (Maybe (a6989586621679754553 ~> b6989586621679754554)) (Maybe a6989586621679754553 ~> Maybe b6989586621679754554) -> Type) a1) a2
type (a1 :: Maybe a6989586621679754578) >> (a2 :: Maybe b6989586621679754579)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679754578) >> (a2 :: Maybe b6989586621679754579) = Apply (Apply (TFHelper_6989586621679816254Sym0 :: TyFun (Maybe a6989586621679754578) (Maybe b6989586621679754579 ~> Maybe b6989586621679754579) -> Type) a1) a2
type (a1 :: Maybe a6989586621679754576) >>= (a2 :: a6989586621679754576 ~> Maybe b6989586621679754577)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679754576) >>= (a2 :: a6989586621679754576 ~> Maybe b6989586621679754577) = Apply (Apply (TFHelper_6989586621679816242Sym0 :: TyFun (Maybe a6989586621679754576) ((a6989586621679754576 ~> Maybe b6989586621679754577) ~> Maybe b6989586621679754577) -> Type) a1) a2
type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Maybe a0) = Apply (Apply (MapM_6989586621680628236Sym0 :: TyFun (a0 ~> m0 b0) (Maybe a0 ~> m0 (Maybe b0)) -> Type) arg1) arg2
type Traverse (a1 :: a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (a2 :: Maybe a6989586621680628189)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (a2 :: Maybe a6989586621680628189) = Apply (Apply (Traverse_6989586621680634283Sym0 :: TyFun (a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (Maybe a6989586621680628189 ~> f6989586621680628188 (Maybe b6989586621680628190)) -> Type) a1) a2
type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) = Apply (Apply (Apply (Foldl'_6989586621680418292Sym0 :: TyFun (b0 ~> (a0 ~> b0)) (b0 ~> (Maybe a0 ~> b0)) -> Type) arg1) arg2) arg3
type Foldl (a1 :: k2 ~> (a6989586621680417520 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680417520)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a1 :: k2 ~> (a6989586621680417520 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680417520) = Apply (Apply (Apply (Foldl_6989586621680418526Sym0 :: TyFun (k2 ~> (a6989586621680417520 ~> k2)) (k2 ~> (Maybe a6989586621680417520 ~> k2)) -> Type) a1) a2) a3
type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) = Apply (Apply (Apply (Foldr'_6989586621680418237Sym0 :: TyFun (a0 ~> (b0 ~> b0)) (b0 ~> (Maybe a0 ~> b0)) -> Type) arg1) arg2) arg3
type Foldr (a1 :: a6989586621680417515 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680417515)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a1 :: a6989586621680417515 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680417515) = Apply (Apply (Apply (Foldr_6989586621680418508Sym0 :: TyFun (a6989586621680417515 ~> (k2 ~> k2)) (k2 ~> (Maybe a6989586621680417515 ~> k2)) -> Type) a1) a2) a3
type LiftA2 (a1 :: a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (a2 :: Maybe a6989586621679754555) (a3 :: Maybe b6989586621679754556)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (a2 :: Maybe a6989586621679754555) (a3 :: Maybe b6989586621679754556) = Apply (Apply (Apply (LiftA2_6989586621679816083Sym0 :: TyFun (a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (Maybe a6989586621679754555 ~> (Maybe b6989586621679754556 ~> Maybe c6989586621679754557)) -> Type) a1) a2) a3
type Apply (Pure_6989586621679816059Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679816058 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621679816059Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679816058 :: a) = Pure_6989586621679816059 a6989586621679816058
type Apply (Let6989586621679816352LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216798153306989586621679816351 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621679816352LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216798153306989586621679816351 :: k1) = Let6989586621679816352L wild_69895866216798153306989586621679816351
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679548077 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679548077 :: a) = 'Just t6989586621679548077
type Apply (Let6989586621680409416NSym1 x6989586621680409414 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680409415 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409416NSym1 x6989586621680409414 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680409415 :: k1) = Let6989586621680409416N x6989586621680409414 y6989586621680409415
type Apply (Let6989586621680409416MSym1 x6989586621680409414 :: TyFun k (Maybe k1) -> Type) (y6989586621680409415 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409416MSym1 x6989586621680409414 :: TyFun k (Maybe k1) -> Type) (y6989586621680409415 :: k) = Let6989586621680409416M x6989586621680409414 y6989586621680409415
type Apply (Let6989586621680409443NSym1 x6989586621680409441 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680409442 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409443NSym1 x6989586621680409441 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680409442 :: k1) = Let6989586621680409443N x6989586621680409441 y6989586621680409442
type Apply (Let6989586621680409443MSym1 x6989586621680409441 :: TyFun k (Maybe k1) -> Type) (y6989586621680409442 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409443MSym1 x6989586621680409441 :: TyFun k (Maybe k1) -> Type) (y6989586621680409442 :: k) = Let6989586621680409443M x6989586621680409441 y6989586621680409442
type Apply (Lambda_6989586621680333835Sym2 k6989586621680333834 a6989586621680333833 :: TyFun k1 (Maybe a) -> Type) (t6989586621680333846 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333835Sym2 k6989586621680333834 a6989586621680333833 :: TyFun k1 (Maybe a) -> Type) (t6989586621680333846 :: k1) = Lambda_6989586621680333835 k6989586621680333834 a6989586621680333833 t6989586621680333846
type Apply (Lambda_6989586621680333923Sym2 k6989586621680333922 a6989586621680333921 :: TyFun k1 (Maybe a) -> Type) (t6989586621680333934 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333923Sym2 k6989586621680333922 a6989586621680333921 :: TyFun k1 (Maybe a) -> Type) (t6989586621680333934 :: k1) = Lambda_6989586621680333923 k6989586621680333922 a6989586621680333921 t6989586621680333934
type Apply (Let6989586621680418354MfSym3 a6989586621680418355 xs6989586621680418353 f6989586621680418352 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680418356 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418354MfSym3 a6989586621680418355 xs6989586621680418353 f6989586621680418352 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680418356 :: k3) = Let6989586621680418354Mf a6989586621680418355 xs6989586621680418353 f6989586621680418352 a6989586621680418356
type Apply (ShowsPrec_6989586621680297105Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680297102 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680297105Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680297102 :: Nat) = ShowsPrec_6989586621680297105Sym1 a6989586621680297102 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type
type Apply (FromMaybeSym0 :: TyFun a6989586621679712803 (Maybe a6989586621679712803 ~> a6989586621679712803) -> Type) (a6989586621679712989 :: a6989586621679712803)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679712803 (Maybe a6989586621679712803 ~> a6989586621679712803) -> Type) (a6989586621679712989 :: a6989586621679712803) = FromMaybeSym1 a6989586621679712989
type Apply (ElemIndexSym0 :: TyFun a6989586621680054673 ([a6989586621680054673] ~> Maybe Nat) -> Type) (a6989586621680059214 :: a6989586621680054673)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680054673 ([a6989586621680054673] ~> Maybe Nat) -> Type) (a6989586621680059214 :: a6989586621680054673) = ElemIndexSym1 a6989586621680059214
type Apply (TFHelper_6989586621679815921Sym0 :: TyFun a6989586621679754549 (Maybe b6989586621679754550 ~> Maybe a6989586621679754549) -> Type) (a6989586621679815919 :: a6989586621679754549)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679815921Sym0 :: TyFun a6989586621679754549 (Maybe b6989586621679754550 ~> Maybe a6989586621679754549) -> Type) (a6989586621679815919 :: a6989586621679754549) = TFHelper_6989586621679815921Sym1 a6989586621679815919 b6989586621679754550 :: TyFun (Maybe b6989586621679754550) (Maybe a6989586621679754549) -> Type
type Apply (Maybe_Sym0 :: TyFun b6989586621679711366 ((a6989586621679711367 ~> b6989586621679711366) ~> (Maybe a6989586621679711367 ~> b6989586621679711366)) -> Type) (a6989586621679711384 :: b6989586621679711366)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679711366 ((a6989586621679711367 ~> b6989586621679711366) ~> (Maybe a6989586621679711367 ~> b6989586621679711366)) -> Type) (a6989586621679711384 :: b6989586621679711366) = Maybe_Sym1 a6989586621679711384 a6989586621679711367 :: TyFun (a6989586621679711367 ~> b6989586621679711366) (Maybe a6989586621679711367 ~> b6989586621679711366) -> Type
type Apply (LookupSym0 :: TyFun a6989586621680054652 ([(a6989586621680054652, b6989586621680054653)] ~> Maybe b6989586621680054653) -> Type) (a6989586621680058876 :: a6989586621680054652)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680054652 ([(a6989586621680054652, b6989586621680054653)] ~> Maybe b6989586621680054653) -> Type) (a6989586621680058876 :: a6989586621680054652) = LookupSym1 a6989586621680058876 b6989586621680054653 :: TyFun [(a6989586621680054652, b6989586621680054653)] (Maybe b6989586621680054653) -> Type
type Apply (Let6989586621680409416NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680409414 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409416NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680409414 :: k) = Let6989586621680409416NSym1 x6989586621680409414 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680409416MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680409414 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409416MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680409414 :: k1) = Let6989586621680409416MSym1 x6989586621680409414 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680409443NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680409441 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409443NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680409441 :: k) = Let6989586621680409443NSym1 x6989586621680409441 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680409443MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680409441 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680409443MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680409441 :: k1) = Let6989586621680409443MSym1 x6989586621680409441 :: TyFun k (Maybe k1) -> Type
type Apply (Lambda_6989586621680333835Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680333833 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333835Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680333833 :: k) = Lambda_6989586621680333835Sym1 a6989586621680333833 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Lambda_6989586621680333923Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680333921 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333923Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680333921 :: k) = Lambda_6989586621680333923Sym1 a6989586621680333921 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Let6989586621680418329MfSym1 f6989586621680418327 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680418328 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418329MfSym1 f6989586621680418327 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680418328 :: k) = Let6989586621680418329MfSym2 f6989586621680418327 xs6989586621680418328
type Apply (Let6989586621680418354MfSym1 f6989586621680418352 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680418353 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418354MfSym1 f6989586621680418352 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680418353 :: k) = Let6989586621680418354MfSym2 f6989586621680418352 xs6989586621680418353
type Apply (Let6989586621680418329MfSym2 xs6989586621680418328 f6989586621680418327 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680418330 :: k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418329MfSym2 xs6989586621680418328 f6989586621680418327 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680418330 :: k2) = Let6989586621680418329MfSym3 xs6989586621680418328 f6989586621680418327 a6989586621680418330
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 Rep (Maybe a)
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 DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
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 Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = Mempty_6989586621680324300Sym0 :: Maybe a
type Sing
Instance details Defined in Data.Singletons.Prelude.Instances type Sing = SMaybe :: Maybe a -> Type
type Demote (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Maybe a) = Maybe (Demote a)
type Element (Maybe a)
Instance details Defined in Universum.Container.Class type Element (Maybe a) = ElementDefault (Maybe a)
type ToT (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type Rep1 Maybe
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 Mconcat (arg0 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg0 :: [Maybe a]) = Apply (Mconcat_6989586621680324219Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg0
type Show_ (arg0 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg0 :: Maybe a) = Apply (Show__6989586621680279216Sym0 :: TyFun (Maybe a) Symbol -> Type) arg0
type Sconcat (arg0 :: NonEmpty (Maybe a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg0 :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621679949048Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg0
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mappend_6989586621680324204Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type ShowList (arg1 :: [Maybe a]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Maybe a]) arg2 = Apply (Apply (ShowList_6989586621680279224Sym0 :: TyFun [Maybe a] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Maybe a1) <> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679949279Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Min (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Min_6989586621679617664Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type Max (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Max_6989586621679617646Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (arg1 :: Maybe a) >= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) >= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679617628Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) > (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) > (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679617610Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) <= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) <= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679617592Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) < (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) < (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679617574Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) = Apply (Apply (Compare_6989586621679628257Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Ordering) -> Type) a2) a3
type (x :: Maybe a) /= (y :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Maybe a) /= (y :: Maybe a) = Not (x == y)
type (a2 :: Maybe a1) == (b :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Maybe a1) == (b :: Maybe a1) = Equals_6989586621679604783 a2 b
type HKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD Maybe (a :: Type) = Maybe a
type ShowsPrec a2 (a3 :: Maybe a1) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Maybe a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680297105Sym0 :: TyFun Nat (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 (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679712999 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679712999 :: Maybe a) = FromJust a6989586621679712999
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713002 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713002 :: Maybe a) = IsNothing a6989586621679713002
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713004 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679713004 :: Maybe a) = IsJust a6989586621679713004
type Apply (FromMaybeSym1 a6989586621679712989 :: TyFun (Maybe a) a -> Type) (a6989586621679712990 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621679712989 :: TyFun (Maybe a) a -> Type) (a6989586621679712990 :: Maybe a) = FromMaybe a6989586621679712989 a6989586621679712990
type Apply (Compare_6989586621679628257Sym1 a6989586621679628255 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679628256 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679628257Sym1 a6989586621679628255 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679628256 :: Maybe a) = Compare_6989586621679628257 a6989586621679628255 a6989586621679628256
type Apply (Maybe_Sym2 a6989586621679711385 a6989586621679711384 :: TyFun (Maybe a) b -> Type) (a6989586621679711386 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679711385 a6989586621679711384 :: TyFun (Maybe a) b -> Type) (a6989586621679711386 :: Maybe a) = Maybe_ a6989586621679711385 a6989586621679711384 a6989586621679711386
type ('Nothing :: Maybe a) <> (b :: Maybe a)
Instance details Defined in Fcf.Class.Monoid type ('Nothing :: Maybe a) <> (b :: Maybe a) = b
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679712978 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679712978 :: [Maybe a]) = CatMaybes a6989586621679712978
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679712983 :: [a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679712983 :: [a]) = ListToMaybe a6989586621679712983
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679712986 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679712986 :: Maybe a) = MaybeToList a6989586621679712986
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680408645 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680408645 :: Maybe a) = 'MaxInternal t6989586621680408645
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680408843 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680408843 :: Maybe a) = 'MinInternal t6989586621680408843
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621679958372 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621679958372 :: Maybe a) = 'Option t6989586621679958372
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680327653 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680327653 :: Maybe a) = 'First t6989586621680327653
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680327676 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680327676 :: Maybe a) = 'Last t6989586621680327676
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679958369 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679958369 :: Option a) = GetOption a6989586621679958369
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680327650 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680327650 :: First a) = GetFirst a6989586621680327650
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680327673 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680327673 :: Last a) = GetLast a6989586621680327673
type Apply (FindSym1 a6989586621680059222 :: TyFun [a] (Maybe a) -> Type) (a6989586621680059223 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym1 a6989586621680059222 :: TyFun [a] (Maybe a) -> Type) (a6989586621680059223 :: [a]) = Find a6989586621680059222 a6989586621680059223
type Apply (FindIndexSym1 a6989586621680059198 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680059199 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680059198 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680059199 :: [a]) = FindIndex a6989586621680059198 a6989586621680059199
type Apply (ElemIndexSym1 a6989586621680059214 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680059215 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680059214 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680059215 :: [a]) = ElemIndex a6989586621680059214 a6989586621680059215
type Apply (StripPrefixSym1 a6989586621680178551 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680178552 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680178551 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680178552 :: [a]) = StripPrefix a6989586621680178551 a6989586621680178552
type Apply (TFHelper_6989586621679816344Sym1 a6989586621679816342 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679816343 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816344Sym1 a6989586621679816342 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679816343 :: Maybe a) = TFHelper_6989586621679816344 a6989586621679816342 a6989586621679816343
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680973132 :: f a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680973132 :: f a) = Optional a6989586621680973132
type Apply (LookupSym1 a6989586621680058876 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680058877 :: [(a, b)])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680058876 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680058877 :: [(a, b)]) = Lookup a6989586621680058876 a6989586621680058877
type Apply (Fmap_6989586621679815908Sym1 a6989586621679815906 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679815907 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621679815908Sym1 a6989586621679815906 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679815907 :: Maybe a) = Fmap_6989586621679815908 a6989586621679815906 a6989586621679815907
type Apply (TFHelper_6989586621679815921Sym1 a6989586621679815919 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679815920 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679815921Sym1 a6989586621679815919 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679815920 :: Maybe b) = TFHelper_6989586621679815921 a6989586621679815919 a6989586621679815920
type Apply (TFHelper_6989586621679816069Sym1 a6989586621679816067 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679816068 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816069Sym1 a6989586621679816067 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679816068 :: Maybe a) = TFHelper_6989586621679816069 a6989586621679816067 a6989586621679816068
type Apply (TFHelper_6989586621679816099Sym1 a6989586621679816097 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679816098 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816099Sym1 a6989586621679816097 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679816098 :: Maybe b) = TFHelper_6989586621679816099 a6989586621679816097 a6989586621679816098
type Apply (TFHelper_6989586621679816254Sym1 a6989586621679816252 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679816253 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816254Sym1 a6989586621679816252 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679816253 :: Maybe b) = TFHelper_6989586621679816254 a6989586621679816252 a6989586621679816253
type Apply (FindSym1 a6989586621680417873 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680417874 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym1 a6989586621680417873 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680417874 :: t a) = Find a6989586621680417873 a6989586621680417874
type Apply (Traverse_6989586621680634283Sym1 a6989586621680634281 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680634282 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680634283Sym1 a6989586621680634281 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680634282 :: Maybe a) = Traverse_6989586621680634283 a6989586621680634281 a6989586621680634282
type Apply (LiftA2_6989586621679816083Sym2 a6989586621679816081 a6989586621679816080 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679816082 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679816083Sym2 a6989586621679816081 a6989586621679816080 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679816082 :: Maybe b) = LiftA2_6989586621679816083 a6989586621679816081 a6989586621679816080 a6989586621679816082
type Apply (Let6989586621680418329MfSym3 a6989586621680418330 xs6989586621680418328 f6989586621680418327 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680418331 :: Maybe k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418329MfSym3 a6989586621680418330 xs6989586621680418328 f6989586621680418327 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680418331 :: Maybe k3) = Let6989586621680418329Mf a6989586621680418330 xs6989586621680418328 f6989586621680418327 a6989586621680418331
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 (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 (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 (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 (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 Eval (Last ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Apply (StripPrefixSym0 :: TyFun [a6989586621680176855] ([a6989586621680176855] ~> Maybe [a6989586621680176855]) -> Type) (a6989586621680178551 :: [a6989586621680176855])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680176855] ([a6989586621680176855] ~> Maybe [a6989586621680176855]) -> Type) (a6989586621680178551 :: [a6989586621680176855]) = StripPrefixSym1 a6989586621680178551
type Apply (TFHelper_6989586621679816344Sym0 :: TyFun (Maybe a6989586621679754628) (Maybe a6989586621679754628 ~> Maybe a6989586621679754628) -> Type) (a6989586621679816342 :: Maybe a6989586621679754628)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816344Sym0 :: TyFun (Maybe a6989586621679754628) (Maybe a6989586621679754628 ~> Maybe a6989586621679754628) -> Type) (a6989586621679816342 :: Maybe a6989586621679754628) = TFHelper_6989586621679816344Sym1 a6989586621679816342
type Apply (Compare_6989586621679628257Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679628255 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679628257Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679628255 :: Maybe a3530822107858468865) = Compare_6989586621679628257Sym1 a6989586621679628255
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 (ShowsPrec_6989586621680297105Sym1 a6989586621680297102 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680297103 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680297105Sym1 a6989586621680297102 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680297103 :: Maybe a3530822107858468865) = ShowsPrec_6989586621680297105Sym2 a6989586621680297102 a6989586621680297103
type Apply (TFHelper_6989586621679816099Sym0 :: TyFun (Maybe a6989586621679754558) (Maybe b6989586621679754559 ~> Maybe b6989586621679754559) -> Type) (a6989586621679816097 :: Maybe a6989586621679754558)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816099Sym0 :: TyFun (Maybe a6989586621679754558) (Maybe b6989586621679754559 ~> Maybe b6989586621679754559) -> Type) (a6989586621679816097 :: Maybe a6989586621679754558) = TFHelper_6989586621679816099Sym1 a6989586621679816097 b6989586621679754559 :: TyFun (Maybe b6989586621679754559) (Maybe b6989586621679754559) -> Type
type Apply (TFHelper_6989586621679816242Sym0 :: TyFun (Maybe a6989586621679754576) ((a6989586621679754576 ~> Maybe b6989586621679754577) ~> Maybe b6989586621679754577) -> Type) (a6989586621679816240 :: Maybe a6989586621679754576)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816242Sym0 :: TyFun (Maybe a6989586621679754576) ((a6989586621679754576 ~> Maybe b6989586621679754577) ~> Maybe b6989586621679754577) -> Type) (a6989586621679816240 :: Maybe a6989586621679754576) = TFHelper_6989586621679816242Sym1 a6989586621679816240 b6989586621679754577 :: TyFun (a6989586621679754576 ~> Maybe b6989586621679754577) (Maybe b6989586621679754577) -> Type
type Apply (TFHelper_6989586621679816254Sym0 :: TyFun (Maybe a6989586621679754578) (Maybe b6989586621679754579 ~> Maybe b6989586621679754579) -> Type) (a6989586621679816252 :: Maybe a6989586621679754578)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816254Sym0 :: TyFun (Maybe a6989586621679754578) (Maybe b6989586621679754579 ~> Maybe b6989586621679754579) -> Type) (a6989586621679816252 :: Maybe a6989586621679754578) = TFHelper_6989586621679816254Sym1 a6989586621679816252 b6989586621679754579 :: TyFun (Maybe b6989586621679754579) (Maybe b6989586621679754579) -> Type
type Apply (TFHelper_6989586621679816069Sym0 :: TyFun (Maybe (a6989586621679754553 ~> b6989586621679754554)) (Maybe a6989586621679754553 ~> Maybe b6989586621679754554) -> Type) (a6989586621679816067 :: Maybe (a6989586621679754553 ~> b6989586621679754554))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816069Sym0 :: TyFun (Maybe (a6989586621679754553 ~> b6989586621679754554)) (Maybe a6989586621679754553 ~> Maybe b6989586621679754554) -> Type) (a6989586621679816067 :: Maybe (a6989586621679754553 ~> b6989586621679754554)) = TFHelper_6989586621679816069Sym1 a6989586621679816067
type Apply (LiftA2_6989586621679816083Sym1 a6989586621679816080 :: TyFun (Maybe a6989586621679754555) (Maybe b6989586621679754556 ~> Maybe c6989586621679754557) -> Type) (a6989586621679816081 :: Maybe a6989586621679754555)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679816083Sym1 a6989586621679816080 :: TyFun (Maybe a6989586621679754555) (Maybe b6989586621679754556 ~> Maybe c6989586621679754557) -> Type) (a6989586621679816081 :: Maybe a6989586621679754555) = LiftA2_6989586621679816083Sym2 a6989586621679816080 a6989586621679816081
type Apply (Let6989586621680418354MfSym2 xs6989586621680418353 f6989586621680418352 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680418355 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418354MfSym2 xs6989586621680418353 f6989586621680418352 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680418355 :: Maybe k2) = Let6989586621680418354MfSym3 xs6989586621680418353 f6989586621680418352 a6989586621680418355
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 (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 (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, Nat))
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 (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 (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 (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 Eval ('Just x <\|> _1 :: Maybe a -> Type)
Instance details Defined in 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 Util.Fcf type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type) = m
type Apply (TFHelper_6989586621679816242Sym1 a6989586621679816240 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679816241 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679816242Sym1 a6989586621679816240 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679816241 :: a ~> Maybe b) = TFHelper_6989586621679816242 a6989586621679816240 a6989586621679816241
type Apply (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type) (a6989586621680059222 :: a6989586621680054674 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621680054674 ~> Bool) ([a6989586621680054674] ~> Maybe a6989586621680054674) -> Type) (a6989586621680059222 :: a6989586621680054674 ~> Bool) = FindSym1 a6989586621680059222
type Apply (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type) (a6989586621680059198 :: a6989586621680054671 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621680054671 ~> Bool) ([a6989586621680054671] ~> Maybe Nat) -> Type) (a6989586621680059198 :: a6989586621680054671 ~> Bool) = FindIndexSym1 a6989586621680059198
type Apply (Fmap_6989586621679815908Sym0 :: TyFun (a6989586621679754547 ~> b6989586621679754548) (Maybe a6989586621679754547 ~> Maybe b6989586621679754548) -> Type) (a6989586621679815906 :: a6989586621679754547 ~> b6989586621679754548)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621679815908Sym0 :: TyFun (a6989586621679754547 ~> b6989586621679754548) (Maybe a6989586621679754547 ~> Maybe b6989586621679754548) -> Type) (a6989586621679815906 :: a6989586621679754547 ~> b6989586621679754548) = Fmap_6989586621679815908Sym1 a6989586621679815906
type Apply (MapMaybeSym0 :: TyFun (a6989586621679712798 ~> Maybe b6989586621679712799) ([a6989586621679712798] ~> [b6989586621679712799]) -> Type) (a6989586621679712959 :: a6989586621679712798 ~> Maybe b6989586621679712799)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679712798 ~> Maybe b6989586621679712799) ([a6989586621679712798] ~> [b6989586621679712799]) -> Type) (a6989586621679712959 :: a6989586621679712798 ~> Maybe b6989586621679712799) = MapMaybeSym1 a6989586621679712959
type Apply (UnfoldrSym0 :: TyFun (b6989586621680054730 ~> Maybe (a6989586621680054731, b6989586621680054730)) (b6989586621680054730 ~> [a6989586621680054731]) -> Type) (a6989586621680059642 :: b6989586621680054730 ~> Maybe (a6989586621680054731, b6989586621680054730))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680054730 ~> Maybe (a6989586621680054731, b6989586621680054730)) (b6989586621680054730 ~> [a6989586621680054731]) -> Type) (a6989586621680059642 :: b6989586621680054730 ~> Maybe (a6989586621680054731, b6989586621680054730)) = UnfoldrSym1 a6989586621680059642
type Apply (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type) (a6989586621680417873 :: a6989586621680417420 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680417420 ~> Bool) (t6989586621680417419 a6989586621680417420 ~> Maybe a6989586621680417420) -> Type) (a6989586621680417873 :: a6989586621680417420 ~> Bool) = FindSym1 a6989586621680417873 t6989586621680417419 :: TyFun (t6989586621680417419 a6989586621680417420) (Maybe a6989586621680417420) -> Type
type Apply (Traverse_6989586621680634283Sym0 :: TyFun (a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (Maybe a6989586621680628189 ~> f6989586621680628188 (Maybe b6989586621680628190)) -> Type) (a6989586621680634281 :: a6989586621680628189 ~> f6989586621680628188 b6989586621680628190)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680634283Sym0 :: TyFun (a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) (Maybe a6989586621680628189 ~> f6989586621680628188 (Maybe b6989586621680628190)) -> Type) (a6989586621680634281 :: a6989586621680628189 ~> f6989586621680628188 b6989586621680628190) = Traverse_6989586621680634283Sym1 a6989586621680634281
type Apply (LiftA2_6989586621679816083Sym0 :: TyFun (a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (Maybe a6989586621679754555 ~> (Maybe b6989586621679754556 ~> Maybe c6989586621679754557)) -> Type) (a6989586621679816080 :: a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679816083Sym0 :: TyFun (a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) (Maybe a6989586621679754555 ~> (Maybe b6989586621679754556 ~> Maybe c6989586621679754557)) -> Type) (a6989586621679816080 :: a6989586621679754555 ~> (b6989586621679754556 ~> c6989586621679754557)) = LiftA2_6989586621679816083Sym1 a6989586621679816080
type Apply (Maybe_Sym1 a6989586621679711384 a6989586621679711367 :: TyFun (a6989586621679711367 ~> b6989586621679711366) (Maybe a6989586621679711367 ~> b6989586621679711366) -> Type) (a6989586621679711385 :: a6989586621679711367 ~> b6989586621679711366)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679711384 a6989586621679711367 :: TyFun (a6989586621679711367 ~> b6989586621679711366) (Maybe a6989586621679711367 ~> b6989586621679711366) -> Type) (a6989586621679711385 :: a6989586621679711367 ~> b6989586621679711366) = Maybe_Sym2 a6989586621679711384 a6989586621679711385
type Apply (Let6989586621679712966RsSym0 :: TyFun (a6989586621679712798 ~> Maybe k1) (TyFun k (TyFun [a6989586621679712798] [k1] -> Type) -> Type) -> Type) (f6989586621679712963 :: a6989586621679712798 ~> Maybe k1)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679712966RsSym0 :: TyFun (a6989586621679712798 ~> Maybe k1) (TyFun k (TyFun [a6989586621679712798] [k1] -> Type) -> Type) -> Type) (f6989586621679712963 :: a6989586621679712798 ~> Maybe k1) = Let6989586621679712966RsSym1 f6989586621679712963 :: TyFun k (TyFun [a6989586621679712798] [k1] -> Type) -> Type
type Apply (Let6989586621680418329MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680418327 :: k2 ~> (k3 ~> k2))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418329MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680418327 :: k2 ~> (k3 ~> k2)) = Let6989586621680418329MfSym1 f6989586621680418327 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type
type Apply (Let6989586621680418354MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680418352 :: k2 ~> (k3 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680418354MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680418352 :: k2 ~> (k3 ~> k3)) = Let6989586621680418354MfSym1 f6989586621680418352 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680333835Sym1 a6989586621680333833 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680333834 :: k1 ~> First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333835Sym1 a6989586621680333833 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680333834 :: k1 ~> First a) = Lambda_6989586621680333835Sym2 a6989586621680333833 k6989586621680333834
type Apply (Lambda_6989586621680333923Sym1 a6989586621680333921 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680333922 :: k1 ~> Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680333923Sym1 a6989586621680333921 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680333922 :: k1 ~> Last a) = Lambda_6989586621680333923Sym2 a6989586621680333921 k6989586621680333922
type ToT (NamedF Maybe a name)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)
type Unwrappable (NamedF Maybe a name)
Instance details Defined in Lorentz.Wrappable type Unwrappable (NamedF Maybe a name) = Maybe a

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

Eq ByteString
Instance details Defined in Data.ByteString.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Data ByteString
Instance details Defined in Data.ByteString.Internal 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 #
Ord ByteString
Instance details Defined in Data.ByteString.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 #
Read ByteString
Instance details Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Show ByteString
Instance details Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
IsString ByteString
Instance details Defined in Data.ByteString.Internal Methods fromString :: String -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
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 #
NFData ByteString
Instance details Defined in Data.ByteString.Internal Methods rnf :: ByteString -> () #
Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
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) # showTokens :: Proxy ByteString -> NonEmpty (Token ByteString) -> String # tokensLength :: Proxy ByteString -> NonEmpty (Token ByteString) -> Int # reachOffset :: Int -> PosState ByteString -> (String, PosState ByteString) # reachOffsetNoLine :: Int -> PosState ByteString -> PosState ByteString #
Print ByteString
Instance details Defined in Universum.Print.Internal Methods hPutStr :: Handle -> ByteString -> IO () # hPutStrLn :: Handle -> ByteString -> IO () #
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 # maximum :: ByteString -> Element ByteString # minimum :: ByteString -> Element ByteString # foldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # fold :: ByteString -> Element ByteString # foldr' :: (Element ByteString -> b -> b) -> b -> ByteString -> b # foldr1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # foldl1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # 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) #
One ByteString
Instance details Defined in Universum.Container.Class Associated Types type OneItem ByteString # Methods one :: OneItem ByteString -> ByteString #
HasAnnotation ByteString
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString)
TypeHasDoc ByteString
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
ConcatOpHs ByteString
Instance details Defined in Lorentz.Polymorphic
SizeOpHs ByteString
Instance details Defined in Lorentz.Polymorphic
SliceOpHs ByteString
Instance details Defined in Lorentz.Polymorphic
ConvertUtf8 String ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: String -> ByteString # decodeUtf8 :: ByteString -> String # decodeUtf8Strict :: ByteString -> Either UnicodeException String #
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 #
type State ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type State ByteString = Buffer
type ChunkElem ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem 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 Tokens ByteString
Instance details Defined in Text.Megaparsec.Stream type Tokens ByteString = ByteString
type Token ByteString
Instance details Defined in Text.Megaparsec.Stream type Token ByteString = Word8
type Element ByteString
Instance details Defined in Universum.Container.Class type Element ByteString = Word8
type OneItem ByteString
Instance details Defined in Universum.Container.Class type OneItem ByteString = Word8
type ToT ByteString
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes
type TypeDocFieldDescriptions ByteString
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

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

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 #
MapInstrs Map
Instance details Defined in Lorentz.Macro Methods mapUpdate :: forall k v (s :: [Type]). NiceComparable k => (k ': (Maybe v ': (Map k v ': s))) :-> (Map k v ': s) mapInsert :: forall k v (s :: [Type]). NiceComparable k => (k ': (v ': (Map k v ': s))) :-> (Map k v ': s) mapInsertNew :: forall k e v (s :: [Type]). (NiceComparable k, KnownValue e) => (forall (s0 :: [Type]). (k ': s0) :-> (e ': s0)) -> (k ': (v ': (Map k v ': s))) :-> (Map k v ': s) deleteMap :: forall k v (s :: [Type]). (NiceComparable k, KnownValue v) => (k ': (Map k v ': s)) :-> (Map k v ': s)
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 #
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 #
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) #
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 #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Map k1 v1) -> Proxy (Map k2 v2) -> () #
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)] #
(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 #
(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, 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 #
(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 #
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 => 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 #
(NFData k, NFData a) => NFData (Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: 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 => 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 => 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)) #
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)] #
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 # maximum :: Map k v -> Element (Map k v) # minimum :: Map k v -> Element (Map k v) # 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 # foldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # foldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # 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)) #
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 #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v))
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v)
Instance details Defined in 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 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 #
NiceComparable k => MemOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) #
NiceComparable k => GetOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (Map k v) # type GetOpValHs (Map k v) #
NiceComparable k => IterOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) #
NiceComparable k => MapOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Map k v) # type MapOpResHs (Map k v) :: Type -> Type #
SizeOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic
NiceComparable k => UpdOpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Map k v) # type UpdOpParamsHs (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
(key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (Map key' value') name key value
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key' value') name key value #
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 Val (Map k v)
Instance details Defined in Universum.Container.Class type Val (Map k v) = v
type Key (Map k v)
Instance details Defined in Universum.Container.Class type Key (Map k v) = k
type Element (Map k v)
Instance details Defined in Universum.Container.Class type Element (Map k v) = ElementDefault (Map k v)
type OneItem (Map k v)
Instance details Defined in Universum.Container.Class type OneItem (Map k v) = (k, v)
type ToT (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type TypeDocFieldDescriptions (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type MemOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) = k
type GetOpValHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (Map k v) = v
type GetOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) = k
type IterOpElHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) = (k, v)
type MapOpInpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) = (k, v)
type MapOpResHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Map k v) = Map k
type UpdOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) = k
type UpdOpParamsHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Map k v) = Maybe v

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

data Set a #

A set of values a.

Instances

Instances details

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 #
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)] #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
(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 => 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 #
(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 #
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 => 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 #
NFData a => NFData (Set a)
Instance details Defined in Data.Set.Internal Methods rnf :: Set a -> () #
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 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 => Wrapped (Set a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Set a) # Methods _Wrapped' :: Iso' (Set a) (Unwrapped (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 # maximum :: Set v -> Element (Set v) # minimum :: Set v -> Element (Set v) # 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 # foldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # foldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # 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)) #
One (Set v)
Instance details Defined in Universum.Container.Class Associated Types type OneItem (Set v) # Methods one :: OneItem (Set v) -> Set v #
KnownIsoT v => HasAnnotation (Set v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v))
PolyCTypeHasDocC '[a] => TypeHasDoc (Set a)
Instance details Defined in 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 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 #
NiceComparable e => MemOpHs (Set e)
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) #
NiceComparable e => IterOpHs (Set e)
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) #
SizeOpHs (Set a)
Instance details Defined in Lorentz.Polymorphic
NiceComparable a => UpdOpHs (Set a)
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Set a) # type UpdOpParamsHs (Set a) #
(t ~ Set a', Ord a) => Rewrapped (Set a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Set k1) -> Proxy (Set k2) -> () #
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 Element (Set v)
Instance details Defined in Universum.Container.Class type Element (Set v) = ElementDefault (Set v)
type OneItem (Set v)
Instance details Defined in Universum.Container.Class type OneItem (Set v) = v
type ToT (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type TypeDocFieldDescriptions (Set a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type MemOpKeyHs (Set e)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) = e
type IterOpElHs (Set e)
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Set e) = e
type UpdOpKeyHs (Set a)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) = a
type UpdOpParamsHs (Set a)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Set a) = Bool

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 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 Int8
Instance details Defined in Data.Default.Class Methods def :: Int8 #
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 Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
Default Ordering
Instance details Defined in Data.Default.Class Methods def :: Ordering #
Default Word
Instance details Defined in Data.Default.Class Methods def :: Word #
Default Word8
Instance details Defined in Data.Default.Class Methods def :: Word8 #
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 ()
Instance details Defined in Data.Default.Class Methods def :: () #
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 CShort
Instance details Defined in Data.Default.Class Methods def :: CShort #
Default CUShort
Instance details Defined in Data.Default.Class Methods def :: CUShort #
Default CInt
Instance details Defined in Data.Default.Class Methods def :: CInt #
Default CUInt
Instance details Defined in Data.Default.Class Methods def :: CUInt #
Default CLong
Instance details Defined in Data.Default.Class Methods def :: CLong #
Default CULong
Instance details Defined in Data.Default.Class Methods def :: CULong #
Default CLLong
Instance details Defined in Data.Default.Class Methods def :: CLLong #
Default CULLong
Instance details Defined in Data.Default.Class Methods def :: CULLong #
Default CFloat
Instance details Defined in Data.Default.Class Methods def :: CFloat #
Default CDouble
Instance details Defined in Data.Default.Class Methods def :: CDouble #
Default CPtrdiff
Instance details Defined in Data.Default.Class Methods def :: CPtrdiff #
Default CSize
Instance details Defined in Data.Default.Class Methods def :: CSize #
Default CSigAtomic
Instance details Defined in Data.Default.Class Methods def :: CSigAtomic #
Default CClock
Instance details Defined in Data.Default.Class Methods def :: CClock #
Default CTime
Instance details Defined in Data.Default.Class Methods def :: CTime #
Default CUSeconds
Instance details Defined in Data.Default.Class Methods def :: CUSeconds #
Default CSUSeconds
Instance details Defined in Data.Default.Class Methods def :: CSUSeconds #
Default CIntPtr
Instance details Defined in Data.Default.Class Methods def :: CIntPtr #
Default CUIntPtr
Instance details Defined in Data.Default.Class Methods def :: CUIntPtr #
Default CIntMax
Instance details Defined in Data.Default.Class Methods def :: CIntMax #
Default CUIntMax
Instance details Defined in Data.Default.Class Methods def :: CUIntMax #
Default OptimizerConf
Instance details Defined in Michelson.Optimizer Methods def :: OptimizerConf #
Default MorleyLogs
Instance details Defined in Michelson.Interpret Methods def :: MorleyLogs #
Default EntriesOrder
Instance details Defined in Michelson.Untyped.Contract Methods def :: EntriesOrder #
Default InstrCallStack
Instance details Defined in Michelson.ErrorPos Methods def :: InstrCallStack #
Default Pos
Instance details Defined in Michelson.ErrorPos Methods def :: Pos #
Default SrcPos
Instance details Defined in Michelson.ErrorPos Methods def :: SrcPos #
Default [a]
Instance details Defined in Data.Default.Class Methods def :: [a] #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe 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 #
(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 (Sum a)
Instance details Defined in Data.Default.Class Methods def :: Sum a #
Num a => Default (Product a)
Instance details Defined in Data.Default.Class Methods def :: Product a #
Default (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods def :: UStore a #
(KnownValue x, Default (MetaData xs)) => Default (MetaData (x ': xs)) Source #
Instance details Defined in Indigo.Internal.State Methods def :: MetaData (x ': xs) #
Default (MetaData ('[] :: [Type])) Source #
Instance details Defined in Indigo.Internal.State Methods def :: MetaData '[] #
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 (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
Default (k \|~> v)
Instance details Defined in Lorentz.UStore.Types Methods def :: k \|~> v #
Default (Annotation tag)
Instance details Defined in Michelson.Untyped.Annotation Methods def :: Annotation tag #
(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) #

argDef :: forall (name :: Symbol) a. Name name -> a -> (name :? a) -> a #

A variation of arg for optional arguments. Requires a default value to handle the case when the optional argument was omitted:

fn (argDef #answer 42 -> ans) = ...

In case you want to get a value wrapped in Maybe instead, use argF or ArgF.

argF :: forall (name :: Symbol) f a. Name name -> NamedF f a name -> f a #

argF is similar to arg: it unwraps a named parameter with the specified name. The difference is that the result of argF is inside an arity wrapper, which is Identity for normal parameters and Maybe for optional parameters.

arg :: forall (name :: Symbol) a. Name name -> (name :! a) -> a #

arg unwraps a named parameter with the specified name. One way to use it is to match on arguments with -XViewPatterns:

fn (arg #t -> t) (arg #f -> f) = ...

This way, the names of parameters can be inferred from the patterns: no type signature for fn is required. In case a type signature for fn is provided, the parameters must come in the same order:

fn :: "t" :! Integer -> "f" :! Integer -> ...
fn (arg #t -> t) (arg #f -> f) = ... -- ok
fn (arg #f -> f) (arg #t -> t) = ... -- does not typecheck

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

Infix notation for the type of a named parameter.

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

Infix notation for the type of an optional named parameter.

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) #
Eq (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f '[] -> Rec f '[] -> Bool # (/=) :: Rec f '[] -> Rec f '[] -> 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 #
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 (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) #
(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 #
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 (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) #
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 (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) #
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 (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) #
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 () #
(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 () #
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 '[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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x1, x2]) = (f x1, f x2)
type IsoRecTuple (Rec f '[x])
Instance details Defined in Util.TypeTuple.Instances type IsoRecTuple (Rec f '[x]) = f x
type IsoRecTuple (Rec f ('[] :: [u]))
Instance details Defined in Util.TypeTuple.Instances type IsoRecTuple (Rec f ('[] :: [u])) = ()

constructStack :: forall dt (fields :: [Type]) (st :: [Type]). (InstrConstructC dt, ToTs fields ~ ToTs (ConstructorFieldTypes dt), KnownList fields) => (fields ++ st) :-> (dt & st) #

deconstruct :: forall dt (fields :: [Type]) (st :: [Type]). (InstrDeconstructC dt, KnownList fields, ToTs fields ~ ToTs (ConstructorFieldTypes dt)) => (dt & st) :-> (fields ++ st) #

fieldCtor :: forall (st :: [Type]) f. HasCallStack => (st :-> (f & st)) -> FieldConstructor st f #

getField :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> (GetFieldType dt name & (dt ': st)) #

getFieldNamed :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> ((name :! GetFieldType dt name) & (dt ': st)) #

modifyField :: forall dt (name :: Symbol) (st :: [Type]). (InstrGetFieldC dt name, InstrSetFieldC dt name) => Label name -> (forall (st0 :: [Type]). (GetFieldType dt name ': st0) :-> (GetFieldType dt name ': st0)) -> (dt & st) :-> (dt & st) #

toField :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> (GetFieldType dt name & st) #

toFieldNamed :: forall dt (name :: Symbol) (st :: [Type]). InstrGetFieldC dt name => Label name -> (dt & st) :-> ((name :! GetFieldType dt name) & st) #

unwrapUnsafe_ :: forall dt (name :: Symbol) (st :: [Type]). InstrUnwrapC dt name => Label name -> (dt & st) :-> (CtorOnlyField name dt ': st) #

wrap_ :: forall dt (name :: Symbol) (st :: [Type]). InstrWrapC dt name => Label name -> AppendCtorField (GetCtorField dt name) st :-> (dt & st) #

type (:=) (n :: Symbol) ty = 'NamedField n ty #

class CaseArrow (name :: Symbol) body clause | clause -> name, clause -> body where #

Methods

(/->) :: Label name -> body -> clause #

Instances

Instances details

(name ~ name', body ~ ((arg ': inp) :-> out)) => CaseArrow name' body (CaseClauseU inp out '(name, arg))
Instance details Defined in Lorentz.UParam Methods (/->) :: Label name' -> body -> CaseClauseU inp out '(name, arg) #
(name ~ AppendSymbol "c" ctor, body ~ (AppendCtorField x inp :-> out)) => CaseArrow name body (CaseClauseL inp out ('CaseClauseParam ctor x))
Instance details Defined in Lorentz.ADT Methods (/->) :: Label name -> body -> CaseClauseL inp out ('CaseClauseParam ctor x) #
(name ~ AppendSymbol "c" ctor, KnownValue x) => CaseArrow name (Var x -> IndigoAnyOut x ret) (IndigoCaseClauseL ret ('CaseClauseParam ctor ('OneField x))) Source #
Instance details Defined in Indigo.Backend.Case Methods (/->) :: Label name -> (Var x -> IndigoAnyOut x ret) -> IndigoCaseClauseL ret ('CaseClauseParam ctor ('OneField x)) #

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

Constructors

CaseClauseL :: forall (x :: CtorField) (inp :: [Type]) (out :: [Type]) (ctor :: Symbol). (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))
Instance details Defined in Lorentz.ADT Methods (/->) :: Label name -> body -> CaseClauseL inp out ('CaseClauseParam ctor x) #

type CaseTC dt (out :: [Type]) (inp :: [Type]) clauses = (InstrCaseC dt, RMap (CaseClauses dt), RecFromTuple clauses, clauses ~ Rec (CaseClauseL inp out) (CaseClauses dt)) #

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

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

Equations

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

data NamedField #

Constructors

NamedField Symbol Type

type ConstructorFieldTypes dt = GFieldTypes (Rep dt) #

type InstrConstructC dt = (GenericIsoValue dt, GInstrConstruct (Rep dt)) #

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

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)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (i1 :-> o1) -> Proxy (i2 :-> o2) -> () #
Eq (inp :-> out)
Instance details Defined in Lorentz.Base Methods (==) :: (inp :-> out) -> (inp :-> out) -> Bool # (/=) :: (inp :-> out) -> (inp :-> out) -> Bool #
Show (inp :-> out)
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> (inp :-> out) -> ShowS # show :: (inp :-> out) -> String # showList :: [inp :-> out] -> ShowS #
Semigroup (s :-> s)
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 #
Monoid (s :-> s)
Instance details Defined in Lorentz.Base Methods mempty :: s :-> s # mappend :: (s :-> s) -> (s :-> s) -> s :-> s # mconcat :: [s :-> s] -> s :-> s #
MapLorentzInstr (i :-> o)
Instance details Defined in Lorentz.Base Methods mapLorentzInstr :: (forall (i0 :: [Type]) (o0 :: [Type]). (i0 :-> o0) -> i0 :-> o0) -> (i :-> o) -> i :-> o #
(i ~ (MUStore oldTempl newTempl diff touched ': s), o ~ (MUStore oldTempl newTempl ('[] :: [DiffItem]) touched ': s), RequireEmptyDiff diff) => MigrationFinishCheckPosition (i :-> o)
Instance details Defined in Lorentz.UStore.Migration.Blocks Methods migrationFinish :: i :-> o
type ToT (inp :-> out)
Instance details Defined in Lorentz.Zip type ToT (inp :-> out) = 'TLambda (ToT (ZippedStack inp)) (ToT (ZippedStack out))
type TypeDocFieldDescriptions (i :-> o)
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (i :-> o) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

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 Util.Label Methods fromLabel :: Label name #
Eq (Label name)
Instance details Defined in Util.Label Methods (==) :: Label name -> Label name -> Bool # (/=) :: Label name -> Label name -> Bool #
Show (Label name)
Instance details Defined in Util.Label Methods showsPrec :: Int -> Label name -> ShowS # show :: Label name -> String # showList :: [Label name] -> ShowS #
Buildable (Label name)
Instance details Defined in Util.Label Methods build :: Label name -> Builder #

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

class HasAnnotation a #

Instances

Instances details

HasAnnotation Bool
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool)
HasAnnotation Integer
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer)
HasAnnotation Natural
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural)
HasAnnotation ()
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ())
HasAnnotation ByteString
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString)
HasAnnotation Address
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Address)
HasAnnotation EpAddress
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress)
HasAnnotation KeyHash
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT KeyHash)
HasAnnotation MText
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText)
HasAnnotation Mutez
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Mutez)
HasAnnotation Operation
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Operation)
HasAnnotation PublicKey
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT PublicKey)
HasAnnotation Signature
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Signature)
HasAnnotation Timestamp
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Timestamp)
HasAnnotation a => HasAnnotation [a]
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT [a])
HasAnnotation a => HasAnnotation (Maybe a)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a))
KnownIsoT v => HasAnnotation (Set v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v))
HasAnnotation a => HasAnnotation (ContractRef a)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a))
HasAnnotation (FutureContract a)
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a))
HasAnnotation (UParam entries)
Instance details Defined in Lorentz.UParam Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UParam entries))
HasAnnotation (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UStore a))
(HasAnnotation a, HasAnnotation b) => HasAnnotation (a, b)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b))
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v))
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMap k v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMap k v))
HasAnnotation (TAddress p)
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TAddress p))
(HasAnnotation a, HasAnnotation r) => HasAnnotation (View a r)
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (View a r))
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Void_ a b)
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Void_ a b))
HasAnnotation (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (MigrationScript oldStore newStore))
(HasAnnotation a, HasAnnotation b, HasAnnotation c) => HasAnnotation (a, b, c)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c))
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name))
(HasAnnotation a, KnownSymbol name) => HasAnnotation (NamedF Identity a name)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Identity a name))
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d) => HasAnnotation (a, b, c, d)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d))
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e) => HasAnnotation (a, b, c, d, e)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e))
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e, HasAnnotation f) => HasAnnotation (a, b, c, d, e, f)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e, f))
(HasAnnotation a, HasAnnotation b, HasAnnotation c, HasAnnotation d, HasAnnotation e, HasAnnotation f, HasAnnotation g) => HasAnnotation (a, b, c, d, e, f, g)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (a, b, c, d, e, f, g))

type family ToT a :: T #

Instances

Instances details

type ToT Bool
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
type ToT Integer
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type ToT Natural
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type ToT ()
Instance details Defined in Michelson.Typed.Haskell.Value type ToT () = GValueType (Rep ())
type ToT ByteString
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes
type ToT Text
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Text = ToT MText
type ToT Address
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Address = 'TAddress
type ToT EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress
type ToT KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value type ToT KeyHash = 'TKeyHash
type ToT MText
Instance details Defined in Michelson.Typed.Haskell.Value type ToT MText = 'TString
type ToT Mutez
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Mutez = 'TMutez
type ToT Operation
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Operation = 'TOperation
type ToT PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value type ToT PublicKey = 'TKey
type ToT Signature
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Signature = 'TSignature
type ToT Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Timestamp = 'TTimestamp
type ToT UnspecifiedError
Instance details Defined in Lorentz.Errors type ToT UnspecifiedError = GValueType (Rep UnspecifiedError)
type ToT ChainId
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ChainId = 'TChainId
type ToT MyNatural
Instance details Defined in Lorentz.UStore.Instr type ToT MyNatural = ToT Natural
type ToT MyType2
Instance details Defined in Michelson.Typed.Haskell.Instr.Product type ToT MyType2 = GValueType (Rep MyType2)
type ToT MyCompoundType
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum type ToT MyCompoundType = GValueType (Rep MyCompoundType)
type ToT MyEnum
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum type ToT MyEnum = GValueType (Rep MyEnum)
type ToT MyType
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum type ToT MyType = GValueType (Rep MyType)
type ToT MyType'
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum type ToT MyType' = GValueType (Rep MyType')
type ToT MyTypeWithNamedField
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum type ToT MyTypeWithNamedField = GValueType (Rep MyTypeWithNamedField)
type ToT [a]
Instance details Defined in Michelson.Typed.Haskell.Value type ToT [a] = 'TList (ToT a)
type ToT (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type ToT (Identity a)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Identity a) = ToT a
type ToT (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type ToT (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)
type ToT (FutureContract arg)
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress
type ToT (ShouldHaveEntrypoints r)
Instance details Defined in Lorentz.Entrypoints.Helpers type ToT (ShouldHaveEntrypoints r) = GValueType (Rep (ShouldHaveEntrypoints r))
type ToT (CustomError tag)
Instance details Defined in Lorentz.Errors type ToT (CustomError tag) = ToT (MText, ErrorArg tag)
type ToT (VoidResult r)
Instance details Defined in Lorentz.Macro type ToT (VoidResult r) = TypeError ('Text "No IsoValue instance for VoidResult " :<>: 'ShowType r) :: T
type ToT (UParam entries)
Instance details Defined in Lorentz.UParam type ToT (UParam entries) = GValueType (Rep (UParam entries))
type ToT (UStore a)
Instance details Defined in Lorentz.UStore.Types type ToT (UStore a) = ToT (BigMap ByteString ByteString)
type ToT (Either l r)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Either l r) = GValueType (Rep (Either l r))
type ToT (a, b)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b) = GValueType (Rep (a, b))
type ToT (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type ToT (inp :-> out)
Instance details Defined in Lorentz.Zip type ToT (inp :-> out) = 'TLambda (ToT (ZippedStack inp)) (ToT (ZippedStack out))
type ToT (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (BigMap k v) = 'TBigMap (ToT k) (ToT v)
type ToT (TAddress p)
Instance details Defined in Lorentz.Address type ToT (TAddress p) = GValueType (Rep (TAddress p))
type ToT (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type ToT (ParameterWrapper deriv cp) = GValueType (Rep (ParameterWrapper deriv cp))
type ToT (View a r)
Instance details Defined in Lorentz.Macro type ToT (View a r) = GValueType (Rep (View a r))
type ToT (Void_ a r)
Instance details Defined in Lorentz.Macro type ToT (Void_ a r) = GValueType (Rep (Void_ a r))
type ToT (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type ToT (MigrationScript oldStore newStore) = GValueType (Rep (MigrationScript oldStore newStore))
type ToT (a, b, c)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b, c) = GValueType (Rep (a, b, c))
type ToT (NamedF Maybe a name)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)
type ToT (NamedF Identity a name)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (NamedF Identity a name) = ToT (Identity a)
type ToT (a, b, c, d)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b, c, d) = GValueType (Rep (a, b, c, d))
type ToT (MUStore oldTemplate newTemplate remDiff touched)
Instance details Defined in Lorentz.UStore.Migration.Base type ToT (MUStore oldTemplate newTemplate remDiff touched) = GValueType (Rep (MUStore oldTemplate newTemplate remDiff touched))
type ToT (a, b, c, d, e)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e) = GValueType (Rep (a, b, c, d, e))
type ToT (a, b, c, d, e, f)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e, f) = GValueType (Rep (a, b, c, d, e, f))
type ToT (a, b, c, d, e, f, g)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (a, b, c, d, e, f, g) = GValueType (Rep (a, b, c, d, e, f, g))

data Address #

Instances

Instances details

Eq Address
Instance details Defined in Tezos.Address Methods (==) :: Address -> Address -> Bool # (/=) :: Address -> Address -> Bool #
Ord Address
Instance details Defined in Tezos.Address Methods compare :: Address -> Address -> Ordering # (<) :: Address -> Address -> Bool # (<=) :: Address -> Address -> Bool # (>) :: Address -> Address -> Bool # (>=) :: Address -> Address -> Bool # max :: Address -> Address -> Address # min :: Address -> Address -> Address #
Show Address
Instance details Defined in Tezos.Address Methods showsPrec :: Int -> Address -> ShowS # show :: Address -> String # showList :: [Address] -> ShowS #
Generic Address
Instance details Defined in Tezos.Address Associated Types type Rep Address :: Type -> Type # Methods from :: Address -> Rep Address x # to :: Rep Address x -> Address #
Arbitrary Address
Instance details Defined in Tezos.Address Methods arbitrary :: Gen Address # shrink :: Address -> [Address] #
ToJSON Address
Instance details Defined in Tezos.Address Methods toJSON :: Address -> Value # toEncoding :: Address -> Encoding # toJSONList :: [Address] -> Value # toEncodingList :: [Address] -> Encoding #
ToJSONKey Address
Instance details Defined in Tezos.Address Methods toJSONKey :: ToJSONKeyFunction Address # toJSONKeyList :: ToJSONKeyFunction [Address] #
FromJSON Address
Instance details Defined in Tezos.Address Methods parseJSON :: Value -> Parser Address # parseJSONList :: Value -> Parser [Address] #
FromJSONKey Address
Instance details Defined in Tezos.Address Methods fromJSONKey :: FromJSONKeyFunction Address # fromJSONKeyList :: FromJSONKeyFunction [Address] #
NFData Address
Instance details Defined in Tezos.Address Methods rnf :: Address -> () #
Buildable Address
Instance details Defined in Tezos.Address Methods build :: Address -> Builder #
HasAnnotation Address
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Address)
TypeHasDoc Address
Instance details Defined in 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 #
IsoValue Address
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
ToAddress Address
Instance details Defined in Lorentz.Address Methods toAddress :: Address -> Address #
HasCLReader Address
Instance details Defined in Tezos.Address Methods getReader :: ReadM Address getMetavar :: String
FromContractRef cp Address
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> Address #
ToTAddress cp Address
Instance details Defined in Lorentz.Address Methods toTAddress :: Address -> TAddress cp #
CanCastTo Address (TAddress p :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p) -> () #
CanCastTo (TAddress p :: Type) Address
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p) -> Proxy Address -> () #
type Rep Address
Instance details Defined in Tezos.Address type Rep Address = D1 ('MetaData "Address" "Tezos.Address" "morley-1.6.0-inplace" 'False) (C1 ('MetaCons "KeyAddress" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 KeyHash)) :+: C1 ('MetaCons "ContractAddress" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ContractHash)))
type ToT Address
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Address = 'TAddress
type TypeDocFieldDescriptions Address
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Address = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

newtype BigMap k v #

Constructors

BigMap
Fields unBigMap :: Map k v

Instances

Instances details

MapInstrs BigMap
Instance details Defined in Lorentz.Macro Methods mapUpdate :: forall k v (s :: [Type]). NiceComparable k => (k ': (Maybe v ': (BigMap k v ': s))) :-> (BigMap k v ': s) mapInsert :: forall k v (s :: [Type]). NiceComparable k => (k ': (v ': (BigMap k v ': s))) :-> (BigMap k v ': s) mapInsertNew :: forall k e v (s :: [Type]). (NiceComparable k, KnownValue e) => (forall (s0 :: [Type]). (k ': s0) :-> (e ': s0)) -> (k ': (v ': (BigMap k v ': s))) :-> (BigMap k v ': s) deleteMap :: forall k v (s :: [Type]). (NiceComparable k, KnownValue v) => (k ': (BigMap k v ': s)) :-> (BigMap k v ': s)
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (BigMap k1 v1 :: Type) (BigMap k2 v2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (BigMap k1 v1) -> Proxy (BigMap k2 v2) -> () #
(Eq k, Eq v) => Eq (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods (==) :: BigMap k v -> BigMap k v -> Bool # (/=) :: BigMap k v -> BigMap k v -> Bool #
(Show k, Show v) => Show (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMap k v -> ShowS # show :: BigMap k v -> String # showList :: [BigMap k v] -> ShowS #
Ord k => Semigroup (BigMap k v)
Instance details Defined in 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 #
Ord k => Monoid (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods mempty :: BigMap k v # mappend :: BigMap k v -> BigMap k v -> BigMap k v # mconcat :: [BigMap k v] -> BigMap k v #
(WellTypedToT k, WellTypedToT v, Comparable (ToT k), Arbitrary k, Arbitrary v, Ord k) => Arbitrary (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods arbitrary :: Gen (BigMap k v) # shrink :: BigMap k v -> [BigMap k v] #
Default (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMap k v)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMap k v))
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (BigMap k v)
Instance details Defined in 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) #
(WellTypedToT k, WellTypedToT v, Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (BigMap k v)
Instance details Defined in 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 #
NiceComparable k => MemOpHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (BigMap k v) #
NiceComparable k => GetOpHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (BigMap k v) # type GetOpValHs (BigMap k v) #
NiceComparable k => UpdOpHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (BigMap k v) # type UpdOpParamsHs (BigMap k v) #
(key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (BigMap key' value') name key value
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key' value') name key value #
type ToT (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (BigMap k v) = 'TBigMap (ToT k) (ToT v)
type TypeDocFieldDescriptions (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (BigMap k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type MemOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (BigMap k v) = k
type GetOpValHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (BigMap k v) = v
type GetOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (BigMap k v) = k
type UpdOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (BigMap k v) = k
type UpdOpParamsHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (BigMap k v) = Maybe v

data ContractRef arg #

Constructors

ContractRef
Fields crAddress :: Address crEntrypoint :: SomeEntrypointCall arg

Instances

Instances details

cp ~ cp' => ToContractRef cp (ContractRef cp')
Instance details Defined in Lorentz.Address Methods toContractRef :: ContractRef cp' -> ContractRef cp #
cp ~ cp' => FromContractRef cp (ContractRef cp')
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> ContractRef cp' #
Eq (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
Show (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
WellTypedToT arg => Buildable (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods build :: ContractRef arg -> Builder #
HasAnnotation a => HasAnnotation (ContractRef a)
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a))
PolyTypeHasDocC '[cp] => TypeHasDoc (ContractRef cp)
Instance details Defined in 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) #
WellTypedToT arg => IsoValue (ContractRef arg)
Instance details Defined in 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 #
ToAddress (ContractRef cp)
Instance details Defined in Lorentz.Address Methods toAddress :: ContractRef cp -> Address #
CanCastTo a1 a2 => CanCastTo (ContractRef a1 :: Type) (ContractRef a2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ContractRef a1) -> Proxy (ContractRef a2) -> () #
type ToT (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)
type TypeDocFieldDescriptions (ContractRef cp)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data EpAddress #

Constructors

EpAddress
Fields eaAddress :: Address eaEntrypoint :: EpName

Instances

Instances details

Eq EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Ord EpAddress
Instance details Defined in 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 #
Show EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
Generic EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Associated Types type Rep EpAddress :: Type -> Type # Methods from :: EpAddress -> Rep EpAddress x # to :: Rep EpAddress x -> EpAddress #
Arbitrary FieldAnn => Arbitrary EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Methods arbitrary :: Gen EpAddress # shrink :: EpAddress -> [EpAddress] #
NFData EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Methods rnf :: EpAddress -> () #
Buildable EpAddress
Instance details Defined in Michelson.Typed.Entrypoints Methods build :: EpAddress -> Builder #
HasAnnotation EpAddress
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress)
TypeHasDoc EpAddress
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
ToAddress EpAddress
Instance details Defined in Lorentz.Address Methods toAddress :: EpAddress -> Address #
FromContractRef cp EpAddress
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> EpAddress #
CanCastTo (FutureContract p :: Type) EpAddress
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () #
type Rep EpAddress
Instance details Defined in Michelson.Typed.Entrypoints type Rep EpAddress = D1 ('MetaData "EpAddress" "Michelson.Typed.Entrypoints" "morley-1.6.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 ToT EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress
type TypeDocFieldDescriptions EpAddress
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data KeyHash #

Instances

Instances details

Eq KeyHash
Instance details Defined in Tezos.Crypto Methods (==) :: KeyHash -> KeyHash -> Bool # (/=) :: KeyHash -> KeyHash -> Bool #
Ord KeyHash
Instance details Defined in Tezos.Crypto Methods compare :: KeyHash -> KeyHash -> Ordering # (<) :: KeyHash -> KeyHash -> Bool # (<=) :: KeyHash -> KeyHash -> Bool # (>) :: KeyHash -> KeyHash -> Bool # (>=) :: KeyHash -> KeyHash -> Bool # max :: KeyHash -> KeyHash -> KeyHash # min :: KeyHash -> KeyHash -> KeyHash #
Show KeyHash
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> KeyHash -> ShowS # show :: KeyHash -> String # showList :: [KeyHash] -> ShowS #
Generic KeyHash
Instance details Defined in Tezos.Crypto Associated Types type Rep KeyHash :: Type -> Type # Methods from :: KeyHash -> Rep KeyHash x # to :: Rep KeyHash x -> KeyHash #
Arbitrary KeyHash
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen KeyHash # shrink :: KeyHash -> [KeyHash] #
ToJSON KeyHash
Instance details Defined in Tezos.Crypto Methods toJSON :: KeyHash -> Value # toEncoding :: KeyHash -> Encoding # toJSONList :: [KeyHash] -> Value # toEncodingList :: [KeyHash] -> Encoding #
FromJSON KeyHash
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser KeyHash # parseJSONList :: Value -> Parser [KeyHash] #
NFData KeyHash
Instance details Defined in Tezos.Crypto Methods rnf :: KeyHash -> () #
Buildable KeyHash
Instance details Defined in Tezos.Crypto Methods build :: KeyHash -> Builder #
HasAnnotation KeyHash
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT KeyHash)
TypeHasDoc KeyHash
Instance details Defined in 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 #
IsoValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
HasCLReader KeyHash
Instance details Defined in Tezos.Crypto Methods getReader :: ReadM KeyHash getMetavar :: String
type Rep KeyHash
Instance details Defined in Tezos.Crypto type Rep KeyHash = D1 ('MetaData "KeyHash" "Tezos.Crypto" "morley-1.6.0-inplace" 'False) (C1 ('MetaCons "KeyHash" 'PrefixI 'True) (S1 ('MetaSel ('Just "khTag") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 KeyHashTag) :*: S1 ('MetaSel ('Just "khBytes") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ByteString)))
type ToT KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value type ToT KeyHash = 'TKeyHash
type TypeDocFieldDescriptions KeyHash
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions KeyHash = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data MText #

Instances

Instances details

Eq MText
Instance details Defined in Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Data MText
Instance details Defined in 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 #
Ord MText
Instance details Defined in 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 #
Show MText
Instance details Defined in Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
(TypeError ('Text "There is no instance defined for (IsString MText)" :$$: 'Text "Consider using QuasiQuotes: `[mt\|some text...\|]`") :: Constraint) => IsString MText
Instance details Defined in Michelson.Text Methods fromString :: String -> MText #
Generic MText
Instance details Defined in Michelson.Text Associated Types type Rep MText :: Type -> Type # Methods from :: MText -> Rep MText x # to :: Rep MText x -> MText #
Semigroup MText
Instance details Defined in Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Monoid MText
Instance details Defined in Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Arbitrary MText
Instance details Defined in Michelson.Text Methods arbitrary :: Gen MText # shrink :: MText -> [MText] #
Hashable MText
Instance details Defined in Michelson.Text Methods hashWithSalt :: Int -> MText -> Int # hash :: MText -> Int #
ToJSON MText
Instance details Defined in Michelson.Text Methods toJSON :: MText -> Value # toEncoding :: MText -> Encoding # toJSONList :: [MText] -> Value # toEncodingList :: [MText] -> Encoding #
FromJSON MText
Instance details Defined in Michelson.Text Methods parseJSON :: Value -> Parser MText # parseJSONList :: Value -> Parser [MText] #
NFData MText
Instance details Defined in Michelson.Text Methods rnf :: MText -> () #
Buildable MText
Instance details Defined in Michelson.Text Methods build :: MText -> Builder #
ToText MText
Instance details Defined in Michelson.Text Methods toText :: MText -> Text #
Container MText
Instance details Defined in 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 # maximum :: MText -> Element MText # minimum :: MText -> Element MText # foldMap :: Monoid m => (Element MText -> m) -> MText -> m # fold :: MText -> Element MText # foldr' :: (Element MText -> b -> b) -> b -> MText -> b # foldr1 :: (Element MText -> Element MText -> Element MText) -> MText -> Element MText # foldl1 :: (Element MText -> Element MText -> Element MText) -> MText -> Element MText # 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) #
HasAnnotation MText
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText)
TypeHasDoc MText
Instance details Defined in 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 #
ErrorHasDoc MText
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements MText # Methods errorDocName :: Text # errorDocMdCause :: Markdown # errorDocMdCauseInEntrypoint :: Markdown # errorDocHaskellRep :: Markdown # errorDocClass :: ErrorClass # errorDocDependencies :: [SomeDocDefinitionItem] # errorDocRequirements :: Dict (ErrorRequirements MText) #
IsError MText
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text MText #
IsoValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
ConcatOpHs MText
Instance details Defined in Lorentz.Polymorphic
SizeOpHs MText
Instance details Defined in Lorentz.Polymorphic
SliceOpHs MText
Instance details Defined in Lorentz.Polymorphic
HasCLReader MText
Instance details Defined in Michelson.Text Methods getReader :: ReadM MText getMetavar :: String
type Rep MText
Instance details Defined in Michelson.Text type Rep MText = D1 ('MetaData "MText" "Michelson.Text" "morley-1.6.0-inplace" 'True) (C1 ('MetaCons "MTextUnsafe" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMText") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Element MText
Instance details Defined in Michelson.Text type Element MText = Element Text
type ToT MText
Instance details Defined in Michelson.Typed.Haskell.Value type ToT MText = 'TString
type TypeDocFieldDescriptions MText
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ErrorRequirements MText
Instance details Defined in Lorentz.Errors type ErrorRequirements MText = ()

data Mutez #

Instances

Instances details

Bounded Mutez
Instance details Defined in Tezos.Core Methods minBound :: Mutez # maxBound :: Mutez #
Enum Mutez
Instance details Defined in 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] #
Eq Mutez
Instance details Defined in Tezos.Core Methods (==) :: Mutez -> Mutez -> Bool # (/=) :: Mutez -> Mutez -> Bool #
Data Mutez
Instance details Defined in Tezos.Core Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Mutez -> c Mutez # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Mutez # toConstr :: Mutez -> Constr # dataTypeOf :: Mutez -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Mutez) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Mutez) # gmapT :: (forall b. Data b => b -> b) -> Mutez -> Mutez # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Mutez -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Mutez -> r # gmapQ :: (forall d. Data d => d -> u) -> Mutez -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Mutez -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez #
Ord Mutez
Instance details Defined in 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 #
Show Mutez
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> Mutez -> ShowS # show :: Mutez -> String # showList :: [Mutez] -> ShowS #
Generic Mutez
Instance details Defined in Tezos.Core Associated Types type Rep Mutez :: Type -> Type # Methods from :: Mutez -> Rep Mutez x # to :: Rep Mutez x -> Mutez #
ToJSON Mutez
Instance details Defined in Tezos.Core Methods toJSON :: Mutez -> Value # toEncoding :: Mutez -> Encoding # toJSONList :: [Mutez] -> Value # toEncodingList :: [Mutez] -> Encoding #
FromJSON Mutez
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser Mutez # parseJSONList :: Value -> Parser [Mutez] #
NFData Mutez
Instance details Defined in Tezos.Core Methods rnf :: Mutez -> () #
Buildable Mutez
Instance details Defined in Tezos.Core Methods build :: Mutez -> Builder #
HasAnnotation Mutez
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Mutez)
TypeHasDoc Mutez
Instance details Defined in 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 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 Tezos.Core Methods getReader :: ReadM Mutez getMetavar :: String
EDivOpHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural # type EModOpResHs Mutez Natural #
EDivOpHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Mutez # type EModOpResHs Mutez Mutez #
ArithOpHs Add Mutez Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Mutez Mutez #
ArithOpHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez #
ArithOpHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural #
ArithOpHs Sub Mutez Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Mutez Mutez #
type Rep Mutez
Instance details Defined in Tezos.Core type Rep Mutez = D1 ('MetaData "Mutez" "Tezos.Core" "morley-1.6.0-inplace" 'True) (C1 ('MetaCons "Mutez" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMutez") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Word64)))
type ToT Mutez
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Mutez = 'TMutez
type TypeDocFieldDescriptions Mutez
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Mutez = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type EDivOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EDivOpResHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Mutez = Natural
type EModOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type EModOpResHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Mutez = Mutez
type ArithResHs Add Mutez Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Add Mutez Mutez = Mutez
type ArithResHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez
type ArithResHs Sub Mutez Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Sub Mutez Mutez = Mutez

type Operation = Operation' Instr #

data PublicKey #

Instances

Instances details

Eq PublicKey
Instance details Defined in Tezos.Crypto Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Show PublicKey
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Generic PublicKey
Instance details Defined in Tezos.Crypto Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Arbitrary PublicKey
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen PublicKey # shrink :: PublicKey -> [PublicKey] #
ToJSON PublicKey
Instance details Defined in Tezos.Crypto Methods toJSON :: PublicKey -> Value # toEncoding :: PublicKey -> Encoding # toJSONList :: [PublicKey] -> Value # toEncodingList :: [PublicKey] -> Encoding #
FromJSON PublicKey
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser PublicKey # parseJSONList :: Value -> Parser [PublicKey] #
NFData PublicKey
Instance details Defined in Tezos.Crypto Methods rnf :: PublicKey -> () #
Buildable PublicKey
Instance details Defined in Tezos.Crypto Methods build :: PublicKey -> Builder #
HasAnnotation PublicKey
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT PublicKey)
TypeHasDoc PublicKey
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
type Rep PublicKey
Instance details Defined in Tezos.Crypto type Rep PublicKey = D1 ('MetaData "PublicKey" "Tezos.Crypto" "morley-1.6.0-inplace" 'False) (C1 ('MetaCons "PublicKeyEd25519" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (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))))
type ToT PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value type ToT PublicKey = 'TKey
type TypeDocFieldDescriptions PublicKey
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions PublicKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data Signature #

Instances

Instances details

Eq Signature
Instance details Defined in Tezos.Crypto Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Show Signature
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Generic Signature
Instance details Defined in Tezos.Crypto Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Arbitrary Signature
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen Signature # shrink :: Signature -> [Signature] #
ToJSON Signature
Instance details Defined in Tezos.Crypto Methods toJSON :: Signature -> Value # toEncoding :: Signature -> Encoding # toJSONList :: [Signature] -> Value # toEncodingList :: [Signature] -> Encoding #
FromJSON Signature
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser Signature # parseJSONList :: Value -> Parser [Signature] #
NFData Signature
Instance details Defined in Tezos.Crypto Methods rnf :: Signature -> () #
Buildable Signature
Instance details Defined in Tezos.Crypto Methods build :: Signature -> Builder #
HasAnnotation Signature
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Signature)
TypeHasDoc Signature
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
type Rep Signature
Instance details Defined in Tezos.Crypto type Rep Signature = D1 ('MetaData "Signature" "Tezos.Crypto" "morley-1.6.0-inplace" 'False) ((C1 ('MetaCons "SignatureEd25519" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (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 "SignatureGeneric" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ByteString))))
type ToT Signature
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Signature = 'TSignature
type TypeDocFieldDescriptions Signature
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Signature = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data Timestamp #

Instances

Instances details

Eq Timestamp
Instance details Defined in Tezos.Core Methods (==) :: Timestamp -> Timestamp -> Bool # (/=) :: Timestamp -> Timestamp -> Bool #
Data Timestamp
Instance details Defined in 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 #
Ord Timestamp
Instance details Defined in 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 #
Show Timestamp
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> Timestamp -> ShowS # show :: Timestamp -> String # showList :: [Timestamp] -> ShowS #
Generic Timestamp
Instance details Defined in Tezos.Core Associated Types type Rep Timestamp :: Type -> Type # Methods from :: Timestamp -> Rep Timestamp x # to :: Rep Timestamp x -> Timestamp #
ToJSON Timestamp
Instance details Defined in Tezos.Core Methods toJSON :: Timestamp -> Value # toEncoding :: Timestamp -> Encoding # toJSONList :: [Timestamp] -> Value # toEncodingList :: [Timestamp] -> Encoding #
FromJSON Timestamp
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser Timestamp # parseJSONList :: Value -> Parser [Timestamp] #
NFData Timestamp
Instance details Defined in Tezos.Core Methods rnf :: Timestamp -> () #
Buildable Timestamp
Instance details Defined in Tezos.Core Methods build :: Timestamp -> Builder #
HasAnnotation Timestamp
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Timestamp)
TypeHasDoc Timestamp
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
ArithOpHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp #
ArithOpHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer #
ArithOpHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer #
ArithOpHs Sub Timestamp Timestamp
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Timestamp #
type Rep Timestamp
Instance details Defined in Tezos.Core type Rep Timestamp = D1 ('MetaData "Timestamp" "Tezos.Core" "morley-1.6.0-inplace" 'True) (C1 ('MetaCons "Timestamp" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTimestamp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 POSIXTime)))
type ToT Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Timestamp = 'TTimestamp
type TypeDocFieldDescriptions Timestamp
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Timestamp = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ArithResHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Timestamp
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Timestamp = Integer

class (ArithOp aop (ToT n) (ToT m), NiceComparable n, NiceComparable m, ToT (ArithResHs aop n m) ~ ArithRes aop (ToT n) (ToT m)) => ArithOpHs aop n m #

Associated Types

type ArithResHs aop n m #

Instances

Instances details

ArithOpHs Add Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Integer #
ArithOpHs Add Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural #
ArithOpHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp #
ArithOpHs Add Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer #
ArithOpHs Add Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Natural #
ArithOpHs Add Mutez Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Mutez Mutez #
ArithOpHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer #
ArithOpHs And Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Bool Bool #
ArithOpHs And Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural #
ArithOpHs And Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Natural Natural #
ArithOpHs Lsl Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsl Natural Natural #
ArithOpHs Lsr Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsr Natural Natural #
ArithOpHs Mul Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Integer #
ArithOpHs Mul Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural #
ArithOpHs Mul Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer #
ArithOpHs Mul Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Natural #
ArithOpHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez #
ArithOpHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural #
ArithOpHs Or Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Bool Bool #
ArithOpHs Or Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Natural Natural #
ArithOpHs Sub Integer Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Integer #
ArithOpHs Sub Integer Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural #
ArithOpHs Sub Natural Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer #
ArithOpHs Sub Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Natural #
ArithOpHs Sub Mutez Mutez
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Mutez Mutez #
ArithOpHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer #
ArithOpHs Sub Timestamp Timestamp
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Timestamp #
ArithOpHs Xor Bool Bool
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Bool Bool #
ArithOpHs Xor Natural Natural
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Natural Natural #

type family ArithResHs aop n m #

Instances

Instances details

type ArithResHs Add Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Integer = Integer
type ArithResHs Add Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Integer Timestamp
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Natural = Natural
type ArithResHs Add Mutez Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Add Mutez Mutez = Mutez
type ArithResHs Add Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs And Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs And Bool Bool = Bool
type ArithResHs And Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Natural
type ArithResHs And Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs And Natural Natural = Natural
type ArithResHs Lsl Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Lsl Natural Natural = Natural
type ArithResHs Lsr Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Lsr Natural Natural = Natural
type ArithResHs Mul Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Integer = Integer
type ArithResHs Mul Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs Mul Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Natural = Natural
type ArithResHs Mul Natural Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez
type ArithResHs Or Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs Or Bool Bool = Bool
type ArithResHs Or Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Or Natural Natural = Natural
type ArithResHs Sub Integer Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Integer = Integer
type ArithResHs Sub Integer Natural
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Natural = Integer
type ArithResHs Sub Mutez Mutez
Instance details Defined in Lorentz.Arith type ArithResHs Sub Mutez Mutez = Mutez
type ArithResHs Sub Timestamp Integer
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Timestamp
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Timestamp = Integer
type ArithResHs Xor Bool Bool
Instance details Defined in Lorentz.Arith type ArithResHs Xor Bool Bool = Bool
type ArithResHs Xor Natural Natural
Instance details Defined in Lorentz.Arith type ArithResHs Xor Natural Natural = Natural

class (UnaryArithOp aop (ToT n), NiceComparable n, ToT (UnaryArithResHs aop n) ~ UnaryArithRes aop (ToT n)) => UnaryArithOpHs aop n #

Associated Types

type UnaryArithResHs aop n #

Instances

Instances details

UnaryArithOpHs Abs Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer #
UnaryArithOpHs Eq' Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer #
UnaryArithOpHs Ge Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer #
UnaryArithOpHs Gt Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer #
UnaryArithOpHs Le Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer #
UnaryArithOpHs Lt Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer #
UnaryArithOpHs Neg Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer #
UnaryArithOpHs Neg Natural
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural #
UnaryArithOpHs Neq Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer #
UnaryArithOpHs Not Bool
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool #
UnaryArithOpHs Not Integer
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer #
UnaryArithOpHs Not Natural
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural #

type family UnaryArithResHs aop n #

Instances

Instances details

type UnaryArithResHs Abs Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Eq' Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Ge Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type UnaryArithResHs Gt Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Lt Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Neg Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Neg Natural
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Neq Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Not Bool
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Bool = Bool
type UnaryArithResHs Not Integer
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer
type UnaryArithResHs Not Natural
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer

type NiceComparable n = (KnownValue n, Comparable (ToT n)) #

(#) :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]). (a :-> b) -> (b :-> c) -> a :-> c #

(##) :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]). (a :-> b) -> (b :-> c) -> a :-> c #

pattern FI :: (forall (out' :: [T]). Instr (ToTs inp) out') -> inp :-> out #

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

iAnyCode :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> Instr (ToTs inp) (ToTs out) #

iForceNotFail :: forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o #

iGenericIf :: forall (a :: [Type]) (b :: [Type]) (c :: [Type]) (s :: [Type]). (forall (s' :: [T]). Instr (ToTs a) s' -> Instr (ToTs b) s' -> Instr (ToTs c) s') -> (a :-> s) -> (b :-> s) -> c :-> s #

iMapAnyCode :: forall (i1 :: [Type]) (i2 :: [Type]) (o :: [Type]). (forall (o' :: [T]). Instr (ToTs i1) o' -> Instr (ToTs i2) o') -> (i1 :-> o) -> i2 :-> o #

iNonFailingCode :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => (inp :-> out) -> Instr (ToTs inp) (ToTs out) #

iWithVarAnnotations :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => [Text] -> (inp :-> out) -> inp :-> out #

optimizeLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> inp :-> out #

optimizeLorentzWithConf :: forall (inp :: [Type]) (out :: [Type]). OptimizerConf -> (inp :-> out) -> inp :-> out #

parseLorentzValue :: KnownValue v => Text -> Either ParseLorentzError v #

transformBytesLorentz :: forall (inp :: [Type]) (out :: [Type]). Bool -> (ByteString -> ByteString) -> (inp :-> out) -> inp :-> out #

transformStringsLorentz :: forall (inp :: [Type]) (out :: [Type]). Bool -> (MText -> MText) -> (inp :-> out) -> inp :-> out #

type (%>) = (:->) #

type ContractCode cp st = '[(cp, st)] :-> ContractOut st #

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

type Lambda i o = '[i] :-> '[o] #

class MapLorentzInstr instr where #

Methods

mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> instr -> instr #

Instances

Instances details

MapLorentzInstr (i :-> o)
Instance details Defined in Lorentz.Base Methods mapLorentzInstr :: (forall (i0 :: [Type]) (o0 :: [Type]). (i0 :-> o0) -> i0 :-> o0) -> (i :-> o) -> i :-> o #
MapLorentzInstr (UStoreMigration os ns)
Instance details Defined in Lorentz.UStore.Migration.Base Methods mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> UStoreMigration os ns -> UStoreMigration os ns #

data SomeContractCode where #

Constructors

SomeContractCode :: forall cp st. (NiceParameterFull cp, NiceStorage st) => ContractCode cp st -> SomeContractCode

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

type NiceStorage a = (HasAnnotation a, KnownValue a, ProperStorageBetterErrors (ToT a)) #

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

Instances

Instances details

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

allowCheckedCoerce :: forall k1 k2 (a :: k1) (b :: k2). Dict (CanCastTo a b, CanCastTo b a) #

allowCheckedCoerceTo :: forall k1 k2 (b :: k1) (a :: k2). Dict (CanCastTo a b) #

castDummyG :: (Generic a, Generic b, GCanCastTo (Rep a) (Rep b)) => Proxy a -> Proxy b -> () #

checkedCoerce :: (CanCastTo a b, Coercible a b) => a -> b #

checkedCoerce_ :: forall a b (s :: [Type]). Castable_ a b => (a ': s) :-> (b ': s) #

checkedCoercing_ :: forall a b (s :: [Type]). Coercible_ a b => ((b ': s) :-> (b ': s)) -> (a ': s) :-> (a ': s) #

coerceUnwrap :: forall a (s :: [Type]). Wrappable a => (a ': s) :-> (Unwrappable a ': s) #

coerceWrap :: forall a (s :: [Type]). Wrappable a => (Unwrappable a ': s) :-> (a ': s) #

fakeCoerce :: forall (s1 :: [Type]) (s2 :: [Type]). s1 :-> s2 #

fakeCoercing :: forall (s1 :: [Type]) (s2 :: [Type]) (s1' :: [Type]) (s2' :: [Type]). (s1 :-> s2) -> s1' :-> s2' #

forcedCoerce :: Coercible a b => a -> b #

forcedCoerce_ :: forall a b (s :: [Type]). MichelsonCoercible a b => (a & s) :-> (b & s) #

fromNamed :: forall (name :: Symbol) a (s :: [Type]). Label name -> (NamedF Identity a name ': s) :-> (a ': s) #

gForcedCoerce_ :: forall k t (a :: k) (b :: k) (s :: [Type]). MichelsonCoercible (t a) (t b) => (t a ': s) :-> (t b ': s) #

toNamed :: forall (name :: Symbol) a (s :: [Type]). Label name -> (a ': s) :-> (NamedF Identity a name ': s) #

class CanCastTo (a :: k) (b :: k1) where #

Minimal complete definition

Nothing

Methods

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

Instances

Instances details

CanCastTo (a :: k) (a :: k)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy a -> Proxy a -> () #
CanCastTo Address (TAddress p :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p) -> () #
CanCastTo (FutureContract p :: Type) EpAddress
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () #
CanCastTo a b => CanCastTo ([a] :: Type) ([b] :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy [a] -> Proxy [b] -> () #
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () #
CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Set k1) -> Proxy (Set k2) -> () #
CanCastTo a1 a2 => CanCastTo (ContractRef a1 :: Type) (ContractRef a2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ContractRef a1) -> Proxy (ContractRef a2) -> () #
SameEntries entries1 entries2 => CanCastTo (UParam entries1 :: Type) (UParam entries2 :: Type)
Instance details Defined in Lorentz.UParam Methods castDummy :: Proxy (UParam entries1) -> Proxy (UParam entries2) -> () #
CanCastTo (TAddress p :: Type) Address
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p) -> Proxy Address -> () #
(CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Either l1 r1) -> Proxy (Either l2 r2) -> () #
(CanCastTo a1 a2, CanCastTo b1 b2) => CanCastTo ((a1, b1) :: Type) ((a2, b2) :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1) -> Proxy (a2, b2) -> () #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Map k1 v1) -> Proxy (Map k2 v2) -> () #
(CanCastTo (ZippedStack i1) (ZippedStack i2), CanCastTo (ZippedStack o1) (ZippedStack o2)) => CanCastTo (i1 :-> o1 :: Type) (i2 :-> o2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (i1 :-> o1) -> Proxy (i2 :-> o2) -> () #
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (BigMap k1 v1 :: Type) (BigMap k2 v2 :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (BigMap k1 v1) -> Proxy (BigMap k2 v2) -> () #
(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (View a1 r1 :: Type) (View a2 r2 :: Type)
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (View a1 r1) -> Proxy (View a2 r2) -> () #
(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (Void_ a1 r1 :: Type) (Void_ a2 r2 :: Type)
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (Void_ a1 r1) -> Proxy (Void_ a2 r2) -> () #
CanCastTo (Lambda (UStore ot1) (UStore nt1)) (Lambda (UStore ot2) (UStore nt2)) => CanCastTo (MigrationScript ot1 nt1 :: Type) (MigrationScript ot2 nt2 :: Type)
Instance details Defined in Lorentz.UStore.Migration.Base Methods castDummy :: Proxy (MigrationScript ot1 nt1) -> Proxy (MigrationScript ot2 nt2) -> () #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2) => CanCastTo ((a1, b1, c1) :: Type) ((a2, b2, c2) :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1) -> Proxy (a2, b2, c2) -> () #
(CanCastTo a b, f ~ g) => CanCastTo (NamedF f a n :: Type) (NamedF g b m :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (NamedF f a n) -> Proxy (NamedF g b m) -> () #
(CanCastTo a1 a2, CanCastTo b1 b2, CanCastTo c1 c2, CanCastTo d1 d2) => CanCastTo ((a1, b1, c1, d1) :: Type) ((a2, b2, c2, d2) :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1) -> Proxy (a2, b2, c2, d2) -> () #
(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)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1, e1) -> Proxy (a2, b2, c2, d2, e2) -> () #
(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)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (a1, b1, c1, d1, e1, f1) -> Proxy (a2, b2, c2, d2, e2, f2) -> () #

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 (Unwrappable s) => Wrappable s #

Associated Types

type Unwrappable s #

type Unwrappable s = GUnwrappable (Rep s) #

Instances

Instances details

Wrappable (UParam entries)
Instance details Defined in Lorentz.UParam Associated Types type Unwrappable (UParam entries) #
Wrappable (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type Unwrappable (UStore a) #
Wrappable (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Unwrappable (ParameterWrapper deriv cp) #
Wrappable (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type Unwrappable (MigrationScript oldStore newStore) #
Wrappable (NamedF Maybe a name)
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Maybe a name) #
Wrappable (NamedF Identity a name)
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Identity a name) #

type family Unwrappable s #

Instances

Instances details

type Unwrappable (UParam entries)
Instance details Defined in Lorentz.UParam type Unwrappable (UParam entries) = GUnwrappable (Rep (UParam entries))
type Unwrappable (UStore a)
Instance details Defined in Lorentz.UStore.Types type Unwrappable (UStore a) = GUnwrappable (Rep (UStore a))
type Unwrappable (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type Unwrappable (ParameterWrapper deriv cp) = GUnwrappable (Rep (ParameterWrapper deriv cp))
type Unwrappable (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type Unwrappable (MigrationScript oldStore newStore) = GUnwrappable (Rep (MigrationScript oldStore newStore))
type Unwrappable (NamedF Maybe a name)
Instance details Defined in Lorentz.Wrappable type Unwrappable (NamedF Maybe a name) = Maybe a
type Unwrappable (NamedF Identity a name)
Instance details Defined in Lorentz.Wrappable type Unwrappable (NamedF Identity a name) = a

newtype TAddress (p :: k) #

Constructors

TAddress
Fields unTAddress :: Address

Instances

Instances details

(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)
Instance details Defined in Lorentz.Address Methods toContractRef :: TAddress cp -> ContractRef arg #
cp ~ cp' => ToTAddress cp (TAddress cp')
Instance details Defined in Lorentz.Address Methods toTAddress :: TAddress cp' -> TAddress cp #
CanCastTo Address (TAddress p :: Type)
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p) -> () #
CanCastTo (TAddress p :: Type) Address
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p) -> Proxy Address -> () #
Generic (TAddress p)
Instance details Defined in Lorentz.Address Associated Types type Rep (TAddress p) :: Type -> Type # Methods from :: TAddress p -> Rep (TAddress p) x # to :: Rep (TAddress p) x -> TAddress p #
HasAnnotation (TAddress p)
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (TAddress p))
IsoValue (TAddress p)
Instance details Defined in Lorentz.Address Associated Types type ToT (TAddress p) :: T # Methods toVal :: TAddress p -> Value (ToT (TAddress p)) # fromVal :: Value (ToT (TAddress p)) -> TAddress p #
ToAddress (TAddress cp)
Instance details Defined in Lorentz.Address Methods toAddress :: TAddress cp -> Address #
type Rep (TAddress p)
Instance details Defined in Lorentz.Address type Rep (TAddress p) = D1 ('MetaData "TAddress" "Lorentz.Address" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "TAddress" 'PrefixI 'True) (S1 ('MetaSel ('Just "unTAddress") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Address)))
type ToT (TAddress p)
Instance details Defined in Lorentz.Address type ToT (TAddress p) = GValueType (Rep (TAddress p))

newtype FutureContract arg #

Constructors

FutureContract
Fields unFutureContract :: ContractRef arg

Instances

Instances details

(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp')
Instance details Defined in Lorentz.Address Methods toContractRef :: FutureContract cp' -> ContractRef cp #
cp ~ cp' => FromContractRef cp (FutureContract cp')
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> FutureContract cp' #
HasAnnotation (FutureContract a)
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a))
IsoValue (FutureContract arg)
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 #
ToAddress (FutureContract cp)
Instance details Defined in Lorentz.Address Methods toAddress :: FutureContract cp -> Address #
CanCastTo (FutureContract p :: Type) EpAddress
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () #
type ToT (FutureContract arg)
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress

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

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

niceConstantEvi :: NiceConstant a :- ConstantScope (ToT a) #

nicePackedValueEvi :: NicePackedValue a :- PackedValScope (ToT a) #

niceParameterEvi :: NiceParameter a :- ParameterScope (ToT a) #

nicePrintedValueEvi :: NicePrintedValue a :- PrintedValScope (ToT a) #

niceStorageEvi :: NiceStorage a :- StorageScope (ToT a) #

niceUnpackedValueEvi :: NiceUnpackedValue a :- UnpackedValScope (ToT a) #

class (IsoValue a, HasNoNestedBigMaps (ToT a)) => CanHaveBigMap a #

Instances

Instances details

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

type NiceConstant a = (KnownValue a, ProperConstantBetterErrors (ToT a)) #

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

type NicePackedValue a = (KnownValue a, ProperPackedValBetterErrors (ToT a)) #

type NiceParameter a = (KnownValue a, ProperParameterBetterErrors (ToT a)) #

type NicePrintedValue a = (KnownValue a, ProperPrintedValBetterErrors (ToT a)) #

type NiceUnpackedValue a = (KnownValue a, ProperUnpackedValBetterErrors (ToT a)) #

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

Instances

Instances details

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

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

Instances

Instances details

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

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

Instances

Instances details

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

buildLorentzDoc :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> ContractDoc #

buildLorentzDocWithGitRev :: forall (inp :: [Type]) (out :: [Type]). DGitRevision -> (inp :-> out) -> ContractDoc #

cutLorentzNonDoc :: forall (inp :: [Type]) (out :: [Type]) (s :: [Type]). (inp :-> out) -> s :-> s #

mkDEntrypointExample :: NiceParameter a => a -> DEntrypointExample #

renderLorentzDoc :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> LText #

contractDocToMarkdown :: ContractDoc -> LText #

docDefinitionRef :: (DocItem d, DocItemPlacement d ~ 'DocItemInDefinitions) => Markdown -> d -> Markdown #

docItemPosition :: DocItem d => DocItemPos #

mdTocFromRef :: (DocItem d, DocItemReferenced d ~ 'True) => HeaderLevel -> Markdown -> d -> Markdown #

mkDGitRevision :: ExpQ #

morleyRepoSettings :: GitRepoSettings #

subDocToMarkdown :: HeaderLevel -> SubDoc -> Markdown #

concreteTypeDocHaskellRep :: (Typeable a, GenericIsoValue a, GTypeHasDoc (Rep a), HaveCommonTypeCtor b a) => TypeDocHaskellRep b #

concreteTypeDocHaskellRepUnsafe :: (Typeable a, GenericIsoValue a, GTypeHasDoc (Rep a)) => TypeDocHaskellRep b #

concreteTypeDocMichelsonRep :: forall k a (b :: k). (Typeable a, SingI (ToT a), HaveCommonTypeCtor b a) => TypeDocMichelsonRep b #

concreteTypeDocMichelsonRepUnsafe :: forall k a (b :: k). (Typeable a, SingI (ToT a)) => TypeDocMichelsonRep b #

customTypeDocMdReference :: (Text, DType) -> [DType] -> WithinParens -> Markdown #

dTypeDep :: TypeHasDoc t => SomeDocDefinitionItem #

genericTypeDocDependencies :: (Generic a, GTypeHasDoc (Rep a)) => Proxy a -> [SomeDocDefinitionItem] #

haskellAddNewtypeField :: Text -> TypeDocHaskellRep a -> TypeDocHaskellRep a #

haskellRepNoFields :: TypeDocHaskellRep a -> TypeDocHaskellRep a #

haskellRepStripFieldPrefix :: HasCallStack => TypeDocHaskellRep a -> TypeDocHaskellRep a #

homomorphicTypeDocHaskellRep :: (Generic a, GTypeHasDoc (Rep a)) => TypeDocHaskellRep a #

homomorphicTypeDocMdReference :: (Typeable t, TypeHasDoc t, IsHomomorphic t) => Proxy t -> WithinParens -> Markdown #

homomorphicTypeDocMichelsonRep :: SingI (ToT a) => TypeDocMichelsonRep a #

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 #

data DEntrypointExample #

Constructors

ParameterScope t => DEntrypointExample (Value t)

Instances

Instances details

DocItem DEntrypointExample
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
Instance details Defined in Lorentz.Doc type DocItemPlacement DEntrypointExample = 'DocItemInlined
type DocItemReferenced DEntrypointExample
Instance details Defined in Lorentz.Doc type DocItemReferenced DEntrypointExample = 'False

data ContractDoc #

Constructors

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

Instances

Instances details

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

data DAnchor #

Constructors

DAnchor Anchor

Instances

Instances details

DocItem DAnchor
Instance details Defined in 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 Michelson.Doc type DocItemPlacement DAnchor = 'DocItemInlined
type DocItemReferenced DAnchor
Instance details Defined in Michelson.Doc type DocItemReferenced DAnchor = 'False

data DComment #

Constructors

DComment Text

Instances

Instances details

DocItem DComment
Instance details Defined in 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 Michelson.Doc type DocItemPlacement DComment = 'DocItemInlined
type DocItemReferenced DComment
Instance details Defined in Michelson.Doc type DocItemReferenced DComment = 'False

data DDescription #

Constructors

DDescription Markdown

Instances

Instances details

DocItem DDescription
Instance details Defined in 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 Michelson.Doc type DocItemPlacement DDescription = 'DocItemInlined
type DocItemReferenced DDescription
Instance details Defined in Michelson.Doc type DocItemReferenced DDescription = 'False

data DGitRevision #

Constructors

DGitRevisionKnown DGitRevisionInfo
DGitRevisionUnknown

Instances

Instances details

DocItem DGitRevision
Instance details Defined in 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 Michelson.Doc type DocItemPlacement DGitRevision = 'DocItemInlined
type DocItemReferenced DGitRevision
Instance details Defined in Michelson.Doc type DocItemReferenced DGitRevision = 'False

data DocElem d #

Constructors

DocElem
Fields deItem :: d deSub :: Maybe SubDoc

type DocGrouping = SubDoc -> SomeDocItem #

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 DEntrypointExample
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 DAnchor
Instance details Defined in 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 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 DDescription
Instance details Defined in 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 DGitRevision
Instance details Defined in 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 DType
Instance details Defined in 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] #
DocItem DEntrypointArg
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
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
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
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
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 DMigrationActionDesc
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type DocItemPlacement DMigrationActionDesc :: DocItemPlacementKind # type DocItemReferenced DMigrationActionDesc :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DMigrationActionDesc -> DocItemRef (DocItemPlacement DMigrationActionDesc) (DocItemReferenced DMigrationActionDesc) # docItemToMarkdown :: HeaderLevel -> DMigrationActionDesc -> Markdown # docItemToToc :: HeaderLevel -> DMigrationActionDesc -> Markdown # docItemDependencies :: DMigrationActionDesc -> [SomeDocDefinitionItem] # docItemsOrder :: [DMigrationActionDesc] -> [DMigrationActionDesc] #
DocItem DUStoreTemplate
Instance details Defined in Lorentz.UStore.Doc Associated Types type DocItemPlacement DUStoreTemplate :: DocItemPlacementKind # type DocItemReferenced DUStoreTemplate :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DUStoreTemplate -> DocItemRef (DocItemPlacement DUStoreTemplate) (DocItemReferenced DUStoreTemplate) # docItemToMarkdown :: HeaderLevel -> DUStoreTemplate -> Markdown # docItemToToc :: HeaderLevel -> DUStoreTemplate -> Markdown # docItemDependencies :: DUStoreTemplate -> [SomeDocDefinitionItem] # docItemsOrder :: [DUStoreTemplate] -> [DUStoreTemplate] #
DocItem DGeneralInfoSection
Instance details Defined in 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 DName
Instance details Defined in 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 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 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 (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement (DEntrypoint PlainEntrypointsKind) :: DocItemPlacementKind # type DocItemReferenced (DEntrypoint PlainEntrypointsKind) :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypoint PlainEntrypointsKind -> DocItemRef (DocItemPlacement (DEntrypoint PlainEntrypointsKind)) (DocItemReferenced (DEntrypoint PlainEntrypointsKind)) # docItemToMarkdown :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemToToc :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemDependencies :: DEntrypoint PlainEntrypointsKind -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypoint PlainEntrypointsKind] -> [DEntrypoint PlainEntrypointsKind] #

type family DocItemPlacement d :: DocItemPlacementKind #

Instances

Instances details

type DocItemPlacement DEntrypointExample
Instance details Defined in Lorentz.Doc type DocItemPlacement DEntrypointExample = 'DocItemInlined
type DocItemPlacement DAnchor
Instance details Defined in Michelson.Doc type DocItemPlacement DAnchor = 'DocItemInlined
type DocItemPlacement DComment
Instance details Defined in Michelson.Doc type DocItemPlacement DComment = 'DocItemInlined
type DocItemPlacement DDescription
Instance details Defined in Michelson.Doc type DocItemPlacement DDescription = 'DocItemInlined
type DocItemPlacement DGitRevision
Instance details Defined in Michelson.Doc type DocItemPlacement DGitRevision = 'DocItemInlined
type DocItemPlacement DType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemPlacement DType = 'DocItemInDefinitions
type DocItemPlacement DEntrypointArg
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointArg = 'DocItemInlined
type DocItemPlacement DEntrypointReference
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointReference = 'DocItemInlined
type DocItemPlacement DError
Instance details Defined in Lorentz.Errors type DocItemPlacement DError = 'DocItemInDefinitions
type DocItemPlacement DThrows
Instance details Defined in Lorentz.Errors type DocItemPlacement DThrows = 'DocItemInlined
type DocItemPlacement DDescribeErrorTagMap
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemPlacement DDescribeErrorTagMap = 'DocItemInDefinitions
type DocItemPlacement DMigrationActionDesc
Instance details Defined in Lorentz.UStore.Migration.Base type DocItemPlacement DMigrationActionDesc = 'DocItemInlined
type DocItemPlacement DUStoreTemplate
Instance details Defined in Lorentz.UStore.Doc type DocItemPlacement DUStoreTemplate = 'DocItemInDefinitions
type DocItemPlacement DGeneralInfoSection
Instance details Defined in Michelson.Doc type DocItemPlacement DGeneralInfoSection = 'DocItemInlined
type DocItemPlacement DName
Instance details Defined in Michelson.Doc type DocItemPlacement DName = 'DocItemInlined
type DocItemPlacement DToc
Instance details Defined in Michelson.Doc type DocItemPlacement DToc = 'DocItemInlined
type DocItemPlacement DStorageType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemPlacement DStorageType = 'DocItemInlined
type DocItemPlacement (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement (DEntrypoint PlainEntrypointsKind) = 'DocItemInlined

type family DocItemReferenced d :: DocItemReferencedKind #

Instances

Instances details

type DocItemReferenced DEntrypointExample
Instance details Defined in Lorentz.Doc type DocItemReferenced DEntrypointExample = 'False
type DocItemReferenced DAnchor
Instance details Defined in Michelson.Doc type DocItemReferenced DAnchor = 'False
type DocItemReferenced DComment
Instance details Defined in Michelson.Doc type DocItemReferenced DComment = 'False
type DocItemReferenced DDescription
Instance details Defined in Michelson.Doc type DocItemReferenced DDescription = 'False
type DocItemReferenced DGitRevision
Instance details Defined in Michelson.Doc type DocItemReferenced DGitRevision = 'False
type DocItemReferenced DType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemReferenced DType = 'True
type DocItemReferenced DEntrypointArg
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointArg = 'False
type DocItemReferenced DEntrypointReference
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointReference = 'False
type DocItemReferenced DError
Instance details Defined in Lorentz.Errors type DocItemReferenced DError = 'True
type DocItemReferenced DThrows
Instance details Defined in Lorentz.Errors type DocItemReferenced DThrows = 'False
type DocItemReferenced DDescribeErrorTagMap
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemReferenced DDescribeErrorTagMap = 'True
type DocItemReferenced DMigrationActionDesc
Instance details Defined in Lorentz.UStore.Migration.Base type DocItemReferenced DMigrationActionDesc = 'False
type DocItemReferenced DUStoreTemplate
Instance details Defined in Lorentz.UStore.Doc type DocItemReferenced DUStoreTemplate = 'True
type DocItemReferenced DGeneralInfoSection
Instance details Defined in Michelson.Doc type DocItemReferenced DGeneralInfoSection = 'False
type DocItemReferenced DName
Instance details Defined in Michelson.Doc type DocItemReferenced DName = 'False
type DocItemReferenced DToc
Instance details Defined in Michelson.Doc type DocItemReferenced DToc = 'False
type DocItemReferenced DStorageType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemReferenced DStorageType = 'True
type DocItemReferenced (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced (DEntrypoint PlainEntrypointsKind) = 'True

newtype DocItemId #

Constructors

DocItemId Text

Instances

Instances details

Eq DocItemId
Instance details Defined in Michelson.Doc Methods (==) :: DocItemId -> DocItemId -> Bool # (/=) :: DocItemId -> DocItemId -> Bool #
Ord DocItemId
Instance details Defined in 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 #
Show DocItemId
Instance details Defined in Michelson.Doc Methods showsPrec :: Int -> DocItemId -> ShowS # show :: DocItemId -> String # showList :: [DocItemId] -> ShowS #
ToAnchor DocItemId
Instance details Defined in Michelson.Doc Methods toAnchor :: DocItemId -> Anchor

data DocItemPlacementKind #

Constructors

DocItemInlined
DocItemInDefinitions

newtype DocItemPos #

Constructors

DocItemPos (Natural, Text)

Instances

Instances details

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

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 Michelson.Doc Methods toAnchor :: DocItemRef d 'True -> Anchor

data DocSection #

Constructors

DocItem d => DocSection (NonEmpty $ DocElem d)

Instances

Instances details

Show DocSection
Instance details Defined in Michelson.Doc Methods showsPrec :: Int -> DocSection -> ShowS # show :: DocSection -> String # showList :: [DocSection] -> ShowS #

data DocSectionNameStyle #

Constructors

DocSectionNameBig
DocSectionNameSmall

newtype GitRepoSettings #

Constructors

GitRepoSettings
Fields grsMkGitRevision :: Text -> Text

data SomeDocDefinitionItem where #

Constructors

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

Instances

Instances details

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

data SomeDocItem where #

Constructors

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

Instances

Instances details

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

newtype SubDoc #

Constructors

SubDoc DocBlock

Instances

Instances details

Show DocGrouping
Instance details Defined in Michelson.Doc Methods showsPrec :: Int -> DocGrouping -> ShowS # show :: DocGrouping -> String # showList :: [DocGrouping] -> ShowS #

data DType where #

Constructors

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

Instances

Instances details

Eq DType
Instance details Defined in Michelson.Typed.Haskell.Doc Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Ord DType
Instance details Defined in 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 #
Show DType
Instance details Defined in Michelson.Typed.Haskell.Doc Methods showsPrec :: Int -> DType -> ShowS # show :: DType -> String # showList :: [DType] -> ShowS #
DocItem DType
Instance details Defined in 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] #
type DocItemPlacement DType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemPlacement DType = 'DocItemInDefinitions
type DocItemReferenced DType
Instance details Defined in Michelson.Typed.Haskell.Doc type DocItemReferenced DType = 'True

class HaveCommonTypeCtor (a :: k) (b :: k1) #

Instances

Instances details

HaveCommonTypeCtor (a :: k) (a :: k)
Instance details Defined in Michelson.Typed.Haskell.Doc
HaveCommonTypeCtor ac bc => HaveCommonTypeCtor (ac a :: k2) (bc b :: k4)
Instance details Defined in Michelson.Typed.Haskell.Doc

class IsHomomorphic (a :: k) #

Instances

Instances details

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

data SomeTypeWithDoc where #

Constructors

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

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 Bool
Instance details Defined in 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 #
TypeHasDoc Integer
Instance details Defined in 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 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 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 ByteString
Instance details Defined in 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 Address
Instance details Defined in 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 EpAddress
Instance details Defined in 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 KeyHash
Instance details Defined in 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 MText
Instance details Defined in 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 Mutez
Instance details Defined in 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 Operation
Instance details Defined in 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 PublicKey
Instance details Defined in 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 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 Timestamp
Instance details Defined in 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 #
PolyTypeHasDocC '[a] => TypeHasDoc [a]
Instance details Defined in 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 '[a] => TypeHasDoc (Maybe a)
Instance details Defined in 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) #
PolyCTypeHasDocC '[a] => TypeHasDoc (Set a)
Instance details Defined in 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) #
PolyTypeHasDocC '[cp] => TypeHasDoc (ContractRef cp)
Instance details Defined in 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) #
(TypeHasDoc r, IsError (VoidResult r)) => TypeHasDoc (VoidResult r)
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) #
Typeable interface => TypeHasDoc (UParam interface)
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 '[l, r] => TypeHasDoc (Either l r)
Instance details Defined in 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) #
PolyTypeHasDocC '[a, b] => TypeHasDoc (a, b)
Instance details Defined in 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) #
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v)
Instance details Defined in 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) #
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (BigMap k v)
Instance details Defined in 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) #
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (View a r)
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)
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) #
Each '[Typeable :: Type -> Constraint, UStoreTemplateHasDoc] '[oldStore, newStore] => TypeHasDoc (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type TypeDocFieldDescriptions (MigrationScript oldStore newStore) :: FieldDescriptions # Methods typeDocName :: Proxy (MigrationScript oldStore newStore) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (MigrationScript oldStore newStore) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (MigrationScript oldStore newStore) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (MigrationScript oldStore newStore) # typeDocMichelsonRep :: TypeDocMichelsonRep (MigrationScript oldStore newStore) #
PolyTypeHasDocC '[a, b, c] => TypeHasDoc (a, b, c)
Instance details Defined in 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) #
(TypeHasDoc (ApplyNamedFunctor f a), KnownSymbol n, SingI (ToT (ApplyNamedFunctor f Integer)), Typeable f, Typeable a) => TypeHasDoc (NamedF f a n)
Instance details Defined in 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, d] => TypeHasDoc (a, b, c, d)
Instance details Defined in 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 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 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 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) #

type family TypeDocFieldDescriptions a :: FieldDescriptions #

Instances

Instances details

type TypeDocFieldDescriptions Bool
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Integer
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Natural
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions ()
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions () = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions ByteString
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Address
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Address = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions EpAddress
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions KeyHash
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions KeyHash = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions MText
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Mutez
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Mutez = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Operation
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Operation = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions PublicKey
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions PublicKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Signature
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Signature = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions Timestamp
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Timestamp = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions [a]
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions [a] = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Set a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (ContractRef cp)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (VoidResult r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (VoidResult r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (UParam interface)
Instance details Defined in Lorentz.UParam type TypeDocFieldDescriptions (UParam interface) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (UStore template)
Instance details Defined in Lorentz.UStore.Doc type TypeDocFieldDescriptions (UStore template) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Either l r)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Either l r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (i :-> o)
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (i :-> o) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (BigMap k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (View a r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (View a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (Void_ a r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (Void_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type TypeDocFieldDescriptions (MigrationScript oldStore newStore) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (NamedF f a n)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (NamedF f a n) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type TypeDocFieldDescriptions (a, b, c, d)
Instance details Defined in 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 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 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 Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (a, b, c, d, e, f, g) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

type Markdown = Builder #

type Value = Value' Instr #

eprName :: forall (mname :: Maybe Symbol). EntrypointRef mname -> EpName #

parameterEntrypointCall :: forall cp (name :: Symbol). ParameterDeclaresEntrypoints cp => Label name -> EntrypointCall cp (GetEntrypointArg cp name) #

parameterEntrypointCallCustom :: forall cp (mname :: Maybe Symbol). ParameterDeclaresEntrypoints cp => EntrypointRef mname -> EntrypointCall cp (GetEntrypointArgCustom cp mname) #

parameterEntrypointCallDefault :: ParameterDeclaresEntrypoints cp => EntrypointCall cp (GetDefaultEntrypointArg cp) #

parameterEntrypointsToNotes :: ParameterDeclaresEntrypoints cp => ParamNotes (ToT cp) #

sepcCallRootChecked :: (NiceParameter cp, ForbidExplicitDefaultEntrypoint cp) => SomeEntrypointCall cp #

type (:>) (n :: Symbol) ty = 'NamedEp n ty #

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

Equations

AllParameterEntrypoints cp = EpdAllEntrypoints (GetParameterEpDerivation cp) cp

data EntrypointRef (mname :: Maybe Symbol) where #

Constructors

CallDefault :: EntrypointRef ('Nothing :: Maybe Symbol)
Call :: forall (name :: Symbol). NiceEntrypointName name => EntrypointRef ('Just name)

Instances

Instances details

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

class EntrypointsDerivation (deriv :: k) cp where #

Associated Types

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

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

Methods

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

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

epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints deriv cp) #

Instances

Instances details

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

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

Instances

Instances details

type EpdAllEntrypoints EpdNone cp
Instance details Defined in Lorentz.Entrypoints.Core type EpdAllEntrypoints EpdNone cp = '[] :: [(Symbol, Type)]
type EpdAllEntrypoints EpdDelegate cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdDelegate cp = PlainAllEntrypointsExt EpdDelegate cp
type EpdAllEntrypoints EpdPlain cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdPlain cp = PlainAllEntrypointsExt EpdPlain cp
type EpdAllEntrypoints EpdRecursive cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdRecursive cp = PlainAllEntrypointsExt EpdRecursive cp
type EpdAllEntrypoints (PwDeriv deriv :: Type) (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type EpdAllEntrypoints (PwDeriv deriv :: Type) (ParameterWrapper deriv cp) = EpdAllEntrypoints deriv cp
type EpdAllEntrypoints (EpdWithRoot r deriv :: Type) cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints (EpdWithRoot r deriv :: Type) cp = '(r, cp) ': PlainAllEntrypointsExt deriv cp

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

Instances

Instances details

type EpdLookupEntrypoint EpdNone cp
Instance details Defined in Lorentz.Entrypoints.Core type EpdLookupEntrypoint EpdNone cp = ConstFn ('Nothing :: Maybe Type) :: Symbol -> Maybe Type -> Type
type EpdLookupEntrypoint EpdDelegate cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdDelegate cp = PlainLookupEntrypointExt EpdDelegate cp
type EpdLookupEntrypoint EpdPlain cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdPlain cp = PlainLookupEntrypointExt EpdPlain cp
type EpdLookupEntrypoint EpdRecursive cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdRecursive cp = PlainLookupEntrypointExt EpdRecursive cp
type EpdLookupEntrypoint (PwDeriv deriv :: Type) (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type EpdLookupEntrypoint (PwDeriv deriv :: Type) (ParameterWrapper deriv cp) = EpdLookupEntrypoint deriv cp
type EpdLookupEntrypoint (EpdWithRoot r deriv :: Type) cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint (EpdWithRoot r deriv :: Type) cp = Case '[Is (TyEqSing r :: Symbol -> Bool -> Type) ('Just cp), Else (PlainLookupEntrypointExt deriv cp)]

data EpdNone #

Instances

Instances details

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

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

type GetDefaultEntrypointArg cp = Eval (LiftM2 (FromMaybe :: Type -> Maybe Type -> Type -> Type) (Pure cp) (LookupParameterEntrypoint cp DefaultEpName)) #

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

type family GetEntrypointArgCustom cp (mname :: Maybe Symbol) where ... #

Equations

GetEntrypointArgCustom cp ('Nothing :: Maybe Symbol) = GetDefaultEntrypointArg cp
GetEntrypointArgCustom cp ('Just name) = GetEntrypointArg cp name

type HasDefEntrypointArg (cp :: k) defEpName defArg = (defEpName ~ EntrypointRef ('Nothing :: Maybe Symbol), HasEntrypointArg cp defEpName defArg) #

class HasEntrypointArg (cp :: k) name arg where #

Methods

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

Instances

Instances details

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

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

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

Equations

LookupParameterEntrypoint cp = EpdLookupEntrypoint (GetParameterEpDerivation cp) cp

type NoExplicitDefaultEntrypoint cp = Eval (LookupParameterEntrypoint cp DefaultEpName) ~ ('Nothing :: Maybe Type) #

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

Equations

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

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

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

Associated Types

type ParameterEntrypointsDerivation cp #

Instances

Instances details

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

type family ParameterEntrypointsDerivation cp #

Instances

Instances details

type ParameterEntrypointsDerivation (ParameterWrapper epd cp)
Instance details Defined in Lorentz.Entrypoints.Manual type ParameterEntrypointsDerivation (ParameterWrapper epd cp) = PwDeriv epd

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

newtype TrustEpName #

Constructors

TrustEpName EpName

Instances

Instances details

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

newtype ShouldHaveEntrypoints a #

Constructors

ShouldHaveEntrypoints
Fields unHasEntrypoints :: a

Instances

Instances details

Generic (ShouldHaveEntrypoints a)
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 #
WellTypedIsoValue r => IsoValue (ShouldHaveEntrypoints r)
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)
Instance details Defined in Lorentz.Entrypoints.Helpers type Rep (ShouldHaveEntrypoints a) = D1 ('MetaData "ShouldHaveEntrypoints" "Lorentz.Entrypoints.Helpers" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "ShouldHaveEntrypoints" 'PrefixI 'True) (S1 ('MetaSel ('Just "unHasEntrypoints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
type ToT (ShouldHaveEntrypoints r)
Instance details Defined in Lorentz.Entrypoints.Helpers type ToT (ShouldHaveEntrypoints r) = GValueType (Rep (ShouldHaveEntrypoints r))

data EpdDelegate #

Instances

Instances details

ParameterDeclaresEntrypoints a => GEntrypointsNotes EpdDelegate 'EPDelegate (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type GAllEntrypoints EpdDelegate 'EPDelegate (Rec0 a) :: [(Symbol, Type)] type GLookupEntrypoint EpdDelegate 'EPDelegate (Rec0 a) :: Symbol -> Exp (Maybe Type) Methods gMkEntrypointsNotes :: (Notes (GValueType (Rec0 a)), FieldAnn) gMkEpLiftSequence :: forall (name :: Symbol). ParameterScope (GValueType (Rec0 a)) => Label name -> EpConstructionRes (GValueType (Rec0 a)) (Eval (GLookupEntrypoint EpdDelegate 'EPDelegate (Rec0 a) name)) gMkDescs :: Rec EpCallingDesc (GAllEntrypoints EpdDelegate 'EPDelegate (Rec0 a))
PlainEntrypointsC EpdDelegate cp => EntrypointsDerivation EpdDelegate cp
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdDelegate cp :: [(Symbol, Type)] # type EpdLookupEntrypoint EpdDelegate cp :: Symbol -> Exp (Maybe Type) # Methods epdNotes :: (Notes (ToT cp), RootAnn) # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdDelegate cp name)) # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdDelegate cp) #
type GAllEntrypoints EpdDelegate 'EPDelegate (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl type GAllEntrypoints EpdDelegate 'EPDelegate (Rec0 a) = AllParameterEntrypoints a
type GLookupEntrypoint EpdDelegate 'EPDelegate (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl type GLookupEntrypoint EpdDelegate 'EPDelegate (Rec0 a) = LookupParameterEntrypoint a
type EpdAllEntrypoints EpdDelegate cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdDelegate cp = PlainAllEntrypointsExt EpdDelegate cp
type EpdLookupEntrypoint EpdDelegate cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdDelegate cp = PlainLookupEntrypointExt EpdDelegate cp

data EpdPlain #

Instances

Instances details

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

data EpdRecursive #

Instances

Instances details

(EntrypointsNotes EpdRecursive ep a, GenericIsoValue a) => GEntrypointsNotes EpdRecursive ep (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type GAllEntrypoints EpdRecursive ep (Rec0 a) :: [(Symbol, Type)] type GLookupEntrypoint EpdRecursive ep (Rec0 a) :: Symbol -> Exp (Maybe Type) Methods gMkEntrypointsNotes :: (Notes (GValueType (Rec0 a)), FieldAnn) gMkEpLiftSequence :: forall (name :: Symbol). ParameterScope (GValueType (Rec0 a)) => Label name -> EpConstructionRes (GValueType (Rec0 a)) (Eval (GLookupEntrypoint EpdRecursive ep (Rec0 a) name)) gMkDescs :: Rec EpCallingDesc (GAllEntrypoints EpdRecursive ep (Rec0 a))
PlainEntrypointsC EpdRecursive cp => EntrypointsDerivation EpdRecursive cp
Instance details Defined in Lorentz.Entrypoints.Impl Associated Types type EpdAllEntrypoints EpdRecursive cp :: [(Symbol, Type)] # type EpdLookupEntrypoint EpdRecursive cp :: Symbol -> Exp (Maybe Type) # Methods epdNotes :: (Notes (ToT cp), RootAnn) # epdCall :: forall (name :: Symbol). ParameterScope (ToT cp) => Label name -> EpConstructionRes (ToT cp) (Eval (EpdLookupEntrypoint EpdRecursive cp name)) # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints EpdRecursive cp) #
type GAllEntrypoints EpdRecursive ep (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl type GAllEntrypoints EpdRecursive ep (Rec0 a) = AllEntrypoints EpdRecursive ep a
type GLookupEntrypoint EpdRecursive ep (Rec0 a)
Instance details Defined in Lorentz.Entrypoints.Impl type GLookupEntrypoint EpdRecursive ep (Rec0 a) = LookupEntrypoint EpdRecursive ep a
type EpdAllEntrypoints EpdRecursive cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdAllEntrypoints EpdRecursive cp = PlainAllEntrypointsExt EpdRecursive cp
type EpdLookupEntrypoint EpdRecursive cp
Instance details Defined in Lorentz.Entrypoints.Impl type EpdLookupEntrypoint EpdRecursive cp = PlainLookupEntrypointExt EpdRecursive cp

data EpdWithRoot (r :: Symbol) (epd :: k) #

Instances

Instances details

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

newtype ParameterWrapper deriv cp #

Constructors

ParameterWrapper
Fields unParameterWraper :: cp

Instances

Instances details

EntrypointsDerivation deriv cp => EntrypointsDerivation (PwDeriv deriv :: Type) (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type EpdAllEntrypoints (PwDeriv deriv) (ParameterWrapper deriv cp) :: [(Symbol, Type)] # type EpdLookupEntrypoint (PwDeriv deriv) (ParameterWrapper deriv cp) :: Symbol -> Exp (Maybe Type) # Methods epdNotes :: (Notes (ToT (ParameterWrapper deriv cp)), RootAnn) # epdCall :: forall (name :: Symbol). ParameterScope (ToT (ParameterWrapper deriv cp)) => Label name -> EpConstructionRes (ToT (ParameterWrapper deriv cp)) (Eval (EpdLookupEntrypoint (PwDeriv deriv) (ParameterWrapper deriv cp) name)) # epdDescs :: Rec EpCallingDesc (EpdAllEntrypoints (PwDeriv deriv) (ParameterWrapper deriv cp)) #
Generic (ParameterWrapper deriv cp)
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 #
Wrappable (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Unwrappable (ParameterWrapper deriv cp) #
(NiceParameter cp, EntrypointsDerivation epd cp, RequireAllUniqueEntrypoints' epd cp) => ParameterHasEntrypoints (ParameterWrapper epd cp)
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ParameterEntrypointsDerivation (ParameterWrapper epd cp) #
IsoValue cp => IsoValue (ParameterWrapper deriv cp)
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 EpdAllEntrypoints (PwDeriv deriv :: Type) (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type EpdAllEntrypoints (PwDeriv deriv :: Type) (ParameterWrapper deriv cp) = EpdAllEntrypoints deriv cp
type EpdLookupEntrypoint (PwDeriv deriv :: Type) (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type EpdLookupEntrypoint (PwDeriv deriv :: Type) (ParameterWrapper deriv cp) = EpdLookupEntrypoint deriv cp
type Rep (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type Rep (ParameterWrapper deriv cp) = D1 ('MetaData "ParameterWrapper" "Lorentz.Entrypoints.Manual" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "ParameterWrapper" 'PrefixI 'True) (S1 ('MetaSel ('Just "unParameterWraper") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 cp)))
type ToT (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type ToT (ParameterWrapper deriv cp) = GValueType (Rep (ParameterWrapper deriv cp))
type Unwrappable (ParameterWrapper deriv cp)
Instance details Defined in Lorentz.Entrypoints.Manual type Unwrappable (ParameterWrapper deriv cp) = GUnwrappable (Rep (ParameterWrapper deriv cp))
type ParameterEntrypointsDerivation (ParameterWrapper epd cp)
Instance details Defined in Lorentz.Entrypoints.Manual type ParameterEntrypointsDerivation (ParameterWrapper epd cp) = PwDeriv epd

areFinalizedParamBuildingSteps :: [ParamBuildingStep] -> Bool #

clarifyParamBuildingSteps :: forall (inp :: [Type]) (out :: [Type]). ParamBuildingStep -> (inp :-> out) -> inp :-> out #

constructDEpArg :: (TypeHasDoc arg, HasAnnotation arg, KnownValue arg) => DEntrypointArg #

diEntrypointToMarkdown :: HeaderLevel -> DEntrypoint level -> Markdown #

documentEntrypoint :: forall kind (epName :: Symbol) param (s :: [Type]) (out :: [Type]). (KnownSymbol epName, DocItem (DEntrypoint kind), TypeHasDoc param, HasAnnotation param, KnownValue param) => ((param & s) :-> out) -> (param & s) :-> out #

emptyDEpArg :: DEntrypointArg #

entryCaseSimple_ :: forall cp (out :: [Type]) (inp :: [Type]). (InstrCaseC cp, RMap (CaseClauses cp), DocumentEntrypoints PlainEntrypointsKind cp, NiceParameterFull cp, RequireFlatParamEps cp) => Rec (CaseClauseL inp out) (CaseClauses cp) -> (cp & inp) :-> out #

mkDEntrypointArgSimple :: (KnownValue t, HasAnnotation t, TypeHasDoc t) => DEntrypointArg #

mkDEpUType :: (KnownValue t, HasAnnotation t) => Type #

mkPbsWrapIn :: Text -> ParamBuilder -> ParamBuildingStep #

mkUType :: forall (x :: T). SingI x => Notes x -> Type #

data DEntrypoint kind #

Constructors

DEntrypoint
Fields depName :: Text depSub :: SubDoc

Instances

Instances details

Eq (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (/=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool #
Ord (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods compare :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Ordering # (<) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (<=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (>) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (>=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # max :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind # min :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind #
Show (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> DEntrypoint PlainEntrypointsKind -> ShowS # show :: DEntrypoint PlainEntrypointsKind -> String # showList :: [DEntrypoint PlainEntrypointsKind] -> ShowS #
DocItem (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement (DEntrypoint PlainEntrypointsKind) :: DocItemPlacementKind # type DocItemReferenced (DEntrypoint PlainEntrypointsKind) :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypoint PlainEntrypointsKind -> DocItemRef (DocItemPlacement (DEntrypoint PlainEntrypointsKind)) (DocItemReferenced (DEntrypoint PlainEntrypointsKind)) # docItemToMarkdown :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemToToc :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemDependencies :: DEntrypoint PlainEntrypointsKind -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypoint PlainEntrypointsKind] -> [DEntrypoint PlainEntrypointsKind] #
type DocItemPlacement (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement (DEntrypoint PlainEntrypointsKind) = 'DocItemInlined
type DocItemReferenced (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced (DEntrypoint PlainEntrypointsKind) = 'True

data DEntrypointArg #

Constructors

DEntrypointArg
Fields epaArg :: Maybe DType epaBuilding :: [ParamBuildingStep] epaType :: Type

Instances

Instances details

DocItem DEntrypointArg
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
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointArg = 'DocItemInlined
type DocItemReferenced DEntrypointArg
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointArg = 'False

data DEntrypointReference #

Constructors

DEntrypointReference Text Anchor

Instances

Instances details

DocItem DEntrypointReference
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
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement DEntrypointReference = 'DocItemInlined
type DocItemReferenced DEntrypointReference
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced DEntrypointReference = 'False

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

Methods

deriveCtorFieldDoc :: DEntrypointArg #

Instances

Instances details

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

type DocumentEntrypoints kind a = (Generic a, GDocumentEntrypoints kind (Rep a)) #

class EntryArrow (kind :: k) (name :: Symbol) body where #

Methods

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

Instances

Instances details

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

newtype ParamBuilder #

Constructors

ParamBuilder
Fields unParamBuilder :: Markdown -> Markdown

Instances

Instances details

Eq ParamBuilder
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuilder -> ParamBuilder -> Bool # (/=) :: ParamBuilder -> ParamBuilder -> Bool #
Show ParamBuilder
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuilder -> ShowS # show :: ParamBuilder -> String # showList :: [ParamBuilder] -> ShowS #
Buildable ParamBuilder
Instance details Defined in Lorentz.Entrypoints.Doc Methods build :: ParamBuilder -> Builder #

data ParamBuildingDesc #

Constructors

ParamBuildingDesc
Fields pbdEnglish :: Markdown pbdHaskell :: ParamBuilder pbdMichelson :: ParamBuilder

Instances

Instances details

Eq ParamBuildingDesc
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuildingDesc -> ParamBuildingDesc -> Bool # (/=) :: ParamBuildingDesc -> ParamBuildingDesc -> Bool #
Show ParamBuildingDesc
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuildingDesc -> ShowS # show :: ParamBuildingDesc -> String # showList :: [ParamBuildingDesc] -> ShowS #

data ParamBuildingStep #

Constructors

PbsWrapIn Text ParamBuildingDesc
PbsCallEntrypoint EpName
PbsCustom ParamBuildingDesc
PbsUncallable [ParamBuildingStep]

Instances

Instances details

Eq ParamBuildingStep
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuildingStep -> ParamBuildingStep -> Bool # (/=) :: ParamBuildingStep -> ParamBuildingStep -> Bool #
Show ParamBuildingStep
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuildingStep -> ShowS # show :: ParamBuildingStep -> String # showList :: [ParamBuildingStep] -> ShowS #
Buildable ParamBuildingStep
Instance details Defined in Lorentz.Entrypoints.Doc Methods build :: ParamBuildingStep -> Builder #

data PlainEntrypointsKind #

Instances

Instances details

Eq (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (/=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool #
Ord (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods compare :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Ordering # (<) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (<=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (>) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # (>=) :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> Bool # max :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind # min :: DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind -> DEntrypoint PlainEntrypointsKind #
Show (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> DEntrypoint PlainEntrypointsKind -> ShowS # show :: DEntrypoint PlainEntrypointsKind -> String # showList :: [DEntrypoint PlainEntrypointsKind] -> ShowS #
DocItem (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc Associated Types type DocItemPlacement (DEntrypoint PlainEntrypointsKind) :: DocItemPlacementKind # type DocItemReferenced (DEntrypoint PlainEntrypointsKind) :: DocItemReferencedKind # Methods docItemPos :: Natural # docItemSectionName :: Maybe Text # docItemSectionDescription :: Maybe Markdown # docItemSectionNameStyle :: DocSectionNameStyle # docItemRef :: DEntrypoint PlainEntrypointsKind -> DocItemRef (DocItemPlacement (DEntrypoint PlainEntrypointsKind)) (DocItemReferenced (DEntrypoint PlainEntrypointsKind)) # docItemToMarkdown :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemToToc :: HeaderLevel -> DEntrypoint PlainEntrypointsKind -> Markdown # docItemDependencies :: DEntrypoint PlainEntrypointsKind -> [SomeDocDefinitionItem] # docItemsOrder :: [DEntrypoint PlainEntrypointsKind] -> [DEntrypoint PlainEntrypointsKind] #
type DocItemPlacement (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemPlacement (DEntrypoint PlainEntrypointsKind) = 'DocItemInlined
type DocItemReferenced (DEntrypoint PlainEntrypointsKind)
Instance details Defined in Lorentz.Entrypoints.Doc type DocItemReferenced (DEntrypoint PlainEntrypointsKind) = 'True

type family RequireFlatEpDerivation (cp :: t) deriv where ... #

Equations

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

type family RequireFlatParamEps cp where ... #

Equations

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

data EpName #

Instances

Instances details

Eq EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Ord EpName
Instance details Defined in 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 #
Show EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
Generic EpName
Instance details Defined in Michelson.Untyped.Entrypoints Associated Types type Rep EpName :: Type -> Type # Methods from :: EpName -> Rep EpName x # to :: Rep EpName x -> EpName #
Arbitrary FieldAnn => Arbitrary EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods arbitrary :: Gen EpName # shrink :: EpName -> [EpName] #
ToJSON EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods toJSON :: EpName -> Value # toEncoding :: EpName -> Encoding # toJSONList :: [EpName] -> Value # toEncodingList :: [EpName] -> Encoding #
FromJSON EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods parseJSON :: Value -> Parser EpName # parseJSONList :: Value -> Parser [EpName] #
NFData EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods rnf :: EpName -> () #
Buildable EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods build :: EpName -> Builder #
HasCLReader EpName
Instance details Defined in Michelson.Untyped.Entrypoints Methods getReader :: ReadM EpName getMetavar :: String
type Rep EpName
Instance details Defined in Michelson.Untyped.Entrypoints type Rep EpName = D1 ('MetaData "EpName" "Michelson.Untyped.Entrypoints" "morley-1.6.0-inplace" 'True) (C1 ('MetaCons "EpNameUnsafe" 'PrefixI 'True) (S1 ('MetaSel ('Just "unEpName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

customErrorDocHaskellRepGeneral :: forall (tag :: Symbol). (SingI (ToT (ErrorArg tag)), IsError (CustomError tag), TypeHasDoc (ErrorArg tag), CustomErrorHasDoc tag) => Text -> Proxy tag -> Markdown #

errorTagToMText :: forall (tag :: Symbol). Label tag -> MText #

errorTagToText :: forall (tag :: Symbol). KnownSymbol tag => Text #

failUnexpected :: forall (s :: [Type]) (t :: [Type]). MText -> s :-> t #

failUsing :: forall e (s :: [Type]) (t :: [Type]). IsError e => e -> s :-> t #

isoErrorFromVal :: forall (t :: T) e. (Typeable t, Typeable (ToT e), IsoValue e) => Value t -> Either Text e #

isoErrorToVal :: (KnownError e, IsoValue e) => e -> (forall (t :: T). ErrorScope t => Value t -> r) -> r #

typeDocMdDescriptionReferToError :: IsError e => Markdown #

data CustomError (tag :: Symbol) #

Constructors

CustomError
Fields ceTag :: Label tag ceArg :: ErrorArg tag

Instances

Instances details

Eq (ErrorArg tag) => Eq (CustomError tag)
Instance details Defined in Lorentz.Errors Methods (==) :: CustomError tag -> CustomError tag -> Bool # (/=) :: CustomError tag -> CustomError tag -> Bool #
Show (ErrorArg tag) => Show (CustomError tag)
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> CustomError tag -> ShowS # show :: CustomError tag -> String # showList :: [CustomError tag] -> ShowS #
(CustomErrorHasDoc tag, SingI (ToT (ErrorArg tag))) => ErrorHasDoc (CustomError tag)
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (CustomError tag) # Methods errorDocName :: Text # errorDocMdCause :: Markdown # errorDocMdCauseInEntrypoint :: Markdown # errorDocHaskellRep :: Markdown # errorDocClass :: ErrorClass # errorDocDependencies :: [SomeDocDefinitionItem] # errorDocRequirements :: Dict (ErrorRequirements (CustomError tag)) #
(CustomErrorHasDoc tag, KnownError (ErrorArg tag), IsoValue (ErrorArg tag)) => IsError (CustomError tag)
Instance details Defined in Lorentz.Errors Methods errorToVal :: CustomError tag -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (CustomError tag) #
(WellTypedIsoValue (ErrorArg tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag)
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 #
ErrorHasNumericDoc (CustomError tag)
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods numericErrorDocHaskellRep :: Text -> Markdown numericErrorDocTextualTag :: Text
Eq (ErrorArg tag) => Eq (() -> CustomError tag)
Instance details Defined in Lorentz.Errors Methods (==) :: (() -> CustomError tag) -> (() -> CustomError tag) -> Bool # (/=) :: (() -> CustomError tag) -> (() -> CustomError tag) -> Bool #
Show (ErrorArg tag) => Show (() -> CustomError tag)
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> (() -> CustomError tag) -> ShowS # show :: (() -> CustomError tag) -> String # showList :: [() -> CustomError tag] -> ShowS #
(Typeable arg, ErrorHasDoc (CustomError tag)) => ErrorHasDoc (arg -> CustomError tag)
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements (arg -> CustomError tag) # Methods errorDocName :: Text # errorDocMdCause :: Markdown # errorDocMdCauseInEntrypoint :: Markdown # errorDocHaskellRep :: Markdown # errorDocClass :: ErrorClass # errorDocDependencies :: [SomeDocDefinitionItem] # errorDocRequirements :: Dict (ErrorRequirements (arg -> CustomError tag)) #
(Typeable arg, IsError (CustomError tag), TypeErrorUnless (arg == ()) notVoidError, arg ~ ErrorArg tag, notVoidError ~ ('Text "This error requires argument of type " :<>: 'ShowType (ErrorArg tag))) => IsError (arg -> CustomError tag)
Instance details Defined in Lorentz.Errors Methods errorToVal :: (arg -> CustomError tag) -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (arg -> CustomError tag) #
type ToT (CustomError tag)
Instance details Defined in Lorentz.Errors type ToT (CustomError tag) = ToT (MText, ErrorArg tag)
type ErrorRequirements (CustomError tag)
Instance details Defined in Lorentz.Errors type ErrorRequirements (CustomError tag) = (CustomErrorHasDoc tag, SingI (ToT (ErrorArg tag)))
type ErrorRequirements (arg -> CustomError tag)
Instance details Defined in Lorentz.Errors type ErrorRequirements (arg -> CustomError tag) = ()

class (KnownSymbol tag, TypeHasDoc (ErrorArg tag), IsError (CustomError tag)) => CustomErrorHasDoc (tag :: Symbol) where #

Minimal complete definition

customErrDocMdCause, customErrClass

Methods

customErrDocMdCause :: Markdown #

customErrDocMdCauseInEntrypoint :: Markdown #

customErrClass :: ErrorClass #

customErrArgumentSemantics :: Maybe Markdown #

data DError where #

Constructors

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

Instances

Instances details

Eq DError
Instance details Defined in Lorentz.Errors Methods (==) :: DError -> DError -> Bool # (/=) :: DError -> DError -> Bool #
Ord DError
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
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
Instance details Defined in Lorentz.Errors type DocItemPlacement DError = 'DocItemInDefinitions
type DocItemReferenced DError
Instance details Defined in Lorentz.Errors type DocItemReferenced DError = 'True

data DThrows where #

Constructors

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

Instances

Instances details

Eq DThrows
Instance details Defined in Lorentz.Errors Methods (==) :: DThrows -> DThrows -> Bool # (/=) :: DThrows -> DThrows -> Bool #
DocItem DThrows
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
Instance details Defined in Lorentz.Errors type DocItemPlacement DThrows = 'DocItemInlined
type DocItemReferenced DThrows
Instance details Defined in Lorentz.Errors type DocItemReferenced DThrows = 'False

type family ErrorArg (tag :: Symbol) #

Instances

Instances details

type ErrorArg "senderIsNotAdmin"
Instance details Defined in Lorentz.Errors.Common type ErrorArg "senderIsNotAdmin" = ()
type ErrorArg "uparamArgumentUnpackFailed"
Instance details Defined in Lorentz.UParam type ErrorArg "uparamArgumentUnpackFailed" = ()
type ErrorArg "uparamNoSuchEntrypoint"
Instance details Defined in Lorentz.UParam type ErrorArg "uparamNoSuchEntrypoint" = MText

data ErrorClass #

Constructors

ErrClassActionException
ErrClassBadArgument
ErrClassContractInternal
ErrClassUnknown

Instances

Instances details

Buildable ErrorClass
Instance details Defined in Lorentz.Errors Methods build :: ErrorClass -> Builder #

class Typeable e => ErrorHasDoc e where #

Minimal complete definition

errorDocName, errorDocMdCause, errorDocHaskellRep, errorDocDependencies

Associated Types

type ErrorRequirements e #

type ErrorRequirements e = () #

Methods

errorDocName :: Text #

errorDocMdCause :: Markdown #

errorDocMdCauseInEntrypoint :: Markdown #

errorDocHaskellRep :: Markdown #

errorDocClass :: ErrorClass #

errorDocDependencies :: [SomeDocDefinitionItem] #

errorDocRequirements :: Dict (ErrorRequirements e) #

Instances

Instances details

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

type family ErrorRequirements e #

Instances

Instances details

type ErrorRequirements ()
Instance details Defined in Lorentz.Errors type ErrorRequirements () = ()
type ErrorRequirements MText
Instance details Defined in Lorentz.Errors type ErrorRequirements MText = ()
type ErrorRequirements UnspecifiedError
Instance details Defined in Lorentz.Errors type ErrorRequirements UnspecifiedError = ()
type ErrorRequirements NumericTextError
Instance details Defined in Lorentz.Errors.Numeric.Doc type ErrorRequirements NumericTextError = ()
type ErrorRequirements (CustomError tag)
Instance details Defined in Lorentz.Errors type ErrorRequirements (CustomError tag) = (CustomErrorHasDoc tag, SingI (ToT (ErrorArg tag)))
type ErrorRequirements (VoidResult r)
Instance details Defined in Lorentz.Macro type ErrorRequirements (VoidResult r) = ()
type ErrorRequirements (arg -> CustomError tag)
Instance details Defined in Lorentz.Errors type ErrorRequirements (arg -> CustomError tag) = ()
type ErrorRequirements (NumericErrorWrapper numTag err)
Instance details Defined in Lorentz.Errors.Numeric.Doc type ErrorRequirements (NumericErrorWrapper numTag err) = ()

type ErrorScope (t :: T) = (Typeable t, ConstantScope t) #

class (Typeable e, ErrorHasDoc e) => IsError e where #

Methods

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

errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text e #

Instances

Instances details

(TypeError ('Text "Use representative error messages") :: Constraint) => IsError ()
Instance details Defined in Lorentz.Errors Methods errorToVal :: () -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text () #
IsError MText
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text MText #
IsError UnspecifiedError
Instance details Defined in Lorentz.Errors Methods errorToVal :: UnspecifiedError -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text UnspecifiedError #
(CustomErrorHasDoc tag, KnownError (ErrorArg tag), IsoValue (ErrorArg tag)) => IsError (CustomError tag)
Instance details Defined in Lorentz.Errors Methods errorToVal :: CustomError tag -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (CustomError tag) #
(Typeable r, NiceConstant r, ErrorHasDoc (VoidResult r)) => IsError (VoidResult r)
Instance details Defined in Lorentz.Macro Methods errorToVal :: VoidResult r -> (forall (t :: T). ErrorScope t => Value t -> r0) -> r0 # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (VoidResult r) #
(Typeable arg, IsError (CustomError tag), TypeErrorUnless (arg == ()) notVoidError, arg ~ ErrorArg tag, notVoidError ~ ('Text "This error requires argument of type " :<>: 'ShowType (ErrorArg tag))) => IsError (arg -> CustomError tag)
Instance details Defined in Lorentz.Errors Methods errorToVal :: (arg -> CustomError tag) -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (arg -> CustomError tag) #

type RequireNoArgError (tag :: Symbol) (msg :: ErrorMessage) = (TypeErrorUnless (ErrorArg tag == ()) msg, msg ~ ('Text "Expected no-arg error, but given error requires argument of type " :<>: 'ShowType (ErrorArg tag))) #

data SomeError #

Constructors

(IsError e, Eq e) => SomeError e

Instances

Instances details

Eq SomeError
Instance details Defined in Lorentz.Errors Methods (==) :: SomeError -> SomeError -> Bool # (/=) :: SomeError -> SomeError -> Bool #
Show SomeError
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> SomeError -> ShowS # show :: SomeError -> String # showList :: [SomeError] -> ShowS #
Buildable SomeError
Instance details Defined in Lorentz.Errors Methods build :: SomeError -> Builder #

data UnspecifiedError #

Constructors

UnspecifiedError

Instances

Instances details

Generic UnspecifiedError
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
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements UnspecifiedError # Methods errorDocName :: Text # errorDocMdCause :: Markdown # errorDocMdCauseInEntrypoint :: Markdown # errorDocHaskellRep :: Markdown # errorDocClass :: ErrorClass # errorDocDependencies :: [SomeDocDefinitionItem] # errorDocRequirements :: Dict (ErrorRequirements UnspecifiedError) #
IsError UnspecifiedError
Instance details Defined in Lorentz.Errors Methods errorToVal :: UnspecifiedError -> (forall (t :: T). ErrorScope t => Value t -> r) -> r # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text UnspecifiedError #
IsoValue UnspecifiedError
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
Instance details Defined in Lorentz.Errors type Rep UnspecifiedError = D1 ('MetaData "UnspecifiedError" "Lorentz.Errors" "lorentz-0.6.0-inplace" 'False) (C1 ('MetaCons "UnspecifiedError" 'PrefixI 'False) (U1 :: Type -> Type))
type ToT UnspecifiedError
Instance details Defined in Lorentz.Errors type ToT UnspecifiedError = GValueType (Rep UnspecifiedError)
type ErrorRequirements UnspecifiedError
Instance details Defined in Lorentz.Errors type ErrorRequirements UnspecifiedError = ()

class WellTypedToT a => IsoValue a where #

Minimal complete definition

Nothing

Associated Types

type ToT a :: T #

type ToT a = GValueType (Rep a) #

Methods

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

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

Instances

Instances details

IsoValue Bool
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
IsoValue Integer
Instance details Defined in 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 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 Michelson.Typed.Haskell.Value Associated Types type ToT () :: T # Methods toVal :: () -> Value (ToT ()) # fromVal :: Value (ToT ()) -> () #
IsoValue ByteString
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
(DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
IsoValue Address
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
IsoValue EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
IsoValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
IsoValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
IsoValue Mutez
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
IsoValue Operation
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Operation :: T # Methods toVal :: Operation -> Value (ToT Operation) # fromVal :: Value (ToT Operation) -> Operation #
IsoValue PublicKey
Instance details Defined in 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 Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
IsoValue Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
IsoValue UnspecifiedError
Instance details Defined in Lorentz.Errors Associated Types type ToT UnspecifiedError :: T # Methods toVal :: UnspecifiedError -> Value (ToT UnspecifiedError) # fromVal :: Value (ToT UnspecifiedError) -> UnspecifiedError #
IsoValue ChainId
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
IsoValue MyNatural
Instance details Defined in Lorentz.UStore.Instr Associated Types type ToT MyNatural :: T # Methods toVal :: MyNatural -> Value (ToT MyNatural) # fromVal :: Value (ToT MyNatural) -> MyNatural #
IsoValue MyType2
Instance details Defined in 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 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 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 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 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 Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyTypeWithNamedField :: T # Methods toVal :: MyTypeWithNamedField -> Value (ToT MyTypeWithNamedField) # fromVal :: Value (ToT MyTypeWithNamedField) -> MyTypeWithNamedField #
IsoValue a => IsoValue [a]
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT [a] :: T # Methods toVal :: [a] -> Value (ToT [a]) # fromVal :: Value (ToT [a]) -> [a] #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in 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 (Identity a)
Instance details Defined in 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 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 #
WellTypedToT arg => IsoValue (ContractRef arg)
Instance details Defined in 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 (FutureContract arg)
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 #
WellTypedIsoValue r => IsoValue (ShouldHaveEntrypoints r)
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 #
(WellTypedIsoValue (ErrorArg tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag)
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 #
(WellTypedIsoValue (VoidResult r), TypeError ('Text "No IsoValue instance for VoidResult " :<>: 'ShowType r) :: Constraint) => IsoValue (VoidResult r)
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 (UParam entries)
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 (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type ToT (UStore a) :: T # Methods toVal :: UStore a -> Value (ToT (UStore a)) # fromVal :: Value (ToT (UStore a)) -> UStore a #
(IsoValue l, IsoValue r) => IsoValue (Either l r)
Instance details Defined in 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 a, IsoValue b) => IsoValue (a, b)
Instance details Defined in 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) #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in 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 #
(WellTypedToT k, WellTypedToT v, Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (BigMap k v)
Instance details Defined in 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 (TAddress p)
Instance details Defined in Lorentz.Address Associated Types type ToT (TAddress p) :: T # Methods toVal :: TAddress p -> Value (ToT (TAddress p)) # fromVal :: Value (ToT (TAddress p)) -> TAddress p #
IsoValue cp => IsoValue (ParameterWrapper deriv cp)
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 #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (View a r)
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 #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (Void_ a r)
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 (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type ToT (MigrationScript oldStore newStore) :: T # Methods toVal :: MigrationScript oldStore newStore -> Value (ToT (MigrationScript oldStore newStore)) # fromVal :: Value (ToT (MigrationScript oldStore newStore)) -> MigrationScript oldStore newStore #
(IsoValue a, IsoValue b, IsoValue c) => IsoValue (a, b, c)
Instance details Defined in 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 a => IsoValue (NamedF Maybe a name)
Instance details Defined in 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 (NamedF Identity a name)
Instance details Defined in 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 b, IsoValue c, IsoValue d) => IsoValue (a, b, c, d)
Instance details Defined in 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 (MUStore oldTemplate newTemplate remDiff touched)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type ToT (MUStore oldTemplate newTemplate remDiff touched) :: T # Methods toVal :: MUStore oldTemplate newTemplate remDiff touched -> Value (ToT (MUStore oldTemplate newTemplate remDiff touched)) # fromVal :: Value (ToT (MUStore oldTemplate newTemplate remDiff touched)) -> MUStore oldTemplate newTemplate remDiff touched #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e) => IsoValue (a, b, c, d, e)
Instance details Defined in 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 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 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 WellTypedIsoValue a = (WellTyped (ToT a), IsoValue a) #

addNewErrorTags :: ErrorTagMap -> HashSet MText -> ErrorTagMap #

applyErrorTagMap :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out #

applyErrorTagMapWithExclusions :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> ErrorTagExclusions -> (inp :-> out) -> inp :-> out #

buildErrorTagMap :: HashSet MText -> ErrorTagMap #

errorFromValNumeric :: forall (t :: T) e. (KnownT t, IsError e) => ErrorTagMap -> Value t -> Either Text e #

errorToValNumeric :: IsError e => ErrorTagMap -> e -> (forall (t :: T). ErrorScope t => Value t -> r) -> r #

excludeErrorTags :: HasCallStack => ErrorTagExclusions -> ErrorTagMap -> ErrorTagMap #

gatherErrorTags :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> HashSet MText #

useNumericErrors :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => (inp :-> out) -> (inp :-> out, ErrorTagMap) #

applyErrorTagToErrorsDoc :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => ErrorTagMap -> (inp :-> out) -> inp :-> out #

applyErrorTagToErrorsDocWith :: forall (inp :: [Type]) (out :: [Type]). HasCallStack => [NumericErrorDocHandler] -> ErrorTagMap -> (inp :-> out) -> inp :-> out #

baseErrorDocHandlers :: [NumericErrorDocHandler] #

customErrorDocHandler :: NumericErrorDocHandler #

voidResultDocHandler :: NumericErrorDocHandler #

type ErrorTagExclusions = HashSet MText #

type ErrorTagMap = Bimap Natural MText #

data DDescribeErrorTagMap #

Constructors

DDescribeErrorTagMap
Fields detmSrcLoc :: Text

Instances

Instances details

Eq DDescribeErrorTagMap
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods (==) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (/=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool #
Ord DDescribeErrorTagMap
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
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
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemPlacement DDescribeErrorTagMap = 'DocItemInDefinitions
type DocItemReferenced DDescribeErrorTagMap
Instance details Defined in Lorentz.Errors.Numeric.Doc type DocItemReferenced DDescribeErrorTagMap = 'True

data NumericErrorDocHandler #

data NumericErrorDocHandlerError #

data NumericErrorWrapper (numTag :: Nat) err #

Instances

Instances details

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

printComment :: forall (s :: [Type]). PrintComment (ToTs s) -> s :-> s #

stackRef :: forall (gn :: Nat) (st :: [T]) (n :: Peano). (n ~ ToPeano gn, SingI n, KnownPeano n, RequireLongerThan st n) => PrintComment st #

stackType :: forall (s :: [Type]). s :-> s #

testAssert :: forall (out :: [Type]) (inp :: [Type]). (Typeable (ToTs out), HasCallStack) => Text -> PrintComment (ToTs inp) -> (inp :-> (Bool & out)) -> inp :-> inp #

class NonZero t #

Minimal complete definition

nonZero

Instances

Instances details

NonZero Integer
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s)
NonZero Natural
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s)

data ChainId #

Instances

Instances details

Eq ChainId
Instance details Defined in Tezos.Core Methods (==) :: ChainId -> ChainId -> Bool # (/=) :: ChainId -> ChainId -> Bool #
Show ChainId
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> ChainId -> ShowS # show :: ChainId -> String # showList :: [ChainId] -> ShowS #
Generic ChainId
Instance details Defined in Tezos.Core Associated Types type Rep ChainId :: Type -> Type # Methods from :: ChainId -> Rep ChainId x # to :: Rep ChainId x -> ChainId #
Arbitrary ChainId
Instance details Defined in Tezos.Core Methods arbitrary :: Gen ChainId # shrink :: ChainId -> [ChainId] #
ToJSON ChainId
Instance details Defined in Tezos.Core Methods toJSON :: ChainId -> Value # toEncoding :: ChainId -> Encoding # toJSONList :: [ChainId] -> Value # toEncodingList :: [ChainId] -> Encoding #
FromJSON ChainId
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser ChainId # parseJSONList :: Value -> Parser [ChainId] #
NFData ChainId
Instance details Defined in Tezos.Core Methods rnf :: ChainId -> () #
Buildable ChainId
Instance details Defined in Tezos.Core Methods build :: ChainId -> Builder #
IsoValue ChainId
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
type Rep ChainId
Instance details Defined in Tezos.Core type Rep ChainId = D1 ('MetaData "ChainId" "Tezos.Core" "morley-1.6.0-inplace" 'True) (C1 ('MetaCons "ChainIdUnsafe" 'PrefixI 'True) (S1 ('MetaSel ('Just "unChainId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ByteString)))
type ToT ChainId
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ChainId = 'TChainId

class ConcatOp (ToT c) => ConcatOpHs c #

Instances

Instances details

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

type List = [] #

class (EDivOp (ToT n) (ToT m), NiceComparable n, NiceComparable m, ToT (EDivOpResHs n m) ~ EDivOpRes (ToT n) (ToT m), ToT (EModOpResHs n m) ~ EModOpRes (ToT n) (ToT m)) => EDivOpHs n m #

Associated Types

type EDivOpResHs n m #

type EModOpResHs n m #

Instances

Instances details

EDivOpHs Integer Integer
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Integer # type EModOpResHs Integer Integer #
EDivOpHs Integer Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural # type EModOpResHs Integer Natural #
EDivOpHs Natural Integer
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer # type EModOpResHs Natural Integer #
EDivOpHs Natural Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Natural # type EModOpResHs Natural Natural #
EDivOpHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural # type EModOpResHs Mutez Natural #
EDivOpHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Mutez # type EModOpResHs Mutez Mutez #

type family EDivOpResHs n m #

Instances

Instances details

type EDivOpResHs Integer Integer
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Integer = Integer
type EDivOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EDivOpResHs Natural Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Natural = Natural
type EDivOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EDivOpResHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Mutez = Natural

type family EModOpResHs n m #

Instances

Instances details

type EModOpResHs Integer Integer
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Integer = Natural
type EModOpResHs Integer Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type EModOpResHs Natural Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Natural = Natural
type EModOpResHs Mutez Natural
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type EModOpResHs Mutez Mutez
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Mutez = Mutez

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

Associated Types

type MemOpKeyHs c #

Instances

Instances details

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

type family MemOpKeyHs c #

Instances

Instances details

type MemOpKeyHs (Set e)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) = e
type MemOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type MemOpKeyHs (UStore a) = MemOpKeyHs (BigMap ByteString ByteString)
type MemOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) = k
type MemOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (BigMap k v) = k

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

Associated Types

type GetOpKeyHs c #

type GetOpValHs c #

Instances

Instances details

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

type family GetOpValHs c #

Instances

Instances details

type GetOpValHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type GetOpValHs (UStore a) = GetOpValHs (BigMap ByteString ByteString)
type GetOpValHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (Map k v) = v
type GetOpValHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (BigMap k v) = v

type family GetOpKeyHs c #

Instances

Instances details

type GetOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type GetOpKeyHs (UStore a) = GetOpKeyHs (BigMap ByteString ByteString)
type GetOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) = k
type GetOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (BigMap k v) = k

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

Associated Types

type IterOpElHs c #

Instances

Instances details

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

type family IterOpElHs c #

Instances

Instances details

type IterOpElHs [e]
Instance details Defined in Lorentz.Polymorphic type IterOpElHs [e] = e
type IterOpElHs (Set e)
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Set e) = e
type IterOpElHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) = (k, v)

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

Associated Types

type MapOpInpHs c #

type MapOpResHs c :: Type -> Type #

Instances

Instances details

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

type family IsoMapOpRes c b where ... #

Equations

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

type family MapOpInpHs c #

Instances

Instances details

type MapOpInpHs [e]
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs [e] = e
type MapOpInpHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) = (k, v)

type family MapOpResHs c :: Type -> Type #

Instances

Instances details

type MapOpResHs [e]
Instance details Defined in Lorentz.Polymorphic type MapOpResHs [e] = []
type MapOpResHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Map k v) = Map k

class SizeOp (ToT c) => SizeOpHs c #

Instances

Instances details

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

class SliceOp (ToT c) => SliceOpHs c #

Instances

Instances details

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

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

Associated Types

type UpdOpKeyHs c #

type UpdOpParamsHs c #

Instances

Instances details

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

type family UpdOpKeyHs c #

Instances

Instances details

type UpdOpKeyHs (Set a)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) = a
type UpdOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type UpdOpKeyHs (UStore a) = UpdOpKeyHs (BigMap ByteString ByteString)
type UpdOpKeyHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) = k
type UpdOpKeyHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (BigMap k v) = k

type family UpdOpParamsHs c #

Instances

Instances details

type UpdOpParamsHs (Set a)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Set a) = Bool
type UpdOpParamsHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type UpdOpParamsHs (UStore a) = UpdOpParamsHs (BigMap ByteString ByteString)
type UpdOpParamsHs (Map k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Map k v) = Maybe v
type UpdOpParamsHs (BigMap k v)
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (BigMap k v) = Maybe v

voidResultTag :: MText #

data View a r #

Instances

Instances details

(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (View a1 r1 :: Type) (View a2 r2 :: Type)
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (View a1 r1) -> Proxy (View a2 r2) -> () #
Eq a => Eq (View a r)
Instance details Defined in Lorentz.Macro Methods (==) :: View a r -> View a r -> Bool # (/=) :: View a r -> View a r -> Bool #
Show a => Show (View a r)
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> View a r -> ShowS # show :: View a r -> String # showList :: [View a r] -> ShowS #
Generic (View a r)
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 #
WellTypedIsoValue r => Buildable (View () r)
Instance details Defined in Lorentz.Macro Methods build :: View () r -> Builder #
(Buildable a, WellTypedIsoValue r) => Buildable (View a r)
Instance details Defined in Lorentz.Macro Methods build :: View a r -> Builder #
(HasAnnotation a, HasAnnotation r) => HasAnnotation (View a r)
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (View a r))
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (View a r)
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) #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (View a r)
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 #
type Rep (View a r)
Instance details Defined in Lorentz.Macro type Rep (View a r) = D1 ('MetaData "View" "Lorentz.Macro" "lorentz-0.6.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 ToT (View a r)
Instance details Defined in Lorentz.Macro type ToT (View a r) = GValueType (Rep (View a r))
type TypeDocFieldDescriptions (View a r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (View a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

data VoidResult r #

Instances

Instances details

Eq r => Eq (VoidResult r)
Instance details Defined in Lorentz.Macro Methods (==) :: VoidResult r -> VoidResult r -> Bool # (/=) :: VoidResult r -> VoidResult r -> Bool #
Generic (VoidResult r)
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 #
(TypeHasDoc r, IsError (VoidResult r)) => TypeHasDoc (VoidResult r)
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 r => ErrorHasDoc (VoidResult r)
Instance details Defined in Lorentz.Macro Associated Types type ErrorRequirements (VoidResult r) # Methods errorDocName :: Text # errorDocMdCause :: Markdown # errorDocMdCauseInEntrypoint :: Markdown # errorDocHaskellRep :: Markdown # errorDocClass :: ErrorClass # errorDocDependencies :: [SomeDocDefinitionItem] # errorDocRequirements :: Dict (ErrorRequirements (VoidResult r)) #
(Typeable r, NiceConstant r, ErrorHasDoc (VoidResult r)) => IsError (VoidResult r)
Instance details Defined in Lorentz.Macro Methods errorToVal :: VoidResult r -> (forall (t :: T). ErrorScope t => Value t -> r0) -> r0 # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text (VoidResult r) #
(WellTypedIsoValue (VoidResult r), TypeError ('Text "No IsoValue instance for VoidResult " :<>: 'ShowType r) :: Constraint) => IsoValue (VoidResult r)
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 #
ErrorHasDoc (VoidResult res) => ErrorHasNumericDoc (VoidResult res)
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods numericErrorDocHaskellRep :: Text -> Markdown numericErrorDocTextualTag :: Text
type Rep (VoidResult r)
Instance details Defined in Lorentz.Macro type Rep (VoidResult r) = D1 ('MetaData "VoidResult" "Lorentz.Macro" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "VoidResult" 'PrefixI 'True) (S1 ('MetaSel ('Just "unVoidResult") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 r)))
type ToT (VoidResult r)
Instance details Defined in Lorentz.Macro type ToT (VoidResult r) = TypeError ('Text "No IsoValue instance for VoidResult " :<>: 'ShowType r) :: T
type TypeDocFieldDescriptions (VoidResult r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (VoidResult r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ErrorRequirements (VoidResult r)
Instance details Defined in Lorentz.Macro type ErrorRequirements (VoidResult r) = ()

data Void_ a b #

Instances

Instances details

(CanCastTo a1 a2, CanCastTo r1 r2) => CanCastTo (Void_ a1 r1 :: Type) (Void_ a2 r2 :: Type)
Instance details Defined in Lorentz.Macro Methods castDummy :: Proxy (Void_ a1 r1) -> Proxy (Void_ a2 r2) -> () #
Show a => Show (Void_ a b)
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> Void_ a b -> ShowS # show :: Void_ a b -> String # showList :: [Void_ a b] -> ShowS #
Generic (Void_ a b)
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 #
Buildable a => Buildable (Void_ a b)
Instance details Defined in Lorentz.Macro Methods build :: Void_ a b -> Builder #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Void_ a b)
Instance details Defined in Lorentz.Macro Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Void_ a b))
Each '[Typeable :: Type -> Constraint, TypeHasDoc] '[a, r] => TypeHasDoc (Void_ a r)
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) #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (Void_ a r)
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 #
type Rep (Void_ a b)
Instance details Defined in Lorentz.Macro type Rep (Void_ a b) = D1 ('MetaData "Void_" "Lorentz.Macro" "lorentz-0.6.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 ToT (Void_ a r)
Instance details Defined in Lorentz.Macro type ToT (Void_ a r) = GValueType (Rep (Void_ a r))
type TypeDocFieldDescriptions (Void_ a r)
Instance details Defined in Lorentz.Macro type TypeDocFieldDescriptions (Void_ a r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

class ToContractRef cp contract where #

Methods

toContractRef :: contract -> ContractRef cp #

Instances

Instances details

(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp')
Instance details Defined in Lorentz.Address Methods toContractRef :: FutureContract cp' -> ContractRef cp #
cp ~ cp' => ToContractRef cp (ContractRef cp')
Instance details Defined in Lorentz.Address Methods toContractRef :: ContractRef cp' -> ContractRef cp #
(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)
Instance details Defined in Lorentz.Address Methods toContractRef :: TAddress cp -> ContractRef arg #

expressionToScriptExpr :: Expression -> ByteString #

lEncodeValue :: NicePrintedValue a => a -> ByteString #

lPackValue :: NicePackedValue a => a -> ByteString #

lUnpackValue :: NiceUnpackedValue a => ByteString -> Either UnpackError a #

valueToScriptExpr :: NicePackedValue t => t -> ByteString #

printLorentzContract :: (NiceParameterFull cp, NiceStorage st) => Bool -> Contract cp st -> LText #

printLorentzValue :: NicePrintedValue v => Bool -> v -> LText #

dipT :: forall a (inp :: [Type]) (dinp :: [Type]) (dout :: [Type]) (out :: [Type]). DipT inp a inp dinp dout out => (dinp :-> dout) -> inp :-> out #

dropT :: forall a (inp :: [Type]) (dinp :: [Type]) (dout :: [Type]) (out :: [Type]). (DipT inp a inp dinp dout out, dinp ~ (a ': dout)) => inp :-> out #

dupT :: forall a (st :: [Type]). DupT st a st => st :-> (a ': st) #

analyzeLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> AnalyzerRes #

compileLorentz :: forall (inp :: [Type]) (out :: [Type]). (inp :-> out) -> Instr (ToTs inp) (ToTs out) #

compileLorentzContract :: (NiceParameterFull cp, NiceStorage st) => Contract cp st -> Contract (ToT cp) (ToT st) #

compileLorentzWithOptions :: forall (inp :: [Type]) (out :: [Type]). CompilationOptions -> (inp :-> out) -> Instr (ToTs inp) (ToTs out) #

defaultCompilationOptions :: CompilationOptions #

defaultContract :: ContractCode cp st -> Contract cp st #

interpretLorentzInstr :: forall (inp :: [Type]) (out :: [Type]). (IsoValuesStack inp, IsoValuesStack out) => ContractEnv -> (inp :-> out) -> Rec Identity inp -> Either MichelsonFailed (Rec Identity out) #

interpretLorentzLambda :: (IsoValue inp, IsoValue out) => ContractEnv -> Lambda inp out -> inp -> Either MichelsonFailed out #

data CompilationOptions #

Constructors

CompilationOptions
Fields coOptimizerConf :: Maybe OptimizerConf coStringTransformer :: (Bool, MText -> MText) coBytesTransformer :: (Bool, ByteString -> ByteString)

composeStoreEntrypointOps :: forall (nameInStore :: Symbol) store substore (epName :: Symbol) epParam epStore. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreEntrypointOps substore epName epParam epStore -> StoreEntrypointOps store epName epParam epStore #

composeStoreFieldOps :: forall (nameInStore :: Symbol) store substore (nameInSubstore :: Symbol) field. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreFieldOps substore nameInSubstore field -> StoreFieldOps store nameInSubstore field #

composeStoreSubmapOps :: forall (nameInStore :: Symbol) store substore (mname :: Symbol) key value. Label nameInStore -> StoreFieldOps store nameInStore substore -> StoreSubmapOps substore mname key value -> StoreSubmapOps store mname key value #

mkStoreEp :: forall (epName :: Symbol) epParam epStore. Label epName -> EntrypointLambda epParam epStore -> EntrypointsField epParam epStore #

stDelete :: forall store (mname :: Symbol) key value (s :: [Type]). (StoreHasSubmap store mname key value, KnownValue value) => Label mname -> (key ': (store ': s)) :-> (store ': s) #

stEntrypoint :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (epParam ': (store ': s)) :-> (([Operation], store) ': s) #

stGet :: forall store (mname :: Symbol) key value (s :: [Type]). (StoreHasSubmap store mname key value, KnownValue value) => Label mname -> (key ': (store ': s)) :-> (Maybe value ': s) #

stGetEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': (store ': s)) #

stGetEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (epStore ': (store ': s)) #

stGetField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (store ': s) :-> (ftype ': (store ': s)) #

stInsert :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (value ': (store ': s))) :-> (store ': s) #

stInsertNew :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (forall (s0 :: [Type]) (any :: [Type]). (key ': s0) :-> any) -> (key ': (value ': (store ': s))) :-> (store ': s) #

stMem :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (store ': s)) :-> (Bool ': s) #

stSetEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (EntrypointLambda epParam epStore ': (store ': s)) :-> (store ': s) #

stSetEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (epStore ': (store ': s)) :-> (store ': s) #

stSetField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (ftype ': (store ': s)) :-> (store ': s) #

stToEpLambda :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': s) #

stToEpStore :: forall store (epName :: Symbol) epParam epStore (s :: [Type]). StoreHasEntrypoint store epName epParam epStore => Label epName -> (store ': s) :-> (epStore ': s) #

stToField :: forall store (fname :: Symbol) ftype (s :: [Type]). StoreHasField store fname ftype => Label fname -> (store ': s) :-> (ftype ': s) #

stUpdate :: forall store (mname :: Symbol) key value (s :: [Type]). StoreHasSubmap store mname key value => Label mname -> (key ': (Maybe value ': (store ': s))) :-> (store ': s) #

storeEntrypointOpsADT :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (HasFieldOfType store epmName (EntrypointsField epParam epStore), HasFieldOfType store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore #

storeEntrypointOpsDeeper :: forall store (nameInStore :: Symbol) substore (epName :: Symbol) epParam epStore. (HasFieldOfType store nameInStore substore, StoreHasEntrypoint substore epName epParam epStore) => Label nameInStore -> StoreEntrypointOps store epName epParam epStore #

storeEntrypointOpsFields :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (StoreHasField store epmName (EntrypointsField epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore #

storeEntrypointOpsReferTo :: forall (epName :: Symbol) store epParam epStore (desiredName :: Symbol). Label epName -> StoreEntrypointOps store epName epParam epStore -> StoreEntrypointOps store desiredName epParam epStore #

storeEntrypointOpsSubmapField :: forall store (epmName :: Symbol) epParam epStore (epsName :: Symbol) (epName :: Symbol). (StoreHasSubmap store epmName MText (EntrypointLambda epParam epStore), StoreHasField store epsName epStore, KnownValue epParam, KnownValue epStore) => Label epmName -> Label epsName -> StoreEntrypointOps store epName epParam epStore #

storeFieldOpsADT :: forall dt (fname :: Symbol) ftype. HasFieldOfType dt fname ftype => StoreFieldOps dt fname ftype #

storeFieldOpsDeeper :: forall storage (fieldsPartName :: Symbol) fields (fname :: Symbol) ftype. (HasFieldOfType storage fieldsPartName fields, StoreHasField fields fname ftype) => Label fieldsPartName -> StoreFieldOps storage fname ftype #

storeFieldOpsReferTo :: forall (name :: Symbol) storage field (desiredName :: Symbol). Label name -> StoreFieldOps storage name field -> StoreFieldOps storage desiredName field #

storeSubmapOpsDeeper :: forall storage (bigMapPartName :: Symbol) fields (mname :: Symbol) key value. (HasFieldOfType storage bigMapPartName fields, StoreHasSubmap fields mname key value) => Label bigMapPartName -> StoreSubmapOps storage mname key value #

storeSubmapOpsReferTo :: forall (name :: Symbol) storage key value (desiredName :: Symbol). Label name -> StoreSubmapOps storage name key value -> StoreSubmapOps storage desiredName key value #

data (param :: k) ::-> (store :: k1) #

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

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

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

Equations

StorageContains _1 ('[] :: [NamedField]) = ()
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 StoreEntrypointOps store (epName :: Symbol) epParam epStore #

Constructors

StoreEntrypointOps

Fields

sopToEpLambda :: forall (s :: [Type]). Label epName -> (store ': s) :-> (EntrypointLambda epParam epStore ': s)
sopSetEpLambda :: forall (s :: [Type]). Label epName -> (EntrypointLambda epParam epStore ': (store ': s)) :-> (store ': s)
sopToEpStore :: forall (s :: [Type]). Label epName -> (store ': s) :-> (epStore ': s)
sopSetEpStore :: forall (s :: [Type]). Label epName -> (epStore ': (store ': s)) :-> (store ': s)

data StoreFieldOps store (fname :: Symbol) ftype #

Constructors

StoreFieldOps
Fields sopToField :: forall (s :: [Type]). Label fname -> (store ': s) :-> (ftype ': s) sopSetField :: forall (s :: [Type]). Label fname -> (ftype ': (store ': s)) :-> (store ': s)

class StoreHasEntrypoint store (epName :: Symbol) epParam epStore | store epName -> epParam epStore where #

Methods

storeEpOps :: StoreEntrypointOps store epName epParam epStore #

class StoreHasField store (fname :: Symbol) ftype | store fname -> ftype where #

Methods

storeFieldOps :: StoreFieldOps store fname ftype #

class StoreHasSubmap store (mname :: Symbol) key value | store mname -> key value where #

Methods

storeSubmapOps :: StoreSubmapOps store mname key value #

Instances

Instances details

(key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (Map key' value') name key value
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key' value') name key value #
(key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (BigMap key' value') name key value
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key' value') name key value #

data StoreSubmapOps store (mname :: Symbol) key value #

Constructors

StoreSubmapOps

Fields

sopMem :: forall (s :: [Type]). Label mname -> (key ': (store ': s)) :-> (Bool ': s)
sopGet :: forall (s :: [Type]). KnownValue value => Label mname -> (key ': (store ': s)) :-> (Maybe value ': s)
sopUpdate :: forall (s :: [Type]). Label mname -> (key ': (Maybe value ': (store ': s))) :-> (store ': s)
sopDelete :: forall (s :: [Type]). Maybe (Label mname -> (key ': (store ': s)) :-> (store ': s))
sopInsert :: forall (s :: [Type]). Maybe (Label mname -> (key ': (value ': (store ': s))) :-> (store ': s))

data (k2 :: k) ~> (v :: k1) #

caseUParam :: forall (entries :: [EntrypointKind]) (inp :: [Type]) (out :: [Type]). (CaseUParam entries, RequireUniqueEntrypoints entries) => Rec (CaseClauseU inp out) entries -> UParamFallback inp out -> (UParam entries ': inp) :-> out #

caseUParamT :: forall (entries :: [EntrypointKind]) (inp :: [Type]) (out :: [Type]) clauses. (clauses ~ Rec (CaseClauseU inp out) entries, RecFromTuple clauses, CaseUParam entries) => IsoRecTuple clauses -> UParamFallback inp out -> (UParam entries ': inp) :-> out #

mkUParam :: forall a (name :: Symbol) (entries :: [EntrypointKind]). (NicePackedValue a, LookupEntrypoint name entries ~ a, RequireUniqueEntrypoints entries) => Label name -> a -> UParam entries #

pbsUParam :: forall (ctorName :: Symbol). KnownSymbol ctorName => ParamBuildingStep #

unwrapUParam :: forall (entries :: [EntrypointKind]) (s :: [Type]). (UParam entries ': s) :-> ((MText, ByteString) ': s) #

uparamFallbackFail :: forall (inp :: [Type]) (out :: [Type]). UParamFallback inp out #

uparamFromAdt :: UParamLinearize up => up -> UParam (UParamLinearized up) #

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

class CaseUParam (entries :: [EntrypointKind]) #

Minimal complete definition

caseUParamUnsafe

Instances

Instances details

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

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

Constructors

ConstrainedSome :: forall (c :: Type -> Constraint) a. c a => a -> ConstrainedSome c

Instances

Instances details

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

type EntrypointKind = (Symbol, Type) #

data EntrypointLookupError #

Constructors

NoSuchEntrypoint MText
ArgumentUnpackFailed

Instances

Instances details

Eq EntrypointLookupError
Instance details Defined in Lorentz.UParam Methods (==) :: EntrypointLookupError -> EntrypointLookupError -> Bool # (/=) :: EntrypointLookupError -> EntrypointLookupError -> Bool #
Show EntrypointLookupError
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> EntrypointLookupError -> ShowS # show :: EntrypointLookupError -> String # showList :: [EntrypointLookupError] -> ShowS #
Generic EntrypointLookupError
Instance details Defined in Lorentz.UParam Associated Types type Rep EntrypointLookupError :: Type -> Type # Methods from :: EntrypointLookupError -> Rep EntrypointLookupError x # to :: Rep EntrypointLookupError x -> EntrypointLookupError #
Buildable EntrypointLookupError
Instance details Defined in Lorentz.UParam Methods build :: EntrypointLookupError -> Builder #
type Rep EntrypointLookupError
Instance details Defined in Lorentz.UParam type Rep EntrypointLookupError = D1 ('MetaData "EntrypointLookupError" "Lorentz.UParam" "lorentz-0.6.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))

type EntrypointsImpl (inp :: [Type]) (out :: [Type]) (entries :: [EntrypointKind]) = Rec (CaseClauseU inp out) entries #

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

Equations

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

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

Equations

RequireUniqueEntrypoints entries = RequireAllUnique "entrypoint" (Eval (Map (Fst :: (Symbol, Type) -> Symbol -> Type) entries))

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

newtype UParam (entries :: [EntrypointKind]) #

Constructors

UParamUnsafe (MText, ByteString)

Instances

Instances details

Eq (UParam entries)
Instance details Defined in Lorentz.UParam Methods (==) :: UParam entries -> UParam entries -> Bool # (/=) :: UParam entries -> UParam entries -> Bool #
Show (UParam entries)
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> UParam entries -> ShowS # show :: UParam entries -> String # showList :: [UParam entries] -> ShowS #
Generic (UParam entries)
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 #
HasAnnotation (UParam entries)
Instance details Defined in Lorentz.UParam Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UParam entries))
Wrappable (UParam entries)
Instance details Defined in Lorentz.UParam Associated Types type Unwrappable (UParam entries) #
Typeable interface => TypeHasDoc (UParam interface)
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)
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 #
SameEntries entries1 entries2 => CanCastTo (UParam entries1 :: Type) (UParam entries2 :: Type)
Instance details Defined in Lorentz.UParam Methods castDummy :: Proxy (UParam entries1) -> Proxy (UParam entries2) -> () #
type Rep (UParam entries)
Instance details Defined in Lorentz.UParam type Rep (UParam entries) = D1 ('MetaData "UParam" "Lorentz.UParam" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "UParamUnsafe" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (MText, ByteString))))
type ToT (UParam entries)
Instance details Defined in Lorentz.UParam type ToT (UParam entries) = GValueType (Rep (UParam entries))
type Unwrappable (UParam entries)
Instance details Defined in Lorentz.UParam type Unwrappable (UParam entries) = GUnwrappable (Rep (UParam entries))
type TypeDocFieldDescriptions (UParam interface)
Instance details Defined in Lorentz.UParam type TypeDocFieldDescriptions (UParam interface) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

type UParamFallback (inp :: [Type]) (out :: [Type]) = ((MText, ByteString) ': inp) :-> out #

type UParamLinearize p = (Generic p, GUParamLinearize (Rep p)) #

type UParamLinearized p = GUParamLinearized (Rep p) #

type UParam_ = UParam SomeInterface #

class UnpackUParam (c :: Type -> Constraint) (entries :: [EntrypointKind]) where #

Methods

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

Instances

Instances details

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

fillUStore :: UStoreTraversable FillUStoreTW template => template -> UStoreMigration () template #

mkUStore :: UStoreTraversable MkUStoreTW template => template -> UStore template #

ustoreDecompose :: UStoreTraversable DecomposeUStoreTW template => UStore template -> Either Text (UStoreContent, template) #

ustoreDecomposeFull :: UStoreTraversable DecomposeUStoreTW template => UStore template -> Either Text template #

ustoreDelete :: forall store (name :: Symbol) (s :: [Type]). KeyAccessC store name => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (UStore store ': s) #

ustoreGet :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (Maybe (GetUStoreValue store name) ': s) #

ustoreGetField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (UStore store ': s) :-> (GetUStoreField store name ': (UStore store ': s)) #

ustoreInsert :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (GetUStoreValue store name ': (UStore store ': s))) :-> (UStore store ': s) #

ustoreInsertNew :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (forall (s0 :: [Type]) (any :: [Type]). (GetUStoreKey store name ': s0) :-> any) -> (GetUStoreKey store name ': (GetUStoreValue store name ': (UStore store ': s))) :-> (UStore store ': s) #

ustoreMem :: forall store (name :: Symbol) (s :: [Type]). KeyAccessC store name => Label name -> (GetUStoreKey store name ': (UStore store ': s)) :-> (Bool ': s) #

ustoreSetField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (GetUStoreField store name ': (UStore store ': s)) :-> (UStore store ': s) #

ustoreToField :: forall store (name :: Symbol) (s :: [Type]). FieldAccessC store name => Label name -> (UStore store ': s) :-> (GetUStoreField store name ': s) #

ustoreUpdate :: forall store (name :: Symbol) (s :: [Type]). (KeyAccessC store name, ValueAccessC store name) => Label name -> (GetUStoreKey store name ': (Maybe (GetUStoreValue store name) ': (UStore store ': s))) :-> (UStore store ': s) #

liftUStore :: forall template (name :: Symbol) (s :: [Type]). (Generic template, RequireAllUniqueFields template) => Label name -> (UStore (GetFieldType template name) ': s) :-> (UStore template ': s) #

unliftUStore :: forall template (name :: Symbol) (s :: [Type]). Generic template => Label name -> (UStore template ': s) :-> (UStore (GetFieldType template name) ': s) #

migrationToLambda :: UStoreMigration oldTemplate newTemplate -> Lambda (UStore oldTemplate) (UStore newTemplate) #

migrationToScript :: UStoreMigration os ns -> MigrationScript os ns #

migrationToScriptI :: UStoreMigration os ns -> Identity (MigrationScript os ns) #

mkUStoreMigration :: forall oldTempl newTempl (_1 :: [Symbol]). Lambda (MUStore oldTempl newTempl (BuildDiff oldTempl newTempl) ('[] :: [Symbol])) (MUStore oldTempl newTempl ('[] :: [DiffItem]) _1) -> UStoreMigration oldTempl newTempl #

migrateAddField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcAdd field diff, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s) #

migrateExtractField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcRemove field diff, HasUField field fieldTy oldTempl, RequireUntouched field (IsElem field touched)) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (fieldTy ': (MUStore oldTempl newTempl newDiff (field ': touched) ': s)) #

migrateGetField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (s :: [Type]). (HasUField field fieldTy oldTempl, RequireUntouched field (IsElem field touched)) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) #

migrateModifyField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (s :: [Type]). (HasUField field fieldTy oldTempl, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl diff touched ': s) #

migrateOverwriteField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy oldFieldTy (marker :: UStoreMarkerType) (oldMarker :: UStoreMarkerType) (newDiff :: [DiffItem]) (newDiff0 :: [DiffItem]) (s :: [Type]). ('(UStoreFieldExt oldMarker oldFieldTy, newDiff0) ~ CoverDiff 'DcRemove field diff, '(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcAdd field newDiff0, HasUField field fieldTy newTempl) => Label field -> (fieldTy ': (MUStore oldTempl newTempl diff touched ': s)) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s) #

migrateRemoveField :: forall (field :: Symbol) oldTempl newTempl (diff :: [DiffItem]) (touched :: [Symbol]) fieldTy (newDiff :: [DiffItem]) (marker :: UStoreMarkerType) (s :: [Type]). ('(UStoreFieldExt marker fieldTy, newDiff) ~ CoverDiff 'DcRemove field diff, HasUField field fieldTy oldTempl) => Label field -> (MUStore oldTempl newTempl diff touched ': s) :-> (MUStore oldTempl newTempl newDiff (field ': touched) ': s) #

mustoreToOld :: forall (touched :: [Symbol]) oldTemplate newTemplate (remDiff :: [DiffItem]) (s :: [Type]). RequireBeInitial touched => (MUStore oldTemplate newTemplate remDiff touched ': s) :-> (UStore oldTemplate ': s) #

class KnownUStoreMarker marker => UStoreMarkerHasDoc (marker :: UStoreMarkerType) where #

Methods

ustoreMarkerKeyEncoding :: Text -> Text #

Instances

Instances details

UStoreMarkerHasDoc UMarkerPlainField
Instance details Defined in Lorentz.UStore.Doc Methods ustoreMarkerKeyEncoding :: Text -> Text #

class Typeable template => UStoreTemplateHasDoc template where #

Minimal complete definition

ustoreTemplateDocDescription

Methods

ustoreTemplateDocName :: Text #

ustoreTemplateDocDescription :: Markdown #

ustoreTemplateDocContents :: Markdown #

ustoreTemplateDocDependencies :: [SomeTypeWithDoc] #

Instances

Instances details

UStoreTemplateHasDoc ()
Instance details Defined in Lorentz.UStore.Doc Methods ustoreTemplateDocName :: Text # ustoreTemplateDocDescription :: Markdown # ustoreTemplateDocContents :: Markdown # ustoreTemplateDocDependencies :: [SomeTypeWithDoc] #
UStoreTemplateHasDoc SomeUTemplate
Instance details Defined in Lorentz.UStore.Migration.Base Methods ustoreTemplateDocName :: Text # ustoreTemplateDocDescription :: Markdown # ustoreTemplateDocContents :: Markdown # ustoreTemplateDocDependencies :: [SomeTypeWithDoc] #

data DecomposeUStoreTW #

Instances

Instances details

UStoreTraversalWay DecomposeUStoreTW
Instance details Defined in Lorentz.UStore.Haskell Associated Types type UStoreTraversalArgumentWrapper DecomposeUStoreTW :: Type -> Type type UStoreTraversalMonad DecomposeUStoreTW :: Type -> Type
NiceUnpackedValue val => UStoreTraversalFieldHandler DecomposeUStoreTW marker val
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalFieldHandler :: forall (name :: Symbol). KnownUStoreMarker marker => DecomposeUStoreTW -> Label name -> UStoreTraversalArgumentWrapper DecomposeUStoreTW val -> UStoreTraversalMonad DecomposeUStoreTW val
(Ord k, NiceUnpackedValue k, NiceUnpackedValue v) => UStoreTraversalSubmapHandler DecomposeUStoreTW k v
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalSubmapHandler :: forall (name :: Symbol). DecomposeUStoreTW -> Label name -> UStoreTraversalArgumentWrapper DecomposeUStoreTW (Map k v) -> UStoreTraversalMonad DecomposeUStoreTW (Map k v)
type UStoreTraversalArgumentWrapper DecomposeUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalArgumentWrapper DecomposeUStoreTW = Const () :: Type -> Type
type UStoreTraversalMonad DecomposeUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalMonad DecomposeUStoreTW = StateT UStoreContent (ExceptT Text Identity)

data FillUStoreTW #

Instances

Instances details

UStoreTraversalWay FillUStoreTW
Instance details Defined in Lorentz.UStore.Haskell Associated Types type UStoreTraversalArgumentWrapper FillUStoreTW :: Type -> Type type UStoreTraversalMonad FillUStoreTW :: Type -> Type
NiceConstant v => UStoreTraversalFieldHandler FillUStoreTW marker v
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalFieldHandler :: forall (name :: Symbol). KnownUStoreMarker marker => FillUStoreTW -> Label name -> UStoreTraversalArgumentWrapper FillUStoreTW v -> UStoreTraversalMonad FillUStoreTW v
(NiceConstant k, NiceConstant v) => UStoreTraversalSubmapHandler FillUStoreTW k v
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalSubmapHandler :: forall (name :: Symbol). FillUStoreTW -> Label name -> UStoreTraversalArgumentWrapper FillUStoreTW (Map k v) -> UStoreTraversalMonad FillUStoreTW (Map k v)
type UStoreTraversalArgumentWrapper FillUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalArgumentWrapper FillUStoreTW = Identity
type UStoreTraversalMonad FillUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalMonad FillUStoreTW = Const (Endo [MigrationAtom]) :: Type -> Type

data MkUStoreTW #

Instances

Instances details

UStoreTraversalWay MkUStoreTW
Instance details Defined in Lorentz.UStore.Haskell Associated Types type UStoreTraversalArgumentWrapper MkUStoreTW :: Type -> Type type UStoreTraversalMonad MkUStoreTW :: Type -> Type
NicePackedValue val => UStoreTraversalFieldHandler MkUStoreTW marker val
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalFieldHandler :: forall (name :: Symbol). KnownUStoreMarker marker => MkUStoreTW -> Label name -> UStoreTraversalArgumentWrapper MkUStoreTW val -> UStoreTraversalMonad MkUStoreTW val
(NicePackedValue k, NicePackedValue v) => UStoreTraversalSubmapHandler MkUStoreTW k v
Instance details Defined in Lorentz.UStore.Haskell Methods ustoreTraversalSubmapHandler :: forall (name :: Symbol). MkUStoreTW -> Label name -> UStoreTraversalArgumentWrapper MkUStoreTW (Map k v) -> UStoreTraversalMonad MkUStoreTW (Map k v)
type UStoreTraversalArgumentWrapper MkUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalArgumentWrapper MkUStoreTW = Identity
type UStoreTraversalMonad MkUStoreTW
Instance details Defined in Lorentz.UStore.Haskell type UStoreTraversalMonad MkUStoreTW = Const (Map ByteString ByteString) :: Type -> Type

type HasUField (name :: Symbol) ty store = (FieldAccessC store name, GetUStoreField store name ~ ty) #

type HasUStore (name :: Symbol) key value store = (KeyAccessC store name, ValueAccessC store name, GetUStoreKey store name ~ key, GetUStoreValue store name ~ value) #

type HasUStoreForAllIn store constrained = (Generic store, GHasStoreForAllIn constrained (Rep store)) #

newtype MigrationScript oldStore newStore #

Constructors

MigrationScript
Fields unMigrationScript :: Lambda UStore_ UStore_

Instances

Instances details

CanCastTo (Lambda (UStore ot1) (UStore nt1)) (Lambda (UStore ot2) (UStore nt2)) => CanCastTo (MigrationScript ot1 nt1 :: Type) (MigrationScript ot2 nt2 :: Type)
Instance details Defined in Lorentz.UStore.Migration.Base Methods castDummy :: Proxy (MigrationScript ot1 nt1) -> Proxy (MigrationScript ot2 nt2) -> () #
Show (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Methods showsPrec :: Int -> MigrationScript oldStore newStore -> ShowS # show :: MigrationScript oldStore newStore -> String # showList :: [MigrationScript oldStore newStore] -> ShowS #
Generic (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type Rep (MigrationScript oldStore newStore) :: Type -> Type # Methods from :: MigrationScript oldStore newStore -> Rep (MigrationScript oldStore newStore) x # to :: Rep (MigrationScript oldStore newStore) x -> MigrationScript oldStore newStore #
HasAnnotation (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (MigrationScript oldStore newStore))
Wrappable (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type Unwrappable (MigrationScript oldStore newStore) #
Each '[Typeable :: Type -> Constraint, UStoreTemplateHasDoc] '[oldStore, newStore] => TypeHasDoc (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type TypeDocFieldDescriptions (MigrationScript oldStore newStore) :: FieldDescriptions # Methods typeDocName :: Proxy (MigrationScript oldStore newStore) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (MigrationScript oldStore newStore) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (MigrationScript oldStore newStore) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (MigrationScript oldStore newStore) # typeDocMichelsonRep :: TypeDocMichelsonRep (MigrationScript oldStore newStore) #
IsoValue (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type ToT (MigrationScript oldStore newStore) :: T # Methods toVal :: MigrationScript oldStore newStore -> Value (ToT (MigrationScript oldStore newStore)) # fromVal :: Value (ToT (MigrationScript oldStore newStore)) -> MigrationScript oldStore newStore #
type Rep (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type Rep (MigrationScript oldStore newStore) = D1 ('MetaData "MigrationScript" "Lorentz.UStore.Migration.Base" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "MigrationScript" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMigrationScript") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Lambda UStore_ UStore_))))
type ToT (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type ToT (MigrationScript oldStore newStore) = GValueType (Rep (MigrationScript oldStore newStore))
type Unwrappable (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type Unwrappable (MigrationScript oldStore newStore) = GUnwrappable (Rep (MigrationScript oldStore newStore))
type TypeDocFieldDescriptions (MigrationScript oldStore newStore)
Instance details Defined in Lorentz.UStore.Migration.Base type TypeDocFieldDescriptions (MigrationScript oldStore newStore) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]

type MigrationScript_ = MigrationScript SomeUTemplate SomeUTemplate #

data UStoreMigration oldTempl newTempl #

Instances

Instances details

MapLorentzInstr (UStoreMigration os ns)
Instance details Defined in Lorentz.UStore.Migration.Base Methods mapLorentzInstr :: (forall (i :: [Type]) (o :: [Type]). (i :-> o) -> i :-> o) -> UStoreMigration os ns -> UStoreMigration os ns #

type UStoreTraversable way a = (Generic a, GUStoreTraversable way (Rep a), UStoreTraversalWay way) #

type GetUStoreField store (name :: Symbol) = FSValue (GetUStore name store) #

type GetUStoreFieldMarker store (name :: Symbol) = FSMarker (GetUStore name store) #

type GetUStoreKey store (name :: Symbol) = MSKey (GetUStore name store) #

type GetUStoreValue store (name :: Symbol) = MSValue (GetUStore name store) #

class KnownUStoreMarker (marker :: UStoreMarkerType) where #

Minimal complete definition

Nothing

Associated Types

type ShowUStoreField (marker :: UStoreMarkerType) v :: ErrorMessage #

type ShowUStoreField (marker :: UStoreMarkerType) v = 'Text "field of type " :<>: 'ShowType v #

Methods

mkFieldMarkerUKey :: MText -> ByteString #

Instances

Instances details

KnownUStoreMarker UMarkerPlainField
Instance details Defined in Lorentz.UStore.Types Associated Types type ShowUStoreField UMarkerPlainField v :: ErrorMessage # Methods mkFieldMarkerUKey :: MText -> ByteString #
KnownUStoreMarker Marker1
Instance details Defined in Lorentz.UStore.Instr Associated Types type ShowUStoreField Marker1 v :: ErrorMessage # Methods mkFieldMarkerUKey :: MText -> ByteString #

type family ShowUStoreField (marker :: UStoreMarkerType) v :: ErrorMessage #

Instances

Instances details

type ShowUStoreField UMarkerPlainField v
Instance details Defined in Lorentz.UStore.Types type ShowUStoreField UMarkerPlainField v = 'Text "field of type " :<>: 'ShowType v
type ShowUStoreField Marker1 v
Instance details Defined in Lorentz.UStore.Instr type ShowUStoreField Marker1 v = 'Text "field of type " :<>: 'ShowType v

type PickMarkedFields (marker :: UStoreMarkerType) template = GPickMarkedFields marker (Rep template) #

data UStore a #

Instances

Instances details

Eq (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods (==) :: UStore a -> UStore a -> Bool # (/=) :: UStore a -> UStore a -> Bool #
Show (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods showsPrec :: Int -> UStore a -> ShowS # show :: UStore a -> String # showList :: [UStore a] -> ShowS #
Generic (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type Rep (UStore a) :: Type -> Type # Methods from :: UStore a -> Rep (UStore a) x # to :: Rep (UStore a) x -> UStore a #
Semigroup (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods (<>) :: UStore a -> UStore a -> UStore a # sconcat :: NonEmpty (UStore a) -> UStore a # stimes :: Integral b => b -> UStore a -> UStore a #
Monoid (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods mempty :: UStore a # mappend :: UStore a -> UStore a -> UStore a # mconcat :: [UStore a] -> UStore a #
Default (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods def :: UStore a #
HasAnnotation (UStore a)
Instance details Defined in Lorentz.UStore.Types Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (UStore a))
Wrappable (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type Unwrappable (UStore a) #
IsoValue (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type ToT (UStore a) :: T # Methods toVal :: UStore a -> Value (ToT (UStore a)) # fromVal :: Value (ToT (UStore a)) -> UStore a #
MemOpHs (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type MemOpKeyHs (UStore a) #
GetOpHs (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type GetOpKeyHs (UStore a) # type GetOpValHs (UStore a) #
UpdOpHs (UStore a)
Instance details Defined in Lorentz.UStore.Types Associated Types type UpdOpKeyHs (UStore a) # type UpdOpParamsHs (UStore a) #
type Rep (UStore a)
Instance details Defined in Lorentz.UStore.Types type Rep (UStore a) = D1 ('MetaData "UStore" "Lorentz.UStore.Types" "lorentz-0.6.0-inplace" 'True) (C1 ('MetaCons "UStore" 'PrefixI 'True) (S1 ('MetaSel ('Just "unUStore") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (BigMap ByteString ByteString))))
type ToT (UStore a)
Instance details Defined in Lorentz.UStore.Types type ToT (UStore a) = ToT (BigMap ByteString ByteString)
type Unwrappable (UStore a)
Instance details Defined in Lorentz.UStore.Types type Unwrappable (UStore a) = GUnwrappable (Rep (UStore a))
type TypeDocFieldDescriptions (UStore template)
Instance details Defined in Lorentz.UStore.Doc type TypeDocFieldDescriptions (UStore template) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type MemOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type MemOpKeyHs (UStore a) = MemOpKeyHs (BigMap ByteString ByteString)
type GetOpValHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type GetOpValHs (UStore a) = GetOpValHs (BigMap ByteString ByteString)
type GetOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type GetOpKeyHs (UStore a) = GetOpKeyHs (BigMap ByteString ByteString)
type UpdOpKeyHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type UpdOpKeyHs (UStore a) = UpdOpKeyHs (BigMap ByteString ByteString)
type UpdOpParamsHs (UStore a)
Instance details Defined in Lorentz.UStore.Types type UpdOpParamsHs (UStore a) = UpdOpParamsHs (BigMap ByteString ByteString)

type UStoreField = UStoreFieldExt UMarkerPlainField #

newtype UStoreFieldExt (m :: UStoreMarkerType) v #

Constructors

UStoreField
Fields unUStoreField :: v

Instances

Instances details

(UStoreTraversalFieldHandler way marker v, KnownUStoreMarker marker, KnownSymbol ctor) => GUStoreTraversable way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (UStoreFieldExt marker v)))
Instance details Defined in Lorentz.UStore.Traversal Methods gTraverseUStore :: UStoreTraversalWay way => way -> UStoreTraversalArgumentWrapper way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (UStoreFieldExt marker v)) p) -> UStoreTraversalMonad way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (UStoreFieldExt marker v)) p)
Eq v => Eq (UStoreFieldExt m v)
Instance details Defined in Lorentz.UStore.Types Methods (==) :: UStoreFieldExt m v -> UStoreFieldExt m v -> Bool # (/=) :: UStoreFieldExt m v -> UStoreFieldExt m v -> Bool #
Show v => Show (UStoreFieldExt m v)
Instance details Defined in Lorentz.UStore.Types Methods showsPrec :: Int -> UStoreFieldExt m v -> ShowS # show :: UStoreFieldExt m v -> String # showList :: [UStoreFieldExt m v] -> ShowS #
Arbitrary v => Arbitrary (UStoreFieldExt m v)
Instance details Defined in Lorentz.UStore.Types Methods arbitrary :: Gen (UStoreFieldExt m v) # shrink :: UStoreFieldExt m v -> [UStoreFieldExt m v] #

type UStoreMarkerType = UStoreMarker -> Type #

newtype k |~> v #

Constructors

UStoreSubMap
Fields unUStoreSubMap :: Map k v

Instances

Instances details

(UStoreTraversalSubmapHandler way k v, KnownSymbol ctor) => GUStoreTraversable way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (k \|~> v)))
Instance details Defined in Lorentz.UStore.Traversal Methods gTraverseUStore :: UStoreTraversalWay way => way -> UStoreTraversalArgumentWrapper way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (k \|~> v)) p) -> UStoreTraversalMonad way (S1 ('MetaSel ('Just ctor) _1 _2 _3) (Rec0 (k \|~> v)) p)
(Eq k, Eq v) => Eq (k \|~> v)
Instance details Defined in Lorentz.UStore.Types Methods (==) :: (k \|~> v) -> (k \|~> v) -> Bool # (/=) :: (k \|~> v) -> (k \|~> v) -> Bool #
(Show k, Show v) => Show (k \|~> v)
Instance details Defined in Lorentz.UStore.Types Methods showsPrec :: Int -> (k \|~> v) -> ShowS # show :: (k \|~> v) -> String # showList :: [k \|~> v] -> ShowS #
(Ord k, Arbitrary k, Arbitrary v) => Arbitrary (k \|~> v)
Instance details Defined in Lorentz.UStore.Types Methods arbitrary :: Gen (k \|~> v) # shrink :: (k \|~> v) -> [k \|~> v] #
Default (k \|~> v)
Instance details Defined in Lorentz.UStore.Types Methods def :: k \|~> v #

callingDefTAddress :: NiceParameterFull cp => TAddress cp -> ContractRef (GetDefaultEntrypointArg cp) #

callingTAddress :: forall cp (mname :: Maybe Symbol). NiceParameterFull cp => TAddress cp -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname) #

convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2 #

mt :: QuasiQuoter #

coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b #

pattern DefEpName :: EpName #

oneMutez :: Mutez #

timestampFromSeconds :: Integer -> Timestamp #

timestampFromUTCTime :: UTCTime -> Timestamp #

timestampQuote :: QuasiQuoter #

toMutez :: Word32 -> Mutez #

zeroMutez :: Mutez #

cstr :: forall (n :: Nat). KnownNat n => [Natural] -> CstrDepth #

customGeneric :: String -> GenericStrategy -> Q [Dec] #

fld :: forall (n :: Nat). KnownNat n => Natural #

leftBalanced :: GenericStrategy #

leftComb :: GenericStrategy #

rightBalanced :: GenericStrategy #

rightComb :: GenericStrategy #

withDepths :: [CstrDepth] -> GenericStrategy #

class FromContractRef cp contract where #

Methods

fromContractRef :: ContractRef cp -> contract #

Instances

Instances details

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

class ToAddress a where #

Methods

toAddress :: a -> Address #

Instances

Instances details

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

class ToTAddress cp a where #

Methods

toTAddress :: a -> TAddress cp #

Instances

Instances details

ToTAddress cp Address
Instance details Defined in Lorentz.Address Methods toTAddress :: Address -> TAddress cp #
cp ~ cp' => ToTAddress cp (TAddress cp')
Instance details Defined in Lorentz.Address Methods toTAddress :: TAddress cp' -> TAddress cp #

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

type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg) #