#*      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                              ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmdN!%ih&  _`ba'g(.-,+*)('&%$#"! ) WV*UTSRQP+,- .}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpqsrtuwxyz{|~v     /0123456789:;<=>?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvulkmnwojri!%ih&  _`ba'g(.-,+*)('&%$#"! ) WV*UTSRQP+,- .}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpqsrtuwxyz{|~v     /0123456789:;<=>?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvulkmnwojriNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm{>[`GHI^]t|*!"#$%       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmcdnopqrstuwvxyz{|}~      '( !"#$%&'()*+,-./0123456789:;<=>?>?@AABDCCDEFFGIJHIJKLMNONOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     &)>[`GHI^]t|*!"#$%       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmcdnopqrstuwvxyz{|}~      '( !"#$%&'()*+,-./0123456789:;<=>?>?@AABDCCDEFFGIJHIJKLMNONOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     &)None8!"#$%&'*+,-./12456789;<=>?@ACHMNPSUVX_`befgkm;+indigoResulting state of IndigoM.-indigoInterpreter output value.indigoInterpreter meta data./indigoGenerated Lorentz code.0indigoClearing Lorentz code.2indigoInitial state of ;.4indigo"Stack of the symbolic interpreter.5indigoNumber of allocated variables.6indigo"Stack of the symbolic interpreter.7indigo*Stack element of the symbolic interpreter.GIt holds either a reference index that refers to this element or just 8;, indicating that there are no references to this element.:indigoReference id to a stack cell;indigo#IndigoState monad. It's basically  `https://hackage.haskell.org/package/category-extras-0.53.5/docs/Control-Monad-Indexed-State.htmlControl.Monad.Indexed.StateG , however this package is not in the used lts and it doesn't compile.It takes as input a 2( (for the initial state) and returns a +: (for the resulting state and the generated Lorentz code).nIndigoState has to be used to write backend typed Lorentz code from the corresponding frontend constructions.?indigoReturn for rebindable syntax.@indigoBind for rebindable syntax.%It's basically like the bind for the 6 monad, but it also composes the generated code from m a and a -> m b.BindigoThen for rebindable syntax.Cindigo Get current 2.DindigoPut new +.FindigofProduces the generated Lorentz code that cleans after itself, leaving the same stack as the input oneu+,-./0123456789:;<=>?@ABCDEF;<=>@ABu?CD:7896+,-./02345EF1None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmRindigo%Allows to get a variable with storageSindigo(Allows to get a variable with operationsindigo.Decide whether type is either primitive or ADTindigo5Type class instantiated for all possible Indigo typesXindigoLike [+, but this one doesn't keep name of a fieldZindigoVariable exposed to a user.Z/ represents the tree of fields. Each field is Z) itself: either a value on the stack or  of its direct fields.[indigoHAuxiliary datatype to define a variable. Keeps field name as type paramindigoLAuxiliary type family to convert list of field names to list of field types^indigoyA object that can be either stored in the single stack cell or split into fields. Fields are identified by their names.f3 is a functor to be applied to each of field names._indigoJValue stored on the stack, it might be either complex product type, like (a, b)", Storage, etc, or sum type like U, or primitive like B, , etc. Laziness of :) is needed here to make possible to put 21 in a variable. This is used as a workaround in Indigo.Compilation.Lambda.`indigoGDecomposed product type, which is NOT stored as one cell on the stack.aindigo?Convert a list of fields from name-based list to type-based onebindigo@Convert a list of fields from type-based list to named-based onegindigoGiven a 2 and a Peano& singleton for a depth, it puts a new Z< at that depth (0-indexed) and returns it with the updated 2.If there is a Z" there already it is used and the 2 not changed.hindigo>Create a variable referencing the element on top of the stack.iindigo_Push a new stack element with a reference to it. Return the variable referencing this element.jindigo3Push a new stack element without a reference to it.kindigo\Remove the top element of the stack. It's supposed that no variable refers to this element.lindigo>Return a variable which refers to a stack cell with operationsmindigo;Return a variable which refers to a stack cell with storageRSTUVWXYZ[\]^_`abcdefghijklm^_`[\]XYVZabdeWfUcghijkTSlRmNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmٙ indigoSimple datatype used to keep a  and its 3 constraintindigoStack representation of  used for constraint checkingindigo-Keeps the 0-indexed depth of a variable as a  letonrindigo'Puts a copy of the value for the given Var on top of the stacksindigoSets the value for the given Var" to the topmost value on the stacktindigo Updates the value for the given VarI with the topmost value on the stack using the given binary instruction.uindigoGiven a stack with a list of .s on its bottom, updates it by appending the  on the top.indigoLike r , but requires the depth of the Var in the input stackindigoLike s , but requires the depth of the Var in the input stackindigoLike t , but requires the depth of the Var in the input stackindigoCalculates the  of the given Var in the stackrstuvwrstuvwNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm۷!%ih&  _`ba'(.-,+*)('&%$#"! ) V*UTQP+,-.}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpsrtuwxyz{|~v     /013456789:;<=?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvumnwojri!%ih&  _`ba'(.-,+*)('&%$#"! ) V*UTQP+,-.}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpsrtuwxyz{|~v     /013456789:;<=?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvumnwojriNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmq yindigo;b with hidden output stack, necessary to generate typed Lorentz code from untyped Indigo frontend.|indigo!Gen code with hidden output stack~indigo? for yindigodLike bind, but the input type of the second parameter is determined by the output of the first one.indigoTo run y you need to pass an handler of + with any output stack.indigoConvert ; to yindigoCall an action with ; stored in y.:This function is kinda dummy because it passes IndigoState to the function which produces a GenCode independently on passed MetaData to it. It has to be used with only functions which pass MetaData in the same way. This function is needed to pass SomeIndigoState in contravariant positions of statements like if, case, while, forEach), etc. Alternative solution would be abstracting out IndigoState and SomeIndigoState with typeclass class CodeGenerator m where runCodeGen :: m inp a -> MetaData inp -> (forall out . GenCode inp out a -> r) -> r and passing CodeGenerator m in contravariant positions instead of IndigoState.indigo The same as 9 but converting a function with one argument, also dummy.indigo The same as 8 but converting a function with 2 arguments, also dummy. yz{|}~ yz{|}~None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm indigo Class like * type class but holding a lens to a field.indigoLens to a field.  obj.f1.f2.f3! is represented as list names of  [f1, f2, f3].dt< is a type of source object (type of obj in example above) fname is a name of target field ("f3" in example above) ftype is a type of target fieldxHowever, a lens contains not only name of field but for each field it contains operations to get and set target field.indigo/Constraint to access/assign field stored in RecindigoGet a field from list of fieldsindigoAssign a field to a valueindigo Access to indigo,Build a lens to a direct field of an object.indigo*Build a lens to deeper field of an object.indigoDefault instance for datatype and its direct field name. It will be useful unless you want to refer to a field using a custom name.   None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoiAuxiliary datatype where each field refers to an expression the field equals to. It's not recursive one.indigo?Datatype describing access to an inner fields of object, like Bobject !. field1 !. field2 ~. (field3, value3) ~. (field4, value4)gg None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm.indigo( represents a postponed compilation of  datatype. When  is being compiled we are trying to put off the generation of code for work with an object because we can just go to a deeper field without its "materialization" onto stack.indigoConvert arbitrary ^ into , having converter for fields.indigoCompile ^A to a stack cell, having a function which compiles inner fields.indigoCompile ; datatype to a cell on the stack. This function leverages % to put off actual field compilation.indigouThis function might look cumbersome but it basically either goes deeper to an inner field or generates Lorentz code.indigoConvert an expression to . The function pattern matches on some specific cases of expression those compilation into a stack cell may be postponed. They include ` variables and  expressions."This function can't be called for 3 constructor, but we take care of it just in case.         None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm;indigo<Expression class to remove an element from a data structure.!Note that while this is based on L and MF, it is necessary to have different instances to allow for different L parameter types, ( uses a > instead of a I).indigo<Expression class to insert an element into a data structure.!Note that while this is based on L and MF, it is necessary to have different instances to allow for different L parameter types, ( uses a > instead of a I ), just like ..Moreover, this class is parameterized with an insParam1 as well in order to have both key-value pairs (| and ) as well as key only ().indigo(Create an expression holding a variable.r  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~r!#%') "$&(*+,-.04268/15379:;<>=?@ABCDEFIJGHKL MNOPQRSTUVWY[]_aXZ\^`bdcefghijklmnopqrstuvw{yz|}~x!66777 4"4$4&4(4*4/818325372F6H5O8P8Q8R8S8X8Z8\8^8`8b8c8d8g8h8 None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmKindigo'Datatype representing decomposition of .indigo5Decompose an expression to list of its direct fields.indigo~For given element on stack, generate code which decomposes it to list of its deep non-decomposable fields. Clean up code of y composes the value back.indigoDecompose any ^ having decomposer for field.indigoADeconstruct top element of the stack and return it wrapped into  constructor.indigo7Push the passed stack cells without references to them.WWNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmM,W      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmRBu+,-./0123456789:;<=>?@ABCDEFRSTUVWXYZ[\]^_`abcdefghijklmrstuvwyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkma"indigoACreate a new variable with passed expression as an initial value.indigo Set the variable to a new value.If a variable is a cell on the stack, we just compile passed expression and replace variable cell on stack. If a variable is decomposed, we decompose passed expression and call  recursively from its fields.indigo7Set the field (direct or indirect) of a complex object.indigoHCall binary operator with constant argument to update variable in-place.None6!"#$%&'*,-.12456789;<=>?@ACHMNPSUVX_`befgkmnhindigoGenerates all of the ; (both with and without return value) from 1 to the given nindigoIGenerates a function that converts a Lorentz expression to an Indigo one.~The first parameter is the number of elements that the Lorentz code consumes from the stack, as well as the number of Indigo  values.mThe second parameter is to establish if there is a return value or not, as well as the name of the function. Examples:fromLorentzFunN 1 False produces: JfromLorentzFun1Void :: IsExpr ex a => a & s :-> s -> ex -> IndigoM s s () fromLorentzFunN 2 True produces: fromLorentzFun2 :: (KnownValue ret, IsExpr ex1 a, IsExpr ex2 b) => a & b & s :-> ret & s -> ex1 -> ex2 -> IndigoM s (ret & s) (Var ret) None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoTType class which unions all related management of computations in a scope, like in if branch, in case body, etc.Particularly, it takes care of the computation of expressions returning from a scope to leave it safely. Basically, this type class encapsulates the generation of Lorentz code that looks like: P branch_code # -- we get some arbitrary type of a stack here, lets call it xs compute_returning_expressions # -- we get type of stack [e1, e2, ... ek] ++ xs cleanup_xs_to_inp -- we get [e1, e2, e3, ..., ek] ++ inp indigoqProduces an Indigo computation that puts on the stack the evaluated returned expressions from the leaving scope.indigozDrop the stack cells that were produced in the leaving scope, apart from ones corresponding to the returning expressions.indigo Generate 0 for the whole statementindigoLClass for values that can be returned from Indigo statements. They include () and tuples.indigo^Type family reflecting the top elements of stack produced by a statement returning the value.indigo<Type family reflecting the returning value from a statement.indigoTuple looking like (Expr x, Expr y, ..) that corresponds to expressions returning from the scope. 'RetVars'' and 'RetExprs'' are twin types because the former just adds Z$ over each expression of the latter.indigo8Allocate variables referring to result of the statement.indigo2This type family returns a promoted value of type J or causes a compilation error if a tuple with too many elements is used.indigopTo avoid overlapping instances we need to somehow distinguish single values from tuples, because the instances: 3 instance Something a instance Something (a, b) overlap and adding {-# OVERLAPPING #-}H doesn't rescue in some cases, especially for type families defined in  Something.indigo(If value is unit (don't return anything)indigo"If it's a single value (not tuple)indigo6If it's tuple (we don't care how many elements are in)indigo#Specific version of 'allocateVars''indigo Specific version of 'liftClear''indigopConcatenate a scoped code, generation of returning expressions, and clean up of redundant cells from the stack.indigoPush a variables in 28, referring to the generated expressions, and generate 0 for the whole statement.indigoSingle variable allocatorNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoCreate a lambda, that takes only one argument, from the given computation. The lambda is not allowed to modify storage and emit operations.indigoHExecute a lambda, which accepts only one argument, on passed expression.indigoyCreate a lambda, that takes only one argument, from the given computation. The lambda is not allowed to emit operations.indigoHExecute a lambda that accepts only one argument on the given expression.indigoCreate a lambda, that takes only one argument, from the given computation, and return a variable referring to this lambda. The lambda is allowed to modify storage and emit operations.indigoExecute a lambda that accepts only one argument on the given expression. Also updates the storage and operations with the values returned from the lambda.indigo{Create a lambda, that takes only one argument, from the given computation, and return a variable referring to this lambda.indigoExecute a lambda that accepts only one argument on the given expression. Also updates the storage and operations with the values returned from the lambda.None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoIf statement. All variables created inside its branches will be released after the execution leaves the scope in which they were created.indigo#If which works like case for Maybe.indigo$If which works like case for Either.None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm  None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoThis type is analogous to the r type but instead of wrapping a Lorentz instruction, this wraps an Indigo value with the same input/output types.indigo=A case statement for indigo. See examples for a sample usage.indigocase_# for pattern-matching on parameter.indigo entryCase_# for contracts with flat parameter.None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmd indigo/While statement. The same rule about releasing.indigo)For statements to iterate over container.indigoPut a document item.indigopGroup documentation built in the given piece of code into block dedicated to one thing, e.g. to one entrypoint.indigofInsert documentation of the contract storage type. The type should be passed using type applications.indigoCGive a name to given contract. Apply it to the whole contract code.indigo&Attach general info to given contract.indigo:Attach default general info to the contract documentation.indigo>Indigo version for the function of the same name from Lorentz.indigoTakes an arbitrary IndigoM and wraps it into an IndigoFunction producing a local scope for its execution. Once it executed, all non-returned variables are cleaned up so that the stack has only returned variables at the top. This also can be interpreted as if True then f else nop.Note, that by default we do not define scope inside indigo functions, meaning that once we want to create a new variable or return it from a function we need to do it inside  scope $ instr construction, for example: f :: IndigoFunction s Natural f = scope $ do *[s]* res <- newVar (0 :: Natural) *[Natural, s]* scope $ do _n <- newVar (1 :: Integer) *[Integer, Natural, s] res += 4 *[Natural, s]* return res *[s]* indigo Add a commentbNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigo#StatementF functor for Freer monad.MThe constructors correspond to every Indigo statement that has expressions ( x) in its signature.>The ones that don't take expressions are compiled directly to ; (and kept in J), because they won't be taken into consideration by an optimizer anyway.One more detail about  is that it takes a cont% type parameter, which is basically IndigoM/ (freer monad), to avoid cyclic dependencies. contH is needed to support statements which have recursive structure (like: if, while, case, etc).indigo_Direct injection of IndigoState of statements which are not going to be analyzed by optimizer.indigo Pure lambdaindigoDefault lambda which can modify storageindigo3Lambda which can modify storage and emit operationsindigo@Analogous datatype as IndigoCaseClauseL from Indigo.Backend.Case"     "     None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigo$Monad for writing your contracts in.indigo7This is freer monad (in other words operational monad).LIt preserves the structure of the computation performed over it, including return and binda operations. This was introduced to be able to iterate over Indigo code and optimize/analyze it.aYou can read a clearer description of this construction in "The Book of Monads" by Alejandro Serrano. There is a chapter about free monads, specifically about Freer you can read at page 259. There is "operational" package which contains transformer of this monad and auxiliary functions but it's not used because we are using only some basics of it.indigo.Traverse over Freer structure and interpret itNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm &indigo<Typeable and stack size constraint for the parameters of an '.'indigoType of a function with n Z arguments and  IndigoM a result.&Note that the arguments are the first n elements of the inp( stack in inverse order, for example: *IndigoWithParams ('S ('S 'Z)) '[a, b, c] x is the same as: Var b -> Var a -> IndigoM x(indigo Converts an ' to its form without input Zs, alongside the 2! to use it with. If there is an T. to the bottom of the stack it also assigns a Z to it.indigoAssigns a variable to the Tp list at the bottom of the stack iff there is one and it does not have one already. Otherwise returns the same 2.&'('&(None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm indigoThis is a hack, which prevents using a variable from an outer scope in a body of the lambda. This is not needed when a lambda is defined as top level function, but made just in case, if one wanted to define something like this: f :: Var Storage -> IndigoM () f storage = do field <- getStorageField let lambda = defNamedLambda1 $ arg -> ... using field here ... The idea is that when we pass this variable in a bind it will be propagated in all expressions, including the ones that are in the lambdas. An error will be raised during a variable lookup. This hack will be rewritten later.5indigoCollect all used lambdas in a computation (which might be either a contract body or another function body), which are called at least twice. Only outer functions will be gathered, for instance, if we call lambda func1 from func0, only func0 will be taken. )+*,-./012345 01234)+*,-./5None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmJ8indigo8Type of a contract that can be compiled to Lorentz with :.indigo!Iteration over Indigo freer monadindigoConvert frontend Freer to ;.First of all, this function generates the definitions of lambdas, creates the variables that refer to them and calls them in the places where they are used. This happens only for those lambdas that are called at least twice, those that are used only once will be inlined instead.2After that the generation of the body code starts.9indigoCompile Indigo code to Lorentz.Note: it is necessary to specify the number of parameters (using the first type variable) of the Indigo function. Also, these should be on the top of the input stack in inverse order (see ').:indigoVCompile Indigo code to Lorentz contract. Drop elements from the stack to return only  [Operation] and storage. RSTlm'89: 9'8:TSlRmNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm[m&<indigoUtility type for an M that does not modify the stack (only the values in it) and returns nothing.=indigoUtility type for an K that adds one element to the stack and returns a variable pointing at it.?indigoSCreate a new variable with the result of the given expression as its initial value.@indigo=Set the given variable to the result of the given expression.Kindigo$Sets a storage field to a new value.Lindigo-Updates a storage field by using an updating .Mindigo1Get a field from the storage, returns a variable.?Note that the storage type almost always needs to be specified.OindigoDRun the instruction when the condition is met, do nothing otherwise.Pindigo Reverse of O.Sindigo6Run the instruction when the given expression returns ^ a value, do nothing otherwise.Tindigo6Run the instruction when the given expression returns ], do nothing otherwise.Zindigo=A case statement for indigo. See examples for a sample usage.[indigoZ for tuples.\indigoZ# for pattern-matching on parameter.]indigo\ for tuples._indigo An alias for `& kept only for backward compatibility.`indigoUse this instead of .This operator is like  but wraps a body into y, which is needed for two reasons: to allow having any output stack and to allow returning not exactly the same values.vIt has the added benefit of not being an arrow, so in case the body of the clause is a lambda there won't be several.bindigo Alias for a we use in the tutorial.cindigoA more specific version of b meant to more easily create IndigoContracts.Used in the tutorial. The SI constraint is specified to avoid the warning for redundant constraints.dindigo Family of defNamed*LambdaN` functions put an Indigo computation on the stack to later call it avoiding code duplication. defNamed*LambdaN takes a computation with N arguments. This family of functions add some overhead to contract byte size for every call of the function, therefore, DON'T use defNamed*LambdaN[ if: * Your computation is pretty small. It would be cheaper just to inline it, so use bA. * Your computation is called only once, in this case also use b.Also, pay attention that defNamed*LambdaN accepts a string that is a name of the passed computation. Be careful and make sure that all declared computations have different names. Later the name will be removed.YPay attention, that lambda argument will be evaluated to variable before lambda calling.STODO Approach with lambda names has critical pitfall: in case if a function takes  Label namey, lambda body won't be regenerated for every different label. So be carefully, this will be fixed in a following issue.eindigo6Like defNamedEffLambda1 but doesn't make side effects.findigo2Like defNamedLambda1 but doesn't take an argument.gindigoQLike defNamedEffLambda1 but doesn't modify storage and doesn't make side effects.hindigoWhile statement.jindigo+For statements to iterate over a container.kindigoPut a document item.lindigorGroup documentation built in the given piece of code into a block dedicated to one thing, e.g. to one entrypoint.mindigohInsert documentation of the contract's storage type. The type should be passed using type applications.nindigoGGive a name to the given contract. Apply it to the whole contract code.oindigo*Attach general info to the given contract.pindigo:Attach default general info to the contract documentation.qindigo0Indigo version for the homonym Lorentz function.vindigoGCreate contract using default compilation options for Lorentz compiler.See  Lorentz.Run.windigo!Create contract from raw Lorentz .indigo+Add a comment in a generated Michelson codeindigo+Add a comment in a generated Michelson codeindigooAdd a comment before and after the given Indigo function code. The first argument is the name of the function.indigoqAdd a comment before and after the given Indigo statement code. The first argument is the name of the statement.H;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~H?@BCDEIJGFHAMKLNOPQRSTUVWXY[Z]\^_`abcgefdhijrsklmnopqtuvwyxz{|}~=<;>A0_0`0 None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm_P;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmi indigo4Pretty-print an Indigo contract into Michelson code.indigoWPrints the pretty-printed Michelson code of an Indigo contract to the standard output.1This is intended to be easy to use for newcomers.indigoQSaves the pretty-printed Michelson code of an Indigo contract to the given file.1This is intended to be easy to use for newcomers.indigoForce result to be single lineNone7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmvzindigoDisambiguation type used in  that links a single $ to the numeric type to resolve to.indigoKind used for ) as part of the disambiguation machinery.indigoDefines semantics of if ... then ... else ...; construction for Indigo where the predicate is a generic exa for which IsExpr exa Bool holdsindigo-Numerical literal disambiguation value for a H, see .indigo.Numerical literal disambiguation value for an G, see .indigo-Numerical literal disambiguation value for a , see .indigo1Defines numerical literals resolution for Indigo.%It is implemented with an additional M argument that disambiguates the resulting type. This allows, for example, 1 int to be resolved to  1 :: Integer.;;None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmindigoIndigo version of the viewE macro. It takes a function from view argument to view result and a Q2 structure that typically comes from a top-level case.indigoFlipped version of 2 that is present due to the common appearance of flip view parameter $ instr construction.FSemantically we "project" the given parameter inside the body of the Q construction.indigoIndigo version of the void macro.indigoFlipped version of 2 that is present due to the common appearance of flip void_ parameter $ instr construction.indigouIf the first value is greater than the second one, it returns their difference. If the values are equal, it returns ]2. Otherwise it fails using the supplied function.!None7!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkm!%ih&  _`ba'(.-,+*)('&%$#"! ) V*UTQP+,-.}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpsrtuwxyz{|~v     /013456789:;<=?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvumnwojri*!"#$%       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmcdnopqrstuwvxyz{|}~      '( !"#$%&'()*+,-./0123456789:;<=>?>?@AABDCCDEFFGIJHIJKLMNONOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     &)+,-./0123456789:;<=>CDEFRSTUVWXYZ[\]^_`abcdefghijklmrstuvwyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~'89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~!%ih&  _`ba'(.-,+*)('&%$#"! ) V*UTQP+,-.}/01\[ZYX23456#"$789:;<= >[`?@ZA\BCDEFGHI^]JcdeK_LMNOPQRSTUabVWXYfjklonmpsrtuwxyz{|~v     /013456789:;<=?@ABCDEFGHIJKLMNO]^cdefghijklmnopqrstuvwxyz{|}~     #!" %$'&)(*+,-./0123546789:;<=>?@ABCDEFGHIJKLMNOQPRSTUVWXYZ[\]^_`abcdhfeg~~}{sxtz|ypqvumnwojri*!"#$%       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmcdnopqrstuwvxyz{|}~      '( !"#$%&'()*+,-./0123456789:;<=>?>?@AABDCCDEFFGIJHIJKLMNONOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     &)+,-./0123456789:;<=>CDEFRSTUVWXYZ[\]^_`abcdefghijklmrstuvwyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~'89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"None7!"#$%&'*,-.12456789;<=>?@ACHMNPSUVX_`befgkm#$%&'(#)*#)+#,-#,.#$/#$0#12#13#45#67#68#69#6:&;<&;=#1>#$?#$@#$A#$B#CD#EF#4G#4H#4I#4J#KL#$M#$N#$O#$P#$Q#$R#$S#$T#6U#6V&;W#XY#4Z#4[#$\#$]#1^&;_#`a#4b#4c#de#fg#Ch#Ei#$j#kl#mn#op#qr#st#$u#$v&wx&wy&wz&w{&w|#}~#}#}#}##&w#4#4&w&w#######&w#q&w#&w&w&w###4&w##&w&w&w#$&;#6#6#$###$#$#$&;#####$#$#$#$#$#########################s#K#K#K#K#K#K#K#K#K#K#K#K#K#K#m#m#m #m #m #m #m #m#m############## #!#"###$%#&'#()#(*#+,#+-#+.#+/#+0#12#13#13#k4#k5#k6#k7#k8#k9#:;#:<#:<#:=#:>#:>#?@#?A#?B#?C#?C#?D#?E#?E#?F#?G#?G#?H#?I#?I#?J#?K#?K#?L#?M#?M#?N#?O#?O#qP#qQ#qR#qR#ST#SU#SV#SW#SX#SY#SZ#S[#S\#S]#S^#S_#S`#Sa#Sb#Sc#Sd#Se#fg#fh#i#j#k#l#m#no#np#np#qr#qr#st#su#sv#sw#sx#Xy#Xz#X{#X|#X}#X~#X#X#X#X#X#X#X#X#X#X#X#####4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#4#6#6#6#6#6#6##)#)#)#)#)#)#)#)#)#)#)#)#)#)#)#)#)################,#,#,##1#1#1#1#1##$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$#$###? #+,&; &; &; &; &;&;&;&; !"#!"$%&'%&(!")!"*!"+,-./01201301401501601789:;<=>?@?ABCDEFGHIJHIKHILHIMHINHIOHIPHQRHQSHQTHQUHQVHWXHWYHWZHW[\]E^_`a_`b_`c_`d8ef./.gE^EhEi?@?j?k?l?m?n?o?pqrsqrtqruqrvqrwxyzxy{xy|xy}xy~xyxyxyxyxyxy;,,,,-0      !"#$%&'(')'*'+','-'./0/1/2/3/4/5/6/7898:8;8<8=>?>@>A>BCDCECFCGCHCICJCKCLCMCNCOPQPRSTUVWXYWXZWX[\]^\]_\]`\]a\]b\]c\]d\]e\]f\]g\]h\]i\]j\]k\]k\]l\]m\]n\]o\]opqrpqs\tupvw\t\xypz{p|}pz~pzpppppppp\\\\\\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\pppppppppppppppppppppp\\ppppppppppppppppppp p p p p ppppppppppppppppppppppp p!p"p#p#p$p%p%p&p&p'p'p(p(p)p*p+p+p,p-p.p/p0p1p2p3p45p6\78\79\7:\7;\7<\7=\7>\7?\7@\7A\7B\7C\7D\7E\7F\7G\7H\7I\7J\7K\7L\7M\7N\7O\7P\7Q\7R\7S\7T\7U\7V\7W\7X\7Y\7Y\Z[\Z[\Z\\]^\]_\]`\]a\bc\bc\bd\ef\eg\eh\ei\ej\ek\el\em\en\eoppq\er\er\es\et\eu\eu\ev\ew\ex\ey\ey\ez\e{\e|\e}\e~\e\e\e\e\e\e\e\e\e\e\e\e\e\e\e\ep\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\pzpz\\\\\\\\\\\\\\\\\\\\\\\\\\\p\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ \ \ \ \ \ \\\\\\\\\\\\\\\\\\ \!\"\#\$\%\&\'\(\)\*\+\,\-\.\/\0\1\2\3\3\4\5\6\7\8\8\9\:\;\<\=\>\?\@\A\A\B\C\D\E\F\G\HI\HJ\HK\HL\HM\HN\HO\H.\HP\HQ\HQ\HR\HS\HT\HU\HV\HW\HX\HY\HZ\H[\H\\H]\H^\H_\H`\Ha\bc\bd\be\bf\gh\gi\gj\gk\gl\gm\gn\go\gp\qr\qs\tu\tv\tw\tx\yz\y{\y|\y}\y~\y\y\\\\\\\\b\b\b\g\g\g\t\t\t\t\t\\\\\\\\\\\\\\\\\\\\\ppzppppppppppppppp\\\\\\\\\\\ppppz~pzpzpzpzpzpzpzpzpvwB?@      !"#$%&'() * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                              3          <         =                   -  .      7 M            .                                                                   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRRSTUVWXYZ[\]^_`abcdefghijklmnopqr@stuvwxyz{|}~@AB CTUfXYZ[\]^_`abcdeIDFGHNOg2pp         \z"""""""" indigo-0.2.0-inplaceIndigo.Backend.PreludeIndigo.PreludeIndigo.LorentzIndigo.Internal.StateIndigo.Internal.ObjectIndigo.Internal.LookupIndigo.Internal.SISIndigo.Internal.FieldIndigo.Internal.Expr.Types Indigo.Internal.Expr.CompilationIndigo.Internal.Expr.SymbolicIndigo.Internal.Expr.DecomposeIndigo.Backend.VarIndigo.FromLorentzIndigo.Backend.ScopeIndigo.Backend.LambdaIndigo.Backend.ConditionalIndigo.Backend.ErrorIndigo.Backend.CaseIndigo.BackendIndigo.Frontend.StatementIndigo.Frontend.ProgramIndigo.Compilation.ParamsIndigo.Compilation.LambdaIndigo.CompilationIndigo.Frontend.Language Indigo.PrintIndigo.Rebinded Indigo.LibIndigo.Internal.ExprIndigo.InternalIndigo.FrontendIndigo Paths_indigobaseGHC.Base++ghc-primGHC.PrimseqGHC.Listfilterzip Data.Tuplefstsnd otherwise$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negate>>=>>fmapreturnControl.Monad.Failfail Data.String fromString fromIntegral realToFrac toInteger toRational Control.Monadguard<>memptymappendmconcatjoin<*>pure*>BoundedEnumEq GHC.FloatFloating FractionalIntegralMonadFunctorNumOrdGHC.ReadReadRealRealFracGHC.ShowShowData.Typeable.InternalTypeable MonadFailIsString Applicative Data.FoldableFoldableData.Traversable Traversable GHC.GenericsGeneric GHC.TypeNatsKnownNatGHC.OverloadedLabelsIsLabel SemigroupMonoid GHC.TypesBoolCharDoubleFloatIntGHC.IntInt8Int16Int32Int64integer-wired-inGHC.Integer.TypeInteger GHC.NaturalNatural GHC.MaybeMaybeOrderingRatioRationalIOWordGHC.WordWord8Word16Word32Word64GHC.PtrPtrFunPtr Data.EitherEither ConstraintCmpNat CoercibleGHC.Stack.Types CallStackD#FalseF#NothingJust:%TrueLeftRightLTEQGTString/=maxBoundminBoundideither mtl-2.2.2Control.Monad.Reader.Class MonadReaderasklocalreaderControl.Monad.State.Class MonadStategetputstatebytestring-0.10.10.0Data.ByteString.Internal ByteString Data.Functor<$><|>Qhashable-1.3.0.0-6a06b304864f76cff7487530abcd9c53784bf2d5cb6bbcfefbf3eaf9ba34c680Data.Hashable.ClassHashable text-1.2.4.0Data.Text.InternalTextconst.^unordered-containers-0.2.10.0-f0b00e67598e7a365507d8332c934efdfc8b152436e255fa57288f3489d42a57Data.HashMap.BaseHashMapcontainers-0.6.2.1Data.Map.InternalMapcompareGHC.IO.Handle.FDstdoutGHC.IO.Handle.TypesHandleData.Bifunctorbimap Bifunctor<* Alternativemplusmzero MonadPlusData.Functor.Compose getComposeCompose Data.VoidvacuousabsurdVoidData.Semigroup mtimesDefaultcycle1 WrappedMonoid getOptionOptionGHC.ExtssortWithsecondfirstData.List.NonEmptyinitlasttailheadnonEmptyGHC.ExecutionStackshowStackTrace getStackTraceControl.Monad.IO.ClassliftIOMonadIO fromLabelmfilter<$!>unless replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterMfoldMapDefault fmapDefault mapAccumR mapAccumLforMsequencemapM sequenceAtraverseControl.Applicativeoptional getZipListZipList Control.Arrow&&&Data.Functor.Identity runIdentityIdentitystderrstdin GHC.StackwithFrozenCallStack callStack GHC.Conc.Sync writeTVarreadTVarnewTVarSTMTVar GHC.IORefIORefGHC.IOFilePath GHC.ExceptionprettyCallStack prettySrcLocGHC.Exception.Type SomeExceptiondisplayException fromException toException ExceptionData.Functor.ConstgetConstConst minimumBy maximumBy concatMapconcatfoldlMfoldrM Data.MonoidgetFirstFirstgetLastLastData.Semigroup.Internal stimesMonoidstimesIdempotentgetDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductgetAltAlt someNatValnatValSomeNat Data.OldListunfoldrsortOnsortBysort permutations subsequencestailsinitsgroupgenericReplicategenericSplitAt genericDrop genericTake genericLength transpose intercalate intersperse isPrefixOf Text.Read readMaybereadsisRightisLeftpartitionEithersrightsleftsData.Ord comparingDown Data.ProxyProxy GHC.IO.IOMode ReadWriteMode AppendMode WriteModeReadModeIOModeatanhacoshasinhtanhcoshsinhatanacosasintancossinlogBase**sqrtexppi byteSwap64 byteSwap32 byteSwap16 Data.BitsxorintegralEnumFromThenTointegralEnumFromTointegralEnumFromThenintegralEnumFromgcdWord'gcdInt'lcmgcd^^%^^^%^^^^oddevennumericEnumFromThenTonumericEnumFromTonumericEnumFromThennumericEnumFrom denominator numeratorreduce notANumberinfinity ratioPrec1 ratioPrecunderflowError overflowErrorratioZeroDenominatorError divZeroErrordivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionboundedEnumFromThenboundedEnumFromfromEnumtoEnumpredsuccGHC.Charchrunzip3unzipzipWithzip3reversebreaksplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanrscanl Data.MaybemapMaybe catMaybes listToMaybe maybeToList fromMaybe isNothingisJustmaybe Data.Boolbool Data.Function&onfixvoid$><&>swapuncurrycurryGHC.MVarMVarsubtractsignumabs*+ GHC.Stack.CCScurrentCallStackasTypeOfflipmaxIntminIntordapliftM5liftM4liftM3liftM2when=<<liftA3<**>stimessconcat<$liftA2manysomeempty:|NonEmpty getCallStack HasCallStackstimesIdempotentMonoid<<=>maxmin&&||nottransformers-0.5.6.2Control.Monad.Trans.Identity IdentityT runIdentityTQconstraints-0.12-219813e80846a99ce76bdb4a8e0b66c26d970340aef6c06b2fe8a5b96699e0aaData.ConstraintwithDictData.IntMap.InternalIntMapData.IntSet.InternalIntSetData.Sequence.InternalSeqData.Set.InternalSetdeepseq-1.4.4.0Control.DeepSeqrnfNFData[data-default-class-0.1.2.0-cd82420962fb1bb36843e51775abe5ffe3c35016e35b1db0a0fccf8ccfb6a31dData.Default.ClassDefaultdefforce$!!deepseqControl.Monad.Trans.MaybeMaybeTControl.Monad.Trans.ExceptExceptTRexceptions-0.10.4-49a3ddfb177101e7540692e7b9abea6fe3b622861e7c7e66eca0755e823a7c8aControl.Monad.Catch MonadThrow MonadCatchgeneralBracketuninterruptibleMaskmask MonadMaskControl.Monad.Trans.Classlift hashWithSaltData.Text.LazytoStrictData.HashSet.BaseHashSet Control.Monad.Trans.State.StrictStateTStatePvector-0.12.1.2-cdd11b636c315a5bb0964622b98d4a6081fef7ccc95974ea24e81b8b0e119995 Data.VectorVectorControl.Monad.Trans.ReaderReadergetsSmicrolens-0.4.11.2-bf9eaf00b69daf7523e0425ba84bbdf987923900daff3add5e7969303af1f769 Lens.Micro^?^..^.set.~over%~Lens.Micro.Internal_1_2_3_4_5Lens.Micro.TypeLensLens' Traversal Traversal'modifyasksReaderTVmicrolens-mtl-0.2.0.1-d2f7bd2b7607d43a03f0041a7443ca2c17b8cfb0d246b0f1723982eea7a1c266Lens.Micro.Mtlpreuseusepreviewview MonadTransmodify' runExceptT runReaderT runReader runStateTrunState evalState execState withState evalStateT execStateTNnamed-0.3.0.1-c213d4c2c01df3dfd493e55bc222296fdaec9c9d140602f3c9de6390e6f03aa3Named.InternalargDefargFarg:!:?Xsafe-exceptions-0.1.7.0-88d7a06c459925b027b72af16d1e68409f0db4e1b3429187bb7608638bb1d32cControl.Exception.SafebracketOnErrorfinallybracket_bracket onExceptiontryAnytry handleAnycatchAnycatchthrowM stm-2.5.0.0Control.Concurrent.STM.TVar modifyTVar' fromStrict Data.TextunwordsunlineslineswordsData.Text.Encoding decodeUtf8'decodeUtf8WithData.Text.Encoding.Error lenientDecode strictDecodeOnError OnDecodeErrorUnicodeExceptionexceptToMaybeTmaybeToExceptT runMaybeTPuniversum-1.6.1-feb74d29edc41a61b0de06fa402f3d29121212e577bc6fc320dbebeb8a0f5a01Universum.VarArg...SuperCompositionUniversum.TypeOpsEachWithUniversum.String.Conversionshow readEitherLText LByteStringdecodeUtf8Strict decodeUtf8 encodeUtf8 ConvertUtf8toTextToTexttoLTextToLTexttoStringToStringUniversum.Debug undefinedtraceIdtraceM traceShowMtraceShowIdWith traceIdWith traceShowId traceShowerrortrace UndefinedUniversum.Print putLTextLnputLText putTextLnputTexthPrintprintputStrLnputStr hPutStrLnhPutStrUniversum.Print.InternalPrint Universum.Nub unstableNubsortNubhashNubordNubUniversum.Bool.GuardguardMifMunlessMwhenMUniversum.DeepSeq evaluateNF_ evaluateNF evaluateWHNF_ evaluateWHNFUniversum.ExceptionnotebugExcBugUniversum.List.Safe whenNotNullM whenNotNullunconsUniversum.Monad.ContaineranyMallMorMandM concatForM concatMapMUniversum.Container.Classasum sequence_ sequenceA_forM_mapM_for_ traverse_productsum flipfoldl'elemskeystoPairsToPairssafeHeadfindorandanyallnotElemfoldl1foldr1foldr'foldfoldMapminimummaximumelemlengthfoldl'foldlfoldrnulltoListElement ContaineroneOneItemOneUniversum.Monoid maybeToMonoidUniversum.Monad.TransexecutingStateexecutingStateTevaluatingStateevaluatingStateT usingState usingStateT usingReader usingReaderTUniversum.Monad.Either whenRightM whenRight whenLeftMwhenLeft maybeToLeft maybeToRight rightToMaybe leftToMaybe fromRightfromLeftUniversum.Monad.Maybe whenNothingM_ whenNothingM whenNothing_ whenNothing whenJustMwhenJust?:Universum.Lifted.IORefatomicWriteIORefatomicModifyIORef'atomicModifyIORef modifyIORef' modifyIORef writeIORef readIORefnewIORefUniversum.Lifted.FilewithFilehCloseopenFilegetLine appendFileUniversum.Lifted.Envdie exitSuccess exitFailureexitWithUniversum.Lifted.Concurrent readTVarIO newTVarIO atomically tryTakeMVar tryReadMVar tryPutMVartakeMVarswapMVarreadMVarputMVarnewMVar newEmptyMVarUniversum.Functor.Fmap<<$>>mapUniversum.Base$!Universum.ApplicativepassMvinyl-0.12.1-7eed6fcae264e50bba3530560fb2a8e8cadbc76c371a4c09876689da9126d803Data.Vinyl.Core:&RNilReclorentz-0.6.0-inplace Lorentz.ADTconstructStack deconstruct fieldCtorgetField getFieldNamed modifyFieldtoField toFieldNamed unwrapUnsafe_wrap_:= CaseArrow/-> CaseClauseLCaseTCHasFieldOfTypeHasFieldsOfType NamedFieldmorley-1.6.0-inplace%Michelson.Typed.Haskell.Instr.ProductConstructorFieldTypesInstrConstructC Lorentz.Base:-> Util.LabelLabelLorentz.Annotation HasAnnotationMichelson.Typed.Haskell.ValueToT Tezos.AddressAddressBigMap ContractRefMichelson.Typed.Entrypoints EpAddress Tezos.CryptoKeyHashMichelson.TextMText Tezos.CoreMutezMichelson.Typed.Aliases Operation PublicKey Signature Timestamp Lorentz.Arith ArithOpHs ArithResHsUnaryArithOpHsUnaryArithResHsLorentz.Constraints.ScopesNiceComparable###FIIiAnyCode iForceNotFail iGenericIf iMapAnyCodeiNonFailingCodeiWithVarAnnotationsoptimizeLorentzoptimizeLorentzWithConfparseLorentzValuetransformBytesLorentztransformStringsLorentz%> LorentzInstrunLorentzInstr ContractCode ContractOutLambdaMapLorentzInstrmapLorentzInstrSomeContractCodeLorentz.Constraints.DerivativeNiceParameterFull NiceStorage KnownValueLorentz.CoercionsallowCheckedCoerceallowCheckedCoerceTo castDummyG checkedCoercecheckedCoerce_checkedCoercing_ coerceUnwrap coerceWrap fakeCoerce fakeCoercing forcedCoerce forcedCoerce_ fromNamedgForcedCoerce_toNamed CanCastTo castDummy Coercible_MichelsonCoercibleLorentz.Wrappable Wrappable UnwrappableLorentz.AddressTAddressFutureContractLorentz.Common Entrypoint Entrypoint_niceConstantEvinicePackedValueEviniceParameterEvinicePrintedValueEviniceStorageEviniceUnpackedValueEvi CanHaveBigMap NiceConstantNiceFullPackedValueNicePackedValue NiceParameterNicePrintedValueNiceUnpackedValueNoBigMapNoContractType NoOperation Lorentz.DocbuildLorentzDocbuildLorentzDocWithGitRevcutLorentzNonDocmkDEntrypointExamplerenderLorentzDoc Michelson.DoccontractDocToMarkdowndocDefinitionRefdocItemPosition mdTocFromRefmkDGitRevisionmorleyRepoSettingssubDocToMarkdownMichelson.Typed.Haskell.DocconcreteTypeDocHaskellRepconcreteTypeDocHaskellRepUnsafeconcreteTypeDocMichelsonRep!concreteTypeDocMichelsonRepUnsafecustomTypeDocMdReferencedTypeDepgenericTypeDocDependencieshaskellAddNewtypeFieldhaskellRepNoFieldshaskellRepStripFieldPrefixhomomorphicTypeDocHaskellRephomomorphicTypeDocMdReferencehomomorphicTypeDocMichelsonReppoly1TypeDocMdReferencepoly2TypeDocMdReferenceDEntrypointExample ContractDoc cdContentscdDefinitionIds cdDefinitionscdDefinitionsSetDAnchorDComment DDescription DGitRevisionDGitRevisionKnownDGitRevisionUnknownDocElemdeItemdeSub DocGroupingDocItemDocItemPlacementDocItemReferenceddocItemDependencies docItemPos docItemRefdocItemSectionDescriptiondocItemSectionNamedocItemSectionNameStyledocItemToMarkdown docItemToToc docItemsOrder DocItemIdDocItemPlacementKindDocItemInDefinitionsDocItemInlined DocItemPos DocItemRef DocItemNoRefDocItemRefInlined DocSectionDocSectionNameStyleDocSectionNameBigDocSectionNameSmallGitRepoSettingsgrsMkGitRevisionSomeDocDefinitionItem SomeDocItemSubDocDTypeHaveCommonTypeCtor IsHomomorphicSomeTypeWithDoc TypeHasDocTypeDocFieldDescriptionstypeDocDependenciestypeDocHaskellReptypeDocMdDescriptiontypeDocMdReferencetypeDocMichelsonRep typeDocName Util.MarkdownMarkdownValueLorentz.Entrypoints.CoreeprNameparameterEntrypointCallparameterEntrypointCallCustomparameterEntrypointCallDefaultparameterEntrypointsToNotessepcCallRootChecked:>AllParameterEntrypoints EntrypointRefCall CallDefaultEntrypointsDerivationEpdAllEntrypointsEpdLookupEntrypointepdCallepdDescsepdNotesEpdNoneForbidExplicitDefaultEntrypointGetDefaultEntrypointArgGetEntrypointArgGetEntrypointArgCustomHasDefEntrypointArgHasEntrypointArguseHasEntrypointArgHasEntrypointOfTypeLookupParameterEntrypointNoExplicitDefaultEntrypointParameterContainsEntrypointsParameterDeclaresEntrypointsParameterHasEntrypointsParameterEntrypointsDerivationRequireAllUniqueEntrypoints TrustEpNameLorentz.Entrypoints.HelpersShouldHaveEntrypointsunHasEntrypointsLorentz.Entrypoints.Impl EpdDelegateEpdPlain EpdRecursive EpdWithRootLorentz.Entrypoints.ManualParameterWrapperunParameterWraperLorentz.Entrypoints.DocareFinalizedParamBuildingStepsclarifyParamBuildingStepsconstructDEpArgdiEntrypointToMarkdowndocumentEntrypoint emptyDEpArgentryCaseSimple_mkDEntrypointArgSimple mkDEpUType mkPbsWrapInMichelson.Typed.ExtractmkUType DEntrypointdepNamedepSubDEntrypointArgepaArg epaBuildingepaTypeDEntrypointReferenceDeriveCtorFieldDocderiveCtorFieldDocDocumentEntrypoints EntryArrow#-> ParamBuilderunParamBuilderParamBuildingDesc pbdEnglish pbdHaskell pbdMichelsonParamBuildingStepPbsCallEntrypoint PbsCustom PbsUncallable PbsWrapInPlainEntrypointsKindRequireFlatEpDerivationRequireFlatParamEpsMichelson.Untyped.EntrypointsEpNameLorentz.ErrorscustomErrorDocHaskellRepGeneralerrorTagToMTexterrorTagToTextfailUnexpected failUsingisoErrorFromVal isoErrorToVal typeDocMdDescriptionReferToError CustomErrorceArgceTagCustomErrorHasDoccustomErrArgumentSemanticscustomErrClasscustomErrDocMdCausecustomErrDocMdCauseInEntrypointDErrorDThrowsErrorArg ErrorClassErrClassActionExceptionErrClassBadArgumentErrClassContractInternalErrClassUnknown ErrorHasDocErrorRequirements errorDocClasserrorDocDependencieserrorDocHaskellReperrorDocMdCauseerrorDocMdCauseInEntrypoint errorDocNameerrorDocRequirements ErrorScopeIsError errorFromVal errorToValRequireNoArgError SomeErrorUnspecifiedErrorIsoValueWellTypedIsoValueLorentz.Errors.Numeric.ContractaddNewErrorTagsapplyErrorTagMapapplyErrorTagMapWithExclusionsbuildErrorTagMaperrorFromValNumericerrorToValNumericexcludeErrorTagsgatherErrorTagsuseNumericErrorsLorentz.Errors.Numeric.DocapplyErrorTagToErrorsDocapplyErrorTagToErrorsDocWithbaseErrorDocHandlerscustomErrorDocHandlervoidResultDocHandlerErrorTagExclusions ErrorTagMapDDescribeErrorTagMap detmSrcLocNumericErrorDocHandlerNumericErrorDocHandlerErrorNumericErrorWrapper Lorentz.Ext printCommentstackRef stackType testAssert Lorentz.InstrNonZeroChainIdLorentz.Polymorphic ConcatOpHs Lorentz.ValueListEDivOpHs EDivOpResHs EModOpResHsMemOpHs MemOpKeyHsGetOpHs GetOpValHs GetOpKeyHsIterOpHs IterOpElHsMapOpHs IsoMapOpRes MapOpInpHs MapOpResHsSizeOpHs SliceOpHsUpdOpHs UpdOpKeyHs UpdOpParamsHs Lorentz.Macro voidResultTagView VoidResultVoid_ ToContractRef Lorentz.PackexpressionToScriptExpr lEncodeValue lPackValue lUnpackValuevalueToScriptExpr Lorentz.PrintprintLorentzContractprintLorentzValueLorentz.ReferenceddipTdropTdupT Lorentz.RunanalyzeLorentzcompileLorentzcompileLorentzContractcompileLorentzWithOptionsdefaultCompilationOptionsdefaultContractinterpretLorentzInstrinterpretLorentzLambdaCompilationOptionscoBytesTransformercoOptimizerConfcoStringTransformerLorentz.StoreClasscomposeStoreEntrypointOpscomposeStoreFieldOpscomposeStoreSubmapOps mkStoreEpstDelete stEntrypointstGet stGetEpLambda stGetEpStore stGetFieldstInsert stInsertNewstMem stSetEpLambda stSetEpStore stSetField stToEpLambda stToEpStore stToFieldstUpdatestoreEntrypointOpsADTstoreEntrypointOpsDeeperstoreEntrypointOpsFieldsstoreEntrypointOpsReferTostoreEntrypointOpsSubmapFieldstoreFieldOpsADTstoreFieldOpsDeeperstoreFieldOpsReferTostoreSubmapOpsDeeperstoreSubmapOpsReferTo::->EntrypointLambdaEntrypointsFieldStorageContainsStoreEntrypointOpssopSetEpLambda sopSetEpStore sopToEpLambda sopToEpStore StoreFieldOps sopSetField sopToFieldStoreHasEntrypoint storeEpOps StoreHasField storeFieldOpsStoreHasSubmapstoreSubmapOpsStoreSubmapOps sopDeletesopGet sopInsertsopMem sopUpdate~>Lorentz.UParam caseUParam caseUParamTmkUParam pbsUParam unwrapUParamuparamFallbackFail uparamFromAdt CaseUParamConstrainedSomeEntrypointKindEntrypointLookupErrorArgumentUnpackFailedNoSuchEntrypointEntrypointsImplLookupEntrypointRequireUniqueEntrypoints SomeInterfaceUParam UParamUnsafeUParamFallbackUParamLinearizeUParamLinearizedUParam_ UnpackUParam unpackUParamLorentz.UStore.Haskell fillUStoremkUStoreustoreDecomposeustoreDecomposeFullLorentz.UStore.Instr ustoreDelete ustoreGetustoreGetField ustoreInsertustoreInsertNew ustoreMemustoreSetField ustoreToField ustoreUpdateLorentz.UStore.Lift liftUStore unliftUStoreLorentz.UStore.Migration.BasemigrationToLambdamigrationToScriptmigrationToScriptImkUStoreMigrationLorentz.UStore.Migration.BlocksmigrateAddFieldmigrateExtractFieldmigrateGetFieldmigrateModifyFieldmigrateOverwriteFieldmigrateRemoveField mustoreToOldLorentz.UStore.DocUStoreMarkerHasDocustoreMarkerKeyEncodingUStoreTemplateHasDocustoreTemplateDocContentsustoreTemplateDocDependenciesustoreTemplateDocDescriptionustoreTemplateDocNameDecomposeUStoreTW FillUStoreTW MkUStoreTW HasUField HasUStoreHasUStoreForAllInMigrationScriptunMigrationScriptMigrationScript_UStoreMigrationLorentz.UStore.TraversalUStoreTraversableLorentz.UStore.TypesGetUStoreFieldGetUStoreFieldMarker GetUStoreKeyGetUStoreValueKnownUStoreMarkerShowUStoreFieldmkFieldMarkerUKeyPickMarkedFieldsUStore UStoreFieldUStoreFieldExt unUStoreFieldUStoreMarkerType|~> UStoreSubMapunUStoreSubMapcallingDefTAddresscallingTAddressconvertContractRefmtcoerceContractRef DefEpNameoneMuteztimestampFromSecondstimestampFromUTCTimetimestampQuotetoMutez zeroMutezUtil.CustomGenericcstr customGenericfld leftBalancedleftComb rightBalanced rightComb withDepthsFromContractReffromContractRefunFutureContract unTAddress ToAddress toAddress toContractRef ToTAddress toTAddress eaAddress eaEntrypointunBigMap crAddress crEntrypointEntrypointCallfromValtoValSomeEntrypointCallGenCodegcOutgcMetagcCodegcClear DefaultStackMetaDatamdStack mdRefCount StackVarsStkElNoRefRefRefId IndigoStaterunIndigoStateusingIndigoStateigetiput emptyMetadata cleanGenCode$fTestEqualityTYPEStkEl$fDefaultMetaData$fDefaultMetaData0 $fShowRefId$fGenericRefId $fEqRefId $fOrdRefId $fRealRefId $fNumRefId$fFunctorGenCode$fFunctorIndigoState HasStorageHasSideEffectsOpsComplexObjectC FieldTypesIsObject TypedFieldVarVar NamedFieldVar unFieldVar IndigoObjectFCell DecomposednamedToTypedRectypedToNamedReccastFieldConstructorsnamedToTypedFieldVartypedToNamedFieldVarcomplexObjectDict withVarAt makeTopVar pushRefMd pushNoRefMd popNoRefMd operationsVar storageVar$fIsObject'ProductTypeDa$fIsObject'SumTypeDa$fIsObject'PrimitiveDa $fIsObjecta varActionGet varActionSetvarActionUpdatevarActionOperationrtakerdrop$fTestEqualityTTValSomeIndigoStateunSIS SomeGenCode returnSISbindSISrunSIStoSISwithSISwithSIS1withSIS2$fFunctorSomeIndigoState$fFunctorSomeGenCodeHasField fieldLens FieldLens TargetField DeeperField AccessFieldC fetchField assignFieldflSFO fieldLensADTfieldLensDeeper$fHasFielddtfnameftype IsSizeExpr IsMemExpr IsUpdExpr IsGetExpr IsSliceExprIsConcatListExpr IsConcatExpr IsModExpr IsDivExpr IsArithExprIsUnaryArithExprToExprExprTypeAreExprs:~>IsExpr ObjectExprNamedFieldExprunNamedFieldExprObjectManipulationObjectToFieldSetFieldExprCVObjManCastSizeUpdateAddSubMulDivModAbsNegLslLsrEq'NeqLeLtGeGtOrXorAndNotInt'IsNatFstSndPairSomeNoneRight'Left'MemUGet UInsertNewUInsertUMemUUpdateUDelete ConstructConstructWithoutNamedNameUnNameEmptySetGetEmptyMap EmptyBigMapPackUnpackConsNilConcatConcat'SliceContractSelfContractAddressContractCallingUnsafeRunFutureContractImplicitAccountConvertEpAddressToContractMakeViewMakeVoidCheckSignatureSha256Sha512Blake2bHashKeyNowAmountBalanceSenderExectoExpr$fToExpr'ExprDExpr"$fToExpr'ObjManDObjectManipulation$fToExpr'ValDa$fToExpr'VarDIndigoObjectF $fToExprxObjManipulationRes StillObjectOnStack compileExprrunObjectManipulation ternaryOpbinaryOpunaryOp nullaryOp ternaryOpFlat binaryOpFlat unaryOpFlat nullaryOpFlat compileToExprremoveinsert constExprvarExprcastaddsubmul%negeqneqltgtlegeisNattoIntnonZerolsl<<<lsr>>>packunpackpaircarcdrnonerightleftslicecons.: concatAllnilupdatememsize#:!:+:-: emptyBigMapemptyMapemptySetuGet#@uUpdate!@uInsert+@ uInsertNew++@uDelete-@uMem?@#!!!nameunName!~#~ construct constructReccontractselfcontractAddresscontractCallingUnsafecontractCallingStringrunFutureContractimplicitAccountconvertEpAddressToContractmakeViewmakeVoidnowamountsendercheckSignaturesha256sha512blake2bhashKeychainIdbalance$fExprMagmaSet$fExprMagmaMap$fExprMagmaBigMap$fExprInsertableSetexKey$fExprInsertableMap(,)$fExprInsertableBigMap(,)$fExprRemovableSet$fExprRemovableMap$fExprRemovableBigMapExprDecomposition ExprFields Deconstructed decomposeExprdeepDecomposeComposenewVarsetVarsetField updateVargenFromLorentzFunNfromLorentzFunN ScopeCodeGenReturnableValueRetExprsRetVars RetOutStack ScopeCodeGen'compileScopeReturn' liftClear' genGcClear'ReturnableValue' RetOutStack'RetVars' RetExprs' allocateVars'ClassifyReturnValue BranchRetKindUnit SingleValTuple allocateVars liftClear compileScopefinalizeStatement$fReturnableValue'Unit()$fScopeCodeGen'Unit()$fScopeCodeGen'Tuple(,,)$fReturnableValue'Tuple(,,)$fScopeCodeGen'Tuple(,)$fReturnableValue'Tuple(,)$fScopeCodeGen'SingleValsingle!$fReturnableValue'SingleValsingleLambdaExecutor LambdaCreatorLambda1GenericExecuteLambdaEff1CCreateLambdaEff1C LambdaEff1ExecuteLambda1CCreateLambda1CLambda1ExecuteLambdaPure1CCreateLambdaPure1C LambdaPure1createLambdaPure1executeLambdaPure1initMetaDataPure createLambda1executeLambda1 initMetaDatacreateLambdaEff1executeLambdaEff1initMetaDataEff IfConstraintif_ifSomeifRightifConsfailWith failUsing_ failCustom failCustom_failUnexpected_assert assertSome assertNone assertRight assertLeft assertCustom assertCustom_ CaseCommon CaseCommonF IndigoAnyOutIndigoCaseClauseLcaseRec entryCaseRecentryCaseSimpleRec"$fCaseArrowname->IndigoCaseClauseLwhile whileLeftforEachdocdocGroup docStorage contractNamecontractGeneralcontractGeneralDefaultfinalizeParamCallingDoc selfCallingcontractCallingtransferTokens setDelegatescopecommentfromLorentzFun1fromLorentzFun2fromLorentzFun3fromLorentzFun1VoidfromLorentzFun2VoidfromLorentzFun3Void StatementFLiftIndigoStateNewVarSetVarVarModificationLambdaPure1Call Lambda1CallLambdaEff1CallScopeIfIfSomeIfRightIfConsCase EntryCaseEntryCaseSimpleWhile WhileLeftForEach ContractNameDocGroupContractGeneralFinalizeParamCallingDocTransferTokens SetDelegateCreateContractContractCallingFailWithAssert FailCustomIndigoMCaseClauseLOneFieldIndigoMCaseClauseLIndigoM unIndigoMProgramDoneInstrBindinterpretProgram$fMonadProgram$fApplicativeProgram$fFunctorProgram$fFunctorIndigoM$fApplicativeIndigoM$fMonadIndigoMAreIndigoParamsIndigoWithParamsfromIndigoWithParams Lambda1DefLambdaPure1Def LambdaEff1Def_ldProxy_ldName_ldBodyCompiledLambda _clProxyRes_clName _clVarLamcollectLambdas$fOrdLambda1Def$fEqLambda1DefIndigoContract compileIndigocompileIndigoContractIndigoEntrypointIndigoProcedureIndigoFunctionliftIndigoStatenew=:+=-=*=||=&&=^=<<<=>>>=setStorageFieldupdateStorageFieldgetStorageFieldifNonewhenSomewhenNoneifLeftcase_ entryCaseentryCaseSimple//->#= defFunction defContractdefNamedEffLambda1defNamedLambda1defNamedLambda0defNamedPureLambda1createContractcreateLorentzContract justCommentcommentAroundFuncommentAroundStmtprintIndigoContractprintAsMichelsonsaveAsMichelson ifThenElsenatintmutezview_projectvoid_ projectVoidsubGt0 TypeDecision IsObject'MapGFTTValMichelson.Typed.TT TValStackVarDepth Util.PeanoPeanoOsingletons-2.6-bc9e9efcd42ed95898675958f8f864b759edb324126e3a605303bb31393c73bbData.Singletons.InternalSingduupXVar replaceNVar updateNVarvarDepth objToExprcompileObjectFcompileObjectManipulation exprToManRes ExprRemovableExprInsertabledecomposeObjectFdeconstructOnStack noRefGenCodecreateLambda1GenericexecuteLambda1GenericassignVarToOps leakedVarcompileIndigoMsimpleCompileIndigoMNumTypeNumKindversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName