Safe Haskell	None
Language	Haskell2010

Lorentz.Value

Contents

Primitive types
Constructors
Conversions
Misc
Re-exports

Description

Re-exports typed Value, CValue, some core types, some helpers and defines aliases for constructors of typed values.

Synopsis

type Value = Value' Instr
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)
data Integer
data Natural
data MText
data Bool
- = False
- | True
data ByteString
data Address
data EpAddress = EpAddress {
- eaAddress :: Address
- eaEntrypoint :: EpName
}
data Mutez
data Timestamp
data ChainId
data KeyHash
data PublicKey
data Signature
data Set a
data Map k a
newtype BigMap k v = BigMap {
- unBigMap :: Map k v
}
type Operation = Operation' Instr
data Maybe a
- = Nothing
- | Just a
type List = []
data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
}
newtype TAddress p = TAddress {
- unTAddress :: Address
}
newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
}
data EpName
pattern DefEpName :: EpName
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)
toMutez :: Word32 -> Mutez
zeroMutez :: Mutez
oneMutez :: Mutez
mt :: QuasiQuoter
timestampFromSeconds :: Integer -> Timestamp
timestampFromUTCTime :: UTCTime -> Timestamp
timestampQuote :: QuasiQuoter
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
callingTAddress :: forall cp mname. NiceParameterFull cp => TAddress cp -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
callingDefTAddress :: forall cp. NiceParameterFull cp => TAddress cp -> ContractRef (GetDefaultEntrypointArg cp)
class ToAddress a where
- toAddress :: a -> Address
class ToTAddress (cp :: Type) (a :: Type) where
- toTAddress :: a -> TAddress cp
class ToContractRef (cp :: Type) (contract :: Type) where
- toContractRef :: HasCallStack => contract -> ContractRef cp
class FromContractRef (cp :: Type) (contract :: Type) where
- fromContractRef :: ContractRef cp -> contract
convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2
class Default a where
- def :: a
data Label (name :: Symbol) where
- Label :: forall (name :: Symbol). KnownSymbol name => Label name

Documentation

type Value = Value' Instr #

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 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 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 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 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 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 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 UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ToT UnspecifiedError :: T # Methods toVal :: UnspecifiedError -> Value (ToT UnspecifiedError) # fromVal :: Value (ToT UnspecifiedError) -> UnspecifiedError #
IsoValue Empty Source #
Instance details Defined in Lorentz.Empty Associated Types type ToT Empty :: T # Methods toVal :: Empty -> Value (ToT Empty) # fromVal :: Value (ToT Empty) -> Empty #
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 #
WellTypedIsoValue r => IsoValue (ShouldHaveEntrypoints r) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type ToT (ShouldHaveEntrypoints r) :: T # Methods toVal :: ShouldHaveEntrypoints r -> Value (ToT (ShouldHaveEntrypoints r)) # fromVal :: Value (ToT (ShouldHaveEntrypoints r)) -> ShouldHaveEntrypoints r #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
(WellTypedIsoValue (ErrorArg tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag) Source #	This instance cannot be implemented, use `IsError` instance instead.
Instance details Defined in Lorentz.Errors Associated Types type ToT (CustomError tag) :: T # Methods toVal :: CustomError tag -> Value (ToT (CustomError tag)) # fromVal :: Value (ToT (CustomError tag)) -> CustomError tag #
IsoValue (UStore a) Source #
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 #
(WellTypedIsoValue (VoidResult r), TypeError ('Text "No IsoValue instance for VoidResult " :<>: 'ShowType r) :: Constraint) => IsoValue (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (VoidResult r) :: T # Methods toVal :: VoidResult r -> Value (ToT (VoidResult r)) # fromVal :: Value (ToT (VoidResult r)) -> VoidResult r #
IsoValue (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type ToT (UParam entries) :: T # Methods toVal :: UParam entries -> Value (ToT (UParam entries)) # fromVal :: Value (ToT (UParam entries)) -> UParam entries #
(IsoValue 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 #
(WellTypedToT (ZippedStack inp), WellTypedToT (ZippedStack out), ZipInstr inp, ZipInstr out) => IsoValue (inp :-> out) Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT (inp :-> out) :: T # Methods toVal :: (inp :-> out) -> Value (ToT (inp :-> out)) # fromVal :: Value (ToT (inp :-> out)) -> inp :-> out #
IsoValue (TAddress p) Source #
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) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ToT (ParameterWrapper deriv cp) :: T # Methods toVal :: ParameterWrapper deriv cp -> Value (ToT (ParameterWrapper deriv cp)) # fromVal :: Value (ToT (ParameterWrapper deriv cp)) -> ParameterWrapper deriv cp #
IsoValue (MigrationScript oldStore newStore) Source #
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 #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (Void_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (Void_ a r) :: T # Methods toVal :: Void_ a r -> Value (ToT (Void_ a r)) # fromVal :: Value (ToT (Void_ a r)) -> Void_ a r #
(WellTypedIsoValue r, WellTypedIsoValue a) => IsoValue (View a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (View a r) :: T # Methods toVal :: View a r -> Value (ToT (View a r)) # fromVal :: Value (ToT (View a r)) -> View a r #
IsoValue (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type ToT (Extensible x) :: T # Methods toVal :: Extensible x -> Value (ToT (Extensible x)) # fromVal :: Value (ToT (Extensible x)) -> Extensible x #
(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) Source #
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) #

Primitive types

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 #
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 #
Arbitrary Integer
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Integer # shrink :: Integer -> [Integer] #
CoArbitrary Integer
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Integer -> Gen b -> Gen b #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
ToJSON Integer
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Integer -> Value # toEncoding :: Integer -> Encoding # toJSONList :: [Integer] -> Value # toEncodingList :: [Integer] -> Encoding #
ToJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods toJSON :: TezosBigNum -> Value # toEncoding :: TezosBigNum -> Encoding # toJSONList :: [TezosBigNum] -> Value # toEncodingList :: [TezosBigNum] -> Encoding #
ToJSONKey Integer
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Integer # toJSONKeyList :: ToJSONKeyFunction [Integer] #
FromJSON TezosBigNum
Instance details Defined in Morley.Micheline.Json Methods parseJSON :: Value -> Parser TezosBigNum # parseJSONList :: Value -> Parser [TezosBigNum] #
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 #
Buildable Integer
Instance details Defined in Formatting.Buildable Methods build :: Integer -> Builder #
Pretty Integer
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Integer -> Doc # prettyList :: [Integer] -> Doc #
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 #
HasAnnotation Integer Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer) Source #
NonZero Integer Source #
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s) Source #
EDivOpHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Integer Source # type EModOpResHs Integer Integer Source #
EDivOpHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural Source # type EModOpResHs Integer Natural Source #
EDivOpHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer Source # type EModOpResHs Natural Integer Source #
UnaryArithOpHs Abs Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer Source #
UnaryArithOpHs Neg Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer Source #
UnaryArithOpHs Not Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer Source #
UnaryArithOpHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer Source #
UnaryArithOpHs Neq Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer Source #
UnaryArithOpHs Lt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer Source #
UnaryArithOpHs Gt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer Source #
UnaryArithOpHs Le Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer Source #
UnaryArithOpHs Ge Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer Source #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
ArithOpHs Add Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Integer Source #
ArithOpHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural Source #
ArithOpHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp Source #
ArithOpHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer Source #
ArithOpHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer Source #
ArithOpHs Sub Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Integer Source #
ArithOpHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural Source #
ArithOpHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer Source #
ArithOpHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer Source #
ArithOpHs Mul Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Integer Source #
ArithOpHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural Source #
ArithOpHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer Source #
ArithOpHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural Source #
() :=> (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 TypeDocFieldDescriptions Integer
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Integer
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type EDivOpResHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Integer = Integer
type EDivOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EModOpResHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Integer = Natural
type EModOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type UnaryArithResHs Abs Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Neg Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Not Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer
type UnaryArithResHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Neq Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Lt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Gt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Ge Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type ArithResHs Add Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Integer = Integer
type ArithResHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs Sub Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Integer = Integer
type ArithResHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Mul Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Integer = Integer
type ArithResHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Natural

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 #
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 #
ToJSON Natural
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Natural -> Value # toEncoding :: Natural -> Encoding # toJSONList :: [Natural] -> Value # toEncodingList :: [Natural] -> Encoding #
ToJSONKey Natural
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Natural # toJSONKeyList :: ToJSONKeyFunction [Natural] #
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 -> () #
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 #
HasAnnotation Natural Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural) Source #
NonZero Natural Source #
Instance details Defined in Lorentz.Instr Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s) Source #
EDivOpHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural Source # type EModOpResHs Integer Natural Source #
EDivOpHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer Source # type EModOpResHs Natural Integer Source #
EDivOpHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Natural Source # type EModOpResHs Natural Natural Source #
EDivOpHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural Source # type EModOpResHs Mutez Natural Source #
UnaryArithOpHs Neg Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural Source #
UnaryArithOpHs Not Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural Source #
ArithOpHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural Source #
ArithOpHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer Source #
ArithOpHs Add Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Natural Source #
ArithOpHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural Source #
ArithOpHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer Source #
ArithOpHs Sub Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Natural Source #
ArithOpHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural Source #
ArithOpHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer Source #
ArithOpHs Mul Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Natural Source #
ArithOpHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez Source #
ArithOpHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural Source #
ArithOpHs Lsl Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsl Natural Natural Source #
ArithOpHs Lsr Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsr Natural Natural Source #
ArithOpHs Or Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Natural Natural Source #
ArithOpHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural Source #
ArithOpHs And Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Natural Natural Source #
ArithOpHs Xor Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Natural Natural Source #
() :=> (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 TypeDocFieldDescriptions Natural
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Natural
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type EDivOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EDivOpResHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Natural = Natural
type EDivOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EModOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type EModOpResHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Natural = Natural
type EModOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type UnaryArithResHs Neg Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Not Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer
type ArithResHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Natural = Natural
type ArithResHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Natural = Integer
type ArithResHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs Mul Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Natural = Natural
type ArithResHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez
type ArithResHs Lsl Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Lsl Natural Natural = Natural
type ArithResHs Lsr Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Lsr Natural Natural = Natural
type ArithResHs Or Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Or Natural Natural = Natural
type ArithResHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Natural
type ArithResHs And Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Natural Natural = Natural
type ArithResHs Xor Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Xor Natural Natural = Natural

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) #
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 #
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 #
HasCLReader MText
Instance details Defined in Michelson.Text Methods getReader :: ReadM MText getMetavar :: String
HasAnnotation MText Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText) Source #
SliceOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
ConcatOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
ErrorHasDoc MText Source #
Instance details Defined in Lorentz.Errors Associated Types type ErrorRequirements MText Source # Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source # errorDocRequirements :: Dict (ErrorRequirements MText) Source #
IsError MText Source #	Use this for internal errors only. Normal error scenarios should use the mechanism of custom errors, see below.
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: forall (t :: T). KnownT t => Value t -> Either Text MText Source #
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 TypeDocFieldDescriptions MText
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT MText
Instance details Defined in Michelson.Typed.Haskell.Value type ToT MText = 'TString
type ErrorRequirements MText Source #
Instance details Defined in Lorentz.Errors type ErrorRequirements MText = ()

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 #
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 #
Arbitrary Bool
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Bool # shrink :: Bool -> [Bool] #
CoArbitrary Bool
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Bool -> Gen b -> Gen b #
Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
ToJSON Bool
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Bool -> Value # toEncoding :: Bool -> Encoding # toJSONList :: [Bool] -> Value # toEncodingList :: [Bool] -> Encoding #
ToJSONKey Bool
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Bool # toJSONKeyList :: ToJSONKeyFunction [Bool] #
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 () #
NFData Bool
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
Buildable Bool
Instance details Defined in Formatting.Buildable Methods build :: Bool -> Builder #
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 #
Pretty Bool
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Bool -> Doc # prettyList :: [Bool] -> Doc #
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 #
HasAnnotation Bool Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool) Source #
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 Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool Source #
ArithOpHs Or Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Bool Bool Source #
ArithOpHs And Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Bool Bool Source #
ArithOpHs Xor Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Bool Bool Source #
() :=> (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 (UnlessSym0 :: TyFun Bool (f6989586621680980258 () ~> f6989586621680980258 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679754497 () ~> f6989586621679754497 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal 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 (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing WhenSym0 #
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 (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 :: () #
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 :: () #
(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) #
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 #
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 #
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 (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 (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 (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 (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 (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 (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 (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 (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 (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 TypeDocFieldDescriptions Bool
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Bool
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
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 Source #
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 Or Bool Bool Source #
Instance details Defined in Lorentz.Arith type ArithResHs Or Bool Bool = Bool
type ArithResHs And Bool Bool Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Bool Bool = Bool
type ArithResHs Xor Bool Bool Source #
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 (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 (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 (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 (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_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_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 (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_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 (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_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 (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 (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 (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 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 -> () #
FromBuilder ByteString
Instance details Defined in Fmt.Internal.Core Methods fromBuilder :: Builder -> 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 #
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 #
HasAnnotation ByteString Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString) Source #
SliceOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
ConcatOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
Strict ByteString ByteString
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' ByteString ByteString0 #
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 #
Cons ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #
Snoc ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #
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 TypeDocFieldDescriptions ByteString
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT ByteString
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes

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 #
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 #
HasCLReader Address
Instance details Defined in Tezos.Address Methods getReader :: ReadM Address getMetavar :: String
HasAnnotation Address Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Address) Source #
ToAddress Address Source #
Instance details Defined in Lorentz.Address Methods toAddress :: Address -> Address Source #
FromContractRef cp Address Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> Address Source #
ToTAddress cp Address Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: Address -> TAddress cp Source #
CanCastTo Address (TAddress p :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p) -> () Source #
CanCastTo (TAddress p :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p) -> Proxy Address -> () Source #
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 TypeDocFieldDescriptions Address
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Address = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Address
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Address = 'TAddress

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 #
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 #
HasAnnotation EpAddress Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress) Source #
ToAddress EpAddress Source #
Instance details Defined in Lorentz.Address Methods toAddress :: EpAddress -> Address Source #
FromContractRef cp EpAddress Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> EpAddress Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () Source #
type Rep EpAddress
Instance details Defined in 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 TypeDocFieldDescriptions EpAddress
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress

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 #
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
HasAnnotation Mutez Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Mutez) Source #
EDivOpHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural Source # type EModOpResHs Mutez Natural Source #
EDivOpHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Mutez Source # type EModOpResHs Mutez Mutez Source #
ArithOpHs Add Mutez Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Mutez Mutez Source #
ArithOpHs Sub Mutez Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Mutez Mutez Source #
ArithOpHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez Source #
ArithOpHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural Source #
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 TypeDocFieldDescriptions Mutez
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Mutez = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Mutez
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Mutez = 'TMutez
type EDivOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EDivOpResHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Mutez = Natural
type EModOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type EModOpResHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Mutez = Mutez
type ArithResHs Add Mutez Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Mutez Mutez = Mutez
type ArithResHs Sub Mutez Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Mutez Mutez = Mutez
type ArithResHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez

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 #
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 #
HasAnnotation Timestamp Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Timestamp) Source #
ArithOpHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp Source #
ArithOpHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer Source #
ArithOpHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer Source #
ArithOpHs Sub Timestamp Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Timestamp Source #
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 TypeDocFieldDescriptions Timestamp
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Timestamp = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Timestamp = 'TTimestamp
type ArithResHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Timestamp = Integer

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

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 #
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
HasAnnotation KeyHash Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT KeyHash) Source #
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 TypeDocFieldDescriptions KeyHash
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions KeyHash = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value type ToT KeyHash = 'TKeyHash

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 #
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 #
HasAnnotation PublicKey Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT PublicKey) Source #
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 TypeDocFieldDescriptions PublicKey
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions PublicKey = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value type ToT PublicKey = 'TKey

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 #
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 #
HasAnnotation Signature Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Signature) Source #
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 TypeDocFieldDescriptions Signature
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Signature = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Signature
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Signature = 'TSignature

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 #
ToJSON1 Set
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Set a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Set a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Set a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Set a] -> Encoding #
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 #
(Ord a, Arbitrary a) => Arbitrary (Set a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Set a) # shrink :: Set a -> [Set a] #
CoArbitrary a => CoArbitrary (Set a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Set a -> Gen b -> Gen b #
ToJSON a => ToJSON (Set a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Set a -> Value # toEncoding :: Set a -> Encoding # toJSONList :: [Set a] -> Value # toEncodingList :: [Set a] -> Encoding #
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 #
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 #
KnownIsoT v => HasAnnotation (Set v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) Source #
NiceComparable a => UpdOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Set a) Source # type UpdOpParamsHs (Set a) Source #
SizeOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic
NiceComparable e => IterOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) Source #
NiceComparable e => MemOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) Source #
(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) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Set k1) -> Proxy (Set k2) -> () Source #
type Item (Set a)
Instance details Defined in Data.Set.Internal type Item (Set a) = a
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type Unwrapped (Set a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Set a) = [a]
type 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 TypeDocFieldDescriptions (Set a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type UpdOpKeyHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) = a
type UpdOpParamsHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Set a) = Bool
type IterOpElHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Set e) = e
type MemOpKeyHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) = e

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 #
Ord k => TraverseMin k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMin :: IndexedTraversal' k (Map k v) v #
Ord k => TraverseMax k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMax :: IndexedTraversal' k (Map k v) v #
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) #
(Ord k, Arbitrary k) => Arbitrary1 (Map k)
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen (Map k a) # liftShrink :: (a -> [a]) -> Map k a -> [Map k a] #
ToJSONKey k => ToJSON1 (Map k)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Map k a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Map k a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Map k a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Map k a] -> Encoding #
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) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Map k1 v1) -> Proxy (Map k2 v2) -> () Source #
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 #
(Ord k, Arbitrary k, Arbitrary v) => Arbitrary (Map k v)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Map k v) # shrink :: Map k v -> [Map k v] #
(CoArbitrary k, CoArbitrary v) => CoArbitrary (Map k v)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Map k v -> Gen b -> Gen b #
(ToJSON v, ToJSONKey k) => ToJSON (Map k v)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Map k v -> Value # toEncoding :: Map k v -> Encoding # toJSONList :: [Map k v] -> Value # toEncodingList :: [Map k v] -> Encoding #
(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 #
(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 #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) Source #
NiceComparable k => GetOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (Map k v) Source # type GetOpValHs (Map k v) Source #
NiceComparable k => UpdOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Map k v) Source # type UpdOpParamsHs (Map k v) Source #
SizeOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic
NiceComparable k => IterOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) Source #
NiceComparable k => MapOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Map k v) Source # type MapOpResHs (Map k v) :: Type -> Type Source #
NiceComparable k => MemOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) Source #
(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 Source #	`Map` can be used as standalone key-value storage if very needed.
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key' value') name key value Source #
type Item (Map k v)
Instance details Defined in Data.Map.Internal type Item (Map k v) = (k, v)
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type Unwrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Map k a) = [(k, a)]
type 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 TypeDocFieldDescriptions (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type GetOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) = k
type GetOpValHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (Map k v) = v
type UpdOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) = k
type UpdOpParamsHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Map k v) = Maybe v
type IterOpElHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) = (k, v)
type MapOpInpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) = (k, v)
type MapOpResHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Map k v) = Map k
type MemOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) = k

newtype BigMap k v #

Constructors

BigMap
Fields unBigMap :: Map k v

Instances

Instances details

(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (BigMap k1 v1 :: Type) (BigMap k2 v2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (BigMap k1 v1) -> Proxy (BigMap k2 v2) -> () Source #
(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 #
(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 #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMap k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMap k v)) Source #
NiceComparable k => GetOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (BigMap k v) Source # type GetOpValHs (BigMap k v) Source #
NiceComparable k => UpdOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (BigMap k v) Source # type UpdOpParamsHs (BigMap k v) Source #
NiceComparable k => MemOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (BigMap k v) Source #
(key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (BigMap key' value') name key value Source #	`BigMap` can be used as standalone key-value storage, name of submap is not accounted in this case.
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key' value') name key value Source #
type TypeDocFieldDescriptions (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (BigMap k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (BigMap k v) = 'TBigMap (ToT k) (ToT v)
type GetOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (BigMap k v) = k
type GetOpValHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (BigMap k v) = v
type UpdOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (BigMap k v) = k
type UpdOpParamsHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (BigMap k v) = Maybe v
type MemOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (BigMap k v) = k

type Operation = Operation' Instr #

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) #
Arbitrary1 Maybe
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen (Maybe a) # liftShrink :: (a -> [a]) -> Maybe a -> [Maybe a] #
ToJSON1 Maybe
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding #
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 #
Eq1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #
Ord1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #
Read1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #
Show1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #
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) #
KnownNamedFunctor Maybe
Instance details Defined in Util.Named Methods namedL :: forall (name :: Symbol) a. Label name -> Iso' (NamedF Maybe a name) (ApplyNamedFunctor Maybe a)
LorentzFunctor Maybe Source #
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) Source #
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 #
(Selector s, GToJSON enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type))
Instance details Defined in Data.Aeson.Types.ToJSON Methods recordToPairs :: Options -> ToArgs enc arity a0 -> S1 s (K1 i (Maybe a)) a0 -> pairs
() :=> (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 #
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 #
Arbitrary a => Arbitrary (Maybe a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Maybe a) # shrink :: Maybe a -> [Maybe a] #
CoArbitrary a => CoArbitrary (Maybe a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
ToJSON a => ToJSON (Maybe a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Maybe a -> Value # toEncoding :: Maybe a -> Encoding # toJSONList :: [Maybe a] -> Value # toEncodingList :: [Maybe a] -> Encoding #
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 #
Buildable a => Buildable (Maybe a)
Instance details Defined in Formatting.Buildable Methods build :: Maybe a -> Builder #
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)) #
Pretty a => Pretty (Maybe a)
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Maybe a -> Doc # prettyList :: [Maybe a] -> Doc #
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 #
HasAnnotation a => HasAnnotation (Maybe a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source #
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) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () Source #
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 (OptionalSym0 :: TyFun (f6989586621680973094 a6989586621680973095) (f6989586621680973094 (Maybe a6989586621680973095)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative 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 (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) #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
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 #
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 :: () #
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 #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source #
Wrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Maybe a name) Source #
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 TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
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) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappable (NamedF Maybe a name) = Maybe a

type List = [] Source #

data ContractRef arg #

Constructors

ContractRef
Fields crAddress :: Address crEntrypoint :: SomeEntrypointCall arg

Instances

Instances details

cp ~ cp' => FromContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> ContractRef cp' Source #
cp ~ cp' => ToContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: ContractRef cp' -> ContractRef cp Source #
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 #
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 #
HasAnnotation a => HasAnnotation (ContractRef a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a)) Source #
ToAddress (ContractRef cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: ContractRef cp -> Address Source #
CanCastTo a1 a2 => CanCastTo (ContractRef a1 :: Type) (ContractRef a2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (ContractRef a1) -> Proxy (ContractRef a2) -> () Source #
type TypeDocFieldDescriptions (ContractRef cp)
Instance details Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)

newtype TAddress p Source #

Address which remembers the parameter type of the contract it refers to.

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

Constructors

TAddress
Fields unTAddress :: Address

Instances

Instances details

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

newtype FutureContract arg Source #

Address associated with value of contract arg type.

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

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

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

Constructors

FutureContract
Fields unFutureContract :: ContractRef arg

Instances

Instances details

cp ~ cp' => FromContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> FutureContract cp' Source #
(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Address Methods toContractRef :: FutureContract cp' -> ContractRef cp Source #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
HasAnnotation (FutureContract a) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a)) Source #
ToAddress (FutureContract cp) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: FutureContract cp -> Address Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (FutureContract p) -> Proxy EpAddress -> () Source #
type ToT (FutureContract arg) Source #
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress

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)))

pattern DefEpName :: EpName #

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

type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg) #

Constructors

toMutez :: Word32 -> Mutez #

zeroMutez :: Mutez #

oneMutez :: Mutez #

mt :: QuasiQuoter #

timestampFromSeconds :: Integer -> Timestamp #

timestampFromUTCTime :: UTCTime -> Timestamp #

timestampQuote :: QuasiQuoter #

Conversions

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

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

Turn TAddress to ContractRef in Haskell world.

This is an analogy of address to contract convertion in Michelson world, thus you have to supply an entrypoint (or call the default one explicitly).

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

Specification of callTAddress to call the default entrypoint.

class ToAddress a where Source #

Convert something to Address in Haskell world.

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

Methods

toAddress :: a -> Address Source #

Instances

Instances details

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

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

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

Methods

toTAddress :: a -> TAddress cp Source #

Instances

Instances details

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

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

Convert something to ContractRef in Haskell world.

Methods

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

Instances

Instances details

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

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

Convert something from ContractAddr in Haskell world.

Methods

fromContractRef :: ContractRef cp -> contract Source #

Instances

Instances details

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

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

Misc

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 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 OptimizerConf
Instance details Defined in Michelson.Optimizer Methods def :: OptimizerConf #
Default MorleyLogs
Instance details Defined in Michelson.Interpret Methods def :: MorleyLogs #
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 (DfsSettings x)
Instance details Defined in Michelson.Typed.Util Methods def :: DfsSettings x #
Default (UStore a) Source #
Instance details Defined in Lorentz.UStore.Types Methods def :: UStore a #
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 (Annotation tag)
Instance details Defined in Michelson.Untyped.Annotation Methods def :: Annotation tag #
Default (k \|~> v) Source #
Instance details Defined in Lorentz.UStore.Types Methods def :: k \|~> v #
(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) #

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 #