#]V      !"#$%&'()*+,-./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 : ; < = >?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     !!!!!&None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpj-!%]\&  ^_a`'(+*)('&%$#"! ) TS*RQPONM+,- .z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilmonpqstuvwxy{|~r     ,-./0123456789:;<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-OPQRSTUVWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245!%]\&  ^_a`'(+*)('&%$#"! ) TS*RQPONM+,- .z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilmonpqstuvwxy{|~r     ,-./0123456789:;<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-OPQRSTUVWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp6indigo1Generates an Buildable instance for a Expr GADT. Note:n This will not generate additional constraints to the generated instance if those are required. Inspired by deriveGADTNFData from Util.TH.66None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp2>[`GHI]^py      !"#$%&')(*+,-/.1042356789:;<=>?@ABCDEFGHIJMLKUVUTSRQPONXWZY[_^]\`edcbajihgflknmopqrstuvwxyz{|}~       !"#$#"%&'&%()*+,+*-./0123654987;:=<?>A@BCDEFGHIJKLMNOPQTSRUVWYXZ[]\^_`abcdhijihgfeklmlnopqrstwvuxzy{}|~      !"#$&%'()*+-,+./012345678>=<;:98?@ABCDEFGHIJKLMN2>[`GHI]^py      !"#$%&')(*+,-/.1042356789:;<=>?@ABCDEFGHIJMLKUVUTSRQPONXWZY[_^]\`edcbajihgflknmopqrstuvwxyz{|}~       !"#$#"%&'&%()*+,+*-./0123654987;:=<?>A@BCDEFGHIJKLMNOPQTSRUVWYXZ[]\^_`abcdhijihgfeklmlnopqrstwvuxzy{}|~      !"#$&%'()*+-,+./012345678>=<;:98?@ABCDEFGHIJKLMNNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp 7indigo%Allows to get a variable with storage8indigo(Allows to get a variable with operations:indigo0A variable referring to an element in the stack.<indigo"Stack of the symbolic interpreter.@indigo*Stack element of the symbolic interpreter.GIt holds either a reference index that refers to this element or just A;, indicating that there are no references to this element.CindigoReference id to a stack cellEindigoGiven a < and a Peano& singleton for a depth, it puts a new :< at that depth (0-indexed) and returns it with the updated <.If there is a :" there already it is used and the < not changed.FindigoDPush a new stack element with a reference to it, given the variable.Gindigo3Push a new stack element without a reference to it.Hindigo\Remove the top element of the stack. It's supposed that no variable refers to this element.Iindigo>Return a variable which refers to a stack cell with operationsJindigo;Return a variable which refers to a stack cell with storage789:;<=>?@ABCDEFGHIJ:;C<=>?@ABDEFGH98I7JNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp_ indigo.Decide whether type is either primitive or ADTindigo5Type class instantiated for all possible Indigo types\indigoLike a+, but this one doesn't keep name of a fieldaindigoHAuxiliary datatype to define a Objiable. Keeps field name as type paramindigoLAuxiliary type family to convert list of field names to list of field typesdindigoyA 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.eindigoJValue 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.findigoGDecomposed product type, which is NOT stored as one cell on the stack.gindigo?Convert a list of fields from name-based list to type-based onehindigo@Convert a list of fields from type-based list to named-based oneYZ[\]^_`abcdefghijkldefabc\]Z`^_ghjk[lYiNone9!"#$%&'*+,-./12456789;<=>?@ACHMNPSUVX_`befgkmp>qindigoResulting state of IndigoM.sindigo"Stack of the symbolic interpreter.tindigoGenerated Lorentz code.uindigoClearing Lorentz code.indigoIndigoState data type.It takes as input a <( (for the initial state) and returns a q: (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.It has no return type, IndigoState instruction may take one or more "return variables", that they assign to values produced during their execution.indigo Inverse of  for utility.indigoThen for rebindable syntax.indigoPut new q.indigo The simplest 7, it does not modify the stack, nor the produced code.indigo@Assigns a variable to reference the element on top of the stack.indigoUtility function to create ! that need access to the current <.indigoF version for {indigoG version for {indigoH version for {indigofProduces the generated Lorentz code that cleans after itself, leaving the same stack as the input oneindigo Version of I/ which performs some optimizations immediately.#In particular, this avoids glueing Nops.*qqrstuvwxyz{|}~*qvwxyz{|}~qrstuNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpJ indigoSimple datatype used to keep a  and its 3 constraintindigoStack representation of  used for constraint checking indigo-Keeps the 0-indexed depth of a variable as a    letonindigo'Puts a copy of the value for the given : on top of the stackindigoSets the value for the given :" to the topmost value on the stackindigo Updates the value for the given :I with the topmost value on the stack using the given binary instruction.indigoGiven a stack with a list of .s on its bottom, updates it by appending the  on the top. indigoLike  , but requires the depth of the : in the input stack indigoLike  , but requires the depth of the : in the input stackindigoLike  , but requires the depth of the : in the input stackindigoCalculates the   of the given : in the stackNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpp!%]\&  ^_a`'(+*)('&%$#"! ) S*RQNM+,-.z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilonpqstuvwxy{|~r     ,-.0123456789:<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-OQSTUWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245!%]\&  ^_a`'(+*)('&%$#"! ) S*RQNM+,-.z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilonpqstuvwxy{|~r     ,-.0123456789:<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-OQSTUWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245 None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpindigob with hidden output stack, necessary to generate typed Lorentz code from untyped Indigo frontend.indigoq with hidden output stackindigoTo run  you need to pass an handler of q$ with any output stack and initial {.indigoConvert  to indigo Similar to a >> for .indigo Modify the q inside a  by passing an handler of q that returns a 8. Useful in some cases to "wrap" or update and exising .   None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp 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.   None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp4indigoiAuxiliary 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)l   "   !#l   "   !# None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp,+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.indigoCompile ; datatype to a cell on the stack. This function leverages +% to put off actual field compilation.indigoConvert arbitrary d into - with respect to given converter for fields.indigoCompile dM to a stack cell, with respect to given function that compiles inner fields.0indigouThis function might look cumbersome but basically it 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 f variables and  expressions."This function can't be called for 3 constructor, but we take care of it just in case.+,-./012345678.+,-0/43218765 None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp79indigo'Datatype representing decomposition of .indigoAlike & datatype but without objects argument<indigo~For given element on stack, generate code which decomposes it to list of its deep non-decomposable fields. Clean up code of  composes the value back.=indigoADecompose (shallowly) an expression to list of its direct fields.indigoDecompose any d& with regards to decomposer for field.indigoADeconstruct top element of the stack and return it wrapped into ; constructor.indigo7Push the passed stack cells without references to them.[9:;<==<9:;[None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp;indigoGeneric generator of failing # from failing Lorentz instructions.>?@AB>?@ABNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpK`indigo<Expression class to remove an element from a data structure.!Note that while this is based on  and $F, it is necessary to have different instances to allow for different  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  and $F, it is necessary to have different instances to allow for different  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 (y and  ) as well as key only ().Gindigo(Create an expression holding a variable.dindigovConvert between types that have the same Michelson representation and an explicit permission for that in the face of  constraint.eindigoRConvert between expressions of types that have the same Michelson representation.xCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~xFGHIKMOQTSJLNPRUWY[]_VXZ\^`abcdefhljnpgimkoqrstuvxwyz{|}~DCE!J6L6N7P7R7V4X4Z4\4^4`4g8i8k2m3o265888888888888888"None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpS[   "   !#+,-./0123456789:;<=CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~#None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpY_cq789:;<=>?@ABCDEFGHIJYZ[\]^_`abcdefghijklqrstuvwxyz{|}~   "   !#+,-./0123456789:;<=CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpyindigoTType 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 u 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 :$ over each expression of the latter.indigoeAllocate variables referring to result of the statement. Requires an allocator operating in a Monad.indigo^Push the variables referring to the result of the statement on top of the stack of the given <.indigo5Pretty printing of statements like "var := statement"indigo Prettify ret valueindigo2This 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 variables in the <8, referring to the generated expressions, and generate u for the whole statement.indigo$Utility function to compile from an indigo!Partially applied constructor of { (without passed <). E function is usually being called from another function which is in  and, consequently, holding { with all fields.indigo$Code (and clear) of a wrapping scopeindigoGReturn value of a scope (either primitives or expressions or variables)None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpIindigoKAssign the given variable to the value resulting from the given expression.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.Pay attention that this function takes a next RefId but it doesn't return RefId because all allocated variables will be destroyed during execution of the function, so allocated ones won't affect next allocated ones.indigo7Set the field (direct or indirect) of a complex object.indigoJCall binary operator with constant argument to update a variable in-place.None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp indigo=Describes kind of lambda: pure, modifying storage, effectfullindigoEProvide common constraints that are presented in all constructors of indigo Execute lambda depending on its indigo'Create initial stack vars depending on indigo{Create a lambda, that takes only one argument, from the given computation, and return a variable referring to this lambda.indigoHExecute a lambda, which accepts only one argument, on passed expression.indigoHExecute a lambda that accepts only one argument on the given expression.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.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.indigoKind of lambdaindigoNext free variable referenceindigo5Variable that will be assigned to the resulting valueindigo;Variable(s) that will be assigned to the resulting value(s)indigo;Variable(s) that will be assigned to the resulting value(s)indigo;Variable(s) that will be assigned to the resulting value(s)None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmphindigoIf statement. All variables created inside its branches will be released after the execution leaves the scope in which they were created.indigo,If-statement that works like case for Maybe.indigo$If which works like case for Either.indigo%If which works like uncons for lists.indigoExpression for the control flowindigo"Code block for the positive branchindigo&Return value(s) of the positive branchindigo"Code block for the negative branchindigo&Return value(s) of the negative branchindigo;Variable(s) that will be assigned to the resulting value(s)indigoExpression for the control flowindigoVariable for the ^) value (available to the next code block)indigoCode block for the ^ branchindigoReturn value(s) of the ^ branchindigoCode block for the ] branchindigoReturn value(s) of the ] branchindigo;Variable(s) that will be assigned to the resulting value(s)indigoExpression for the control flowindigoVariable for the b) value (available to the next code block)indigoCode block for the b branchindigoReturn value(s) of the b branchindigoVariable for the a) value (available to the next code block)indigoCode block for the a branchindigoReturn value(s) of the a branchindigo;Variable(s) that will be assigned to the resulting value(s)indigoExpression for the control flowindigo@Variable for the "head" value (available to the next code block)indigo@Variable for the "tail" value (available to the next code block)indigo(Code block for the non-empty list branchindigo,Return value(s) of the non-empty list branchindigo$Code block for the empty list branchindigo(Return value(s) of the empty list branchindigo;Variable(s) that will be assigned to the resulting value(s)None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpޒ indigo)This constraint is shared by all backend case* functions.indigo!This constraint is shared by all case*0 functions. Including some outside this module.indigoThis 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.indigoAVariable for the clause input value (available to its code block)indigoClause code blockindigoClause return value(s)indigo;Variable(s) that will be assigned to the resulting value(s)indigo;Variable(s) that will be assigned to the resulting value(s)indigo;Variable(s) that will be assigned to the resulting value(s)None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp  indigoWhile statement. indigoFWhile-left statement. Repeats a block of code as long as the control U is a, returns when it is b. indigo+For statements to iterate over a container. indigoPut a document item.indigorGroup documentation built in the given piece of code into a 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.indigoGGive a name to the given contract. Apply it to the whole contract code.indigo*Attach general info to the 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 comment indigoExpression for the control flowindigo:Block of code to execute, as long as the expression holds ` indigo%Expression for the control flow valueindigoVariable for the a$ value (available to the code block)indigo)Code block to execute while the value is aindigo5Variable that will be assigned to the resulting value indigo(Expression for the container to traverseindigo;Variable for the current item (available to the code block)indigo8Code block to execute over each element of the containerindigo0Variable that will be assigned to the resulting #indigo0Variable that will be assigned to the resulting #indigo0Variable that will be assigned to the resulting indigo&Code block to execute inside the scopeindigo(Return value(s) of the scoped code blockindigo;Variable(s) that will be assigned to the resulting value(s)V>?@AB        None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpindigo#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 Constructor wrapper which holds IndigoM3 function among with the callstack of caller side.#The another option could be to add  to Instr constructor of Program" but this would have held only a Y) of separate primitive statement (unlike updateStorageField, etc). The idea is to be able to have correspondence between original Indigo code and the generated Michelson assembler and vice versa to perform quick navigation and analyze, so it's better to have call stack for non-primitive frontend statements.9indigo@Analogous datatype as IndigoCaseClauseL from Indigo.Backend.Case&7$(432/#! "%&')*+,-.015689:&7$(432/#! "%&')*+,-.015689:None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp,?;indigo8Type of a contract that can be compiled to Lorentz with compileIndigoContract.<indigo$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.Cindigo.Traverse over Freer structure and interpret it ;<=>?@ABC <=>?@ABC;None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpJindigo2Representation of a branch of a generic case-like V.LindigoAnalogous datatype as  and IndigoMCaseClauseL.!indigo Common constraint for case-like Vs.Qindigo%Data type internally used to collect Vs from <Vindigo&Data type representing an instruction.Differently from the frontend this is not used to build a Monad of some kind, it is instead based on having as argument the variable to associate with the resulting value (if any).(This is combined in simple lists, named v, and it is intended to be easily altered, this is because these are used as the intermediate representation between the frontend and the backend, where optimizations can occur.vindigoSimple synonym for a list of VwindigoTransformation from < to a v of Vs.Requires the first non-used C and returns the next one."indigo'Collects instructions starting from an <. Returns an Q& as well as the return value for that <.#indigo$Collects instructions starting from P. IMPORTANT: the instructions are collected in the opposite order (as a stack).$indigoContinues collecting Vs from an inner <> (e.g. scoped). This keeps advancing the ref counter as well.%indigoLJust a common set of steps used by collection of single-arg lambda's values.&indigo Append a new V& to the head of the list in the state.'indigoGCreates a new var. This simply advances the ref counter and updates it.xindigoTranslation from a v and an initial { to Lorentz.(indigoTranslation from a v to a .)indigoTranslation from a single V to a .*indigoLConvert clauses from their "sequential" representation to the "backend" one.+indigo7Allocate vars for the return value(s) of a clause-like V.,indigo*Collects clauses of a case-like statement.yindigoApplies the given v to v> transformation to the inner code block of every case clause.zindigoaApplies the given monadic function giving it the inner code block of each case clause, in order.Kindigo6Input variable (accessible to the branch's code block)indigoCode block for this branchindigoReturn value of this branch]indigoQKind of lambda (pure, storage modification, fully functional lambda with effects)indigoName of the lambdaindigo"Expression for the lambda argumentindigoDVariable for the argument value (available to the lambda code block)indigoCode block for the lambdaindigoReturn value(s) of the lambdaindigo;Variable(s) that will be assigned to the resulting value(s)^indigoInitial < to be used in the lambda codeindigoDVariable for the argument value (available to the lambda code block)indigoCode block for the lambdaindigoReturn value(s) of the lambdaindigo6Variable that will be assigned to the resulting lambda_indigo"Expression for the lambda argumentindigo%Variable of the lambda to be executedindigo;Variable(s) that will be assigned to the resulting value(s)`indigo&Code block to execute inside the scopeindigo(Return value(s) of the scoped code blockindigo8Variable that will be assigned to the resulting value(s)aindigoExpression for the control flowindigo"Code block for the positive branchindigo&Return value(s) of the positive branchindigo"Code block for the negative branchindigo&Return value(s) of the negative branchindigo;Variable(s) that will be assigned to the resulting value(s)bindigoExpression for the control flowindigoVariable for the ^) value (available to the next code block)indigoCode block for the ^ branchindigoReturn value(s) of the ^ branchindigoCode block for the ] branchindigoReturn value(s) of the ] branchindigo;Variable(s) that will be assigned to the resulting value(s)cindigoExpression for the control flowindigoVariable for the b) value (available to the next code block)indigoCode block for the b branchindigoReturn value(s) of the b branchindigoVariable for the a) value (available to the next code block)indigoCode block for the a branchindigoReturn value(s) of the a branchindigo;Variable(s) that will be assigned to the resulting value(s)dindigoExpression for the control flowindigo@Variable for the "head" value (available to the next code block)indigo@Variable for the "tail" value (available to the next code block)indigo(Code block for the non-empty list branchindigo,Return value(s) of the non-empty list branchindigo$Code block for the empty list branchindigo(Return value(s) of the empty list branchindigo;Variable(s) that will be assigned to the resulting value(s)eindigo;Variable(s) that will be assigned to the resulting value(s)findigo;Variable(s) that will be assigned to the resulting value(s)gindigo;Variable(s) that will be assigned to the resulting value(s)hindigoExpression for the control flowindigo:Block of code to execute, as long as the expression holds `iindigo%Expression for the control flow valueindigoVariable for the a$ value (available to the code block)indigo)Code block to execute while the value is aindigo5Variable that will be assigned to the resulting valuejindigo(Expression for the container to traverseindigo;Variable for the current item (available to the code block)indigo8Code block to execute over each element of the containerqindigo0Variable that will be assigned to the resulting rindigo0Variable that will be assigned to the resulting #sindigo0Variable that will be assigned to the resulting #2JKLMNOPQRSTUVtaeXqpol`\WZ[]bcdfghijkmnrsuY^_vwxyz}2vVtaeXqpol`\WZ[]bcdfghijkmnrsuY^_LMJKNOP}QRSTUwxyzNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpj-indigovContains all the data necessary for the generation of a single-argument lambda. Is compared only on the base of it's ..~indigoCollects named lambdas that are used more than once and separates them into a lambda creation and multiple lambda executions. Leaves the remaining lambdas untouched, to be compiled inline./indigoCollect all used lambdas in a computation that are called at least twice. Only the outer lambdas will be gathered, for example, if we call lambda "func1" from "func0", only "func0" will be considered.0indigoAssociates each given - to a new C>, starting from the given one. Also returns the first unused C1indigo Generates an Vm for each given tuple, to generate a lambda (assigned to the respective variable) and leave it on the stack.2indigo Updates a v, it looks for lambda Calls: (defined and used in place) to replace them with lambda ExecD, provided there is a known variable for an already created lambda.~~None7!"#$%&'*,-.12456789;<=>?@ACHMNPSUVX_`befgkmpx3indigo!Basically copy-pasted version of  with fixed .indigoBConvert from enum-based verbosity description to specific actions.None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp4indigo=Typeable and stack size constraints for the parameters of an 5.5indigo  equivalent of indigo=Typeable and stack size constraints for the parameters of an  and for converting to a  indigoType of a function with n : arguments and  IndigoM a result.&Note that the arguments are the first n elements of the inp( stack in inverse order, for example: IndigoWithParams 2 [a, b, c] x is the same as: Var b -> Var a -> IndigoM xindigo Converts an  to its form without input :s, alongside the <6 to use it with and the first available (unassingned) C.6indigo  version of indigo Converts an ; to the equivalent <8 with the storage, parameter and ops list as arguments.None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp7indigoCompile 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 ).8indigoSpecialization of 7 without var decompositions.indigoSimplified version of 8indigoVCompile Indigo code to Lorentz contract. Drop elements from the stack to return only  [Operation] and storage.indigoSimplified version of None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp-)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.indigo$Sets a storage field to a new value.indigo-Updates a storage field by using an updating <.indigo1Get a field from the storage, returns a variable.?Note that the storage type almost always needs to be specified.indigoDRun the instruction when the condition is met, do nothing otherwise.indigo Reverse of .indigo6Run the instruction when the given expression returns ^ a value, do nothing otherwise.indigo6Run the instruction when the given expression returns ], do nothing otherwise.indigo=A case statement for indigo. See examples for a sample usage.indigo for tuples.indigo# 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  IndigoAnyOuty, 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.indigo Alias for  we use in the tutorial.indigoA more specific version of  meant to more easily create ;s.Used in the tutorial. The 8I constraint is specified to avoid the warning for redundant constraints.indigo 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 A. * Your computation is called only once, in this case also use .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.indigo6Like defNamedEffLambda1 but doesn't make side effects.indigo2Like defNamedLambda1 but doesn't take an argument.indigoQLike defNamedEffLambda1 but doesn't modify storage and doesn't make side effects.indigoWhile statement.indigo+For statements to iterate over a container.indigoPut a document item.indigorGroup documentation built in the given piece of code into a block dedicated to one thing, e.g. to one entrypoint.indigohInsert documentation of the contract's storage type. The type should be passed using type applications.indigoGGive a name to the given contract. Apply it to the whole contract code.indigo*Attach general info to the given contract.indigo:Attach default general info to the contract documentation.indigo0Indigo version for the homonym Lorentz function.indigoPut a   doc item.indigoPut a  doc item.indigoPut a  doc item.indigoGCreate contract using default compilation options for Lorentz compiler.See  Lorentz.Run.indigo!Create contract from raw Lorentz 9.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.QQ000$None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmpZ;<=>?@ABCNone8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp indigo4Pretty-print an Indigo contract into Michelson code.indigo*Generate an Indigo contract documentation.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.indigo9Print the generated documentation to the standard output.indigo3Save the generated documentation to the given file.indigoForce result to be single line None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp:indigoDisambiguation 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.;;!None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp!indigoIndigo version of the viewE macro. It takes a function from view argument to view result and a ;2 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 ; 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.%None8!"#$%&'*+,-.12456789;<=>?@ACHMNPSUVX_`befgkmp##!%]\&  ^_a`'(+*)('&%$#"! ) S*RQNM+,-.z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilonpqstuvwxy{|~r     ,-.0123456789:<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-      !"#$%&')(*+,-/.1042356789:;<=>?@ABCDEFGHIJMLKUVUTSRQPONXWZY[_^]\`edcbajihgflknmopqrstuvwxyz{|}~       !"#$#"%&'&%()*+,+*-./0123654987;:=<?>A@BCDEFGHIJKLMNOPQTSRUVWYXZ[]\^_`abcdhijihgfeklmlnopqrstwvuxzy{}|~      !"#$&%'()*+-,+./012345678>=<;:98?@ABCDEFGHIJKLMNOQSTUWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245789:;<=>?@ABCDEFGHIJYZ[\]^_`abcdefghijklqrstuvwxyz{|}~   "   !#+,-./0123456789:;<=CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~;<=>?@ABC!%]\&  ^_a`'(+*)('&%$#"! ) S*RQNM+,-.z/01YXWVU23456#"$}789:;<= >[`?@ZA\BCDEFGHI]^JcdeK_LMNOPQRSTUabVWXYfghkjilonpqstuvwxy{|~r     ,-.0123456789:<=>?@ABCDEFGHIJKLZ[bcdefghijklmnopqrstuvwxyz{|}~  3.-      !"#$%&')(*+,-/.1042356789:;<=>?@ABCDEFGHIJMLKUVUTSRQPONXWZY[_^]\`edcbajihgflknmopqrstuvwxyz{|}~       !"#$#"%&'&%()*+,+*-./0123654987;:=<?>A@BCDEFGHIJKLMNOPQTSRUVWYXZ[]\^_`abcdhijihgfeklmlnopqrstwvuxzy{}|~      !"#$&%'()*+-,+./012345678>=<;:98?@ABCDEFGHIJKLMNOQSTUWXYZ[\]^_`ab10cdefghijklmnopqrstuvwxyz{|}~    !"#$%&'()*+,/245789:;<=>?@ABCDEFGHIJYZ[\]^_`abcdefghijklqrstuvwxyz{|}~   "   !#+,-./0123456789:;<=CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~;<=>?@ABC&None8!"#$%&'*,-.12456789;<=>?@ACHMNPSUVX_`befgkmp]1<=>?@ABCD'()*+,'-.'-/'01'02'(3'(4'56'57'89':;':<':=':>*?@*?A'5B'(C'(D'(E'(F'GH'IJ'8K'8L'8M'8N'OP'(Q'(R'(S'(T'(U'(V'(W'(X':Y':Z*?['\]'8^'8_'(`'(a'5b*?c'de'8f'8g'hi'jk'Gl'Im'(n'op'qr'st'uv'wx'(y'(z*{|*{}*{~*{*{''''''*{'8'8*{*{'''''''*{'u*{'*{*{*{'''8*{''*{*{*{'('''('('('(*?'''('('('('('''''''''''''''''''''''''''w'O'O'O'O'O'O'O'O'O'O'O'O'O'O'q'q 'q 'q 'q 'q 'q'q'q''''''''''''' '!'"'#'$'%&''(')*')+',-',.',/',0',1'23'24'24'o5'o6'o7'o8'o9'o:';<';=';=';>';?';?'@A'@B'@C'@D'@D'@E'@F'@F'@G'@H'@H'@I'@J'@J'@K'@L'@L'@M'@N'@N'@O'@P'@P'uQ'uR'uS'uS'TU'TV'TW'TX'TY'TZ'T['T\'T]'T^'T_'T`'Ta'Tb'Tc'Td'Te'Tf'gh'gi'j'k'l'm'n'op'oq'oq'rs'rs'tu'tv'tw'tx'ty'\z'\{'\|'\}'\~'\'\'\'\'\'\'\'\'\'\'\'\'''''8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8'8':':':':':':':':''-'-'-'-'-'-'-'-'-'-'-'-'-'-'-'-'-''''''''''''''''0'0'0''5'5'5'5'5''('('('('('('('('('('('('('('('('('('('('('('( ' ' '@ ',-*? *?*?*?*?*?*?*?*? !"#$%&'%&()*+)*,%&-%&.%&/012345645745845945:45;<=>?@ABCDCEFGHIJKLMNLMOLMPLMQLMRLMSLMTLMULMVLMWLMXLMYLMZLM[LM\LM]LM^LM_LM`LMaLMbLMcLMdLMeLMfLMgLMhLMiLMjLMkLMlLMmLMmLMnLMoLMpLMqLMrLMsLMtLMuLMuLMvLMwLMxLMyLMzLM{LM|LM}LM~LM~LMLMLMLMLMLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL L L L L LLLLLLLLLLLLLLLLLLLLL L L!L"L#L$L$L%L&L'L(L)L*L+L,L-L-L.L/L0L1L2L3L4L56L57L58L59L5:L5;L5<L5=L5>L5?L5@L5AL5BL5BL5CL5DL5EL5EL5FL5GL5HLIJLIKLILLIMLINLIOLIPLIQLIRLISLITLIULIVLIWLIXLIYLIZLI[LI\LI]L^_L^`L^aL^bL^cL^dL^eLfgLfhLfiLfjLfkLflLflLfmLfnLfnLfoLfpLfqLfrLfsLftLfuLfvLfwLfxLfyLz{Lz|Lz}Lz~LzLzLzLzLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL L L L L LLLLLLLLLL !"#$4#%&'()*+)*,)*-)*.)*/)*0)*1)*2)*3)*4)*5)*6)*7)*8)*9)*:)*;)<=)<>)?@)AB)AB)CD)CE)FG)FH)IJ)IK)IL)MN)MO)MP)MQ)MR)MS)MT)MU)MV)WX)YZ)[\)[\)[])[^)_`)_`)_a)_b)_c)_d)_e)_e)_f)_f)_g)_g)_h)_i)_j)_j)_k)_k)_l)_m)_n)_o)_o)_p)_q)_r)_s)_t)_u)_u)_v)_v)_w)_x)_y)_z)_{)_|)_})_~)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)_)))))))))))))))))))))))))))))))))))))))))))))))))#%I#$#####################  #  #  #  # ################ #!#"###$#%#&#'#(#)#*+#*,#*-#*.#*/#*0#*1#*2#34#56#57#58#59#5:#5;#5<#5=#5>#5?#5@#5A#5B#5C#5D#5E#5F#5G#5H#5I#5J#5K#5L#5M#5N#5O#5P#5Q#5R#5S#5T#5U#5V#5W#5X#5Y#5Z#5[#5\#5]#^_#^`#^a#^b#^c#^d#ef#eg#eh#ij#ij#ik#il#im#no#np#nq#nr#st#su#sv#sw#xy#xz#x{#x|#}~###########%#%#%#%#%#%#%#%#%#%###############$##01000?CCCCCCCCDIII223<      D !"#$%&'()*+,-./01234567 8 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 { | } ~                                           w x y  N                                 7@ AXML128Q      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrrstuvwxyz{|}~__YZmno(&ptu     xyz{|}~ !"# $ % & ' 6!(!)!*!+!,-./0)1234)56789:;<= > ? @ A B C D EFGHIJKLMNNOPQRSTUVWXYZ[\]^_`abcdeL f g&h&i&j&k&l&m&n&opindigo-0.5.0-inplaceIndigo.Backend.PreludeIndigo.PreludeIndigo.LorentzIndigo.Internal.Expr.THIndigo.Internal.VarIndigo.Internal.ObjectIndigo.Internal.StateIndigo.Internal.LookupIndigo.Internal.SISIndigo.Internal.FieldIndigo.Internal.Expr.Types Indigo.Internal.Expr.CompilationIndigo.Internal.Expr.DecomposeIndigo.Backend.ErrorIndigo.Internal.Expr.SymbolicIndigo.Backend.ScopeIndigo.Backend.VarIndigo.Backend.LambdaIndigo.Backend.ConditionalIndigo.Backend.CaseIndigo.BackendIndigo.Frontend.StatementIndigo.Frontend.ProgramIndigo.Compilation.SequentialIndigo.Compilation.LambdaIndigo.Compilation.HooksIndigo.Compilation.FieldIndigo.Compilation.ParamsIndigo.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:%TrueLeftRightLTEQGTideither mtl-2.2.2Control.Monad.Reader.Class MonadReaderasklocalreaderControl.Monad.State.Class MonadStategetputstatebytestring-0.10.10.0Data.ByteString.Internal ByteString Data.Functor<$><|>StringQhashable-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.TypesHandle<* Alternativemplusmzero MonadPlusData.Functor.Compose getComposeCompose Data.VoidvacuousabsurdVoidData.Semigroup mtimesDefaultcycle1 WrappedMonoid getOptionOptionGHC.ExtssortWithData.Bifunctorsecondfirstbimap BifunctorData.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/floorceilingroundtruncateproperFractionboundedEnumFromThenboundedEnumFrommaxBoundminBoundfromEnumtoEnumpredsuccGHC.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.ReaderReadergetsNlorentz-0.9.0-253080142e413225e11ec6649e311af66fec28f1509036a159056055f9d74356Lorentz.StoreClass mkStoreEpzoomStoreSubmapOpscomposeStoreEntrypointOpssequenceStoreSubmapOpscomposeStoreSubmapOpscomposeStoreFieldOpsmapStoreSubmapOpsValuemapStoreSubmapOpsKeymapStoreFieldOpsstoreEntrypointOpsReferTostoreFieldOpsReferTostoreSubmapOpsReferTostoreEntrypointOpsDeeperstoreSubmapOpsDeeperstoreFieldOpsDeeperstoreEntrypointOpsSubmapFieldstoreEntrypointOpsFieldsstoreEntrypointOpsADTstoreFieldOpsADT stSetEpStore stGetEpStore stToEpStore stSetEpLambda stGetEpLambda stToEpLambda stEntrypoint stSetField stGetField stToField sopSetField sopToField StoreFieldOps storeFieldOps StoreHasField sopInsert sopDelete sopUpdatesopGetsopMemStoreSubmapOpsstoreSubmapOpsStoreHasSubmapEntrypointLambdaEntrypointsField sopSetEpStore sopToEpStoresopSetEpLambda sopToEpLambdaStoreEntrypointOps storeEpOpsStoreHasEntrypoint~>::->StorageContainsLorentz.Errors.Numeric.DocbaseErrorDocHandlersvoidResultDocHandlercustomErrorDocHandlerapplyErrorTagToErrorsDocWithapplyErrorTagToErrorsDoc detmSrcLocDDescribeErrorTagMapNumericErrorDocHandlerErrorNumericErrorDocHandlerNumericErrorWrapperLorentz.Errors.Numeric.ContracterrorToValNumericerrorFromValNumericuseNumericErrorsapplyErrorTagMapWithExclusionsapplyErrorTagMapexcludeErrorTagsbuildErrorTagMapaddNewErrorTagsgatherErrorTags ErrorTagMapErrorTagExclusionsLorentz.UParam pbsUParam uparamFromAdt caseUParamT caseUParamuparamFallbackFail unwrapUParammkUParamEntrypointKind?: UParamUnsafeUParam SomeInterfaceUParam_LookupEntrypointRequireUniqueEntrypointsConstrainedSome unpackUParam UnpackUParamArgumentUnpackFailedNoSuchEntrypointEntrypointLookupErrorEntrypointsImplUParamFallback CaseUParamUParamLinearizeUParamLinearized Lorentz.Macro voidResultTagViewVoid_ VoidResultLorentz.Util.THtypeDocerrorDoc entrypointDocLorentz.Errors typeDocMdDescriptionReferToErrorisInternalErrorClasserrorTagToTexterrorTagToMTextcustomErrorDocHaskellRepGeneralfailUnexpected failUsingisoErrorFromVal isoErrorToVal ErrorScope errorFromVal errorToValIsErrorerrorDocRequirementserrorDocDependencies errorDocClasserrorDocHaskellReperrorDocMdCauseInEntrypointerrorDocMdCause errorDocNameErrorRequirements ErrorHasDocUnspecifiedError SomeErrorErrorArgceArgceTag CustomErrorRequireNoArgErrorErrClassUnknownErrClassContractInternalErrClassBadArgumentErrClassActionException ErrorClasscustomErrArgumentSemanticscustomErrClasscustomErrDocMdCauseInEntrypointcustomErrDocMdCauseCustomErrorHasDocDErrorDThrowsLorentz.ReferenceddropTdipTdupT Lorentz.InstrNonZero Lorentz.PrintprintLorentzContractprintLorentzValue Lorentz.RuncDisableInitialCastLcCompilationOptionsLcCodeLcoStringTransformerLcoOptimizerConfLcoBytesTransformerLanalyzeLorentzinterpretLorentzLambdainterpretLorentzInstrcompileLorentzContractdefaultContractcompileLorentzWithOptionscompileLorentzintactCompilationOptionsdefaultCompilationOptionscoBytesTransformercoStringTransformercoOptimizerConfCompilationOptionsLorentz.Entrypoints.DocentryCaseSimple_areFinalizedParamBuildingStepsfinalizeParamCallingDoc'documentEntrypointclarifyParamBuildingStepsmkDEntrypointArgSimple mkDEpUType emptyDEpArgconstructDEpArg mkPbsWrapInentrypointSectiondiEntrypointToMarkdownDEntrypointDocItemdepSubdepName DEntrypoint entrypointKindSectionDescriptionentrypointKindSectionNameentrypointKindPosEntrypointKindHasDocPlainEntrypointsKindCommonContractBehaviourKindCommonEntrypointsBehaviourKindDEntrypointReferenceunParamBuilder ParamBuilder pbdMichelson pbdHaskell pbdEnglishParamBuildingDesc PbsUncallable PbsCustomPbsCallEntrypoint PbsWrapInParamBuildingStepepaType epaBuildingepaArgDEntrypointArgderiveCtorFieldDocDeriveCtorFieldDocDocumentEntrypoints#-> EntryArrowRequireFlatParamEpsRequireFlatEpDerivation Lorentz.ADT unwrapUnsafe_wrapOnewrap_ fieldCtor deconstructconstructStack modifyField getFieldNamedgetField toFieldNamedtoFieldHasFieldOfType NamedField:=HasFieldsOfType CaseClauseL/-> CaseArrowCaseTCLorentz.Coercions castDummyGallowCheckedCoerceallowCheckedCoerceTocheckedCoercing_checkedCoerce_ checkedCoerce fromNamedtoNamed coerceUnwrap coerceWrap fakeCoercing fakeCoercegForcedCoerce_ forcedCoerce_ forcedCoerceMichelsonCoercible castDummy CanCastTo Castable_ Coercible_ Lorentz.PackexpressionToScriptExprvalueToScriptExpr lEncodeValue lUnpackValue lPackValuelUnpackValueRaw lPackValueRaw Lorentz.BytestoHashHs lSignEd22519toBytes BytesLikeunPackedPacked unTSignature TSignatureunHash HashUnsafeHashtoHash computeHashhashAlgorithmNameKnownHashAlgorithmDHashAlgorithmSha256Sha512Blake2b Lorentz.DocmkDEntrypointExamplecutLorentzNonDocrenderLorentzDocWithGitRevrenderLorentzDocbuildLorentzDocWithGitRevbuildLorentzDocDEntrypointExampleLorentz.Entrypoints.ManualunParameterWraperParameterWrapperLorentz.Wrappable Unwrappable Wrappable Lorentz.Arith ArithResHs ArithOpHsUnaryArithResHsUnaryArithOpHsLorentz.Entrypoints.ImplEpdPlain EpdRecursive EpdDelegate EpdWithRoot Lorentz.ValueList PrintAsValueLorentz.Polymorphic MemOpKeyHsMemOpHs IsoMapOpRes MapOpResHs MapOpInpHsMapOpHs IterOpElHsIterOpHsSizeOpHs UpdOpParamsHs UpdOpKeyHsUpdOpHs GetOpValHs GetOpKeyHsGetOpHs ConcatOpHs SliceOpHs EModOpResHs EDivOpResHsEDivOpHs Lorentz.Ext stackType testAssert printCommentstackRefLorentz.AddressconvertContractRefcallingDefTAddresscallingTAddress unTAddressTAddressunFutureContractFutureContract toAddress ToAddress toTAddress ToTAddress toContractRef ToContractReffromContractRefFromContractRefLorentz.Common Entrypoint Entrypoint_ Lorentz.BaseoptimizeLorentzoptimizeLorentzWithConftransformBytesLorentztransformStringsLorentzparseLorentzValue#iWithVarAnnotations iForceNotFail iMapAnyCodeiNonFailingCodeiAnyCode iGenericIfIFIunLorentzInstr LorentzInstr:->%> ContractOut ContractCodeSomeContractCodeLambdamapLorentzInstrMapLorentzInstrLorentz.Constraints.DerivativeNiceParameterFullLorentz.Entrypoints.CoreparameterEntrypointCallCustomeprNamesepcCallRootCheckedparameterEntrypointCallDefaultparameterEntrypointCallparameterEntrypointsToNotesepdDescsepdCallepdNotesEpdLookupEntrypointEpdAllEntrypointsEntrypointsDerivationRequireAllUniqueEntrypointsParameterEntrypointsDerivationParameterHasEntrypointsParameterDeclaresEntrypointsAllParameterEntrypointsLookupParameterEntrypointGetEntrypointArgGetDefaultEntrypointArgForbidExplicitDefaultEntrypointNoExplicitDefaultEntrypointCall CallDefault EntrypointRefGetEntrypointArgCustomuseHasEntrypointArgHasEntrypointArgHasDefEntrypointArg TrustEpNameHasEntrypointOfType:>ParameterContainsEntrypointsEpdNoneLorentz.Entrypoints.HelpersunHasEntrypointsShouldHaveEntrypointsLorentz.Constraints.ScopesnicePrintedValueEviniceUnpackedValueEvinicePackedValueEviniceConstantEviniceStorageEviniceParameterEvi KnownValue NoOperationNoContractTypeNoBigMap CanHaveBigMap NiceParameter NiceStorage NiceConstantNicePackedValueNiceUnpackedValueNiceFullPackedValueNicePrintedValueNiceComparableLorentz.Annotation HasAnnotationMvinyl-0.12.1-7eed6fcae264e50bba3530560fb2a8e8cadbc76c371a4c09876689da9126d803Data.Vinyl.CoreRecRNil:&Nnamed-0.3.0.1-c213d4c2c01df3dfd493e55bc222296fdaec9c9d140602f3c9de6390e6f03aa3Named.InternalargargFargDefPuniversum-1.6.1-feb74d29edc41a61b0de06fa402f3d29121212e577bc6fc320dbebeb8a0f5a01Universum.TypeOpsUniversum.Debug undefined:!:?Nmorley-1.11.0-02cf00f3e7a99e7ee89144eef8db14b187bd979825f03e4743c75e43db886e78Util.CustomGenericGenericStrategy withDepths rightBalanced leftBalanced rightCombleftCombhaskellBalancedreorderingConstrsreorderingFieldsreorderingDataalphabeticallyleaveUnnamedFieldsforbidUnnamedFieldsfromDepthsStrategycstrfld customGeneric%Michelson.Typed.Haskell.Compatibility ligoLayoutligoCombLayout Util.MarkdownMarkdown Util.LabelLabelMichelson.Untyped.EntrypointsEpName DefEpNameMichelson.TextMTextmt Tezos.CryptoKeyHash Signature PublicKey Tezos.CoreChainId TimestampMuteztoMutez zeroMutezoneMuteztimestampFromSecondstimestampFromUTCTimetimestampQuote Tezos.AddressAddressMichelson.Typed.ExtractmkUTypeMichelson.Typed.Entrypoints EpAddress eaAddress eaEntrypoint Michelson.Doc ContractDoc cdContents cdDefinitionscdDefinitionsSetcdDefinitionIdsSubDoc DocSectionDocElemdeItemdeSubSomeDocDefinitionItem SomeDocItemDocSectionNameStyleDocSectionNameBigDocSectionNameSmall DocItemRefDocItemRefInlined DocItemNoRefDocItemPlacementKindDocItemInlinedDocItemInDefinitions DocItemPos DocItemIdDocItemDocItemPlacementDocItemReferenced docItemPosdocItemSectionNamedocItemSectionDescriptiondocItemSectionNameStyle docItemRefdocItemToMarkdown docItemToTocdocItemDependencies docItemsOrder mdTocFromRefdocItemPositiondocDefinitionRefdocItemSectionRefsubDocToMarkdownDAnchorDCommentGitRepoSettingsgrsMkGitRevision DGitRevisionDGitRevisionKnownDGitRevisionUnknown DDescriptionDNameDGeneralInfoSectionWithFinalizedDocContainsUpdateableDocmodifyDocEntirely ContainsDocbuildDocUnfinalized DocGroupingcontractDocToMarkdown finalizedAsIsbuildDocbuildMarkdownDoc modifyDocmorleyRepoSettingsmkDGitRevisionattachDocCommonsMichelson.Typed.Aliases OperationValueMichelson.Typed.Haskell.ValueBigMapunBigMap ContractRef crAddress crEntrypointWellTypedIsoValueSomeEntrypointCallEntrypointCallIsoValueToTtoValfromValcoerceContractRef%Michelson.Typed.Haskell.Instr.ProductInstrConstructCConstructorFieldTypesMichelson.Typed.Haskell.Doc IsHomomorphicHaveCommonTypeCtorDTypeSomeTypeWithDoc TypeHasDocTypeDocFieldDescriptions typeDocNametypeDocMdDescriptiontypeDocMdReferencetypeDocDependenciestypeDocHaskellReptypeDocMichelsonRepdTypeDepdStoragecustomTypeDocMdReferencehomomorphicTypeDocMdReferencepoly1TypeDocMdReferencepoly2TypeDocMdReferencegenericTypeDocDependencieshomomorphicTypeDocHaskellRepconcreteTypeDocHaskellRepconcreteTypeDocHaskellRepUnsafehaskellRepNoFieldshaskellAddNewtypeFieldhaskellRepStripFieldPrefixhomomorphicTypeDocMichelsonRepconcreteTypeDocMichelsonRep!concreteTypeDocMichelsonRepUnsafeerrorSmicrolens-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.MtlpreuseusepreviewviewEachUniversum.ApplicativepassUniversum.Base$!Universum.Functor.Fmapmap<<$>>Universum.Lifted.Concurrent newEmptyMVarnewMVarputMVarreadMVarswapMVartakeMVar tryPutMVar tryReadMVar tryTakeMVar atomically newTVarIO readTVarIOUniversum.Lifted.EnvexitWith exitFailure exitSuccessdieUniversum.Lifted.File appendFilegetLineopenFilehClosewithFileUniversum.Lifted.IORefnewIORef readIORef writeIORef modifyIORef modifyIORef'atomicModifyIORefatomicModifyIORef'atomicWriteIORefUniversum.Monad.MaybewhenJust whenJustM whenNothing whenNothing_ whenNothingM whenNothingM_Universum.Monad.EitherfromLeft fromRight leftToMaybe rightToMaybe maybeToRight maybeToLeftwhenLeft whenLeftM whenRight whenRightMUniversum.Monad.Trans usingReaderT usingReader usingStateT usingStateevaluatingStateTevaluatingStateexecutingStateTexecutingStateUniversum.Monoid maybeToMonoidUniversum.Container.ClassOneOneItemone ContainerElementtoListnullfoldrfoldlfoldl'lengthelemmaximumminimumfoldMapfoldfoldr'foldr1foldl1notElemallanyandorfindsafeHeadToPairstoPairskeyselems flipfoldl'sumproduct traverse_for_mapM_forM_ sequenceA_ sequence_asumUniversum.Monad.Container concatMapM concatForMandMorMallManyMUniversum.List.Safeuncons whenNotNull whenNotNullMUniversum.ExceptionBugExcbugnoteUniversum.DeepSeq evaluateWHNF evaluateWHNF_ evaluateNF evaluateNF_Universum.Bool.GuardwhenMunlessMifMguardM Universum.NubordNubhashNubsortNub unstableNubUniversum.Print.InternalPrintUniversum.PrinthPutStr hPutStrLnputStrputStrLnprinthPrintputText putTextLnputLText putLTextLn Undefinedtrace traceShow traceShowId traceIdWithtraceShowIdWith traceShowMtraceMtraceIdUniversum.String.ConversionToStringtoStringToLTexttoLTextToTexttoText ConvertUtf8 encodeUtf8 decodeUtf8decodeUtf8Strict LByteStringLText readEithershowWithUniversum.VarArgSuperComposition... runMaybeTmaybeToExceptTexceptToMaybeTData.Text.Encoding.ErrorUnicodeException OnDecodeErrorOnError strictDecode lenientDecodeData.Text.EncodingdecodeUtf8With decodeUtf8' Data.Textwordslinesunlinesunwords fromStrict stm-2.5.0.0Control.Concurrent.STM.TVar modifyTVar'Xsafe-exceptions-0.1.7.0-88d7a06c459925b027b72af16d1e68409f0db4e1b3429187bb7608638bb1d32cControl.Exception.SafethrowMcatchcatchAny handleAnytrytryAny onExceptionbracketbracket_finallybracketOnError execStateT evalStateT withState execState evalStaterunState runStateT runReader runReaderT runExceptTmodify' MonadTransderiveExprBuildable HasStorageHasSideEffectsOpsVar StackVars StkElements FailureStack StackVars'StkElNoRefRefRefId emptyStack assignVarAtpushRef pushNoRefpopNoRef operationsVar storageVar$fBuildableRefId$fTestEqualityTYPEStkEl$fDefaultStackVars$fDefaultStackVars0$fBuildableVar $fShowRefId$fGenericRefId $fEqRefId $fOrdRefId $fRealRefId $fNumRefId$fBoundedRefId $fGenericVar $fShowVarComplexObjectC FieldTypesIsObject TypedFieldObj SomeObjectObject NamedFieldObj unFieldObj IndigoObjectFCell DecomposednamedToTypedRectypedToNamedReccastFieldConstructorsnamedToTypedFieldObjtypedToNamedFieldObjcomplexObjectDict$fIsObject'ProductTypeDa$fIsObject'SumTypeDa$fIsObject'PrimitiveDa $fIsObjectaGenCodegcStackgcCodegcClear GenCodeHooks gchStmtHookgchAuxiliaryHook gchExprHookMetaDatamdStack mdObjectsmdHooksDecomposedObjects IndigoStaterunIndigoStateusingIndigoStateiputnopState assignTopVar withObjectwithObjectState withStackVarsemptyGenCodeHooksstmtHook stmtHookState auxiliaryHookauxiliaryHookStateexprHook exprHookState replStkMd alterStkMd pushRefMd pushNoRefMd popNoRefMd cleanGenCode##$fMonoidGenCodeHooks$fSemigroupGenCodeHooks varActionGet varActionSetvarActionUpdatevarActionOperationrtakerdrop$fTestEqualityTTValSomeIndigoStateunSIS SomeGenCoderunSIStoSISthenSISoverSISHasField fieldLens FieldLens TargetField DeeperField AccessFieldC fetchField assignFieldflSFO fieldLensADTfieldLensDeeper$fHasFielddtfnameftype IsSizeExpr IsMemExpr IsUpdExpr IsGetExpr IsSliceExprIsConcatListExpr IsConcatExpr IsModExpr IsDivExpr IsArithExprIsUnaryArithExprToExprExprType:~>IsExpr ObjectExprNamedFieldExprunNamedFieldExprObjectManipulationToFieldSetFieldExprCVObjManCastSizeUpdateAddSubMulDivModAbsNegLslLsrEq'NeqLeLtGeGtOrXorAndNotInt'IsNatCoerce ForcedCoerceFstSndPairSomeNoneRight'Left'MemStGet StInsertNewStInsertStMemStUpdateStDeleteWrapUnwrap ConstructConstructWithoutNamedNameUnNameEmptySetGetEmptyMap EmptyBigMapPackUnpackPackRaw UnpackRawConsNilConcatConcat'SliceContractSelfContractAddressContractCallingUnsafeRunFutureContractImplicitAccountConvertEpAddressToContractMakeViewMakeVoidCheckSignatureHashKeyNowAmountBalanceSenderExectoExpr$fBuildableObjectManipulation$fToExpr'DecisionExprDExpr*$fToExpr'DecisionObjManDObjectManipulation$fToExpr'DecisionValDa$fToExpr'DecisionVarDVar $fToExprx$fBuildableExprObjManipulationRes StillObjectOnStack compileExpr namedToExprrunObjectManipulation ternaryOpbinaryOpunaryOp nullaryOp ternaryOpFlat binaryOpFlat unaryOpFlat nullaryOpFlatExprDecomposition ExprFields DeconstructeddeepDecomposeCompose decomposeExprfailWith failUsing_ failCustom failCustom_failUnexpected_removeinsert constExprvarExprcastaddsubmul%negeqneqltgtlegeisNattoIntnonZerocoercelsl<<<lsr>>>packunpackpackRaw unpackRawpaircarcdrnonerightleftslicecons.: concatAllnilupdatememsize#:!:+:-: emptyBigMapemptyMapemptySetstGet#@stUpdate!@stInsert+@ stInsertNew++@stDelete-@stMem?@wrapunwrap#!!!nameunName!~#~ construct constructReccontractselfcontractAddresscontractCallingUnsafecontractCallingStringrunFutureContractimplicitAccountconvertEpAddressToContractmakeViewmakeVoidnowamountsendercheckSignaturesha256sha512blake2bhashKeychainIdbalance$fExprMagmaSet$fExprMagmaMap$fExprMagmaBigMap$fExprInsertableSetexKey$fExprInsertableMap(,)$fExprInsertableBigMap(,)$fExprRemovableSet$fExprRemovableMap$fExprRemovableBigMap ScopeCodeGenReturnableValueRetExprsRetVars RetOutStack ScopeCodeGen'compileScopeReturn' liftClear' genGcClear'ReturnableValue' RetOutStack'RetVars' RetExprs' allocateVars' assignVars' prettyAssign' prettyRet'ClassifyReturnValue BranchRetKindUnit SingleValTuple allocateVars liftClear prettyAssign prettyRetcondStmtPretty compileScopefinalizeStatement$fReturnableValue'Unit()$fScopeCodeGen'Unit()$fScopeCodeGen'Tuple(,,)$fReturnableValue'Tuple(,,)$fScopeCodeGen'Tuple(,)$fReturnableValue'Tuple(,)$fScopeCodeGen'SingleValsingle!$fReturnableValue'SingleValsingle assignVarsetVarsetField updateVarExecuteLambdaEff1CCreateLambdaEff1CExecuteLambda1CCreateLambda1CExecuteLambdaPure1CCreateLambdaPure1CCreateLambda1CGenericLambda1Generic LambdaKind PureLambda StorageLambda EffLambdawithLambdaKindexecuteLambda1initLambdaStackVarscreateLambda1Generic IfConstraintif_ifSomeifRightifCons CaseCommonF IndigoClauseIndigoCaseClauseLcaseRec entryCaseRecentryCaseSimpleRec,$fCaseArrownameIndigoClauseIndigoCaseClauseLwhile whileLeftforEachdocdocGroup docStorage contractNamecontractGeneralcontractGeneralDefaultfinalizeParamCallingDoc selfCallingcontractCallingtransferTokens setDelegatecreateContractscopecomment StatementFLiftIndigoState CalledFromNewVarSetVarVarModification LambdaCall1ScopeIfIfSomeIfRightIfConsCase EntryCaseEntryCaseSimpleWhile WhileLeftForEach ContractNameDocGroupContractGeneralFinalizeParamCallingDocTransferTokens SetDelegateCreateContract SelfCallingContractCallingFailFailOverIndigoMCaseClauseLOneFieldIndigoMCaseClauseLIndigoContractIndigoM unIndigoMProgramDoneInstrBindinterpretProgram$fMonadProgram$fApplicativeProgram$fFunctorProgram$fFunctorIndigoM$fApplicativeIndigoM$fMonadIndigoM CaseBranchIndigoSeqCaseClauseOneFieldIndigoSeqCaseClauseSequentialHooks shStmtHookInstrCollectornextRef instrListseqHooks InstructionComment AssignVar CreateLambda1 ExecLambda1BlockindigoMtoSequentialsequentialToLorentz updateClauses mapMClauses$fMonoidSequentialHooks$fSemigroupSequentialHooks stmtHookLcompileLambdas$fOrdLambda1Def$fEqLambda1DefCommentsVerbosity NoCommentsLogTopLevelFrontendStatementsLogBackendStatements LogAuxCodeLogExpressionsComputationsCommentSettings csVerbositycsPrintFullStackTracecsPrintFileNamedefaultCommentSettings$fDefaultCommentSettings$fShowCommentsVerbosity$fEqCommentsVerbosity$fOrdCommentsVerbosity$fBoundedCommentsVerbosity$fEnumCommentsVerbosity$fEqCommentSettings$fShowCommentSettings CommentHookschFrontendHookschBackendHooks$fMonoidCommentHooks$fSemigroupCommentHookssettingsToHooksoptimizeFieldsAreIndigoParamsIndigoWithParamsfromIndigoWithParamscontractToIndigoWithParams compileIndigocompileIndigoContractFullcompileIndigoContractIndigoEntrypointIndigoProcedureIndigoFunctionliftIndigoStatenew=:+=-=*=||=&&=^=<<<=>>>=setStorageFieldupdateStorageFieldgetStorageFieldifNonewhenSomewhenNoneifLeftcase_ entryCaseentryCaseSimple//->#= defFunction defContractdefNamedEffLambda1defNamedLambda1defNamedLambda0defNamedPureLambda1 descriptionanchorexamplecreateLorentzContractassert assertCustom assertCustom_ assertSome assertNone assertRight assertLeft justCommentcommentAroundFuncommentAroundStmtprintIndigoContractrenderIndigoDocprintAsMichelsonsaveAsMichelsonprintDocumentationsaveDocumentation ifThenElsenatintmutezview_projectvoid_ projectVoidsubGt0 TypeDecision IsObject'MapGFTTValMichelson.Typed.TT TValStackVarDepth Util.PeanoPeanoOsingletons-2.6-bc9e9efcd42ed95898675958f8f864b759edb324126e3a605303bb31393c73bbData.Singletons.InternalSingduupXVar replaceNVar updateNVarvarDepthcompileObjectManipulation objToExprcompileObjectF exprToManResSIS'decomposeObjectFdeconstructOnStack noRefGenCodefailIndigoState ExprRemovableExprInsertable compileToExprexecuteLambdaPure1executeLambdaSt1executeLambdaEff1executeLambda1Generic CaseCommon instrCollectcollectStatement collectInnercollectInLambdaappendNewInstr mkNextVarsequentialToSIS instrToSISclausesToBackendallocateClausesVarscollectClauses Lambda1DefldNamecollectNotInlinableLambdascreateLambdaRefscreateAllLambdas updateBlockprettyFrontendCallStackAreIndigoPeanoParamsIndigoWithPeanoParamsfromIndigoWithPeanoParamscompileIndigoImplcompileIndigoFullNumTypeNumKindversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName