Safe Haskell	None
Language	Haskell2010

Lorentz.Value

Contents

Primitive types
Custom datatypes
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 Never
data Timestamp
data ChainId
data KeyHash
data PublicKey
data Signature
data Bls12381Fr
data Bls12381G1
data Bls12381G2
data Set a
data Map k a
newtype BigMapId (k2 :: k) (v :: k1) = BigMapId {
- unBigMapId :: Natural
}
data BigMap k v
mkBigMap :: ToBigMap m => m -> BigMap (ToBigMapKey m) (ToBigMapValue m)
type Operation = Operation' Instr
data Maybe a
- = Nothing
- | Just a
type List = []
data ReadTicket a = ReadTicket {
- rtTicketer :: Address
- rtData :: a
- rtAmount :: Natural
}
data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
}
newtype TAddress (p :: Type) (vd :: Type) = TAddress {
- unTAddress :: Address
}
newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
}
data Ticket arg = Ticket {
- tTicketer :: Address
- tData :: arg
- tAmount :: Natural
}
data Chest
data ChestKey
data OpenChest
data EpName
pattern DefEpName :: EpName
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)
newtype Fixed (a :: k) = MkFixed Integer
newtype NFixed p = MkNFixed Natural
data DecBase p where
- DecBase :: KnownNat p => DecBase p
data BinBase p where
- BinBase :: KnownNat p => BinBase p
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
callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp)
callingTAddress :: forall cp vd mname. NiceParameterFull cp => TAddress cp vd -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
callingDefTAddress :: forall cp vd. NiceParameterFull cp => TAddress cp vd -> ContractRef (GetDefaultEntrypointArg cp)
class ToAddress a where
- toAddress :: a -> Address
class ToTAddress (cp :: Type) (vd :: Type) (a :: Type) where
- toTAddress :: a -> TAddress cp vd
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 Show a
class Default a where
- def :: a
data Label (name :: Symbol) where
- Label :: forall (name :: Symbol). KnownSymbol name => Label name
newtype PrintAsValue a = PrintAsValue a

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 Morley.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 Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
IsoValue Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
IsoValue ()
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT () :: T # Methods toVal :: () -> Value (ToT ()) # fromVal :: Value (ToT ()) -> () #
IsoValue ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
(DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
IsoValue Void
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Void :: T # Methods toVal :: Void -> Value (ToT Void) # fromVal :: Value (ToT Void) -> Void #
IsoValue MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
IsoValue Operation
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Operation :: T # Methods toVal :: Operation -> Value (ToT Operation) # fromVal :: Value (ToT Operation) -> Operation #
IsoValue EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
IsoValue MyCompoundType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyCompoundType :: T # Methods toVal :: MyCompoundType -> Value (ToT MyCompoundType) # fromVal :: Value (ToT MyCompoundType) -> MyCompoundType #
IsoValue Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
IsoValue Bls12381Fr
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381Fr :: T # Methods toVal :: Bls12381Fr -> Value (ToT Bls12381Fr) # fromVal :: Value (ToT Bls12381Fr) -> Bls12381Fr #
IsoValue Bls12381G1
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G1 :: T # Methods toVal :: Bls12381G1 -> Value (ToT Bls12381G1) # fromVal :: Value (ToT Bls12381G1) -> Bls12381G1 #
IsoValue Bls12381G2
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bls12381G2 :: T # Methods toVal :: Bls12381G2 -> Value (ToT Bls12381G2) # fromVal :: Value (ToT Bls12381G2) -> Bls12381G2 #
IsoValue ChainId
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
IsoValue Chest
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Chest :: T # Methods toVal :: Chest -> Value (ToT Chest) # fromVal :: Value (ToT Chest) -> Chest #
IsoValue ChestKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ChestKey :: T # Methods toVal :: ChestKey -> Value (ToT ChestKey) # fromVal :: Value (ToT ChestKey) -> ChestKey #
IsoValue KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
IsoValue Mutez
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
IsoValue PublicKey
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
IsoValue Signature
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
IsoValue Timestamp
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
IsoValue MyType2
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Product Associated Types type ToT MyType2 :: T # Methods toVal :: MyType2 -> Value (ToT MyType2) # fromVal :: Value (ToT MyType2) -> MyType2 #
IsoValue MyType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType :: T # Methods toVal :: MyType -> Value (ToT MyType) # fromVal :: Value (ToT MyType) -> MyType #
IsoValue MyType'
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType' :: T # Methods toVal :: MyType' -> Value (ToT MyType') # fromVal :: Value (ToT MyType') -> MyType' #
IsoValue MyEnum
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyEnum :: T # Methods toVal :: MyEnum -> Value (ToT MyEnum) # fromVal :: Value (ToT MyEnum) -> MyEnum #
IsoValue MyTypeWithNamedField
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyTypeWithNamedField :: T # Methods toVal :: MyTypeWithNamedField -> Value (ToT MyTypeWithNamedField) # fromVal :: Value (ToT MyTypeWithNamedField) -> MyTypeWithNamedField #
IsoValue Never Source #
Instance details Defined in Lorentz.Value Associated Types type ToT Never :: T # Methods toVal :: Never -> Value (ToT Never) # fromVal :: Value (ToT Never) -> Never #
IsoValue OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type ToT OpenChest :: T # Methods toVal :: OpenChest -> Value (ToT OpenChest) # fromVal :: Value (ToT OpenChest) -> OpenChest #
IsoValue 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 Morley.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 Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
IsoValue a => IsoValue (Identity a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Identity a) :: T # Methods toVal :: Identity a -> Value (ToT (Identity a)) # fromVal :: Value (ToT (Identity a)) -> Identity a #
(Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
WellTyped t => IsoValue (Value t)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Value t) :: T # Methods toVal :: Value t -> Value (ToT (Value t)) # fromVal :: Value (ToT (Value t)) -> Value t #
(HasNoOpToT arg, WellTypedToT arg) => IsoValue (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
(Comparable (ToT a), IsoValue a) => IsoValue (Ticket a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Ticket a) :: T # Methods toVal :: Ticket a -> Value (ToT (Ticket a)) # fromVal :: Value (ToT (Ticket a)) -> Ticket a #
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 #
IsoValue a => IsoValue (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (ReadTicket a) :: T # Methods toVal :: ReadTicket a -> Value (ToT (ReadTicket a)) # fromVal :: Value (ToT (ReadTicket a)) -> ReadTicket a #
IsoValue a => IsoValue (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (OpenChestT a) :: T # Methods toVal :: OpenChestT a -> Value (ToT (OpenChestT a)) # fromVal :: Value (ToT (OpenChestT a)) -> OpenChestT a #
IsoValue (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (ChestT a) :: T # Methods toVal :: ChestT a -> Value (ToT (ChestT a)) # fromVal :: Value (ToT (ChestT a)) -> ChestT a #
IsoValue (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (TSignature a) :: T # Methods toVal :: TSignature a -> Value (ToT (TSignature a)) # fromVal :: Value (ToT (TSignature a)) -> TSignature a #
IsoValue (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Packed a) :: T # Methods toVal :: Packed a -> Value (ToT (Packed a)) # fromVal :: Value (ToT (Packed a)) -> Packed a #
(WellTypedIsoValue (CustomErrorRep tag), TypeError ('Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag) Source #	This instance cannot be implemented, use `IsError` instance instead.
Instance details Defined in Lorentz.Errors Associated Types type ToT (CustomError tag) :: T # Methods toVal :: CustomError tag -> Value (ToT (CustomError tag)) # fromVal :: Value (ToT (CustomError tag)) -> CustomError tag #
(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 Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Either l r) :: T # Methods toVal :: Either l r -> Value (ToT (Either l r)) # fromVal :: Value (ToT (Either l r)) -> Either l r #
(IsoValue a, IsoValue b) => IsoValue (a, b)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b) :: T # Methods toVal :: (a, b) -> Value (ToT (a, b)) # fromVal :: Value (ToT (a, b)) -> (a, b) #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
IsoValue (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Fixed p) :: T # Methods toVal :: Fixed p -> Value (ToT (Fixed p)) # fromVal :: Value (ToT (Fixed p)) -> Fixed p #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v, HasNoBigMapToT v, HasNoOpToT v) => IsoValue (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMap k v) :: T # Methods toVal :: BigMap k v -> Value (ToT (BigMap k v)) # fromVal :: Value (ToT (BigMap k v)) -> BigMap k v #
(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 vd) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (TAddress p vd) :: T # Methods toVal :: TAddress p vd -> Value (ToT (TAddress p vd)) # fromVal :: Value (ToT (TAddress p vd)) -> TAddress p vd #
IsoValue (NFixed p) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (NFixed p) :: T # Methods toVal :: NFixed p -> Value (ToT (NFixed p)) # fromVal :: Value (ToT (NFixed p)) -> NFixed p #
IsoValue cp => IsoValue (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type ToT (ParameterWrapper deriv cp) :: T # Methods toVal :: ParameterWrapper deriv cp -> Value (ToT (ParameterWrapper deriv cp)) # fromVal :: Value (ToT (ParameterWrapper deriv cp)) -> ParameterWrapper deriv cp #
IsoValue (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type ToT (Hash alg a) :: T # Methods toVal :: Hash alg a -> Value (ToT (Hash alg a)) # fromVal :: Value (ToT (Hash alg a)) -> Hash alg a #
IsoValue (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 #
(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 #
(HasNoOpToT 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 a, IsoValue b, IsoValue c) => IsoValue (a, b, c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c) :: T # Methods toVal :: (a, b, c) -> Value (ToT (a, b, c)) # fromVal :: Value (ToT (a, b, c)) -> (a, b, c) #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
IsoValue a => IsoValue (NamedF Identity a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Identity a name) :: T # Methods toVal :: NamedF Identity a name -> Value (ToT (NamedF Identity a name)) # fromVal :: Value (ToT (NamedF Identity a name)) -> NamedF Identity a name #
NiceComparable td => IsoValue (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type ToT (STicket action td) :: T # Methods toVal :: STicket action td -> Value (ToT (STicket action td)) # fromVal :: Value (ToT (STicket action td)) -> STicket action td #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d) => IsoValue (a, b, c, d)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d) :: T # Methods toVal :: (a, b, c, d) -> Value (ToT (a, b, c, d)) # fromVal :: Value (ToT (a, b, c, d)) -> (a, b, c, d) #
IsoValue (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (BigMapId k2 v) :: T # Methods toVal :: BigMapId k2 v -> Value (ToT (BigMapId k2 v)) # fromVal :: Value (ToT (BigMapId k2 v)) -> BigMapId k2 v #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e) => IsoValue (a, b, c, d, e)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e) :: T # Methods toVal :: (a, b, c, d, e) -> Value (ToT (a, b, c, d, e)) # fromVal :: Value (ToT (a, b, c, d, e)) -> (a, b, c, d, e) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f) => IsoValue (a, b, c, d, e, f)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f) :: T # Methods toVal :: (a, b, c, d, e, f) -> Value (ToT (a, b, c, d, e, f)) # fromVal :: Value (ToT (a, b, c, d, e, f)) -> (a, b, c, d, e, f) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f, IsoValue g) => IsoValue (a, b, c, d, e, f, g)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f, g) :: T # Methods toVal :: (a, b, c, d, e, f, g) -> Value (ToT (a, b, c, d, e, f, g)) # fromVal :: Value (ToT (a, b, c, d, e, f, g)) -> (a, b, c, d, e, f, g) #

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

Primitive types

data Integer #

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

For more information about this type's representation, see the comments in its implementation.

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 #
UniformRange Integer
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Integer, Integer) -> g -> m Integer #
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 #
Semiring Integer
Instance details Defined in Data.Semiring Methods plus :: Integer -> Integer -> Integer # zero :: Integer # times :: Integer -> Integer -> Integer # one :: Integer # fromNatural :: Natural -> Integer #
Ring Integer
Instance details Defined in Data.Semiring Methods negate :: Integer -> Integer #
Pretty Integer
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Integer -> Doc # prettyList :: [Integer] -> Doc #
HasCLReader Integer
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Integer getMetavar :: String
TypeHasDoc Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Integer :: FieldDescriptions # Methods typeDocName :: Proxy Integer -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Integer -> WithinParens -> Markdown # typeDocDependencies :: Proxy Integer -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Integer # typeDocMichelsonRep :: TypeDocMichelsonRep Integer #
IsoValue Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
HasAnnotation Integer Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Integer) Source # annOptions :: AnnOptions Source #
NonZero Integer Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Integer ': s) :-> (Maybe Integer ': s) Source #
LDefault Integer Source #
Instance details Defined in Lorentz.Default Methods ldef :: Integer Source # lIsDef :: forall (s :: [Type]). (Integer ': s) :-> (Bool ': s) Source #
Lift Integer
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Integer -> Q Exp # liftTyped :: Integer -> Q (TExp Integer) #
MultiplyPoint Integer Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G1 -> Bls12381G1
MultiplyPoint Integer Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods multiply :: Integer -> Bls12381G2 -> Bls12381G2
UnaryArithOpHs Abs Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Abs Integer ': s) Source #
UnaryArithOpHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Eq' Integer ': s) Source #
UnaryArithOpHs Ge Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Ge Integer ': s) Source #
UnaryArithOpHs Gt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Gt Integer ': s) Source #
UnaryArithOpHs Le Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Le Integer ': s) Source #
UnaryArithOpHs Lt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Lt Integer ': s) Source #
UnaryArithOpHs Neg Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neg Integer ': s) Source #
UnaryArithOpHs Neq Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Neq Integer ': s) Source #
UnaryArithOpHs Not Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Integer ': s) :-> (UnaryArithResHs Not Integer ': s) Source #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
r ~ Integer => ArithOpHs Add Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Integer Timestamp r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Timestamp ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Add Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Integer Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Timestamp => ArithOpHs Sub Timestamp Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Timestamp ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Integer (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (NFixed p ': s)) :-> (r ': s) 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 #
r ~ Fixed p => ArithOpHs Add (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (BinBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (DecBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (NFixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Integer ': s)) :-> (r ': s) Source #
type Difference Integer
Instance details Defined in Basement.Numerical.Subtractive type Difference Integer = Integer
type IntBaseType Integer
Instance details Defined in Data.IntCast type IntBaseType Integer = 'BigIntTag
type TypeDocFieldDescriptions Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Integer = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Integer
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Integer = 'TInt
type UnaryArithResHs Abs Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Ge Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type UnaryArithResHs Gt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Lt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Neg Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Neq Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Not Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer

data 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 #
UniformRange Natural
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Natural, Natural) -> g -> m Natural #
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 #
ToJSON TezosNat
Instance details Defined in Morley.Micheline.Json Methods toJSON :: TezosNat -> Value # toEncoding :: TezosNat -> Encoding # toJSONList :: [TezosNat] -> Value # toEncodingList :: [TezosNat] -> Encoding #
ToJSONKey Natural
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Natural # toJSONKeyList :: ToJSONKeyFunction [Natural] #
FromJSON TezosNat
Instance details Defined in Morley.Micheline.Json Methods parseJSON :: Value -> Parser TezosNat # parseJSONList :: Value -> Parser [TezosNat] #
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 -> () #
Buildable TezosNat
Instance details Defined in Morley.Micheline.Json Methods build :: TezosNat -> Builder #
Semiring Natural
Instance details Defined in Data.Semiring Methods plus :: Natural -> Natural -> Natural # zero :: Natural # times :: Natural -> Natural -> Natural # one :: Natural # fromNatural :: Natural -> Natural #
HasCLReader Natural
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Natural getMetavar :: String
TypeHasDoc Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Natural :: FieldDescriptions # Methods typeDocName :: Proxy Natural -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Natural -> WithinParens -> Markdown # typeDocDependencies :: Proxy Natural -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Natural # typeDocMichelsonRep :: TypeDocMichelsonRep Natural #
IsoValue Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
HasAnnotation Natural Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Natural) Source # annOptions :: AnnOptions Source #
ToIntegerArithOpHs Natural Source #
Instance details Defined in Lorentz.Arith Methods evalToIntOpHs :: forall (s :: [Type]). (Natural ': s) :-> (Integer ': s) Source #
NonZero Natural Source #
Instance details Defined in Lorentz.Macro Methods nonZero :: forall (s :: [Type]). (Natural ': s) :-> (Maybe Natural ': s) Source #
LDefault Natural Source #
Instance details Defined in Lorentz.Default Methods ldef :: Natural Source # lIsDef :: forall (s :: [Type]). (Natural ': s) :-> (Bool ': s) Source #
Lift Natural
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Natural -> Q Exp # liftTyped :: Natural -> Q (TExp Natural) #
UnaryArithOpHs Eq' Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Eq' Natural ': s) Source #
UnaryArithOpHs Ge Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Ge Natural ': s) Source #
UnaryArithOpHs Gt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Gt Natural ': s) Source #
UnaryArithOpHs Le Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Le Natural ': s) Source #
UnaryArithOpHs Lt Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Lt Natural ': s) Source #
UnaryArithOpHs Neg Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neg Natural ': s) Source #
UnaryArithOpHs Neq Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Neq Natural ': s) Source #
UnaryArithOpHs Not Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Natural ': s) :-> (UnaryArithResHs Not Natural ': s) Source #
r ~ Integer => ArithOpHs Add Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Add Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Add Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs And Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Integer, Natural) => ArithOpHs EDiv Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Maybe (Natural, Natural) => ArithOpHs EDiv Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Maybe (Mutez, Mutez) => ArithOpHs EDiv Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsl Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Lsr Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Mul Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Mul Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Natural Bls12381Fr r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Bls12381Fr ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Natural Mutez r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Mutez ': s)) :-> (r ': s) Source #
r ~ Bls12381Fr => ArithOpHs Mul Bls12381Fr Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bls12381Fr ': (Natural ': s)) :-> (r ': s) Source #
r ~ Mutez => ArithOpHs Mul Mutez Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Mutez ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Or Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Integer Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Natural ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Integer ': s)) :-> (r ': s) Source #
r ~ Integer => ArithOpHs Sub Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Natural => ArithOpHs Xor Natural Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add Natural (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul Natural (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (NFixed p ': s)) :-> (r ': s) 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 #
r ~ Fixed p => ArithOpHs Add (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Add (NFixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (DecBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed (BinBase b) => ArithOpHs Lsl (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed (BinBase b) => ArithOpHs Lsr (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed p => ArithOpHs Mul (NFixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Natural ': s)) :-> (r ': s) Source #
type Difference Natural
Instance details Defined in Basement.Numerical.Subtractive type Difference Natural = Maybe Natural
type IntBaseType Natural
Instance details Defined in Data.IntCast type IntBaseType Natural = 'BigWordTag
type TypeDocFieldDescriptions Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Natural = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Natural
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Natural = 'TNat
type UnaryArithResHs Eq' Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Natural = Bool
type UnaryArithResHs Ge Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Natural = Bool
type UnaryArithResHs Gt Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Natural = Bool
type UnaryArithResHs Le Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Natural = Bool
type UnaryArithResHs Lt Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Natural = Bool
type UnaryArithResHs Neg Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Neq Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Natural = Bool
type UnaryArithResHs Not Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer

data MText #

Instances

Instances details

Eq MText
Instance details Defined in Morley.Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Data MText
Instance details Defined in Morley.Michelson.Text Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MText -> c MText # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MText # toConstr :: MText -> Constr # dataTypeOf :: MText -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MText) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MText) # gmapT :: (forall b. Data b => b -> b) -> MText -> MText # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQ :: (forall d. Data d => d -> u) -> MText -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MText -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText #
Ord MText
Instance details Defined in Morley.Michelson.Text Methods compare :: MText -> MText -> Ordering # (<) :: MText -> MText -> Bool # (<=) :: MText -> MText -> Bool # (>) :: MText -> MText -> Bool # (>=) :: MText -> MText -> Bool # max :: MText -> MText -> MText # min :: MText -> MText -> MText #
Show MText
Instance details Defined in Morley.Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
Generic MText
Instance details Defined in Morley.Michelson.Text Associated Types type Rep MText :: Type -> Type # Methods from :: MText -> Rep MText x # to :: Rep MText x -> MText #
Semigroup MText
Instance details Defined in Morley.Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Monoid MText
Instance details Defined in Morley.Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Hashable MText
Instance details Defined in Morley.Michelson.Text Methods hashWithSalt :: Int -> MText -> Int # hash :: MText -> Int #
ToJSON MText
Instance details Defined in Morley.Michelson.Text Methods toJSON :: MText -> Value # toEncoding :: MText -> Encoding # toJSONList :: [MText] -> Value # toEncodingList :: [MText] -> Encoding #
FromJSON MText
Instance details Defined in Morley.Michelson.Text Methods parseJSON :: Value -> Parser MText # parseJSONList :: Value -> Parser [MText] #
NFData MText
Instance details Defined in Morley.Michelson.Text Methods rnf :: MText -> () #
Buildable MText
Instance details Defined in Morley.Michelson.Text Methods build :: MText -> Builder #
ToText MText
Instance details Defined in Morley.Michelson.Text Methods toText :: MText -> Text #
Container MText
Instance details Defined in Morley.Michelson.Text Associated Types type Element MText # Methods toList :: MText -> [Element MText] # null :: MText -> Bool # foldr :: (Element MText -> b -> b) -> b -> MText -> b # foldl :: (b -> Element MText -> b) -> b -> MText -> b # foldl' :: (b -> Element MText -> b) -> b -> MText -> b # length :: MText -> Int # elem :: Element MText -> MText -> Bool # foldMap :: Monoid m => (Element MText -> m) -> MText -> m # fold :: MText -> Element MText # foldr' :: (Element MText -> b -> b) -> b -> MText -> b # notElem :: Element MText -> MText -> Bool # all :: (Element MText -> Bool) -> MText -> Bool # any :: (Element MText -> Bool) -> MText -> Bool # and :: MText -> Bool # or :: MText -> Bool # find :: (Element MText -> Bool) -> MText -> Maybe (Element MText) # safeHead :: MText -> Maybe (Element MText) # safeMaximum :: MText -> Maybe (Element MText) # safeMinimum :: MText -> Maybe (Element MText) # safeFoldr1 :: (Element MText -> Element MText -> Element MText) -> MText -> Maybe (Element MText) # safeFoldl1 :: (Element MText -> Element MText -> Element MText) -> MText -> Maybe (Element MText) #
HasCLReader MText
Instance details Defined in Morley.Michelson.Text Methods getReader :: ReadM MText getMetavar :: String
TypeHasDoc MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions MText :: FieldDescriptions # Methods typeDocName :: Proxy MText -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy MText -> WithinParens -> Markdown # typeDocDependencies :: Proxy MText -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep MText # typeDocMichelsonRep :: TypeDocMichelsonRep MText #
IsoValue MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
HasAnnotation MText Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT MText) Source # annOptions :: AnnOptions 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
IsCustomErrorArgRep MText Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> MText -> Either Text MText Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #
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). SingI t => Value t -> Either Text MText Source # failUsing :: forall (s :: [Type]) (t :: [Type]). IsError MText => MText -> s :-> t Source #
TypeHasDoc errArg => IsCustomErrorArgRep (MText, errArg) Source #
Instance details Defined in Lorentz.Errors Methods verifyErrorTag :: MText -> (MText, errArg) -> Either Text (MText, errArg) Source # customErrorRepDocDeps :: [SomeDocDefinitionItem] Source # customErrorHaskellRep :: forall (tag :: Symbol). (KnownSymbol tag, CustomErrorHasDoc tag) => Proxy tag -> Markdown Source #
type Rep MText
Instance details Defined in Morley.Michelson.Text type Rep MText = D1 ('MetaData "MText" "Morley.Michelson.Text" "morley-1.16.2-inplace" 'True) (C1 ('MetaCons "UnsafeMText" 'PrefixI 'True) (S1 ('MetaSel ('Just "unMText") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Element MText
Instance details Defined in Morley.Michelson.Text type Element MText = Element Text
type TypeDocFieldDescriptions MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions MText = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT MText
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT MText = 'TString
type 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 #
UniformRange Bool
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Bool, Bool) -> g -> m Bool #
Uniform Bool
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Bool #
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] #
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
Semiring Bool
Instance details Defined in Data.Semiring Methods plus :: Bool -> Bool -> Bool # zero :: Bool # times :: Bool -> Bool -> Bool # one :: Bool # fromNatural :: Natural -> Bool #
PShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg 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 arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Nat # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
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 :: a # type MaxBound :: a #
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 arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd Bool
Instance details Defined in Data.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 #
Boolean Bool
Instance details Defined in Morley.Prelude.Boolean Methods (&&) :: Bool -> Bool -> Bool (\|\|) :: Bool -> Bool -> 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
TypeHasDoc Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Bool :: FieldDescriptions # Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Bool # typeDocMichelsonRep :: TypeDocMichelsonRep Bool #
IsoValue Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
HasAnnotation Bool Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool) Source # annOptions :: AnnOptions Source #
Lift Bool
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Bool -> Q Exp # liftTyped :: Bool -> Q (TExp Bool) #
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) #
SingI 'False	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'False
SingI 'True	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'True
UnaryArithOpHs Not Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bool ': s) :-> (UnaryArithResHs Not Bool ': s) Source #
r ~ Bool => ArithOpHs And Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Or Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
r ~ Bool => ArithOpHs Xor Bool Bool r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Bool ': (Bool ': s)) :-> (r ': s) Source #
() :=> (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_6989586621680204213Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings All_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Any_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AnySym0
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_6989586621679848969Sym0
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_6989586621680204200Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680654022Sym0
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 All_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods sing :: Sing All_Sym0 #
SingI AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AllSym0 #
SingI Any_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods sing :: Sing Any_Sym0 #
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 #
SingI GetAllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAllSym0 #
SingI GetAnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAnySym0 #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679816296 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679815994 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848969Sym1 a6989586621679848974 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680654022Sym1 a6989586621680654032 :: TyFun Bool (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823225Sym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$$) a6989586621679910712 :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814090Scrutinee_6989586621680814032Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814066Scrutinee_6989586621680814030Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823849Sym0 :: TyFun a (Product a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823674Sym0 :: TyFun a (Sum a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823499Sym0 :: TyFun a (Dual a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823091Sym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837455Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837439Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837423Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837407Sym0 :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837496Scrutinee_6989586621679837324Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837480Scrutinee_6989586621679837322Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837399Scrutinee_6989586621679837312Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837395Scrutinee_6989586621679837310Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680787230Scrutinee_6989586621680786635Sym0 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621681012518Sym0 :: TyFun a (Identity a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621681012634Sym0 :: TyFun (Identity a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823631Sym0 :: TyFun (Dual a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823806Sym0 :: TyFun (Sum a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823981Sym0 :: TyFun (Product a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379490ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379490YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379490X_6989586621680379491Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379455ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379455YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379455X_6989586621680379456Sym0 :: 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 (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> 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 a6989586621680749475 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym1 a6989586621680749403 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680379973 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621680379981 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680380198 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680380206 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823091Sym1 a6989586621680823100 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379278Scrutinee_6989586621680375723Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym1 a6989586621680379209 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680822981Sym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$$) a6989586621679819377 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$$) a6989586621679819380 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679815190 :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837455Sym1 a6989586621679837460 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837439Sym1 a6989586621679837444 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837423Sym1 a6989586621679837428 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679837407Sym1 a6989586621679837412 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$$) a6989586621679837367 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$$) a6989586621679837372 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$$) a6989586621679837357 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$$) a6989586621679837362 :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681203563Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621681012518Sym1 a6989586621681012523 :: TyFun (Identity a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823499Sym1 a6989586621680823508 :: TyFun (Dual a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823674Sym1 a6989586621680823683 :: TyFun (Sum a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823849Sym1 a6989586621680823858 :: TyFun (Product a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379357ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379357YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379357X_6989586621680379358Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379223NubBy'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_6989586621680379518Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680822514Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679990244GoSym0 :: 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 a6989586621679815190 a6989586621679815191 :: TyFun Bool a -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym2 a6989586621680379209 a6989586621680379210 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681501382Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: 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 (Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: 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 (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: 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_6989586621680822945Sym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680822953Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681203563Sym1 a6989586621681203568 :: TyFun (Arg a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681501379Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681501217Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m 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 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (ElemSym1 d) #
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AnySym1 d) #
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AllSym1 d) #
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: 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_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: 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 (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: 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_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: 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 (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: 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 (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: 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 (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: 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 (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: 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))
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_6989586621680176837Sym0
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680176834Sym0
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 DemoteRep Bool
Instance details Defined in GHC.Generics type DemoteRep Bool = Bool
data Sing (a :: Bool)
Instance details Defined in GHC.Generics data Sing (a :: Bool) where STrue :: Sing 'True SFalse :: Sing 'False
type TypeDocFieldDescriptions Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Bool
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Bool = 'TBool
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
type Show_ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Bool) = Apply (Show__6989586621680636746Sym0 :: TyFun Bool Symbol -> Type) arg
type FromEnum (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type FromEnum (a :: Bool) = Apply FromEnum_6989586621680204213Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Enum type ToEnum a = Apply ToEnum_6989586621680204200Sym0 a
type Pred (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Pred (arg :: Bool) = Apply (Pred_6989586621680180977Sym0 :: TyFun Bool Bool -> Type) arg
type Succ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Succ (arg :: Bool) = Apply (Succ_6989586621680180964Sym0 :: TyFun Bool Bool -> Type) arg
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_6989586621680636754Sym0 :: 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_6989586621680180987Sym0 :: 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_6989586621679837487Sym0 :: 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_6989586621679837471Sym0 :: 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_6989586621679837455Sym0 :: 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_6989586621679837439Sym0 :: 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_6989586621679837423Sym0 :: 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_6989586621679837407Sym0 :: 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_6989586621679848969Sym0 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_6989586621679820649 a b
type ShowsPrec a1 (a2 :: Bool) a3
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Bool) a3 = Apply (Apply (Apply ShowsPrec_6989586621680654022Sym0 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_6989586621680180999Sym0 :: TyFun Bool (Bool ~> (Bool ~> [Bool])) -> Type) arg1) arg2) arg3
type Apply NotSym0 (a6989586621679816577 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply NotSym0 (a6989586621679816577 :: Bool) = NotSym1 a6989586621679816577
type Apply FromEnum_6989586621680204213Sym0 (a6989586621680204217 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply FromEnum_6989586621680204213Sym0 (a6989586621680204217 :: Bool) = FromEnum_6989586621680204213Sym1 a6989586621680204217
type Apply All_Sym0 (a6989586621680362855 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation type Apply All_Sym0 (a6989586621680362855 :: Bool) = All_Sym1 a6989586621680362855
type Apply AllSym0 (a6989586621680250034 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AllSym0 (a6989586621680250034 :: Bool) = AllSym1 a6989586621680250034
type Apply Any_Sym0 (a6989586621680362849 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation type Apply Any_Sym0 (a6989586621680362849 :: Bool) = Any_Sym1 a6989586621680362849
type Apply AnySym0 (a6989586621680250051 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AnySym0 (a6989586621680250051 :: Bool) = AnySym1 a6989586621680250051
type Apply ToEnum_6989586621680204200Sym0 (a6989586621680204204 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply ToEnum_6989586621680204200Sym0 (a6989586621680204204 :: Nat) = ToEnum_6989586621680204200Sym1 a6989586621680204204
type Apply GetAllSym0 (a6989586621680250037 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAllSym0 (a6989586621680250037 :: All) = GetAllSym1 a6989586621680250037
type Apply GetAnySym0 (a6989586621680250054 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAnySym0 (a6989586621680250054 :: Any) = GetAnySym1 a6989586621680250054
type Apply ((\|\|@#@$$) a6989586621679816296 :: TyFun Bool Bool -> Type) (a6989586621679816297 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((\|\|@#@$$) a6989586621679816296 :: TyFun Bool Bool -> Type) (a6989586621679816297 :: Bool) = a6989586621679816296 \|\|@#@$$$ a6989586621679816297
type Apply ((&&@#@$$) a6989586621679815994 :: TyFun Bool Bool -> Type) (a6989586621679815995 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((&&@#@$$) a6989586621679815994 :: TyFun Bool Bool -> Type) (a6989586621679815995 :: Bool) = a6989586621679815994 &&@#@$$$ a6989586621679815995
type Apply (Compare_6989586621679848969Sym1 a6989586621679848974 :: TyFun Bool Ordering -> Type) (a6989586621679848975 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848969Sym1 a6989586621679848974 :: TyFun Bool Ordering -> Type) (a6989586621679848975 :: Bool) = Compare_6989586621679848969Sym2 a6989586621679848974 a6989586621679848975
type Apply ((<=?@#@$$) a6989586621679910712 :: TyFun Nat Bool -> Type) (a6989586621679910713 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply ((<=?@#@$$) a6989586621679910712 :: TyFun Nat Bool -> Type) (a6989586621679910713 :: Nat) = a6989586621679910712 <=?@#@$$$ a6989586621679910713
type Apply (Let6989586621680787230Scrutinee_6989586621680786635Sym0 :: TyFun k1 Bool -> Type) (n6989586621680787229 :: k1)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Let6989586621680787230Scrutinee_6989586621680786635Sym0 :: TyFun k1 Bool -> Type) (n6989586621680787229 :: k1) = Let6989586621680787230Scrutinee_6989586621680786635Sym1 n6989586621680787229
type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061 :: TyFun k1 Bool -> Type) (y6989586621680814062 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061 :: TyFun k1 Bool -> Type) (y6989586621680814062 :: k1) = Let6989586621680814066Scrutinee_6989586621680814030Sym2 x6989586621680814061 y6989586621680814062
type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085 :: TyFun k1 Bool -> Type) (y6989586621680814086 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085 :: TyFun k1 Bool -> Type) (y6989586621680814086 :: k1) = Let6989586621680814090Scrutinee_6989586621680814032Sym2 x6989586621680814085 y6989586621680814086
type Apply ((==@#@$$) a6989586621679819377 :: TyFun a Bool -> Type) (a6989586621679819378 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$$) a6989586621679819377 :: TyFun a Bool -> Type) (a6989586621679819378 :: a) = a6989586621679819377 ==@#@$$$ a6989586621679819378
type Apply ((/=@#@$$) a6989586621679819380 :: TyFun a Bool -> Type) (a6989586621679819381 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$$) a6989586621679819380 :: TyFun a Bool -> Type) (a6989586621679819381 :: a) = a6989586621679819380 /=@#@$$$ a6989586621679819381
type Apply (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type) (a6989586621679819384 :: k)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type) (a6989586621679819384 :: k) = DefaultEqSym2 a6989586621679819383 a6989586621679819384
type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1) = Let6989586621679837395Scrutinee_6989586621679837310Sym2 x6989586621679837393 y6989586621679837394
type Apply (TFHelper_6989586621679837455Sym1 a6989586621679837460 :: TyFun a Bool -> Type) (a6989586621679837461 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837455Sym1 a6989586621679837460 :: TyFun a Bool -> Type) (a6989586621679837461 :: a) = TFHelper_6989586621679837455Sym2 a6989586621679837460 a6989586621679837461
type Apply (TFHelper_6989586621679837439Sym1 a6989586621679837444 :: TyFun a Bool -> Type) (a6989586621679837445 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837439Sym1 a6989586621679837444 :: TyFun a Bool -> Type) (a6989586621679837445 :: a) = TFHelper_6989586621679837439Sym2 a6989586621679837444 a6989586621679837445
type Apply (TFHelper_6989586621679837423Sym1 a6989586621679837428 :: TyFun a Bool -> Type) (a6989586621679837429 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837423Sym1 a6989586621679837428 :: TyFun a Bool -> Type) (a6989586621679837429 :: a) = TFHelper_6989586621679837423Sym2 a6989586621679837428 a6989586621679837429
type Apply (TFHelper_6989586621679837407Sym1 a6989586621679837412 :: TyFun a Bool -> Type) (a6989586621679837413 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837407Sym1 a6989586621679837412 :: TyFun a Bool -> Type) (a6989586621679837413 :: a) = TFHelper_6989586621679837407Sym2 a6989586621679837412 a6989586621679837413
type Apply ((<=@#@$$) a6989586621679837362 :: TyFun a Bool -> Type) (a6989586621679837363 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$$) a6989586621679837362 :: TyFun a Bool -> Type) (a6989586621679837363 :: a) = a6989586621679837362 <=@#@$$$ a6989586621679837363
type Apply ((>=@#@$$) a6989586621679837372 :: TyFun a Bool -> Type) (a6989586621679837373 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$$) a6989586621679837372 :: TyFun a Bool -> Type) (a6989586621679837373 :: a) = a6989586621679837372 >=@#@$$$ a6989586621679837373
type Apply ((>@#@$$) a6989586621679837367 :: TyFun a Bool -> Type) (a6989586621679837368 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$$) a6989586621679837367 :: TyFun a Bool -> Type) (a6989586621679837368 :: a) = a6989586621679837367 >@#@$$$ a6989586621679837368
type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494 :: TyFun k1 Bool -> Type) (y6989586621679837495 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494 :: TyFun k1 Bool -> Type) (y6989586621679837495 :: k1) = Let6989586621679837496Scrutinee_6989586621679837324Sym2 x6989586621679837494 y6989586621679837495
type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478 :: TyFun k1 Bool -> Type) (y6989586621679837479 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478 :: TyFun k1 Bool -> Type) (y6989586621679837479 :: k1) = Let6989586621679837480Scrutinee_6989586621679837322Sym2 x6989586621679837478 y6989586621679837479
type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1) = Let6989586621679837399Scrutinee_6989586621679837312Sym2 x6989586621679837393 y6989586621679837394
type Apply ((<@#@$$) a6989586621679837357 :: TyFun a Bool -> Type) (a6989586621679837358 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$$) a6989586621679837357 :: TyFun a Bool -> Type) (a6989586621679837358 :: a) = a6989586621679837357 <@#@$$$ a6989586621679837358
type Apply (Bool_Sym2 a6989586621679815190 a6989586621679815191 :: TyFun Bool a -> Type) (a6989586621679815192 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym2 a6989586621679815190 a6989586621679815191 :: TyFun Bool a -> Type) (a6989586621679815192 :: Bool) = Bool_Sym3 a6989586621679815190 a6989586621679815191 a6989586621679815192
type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type) (x6989586621680379277 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type) (x6989586621680379277 :: k) = Let6989586621680379278Scrutinee_6989586621680375723Sym2 n6989586621680379276 x6989586621680379277
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type) (n6989586621680379258 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type) (n6989586621680379258 :: k3) = Let6989586621680379259Scrutinee_6989586621680375725Sym3 x6989586621680379256 xs6989586621680379257 n6989586621680379258
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type) (xs6989586621680379420 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type) (xs6989586621680379420 :: k3) = Let6989586621680379421Scrutinee_6989586621680375709Sym3 n6989586621680379418 x6989586621680379419 xs6989586621680379420
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type) (xs6989586621680379433 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type) (xs6989586621680379433 :: k3) = Let6989586621680379434Scrutinee_6989586621680375707Sym3 n6989586621680379431 x6989586621680379432 xs6989586621680379433
type Apply (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type) (arg_69895866216808223416989586621680822956 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type) (arg_69895866216808223416989586621680822956 :: k3) = Lambda_6989586621680822953Sym3 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 arg_69895866216808223416989586621680822956
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type) (xys6989586621680379343 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type) (xys6989586621680379343 :: k3) = Let6989586621680379344Scrutinee_6989586621680375719Sym4 key6989586621680379340 x6989586621680379341 y6989586621680379342 xys6989586621680379343
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type) (l6989586621680379238 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type) (l6989586621680379238 :: k3) = Let6989586621680379246Scrutinee_6989586621680375727Sym4 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 l6989586621680379238
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type) (a_69895866216803795096989586621680379517 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type) (a_69895866216803795096989586621680379517 :: k) = Let6989586621680379522Scrutinee_6989586621680375701Sym4 x6989586621680379520 xs6989586621680379521 p6989586621680379516 a_69895866216803795096989586621680379517
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type) (l6989586621680379222 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type) (l6989586621680379222 :: k3) = Let6989586621680379230Scrutinee_6989586621680375729Sym5 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 l6989586621680379222
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type) (arg_69895866216801807366989586621680180921 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type) (arg_69895866216801807366989586621680180921 :: k4) = Let6989586621680180930Scrutinee_6989586621680180738Sym5 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 arg_69895866216801807366989586621680180921
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type) (arg_69895866216801807606989586621680180831 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type) (arg_69895866216801807606989586621680180831 :: k5) = Let6989586621680180839Scrutinee_6989586621680180762Sym6 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 arg_69895866216801807606989586621680180831
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type) (arg_69895866216801807506989586621680180868 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type) (arg_69895866216801807506989586621680180868 :: k5) = Let6989586621680180876Scrutinee_6989586621680180752Sym6 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 arg_69895866216801807506989586621680180868
type Eval (Not 'False)
Instance details Defined in Fcf.Data.Bool type Eval (Not 'False) = 'True
type Eval (Not 'True)
Instance details Defined in Fcf.Data.Bool type Eval (Not 'True) = 'False
type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621680011677 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621680011677 :: Bool) = GuardSym1 a6989586621680011677 :: f ()
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 (\|\|@#@$) (a6989586621679816296 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (\|\|@#@$) (a6989586621679816296 :: Bool) = (\|\|@#@$$) a6989586621679816296
type Apply (&&@#@$) (a6989586621679815994 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (&&@#@$) (a6989586621679815994 :: Bool) = (&&@#@$$) a6989586621679815994
type Apply Compare_6989586621679848969Sym0 (a6989586621679848974 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679848969Sym0 (a6989586621679848974 :: Bool) = Compare_6989586621679848969Sym1 a6989586621679848974
type Apply ShowParenSym0 (a6989586621680636659 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowParenSym0 (a6989586621680636659 :: Bool) = ShowParenSym1 a6989586621680636659
type Apply ShowsPrec_6989586621680654022Sym0 (a6989586621680654032 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowsPrec_6989586621680654022Sym0 (a6989586621680654032 :: Nat) = ShowsPrec_6989586621680654022Sym1 a6989586621680654032
type Apply (<=?@#@$) (a6989586621679910712 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply (<=?@#@$) (a6989586621679910712 :: Nat) = (<=?@#@$$) a6989586621679910712
type Apply (ShowsPrec_6989586621680654022Sym1 a6989586621680654032 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680654033 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680654022Sym1 a6989586621680654032 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680654033 :: Bool) = ShowsPrec_6989586621680654022Sym2 a6989586621680654032 a6989586621680654033
type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621681501242 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621681501242 :: Bool) = UnlessSym1 a6989586621681501242 :: TyFun (f ()) (f ()) -> Type
type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680011821 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680011821 :: Bool) = WhenSym1 a6989586621680011821 :: TyFun (f ()) (f ()) -> Type
type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680749403 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680749403 :: a) = ListelemSym1 a6989586621680749403
type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379973 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379973 :: a) = NotElemSym1 a6989586621680379973
type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379981 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379981 :: a) = ElemSym1 a6989586621680379981
type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814061 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814061 :: k1) = Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061
type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814085 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814085 :: k1) = Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085
type Apply (Elem_6989586621680823091Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680823100 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823091Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680823100 :: a) = Elem_6989586621680823091Sym1 a6989586621680823100
type Apply (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680823472 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680823472 :: a) = Elem_6989586621680823467Sym1 a6989586621680823472
type Apply (Elem_6989586621680823499Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680823508 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823499Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680823508 :: a) = Elem_6989586621680823499Sym1 a6989586621680823508
type Apply (Elem_6989586621680823674Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680823683 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823674Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680823683 :: a) = Elem_6989586621680823674Sym1 a6989586621680823683
type Apply (Elem_6989586621680823849Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680823858 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823849Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680823858 :: a) = Elem_6989586621680823849Sym1 a6989586621680823858
type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819377 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819377 :: a) = (==@#@$$) a6989586621679819377
type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819380 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819380 :: a) = (/=@#@$$) a6989586621679819380
type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679819383 :: k)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679819383 :: k) = DefaultEqSym1 a6989586621679819383
type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679815190 :: a)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679815190 :: a) = Bool_Sym1 a6989586621679815190
type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1) = Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393
type Apply (TFHelper_6989586621679837455Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837460 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837455Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837460 :: a) = TFHelper_6989586621679837455Sym1 a6989586621679837460
type Apply (TFHelper_6989586621679837439Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837444 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837439Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837444 :: a) = TFHelper_6989586621679837439Sym1 a6989586621679837444
type Apply (TFHelper_6989586621679837423Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837428 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837423Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837428 :: a) = TFHelper_6989586621679837423Sym1 a6989586621679837428
type Apply (TFHelper_6989586621679837407Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837412 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679837407Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837412 :: a) = TFHelper_6989586621679837407Sym1 a6989586621679837412
type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837362 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837362 :: a) = (<=@#@$$) a6989586621679837362
type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837372 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837372 :: a) = (>=@#@$$) a6989586621679837372
type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837367 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837367 :: a) = (>@#@$$) a6989586621679837367
type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837494 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837494 :: k1) = Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494
type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837478 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837478 :: k1) = Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478
type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1) = Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393
type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837357 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837357 :: a) = (<@#@$$) a6989586621679837357
type Apply (Elem_6989586621681012518Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621681012523 :: a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621681012518Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621681012523 :: a) = Elem_6989586621681012518Sym1 a6989586621681012523
type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680379276 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680379276 :: k1) = Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type
type Apply (Elem_bySym1 a6989586621680379209 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379210 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym1 a6989586621680379209 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379210 :: a) = Elem_bySym2 a6989586621680379209 a6989586621680379210
type Apply (Elem_6989586621680822981Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822990 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680822981Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822990 :: a) = Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822781 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822781 :: a) = ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822528 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822528 :: a) = NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type
type Apply (Bool_Sym1 a6989586621679815190 :: TyFun a (Bool ~> a) -> Type) (a6989586621679815191 :: a)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym1 a6989586621679815190 :: TyFun a (Bool ~> a) -> Type) (a6989586621679815191 :: a) = Bool_Sym2 a6989586621679815190 a6989586621679815191
type Apply (Lambda_6989586621681501382Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621681501381 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621681501381 :: k1) = Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379256 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379256 :: k1) = Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680379340 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680379340 :: k1) = Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379418 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379418 :: k1) = Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379431 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379431 :: k1) = Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680379227 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680379227 :: k1) = Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379243 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379243 :: k1) = Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379520 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379520 :: k1) = Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680822953Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216808229476989586621680822952 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822953Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216808229476989586621680822952 :: k1) = Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2) = Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680379257 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680379257 :: k2) = Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379341 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379341 :: k1) = Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379419 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379419 :: k2) = Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379432 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379432 :: k2) = Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680379228 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680379228 :: k2) = Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379244 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379244 :: k2) = Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type
type Apply (Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808223396989586621680822955 :: k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808223396989586621680822955 :: k2) = Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680180929 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680180929 :: k1) = Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216815013706989586621681501378 :: k3)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216815013706989586621681501378 :: k3) = Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680379342 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680379342 :: k2) = Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180834 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180834 :: k1) = Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180871 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180871 :: k1) = Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680180924 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680180924 :: k2) = Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type
type Apply (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621681501384 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621681501384 :: Bool) = Lambda_6989586621681501382Sym4 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 flg6989586621681501384
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180835 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180835 :: k2) = Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180872 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180872 :: k2) = Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680180925 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680180925 :: k1) = Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180836 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180836 :: k1) = Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180873 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180873 :: k1) = Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801807346989586621680180920 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801807346989586621680180920 :: k3) = Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807566989586621680180829 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807566989586621680180829 :: k3) = Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807466989586621680180866 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807466989586621680180866 :: k3) = Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807586989586621680180830 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807586989586621680180830 :: k4) = Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807486989586621680180867 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807486989586621680180867 :: k4) = Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: 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 Morley.Util.Fcf type Eval (TyEqSing a b :: Bool -> Type) = DefaultEq a b
type Apply OrSym0 (a6989586621680380213 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply OrSym0 (a6989586621680380213 :: [Bool]) = OrSym1 a6989586621680380213
type Apply AndSym0 (a6989586621680380218 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply AndSym0 (a6989586621680380218 :: [Bool]) = AndSym1 a6989586621680380218
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680749312 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680749312 :: [a]) = ListnullSym1 a6989586621680749312
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680380391 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680380391 :: [a]) = NullSym1 a6989586621680380391
type Apply (Null_6989586621680823225Sym0 :: TyFun [a] Bool -> Type) (a6989586621680823231 :: [a])
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823225Sym0 :: TyFun [a] Bool -> Type) (a6989586621680823231 :: [a]) = Null_6989586621680823225Sym1 a6989586621680823231
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) = IsNothingSym1 a6989586621679959424
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) = IsJustSym1 a6989586621679959427
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822600 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822600 :: t Bool) = AndSym1 a6989586621680822600
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822594 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822594 :: t Bool) = OrSym1 a6989586621680822594
type Apply (Null_6989586621681012634Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621681012638 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Null_6989586621681012634Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621681012638 :: Identity a) = Null_6989586621681012634Sym1 a6989586621681012638
type Apply (Null_6989586621680823631Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680823635 :: Dual a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823631Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680823635 :: Dual a) = Null_6989586621680823631Sym1 a6989586621680823635
type Apply (Null_6989586621680823806Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680823810 :: Sum a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823806Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680823810 :: Sum a) = Null_6989586621680823806Sym1 a6989586621680823810
type Apply (Null_6989586621680823981Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680823985 :: Product a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823981Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680823985 :: Product a) = Null_6989586621680823981Sym1 a6989586621680823985
type Apply (ListelemSym1 a6989586621680749403 :: TyFun [a] Bool -> Type) (a6989586621680749404 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym1 a6989586621680749403 :: TyFun [a] Bool -> Type) (a6989586621680749404 :: [a]) = ListelemSym2 a6989586621680749403 a6989586621680749404
type Apply (ListisPrefixOfSym1 a6989586621680749475 :: TyFun [a] Bool -> Type) (a6989586621680749476 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym1 a6989586621680749475 :: TyFun [a] Bool -> Type) (a6989586621680749476 :: [a]) = ListisPrefixOfSym2 a6989586621680749475 a6989586621680749476
type Apply (NotElemSym1 a6989586621680379973 :: TyFun [a] Bool -> Type) (a6989586621680379974 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym1 a6989586621680379973 :: TyFun [a] Bool -> Type) (a6989586621680379974 :: [a]) = NotElemSym2 a6989586621680379973 a6989586621680379974
type Apply (ElemSym1 a6989586621680379981 :: TyFun [a] Bool -> Type) (a6989586621680379982 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym1 a6989586621680379981 :: TyFun [a] Bool -> Type) (a6989586621680379982 :: [a]) = ElemSym2 a6989586621680379981 a6989586621680379982
type Apply (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type) (a6989586621680380004 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type) (a6989586621680380004 :: [a]) = IsPrefixOfSym2 a6989586621680380003 a6989586621680380004
type Apply (AnySym1 a6989586621680380198 :: TyFun [a] Bool -> Type) (a6989586621680380199 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym1 a6989586621680380198 :: TyFun [a] Bool -> Type) (a6989586621680380199 :: [a]) = AnySym2 a6989586621680380198 a6989586621680380199
type Apply (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type) (a6989586621680379990 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type) (a6989586621680379990 :: [a]) = IsInfixOfSym2 a6989586621680379989 a6989586621680379990
type Apply (AllSym1 a6989586621680380206 :: TyFun [a] Bool -> Type) (a6989586621680380207 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym1 a6989586621680380206 :: TyFun [a] Bool -> Type) (a6989586621680380207 :: [a]) = AllSym2 a6989586621680380206 a6989586621680380207
type Apply (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type) (a6989586621680379997 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type) (a6989586621680379997 :: [a]) = IsSuffixOfSym2 a6989586621680379996 a6989586621680379997
type Apply (Elem_6989586621680823091Sym1 a6989586621680823100 :: TyFun [a] Bool -> Type) (a6989586621680823101 :: [a])
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823091Sym1 a6989586621680823100 :: TyFun [a] Bool -> Type) (a6989586621680823101 :: [a]) = Elem_6989586621680823091Sym2 a6989586621680823100 a6989586621680823101
type Apply (Elem_6989586621681012518Sym1 a6989586621681012523 :: TyFun (Identity a) Bool -> Type) (a6989586621681012524 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621681012518Sym1 a6989586621681012523 :: TyFun (Identity a) Bool -> Type) (a6989586621681012524 :: Identity a) = Elem_6989586621681012518Sym2 a6989586621681012523 a6989586621681012524
type Apply (Elem_6989586621680823499Sym1 a6989586621680823508 :: TyFun (Dual a) Bool -> Type) (a6989586621680823509 :: Dual a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823499Sym1 a6989586621680823508 :: TyFun (Dual a) Bool -> Type) (a6989586621680823509 :: Dual a) = Elem_6989586621680823499Sym2 a6989586621680823508 a6989586621680823509
type Apply (Elem_6989586621680823674Sym1 a6989586621680823683 :: TyFun (Sum a) Bool -> Type) (a6989586621680823684 :: Sum a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823674Sym1 a6989586621680823683 :: TyFun (Sum a) Bool -> Type) (a6989586621680823684 :: Sum a) = Elem_6989586621680823674Sym2 a6989586621680823683 a6989586621680823684
type Apply (Elem_6989586621680823849Sym1 a6989586621680823858 :: TyFun (Product a) Bool -> Type) (a6989586621680823859 :: Product a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823849Sym1 a6989586621680823858 :: TyFun (Product a) Bool -> Type) (a6989586621680823859 :: Product a) = Elem_6989586621680823849Sym2 a6989586621680823858 a6989586621680823859
type Apply (Elem_bySym2 a6989586621680379209 a6989586621680379210 :: TyFun [a] Bool -> Type) (a6989586621680379211 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym2 a6989586621680379209 a6989586621680379210 :: TyFun [a] Bool -> Type) (a6989586621680379211 :: [a]) = Elem_bySym3 a6989586621680379209 a6989586621680379210 a6989586621680379211
type Apply (Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type) (a6989586621680822991 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type) (a6989586621680822991 :: t a) = Elem_6989586621680822981Sym2 a6989586621680822990 a6989586621680822991
type Apply (Null_6989586621680822945Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680822951 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680822945Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680822951 :: t a) = Null_6989586621680822945Sym1 a6989586621680822951
type Apply (AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type) (a6989586621680822587 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type) (a6989586621680822587 :: t a) = AnySym2 a6989586621680822586 a6989586621680822587
type Apply (ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type) (a6989586621680822782 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type) (a6989586621680822782 :: t a) = ElemSym2 a6989586621680822781 a6989586621680822782
type Apply (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type) (a6989586621680822529 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type) (a6989586621680822529 :: t a) = NotElemSym2 a6989586621680822528 a6989586621680822529
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680822774 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680822774 :: t a) = NullSym1 a6989586621680822774
type Apply (AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type) (a6989586621680822578 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type) (a6989586621680822578 :: t a) = AllSym2 a6989586621680822577 a6989586621680822578
type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680749475 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680749475 :: [a]) = ListisPrefixOfSym1 a6989586621680749475
type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680380003 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680380003 :: [a]) = IsPrefixOfSym1 a6989586621680380003
type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379989 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379989 :: [a]) = IsInfixOfSym1 a6989586621680379989
type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379996 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379996 :: [a]) = IsSuffixOfSym1 a6989586621680379996
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680379521 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680379521 :: [a]) = Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379229 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379229 :: [k1]) = Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680379245 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680379245 :: [k1]) = Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type
type Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680823392 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680823392 :: Either a1 a2) = Null_6989586621680823386Sym1 a6989586621680823392
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b) = IsRightSym1 a6989586621680804000
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b) = IsLeftSym1 a6989586621680804003
type Apply (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823473 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823473 :: Proxy a) = Elem_6989586621680823467Sym2 a6989586621680823472 a6989586621680823473
type Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823464 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823464 :: Proxy a) = Null_6989586621680823460Sym1 a6989586621680823464
type Apply (TFHelper_6989586621681203563Sym1 a6989586621681203568 :: TyFun (Arg a b) Bool -> Type) (a6989586621681203569 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681203563Sym1 a6989586621681203568 :: TyFun (Arg a b) Bool -> Type) (a6989586621681203569 :: Arg a b) = TFHelper_6989586621681203563Sym2 a6989586621681203568 a6989586621681203569
type Apply (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) (a6989586621680787180 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) (a6989586621680787180 :: Proxy s) = TFHelper_6989586621680787174Sym2 a6989586621680787179 a6989586621680787180
type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680749437 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680749437 :: a ~> (a ~> Bool)) = ListnubBySym1 a6989586621680749437
type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749497 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749497 :: a ~> Bool) = ListpartitionSym1 a6989586621680749497
type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749508 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749508 :: a ~> Bool) = ListfilterSym1 a6989586621680749508
type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749519 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749519 :: a ~> Bool) = ListspanSym1 a6989586621680749519
type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749530 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749530 :: a ~> Bool) = ListdropWhileSym1 a6989586621680749530
type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749541 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749541 :: a ~> Bool) = ListtakeWhileSym1 a6989586621680749541
type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621680379209 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621680379209 :: a ~> (a ~> Bool)) = Elem_bySym1 a6989586621680379209
type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680379219 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680379219 :: a ~> (a ~> Bool)) = NubBySym1 a6989586621680379219
type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621680379315 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621680379315 :: a ~> Bool) = SelectSym1 a6989586621680379315
type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379330 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379330 :: a ~> Bool) = PartitionSym1 a6989586621680379330
type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379442 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379442 :: a ~> Bool) = BreakSym1 a6989586621680379442
type Apply (Let6989586621680379455YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379455YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) = Let6989586621680379455YsSym1 p6989586621680379446
type Apply (Let6989586621680379455ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379455ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) = Let6989586621680379455ZsSym1 p6989586621680379446
type Apply (Let6989586621680379455X_6989586621680379456Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379455X_6989586621680379456Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) = Let6989586621680379455X_6989586621680379456Sym1 p6989586621680379446
type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379477 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379477 :: a ~> Bool) = SpanSym1 a6989586621680379477
type Apply (Let6989586621680379490YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379490YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) = Let6989586621680379490YsSym1 p6989586621680379481
type Apply (Let6989586621680379490ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379490ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) = Let6989586621680379490ZsSym1 p6989586621680379481
type Apply (Let6989586621680379490X_6989586621680379491Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379490X_6989586621680379491Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) = Let6989586621680379490X_6989586621680379491Sym1 p6989586621680379481
type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621680379352 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621680379352 :: a ~> (a ~> Bool)) = GroupBySym1 a6989586621680379352
type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379531 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379531 :: a ~> Bool) = DropWhileSym1 a6989586621680379531
type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379546 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379546 :: a ~> Bool) = TakeWhileSym1 a6989586621680379546
type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379646 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379646 :: a ~> Bool) = FilterSym1 a6989586621680379646
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool) = FindSym1 a6989586621680379639
type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621680379745 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621680379745 :: a ~> (a ~> Bool)) = DeleteBySym1 a6989586621680379745
type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379735 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379735 :: a ~> (a ~> Bool)) = DeleteFirstsBySym1 a6989586621680379735
type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379199 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379199 :: a ~> (a ~> Bool)) = UnionBySym1 a6989586621680379199
type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) (a6989586621680379589 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) (a6989586621680379589 :: a ~> Bool) = FindIndicesSym1 a6989586621680379589
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool) = FindIndexSym1 a6989586621680379612
type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380198 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380198 :: a ~> Bool) = AnySym1 a6989586621680380198
type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379560 :: a ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379560 :: a ~> (a ~> Bool)) = IntersectBySym1 a6989586621680379560
type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380206 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380206 :: a ~> Bool) = AllSym1 a6989586621680380206
type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379514 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379514 :: a ~> Bool) = DropWhileEndSym1 a6989586621680379514
type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679990238 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679990238 :: a ~> Bool) = UntilSym1 a6989586621679990238
type Apply (TFHelper_6989586621681203563Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621681203568 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681203563Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621681203568 :: Arg a b) = TFHelper_6989586621681203563Sym1 a6989586621681203568
type Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680787179 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680787179 :: Proxy s) = TFHelper_6989586621680787174Sym1 a6989586621680787179
type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621681501213 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621681501213 :: a ~> Bool) = MfilterSym1 a6989586621681501213 :: TyFun (m a) (m a) -> Type
type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621681501375 :: a ~> m Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621681501375 :: a ~> m Bool) = FilterMSym1 a6989586621681501375
type Apply (Let6989586621680379223NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379223NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool)) = Let6989586621680379223NubBy'Sym1 eq6989586621680379221 :: TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type
type Apply (Let6989586621680379357YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379357YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) = Let6989586621680379357YsSym1 eq6989586621680379354
type Apply (Let6989586621680379357ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379357ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) = Let6989586621680379357ZsSym1 eq6989586621680379354
type Apply (Let6989586621680379357X_6989586621680379358Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379357X_6989586621680379358Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) = Let6989586621680379357X_6989586621680379358Sym1 eq6989586621680379354
type Apply (Lambda_6989586621680379518Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621680379516 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680379518Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621680379516 :: a ~> Bool) = Lambda_6989586621680379518Sym1 p6989586621680379516 :: TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680822514Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680822512 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822514Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680822512 :: a ~> Bool) = Lambda_6989586621680822514Sym1 p6989586621680822512 :: TyFun k (TyFun a (First a) -> Type) -> Type
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822586 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822586 :: a ~> Bool) = AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822577 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822577 :: a ~> Bool) = AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool) = FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type
type Apply (Let6989586621679990244GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679990241 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (Let6989586621679990244GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679990241 :: k1 ~> Bool) = Let6989586621679990244GoSym1 p6989586621679990241 :: TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type
type Apply (Lambda_6989586621681501217Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621681501215 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501217Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621681501215 :: k1 ~> Bool) = Lambda_6989586621681501217Sym1 p6989586621681501215 :: TyFun k (TyFun k1 (m k1) -> Type) -> Type
type Apply (Lambda_6989586621681501379Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2 ~> f Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501379Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2 ~> f Bool) = Lambda_6989586621681501379Sym1 p6989586621681501377 :: TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type
type Apply (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680379563 :: b ~> (a ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680379563 :: b ~> (a ~> Bool)) = Lambda_6989586621680379571Sym1 eq6989586621680379563 :: TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680379516 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680379516 :: k1 ~> Bool) = Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool)) = Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: 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

IsList ByteString	Since: bytestring-0.10.12.0
Instance details Defined in Data.ByteString.Internal Associated Types type Item ByteString # Methods fromList :: [Item ByteString] -> ByteString # fromListN :: Int -> [Item ByteString] -> ByteString # toList :: ByteString -> [Item ByteString] #
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	Beware: `fromString` truncates multi-byte characters to octets. e.g. "枯朶に烏のとまりけり秋の暮" becomes �6k�nh~�Q��n�
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) #
VisualStream ByteString
Instance details Defined in Text.Megaparsec.Stream Methods showTokens :: Proxy ByteString -> NonEmpty (Token ByteString) -> String # tokensLength :: Proxy ByteString -> NonEmpty (Token ByteString) -> Int #
TraversableStream ByteString
Instance details Defined in Text.Megaparsec.Stream Methods reachOffset :: Int -> PosState ByteString -> (Maybe 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 # foldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # fold :: ByteString -> Element ByteString # foldr' :: (Element ByteString -> b -> b) -> b -> ByteString -> b # notElem :: Element ByteString -> ByteString -> Bool # all :: (Element ByteString -> Bool) -> ByteString -> Bool # any :: (Element ByteString -> Bool) -> ByteString -> Bool # and :: ByteString -> Bool # or :: ByteString -> Bool # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # safeHead :: ByteString -> Maybe (Element ByteString) # safeMaximum :: ByteString -> Maybe (Element ByteString) # safeMinimum :: ByteString -> Maybe (Element ByteString) # safeFoldr1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Maybe (Element ByteString) # safeFoldl1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Maybe (Element ByteString) #
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 Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions ByteString :: FieldDescriptions # Methods typeDocName :: Proxy ByteString -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ByteString -> WithinParens -> Markdown # typeDocDependencies :: Proxy ByteString -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep ByteString # typeDocMichelsonRep :: TypeDocMichelsonRep ByteString #
IsoValue ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
HasAnnotation ByteString Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT ByteString) Source # annOptions :: AnnOptions 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
BytesLike ByteString Source #
Instance details Defined in Lorentz.Bytes Methods toBytes :: ByteString -> ByteString Source #
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) #
CanCastTo (TSignature a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TSignature a) -> Proxy ByteString -> () Source #
CanCastTo (Packed a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Packed a) -> Proxy ByteString -> () Source #
CanCastTo (Hash alg a :: Type) ByteString Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Hash alg a) -> Proxy ByteString -> () Source #
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 Item ByteString
Instance details Defined in Data.ByteString.Internal type Item ByteString = Word8
type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int
type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8
type 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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions ByteString = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT ByteString
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT ByteString = 'TBytes

data Address #

Instances

Instances details

Eq Address
Instance details Defined in Morley.Tezos.Address Methods (==) :: Address -> Address -> Bool # (/=) :: Address -> Address -> Bool #
Ord Address
Instance details Defined in Morley.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 Morley.Tezos.Address Methods showsPrec :: Int -> Address -> ShowS # show :: Address -> String # showList :: [Address] -> ShowS #
(TypeError ('Text "There is no instance defined for (IsString Address)" :$$: 'Text "Consider using QuasiQuotes: `[ta\|some text...\|]`") :: Constraint) => IsString Address
Instance details Defined in Morley.Tezos.Address Methods fromString :: String -> Address #
Generic Address
Instance details Defined in Morley.Tezos.Address Associated Types type Rep Address :: Type -> Type # Methods from :: Address -> Rep Address x # to :: Rep Address x -> Address #
ToJSON Address
Instance details Defined in Morley.Tezos.Address Methods toJSON :: Address -> Value # toEncoding :: Address -> Encoding # toJSONList :: [Address] -> Value # toEncodingList :: [Address] -> Encoding #
ToJSONKey Address
Instance details Defined in Morley.Tezos.Address Methods toJSONKey :: ToJSONKeyFunction Address # toJSONKeyList :: ToJSONKeyFunction [Address] #
FromJSON Address
Instance details Defined in Morley.Tezos.Address Methods parseJSON :: Value -> Parser Address # parseJSONList :: Value -> Parser [Address] #
FromJSONKey Address
Instance details Defined in Morley.Tezos.Address Methods fromJSONKey :: FromJSONKeyFunction Address # fromJSONKeyList :: FromJSONKeyFunction [Address] #
NFData Address
Instance details Defined in Morley.Tezos.Address Methods rnf :: Address -> () #
Buildable Address
Instance details Defined in Morley.Tezos.Address Methods build :: Address -> Builder #
HasCLReader Address
Instance details Defined in Morley.Tezos.Address Methods getReader :: ReadM Address getMetavar :: String
TypeHasDoc Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions Address :: FieldDescriptions # Methods typeDocName :: Proxy Address -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Address -> WithinParens -> Markdown # typeDocDependencies :: Proxy Address -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Address # typeDocMichelsonRep :: TypeDocMichelsonRep Address #
IsoValue Address
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
HasAnnotation Address Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT Address) Source # annOptions :: AnnOptions Source #
ToAddress Address Source #
Instance details Defined in Lorentz.Address Methods toAddress :: Address -> Address Source #
Lift Address
Instance details Defined in Morley.Tezos.Address Methods lift :: Address -> Q Exp # liftTyped :: Address -> Q (TExp Address) #
FromContractRef cp Address Source #
Instance details Defined in Lorentz.Address Methods fromContractRef :: ContractRef cp -> Address Source #
ToTAddress cp vd Address Source #
Instance details Defined in Lorentz.Address Methods toTAddress :: Address -> TAddress cp vd Source #
CanCastTo Address (TAddress p vd :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy Address -> Proxy (TAddress p vd) -> () Source #
CanCastTo (TAddress p vd :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (TAddress p vd) -> Proxy Address -> () Source #
type Rep Address
Instance details Defined in Morley.Tezos.Address type Rep Address = D1 ('MetaData "Address" "Morley.Tezos.Address" "morley-1.16.2-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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Address = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT Address
Instance details Defined in Morley.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 Morley.Michelson.Typed.Entrypoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Ord EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods compare :: EpAddress -> EpAddress -> Ordering # (<) :: EpAddress -> EpAddress -> Bool # (<=) :: EpAddress -> EpAddress -> Bool # (>) :: EpAddress -> EpAddress -> Bool # (>=) :: EpAddress -> EpAddress -> Bool # max :: EpAddress -> EpAddress -> EpAddress # min :: EpAddress -> EpAddress -> EpAddress #
Show EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
Generic EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep EpAddress :: Type -> Type # Methods from :: EpAddress -> Rep EpAddress x # to :: Rep EpAddress x -> EpAddress #
NFData EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods rnf :: EpAddress -> () #
Buildable EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods build :: EpAddress -> Builder #
TypeHasDoc EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions EpAddress :: FieldDescriptions # Methods typeDocName :: Proxy EpAddress -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy EpAddress -> WithinParens -> Markdown # typeDocDependencies :: Proxy EpAddress -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep EpAddress # typeDocMichelsonRep :: TypeDocMichelsonRep EpAddress #
IsoValue EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
HasAnnotation EpAddress Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT EpAddress) Source # annOptions :: AnnOptions 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 Morley.Michelson.Typed.Entrypoints type Rep EpAddress = D1 ('MetaData "EpAddress" "Morley.Michelson.Typed.Entrypoints" "morley-1.16.2-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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions EpAddress = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT EpAddress
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT EpAddress = 'TAddress

data Mutez #

Instances

Instances details

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

data Never Source #

Instances

Instances details

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

data Timestamp #

Instances

Instances details

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

data ChainId #

Instances

Instances details

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

data KeyHash #

Instances

Instances details

Eq KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: KeyHash -> KeyHash -> Bool # (/=) :: KeyHash -> KeyHash -> Bool #
Ord KeyHash
Instance details Defined in Morley.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 Morley.Tezos.Crypto Methods showsPrec :: Int -> KeyHash -> ShowS # show :: KeyHash -> String # showList :: [KeyHash] -> ShowS #
Generic KeyHash
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep KeyHash :: Type -> Type # Methods from :: KeyHash -> Rep KeyHash x # to :: Rep KeyHash x -> KeyHash #
ToJSON KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods toJSON :: KeyHash -> Value # toEncoding :: KeyHash -> Encoding # toJSONList :: [KeyHash] -> Value # toEncodingList :: [KeyHash] -> Encoding #
ToJSONKey KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods toJSONKey :: ToJSONKeyFunction KeyHash # toJSONKeyList :: ToJSONKeyFunction [KeyHash] #
FromJSON KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods parseJSON :: Value -> Parser KeyHash # parseJSONList :: Value -> Parser [KeyHash] #
FromJSONKey KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods fromJSONKey :: FromJSONKeyFunction KeyHash # fromJSONKeyList :: FromJSONKeyFunction [KeyHash] #
NFData KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods rnf :: KeyHash -> () #
Buildable KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods build :: KeyHash -> Builder #
HasCLReader KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods getReader :: ReadM KeyHash getMetavar :: String
TypeHasDoc KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions KeyHash :: FieldDescriptions # Methods typeDocName :: Proxy KeyHash -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy KeyHash -> WithinParens -> Markdown # typeDocDependencies :: Proxy KeyHash -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep KeyHash # typeDocMichelsonRep :: TypeDocMichelsonRep KeyHash #
IsoValue KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
HasAnnotation KeyHash Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT KeyHash) Source # annOptions :: AnnOptions Source #
Lift KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods lift :: KeyHash -> Q Exp # liftTyped :: KeyHash -> Q (TExp KeyHash) #
type Rep KeyHash
Instance details Defined in Morley.Tezos.Crypto type Rep KeyHash = D1 ('MetaData "KeyHash" "Morley.Tezos.Crypto" "morley-1.16.2-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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions KeyHash = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT KeyHash
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT KeyHash = 'TKeyHash

data PublicKey #

Instances

Instances details

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

data Signature #

Instances

Instances details

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

data Bls12381Fr #

Instances

Instances details

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

data Bls12381G1 #

Instances

Instances details

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

data Bls12381G2 #

Instances

Instances details

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

data 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 #
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 a, Monoid a) => Semiring (Set a)	The multiplication laws are satisfied for any underlying `Monoid`, so we require a `Monoid` constraint instead of a `Semiring` constraint since `times` can use the context of either.
Instance details Defined in Data.Semiring Methods plus :: Set a -> Set a -> Set a # zero :: Set a # times :: Set a -> Set a -> Set a # one :: Set a # fromNatural :: Natural -> Set a #
Ord v => Container (Set v)
Instance details Defined in Universum.Container.Class Associated Types type Element (Set v) # Methods toList :: Set v -> [Element (Set v)] # null :: Set v -> Bool # foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b # foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b # length :: Set v -> Int # elem :: Element (Set v) -> Set v -> Bool # foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m # fold :: Set v -> Element (Set v) # foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b # notElem :: Element (Set v) -> Set v -> Bool # all :: (Element (Set v) -> Bool) -> Set v -> Bool # any :: (Element (Set v) -> Bool) -> Set v -> Bool # and :: Set v -> Bool # or :: Set v -> Bool # find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v)) # safeHead :: Set v -> Maybe (Element (Set v)) # safeMaximum :: Set v -> Maybe (Element (Set v)) # safeMinimum :: Set v -> Maybe (Element (Set v)) # safeFoldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # safeFoldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) #
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 Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Set a) :: FieldDescriptions # Methods typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Set a) #
(Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
KnownIsoT v => HasAnnotation (Set v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) Source # annOptions :: AnnOptions 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 #
LDefault (Set k) Source #
Instance details Defined in Lorentz.Default Methods ldef :: Set k Source # lIsDef :: forall (s :: [Type]). (Set k ': s) :-> (Bool ': s) Source #
(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 #
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source #
type Item (Set a)
Instance details Defined in Data.Set.Internal type Item (Set a) = a
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type Unwrapped (Set a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Set a) = [a]
type 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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Set c)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Set c) = 'TSet (ToT c)
type 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

Bifoldable Map	Since: containers-0.6.3.1
Instance details Defined in Data.Map.Internal Methods bifold :: Monoid m => Map m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Map a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Map a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Map a b -> c #
Eq2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Map a c -> Map b d -> Bool #
Ord2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Map a c -> Map b d -> Ordering #
Show2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS #
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) #
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 #
(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)) #
(Ord k, Monoid k, Semiring v) => Semiring (Map k v)	The multiplication laws are satisfied for any underlying `Monoid` as the key type, so we require a `Monoid` constraint instead of a `Semiring` constraint since `times` can use the context of either.
Instance details Defined in Data.Semiring Methods plus :: Map k v -> Map k v -> Map k v # zero :: Map k v # times :: Map k v -> Map k v -> Map k v # one :: Map k v # fromNatural :: Natural -> Map k v #
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 # foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # fold :: Map k v -> Element (Map k v) # foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # notElem :: Element (Map k v) -> Map k v -> Bool # all :: (Element (Map k v) -> Bool) -> Map k v -> Bool # any :: (Element (Map k v) -> Bool) -> Map k v -> Bool # and :: Map k v -> Bool # or :: Map k v -> Bool # find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v)) # safeHead :: Map k v -> Maybe (Element (Map k v)) # safeMaximum :: Map k v -> Maybe (Element (Map k v)) # safeMinimum :: Map k v -> Maybe (Element (Map k v)) # safeFoldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # safeFoldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) #
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 Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Map k v) :: FieldDescriptions # Methods typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) #
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
ToBigMap (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToBigMapKey (Map k v) type ToBigMapValue (Map k v) Methods mkBigMap :: Map k v -> BigMap (ToBigMapKey (Map k v)) (ToBigMapValue (Map k v)) #
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) Source # annOptions :: AnnOptions 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 #
LDefault (Map k v) Source #
Instance details Defined in Lorentz.Default Methods ldef :: Map k v Source # lIsDef :: forall (s :: [Type]). (Map k v ': s) :-> (Bool ': s) Source #
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source #
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source #
type Item (Map k v)
Instance details Defined in Data.Map.Internal type Item (Map k v) = (k, v)
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type Unwrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Map k a) = [(k, a)]
type 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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Map k v) = 'TMap (ToT k) (ToT v)
type ToBigMapKey (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapKey (Map k v) = k
type ToBigMapValue (Map k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapValue (Map k v) = v
type 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 BigMapId (k2 :: k) (v :: k1) #

Constructors

BigMapId
Fields unBigMapId :: Natural

Instances

Instances details

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

data BigMap k v #

Instances

Instances details

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

mkBigMap :: ToBigMap m => m -> BigMap (ToBigMapKey m) (ToBigMapValue m) #

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) #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe 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] #
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 arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Maybe
Instance details Defined in Data.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 (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) #
PFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) #
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 arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a #
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 Morley.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
Lift a => Lift (Maybe a :: Type)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Maybe a -> Q Exp # liftTyped :: Maybe a -> Q (TExp (Maybe a)) #
() :=> (Functor Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Functor Maybe #
() :=> (Applicative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative Maybe #
() :=> (MonadPlus Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- MonadPlus Maybe #
() :=> (Alternative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Alternative 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 #
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 #
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))) #
Semiring a => Semiring (Maybe a)
Instance details Defined in Data.Semiring Methods plus :: Maybe a -> Maybe a -> Maybe a # zero :: Maybe a # times :: Maybe a -> Maybe a -> Maybe a # one :: Maybe a # fromNatural :: Natural -> Maybe a #
PMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
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 arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg 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 arg <> arg1 :: a # type Sconcat arg :: a #
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 arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Maybe a)
Instance details Defined in Data.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 # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # and :: Maybe a -> Bool # or :: Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) # safeMaximum :: Maybe a -> Maybe (Element (Maybe a)) # safeMinimum :: Maybe a -> Maybe (Element (Maybe a)) # safeFoldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # safeFoldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) #
Pretty a => Pretty (Maybe a)
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Maybe a -> Doc # prettyList :: [Maybe a] -> Doc #
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)
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
HasAnnotation a => HasAnnotation (Maybe a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # annOptions :: AnnOptions 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 #
PMonadFail Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Associated Types type Fail arg :: m a #
PAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Empty :: f a # type arg <\|> arg1 :: f a #
PMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Mzero :: m a # type Mplus arg arg1 :: m 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 #
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) #
SingI ('Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'Nothing
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 (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable 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 (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinInternalSym0 #
SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaxInternalSym0 #
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 (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetOptionSym0 #
SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetFirstSym0 #
SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetLastSym0 #
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 #
SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing GetMaxInternalSym0 #
SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing GetMinInternalSym0 #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SuppressUnusedWarnings (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym0 :: 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_6989586621680701013Sym0 :: 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_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym0 :: 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 (Let6989586621680822904MfSym0 :: 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 :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d) #
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d) #
SuppressUnusedWarnings (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701013Sym1 a6989586621680701011 :: 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_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: 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 Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # annOptions :: AnnOptions Source #
Wrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable
Unwrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) Source #
type Failure Maybe
Instance details Defined in Basement.Monad type Failure Maybe = ()
type Product (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Maybe a) = Apply (Product_6989586621680823034Sym0 :: TyFun (Maybe a) a -> Type) arg
type Sum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Maybe a) = Apply (Sum_6989586621680823025Sym0 :: TyFun (Maybe a) a -> Type) arg
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Maybe a) = Apply (Minimum_6989586621680823010Sym0 :: TyFun (Maybe a) a -> Type) arg
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Maybe a) = Apply (Maximum_6989586621680822995Sym0 :: TyFun (Maybe a) a -> Type) arg
type Length (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (arg :: Maybe a) = Apply (Length_6989586621680822962Sym0 :: TyFun (Maybe a) Nat -> Type) arg
type Null (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (arg :: Maybe a) = Apply (Null_6989586621680822945Sym0 :: TyFun (Maybe a) Bool -> Type) arg
type ToList (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Maybe a) = Apply (ToList_6989586621680822936Sym0 :: TyFun (Maybe a) [a] -> Type) arg
type Fold (arg :: Maybe m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Maybe m) = Apply (Fold_6989586621680822796Sym0 :: TyFun (Maybe m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621680072784Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621680012015Sym0 :: TyFun a (Maybe a) -> Type) arg
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Maybe (m a)) = Apply (Sequence_6989586621681082058Sym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) arg
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Maybe (f a)) = Apply (SequenceA_6989586621681082034Sym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) arg
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a) (arg2 :: Maybe a) = Apply (Apply (Elem_6989586621680822981Sym0 :: TyFun a (Maybe a ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldl1_6989586621680822916Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldr1_6989586621680822895Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) = Apply (Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a1 ~> k2) (Maybe a1 ~> k2) -> Type) a2) a3
type (a1 :: k1) <$ (a2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: k1) <$ (a2 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072673Sym0 :: TyFun k1 (Maybe b ~> Maybe k1) -> Type) a1) a2
type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) = Apply (Apply (Fmap_6989586621680072661Sym0 :: TyFun (a1 ~> b) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type (arg1 :: Maybe a) <* (arg2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Maybe a) <* (arg2 :: Maybe b) = Apply (Apply (TFHelper_6989586621680011970Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe a) -> Type) arg1) arg2
type (a2 :: Maybe a1) *> (a3 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) *> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a1 ~> b)) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) >> (a3 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) >> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) = Apply (Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a1) ((a1 ~> Maybe b) ~> Maybe b) -> Type) a2) a3
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) = Apply (Apply (MapM_6989586621681082044Sym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) arg1) arg2
type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) = Apply (Apply (Traverse_6989586621681088263Sym0 :: TyFun (a1 ~> f b) (Maybe a1 ~> f (Maybe b)) -> Type) a2) a3
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldl'_6989586621680822873Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldl_6989586621680823076Sym0 :: TyFun (k2 ~> (a1 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldr'_6989586621680822835Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldr_6989586621680823060Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) = Apply (Apply (Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a1 ~> (b ~> c)) (Maybe a1 ~> (Maybe b ~> Maybe c)) -> Type) a2) a3) a4
type Apply (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680072790 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680072790 :: a) = Pure_6989586621680072784Sym1 a6989586621680072790
type Apply (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800721496989586621680073050 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800721496989586621680073050 :: k1) = Let6989586621680073051LSym1 wild_69895866216800721496989586621680073050
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679750104 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679750104 :: a) = JustSym1 a6989586621679750104
type Apply (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814062 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814062 :: k1) = Let6989586621680814063NSym2 x6989586621680814061 y6989586621680814062
type Apply (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) (y6989586621680814062 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) (y6989586621680814062 :: k) = Let6989586621680814063MSym2 x6989586621680814061 y6989586621680814062
type Apply (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814086 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814086 :: k1) = Let6989586621680814087NSym2 x6989586621680814085 y6989586621680814086
type Apply (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) (y6989586621680814086 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) (y6989586621680814086 :: k) = Let6989586621680814087MSym2 x6989586621680814085 y6989586621680814086
type Apply (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) (a6989586621680823006 :: a6989586621680822175)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) (a6989586621680823006 :: a6989586621680822175) = Let6989586621680823003MkJustSym2 a_69895866216808229976989586621680823002 a6989586621680823006
type Apply (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) (a6989586621680823021 :: a6989586621680822176)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) (a6989586621680823021 :: a6989586621680822176) = Let6989586621680823018MkJustSym2 a_69895866216808230126989586621680823017 a6989586621680823021
type Apply (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701015 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701015 :: k1) = Lambda_6989586621680701013Sym3 a6989586621680701011 k6989586621680701012 x6989586621680701015
type Apply (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701094 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701094 :: k1) = Lambda_6989586621680701092Sym3 a6989586621680701090 k6989586621680701091 x6989586621680701094
type Apply (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680822927 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680822927 :: k3) = Let6989586621680822925MfSym4 f6989586621680822923 xs6989586621680822924 a6989586621680822926 a6989586621680822927
type Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653914 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653914 :: Nat) = ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type
type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a) = FromMaybeSym1 a6989586621679959410
type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a) = ElemIndexSym1 a6989586621680379630
type Apply (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621680072678 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621680072678 :: a) = TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type
type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679957844 :: b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679957844 :: b) = Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type
type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a) = LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type
type Apply (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k) = Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k1) = Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k) = Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k1) = Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k) = Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type
type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k) = Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type
type Apply (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823067 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823067 :: b) = Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067
type Apply (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823083 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823083 :: b) = Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083
type Apply (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701011 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701011 :: k) = Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701090 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701090 :: k) = Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680822903 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680822903 :: k) = Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903
type Apply (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680822924 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680822924 :: k) = Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924
type Apply (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680822905 :: k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680822905 :: k2) = Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905
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)))
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_6989586621680691392Sym0 :: 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 DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep 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 TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type 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 (arg :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Maybe a]) = Apply (Mconcat_6989586621680691345Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg
type Show_ (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Maybe a) = Apply (Show__6989586621680636746Sym0 :: TyFun (Maybe a) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Maybe a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621680240642Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg
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_6989586621680691331Sym0 :: 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_6989586621680636754Sym0 :: 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_6989586621680240791Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Empty
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Empty = Empty_6989586621680073037Sym0 :: Maybe a
type Mzero
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mzero = Mzero_6989586621680012035Sym0 :: Maybe a
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_6989586621679837487Sym0 :: 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_6989586621679837471Sym0 :: 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_6989586621679837455Sym0 :: 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_6989586621679837439Sym0 :: 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_6989586621679837423Sym0 :: 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_6989586621679837407Sym0 :: 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_6989586621679848468Sym0 :: 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_6989586621679820229 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_6989586621680653904Sym0 :: TyFun Nat (Maybe a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Fail a2
Instance details Defined in Data.Singletons.Prelude.Monad.Fail type Fail a2 = Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a1) -> Type) a2
type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mplus_6989586621680012040Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
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) (a6989586621679959420 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679959420 :: Maybe a) = FromJustSym1 a6989586621679959420
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) = IsNothingSym1 a6989586621679959424
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) = IsJustSym1 a6989586621679959427
type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a) = FromMaybeSym2 a6989586621679959410 a6989586621679959411
type Apply (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679848474 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679848474 :: Maybe a) = Compare_6989586621679848468Sym2 a6989586621679848473 a6989586621679848474
type Apply (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) (a6989586621680823054 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) (a6989586621680823054 :: Maybe a) = FoldMap_6989586621680823044Sym2 a6989586621680823053 a6989586621680823054
type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a) = Maybe_Sym3 a6989586621679957844 a6989586621679957845 a6989586621679957846
type Apply (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) (a6989586621680823068 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) (a6989586621680823068 :: Maybe a) = Foldr_6989586621680823060Sym3 a6989586621680823066 a6989586621680823067 a6989586621680823068
type Apply (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) (a6989586621680823084 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) (a6989586621680823084 :: Maybe a) = Foldl_6989586621680823076Sym3 a6989586621680823082 a6989586621680823083 a6989586621680823084
type ('Nothing :: Maybe a) <> (b :: Maybe a)
Instance details Defined in Fcf.Class.Monoid type ('Nothing :: Maybe a) <> (b :: Maybe a) = b
type Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621680156225 :: [Char])
Instance details Defined in Data.Singletons.Prelude.Monad.Fail type Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621680156225 :: [Char]) = Fail_6989586621680156221Sym1 a6989586621680156225 :: Maybe a
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a]) = CatMaybesSym1 a6989586621679959395
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a]) = ListToMaybeSym1 a6989586621679959401
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a) = MaybeToListSym1 a6989586621679959405
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680812483 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680812483 :: Maybe a) = MaxInternalSym1 a6989586621680812483
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680812486 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680812486 :: Maybe a) = MinInternalSym1 a6989586621680812486
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a) = OptionSym1 a6989586621680249994
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680694787 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680694787 :: Maybe a) = FirstSym1 a6989586621680694787
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680694814 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680694814 :: Maybe a) = LastSym1 a6989586621680694814
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a) = GetOptionSym1 a6989586621680249997
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a) = GetFirstSym1 a6989586621680694790
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a) = GetLastSym1 a6989586621680694817
type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680812493 :: MaxInternal a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680812493 :: MaxInternal a) = GetMaxInternalSym1 a6989586621680812493
type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680812489 :: MinInternal a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680812489 :: MinInternal a) = GetMinInternalSym1 a6989586621680812489
type Apply (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) (a6989586621680379640 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) (a6989586621680379640 :: [a]) = FindSym2 a6989586621680379639 a6989586621680379640
type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a]) = FindIndexSym2 a6989586621680379612 a6989586621680379613
type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a]) = ElemIndexSym2 a6989586621680379630 a6989586621680379631
type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a]) = StripPrefixSym2 a6989586621680498961 a6989586621680498962
type Apply (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680073048 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680073048 :: Maybe a) = TFHelper_6989586621680073042Sym2 a6989586621680073047 a6989586621680073048
type Apply (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680240797 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680240797 :: Maybe a) = TFHelper_6989586621680240791Sym2 a6989586621680240796 a6989586621680240797
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a) = OptionalSym1 a6989586621681492707
type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)]) = LookupSym2 a6989586621680379337 a6989586621680379338
type Apply (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072667 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072667 :: Maybe a) = Fmap_6989586621680072661Sym2 a6989586621680072666 a6989586621680072667
type Apply (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680072679 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680072679 :: Maybe b) = TFHelper_6989586621680072673Sym2 a6989586621680072678 a6989586621680072679
type Apply (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072800 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072800 :: Maybe a) = TFHelper_6989586621680072794Sym2 a6989586621680072799 a6989586621680072800
type Apply (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072827 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072827 :: Maybe b) = TFHelper_6989586621680072821Sym2 a6989586621680072826 a6989586621680072827
type Apply (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072976 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072976 :: Maybe b) = TFHelper_6989586621680072966Sym2 a6989586621680072975 a6989586621680072976
type Apply (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680822511 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680822511 :: t a) = FindSym2 a6989586621680822510 a6989586621680822511
type Apply (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681088269 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681088269 :: Maybe a) = Traverse_6989586621681088263Sym2 a6989586621681088268 a6989586621681088269
type Apply (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680072815 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680072815 :: Maybe b) = LiftA2_6989586621680072807Sym3 a6989586621680072813 a6989586621680072814 a6989586621680072815
type Apply (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680822906 :: Maybe k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680822906 :: Maybe k3) = Let6989586621680822904MfSym4 f6989586621680822902 xs6989586621680822903 a6989586621680822905 a6989586621680822906
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 [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a]) = StripPrefixSym1 a6989586621680498961
type Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680073047 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680073047 :: Maybe a) = TFHelper_6989586621680073042Sym1 a6989586621680073047
type Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679848473 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679848473 :: Maybe a) = Compare_6989586621679848468Sym1 a6989586621679848473
type Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680240796 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680240796 :: Maybe a) = TFHelper_6989586621680240791Sym1 a6989586621680240796
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_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680653915 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680653915 :: Maybe a) = ShowsPrec_6989586621680653904Sym2 a6989586621680653914 a6989586621680653915
type Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072826 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072826 :: Maybe a) = TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621680072960 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621680072960 :: Maybe a) = TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072975 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072975 :: Maybe a) = TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621680072799 :: Maybe (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621680072799 :: Maybe (a ~> b)) = TFHelper_6989586621680072794Sym1 a6989586621680072799
type Apply (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621680072814 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621680072814 :: Maybe a) = LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814
type Apply (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680822926 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680822926 :: Maybe k2) = Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926
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 Morley.Util.Fcf type Eval ('Just x <\|> _1 :: Maybe a -> Type) = 'Just x
type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type)
Instance details Defined in Morley.Util.Fcf type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type) = m
type Apply (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680072961 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680072961 :: a ~> Maybe b) = TFHelper_6989586621680072955Sym2 a6989586621680072960 a6989586621680072961
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool) = FindSym1 a6989586621680379639
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool) = FindIndexSym1 a6989586621680379612
type Apply (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621680072666 :: a ~> b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621680072666 :: a ~> b) = Fmap_6989586621680072661Sym1 a6989586621680072666
type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b) = MapMaybeSym1 a6989586621679959380
type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621680380029
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool) = FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type
type Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680823053 :: a ~> m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680823053 :: a ~> m) = FoldMap_6989586621680823044Sym1 a6989586621680823053
type Apply (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823066 :: a ~> (b ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823066 :: a ~> (b ~> b)) = Foldr_6989586621680823060Sym1 a6989586621680823066
type Apply (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823082 :: b ~> (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823082 :: b ~> (a ~> b)) = Foldl_6989586621680823076Sym1 a6989586621680823082
type Apply (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681088268 :: a ~> f b)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681088268 :: a ~> f b) = Traverse_6989586621681088263Sym1 a6989586621681088268
type Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621680072813 :: a ~> (b ~> c))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621680072813 :: a ~> (b ~> c)) = LiftA2_6989586621680072807Sym1 a6989586621680072813
type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b) = Maybe_Sym2 a6989586621679957844 a6989586621679957845
type Apply (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679959382 :: a ~> Maybe k1)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679959382 :: a ~> Maybe k1) = Let6989586621679959385RsSym1 f6989586621679959382 :: TyFun k (TyFun [a] [k1] -> Type) -> Type
type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2)) = Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type
type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3)) = Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701012 :: k1 ~> First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701012 :: k1 ~> First a) = Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012
type Apply (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701091 :: k1 ~> Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701091 :: k1 ~> Last a) = Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091
type ToT (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)
type Unwrappabled (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappabled (NamedF Maybe a name) = Maybe a

type List = [] Source #

data ReadTicket a Source #

Value returned by READ_TICKET instruction.

Constructors

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

Instances

Instances details

Eq a => Eq (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods (==) :: ReadTicket a -> ReadTicket a -> Bool # (/=) :: ReadTicket a -> ReadTicket a -> Bool #
Ord a => Ord (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods compare :: ReadTicket a -> ReadTicket a -> Ordering # (<) :: ReadTicket a -> ReadTicket a -> Bool # (<=) :: ReadTicket a -> ReadTicket a -> Bool # (>) :: ReadTicket a -> ReadTicket a -> Bool # (>=) :: ReadTicket a -> ReadTicket a -> Bool # max :: ReadTicket a -> ReadTicket a -> ReadTicket a # min :: ReadTicket a -> ReadTicket a -> ReadTicket a #
Show a => Show (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> ReadTicket a -> ShowS # show :: ReadTicket a -> String # showList :: [ReadTicket a] -> ShowS #
Generic (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type Rep (ReadTicket a) :: Type -> Type # Methods from :: ReadTicket a -> Rep (ReadTicket a) x # to :: Rep (ReadTicket a) x -> ReadTicket a #
IsoValue a => IsoValue (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (ReadTicket a) :: T # Methods toVal :: ReadTicket a -> Value (ToT (ReadTicket a)) # fromVal :: Value (ToT (ReadTicket a)) -> ReadTicket a #
type Rep (ReadTicket a) Source #
Instance details Defined in Lorentz.Value type Rep (ReadTicket a) = D1 ('MetaData "ReadTicket" "Lorentz.Value" "lorentz-0.13.2-inplace" 'False) (C1 ('MetaCons "ReadTicket" 'PrefixI 'True) (S1 ('MetaSel ('Just "rtTicketer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Address) :: (S1 ('MetaSel ('Just "rtData") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :: S1 ('MetaSel ('Just "rtAmount") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Natural))))
type ToT (ReadTicket a) Source #
Instance details Defined in Lorentz.Value type ToT (ReadTicket a) = GValueType (Rep (ReadTicket a))

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 Morley.Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
Show (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
IsoValue (ContractRef arg) => Buildable (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods build :: ContractRef arg -> Builder #
PolyTypeHasDocC '[cp] => TypeHasDoc (ContractRef cp)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (ContractRef cp) :: FieldDescriptions # Methods typeDocName :: Proxy (ContractRef cp) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ContractRef cp) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ContractRef cp) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (ContractRef cp) # typeDocMichelsonRep :: TypeDocMichelsonRep (ContractRef cp) #
(HasNoOpToT arg, WellTypedToT arg) => IsoValue (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
HasAnnotation a => HasAnnotation (ContractRef a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ContractRef a)) Source # annOptions :: AnnOptions 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 Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (ContractRef cp) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = 'TContract (ToT arg)

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

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

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

Constructors

TAddress
Fields unTAddress :: Address

Instances

Instances details

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

newtype FutureContract arg Source #

Address associated with value of contract arg type.

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

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

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

Constructors

FutureContract
Fields unFutureContract :: ContractRef arg

Instances

Instances details

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 #
TypeHasDoc p => TypeHasDoc (FutureContract p) Source #
Instance details Defined in Lorentz.Doc Associated Types type TypeDocFieldDescriptions (FutureContract p) :: FieldDescriptions # Methods typeDocName :: Proxy (FutureContract p) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (FutureContract p) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (FutureContract p) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (FutureContract p) # typeDocMichelsonRep :: TypeDocMichelsonRep (FutureContract p) #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Address Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
HasAnnotation (FutureContract a) Source #
Instance details Defined in Lorentz.Address Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (FutureContract a)) Source # annOptions :: AnnOptions 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 TypeDocFieldDescriptions (FutureContract p) Source #
Instance details Defined in Lorentz.Doc type TypeDocFieldDescriptions (FutureContract p) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (FutureContract arg) Source #
Instance details Defined in Lorentz.Address type ToT (FutureContract arg) = ToT EpAddress

data Ticket arg #

Constructors

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

Instances

Instances details

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

data Chest #

Instances

Instances details

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

data ChestKey #

Instances

Instances details

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

data OpenChest Source #

Instances

Instances details

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

data EpName #

Instances

Instances details

Eq EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Ord EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods compare :: EpName -> EpName -> Ordering # (<) :: EpName -> EpName -> Bool # (<=) :: EpName -> EpName -> Bool # (>) :: EpName -> EpName -> Bool # (>=) :: EpName -> EpName -> Bool # max :: EpName -> EpName -> EpName # min :: EpName -> EpName -> EpName #
Show EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
Generic EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpName :: Type -> Type # Methods from :: EpName -> Rep EpName x # to :: Rep EpName x -> EpName #
ToJSON EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods toJSON :: EpName -> Value # toEncoding :: EpName -> Encoding # toJSONList :: [EpName] -> Value # toEncodingList :: [EpName] -> Encoding #
FromJSON EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods parseJSON :: Value -> Parser EpName # parseJSONList :: Value -> Parser [EpName] #
NFData EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods rnf :: EpName -> () #
Buildable EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods build :: EpName -> Builder #
HasCLReader EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods getReader :: ReadM EpName getMetavar :: String
type Rep EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints type Rep EpName = D1 ('MetaData "EpName" "Morley.Michelson.Untyped.Entrypoints" "morley-1.16.2-inplace" 'True) (C1 ('MetaCons "UnsafeEpName" '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) #

Custom datatypes

newtype Fixed (a :: k) #

The type parameter should be an instance of HasResolution.

Constructors

MkFixed Integer

Instances

Instances details

r ~ Fixed p => ArithOpHs Add Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Integer (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Integer ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub Natural (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Natural ': (Fixed p ': s)) :-> (r ': s) Source #
UnaryArithOpHs Neg (Fixed p) Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg (Fixed p) Source # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Fixed p ': s) :-> (UnaryArithResHs Neg (Fixed p) ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Mul (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Natural ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) Integer r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Integer ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Add (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (NFixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (NFixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (Fixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ Fixed p => ArithOpHs Sub (NFixed p) (Fixed p) r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed p ': (Fixed p ': s)) :-> (r ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (BinBase a)) (NFixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (NFixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (BinBase a)) (Fixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Fixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (DecBase a)) (NFixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (NFixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (DecBase a)) (Fixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Fixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (BinBase a)) (Fixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Fixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (DecBase a)) (Fixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Fixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
NFData1 (Fixed :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Fixed a -> () #
Hashable1 (Fixed :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Fixed a -> Int #
Enum (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods succ :: Fixed a -> Fixed a # pred :: Fixed a -> Fixed a # toEnum :: Int -> Fixed a # fromEnum :: Fixed a -> Int # enumFrom :: Fixed a -> [Fixed a] # enumFromThen :: Fixed a -> Fixed a -> [Fixed a] # enumFromTo :: Fixed a -> Fixed a -> [Fixed a] # enumFromThenTo :: Fixed a -> Fixed a -> Fixed a -> [Fixed a] #
Eq (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (==) :: Fixed a -> Fixed a -> Bool # (/=) :: Fixed a -> Fixed a -> Bool #
HasResolution a => Fractional (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (/) :: Fixed a -> Fixed a -> Fixed a # recip :: Fixed a -> Fixed a # fromRational :: Rational -> Fixed a #
(Typeable k, Typeable a) => Data (Fixed a)	Since: base-4.1.0.0
Instance details Defined in Data.Fixed Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixed a -> c (Fixed a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Fixed a) # toConstr :: Fixed a -> Constr # dataTypeOf :: Fixed a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Fixed a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Fixed a)) # gmapT :: (forall b. Data b => b -> b) -> Fixed a -> Fixed a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixed a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixed a -> r # gmapQ :: (forall d. Data d => d -> u) -> Fixed a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixed a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixed a -> m (Fixed a) #
HasResolution a => Num (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods (+) :: Fixed a -> Fixed a -> Fixed a # (-) :: Fixed a -> Fixed a -> Fixed a # (*) :: Fixed a -> Fixed a -> Fixed a # negate :: Fixed a -> Fixed a # abs :: Fixed a -> Fixed a # signum :: Fixed a -> Fixed a # fromInteger :: Integer -> Fixed a #
Ord (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods compare :: Fixed a -> Fixed a -> Ordering # (<) :: Fixed a -> Fixed a -> Bool # (<=) :: Fixed a -> Fixed a -> Bool # (>) :: Fixed a -> Fixed a -> Bool # (>=) :: Fixed a -> Fixed a -> Bool # max :: Fixed a -> Fixed a -> Fixed a # min :: Fixed a -> Fixed a -> Fixed a #
HasResolution a => Read (Fixed a)	Since: base-4.3.0.0
Instance details Defined in Data.Fixed Methods readsPrec :: Int -> ReadS (Fixed a) # readList :: ReadS [Fixed a] # readPrec :: ReadPrec (Fixed a) # readListPrec :: ReadPrec [Fixed a] #
HasResolution a => Real (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods toRational :: Fixed a -> Rational #
HasResolution a => RealFrac (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods properFraction :: Integral b => Fixed a -> (b, Fixed a) # truncate :: Integral b => Fixed a -> b # round :: Integral b => Fixed a -> b # ceiling :: Integral b => Fixed a -> b # floor :: Integral b => Fixed a -> b #
HasResolution a => Show (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods showsPrec :: Int -> Fixed a -> ShowS # show :: Fixed a -> String # showList :: [Fixed a] -> ShowS #
Hashable (Fixed a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Fixed a -> Int # hash :: Fixed a -> Int #
HasResolution a => ToJSON (Fixed a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Fixed a -> Value # toEncoding :: Fixed a -> Encoding # toJSONList :: [Fixed a] -> Value # toEncodingList :: [Fixed a] -> Encoding #
HasResolution a => ToJSONKey (Fixed a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction (Fixed a) # toJSONKeyList :: ToJSONKeyFunction [Fixed a] #
NFData (Fixed a)	Since: deepseq-1.3.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Fixed a -> () #
HasResolution a => Buildable (Fixed a)
Instance details Defined in Formatting.Buildable Methods build :: Fixed a -> Builder #
HasResolution a => Semiring (Fixed a)
Instance details Defined in Data.Semiring Methods plus :: Fixed a -> Fixed a -> Fixed a # zero :: Fixed a # times :: Fixed a -> Fixed a -> Fixed a # one :: Fixed a # fromNatural :: Natural -> Fixed a #
HasResolution a => Ring (Fixed a)
Instance details Defined in Data.Semiring Methods negate :: Fixed a -> Fixed a #
IsoValue (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Fixed p) :: T # Methods toVal :: Fixed p -> Value (ToT (Fixed p)) # fromVal :: Value (ToT (Fixed p)) -> Fixed p #
Unwrappable (Fixed a) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (Fixed a) Source #
KnownNat a => LorentzFixedCast (Fixed (BinBase a)) Source #
Instance details Defined in Lorentz.FixedArith Methods fromFixed :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Integer ': s) Source # toFixed :: forall (s :: [Type]). (Integer ': s) :-> (Fixed (BinBase a) ': s) Source #
KnownNat a => LorentzFixedCast (Fixed (DecBase a)) Source #
Instance details Defined in Lorentz.FixedArith Methods fromFixed :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Integer ': s) Source # toFixed :: forall (s :: [Type]). (Integer ': s) :-> (Fixed (DecBase a) ': s) Source #
(KnownNat a, KnownNat b) => LorentzRounding (Fixed (BinBase a)) (Fixed (BinBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source #
(KnownNat a, KnownNat b) => LorentzRounding (Fixed (DecBase a)) (Fixed (DecBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source #
type UnaryArithResHs Neg (Fixed p) Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg (Fixed p) = Fixed p
type ToT (Fixed p)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Fixed p) = 'TInt
type Unwrappabled (Fixed a) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappabled (Fixed a) = Integer

newtype NFixed p Source #

Like Fixed but with a Natural value inside constructor

Constructors

MkNFixed Natural

Instances

Instances details

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

data DecBase p where Source #

Datatypes, representing base of the fixed-point values

Constructors

DecBase :: KnownNat p => DecBase p

Instances

Instances details

(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (DecBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (DecBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (DecBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (DecBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Integer ': s)) :-> (r ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (DecBase a)) (NFixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (NFixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (DecBase a)) (Fixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (DecBase a) ': (Fixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (DecBase a)) (Fixed (DecBase b)) (Fixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (Fixed (DecBase b) ': s)) :-> (Fixed (DecBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (DecBase a)) (NFixed (DecBase b)) (NFixed (DecBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (DecBase a) ': (NFixed (DecBase b) ': s)) :-> (NFixed (DecBase r) ': s) Source #
KnownNat p => HasResolution (DecBase p :: Type) Source #
Instance details Defined in Lorentz.Value Methods resolution :: p0 (DecBase p) -> Integer #
KnownNat a => LorentzFixedCast (Fixed (DecBase a)) Source #
Instance details Defined in Lorentz.FixedArith Methods fromFixed :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Integer ': s) Source # toFixed :: forall (s :: [Type]). (Integer ': s) :-> (Fixed (DecBase a) ': s) Source #
(KnownNat a, KnownNat b) => LorentzRounding (Fixed (DecBase a)) (Fixed (DecBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (DecBase a) ': s) :-> (Fixed (DecBase b) ': s) Source #
LorentzRounding (Fixed (DecBase a)) (Fixed (DecBase b)) => LorentzRounding (NFixed (DecBase a)) (NFixed (DecBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (NFixed (DecBase a) ': s) :-> (NFixed (DecBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (NFixed (DecBase a) ': s) :-> (NFixed (DecBase b) ': s) Source # floor_ :: forall (s :: [Type]). (NFixed (DecBase a) ': s) :-> (NFixed (DecBase b) ': s) Source #

data BinBase p where Source #

Constructors

BinBase :: KnownNat p => BinBase p

Instances

Instances details

(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (Fixed (BinBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Integer ': s)) :-> (r ': s) Source #
(r ~ Maybe (Natural, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
(r ~ Maybe (Integer, NFixed (BinBase a)), KnownNat a) => ArithOpHs EDiv (NFixed (BinBase a)) Integer r Source #
Instance details Defined in Lorentz.FixedArith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Integer ': s)) :-> (r ': s) Source #
r ~ NFixed (BinBase b) => ArithOpHs Lsl (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ NFixed (BinBase b) => ArithOpHs Lsr (NFixed (BinBase a)) Natural r Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Natural ': s)) :-> (r ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (BinBase a)) (NFixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (NFixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (Fixed (BinBase a)) (Fixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (Fixed (BinBase a) ': (Fixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (BinBase a)) (Fixed (BinBase b)) (Fixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (Fixed (BinBase b) ': s)) :-> (Fixed (BinBase r) ': s) Source #
r ~ (a + b) => ArithOpHs Mul (NFixed (BinBase a)) (NFixed (BinBase b)) (NFixed (BinBase r)) Source #
Instance details Defined in Lorentz.Arith Methods evalArithOpHs :: forall (s :: [Type]). (NFixed (BinBase a) ': (NFixed (BinBase b) ': s)) :-> (NFixed (BinBase r) ': s) Source #
KnownNat p => HasResolution (BinBase p :: Type) Source #
Instance details Defined in Lorentz.Value Methods resolution :: p0 (BinBase p) -> Integer #
KnownNat a => LorentzFixedCast (Fixed (BinBase a)) Source #
Instance details Defined in Lorentz.FixedArith Methods fromFixed :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Integer ': s) Source # toFixed :: forall (s :: [Type]). (Integer ': s) :-> (Fixed (BinBase a) ': s) Source #
(KnownNat a, KnownNat b) => LorentzRounding (Fixed (BinBase a)) (Fixed (BinBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source # floor_ :: forall (s :: [Type]). (Fixed (BinBase a) ': s) :-> (Fixed (BinBase b) ': s) Source #
(KnownNat a, KnownNat b) => LorentzRounding (NFixed (BinBase a)) (NFixed (BinBase b)) Source #
Instance details Defined in Lorentz.FixedArith Methods round_ :: forall (s :: [Type]). (NFixed (BinBase a) ': s) :-> (NFixed (BinBase b) ': s) Source # ceil_ :: forall (s :: [Type]). (NFixed (BinBase a) ': s) :-> (NFixed (BinBase b) ': s) Source # floor_ :: forall (s :: [Type]). (NFixed (BinBase a) ': s) :-> (NFixed (BinBase b) ': s) Source #

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 #

callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname) Source #

Generalization of callingTAddress to any typed address.

callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp) Source #

Generalization of callingDefTAddress to any typed address.

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

Deprecated: Use callingAddress

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 vd. NiceParameterFull cp => TAddress cp vd -> ContractRef (GetDefaultEntrypointArg cp) Source #

Deprecated: Use callingDefAddress

Specification of callingTAddress 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 EpAddress Source #
Instance details Defined in Lorentz.Address Methods toAddress :: EpAddress -> Address Source #
ToAddress Address Source #
Instance details Defined in Lorentz.Address Methods toAddress :: Address -> Address Source #
ToAddress (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 vd) Source #
Instance details Defined in Lorentz.Address Methods toAddress :: TAddress cp vd -> Address Source #

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

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

Methods

toTAddress :: a -> TAddress cp vd Source #

Instances

Instances details

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

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

Convert something to ContractRef in Haskell world.

Methods

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

Instances

Instances details

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

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

Convert something from ContractRef in Haskell world.

Methods

fromContractRef :: ContractRef cp -> contract Source #

Instances

Instances details

FromContractRef cp 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 Show a #

Conversion of values to readable Strings.

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

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

For example, given the declarations

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

the derived instance of Show is equivalent to

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

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

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

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

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

Minimal complete definition

showsPrec | show

Instances

Instances details

Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
Show Char	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Char -> ShowS # show :: Char -> String # showList :: [Char] -> ShowS #
Show Int	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Int -> ShowS # show :: Int -> String # showList :: [Int] -> ShowS #
Show Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int8 -> ShowS # show :: Int8 -> String # showList :: [Int8] -> ShowS #
Show Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int16 -> ShowS # show :: Int16 -> String # showList :: [Int16] -> ShowS #
Show Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int32 -> ShowS # show :: Int32 -> String # showList :: [Int32] -> ShowS #
Show Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int64 -> ShowS # show :: Int64 -> String # showList :: [Int64] -> ShowS #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Show Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Natural -> ShowS # show :: Natural -> String # showList :: [Natural] -> ShowS #
Show Ordering	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Ordering -> ShowS # show :: Ordering -> String # showList :: [Ordering] -> ShowS #
Show Word	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Word -> ShowS # show :: Word -> String # showList :: [Word] -> ShowS #
Show Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word8 -> ShowS # show :: Word8 -> String # showList :: [Word8] -> ShowS #
Show Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word16 -> ShowS # show :: Word16 -> String # showList :: [Word16] -> ShowS #
Show Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word32 -> ShowS # show :: Word32 -> String # showList :: [Word32] -> ShowS #
Show Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word64 -> ShowS # show :: Word64 -> String # showList :: [Word64] -> ShowS #
Show RuntimeRep	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> RuntimeRep -> ShowS # show :: RuntimeRep -> String # showList :: [RuntimeRep] -> ShowS #
Show VecCount	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecCount -> ShowS # show :: VecCount -> String # showList :: [VecCount] -> ShowS #
Show VecElem	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecElem -> ShowS # show :: VecElem -> String # showList :: [VecElem] -> ShowS #
Show CallStack	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> CallStack -> ShowS # show :: CallStack -> String # showList :: [CallStack] -> ShowS #
Show SomeTypeRep	Since: base-4.10.0.0
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> SomeTypeRep -> ShowS # show :: SomeTypeRep -> String # showList :: [SomeTypeRep] -> ShowS #
Show Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Exp -> ShowS # show :: Exp -> String # showList :: [Exp] -> ShowS #
Show Match
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Match -> ShowS # show :: Match -> String # showList :: [Match] -> ShowS #
Show Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Clause -> ShowS # show :: Clause -> String # showList :: [Clause] -> ShowS #
Show Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pat -> ShowS # show :: Pat -> String # showList :: [Pat] -> ShowS #
Show Type
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Type -> ShowS # show :: Type -> String # showList :: [Type] -> ShowS #
Show Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Dec -> ShowS # show :: Dec -> String # showList :: [Dec] -> ShowS #
Show Name
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Name -> ShowS # show :: Name -> String # showList :: [Name] -> ShowS #
Show FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FunDep -> ShowS # show :: FunDep -> String # showList :: [FunDep] -> ShowS #
Show InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> InjectivityAnn -> ShowS # show :: InjectivityAnn -> String # showList :: [InjectivityAnn] -> ShowS #
Show Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Overlap -> ShowS # show :: Overlap -> String # showList :: [Overlap] -> ShowS #
Show ()	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> () -> ShowS # show :: () -> String # showList :: [()] -> ShowS #
Show TyCon	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TyCon -> ShowS # show :: TyCon -> String # showList :: [TyCon] -> ShowS #
Show Module	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show TrName	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TrName -> ShowS # show :: TrName -> String # showList :: [TrName] -> ShowS #
Show KindRep
Instance details Defined in GHC.Show Methods showsPrec :: Int -> KindRep -> ShowS # show :: KindRep -> String # showList :: [KindRep] -> ShowS #
Show TypeLitSort	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TypeLitSort -> ShowS # show :: TypeLitSort -> String # showList :: [TypeLitSort] -> ShowS #
Show StdGen
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StdGen -> ShowS # show :: StdGen -> String # showList :: [StdGen] -> ShowS #
Show Version	Since: base-2.1
Instance details Defined in Data.Version Methods showsPrec :: Int -> Version -> ShowS # show :: Version -> String # showList :: [Version] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show Builder
Instance details Defined in Data.Text.Internal.Builder Methods showsPrec :: Int -> Builder -> ShowS # show :: Builder -> String # showList :: [Builder] -> ShowS #
Show Scientific	See `formatScientific` if you need more control over the rendering.
Instance details Defined in Data.Scientific Methods showsPrec :: Int -> Scientific -> ShowS # show :: Scientific -> String # showList :: [Scientific] -> ShowS #
Show JSONPathElement
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> JSONPathElement -> ShowS # show :: JSONPathElement -> String # showList :: [JSONPathElement] -> ShowS #
Show Value	Since version 1.5.6.0 version object values are printed in lexicographic key order `>>>` `toJSON $ H.fromList [("a", True), ("z", False)]`Object (fromList [("a",Bool True),("z",Bool False)]) `>>>` `toJSON $ H.fromList [("z", False), ("a", True)]`Object (fromList [("a",Bool True),("z",Bool False)])
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Value -> ShowS # show :: Value -> String # showList :: [Value] -> ShowS #
Show DotNetTime
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> DotNetTime -> ShowS # show :: DotNetTime -> String # showList :: [DotNetTime] -> ShowS #
Show Options
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Options -> ShowS # show :: Options -> String # showList :: [Options] -> ShowS #
Show SumEncoding
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> SumEncoding -> ShowS # show :: SumEncoding -> String # showList :: [SumEncoding] -> ShowS #
Show Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Handle -> ShowS # show :: Handle -> String # showList :: [Handle] -> ShowS #
Show ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadId -> ShowS # show :: ThreadId -> String # showList :: [ThreadId] -> ShowS #
Show Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show More
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> More -> ShowS # show :: More -> String # showList :: [More] -> ShowS #
Show Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods showsPrec :: Int -> Void -> ShowS # show :: Void -> String # showList :: [Void] -> ShowS #
Show BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> BlockReason -> ShowS # show :: BlockReason -> String # showList :: [BlockReason] -> ShowS #
Show ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadStatus -> ShowS # show :: ThreadStatus -> String # showList :: [ThreadStatus] -> ShowS #
Show BlockedIndefinitelyOnMVar	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS # show :: BlockedIndefinitelyOnMVar -> String # showList :: [BlockedIndefinitelyOnMVar] -> ShowS #
Show BlockedIndefinitelyOnSTM	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS # show :: BlockedIndefinitelyOnSTM -> String # showList :: [BlockedIndefinitelyOnSTM] -> ShowS #
Show Deadlock	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> Deadlock -> ShowS # show :: Deadlock -> String # showList :: [Deadlock] -> ShowS #
Show AllocationLimitExceeded	Since: base-4.7.1.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AllocationLimitExceeded -> ShowS # show :: AllocationLimitExceeded -> String # showList :: [AllocationLimitExceeded] -> ShowS #
Show CompactionFailed	Since: base-4.10.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> CompactionFailed -> ShowS # show :: CompactionFailed -> String # showList :: [CompactionFailed] -> ShowS #
Show AssertionFailed	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AssertionFailed -> ShowS # show :: AssertionFailed -> String # showList :: [AssertionFailed] -> ShowS #
Show SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS #
Show AsyncException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AsyncException -> ShowS # show :: AsyncException -> String # showList :: [AsyncException] -> ShowS #
Show ArrayException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ArrayException -> ShowS # show :: ArrayException -> String # showList :: [ArrayException] -> ShowS #
Show FixIOException	Since: base-4.11.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> FixIOException -> ShowS # show :: FixIOException -> String # showList :: [FixIOException] -> ShowS #
Show ExitCode
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ExitCode -> ShowS # show :: ExitCode -> String # showList :: [ExitCode] -> ShowS #
Show IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS #
Show HandleType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> HandleType -> ShowS # show :: HandleType -> String # showList :: [HandleType] -> ShowS #
Show BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS #
Show Newline	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Newline -> ShowS # show :: Newline -> String # showList :: [Newline] -> ShowS #
Show NewlineMode	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> NewlineMode -> ShowS # show :: NewlineMode -> String # showList :: [NewlineMode] -> ShowS #
Show MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods showsPrec :: Int -> MaskingState -> ShowS # show :: MaskingState -> String # showList :: [MaskingState] -> ShowS #
Show IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS #
Show ErrorCall	Since: base-4.0.0.0
Instance details Defined in GHC.Exception Methods showsPrec :: Int -> ErrorCall -> ShowS # show :: ErrorCall -> String # showList :: [ErrorCall] -> ShowS #
Show ArithException	Since: base-4.0.0.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> ArithException -> ShowS # show :: ArithException -> String # showList :: [ArithException] -> ShowS #
Show All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> All -> ShowS # show :: All -> String # showList :: [All] -> ShowS #
Show Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Any -> ShowS # show :: Any -> String # showList :: [Any] -> ShowS #
Show Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS #
Show SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods showsPrec :: Int -> SomeSymbol -> ShowS # show :: SomeSymbol -> String # showList :: [SomeSymbol] -> ShowS #
Show SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods showsPrec :: Int -> SomeNat -> ShowS # show :: SomeNat -> String # showList :: [SomeNat] -> ShowS #
Show CChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CChar -> ShowS # show :: CChar -> String # showList :: [CChar] -> ShowS #
Show CSChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSChar -> ShowS # show :: CSChar -> String # showList :: [CSChar] -> ShowS #
Show CUChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUChar -> ShowS # show :: CUChar -> String # showList :: [CUChar] -> ShowS #
Show CShort
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CShort -> ShowS # show :: CShort -> String # showList :: [CShort] -> ShowS #
Show CUShort
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUShort -> ShowS # show :: CUShort -> String # showList :: [CUShort] -> ShowS #
Show CInt
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CInt -> ShowS # show :: CInt -> String # showList :: [CInt] -> ShowS #
Show CUInt
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUInt -> ShowS # show :: CUInt -> String # showList :: [CUInt] -> ShowS #
Show CLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CLong -> ShowS # show :: CLong -> String # showList :: [CLong] -> ShowS #
Show CULong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CULong -> ShowS # show :: CULong -> String # showList :: [CULong] -> ShowS #
Show CLLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CLLong -> ShowS # show :: CLLong -> String # showList :: [CLLong] -> ShowS #
Show CULLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CULLong -> ShowS # show :: CULLong -> String # showList :: [CULLong] -> ShowS #
Show CBool
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CBool -> ShowS # show :: CBool -> String # showList :: [CBool] -> ShowS #
Show CFloat
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CFloat -> ShowS # show :: CFloat -> String # showList :: [CFloat] -> ShowS #
Show CDouble
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CDouble -> ShowS # show :: CDouble -> String # showList :: [CDouble] -> ShowS #
Show CPtrdiff
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CPtrdiff -> ShowS # show :: CPtrdiff -> String # showList :: [CPtrdiff] -> ShowS #
Show CSize
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSize -> ShowS # show :: CSize -> String # showList :: [CSize] -> ShowS #
Show CWchar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CWchar -> ShowS # show :: CWchar -> String # showList :: [CWchar] -> ShowS #
Show CSigAtomic
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSigAtomic -> ShowS # show :: CSigAtomic -> String # showList :: [CSigAtomic] -> ShowS #
Show CClock
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CClock -> ShowS # show :: CClock -> String # showList :: [CClock] -> ShowS #
Show CTime
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CTime -> ShowS # show :: CTime -> String # showList :: [CTime] -> ShowS #
Show CUSeconds
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUSeconds -> ShowS # show :: CUSeconds -> String # showList :: [CUSeconds] -> ShowS #
Show CSUSeconds
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSUSeconds -> ShowS # show :: CSUSeconds -> String # showList :: [CSUSeconds] -> ShowS #
Show CIntPtr
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CIntPtr -> ShowS # show :: CIntPtr -> String # showList :: [CIntPtr] -> ShowS #
Show CUIntPtr
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUIntPtr -> ShowS # show :: CUIntPtr -> String # showList :: [CUIntPtr] -> ShowS #
Show CIntMax
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CIntMax -> ShowS # show :: CIntMax -> String # showList :: [CIntMax] -> ShowS #
Show CUIntMax
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUIntMax -> ShowS # show :: CUIntMax -> String # showList :: [CUIntMax] -> ShowS #
Show IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods showsPrec :: Int -> IOMode -> ShowS # show :: IOMode -> String # showList :: [IOMode] -> ShowS #
Show GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods showsPrec :: Int -> GeneralCategory -> ShowS # show :: GeneralCategory -> String # showList :: [GeneralCategory] -> ShowS #
Show SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> SrcLoc -> ShowS # show :: SrcLoc -> String # showList :: [SrcLoc] -> ShowS #
Show SomeException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS #
Show Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods showsPrec :: Int -> Alphabet -> ShowS # show :: Alphabet -> String # showList :: [Alphabet] -> ShowS #
Show ASCII7_Invalid
Instance details Defined in Basement.String.Encoding.ASCII7 Methods showsPrec :: Int -> ASCII7_Invalid -> ShowS # show :: ASCII7_Invalid -> String # showList :: [ASCII7_Invalid] -> ShowS #
Show ISO_8859_1_Invalid
Instance details Defined in Basement.String.Encoding.ISO_8859_1 Methods showsPrec :: Int -> ISO_8859_1_Invalid -> ShowS # show :: ISO_8859_1_Invalid -> String # showList :: [ISO_8859_1_Invalid] -> ShowS #
Show UTF16_Invalid
Instance details Defined in Basement.String.Encoding.UTF16 Methods showsPrec :: Int -> UTF16_Invalid -> ShowS # show :: UTF16_Invalid -> String # showList :: [UTF16_Invalid] -> ShowS #
Show UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods showsPrec :: Int -> UTF32_Invalid -> ShowS # show :: UTF32_Invalid -> String # showList :: [UTF32_Invalid] -> ShowS #
Show Encoding
Instance details Defined in Basement.String Methods showsPrec :: Int -> Encoding -> ShowS # show :: Encoding -> String # showList :: [Encoding] -> ShowS #
Show String
Instance details Defined in Basement.UTF8.Base Methods showsPrec :: Int -> String -> ShowS # show :: String -> String0 # showList :: [String] -> ShowS #
Show AsciiString
Instance details Defined in Basement.Types.AsciiString Methods showsPrec :: Int -> AsciiString -> ShowS # show :: AsciiString -> String # showList :: [AsciiString] -> ShowS #
Show FileSize
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> FileSize -> ShowS # show :: FileSize -> String # showList :: [FileSize] -> ShowS #
Show Char7
Instance details Defined in Basement.Types.Char7 Methods showsPrec :: Int -> Char7 -> ShowS # show :: Char7 -> String # showList :: [Char7] -> ShowS #
Show ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods showsPrec :: Int -> ShortByteString -> ShowS # show :: ShortByteString -> String # showList :: [ShortByteString] -> ShowS #
Show WithInternals
Instance details Defined in Data.Bit.Internal Methods showsPrec :: Int -> WithInternals -> ShowS # show :: WithInternals -> String # showList :: [WithInternals] -> ShowS #
Show F2Poly
Instance details Defined in Data.Bit.F2Poly Methods showsPrec :: Int -> F2Poly -> ShowS # show :: F2Poly -> String # showList :: [F2Poly] -> ShowS #
Show Bit
Instance details Defined in Data.Bit.Internal Methods showsPrec :: Int -> Bit -> ShowS # show :: Bit -> String # showList :: [Bit] -> ShowS #
Show Clock
Instance details Defined in System.Clock Methods showsPrec :: Int -> Clock -> ShowS # show :: Clock -> String # showList :: [Clock] -> ShowS #
Show TimeSpec
Instance details Defined in System.Clock Methods showsPrec :: Int -> TimeSpec -> ShowS # show :: TimeSpec -> String # showList :: [TimeSpec] -> ShowS #
Show IntSet
Instance details Defined in Data.IntSet.Internal Methods showsPrec :: Int -> IntSet -> ShowS # show :: IntSet -> String # showList :: [IntSet] -> ShowS #
Show Signature
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show PrivateKey
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods showsPrec :: Int -> PrivateKey -> ShowS # show :: PrivateKey -> String # showList :: [PrivateKey] -> ShowS #
Show PublicKey
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show KeyPair
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods showsPrec :: Int -> KeyPair -> ShowS # show :: KeyPair -> String # showList :: [KeyPair] -> ShowS #
Show SecretKey
Instance details Defined in Crypto.PubKey.Ed25519 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show PublicKey
Instance details Defined in Crypto.PubKey.Ed25519 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show Signature
Instance details Defined in Crypto.PubKey.Ed25519 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Blake2b_160
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_160 -> ShowS # show :: Blake2b_160 -> String # showList :: [Blake2b_160] -> ShowS #
Show Blake2b_224
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_224 -> ShowS # show :: Blake2b_224 -> String # showList :: [Blake2b_224] -> ShowS #
Show Blake2b_256
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_256 -> ShowS # show :: Blake2b_256 -> String # showList :: [Blake2b_256] -> ShowS #
Show Blake2b_384
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_384 -> ShowS # show :: Blake2b_384 -> String # showList :: [Blake2b_384] -> ShowS #
Show Blake2b_512
Instance details Defined in Crypto.Hash.Blake2b Methods showsPrec :: Int -> Blake2b_512 -> ShowS # show :: Blake2b_512 -> String # showList :: [Blake2b_512] -> ShowS #
Show Blake2bp_512
Instance details Defined in Crypto.Hash.Blake2bp Methods showsPrec :: Int -> Blake2bp_512 -> ShowS # show :: Blake2bp_512 -> String # showList :: [Blake2bp_512] -> ShowS #
Show Blake2s_160
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_160 -> ShowS # show :: Blake2s_160 -> String # showList :: [Blake2s_160] -> ShowS #
Show Blake2s_224
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_224 -> ShowS # show :: Blake2s_224 -> String # showList :: [Blake2s_224] -> ShowS #
Show Blake2s_256
Instance details Defined in Crypto.Hash.Blake2s Methods showsPrec :: Int -> Blake2s_256 -> ShowS # show :: Blake2s_256 -> String # showList :: [Blake2s_256] -> ShowS #
Show Blake2sp_224
Instance details Defined in Crypto.Hash.Blake2sp Methods showsPrec :: Int -> Blake2sp_224 -> ShowS # show :: Blake2sp_224 -> String # showList :: [Blake2sp_224] -> ShowS #
Show Blake2sp_256
Instance details Defined in Crypto.Hash.Blake2sp Methods showsPrec :: Int -> Blake2sp_256 -> ShowS # show :: Blake2sp_256 -> String # showList :: [Blake2sp_256] -> ShowS #
Show Keccak_224
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_224 -> ShowS # show :: Keccak_224 -> String # showList :: [Keccak_224] -> ShowS #
Show Keccak_256
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_256 -> ShowS # show :: Keccak_256 -> String # showList :: [Keccak_256] -> ShowS #
Show Keccak_384
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_384 -> ShowS # show :: Keccak_384 -> String # showList :: [Keccak_384] -> ShowS #
Show Keccak_512
Instance details Defined in Crypto.Hash.Keccak Methods showsPrec :: Int -> Keccak_512 -> ShowS # show :: Keccak_512 -> String # showList :: [Keccak_512] -> ShowS #
Show MD2
Instance details Defined in Crypto.Hash.MD2 Methods showsPrec :: Int -> MD2 -> ShowS # show :: MD2 -> String # showList :: [MD2] -> ShowS #
Show MD4
Instance details Defined in Crypto.Hash.MD4 Methods showsPrec :: Int -> MD4 -> ShowS # show :: MD4 -> String # showList :: [MD4] -> ShowS #
Show MD5
Instance details Defined in Crypto.Hash.MD5 Methods showsPrec :: Int -> MD5 -> ShowS # show :: MD5 -> String # showList :: [MD5] -> ShowS #
Show RIPEMD160
Instance details Defined in Crypto.Hash.RIPEMD160 Methods showsPrec :: Int -> RIPEMD160 -> ShowS # show :: RIPEMD160 -> String # showList :: [RIPEMD160] -> ShowS #
Show SHA1
Instance details Defined in Crypto.Hash.SHA1 Methods showsPrec :: Int -> SHA1 -> ShowS # show :: SHA1 -> String # showList :: [SHA1] -> ShowS #
Show SHA224
Instance details Defined in Crypto.Hash.SHA224 Methods showsPrec :: Int -> SHA224 -> ShowS # show :: SHA224 -> String # showList :: [SHA224] -> ShowS #
Show SHA256
Instance details Defined in Crypto.Hash.SHA256 Methods showsPrec :: Int -> SHA256 -> ShowS # show :: SHA256 -> String # showList :: [SHA256] -> ShowS #
Show SHA3_224
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_224 -> ShowS # show :: SHA3_224 -> String # showList :: [SHA3_224] -> ShowS #
Show SHA3_256
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_256 -> ShowS # show :: SHA3_256 -> String # showList :: [SHA3_256] -> ShowS #
Show SHA3_384
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_384 -> ShowS # show :: SHA3_384 -> String # showList :: [SHA3_384] -> ShowS #
Show SHA3_512
Instance details Defined in Crypto.Hash.SHA3 Methods showsPrec :: Int -> SHA3_512 -> ShowS # show :: SHA3_512 -> String # showList :: [SHA3_512] -> ShowS #
Show SHA384
Instance details Defined in Crypto.Hash.SHA384 Methods showsPrec :: Int -> SHA384 -> ShowS # show :: SHA384 -> String # showList :: [SHA384] -> ShowS #
Show SHA512
Instance details Defined in Crypto.Hash.SHA512 Methods showsPrec :: Int -> SHA512 -> ShowS # show :: SHA512 -> String # showList :: [SHA512] -> ShowS #
Show SHA512t_224
Instance details Defined in Crypto.Hash.SHA512t Methods showsPrec :: Int -> SHA512t_224 -> ShowS # show :: SHA512t_224 -> String # showList :: [SHA512t_224] -> ShowS #
Show SHA512t_256
Instance details Defined in Crypto.Hash.SHA512t Methods showsPrec :: Int -> SHA512t_256 -> ShowS # show :: SHA512t_256 -> String # showList :: [SHA512t_256] -> ShowS #
Show Skein256_224
Instance details Defined in Crypto.Hash.Skein256 Methods showsPrec :: Int -> Skein256_224 -> ShowS # show :: Skein256_224 -> String # showList :: [Skein256_224] -> ShowS #
Show Skein256_256
Instance details Defined in Crypto.Hash.Skein256 Methods showsPrec :: Int -> Skein256_256 -> ShowS # show :: Skein256_256 -> String # showList :: [Skein256_256] -> ShowS #
Show Skein512_224
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_224 -> ShowS # show :: Skein512_224 -> String # showList :: [Skein512_224] -> ShowS #
Show Skein512_256
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_256 -> ShowS # show :: Skein512_256 -> String # showList :: [Skein512_256] -> ShowS #
Show Skein512_384
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_384 -> ShowS # show :: Skein512_384 -> String # showList :: [Skein512_384] -> ShowS #
Show Skein512_512
Instance details Defined in Crypto.Hash.Skein512 Methods showsPrec :: Int -> Skein512_512 -> ShowS # show :: Skein512_512 -> String # showList :: [Skein512_512] -> ShowS #
Show Tiger
Instance details Defined in Crypto.Hash.Tiger Methods showsPrec :: Int -> Tiger -> ShowS # show :: Tiger -> String # showList :: [Tiger] -> ShowS #
Show Whirlpool
Instance details Defined in Crypto.Hash.Whirlpool Methods showsPrec :: Int -> Whirlpool -> ShowS # show :: Whirlpool -> String # showList :: [Whirlpool] -> ShowS #
Show CryptoError
Instance details Defined in Crypto.Error.Types Methods showsPrec :: Int -> CryptoError -> ShowS # show :: CryptoError -> String # showList :: [CryptoError] -> ShowS #
Show ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorInfo -> ShowS # show :: ConstructorInfo -> String # showList :: [ConstructorInfo] -> ShowS #
Show DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeVariant -> ShowS # show :: DatatypeVariant -> String # showList :: [DatatypeVariant] -> ShowS #
Show Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Show ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS # show :: ForeignSrcLang -> String # showList :: [ForeignSrcLang] -> ShowS #
Show RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleBndr -> ShowS # show :: RuleBndr -> String # showList :: [RuleBndr] -> ShowS #
Show Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Phases -> ShowS # show :: Phases -> String # showList :: [Phases] -> ShowS #
Show RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleMatch -> ShowS # show :: RuleMatch -> String # showList :: [RuleMatch] -> ShowS #
Show Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Inline -> ShowS # show :: Inline -> String # showList :: [Inline] -> ShowS #
Show Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pragma -> ShowS # show :: Pragma -> String # showList :: [Pragma] -> ShowS #
Show DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivClause -> ShowS # show :: DerivClause -> String # showList :: [DerivClause] -> ShowS #
Show DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivStrategy -> ShowS # show :: DerivStrategy -> String # showList :: [DerivStrategy] -> ShowS #
Show TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TySynEqn -> ShowS # show :: TySynEqn -> String # showList :: [TySynEqn] -> ShowS #
Show Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show Info
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Info -> ShowS # show :: Info -> String # showList :: [Info] -> ShowS #
Show Con
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Con -> ShowS # show :: Con -> String # showList :: [Con] -> ShowS #
Show TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyVarBndr -> ShowS # show :: TyVarBndr -> String # showList :: [TyVarBndr] -> ShowS #
Show DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods showsPrec :: Int -> DefName -> ShowS # show :: DefName -> String # showList :: [DefName] -> ShowS #
Show Pos
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> InvalidPosException -> ShowS # show :: InvalidPosException -> String # showList :: [InvalidPosException] -> ShowS #
Show SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> SourcePos -> ShowS # show :: SourcePos -> String # showList :: [SourcePos] -> ShowS #
Show IsCmdStart
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> IsCmdStart -> ShowS # show :: IsCmdStart -> String # showList :: [IsCmdStart] -> ShowS #
Show Backtracking
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Backtracking -> ShowS # show :: Backtracking -> String # showList :: [Backtracking] -> ShowS #
Show ParserPrefs
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserPrefs -> ShowS # show :: ParserPrefs -> String # showList :: [ParserPrefs] -> ShowS #
Show OptName
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptName -> ShowS # show :: OptName -> String # showList :: [OptName] -> ShowS #
Show OptVisibility
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptVisibility -> ShowS # show :: OptVisibility -> String # showList :: [OptVisibility] -> ShowS #
Show OptProperties
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptProperties -> ShowS # show :: OptProperties -> String # showList :: [OptProperties] -> ShowS #
Show CompletionResult
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> CompletionResult -> ShowS # show :: CompletionResult -> String # showList :: [CompletionResult] -> ShowS #
Show ArgPolicy
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgPolicy -> ShowS # show :: ArgPolicy -> String # showList :: [ArgPolicy] -> ShowS #
Show ArgumentReachability
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgumentReachability -> ShowS # show :: ArgumentReachability -> String # showList :: [ArgumentReachability] -> ShowS #
Show AltNodeType
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> AltNodeType -> ShowS # show :: AltNodeType -> String # showList :: [AltNodeType] -> ShowS #
Show Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods showsPrec :: Int -> Doc -> ShowS # show :: Doc -> String # showList :: [Doc] -> ShowS #
Show TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> TextDetails -> ShowS # show :: TextDetails -> String # showList :: [TextDetails] -> ShowS #
Show Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Style -> ShowS # show :: Style -> String # showList :: [Style] -> ShowS #
Show Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Mode -> ShowS # show :: Mode -> String # showList :: [Mode] -> ShowS #
Show ByteArray	Behavior changed in 0.7.2.0. Before 0.7.2.0, this instance rendered 8-bit words less than 16 as a single hexadecimal digit (e.g. 13 was `0xD`). Starting with 0.7.2.0, all 8-bit words are represented as two digits (e.g. 13 is `0x0D`). Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods showsPrec :: Int -> ByteArray -> ShowS # show :: ByteArray -> String # showList :: [ByteArray] -> ShowS #
Show UnicodeException
Instance details Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS #
Show Mod2
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Mod2 -> ShowS # show :: Mod2 -> String # showList :: [Mod2] -> ShowS #
Show ResourceError
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> ResourceError -> ShowS # show :: ResourceError -> String # showList :: [ResourceError] -> ShowS #
Show FailureReason
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> FailureReason -> ShowS # show :: FailureReason -> String # showList :: [FailureReason] -> ShowS #
Show Outcome
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Outcome -> ShowS # show :: Outcome -> String # showList :: [Outcome] -> ShowS #
Show Result
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Result -> ShowS # show :: Result -> String # showList :: [Result] -> ShowS #
Show Progress
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> Progress -> ShowS # show :: Progress -> String # showList :: [Progress] -> ShowS #
Show DependencyType
Instance details Defined in Test.Tasty.Core Methods showsPrec :: Int -> DependencyType -> ShowS # show :: DependencyType -> String # showList :: [DependencyType] -> ShowS #
Show Expr
Instance details Defined in Test.Tasty.Patterns.Types Methods showsPrec :: Int -> Expr -> ShowS # show :: Expr -> String # showList :: [Expr] -> ShowS #
Show ForallVisFlag
Instance details Defined in Language.Haskell.TH.Ppr Methods showsPrec :: Int -> ForallVisFlag -> ShowS # show :: ForallVisFlag -> String # showList :: [ForallVisFlag] -> ShowS #
Show ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModName -> ShowS # show :: ModName -> String # showList :: [ModName] -> ShowS #
Show PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PkgName -> ShowS # show :: PkgName -> String # showList :: [PkgName] -> ShowS #
Show Module
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> OccName -> ShowS # show :: OccName -> String # showList :: [OccName] -> ShowS #
Show NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameFlavour -> ShowS # show :: NameFlavour -> String # showList :: [NameFlavour] -> ShowS #
Show NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameSpace -> ShowS # show :: NameSpace -> String # showList :: [NameSpace] -> ShowS #
Show Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Loc -> ShowS # show :: Loc -> String # showList :: [Loc] -> ShowS #
Show ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModuleInfo -> ShowS # show :: ModuleInfo -> String # showList :: [ModuleInfo] -> ShowS #
Show FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FixityDirection -> ShowS # show :: FixityDirection -> String # showList :: [FixityDirection] -> ShowS #
Show Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Lit -> ShowS # show :: Lit -> String # showList :: [Lit] -> ShowS #
Show Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bytes -> ShowS # show :: Bytes -> String # showList :: [Bytes] -> ShowS #
Show Body
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Body -> ShowS # show :: Body -> String # showList :: [Body] -> ShowS #
Show Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Guard -> ShowS # show :: Guard -> String # showList :: [Guard] -> ShowS #
Show Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Stmt -> ShowS # show :: Stmt -> String # showList :: [Stmt] -> ShowS #
Show Range
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Range -> ShowS # show :: Range -> String # showList :: [Range] -> ShowS #
Show TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TypeFamilyHead -> ShowS # show :: TypeFamilyHead -> String # showList :: [TypeFamilyHead] -> ShowS #
Show Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Foreign -> ShowS # show :: Foreign -> String # showList :: [Foreign] -> ShowS #
Show Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Callconv -> ShowS # show :: Callconv -> String # showList :: [Callconv] -> ShowS #
Show Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Safety -> ShowS # show :: Safety -> String # showList :: [Safety] -> ShowS #
Show AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnTarget -> ShowS # show :: AnnTarget -> String # showList :: [AnnTarget] -> ShowS #
Show SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bang -> ShowS # show :: Bang -> String # showList :: [Bang] -> ShowS #
Show PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynDir -> ShowS # show :: PatSynDir -> String # showList :: [PatSynDir] -> ShowS #
Show PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynArgs -> ShowS # show :: PatSynArgs -> String # showList :: [PatSynArgs] -> ShowS #
Show FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FamilyResultSig -> ShowS # show :: FamilyResultSig -> String # showList :: [FamilyResultSig] -> ShowS #
Show TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyLit -> ShowS # show :: TyLit -> String # showList :: [TyLit] -> ShowS #
Show Role
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Role -> ShowS # show :: Role -> String # showList :: [Role] -> ShowS #
Show AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnLookup -> ShowS # show :: AnnLookup -> String # showList :: [AnnLookup] -> ShowS #
Show DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeInfo -> ShowS # show :: DatatypeInfo -> String # showList :: [DatatypeInfo] -> ShowS #
Show ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorVariant -> ShowS # show :: ConstructorVariant -> String # showList :: [ConstructorVariant] -> ShowS #
Show FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> FieldStrictness -> ShowS # show :: FieldStrictness -> String # showList :: [FieldStrictness] -> ShowS #
Show Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Unpackedness -> ShowS # show :: Unpackedness -> String # showList :: [Unpackedness] -> ShowS #
Show Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Strictness -> ShowS # show :: Strictness -> String # showList :: [Strictness] -> ShowS #
Show Specificity
Instance details Defined in Language.Haskell.TH.Datatype.TyVarBndr Methods showsPrec :: Int -> Specificity -> ShowS # show :: Specificity -> String # showList :: [Specificity] -> ShowS #
Show DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DTypeArg -> ShowS # show :: DTypeArg -> String # showList :: [DTypeArg] -> ShowS #
Show DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DFunArgs -> ShowS # show :: DFunArgs -> String # showList :: [DFunArgs] -> ShowS #
Show DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods showsPrec :: Int -> DVisFunArg -> ShowS # show :: DVisFunArg -> String # showList :: [DVisFunArg] -> ShowS #
Show DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DExp -> ShowS # show :: DExp -> String # showList :: [DExp] -> ShowS #
Show DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPat -> ShowS # show :: DPat -> String # showList :: [DPat] -> ShowS #
Show DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DType -> ShowS # show :: DType -> String # showList :: [DType] -> ShowS #
Show DTyVarBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTyVarBndr -> ShowS # show :: DTyVarBndr -> String # showList :: [DTyVarBndr] -> ShowS #
Show DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DMatch -> ShowS # show :: DMatch -> String # showList :: [DMatch] -> ShowS #
Show DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DClause -> ShowS # show :: DClause -> String # showList :: [DClause] -> ShowS #
Show DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DLetDec -> ShowS # show :: DLetDec -> String # showList :: [DLetDec] -> ShowS #
Show NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> NewOrData -> ShowS # show :: NewOrData -> String # showList :: [NewOrData] -> ShowS #
Show DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDec -> ShowS # show :: DDec -> String # showList :: [DDec] -> ShowS #
Show DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPatSynDir -> ShowS # show :: DPatSynDir -> String # showList :: [DPatSynDir] -> ShowS #
Show DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTypeFamilyHead -> ShowS # show :: DTypeFamilyHead -> String # showList :: [DTypeFamilyHead] -> ShowS #
Show DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DFamilyResultSig -> ShowS # show :: DFamilyResultSig -> String # showList :: [DFamilyResultSig] -> ShowS #
Show DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DCon -> ShowS # show :: DCon -> String # showList :: [DCon] -> ShowS #
Show DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DConFields -> ShowS # show :: DConFields -> String # showList :: [DConFields] -> ShowS #
Show DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DForeign -> ShowS # show :: DForeign -> String # showList :: [DForeign] -> ShowS #
Show DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPragma -> ShowS # show :: DPragma -> String # showList :: [DPragma] -> ShowS #
Show DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DRuleBndr -> ShowS # show :: DRuleBndr -> String # showList :: [DRuleBndr] -> ShowS #
Show DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTySynEqn -> ShowS # show :: DTySynEqn -> String # showList :: [DTySynEqn] -> ShowS #
Show DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DInfo -> ShowS # show :: DInfo -> String # showList :: [DInfo] -> ShowS #
Show DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivClause -> ShowS # show :: DDerivClause -> String # showList :: [DDerivClause] -> ShowS #
Show DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivStrategy -> ShowS # show :: DDerivStrategy -> String # showList :: [DDerivStrategy] -> ShowS #
Show ForallVisFlag
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods showsPrec :: Int -> ForallVisFlag -> ShowS # show :: ForallVisFlag -> String # showList :: [ForallVisFlag] -> ShowS #
Show FunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods showsPrec :: Int -> FunArgs -> ShowS # show :: FunArgs -> String # showList :: [FunArgs] -> ShowS #
Show VisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods showsPrec :: Int -> VisFunArg -> ShowS # show :: VisFunArg -> String # showList :: [VisFunArg] -> ShowS #
Show TypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods showsPrec :: Int -> TypeArg -> ShowS # show :: TypeArg -> String # showList :: [TypeArg] -> ShowS #
Show ZonedTime
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods showsPrec :: Int -> ZonedTime -> ShowS # show :: ZonedTime -> String # showList :: [ZonedTime] -> ShowS #
Show LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods showsPrec :: Int -> LocalTime -> ShowS # show :: LocalTime -> String # showList :: [LocalTime] -> ShowS #
Show DayOfWeek
Instance details Defined in Data.Time.Calendar.Week Methods showsPrec :: Int -> DayOfWeek -> ShowS # show :: DayOfWeek -> String # showList :: [DayOfWeek] -> ShowS #
Show Undefined
Instance details Defined in Universum.Debug Methods showsPrec :: Int -> Undefined -> ShowS # show :: Undefined -> String # showList :: [Undefined] -> ShowS #
Show Bug
Instance details Defined in Universum.Exception Methods showsPrec :: Int -> Bug -> ShowS # show :: Bug -> String # showList :: [Bug] -> ShowS #
Show UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UnpackedUUID -> ShowS # show :: UnpackedUUID -> String # showList :: [UnpackedUUID] -> ShowS #
Show UUID	Pretty prints a `UUID` (without quotation marks). See also `toString`. `>>>` `show nil`"00000000-0000-0000-0000-000000000000"
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UUID -> ShowS # show :: UUID -> String # showList :: [UUID] -> ShowS #
Show Doc
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods showsPrec :: Int -> Doc -> ShowS # show :: Doc -> String # showList :: [Doc] -> ShowS #
Show SimpleDoc
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods showsPrec :: Int -> SimpleDoc -> ShowS # show :: SimpleDoc -> String # showList :: [SimpleDoc] -> ShowS #
Show MText
Instance details Defined in Morley.Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
Show SomeAnnotatedValue
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods showsPrec :: Int -> SomeAnnotatedValue -> ShowS # show :: SomeAnnotatedValue -> String # showList :: [SomeAnnotatedValue] -> ShowS #
Show AnnConvergeError
Instance details Defined in Morley.Michelson.Typed.Annotation Methods showsPrec :: Int -> AnnConvergeError -> ShowS # show :: AnnConvergeError -> String # showList :: [AnnConvergeError] -> ShowS #
Show MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> MutezArithErrorType -> ShowS # show :: MutezArithErrorType -> String # showList :: [MutezArithErrorType] -> ShowS #
Show ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> ShiftArithErrorType -> ShowS # show :: ShiftArithErrorType -> String # showList :: [ShiftArithErrorType] -> ShowS #
Show ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ArmCoord -> ShowS # show :: ArmCoord -> String # showList :: [ArmCoord] -> ShowS #
Show EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
Show ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParamEpError -> ShowS # show :: ParamEpError -> String # showList :: [ParamEpError] -> ShowS #
Show ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParseEpAddressError -> ShowS # show :: ParseEpAddressError -> String # showList :: [ParseEpAddressError] -> ShowS #
Show SomeContract
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeContract -> ShowS # show :: SomeContract -> String # showList :: [SomeContract] -> ShowS #
Show SomeContractAndStorage
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeContractAndStorage -> ShowS # show :: SomeContractAndStorage -> String # showList :: [SomeContractAndStorage] -> ShowS #
Show SomeStorage
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeStorage -> ShowS # show :: SomeStorage -> String # showList :: [SomeStorage] -> ShowS #
Show SomeValue
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeValue -> ShowS # show :: SomeValue -> String # showList :: [SomeValue] -> ShowS #
Show DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods showsPrec :: Int -> DType -> ShowS # show :: DType -> String # showList :: [DType] -> ShowS #
Show CommentType
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> CommentType -> ShowS # show :: CommentType -> String # showList :: [CommentType] -> ShowS #
Show SomeMeta
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> SomeMeta -> ShowS # show :: SomeMeta -> String # showList :: [SomeMeta] -> ShowS #
Show BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope Methods showsPrec :: Int -> BadTypeForScope -> ShowS # show :: BadTypeForScope -> String # showList :: [BadTypeForScope] -> ShowS #
Show T
Instance details Defined in Morley.Michelson.Typed.T Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Show SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> SetDelegate -> ShowS # show :: SetDelegate -> String # showList :: [SetDelegate] -> ShowS #
Show ViewsSetError
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> ViewsSetError -> ShowS # show :: ViewsSetError -> String # showList :: [ViewsSetError] -> ShowS #
Show EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
Show EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods showsPrec :: Int -> EpNameFromRefAnnError -> ShowS # show :: EpNameFromRefAnnError -> String # showList :: [EpNameFromRefAnnError] -> ShowS #
Show OpSize
Instance details Defined in Morley.Michelson.Untyped.OpSize Methods showsPrec :: Int -> OpSize -> ShowS # show :: OpSize -> String # showList :: [OpSize] -> ShowS #
Show ViewName
Instance details Defined in Morley.Michelson.Untyped.View Methods showsPrec :: Int -> ViewName -> ShowS # show :: ViewName -> String # showList :: [ViewName] -> ShowS #
Show Address
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> Address -> ShowS # show :: Address -> String # showList :: [Address] -> ShowS #
Show Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381Fr -> ShowS # show :: Bls12381Fr -> String # showList :: [Bls12381Fr] -> ShowS #
Show Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G1 -> ShowS # show :: Bls12381G1 -> String # showList :: [Bls12381G1] -> ShowS #
Show Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> Bls12381G2 -> ShowS # show :: Bls12381G2 -> String # showList :: [Bls12381G2] -> ShowS #
Show ChainId
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> ChainId -> ShowS # show :: ChainId -> String # showList :: [ChainId] -> ShowS #
Show Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Chest -> ShowS # show :: Chest -> String # showList :: [Chest] -> ShowS #
Show ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> ChestKey -> ShowS # show :: ChestKey -> String # showList :: [ChestKey] -> ShowS #
Show KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> KeyHash -> ShowS # show :: KeyHash -> String # showList :: [KeyHash] -> ShowS #
Show Mutez
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Mutez -> ShowS # show :: Mutez -> String # showList :: [Mutez] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Timestamp
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> Timestamp -> ShowS # show :: Timestamp -> String # showList :: [Timestamp] -> ShowS #
Show AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> AnnotationSet -> ShowS # show :: AnnotationSet -> String # showList :: [AnnotationSet] -> ShowS #
Show VarAnns
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> VarAnns -> ShowS # show :: VarAnns -> String # showList :: [VarAnns] -> ShowS #
Show EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> EntriesOrder -> ShowS # show :: EntriesOrder -> String # showList :: [EntriesOrder] -> ShowS #
Show PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> PrintComment -> ShowS # show :: PrintComment -> String # showList :: [PrintComment] -> ShowS #
Show StackFn
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> StackFn -> ShowS # show :: StackFn -> String # showList :: [StackFn] -> ShowS #
Show StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> StackRef -> ShowS # show :: StackRef -> String # showList :: [StackRef] -> ShowS #
Show StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> StackTypePattern -> ShowS # show :: StackTypePattern -> String # showList :: [StackTypePattern] -> ShowS #
Show TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> TyVar -> ShowS # show :: TyVar -> String # showList :: [TyVar] -> ShowS #
Show Var
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> Var -> ShowS # show :: Var -> String # showList :: [Var] -> ShowS #
Show ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Methods showsPrec :: Int -> ExpandedOp -> ShowS # show :: ExpandedOp -> String # showList :: [ExpandedOp] -> ShowS #
Show ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> ParameterType -> ShowS # show :: ParameterType -> String # showList :: [ParameterType] -> ShowS #
Show T
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Show Ty
Instance details Defined in Morley.Michelson.Untyped.Type Methods showsPrec :: Int -> Ty -> ShowS # show :: Ty -> String # showList :: [Ty] -> ShowS #
Show InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> InternalByteString -> ShowS # show :: InternalByteString -> String # showList :: [InternalByteString] -> ShowS #
Show BadViewNameError
Instance details Defined in Morley.Michelson.Untyped.View Methods showsPrec :: Int -> BadViewNameError -> ShowS # show :: BadViewNameError -> String # showList :: [BadViewNameError] -> ShowS #
Show ContractHash
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ContractHash -> ShowS # show :: ContractHash -> String # showList :: [ContractHash] -> ShowS #
Show GlobalCounter
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> GlobalCounter -> ShowS # show :: GlobalCounter -> String # showList :: [GlobalCounter] -> ShowS #
Show ParseAddressError
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ParseAddressError -> ShowS # show :: ParseAddressError -> String # showList :: [ParseAddressError] -> ShowS #
Show ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ParseAddressRawError -> ShowS # show :: ParseAddressRawError -> String # showList :: [ParseAddressRawError] -> ShowS #
Show ParseContractAddressError
Instance details Defined in Morley.Tezos.Address Methods showsPrec :: Int -> ParseContractAddressError -> ShowS # show :: ParseContractAddressError -> String # showList :: [ParseContractAddressError] -> ShowS #
Show CryptoParseError
Instance details Defined in Morley.Tezos.Crypto.Util Methods showsPrec :: Int -> CryptoParseError -> ShowS # show :: CryptoParseError -> String # showList :: [CryptoParseError] -> ShowS #
Show ParseChainIdError
Instance details Defined in Morley.Tezos.Core Methods showsPrec :: Int -> ParseChainIdError -> ShowS # show :: ParseChainIdError -> String # showList :: [ParseChainIdError] -> ShowS #
Show KeyHashTag
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> KeyHashTag -> ShowS # show :: KeyHashTag -> String # showList :: [KeyHashTag] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show OpeningResult
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> OpeningResult -> ShowS # show :: OpeningResult -> String # showList :: [OpeningResult] -> ShowS #
Show TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> TLTime -> ShowS # show :: TLTime -> String # showList :: [TLTime] -> ShowS #
Show B58CheckWithPrefixError
Instance details Defined in Morley.Tezos.Crypto.Util Methods showsPrec :: Int -> B58CheckWithPrefixError -> ShowS # show :: B58CheckWithPrefixError -> String # showList :: [B58CheckWithPrefixError] -> ShowS #
Show ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Methods showsPrec :: Int -> ParseSignatureRawError -> ShowS # show :: ParseSignatureRawError -> String # showList :: [ParseSignatureRawError] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> SecretKey -> ShowS # show :: SecretKey -> String # showList :: [SecretKey] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Show DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemPos -> ShowS # show :: DocItemPos -> String # showList :: [DocItemPos] -> ShowS #
Show DocSection
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocSection -> ShowS # show :: DocSection -> String # showList :: [DocSection] -> ShowS #
Show SomeDocItem
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> SomeDocItem -> ShowS # show :: SomeDocItem -> String # showList :: [SomeDocItem] -> ShowS #
Show UntypingOptions
Instance details Defined in Morley.Michelson.Typed.Convert Methods showsPrec :: Int -> UntypingOptions -> ShowS # show :: UntypingOptions -> String # showList :: [UntypingOptions] -> ShowS #
Show Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Ciphertext -> ShowS # show :: Ciphertext -> String # showList :: [Ciphertext] -> ShowS #
Show Locked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Locked -> ShowS # show :: Locked -> String # showList :: [Locked] -> ShowS #
Show Nonce
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Nonce -> ShowS # show :: Nonce -> String # showList :: [Nonce] -> ShowS #
Show Proof
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Proof -> ShowS # show :: Proof -> String # showList :: [Proof] -> ShowS #
Show PublicModulus
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> PublicModulus -> ShowS # show :: PublicModulus -> String # showList :: [PublicModulus] -> ShowS #
Show Unlocked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> Unlocked -> ShowS # show :: Unlocked -> String # showList :: [Unlocked] -> ShowS #
Show RSAFactors
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> RSAFactors -> ShowS # show :: RSAFactors -> String # showList :: [RSAFactors] -> ShowS #
Show SymmetricKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods showsPrec :: Int -> SymmetricKey -> ShowS # show :: SymmetricKey -> String # showList :: [SymmetricKey] -> ShowS #
Show InstrCallStack
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> InstrCallStack -> ShowS # show :: InstrCallStack -> String # showList :: [InstrCallStack] -> ShowS #
Show DocGrouping
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocGrouping -> ShowS # show :: DocGrouping -> String # showList :: [DocGrouping] -> ShowS #
Show DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods showsPrec :: Int -> DeserializationError -> ShowS # show :: DeserializationError -> String # showList :: [DeserializationError] -> ShowS #
Show DocItemId
Instance details Defined in Morley.Michelson.Doc Methods showsPrec :: Int -> DocItemId -> ShowS # show :: DocItemId -> String # showList :: [DocItemId] -> ShowS #
Show LetName
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> LetName -> ShowS # show :: LetName -> String # showList :: [LetName] -> ShowS #
Show Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods showsPrec :: Int -> SrcPos -> ShowS # show :: SrcPos -> String # showList :: [SrcPos] -> ShowS #
Show EpCallingStep Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods showsPrec :: Int -> EpCallingStep -> ShowS # show :: EpCallingStep -> String # showList :: [EpCallingStep] -> ShowS #
Show ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods showsPrec :: Int -> ViewInterfaceMatchError -> ShowS # show :: ViewInterfaceMatchError -> String # showList :: [ViewInterfaceMatchError] -> ShowS #
Show FromExpressionError
Instance details Defined in Morley.Micheline.Class Methods showsPrec :: Int -> FromExpressionError -> ShowS # show :: FromExpressionError -> String # showList :: [FromExpressionError] -> ShowS #
Show Annotation
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> Annotation -> ShowS # show :: Annotation -> String # showList :: [Annotation] -> ShowS #
Show Expression
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> Expression -> ShowS # show :: Expression -> String # showList :: [Expression] -> ShowS #
Show MichelinePrimAp
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> MichelinePrimAp -> ShowS # show :: MichelinePrimAp -> String # showList :: [MichelinePrimAp] -> ShowS #
Show MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression Methods showsPrec :: Int -> MichelinePrimitive -> ShowS # show :: MichelinePrimitive -> String # showList :: [MichelinePrimitive] -> ShowS #
Show TezosMutez
Instance details Defined in Morley.Micheline.Json Methods showsPrec :: Int -> TezosMutez -> ShowS # show :: TezosMutez -> String # showList :: [TezosMutez] -> ShowS #
Show CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> CustomParserException -> ShowS # show :: CustomParserException -> String # showList :: [CustomParserException] -> ShowS #
Show ParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> ParserException -> ShowS # show :: ParserException -> String # showList :: [ParserException] -> ShowS #
Show StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods showsPrec :: Int -> StringLiteralParserException -> ShowS # show :: StringLiteralParserException -> String # showList :: [StringLiteralParserException] -> ShowS #
Show MichelsonSource
Instance details Defined in Morley.Michelson.Parser.Types Methods showsPrec :: Int -> MichelsonSource -> ShowS # show :: MichelsonSource -> String # showList :: [MichelsonSource] -> ShowS #
Show ParsedOp
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> ParsedOp -> ShowS # show :: ParsedOp -> String # showList :: [ParsedOp] -> ShowS #
Show LetEnv
Instance details Defined in Morley.Michelson.Parser.Types Methods showsPrec :: Int -> LetEnv -> ShowS # show :: LetEnv -> String # showList :: [LetEnv] -> ShowS #
Show StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> StackSize -> ShowS # show :: StackSize -> String # showList :: [StackSize] -> ShowS #
Show TCError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TCError -> ShowS # show :: TCError -> String # showList :: [TCError] -> ShowS #
Show TCTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TCTypeError -> ShowS # show :: TCTypeError -> String # showList :: [TCTypeError] -> ShowS #
Show TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TopLevelType -> ShowS # show :: TopLevelType -> String # showList :: [TopLevelType] -> ShowS #
Show TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods showsPrec :: Int -> TypeContext -> ShowS # show :: TypeContext -> String # showList :: [TypeContext] -> ShowS #
Show SomeParamType
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods showsPrec :: Int -> SomeParamType -> ShowS # show :: SomeParamType -> String # showList :: [SomeParamType] -> ShowS #
Show SomeHST
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeHST -> ShowS # show :: SomeHST -> String # showList :: [SomeHST] -> ShowS #
Show HexJSONByteString
Instance details Defined in Morley.Util.ByteString Methods showsPrec :: Int -> HexJSONByteString -> ShowS # show :: HexJSONByteString -> String # showList :: [HexJSONByteString] -> ShowS #
Show CadrStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> CadrStruct -> ShowS # show :: CadrStruct -> String # showList :: [CadrStruct] -> ShowS #
Show LetMacro
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> LetMacro -> ShowS # show :: LetMacro -> String # showList :: [LetMacro] -> ShowS #
Show Macro
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> Macro -> ShowS # show :: Macro -> String # showList :: [Macro] -> ShowS #
Show PairStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> PairStruct -> ShowS # show :: PairStruct -> String # showList :: [PairStruct] -> ShowS #
Show UnpairStruct
Instance details Defined in Morley.Michelson.Macro Methods showsPrec :: Int -> UnpairStruct -> ShowS # show :: UnpairStruct -> String # showList :: [UnpairStruct] -> ShowS #
Show Positive
Instance details Defined in Morley.Util.Positive Methods showsPrec :: Int -> Positive -> ShowS # show :: Positive -> String # showList :: [Positive] -> ShowS #
Show Never Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> Never -> ShowS # show :: Never -> String # showList :: [Never] -> ShowS #
Show OpenChest Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> OpenChest -> ShowS # show :: OpenChest -> String # showList :: [OpenChest] -> ShowS #
Show UnpackError
Instance details Defined in Morley.Util.Binary Methods showsPrec :: Int -> UnpackError -> ShowS # show :: UnpackError -> String # showList :: [UnpackError] -> ShowS #
Show SomeError Source #
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> SomeError -> ShowS # show :: SomeError -> String # showList :: [SomeError] -> ShowS #
Show BimapException
Instance details Defined in Data.Bimap Methods showsPrec :: Int -> BimapException -> ShowS # show :: BimapException -> String # showList :: [BimapException] -> ShowS #
Show AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods showsPrec :: Int -> AnalyzerRes -> ShowS # show :: AnalyzerRes -> String # showList :: [AnalyzerRes] -> ShowS #
Show ExtConversionError Source #
Instance details Defined in Lorentz.Extensible Methods showsPrec :: Int -> ExtConversionError -> ShowS # show :: ExtConversionError -> String # showList :: [ExtConversionError] -> ShowS #
Show ParamBuildingStep Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuildingStep -> ShowS # show :: ParamBuildingStep -> String # showList :: [ParamBuildingStep] -> ShowS #
Show ParamBuildingDesc Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuildingDesc -> ShowS # show :: ParamBuildingDesc -> String # showList :: [ParamBuildingDesc] -> ShowS #
Show ParamBuilder Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods showsPrec :: Int -> ParamBuilder -> ShowS # show :: ParamBuilder -> String # showList :: [ParamBuilder] -> ShowS #
Show EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> EntrypointLookupError -> ShowS # show :: EntrypointLookupError -> String # showList :: [EntrypointLookupError] -> ShowS #
Show InterpretError
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> InterpretError -> ShowS # show :: InterpretError -> String # showList :: [InterpretError] -> ShowS #
Show InterpretResult
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> InterpretResult -> ShowS # show :: InterpretResult -> String # showList :: [InterpretResult] -> ShowS #
Show InterpreterState
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> InterpreterState -> ShowS # show :: InterpreterState -> String # showList :: [InterpreterState] -> ShowS #
Show MichelsonFailed
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MichelsonFailed -> ShowS # show :: MichelsonFailed -> String # showList :: [MichelsonFailed] -> ShowS #
Show MichelsonFailureWithStack
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MichelsonFailureWithStack -> ShowS # show :: MichelsonFailureWithStack -> String # showList :: [MichelsonFailureWithStack] -> ShowS #
Show MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> MorleyLogs -> ShowS # show :: MorleyLogs -> String # showList :: [MorleyLogs] -> ShowS #
Show RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> RemainingSteps -> ShowS # show :: RemainingSteps -> String # showList :: [RemainingSteps] -> ShowS #
Show BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> BigMapCounter -> ShowS # show :: BigMapCounter -> String # showList :: [BigMapCounter] -> ShowS #
Show AddressState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> AddressState -> ShowS # show :: AddressState -> String # showList :: [AddressState] -> ShowS #
Show VotingPowers
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> VotingPowers -> ShowS # show :: VotingPowers -> String # showList :: [VotingPowers] -> ShowS #
Show OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> OperationHash -> ShowS # show :: OperationHash -> String # showList :: [OperationHash] -> ShowS #
Show ContractState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> ContractState -> ShowS # show :: ContractState -> String # showList :: [ContractState] -> ShowS #
Show GState
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GState -> ShowS # show :: GState -> String # showList :: [GState] -> ShowS #
Show GStateUpdate
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateUpdate -> ShowS # show :: GStateUpdate -> String # showList :: [GStateUpdate] -> ShowS #
Show GStateUpdateError
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateUpdateError -> ShowS # show :: GStateUpdateError -> String # showList :: [GStateUpdateError] -> ShowS #
Show GStateParseError
Instance details Defined in Morley.Michelson.Runtime.GState Methods showsPrec :: Int -> GStateParseError -> ShowS # show :: GStateParseError -> String # showList :: [GStateParseError] -> ShowS #
Show OriginationOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> OriginationOperation -> ShowS # show :: OriginationOperation -> String # showList :: [OriginationOperation] -> ShowS #
Show SetDelegateOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> SetDelegateOperation -> ShowS # show :: SetDelegateOperation -> String # showList :: [SetDelegateOperation] -> ShowS #
Show TransferOperation
Instance details Defined in Morley.Michelson.Typed.Operation Methods showsPrec :: Int -> TransferOperation -> ShowS # show :: TransferOperation -> String # showList :: [TransferOperation] -> ShowS #
Class () (Show a)
Instance details Defined in Data.Constraint Methods cls :: Show a :- () #
() :=> (Show Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Bool #
() :=> (Show Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Char #
() :=> (Show Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Int #
() :=> (Show Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Natural #
() :=> (Show Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Ordering #
() :=> (Show Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Word #
() :=> (Show ())
Instance details Defined in Data.Constraint Methods ins :: () :- Show () #
() :=> (Show (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (Dict a) #
() :=> (Show (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (a :- b) #
Show a => Show [a]	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> [a] -> ShowS # show :: [a] -> String # showList :: [[a]] -> ShowS #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Show a => Show (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods showsPrec :: Int -> Ratio a -> ShowS # show :: Ratio a -> String # showList :: [Ratio a] -> ShowS #
Show (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> Ptr a -> ShowS # show :: Ptr a -> String # showList :: [Ptr a] -> ShowS #
Show (FunPtr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> FunPtr a -> ShowS # show :: FunPtr a -> String # showList :: [FunPtr a] -> ShowS #
Show p => Show (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Par1 p -> ShowS # show :: Par1 p -> String # showList :: [Par1 p] -> ShowS #
Show a => Show (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> IResult a -> ShowS # show :: IResult a -> String # showList :: [IResult a] -> ShowS #
Show a => Show (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Result a -> ShowS # show :: Result a -> String # showList :: [Result a] -> ShowS #
Show (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods showsPrec :: Int -> ForeignPtr a -> ShowS # show :: ForeignPtr a -> String # showList :: [ForeignPtr a] -> ShowS #
Show a => Show (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods showsPrec :: Int -> Complex a -> ShowS # show :: Complex a -> String # showList :: [Complex a] -> ShowS #
Show a => Show (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Min a -> ShowS # show :: Min a -> String # showList :: [Min a] -> ShowS #
Show a => Show (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Max a -> ShowS # show :: Max a -> String # showList :: [Max a] -> ShowS #
Show a => Show (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show a => Show (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show m => Show (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS #
Show a => Show (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Show a => Show (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods showsPrec :: Int -> ZipList a -> ShowS # show :: ZipList a -> String # showList :: [ZipList a] -> ShowS #
Show a => Show (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Show a => Show (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show a => Show (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show a => Show (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Dual a -> ShowS # show :: Dual a -> String # showList :: [Dual a] -> ShowS #
Show a => Show (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Sum a -> ShowS # show :: Sum a -> String # showList :: [Sum a] -> ShowS #
Show a => Show (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Product a -> ShowS # show :: Product a -> String # showList :: [Product a] -> ShowS #
Show a => Show (Down a)	This instance would be equivalent to the derived instances of the `Down` newtype if the `getDown` field were removed Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods showsPrec :: Int -> Down a -> ShowS # show :: Down a -> String # showList :: [Down a] -> ShowS #
Show a => Show (NonEmpty a)	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> NonEmpty a -> ShowS # show :: NonEmpty a -> String # showList :: [NonEmpty a] -> ShowS #
Show a => Show (Array a)
Instance details Defined in Basement.BoxedArray Methods showsPrec :: Int -> Array a -> ShowS # show :: Array a -> String # showList :: [Array a] -> ShowS #
(PrimType ty, Show ty) => Show (UArray ty)
Instance details Defined in Basement.UArray.Base Methods showsPrec :: Int -> UArray ty -> ShowS # show :: UArray ty -> String # showList :: [UArray ty] -> ShowS #
(PrimType ty, Show ty) => Show (Block ty)
Instance details Defined in Basement.Block.Base Methods showsPrec :: Int -> Block ty -> ShowS # show :: Block ty -> String # showList :: [Block ty] -> ShowS #
Show a => Show (NonEmpty a)
Instance details Defined in Basement.NonEmpty Methods showsPrec :: Int -> NonEmpty a -> ShowS # show :: NonEmpty a -> String # showList :: [NonEmpty a] -> ShowS #
Show (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> Offset ty -> ShowS # show :: Offset ty -> String # showList :: [Offset ty] -> ShowS #
Show (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods showsPrec :: Int -> CountOf ty -> ShowS # show :: CountOf ty -> String # showList :: [CountOf ty] -> ShowS #
Show (Zn64 n)
Instance details Defined in Basement.Bounded Methods showsPrec :: Int -> Zn64 n -> ShowS # show :: Zn64 n -> String # showList :: [Zn64 n] -> ShowS #
Show (Zn n)
Instance details Defined in Basement.Bounded Methods showsPrec :: Int -> Zn n -> ShowS # show :: Zn n -> String # showList :: [Zn n] -> ShowS #
Show (Dict a)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> Dict a -> ShowS # show :: Dict a -> String # showList :: [Dict a] -> ShowS #
Show a => Show (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods showsPrec :: Int -> IntMap a -> ShowS # show :: IntMap a -> String # showList :: [IntMap a] -> ShowS #
Show vertex => Show (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods showsPrec :: Int -> SCC vertex -> ShowS # show :: SCC vertex -> String # showList :: [SCC vertex] -> ShowS #
Show a => Show (Tree a)
Instance details Defined in Data.Tree Methods showsPrec :: Int -> Tree a -> ShowS # show :: Tree a -> String # showList :: [Tree a] -> ShowS #
Show a => Show (Seq a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> Seq a -> ShowS # show :: Seq a -> String # showList :: [Seq a] -> ShowS #
Show a => Show (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewL a -> ShowS # show :: ViewL a -> String # showList :: [ViewL a] -> ShowS #
Show a => Show (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewR a -> ShowS # show :: ViewR a -> String # showList :: [ViewR a] -> ShowS #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
Show (Blake2s bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2s bitlen -> ShowS # show :: Blake2s bitlen -> String # showList :: [Blake2s bitlen] -> ShowS #
Show (Blake2b bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2b bitlen -> ShowS # show :: Blake2b bitlen -> String # showList :: [Blake2b bitlen] -> ShowS #
Show (Blake2sp bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2sp bitlen -> ShowS # show :: Blake2sp bitlen -> String # showList :: [Blake2sp bitlen] -> ShowS #
Show (Blake2bp bitlen)
Instance details Defined in Crypto.Hash.Blake2 Methods showsPrec :: Int -> Blake2bp bitlen -> ShowS # show :: Blake2bp bitlen -> String # showList :: [Blake2bp bitlen] -> ShowS #
Show (SHAKE128 bitlen)
Instance details Defined in Crypto.Hash.SHAKE Methods showsPrec :: Int -> SHAKE128 bitlen -> ShowS # show :: SHAKE128 bitlen -> String # showList :: [SHAKE128 bitlen] -> ShowS #
Show (SHAKE256 bitlen)
Instance details Defined in Crypto.Hash.SHAKE Methods showsPrec :: Int -> SHAKE256 bitlen -> ShowS # show :: SHAKE256 bitlen -> String # showList :: [SHAKE256 bitlen] -> ShowS #
Show (Digest a)
Instance details Defined in Crypto.Hash.Types Methods showsPrec :: Int -> Digest a -> ShowS # show :: Digest a -> String # showList :: [Digest a] -> ShowS #
Show a => Show (CryptoFailable a)
Instance details Defined in Crypto.Error.Types Methods showsPrec :: Int -> CryptoFailable a -> ShowS # show :: CryptoFailable a -> String # showList :: [CryptoFailable a] -> ShowS #
Show1 f => Show (Fix f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Fix f -> ShowS # show :: Fix f -> String # showList :: [Fix f] -> ShowS #
(Functor f, Show1 f) => Show (Mu f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Mu f -> ShowS # show :: Mu f -> String # showList :: [Mu f] -> ShowS #
(Functor f, Show1 f) => Show (Nu f)
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Nu f -> ShowS # show :: Nu f -> String # showList :: [Nu f] -> ShowS #
Show a => Show (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods showsPrec :: Int -> DNonEmpty a -> ShowS # show :: DNonEmpty a -> String # showList :: [DNonEmpty a] -> ShowS #
Show a => Show (DList a)
Instance details Defined in Data.DList.Internal Methods showsPrec :: Int -> DList a -> ShowS # show :: DList a -> String # showList :: [DList a] -> ShowS #
Show a => Show (ExitCase a)
Instance details Defined in Control.Monad.Catch Methods showsPrec :: Int -> ExitCase a -> ShowS # show :: ExitCase a -> String # showList :: [ExitCase a] -> ShowS #
KnownNat p => Show (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods showsPrec :: Int -> Prime p -> ShowS # show :: Prime p -> String # showList :: [Prime p] -> ShowS #
Show (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods showsPrec :: Int -> Binary p -> ShowS # show :: Binary p -> String # showList :: [Binary p] -> ShowS #
Show a => Show (Hashed a)
Instance details Defined in Data.Hashable.Class Methods showsPrec :: Int -> Hashed a -> ShowS # show :: Hashed a -> String # showList :: [Hashed a] -> ShowS #
(Show a, Prim a) => Show (Vector a)
Instance details Defined in Data.Vector.Primitive Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
(Show a, Storable a) => Show (Vector a)
Instance details Defined in Data.Vector.Storable Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
Show a => Show (HashSet a)
Instance details Defined in Data.HashSet.Internal Methods showsPrec :: Int -> HashSet a -> ShowS # show :: HashSet a -> String # showList :: [HashSet a] -> ShowS #
Show a => Show (Vector a)
Instance details Defined in Data.Vector Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
Show t => Show (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ErrorItem t -> ShowS # show :: ErrorItem t -> String # showList :: [ErrorItem t] -> ShowS #
Show e => Show (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ErrorFancy e -> ShowS # show :: ErrorFancy e -> String # showList :: [ErrorFancy e] -> ShowS #
Show s => Show (PosState s)
Instance details Defined in Text.Megaparsec.State Methods showsPrec :: Int -> PosState s -> ShowS # show :: PosState s -> String # showList :: [PosState s] -> ShowS #
KnownNat m => Show (Mod m)
Instance details Defined in Data.Mod Methods showsPrec :: Int -> Mod m -> ShowS # show :: Mod m -> String # showList :: [Mod m] -> ShowS #
Show (Option a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Show h => Show (ParserFailure h)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserFailure h -> ShowS # show :: ParserFailure h -> String # showList :: [ParserFailure h] -> ShowS #
Show a => Show (ParserResult a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserResult a -> ShowS # show :: ParserResult a -> String # showList :: [ParserResult a] -> ShowS #
Show a => Show (OptTree a)
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptTree a -> ShowS # show :: OptTree a -> String # showList :: [OptTree a] -> ShowS #
Show (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Doc a -> ShowS # show :: Doc a -> String # showList :: [Doc a] -> ShowS #
Show a => Show (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> AnnotDetails a -> ShowS # show :: AnnotDetails a -> String # showList :: [AnnotDetails a] -> ShowS #
Show a => Show (Span a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Span a -> ShowS # show :: Span a -> String # showList :: [Span a] -> ShowS #
(Show a, Prim a) => Show (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods showsPrec :: Int -> PrimArray a -> ShowS # show :: PrimArray a -> String # showList :: [PrimArray a] -> ShowS #
Show a => Show (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS # show :: SmallArray a -> String # showList :: [SmallArray a] -> ShowS #
Show a => Show (Array a)
Instance details Defined in Data.Primitive.Array Methods showsPrec :: Int -> Array a -> ShowS # show :: Array a -> String # showList :: [Array a] -> ShowS #
Show g => Show (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> AtomicGen g -> ShowS # show :: AtomicGen g -> String # showList :: [AtomicGen g] -> ShowS #
Show g => Show (IOGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> IOGen g -> ShowS # show :: IOGen g -> String # showList :: [IOGen g] -> ShowS #
Show g => Show (STGen g)
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> STGen g -> ShowS # show :: STGen g -> String # showList :: [STGen g] -> ShowS #
Show g => Show (StateGen g)
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StateGen g -> ShowS # show :: StateGen g -> String # showList :: [StateGen g] -> ShowS #
Show a => Show (Add a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Add a -> ShowS # show :: Add a -> String # showList :: [Add a] -> ShowS #
Show a => Show (Mul a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> Mul a -> ShowS # show :: Mul a -> String # showList :: [Mul a] -> ShowS #
Show a => Show (WrappedNum a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> WrappedNum a -> ShowS # show :: WrappedNum a -> String # showList :: [WrappedNum a] -> ShowS #
Show (IntSetOf a)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> IntSetOf a -> ShowS # show :: IntSetOf a -> String # showList :: [IntSetOf a] -> ShowS #
Show a => Show (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Show a => Show (Identity a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Show a => Show (Thunk a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Thunk a -> ShowS # show :: Thunk a -> String # showList :: [Thunk a] -> ShowS #
(Show t, KnownSymbol s) => Show (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> ElField '(s, t) -> ShowS # show :: ElField '(s, t) -> String # showList :: [ElField '(s, t)] -> ShowS #
Show (Label name)
Instance details Defined in Morley.Util.Label Methods showsPrec :: Int -> Label name -> ShowS # show :: Label name -> String # showList :: [Label name] -> ShowS #
Show (AnnotatedValue v)
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods showsPrec :: Int -> AnnotatedValue v -> ShowS # show :: AnnotatedValue v -> String # showList :: [AnnotatedValue v] -> ShowS #
Show (Notes t)
Instance details Defined in Morley.Michelson.Typed.Annotation Methods showsPrec :: Int -> Notes t -> ShowS # show :: Notes t -> String # showList :: [Notes t] -> ShowS #
Show (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> ParamNotes t -> ShowS # show :: ParamNotes t -> String # showList :: [ParamNotes t] -> ShowS #
Show (SomeEntrypointCallT arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> SomeEntrypointCallT arg -> ShowS # show :: SomeEntrypointCallT arg -> String # showList :: [SomeEntrypointCallT arg] -> ShowS #
Show (SomeConstrainedValue c)
Instance details Defined in Morley.Michelson.Typed.Existential Methods showsPrec :: Int -> SomeConstrainedValue c -> ShowS # show :: SomeConstrainedValue c -> String # showList :: [SomeConstrainedValue c] -> ShowS #
Show (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
Show arg => Show (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> Ticket arg -> ShowS # show :: Ticket arg -> String # showList :: [Ticket arg] -> ShowS #
Show (ExtInstr s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> ExtInstr s -> ShowS # show :: ExtInstr s -> String # showList :: [ExtInstr s] -> ShowS #
Show (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> PrintComment st -> ShowS # show :: PrintComment st -> String # showList :: [PrintComment st] -> ShowS #
Show (StackRef st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> StackRef st -> ShowS # show :: StackRef st -> String # showList :: [StackRef st] -> ShowS #
Show (TestAssert s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> TestAssert s -> ShowS # show :: TestAssert s -> String # showList :: [TestAssert s] -> ShowS #
Show (CtorEffectsApp x)
Instance details Defined in Morley.Michelson.Typed.Util Methods showsPrec :: Int -> CtorEffectsApp x -> ShowS # show :: CtorEffectsApp x -> String # showList :: [CtorEffectsApp x] -> ShowS #
Show (DfsSettings x)
Instance details Defined in Morley.Michelson.Typed.Util Methods showsPrec :: Int -> DfsSettings x -> ShowS # show :: DfsSettings x -> String # showList :: [DfsSettings x] -> ShowS #
Show (Operation' instr)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> Operation' instr -> ShowS # show :: Operation' instr -> String # showList :: [Operation' instr] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (SomeViewsSet' instr)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> SomeViewsSet' instr -> ShowS # show :: SomeViewsSet' instr -> String # showList :: [SomeViewsSet' instr] -> ShowS #
Show op => Show (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> Contract' op -> ShowS # show :: Contract' op -> String # showList :: [Contract' op] -> ShowS #
Show op => Show (ContractBlock op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods showsPrec :: Int -> ContractBlock op -> ShowS # show :: ContractBlock op -> String # showList :: [ContractBlock op] -> ShowS #
Show op => Show (ExtInstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> ExtInstrAbstract op -> ShowS # show :: ExtInstrAbstract op -> String # showList :: [ExtInstrAbstract op] -> ShowS #
Show op => Show (TestAssert op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods showsPrec :: Int -> TestAssert op -> ShowS # show :: TestAssert op -> String # showList :: [TestAssert op] -> ShowS #
RenderDoc (InstrAbstract op) => Show (InstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Instr Methods showsPrec :: Int -> InstrAbstract op -> ShowS # show :: InstrAbstract op -> String # showList :: [InstrAbstract op] -> ShowS #
Show op => Show (Elt op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> Elt op -> ShowS # show :: Elt op -> String # showList :: [Elt op] -> ShowS #
Show op => Show (Value' op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods showsPrec :: Int -> Value' op -> ShowS # show :: Value' op -> String # showList :: [Value' op] -> ShowS #
Show op => Show (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Methods showsPrec :: Int -> View' op -> ShowS # show :: View' op -> String # showList :: [View' op] -> ShowS #
Show (SingNat n)
Instance details Defined in Morley.Util.Peano Methods showsPrec :: Int -> SingNat n -> ShowS # show :: SingNat n -> String # showList :: [SingNat n] -> ShowS #
Show (PeanoNatural n)
Instance details Defined in Morley.Util.PeanoNatural Methods showsPrec :: Int -> PeanoNatural n -> ShowS # show :: PeanoNatural n -> String # showList :: [PeanoNatural n] -> ShowS #
Show (EpCallingDesc info) Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods showsPrec :: Int -> EpCallingDesc info -> ShowS # show :: EpCallingDesc info -> String # showList :: [EpCallingDesc info] -> ShowS #
Show a => Show (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods showsPrec :: Int -> StringEncode a -> ShowS # show :: StringEncode a -> String # showList :: [StringEncode a] -> ShowS #
Show (HST ts)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> HST ts -> ShowS # show :: HST ts -> String # showList :: [HST ts] -> ShowS #
Show (ExtInstr inp) => Show (SomeInstr inp)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeInstr inp -> ShowS # show :: SomeInstr inp -> String # showList :: [SomeInstr inp] -> ShowS #
Show (ExtInstr inp) => Show (SomeInstrOut inp)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods showsPrec :: Int -> SomeInstrOut inp -> ShowS # show :: SomeInstrOut inp -> String # showList :: [SomeInstrOut inp] -> ShowS #
Show a => Show (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> ReadTicket a -> ShowS # show :: ReadTicket a -> String # showList :: [ReadTicket a] -> ShowS #
Show a => Show (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> OpenChestT a -> ShowS # show :: OpenChestT a -> String # showList :: [OpenChestT a] -> ShowS #
Show (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> TSignature a -> ShowS # show :: TSignature a -> String # showList :: [TSignature a] -> ShowS #
Show (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Packed a -> ShowS # show :: Packed a -> String # showList :: [Packed a] -> ShowS #
Show (CustomErrorRep tag) => Show (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> CustomError tag -> ShowS # show :: CustomError tag -> String # showList :: [CustomError tag] -> ShowS #
Show (ConstrainedSome Show) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> ConstrainedSome Show -> ShowS # show :: ConstrainedSome Show -> String # showList :: [ConstrainedSome Show] -> ShowS #
Show (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods showsPrec :: Int -> UParam entries -> ShowS # show :: UParam entries -> String # showList :: [UParam entries] -> ShowS #
Show (StkEl t)
Instance details Defined in Morley.Michelson.Interpret Methods showsPrec :: Int -> StkEl t -> ShowS # show :: StkEl t -> String # showList :: [StkEl t] -> ShowS #
(Show a) :=> (Show (Complex a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Complex a) #
(Show a) :=> (Show [a])
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show [a] #
(Show a) :=> (Show (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Maybe a) #
(Show a) :=> (Show (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Identity a) #
(Show a) :=> (Show (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Const a b) #
Show (CustomErrorRep tag) => Show (() -> CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods showsPrec :: Int -> (() -> CustomError tag) -> ShowS # show :: (() -> CustomError tag) -> String # showList :: [() -> CustomError tag] -> ShowS #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
Show (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> V1 p -> ShowS # show :: V1 p -> String # showList :: [V1 p] -> ShowS #
Show (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> U1 p -> ShowS # show :: U1 p -> String # showList :: [U1 p] -> ShowS #
Show (TypeRep a)
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> TypeRep a -> ShowS # show :: TypeRep a -> String # showList :: [TypeRep a] -> ShowS #
(Show a, Show b) => Show (a, b)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b) -> ShowS # show :: (a, b) -> String # showList :: [(a, b)] -> ShowS #
Show (ST s a)	Since: base-2.1
Instance details Defined in GHC.ST Methods showsPrec :: Int -> ST s a -> ShowS # show :: ST s a -> String # showList :: [ST s a] -> ShowS #
(Show k, Show v) => Show (HashMap k v)
Instance details Defined in Data.HashMap.Internal Methods showsPrec :: Int -> HashMap k v -> ShowS # show :: HashMap k v -> String # showList :: [HashMap k v] -> ShowS #
(Show 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 #
(Show i, Show r) => Show (IResult i r)
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> IResult i r -> ShowS # show :: IResult i r -> String # showList :: [IResult i r] -> ShowS #
HasResolution a => Show (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods showsPrec :: Int -> Fixed a -> ShowS # show :: Fixed a -> String # showList :: [Fixed a] -> ShowS #
(Show a, Show b) => Show (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Arg a b -> ShowS # show :: Arg a b -> String # showList :: [Arg a b] -> ShowS #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Show a => Show (ListN n a)
Instance details Defined in Basement.Sized.List Methods showsPrec :: Int -> ListN n a -> ShowS # show :: ListN n a -> String # showList :: [ListN n a] -> ShowS #
(Show a, Show b) => Show (Bimap a b)
Instance details Defined in Data.Bimap Methods showsPrec :: Int -> Bimap a b -> ShowS # show :: Bimap a b -> String # showList :: [Bimap a b] -> ShowS #
Show (a :- b)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> (a :- b) -> ShowS # show :: (a :- b) -> String # showList :: [a :- b] -> ShowS #
(Show1 m, Show a) => Show (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods showsPrec :: Int -> MaybeT m a -> ShowS # show :: MaybeT m a -> String # showList :: [MaybeT m a] -> ShowS #
(Show1 f, Show a) => Show (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods showsPrec :: Int -> Cofree f a -> ShowS # show :: Cofree f a -> String # showList :: [Cofree f a] -> ShowS #
(Show1 f, Show a) => Show (Free f a)
Instance details Defined in Control.Monad.Free Methods showsPrec :: Int -> Free f a -> ShowS # show :: Free f a -> String # showList :: [Free f a] -> ShowS #
Show k => Show (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods showsPrec :: Int -> RootsOfUnity n k -> ShowS # show :: RootsOfUnity n k -> String # showList :: [RootsOfUnity n k] -> ShowS #
Show k => Show (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods showsPrec :: Int -> Extension p k -> ShowS # show :: Extension p k -> String # showList :: [Extension p k] -> ShowS #
Show (f a) => Show (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods showsPrec :: Int -> Yoneda f a -> ShowS # show :: Yoneda f a -> String # showList :: [Yoneda f a] -> ShowS #
(Show s, Show (Token s), Show e) => Show (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseErrorBundle s e -> ShowS # show :: ParseErrorBundle s e -> String # showList :: [ParseErrorBundle s e] -> ShowS #
(Show (ParseError s e), Show s) => Show (State s e)
Instance details Defined in Text.Megaparsec.State Methods showsPrec :: Int -> State s e -> ShowS # show :: State s e -> String # showList :: [State s e] -> ShowS #
(Show (Token s), Show e) => Show (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseError s e -> ShowS # show :: ParseError s e -> String # showList :: [ParseError s e] -> ShowS #
(Show a, Vector v a) => Show (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods showsPrec :: Int -> Poly v a -> ShowS # show :: Poly v a -> String # showList :: [Poly v a] -> ShowS #
Show v => Show (IntMapOf k v)
Instance details Defined in Data.Semiring Methods showsPrec :: Int -> IntMapOf k v -> ShowS # show :: IntMapOf k v -> String # showList :: [IntMapOf k v] -> ShowS #
ShowSing (Maybe a) => Show (SFirst z)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods showsPrec :: Int -> SFirst z -> ShowS # show :: SFirst z -> String # showList :: [SFirst z] -> ShowS #
ShowSing (Maybe a) => Show (SLast z)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods showsPrec :: Int -> SLast z -> ShowS # show :: SLast z -> String # showList :: [SLast z] -> ShowS #
(Show a, Show b) => Show (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods showsPrec :: Int -> Pair a b -> ShowS # show :: Pair a b -> String # showList :: [Pair a b] -> ShowS #
(Show a, Show b) => Show (These a b)
Instance details Defined in Data.Strict.These Methods showsPrec :: Int -> These a b -> ShowS # show :: These a b -> String # showList :: [These a b] -> ShowS #
(Show a, Show b) => Show (Either a b)
Instance details Defined in Data.Strict.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
(Show a, Show b) => Show (These a b)
Instance details Defined in Data.These Methods showsPrec :: Int -> These a b -> ShowS # show :: These a b -> String # showList :: [These a b] -> ShowS #
(Show n, Show m) => Show (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Methods showsPrec :: Int -> ArithError n m -> ShowS # show :: ArithError n m -> String # showList :: [ArithError n m] -> ShowS #
Show (EntrypointCallT param arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EntrypointCallT param arg -> ShowS # show :: EntrypointCallT param arg -> String # showList :: [EntrypointCallT param arg] -> ShowS #
Show (EpLiftSequence arg param)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods showsPrec :: Int -> EpLiftSequence arg param -> ShowS # show :: EpLiftSequence arg param -> String # showList :: [EpLiftSequence arg param] -> ShowS #
(Show k, Show v) => Show (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMap k v -> ShowS # show :: BigMap k v -> String # showList :: [BigMap k v] -> ShowS #
Show (Instr inp out)
Instance details Defined in Morley.Michelson.Typed.Instr Methods showsPrec :: Int -> Instr inp out -> ShowS # show :: Instr inp out -> String # showList :: [Instr inp out] -> ShowS #
Show (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> TransferTokens instr p -> ShowS # show :: TransferTokens instr p -> String # showList :: [TransferTokens instr p] -> ShowS #
Show (Value' instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> Value' instr t -> ShowS # show :: Value' instr t -> String # showList :: [Value' instr t] -> ShowS #
(forall (arg :: T) (ret :: T). Show (ViewCode' instr arg st ret)) => Show (SomeView' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> SomeView' instr st -> ShowS # show :: SomeView' instr st -> String # showList :: [SomeView' instr st] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> ViewsSet' instr st -> ShowS # show :: ViewsSet' instr st -> String # showList :: [ViewsSet' instr st] -> ShowS #
KnownAnnTag tag => Show (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods showsPrec :: Int -> Annotation tag -> ShowS # show :: Annotation tag -> String # showList :: [Annotation tag] -> ShowS #
(forall (a :: k). Show (f a)) => Show (Some1 f)
Instance details Defined in Morley.Util.Type Methods showsPrec :: Int -> Some1 f -> ShowS # show :: Some1 f -> String # showList :: [Some1 f] -> ShowS #
Show (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> (inp :-> out) -> ShowS # show :: (inp :-> out) -> String # showList :: [inp :-> out] -> ShowS #
Show (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods showsPrec :: Int -> TAddress p vd -> ShowS # show :: TAddress p vd -> String # showList :: [TAddress p vd] -> ShowS #
HasResolution a => Show (NFixed a) Source #
Instance details Defined in Lorentz.Value Methods showsPrec :: Int -> NFixed a -> ShowS # show :: NFixed a -> String # showList :: [NFixed a] -> ShowS #
Show (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods showsPrec :: Int -> Hash alg a -> ShowS # show :: Hash alg a -> String # showList :: [Hash alg a] -> ShowS #
Show (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Methods showsPrec :: Int -> Extensible x -> ShowS # show :: Extensible x -> String # showList :: [Extensible x] -> ShowS #
Show a => Show (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> Void_ a b -> ShowS # show :: Void_ a b -> String # showList :: [Void_ a b] -> ShowS #
Show a => Show (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods showsPrec :: Int -> View_ a r -> ShowS # show :: View_ a r -> String # showList :: [View_ a r] -> ShowS #
(Integral a, Show a) :=> (Show (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: (Integral a, Show a) :- Show (Ratio a) #
(Show a, Show b) :=> (Show (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (a, b) #
(Show a, Show b) :=> (Show (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (Either a b) #
Show (f p) => Show (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Rec1 f p -> ShowS # show :: Rec1 f p -> String # showList :: [Rec1 f p] -> ShowS #
Show (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Char p -> ShowS # show :: URec Char p -> String # showList :: [URec Char p] -> ShowS #
Show (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Double p -> ShowS # show :: URec Double p -> String # showList :: [URec Double p] -> ShowS #
Show (URec Float p)
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Float p -> ShowS # show :: URec Float p -> String # showList :: [URec Float p] -> ShowS #
Show (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Int p -> ShowS # show :: URec Int p -> String # showList :: [URec Int p] -> ShowS #
Show (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Word p -> ShowS # show :: URec Word p -> String # showList :: [URec Word p] -> ShowS #
(Show a, Show b, Show c) => Show (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c) -> ShowS # show :: (a, b, c) -> String # showList :: [(a, b, c)] -> ShowS #
Show a => Show (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `getConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
Show (f a) => Show (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Ap f a -> ShowS # show :: Ap f a -> String # showList :: [Ap f a] -> ShowS #
Show (f a) => Show (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Alt f a -> ShowS # show :: Alt f a -> String # showList :: [Alt f a] -> ShowS #
Show (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~: b) -> ShowS # show :: (a :~: b) -> String # showList :: [a :~: b] -> ShowS #
Show (p a a) => Show (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods showsPrec :: Int -> Join p a -> ShowS # show :: Join p a -> String # showList :: [Join p a] -> ShowS #
Show (p (Fix p a) a) => Show (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods showsPrec :: Int -> Fix p a -> ShowS # show :: Fix p a -> String # showList :: [Fix p a] -> ShowS #
(Show1 f, Show a) => Show (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods showsPrec :: Int -> IdentityT f a -> ShowS # show :: IdentityT f a -> String # showList :: [IdentityT f a] -> ShowS #
(Show e, Show1 m, Show a) => Show (ExceptT e m a)
Instance details Defined in Control.Monad.Trans.Except Methods showsPrec :: Int -> ExceptT e m a -> ShowS # show :: ExceptT e m a -> String # showList :: [ExceptT e m a] -> ShowS #
(Show a, Show (f b)) => Show (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeF f a b -> ShowS # show :: FreeF f a b -> String # showList :: [FreeF f a b] -> ShowS #
(Show1 f, Show1 m, Show a) => Show (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeT f m a -> ShowS # show :: FreeT f m a -> String # showList :: [FreeT f m a] -> ShowS #
(Show a, Show (f b)) => Show (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeF f a b -> ShowS # show :: CofreeF f a b -> String # showList :: [CofreeF f a b] -> ShowS #
Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeT f w a -> ShowS # show :: CofreeT f w a -> String # showList :: [CofreeT f w a] -> ShowS #
(Show e, Show1 m, Show a) => Show (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods showsPrec :: Int -> ErrorT e m a -> ShowS # show :: ErrorT e m a -> String # showList :: [ErrorT e m a] -> ShowS #
Show b => Show (Tagged s b)
Instance details Defined in Data.Tagged Methods showsPrec :: Int -> Tagged s b -> ShowS # show :: Tagged s b -> String # showList :: [Tagged s b] -> ShowS #
(ShowSing a, ShowSing b) => Show (SArg z)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods showsPrec :: Int -> SArg z -> ShowS # show :: SArg z -> String # showList :: [SArg z] -> ShowS #
Show (SProxy z)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods showsPrec :: Int -> SProxy z -> ShowS # show :: SProxy z -> String # showList :: [SProxy z] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (These1 f g a)
Instance details Defined in Data.Functor.These Methods showsPrec :: Int -> These1 f g a -> ShowS # show :: These1 f g a -> String # showList :: [These1 f g a] -> ShowS #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Show (Rec f rs)) => Show (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods showsPrec :: Int -> ARec f rs -> ShowS # show :: ARec f rs -> String # showList :: [ARec f rs] -> ShowS #
(RMap rs, ReifyConstraint Show f rs, RecordToList rs) => Show (Rec f rs)	Records may be shown insofar as their points may be shown. `reifyConstraint` is used to great effect here.
Instance details Defined in Data.Vinyl.Core Methods showsPrec :: Int -> Rec f rs -> ShowS # show :: Rec f rs -> String # showList :: [Rec f rs] -> ShowS #
Show a => Show (Const a b)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
(forall (i :: [T]) (o :: [T]). Show (instr i o)) => Show (Contract' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods showsPrec :: Int -> Contract' instr cp st -> ShowS # show :: Contract' instr cp st -> String # showList :: [Contract' instr cp st] -> ShowS #
Show (CreateContract instr cp st)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> CreateContract instr cp st -> ShowS # show :: CreateContract instr cp st -> String # showList :: [CreateContract instr cp st] -> ShowS #
Show (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods showsPrec :: Int -> Contract cp st vd -> ShowS # show :: Contract cp st vd -> String # showList :: [Contract cp st vd] -> ShowS #
Show c => Show (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> K1 i c p -> ShowS # show :: K1 i c p -> String # showList :: [K1 i c p] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :+: g) p -> ShowS # show :: (f :+: g) p -> String # showList :: [(f :+: g) p] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :: g) p -> ShowS # show :: (f :: g) p -> String # showList :: [(f :*: g) p] -> ShowS #
(Show a, Show b, Show c, Show d) => Show (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d) -> ShowS # show :: (a, b, c, d) -> String # showList :: [(a, b, c, d)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods showsPrec :: Int -> Product f g a -> ShowS # show :: Product f g a -> String # showList :: [Product f g a] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods showsPrec :: Int -> Sum f g a -> ShowS # show :: Sum f g a -> String # showList :: [Sum f g a] -> ShowS #
Show (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~~: b) -> ShowS # show :: (a :~~: b) -> String # showList :: [a :~~: b] -> ShowS #
Show (BigMapId k2 v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMapId k2 v -> ShowS # show :: BigMapId k2 v -> String # showList :: [BigMapId k2 v] -> ShowS #
(forall (o' :: k). Show (instr i o')) => Show (RemFail instr i o)
Instance details Defined in Morley.Michelson.Typed.Value Methods showsPrec :: Int -> RemFail instr i o -> ShowS # show :: RemFail instr i o -> String # showList :: [RemFail instr i o] -> ShowS #
Show (ViewCode' instr arg st ret) => Show (View' instr arg st ret)
Instance details Defined in Morley.Michelson.Typed.View Methods showsPrec :: Int -> View' instr arg st ret -> ShowS # show :: View' instr arg st ret -> String # showList :: [View' instr arg st ret] -> ShowS #
Show (f p) => Show (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> M1 i c f p -> ShowS # show :: M1 i c f p -> String # showList :: [M1 i c f p] -> ShowS #
Show (f (g p)) => Show ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :.: g) p -> ShowS # show :: (f :.: g) p -> String # showList :: [(f :.: g) p] -> ShowS #
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e) -> ShowS # show :: (a, b, c, d, e) -> String # showList :: [(a, b, c, d, e)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods showsPrec :: Int -> Compose f g a -> ShowS # show :: Compose f g a -> String # showList :: [Compose f g a] -> ShowS #
Show (p a b) => Show (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods showsPrec :: Int -> WrappedBifunctor p a b -> ShowS # show :: WrappedBifunctor p a b -> String # showList :: [WrappedBifunctor p a b] -> ShowS #
Show (g b) => Show (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods showsPrec :: Int -> Joker g a b -> ShowS # show :: Joker g a b -> String # showList :: [Joker g a b] -> ShowS #
Show (p b a) => Show (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods showsPrec :: Int -> Flip p a b -> ShowS # show :: Flip p a b -> String # showList :: [Flip p a b] -> ShowS #
Show (f a) => Show (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods showsPrec :: Int -> Clown f a b -> ShowS # show :: Clown f a b -> String # showList :: [Clown f a b] -> ShowS #
Show (f (g a)) => Show (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods showsPrec :: Int -> Compose f g a -> ShowS # show :: Compose f g a -> String # showList :: [Compose f g a] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS # show :: (a, b, c, d, e, f) -> String # showList :: [(a, b, c, d, e, f)] -> ShowS #
(Show (p a b), Show (q a b)) => Show (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods showsPrec :: Int -> Sum p q a b -> ShowS # show :: Sum p q a b -> String # showList :: [Sum p q a b] -> ShowS #
(Show (f a b), Show (g a b)) => Show (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods showsPrec :: Int -> Product f g a b -> ShowS # show :: Product f g a b -> String # showList :: [Product f g a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS # show :: (a, b, c, d, e, f, g) -> String # showList :: [(a, b, c, d, e, f, g)] -> ShowS #
Show (f (p a b)) => Show (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f p a b -> ShowS # show :: Tannen f p a b -> String # showList :: [Tannen f p a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS # show :: (a, b, c, d, e, f, g, h) -> String # showList :: [(a, b, c, d, e, f, g, h)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS # show :: (a, b, c, d, e, f, g, h, i) -> String # showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS #
Show (p (f a) (g b)) => Show (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods showsPrec :: Int -> Biff p f g a b -> ShowS # show :: Biff p f g a b -> String # showList :: [Biff p f g a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS #

class 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 Morley.Michelson.Untyped.Contract Methods def :: EntriesOrder #
Default InstrCallStack
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: InstrCallStack #
Default Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: Pos #
Default SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods def :: SrcPos #
Default OptimizerConf
Instance details Defined in Morley.Michelson.Optimizer Methods def :: OptimizerConf #
Default TypeCheckOptions
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods def :: TypeCheckOptions #
Default MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods def :: MorleyLogsBuilder #
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 Morley.Michelson.Typed.Util Methods def :: DfsSettings x #
Default a => Default (Parser a)
Instance details Defined in Morley.Michelson.Parser.Types Methods def :: Parser 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 Morley.Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
Default (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods def :: ViewsSet' instr st #
Default (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods def :: Annotation tag #
(Default 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 Morley.Util.Label Methods fromLabel :: Label name #
Eq (Label name)
Instance details Defined in Morley.Util.Label Methods (==) :: Label name -> Label name -> Bool # (/=) :: Label name -> Label name -> Bool #
Show (Label name)
Instance details Defined in Morley.Util.Label Methods showsPrec :: Int -> Label name -> ShowS # show :: Label name -> String # showList :: [Label name] -> ShowS #
Buildable (Label name)
Instance details Defined in Morley.Util.Label Methods build :: Label name -> Builder #

newtype PrintAsValue a Source #

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

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

Constructors

PrintAsValue a

Instances

Instances details

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