Safe Haskell	None
Language	Haskell2010

Lorentz.Run.Simple

Description

Running Lorentz code easily.

For testing and demonstration purposes.

Synopsis

(-$?) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out) => (inps :-> '[out]) -> ZippedStack inps -> Either MichelsonFailureWithStack out
(-$) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => (inps :-> '[out]) -> ZippedStack inps -> out
(&?-) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out) => ZippedStack inps -> (inps :-> '[out]) -> Either MichelsonFailureWithStack out
(&-) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => ZippedStack inps -> (inps :-> '[out]) -> out
(<-$>) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => (inps :-> '[out]) -> [ZippedStack inps] -> [out]
data ZippedStackRepr a b = a ::: b
data ZSNil = ZSNil

Documentation

(-$?) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out) => (inps :-> '[out]) -> ZippedStack inps -> Either MichelsonFailureWithStack out infixr 2 Source #

Run a lambda with given input.

Note that this always returns one value, but can accept multiple input values (in such case they are grouped into nested pairs).

For testing and demonstration purposes.

(-$) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => (inps :-> '[out]) -> ZippedStack inps -> out infixr 2 Source #

Like -$?, assumes that no failure is possible.

For testing and demonstration purposes. Note, that we specify the result type of polymorphic operations to avoid ambiguity arising from polymorphic literals.

Use ZippedStackRepr to represent stack of two or more elements, and ZSNil for empty stacks. Stacks of one element are represented by the element itself.

>>> nop -$ 5
5
>>> sub -$ 3 ::: 2 :: Integer
1
>>> push 9 -$ ZSNil
9
>>> add # add -$ 1 ::: 2 ::: 3 :: Integer
6

(&?-) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out) => ZippedStack inps -> (inps :-> '[out]) -> Either MichelsonFailureWithStack out infixl 2 Source #

Version of (-$?) with arguments flipped.

(&-) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => ZippedStack inps -> (inps :-> '[out]) -> out infixl 2 Source #

Version of (-$) with arguments flipped.

(<-$>) :: (ZipInstr inps, IsoValue (ZippedStack inps), IsoValue out, HasCallStack) => (inps :-> '[out]) -> [ZippedStack inps] -> [out] infixl 2 Source #

Version of (-$) applicable to a series of values.

data ZippedStackRepr a b Source #

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

Constructors

a ::: b infixr 5

Instances

Instances details

(Eq a, Eq b) => Eq (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool # (/=) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool #
(Show a, Show b) => Show (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods showsPrec :: Int -> ZippedStackRepr a b -> ShowS # show :: ZippedStackRepr a b -> String # showList :: [ZippedStackRepr a b] -> ShowS #
Generic (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep (ZippedStackRepr a b) :: Type -> Type # Methods from :: ZippedStackRepr a b -> Rep (ZippedStackRepr a b) x # to :: Rep (ZippedStackRepr a b) x -> ZippedStackRepr a b #
(IsoValue a, IsoValue b) => IsoValue (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT (ZippedStackRepr a b) :: T # Methods toVal :: ZippedStackRepr a b -> Value (ToT (ZippedStackRepr a b)) # fromVal :: Value (ToT (ZippedStackRepr a b)) -> ZippedStackRepr a b #
type Rep (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip type Rep (ZippedStackRepr a b) = D1 ('MetaData "ZippedStackRepr" "Lorentz.Zip" "lorentz-0.13.4-inplace" 'False) (C1 ('MetaCons ":::" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 b)))
type ToT (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip type ToT (ZippedStackRepr a b) = GValueType (Rep (ZippedStackRepr a b))

data ZSNil Source #

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

Constructors

ZSNil

Instances

Instances details

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