#T      !"#$%&'()*+,-./0123456789:;<=>?@A B C D E F G H I J K L M N O P Q RS T UVW X Y Z [ \ ] ^ _ ` a b c d e f g h ijklmn o p q rstuvwxyz { | } ~        !"#$%&'()*+ , - . / 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 nopqrstuvwxyz{|}~                                            !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd e f g h i j k l m n o p q r s t u v w xyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkl m nopqrstuvwxyz{|}~         !!!!!!!!!!!!!!!!!!!! ! ! ! ! !!!!!!!"""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"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:;<=>?@AB&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+{+|+}+~,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------1None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp^lorentz A Generic  HasAnnotation implementationlorentzThis class defines the type and field annotations for a given type. Right now the type annotations come from names in a named field, and field annotations are generated from the record fields.lorentzUsed in V as a flag to track whether or not field/constructor annotations should be generated.lorentzUsed in  and n as a flag to track whether or not it directly follows an entrypoint to avoid introducing extra entrypoints.lorentzQAllow customization of field annotation generated for a type when declaring its  instance.lorentzDrops the field name prefix from a field. We assume a convention of the prefix always being lower case, and the first letter of the actual field name being uppercase. It also accepts another function which will be applied directly after dropping the prefix.lorentzappendTo suffix fields field appends the given suffix to field if the field exists in the fields list.lorentzUse this in the instance of  HasAnnotation1 when field annotations should not be generated.012=210=None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpglorentz1Constraint applied to any part of parameter type.ZNote that you don't usually apply this constraint to the whole parameter, consider using . in such case.Using this type is justified e.g. when calling another contract, there you usually supply an entrypoint argument, not the whole parameter.lorentz/Ensure given type does not contain "operation".lorentz2Gathers constraints, commonly required for values.' !"#$% !"#$%' None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpr+lorentz%Ensure that given type is a sum type.LThis helps to prevent attempts to apply a function to, for instance, a pair.,lorentzJUsed to understand whether a type can potentially declare any entrypoints.-lorentz[A special type which wraps over a primitive type and states that it has entrypoints (one).Assuming that any type can have entrypoints makes use of Lorentz entrypoints too annoying, so for declaring entrypoints for not sum types we require an explicit wrapper.+,-./0101,-./+ None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp,4lorentzsNo entrypoints declared, parameter type will serve as argument type of the only existing entrypoint (default one).5lorentzCheck that the given entrypoint has some fields inside. This interface allows for an abstraction of contract parameter so that it requires some *minimal* specification, but not a concrete one.lorentz1A helper datatype which prettifies interface for 5.7lorentzRChecks that the given parameter consists of some specific entrypoint. Similar as ;> but ensures that the argument matches the following datatype.8lorentz$This wrapper allows to pass untyped yF and bypass checking that entrypoint with given name and type exists.:lorentz;. constraint specialized to default entrypoint.;lorentzWhen we call a Lorentz contract we should pass entrypoint name and corresponding argument. Ideally we want to statically check that parameter has entrypoint with given name and argument. Constraint defined by this type class holds for contract with parameter cp that have entrypoint matching name with type arg.^In order to check this property statically, we need to know entrypoint name in compile time, ?I type serves this purpose. If entrypoint name is not known, one can use 8A wrapper to take responsibility for presence of this entrypoint.mIf you want to call a function which has this constraint, you have two options: 1. Pass contract parameter cp using type application, pass ?H as a value and pass entrypoint argument. Type system will check that cp; has an entrypoint with given reference and type. 2. Pass y wrapped into 8v and entrypoint argument. In this case passing contract parameter is not necessary, you do not even have to know it.<lorentz;Data returned by this method may look somewhat arbitrary. y is obviously needed because name can be ? or 8. Dict is returned because in ?` case we get this evidence for free and don't want to use it. We seem to always need it anyway.=lorentzUniversal entrypoint lookup.>lorentz3Constraint on type-level entrypoint name specifier.?lorentzWhich entrypoint to call.iWe intentionally distinguish default and non-default cases because this makes API more details-agnostic.@lorentzHCall the default entrypoint, or root if no explicit default is assigned.AlorentzCall the given entrypoint; calling default is not treated specially. You have to provide entrypoint name via passing it as type argument.Unfortunatelly, here we cannot accept a label because in most cases our entrypoints begin from capital letter (being derived from constructor name), while labels must start from a lower-case letter, and there is no way to make a conversion at type-level.Blorentz Similar to Cg, but in a version which the compiler can work with (and which produces errors confusing for users :/)Clorentz6Ensure that there is no explicit "default" entrypoint.Dlorentz:Get type of entrypoint with given name, fail if not found.Elorentz:Get type of entrypoint with given name, fail if not found.Florentz#Lookup for entrypoint type by name.4Does not treat default entrypoints in a special way.Glorentz+Get all entrypoints declared for parameter.Hlorentz Version of Ke which we actually use in function signatures. When given type is sum type or newtype, we refer to K9, otherwise we suppose that no entrypoints are declared.Ilorentz$Parameter declares some entrypoints.This is a version of J_ which we actually use in constraints. When given type is a sum type or newtype, we refer to J5 instance, otherwise this instance is not necessary.Jlorentz+Which entrypoints given parameter declares.GNote that usually this function should not be used as constraint, use I for this purpose.Mlorentz&Wrap into constructor with given name.Nlorentz%How one of the entrypoints is called.xType arguments are name of the constructor which eventually gave name to the entrypoint and this entrypoint's argument.PlorentzEntrypoint argument type.QlorentzName of assigned entrypoint.RlorentzIf we emulated entrypoints calling via just wrapping an argument into constructors until getting the full parameter, how would it look like. Steps are enlisted in reversed order - top-level constructors go last.Slorentz*Result of entrypoint lookup at term level.Vlorentz0Ensure that all declared entrypoints are unique.XlorentzMDefines a generalized way to declare entrypoints for various parameter types.8When defining instances of this typeclass, set concrete deriv argument and leave variable cp[ argument. Also keep in mind, that in presence of explicit default entrypoint, all other T arms should be callable, though you can put this burden on user if very necessary.Methods of this typeclass aim to better type-safety when making up an implementation and they may be not too convenient to use; users should exploit their counterparts.YlorentzbName and argument of each entrypoint. This may include intermediate ones, even root if necessary.%Touching this type family is costly (O(N^2)), don't use it often.uNote [order of entrypoints children]: If this contains entrypoints referring to indermediate nodes (not leaves) in orW tree, then each such entrypoint should be mentioned eariler than all of its children.Zlorentz Get entrypoint argument by name.[lorentzJConstruct parameter annotations corresponding to expected entrypoints set.IThis method is implementation detail, for actual notes construction use b.\lorentzConstruct entrypoint caller.AThis does not treat calls to default entrypoint in a special way.HThis method is implementation detail, for actual entrypoint lookup use c.]lorentz:Description of how each of the entrypoints is constructed.^lorentz Version of [o which we actually use in code. It hides derivations stuff inside, and treats primitive types specially like H does._lorentz Version of \o which we actually use in code. It hides derivations stuff inside, and treats primitive types specially like H does.`lorentz Version of ]o which we actually use in code. It hides derivations stuff inside, and treats primitive types specially like H does.alorentz;Descriptions of how each of the entrypoints is constructed. Similar to `R, but includes default entrypoint disregard whether it is explicit or not, while `B includes it only if it is explicit. Also this returns list, not 8, for simplicity.DNote that [order of entrypoints children] property still holds here.blorentz'Derive annotations for given parameter.clorentz!Prepare call to given entrypoint.kThis does not treat calls to default entrypoint in a special way. To call default entrypoint properly use d.dlorentzCall the default entrypoint.elorentzCall root entrypoint safely.glorentzUniversal entrypoint calling.5,456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg5,XYZ[\]STUNOPQRLMVJKIH^_`aGFbEcDdCBe?@A>f=89;<:75g46W60None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpgnlorentz-Constraint applied to a whole parameter type.nn/None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp]' !"#$%nNone7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp: olorentz*Applicable for wrappers over Lorentz code.plorentz'Modify all the code under given entity.lorentz;Errors that can happen during parsing into a Lorentz value.rlorentz An alias for :.}We discourage its use as this hinders reading error messages (the compiler inserts unnecessary parentheses and indentation).wlorentz Alias for x3, seems to make signatures more readable sometimes.:Let's someday decide which one of these two should remain.xlorentzAAlias for instruction which hides inner types representation via T.lorentz4Wrap Lorentz instruction with variable annotations, annotsD list has to be non-empty, otherwise this function raises an error.lorentz`Parse textual representation of a Michelson value and turn it into corresponding Haskell value.Note: it won't work in some complex cases, e. g. if there is a lambda which uses an instruction which depends on current contract's type. Obviously it can not work, because we don't have any information about a contract to which this value belongs (there is no such contract at all).lorentzLorentz version of .lorentzLorentz version of .opqrstuvwxyz{|}~xyzwr|{}~opvustqr2w1x18None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmplorentz Version of  which accepts no argument.lorentz Single entrypoint of a contract.#Note that we cannot make it return [[Operation], store]5 because such entrypoint should've been followed by pairC, and this is not possible if entrypoint implementation ends with failWith. None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp lorentzConvert something from  ContractAddr in Haskell world.lorentzConvert something to n in Haskell world.lorentzHConvert something referring to a contract (not specific entrypoint) to  in Haskell world.lorentzConvert something to } in Haskell world.]Use this when you want to access state of the contract and are not interested in calling it.lorentz!Address associated with value of  contract arg type. Places where nJ can appear are now severely limited, this type gives you type-safety of n but still can be used everywhere. This type is not a full-featured one rather a helper; in particular, once pushing it on stack, you cannot return it back to Haskell world.~Note that it refers to an entrypoint of the contract, not just the contract as a whole. In this sense this type differs from . Unlike with n~, having this type you still cannot be sure that the referred contract exists and need to perform a lookup before calling it.lorentz%Something coercible to 'TAddress cp'.lorentzHAddress which remembers the parameter type of the contract it refers to.It differs from Michelson's contract type because it cannot contain entrypoint, and it always refers to entire contract parameter even if this contract has explicit default entrypoint.lorentzTurn  to n in Haskell world.This is an analogy of address to contractl convertion in Michelson world, thus you have to supply an entrypoint (or call the default one explicitly).lorentzSpecification of  callTAddress to call the default entrypoint.lorentzCast something appropriate to .QWXYZnopq}}WXYZnopqQNone7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp(lorentzEInclude a value at given position on stack into comment produced by . stackRef @0<includes the top of the stack>lorentz-Print a comment. It will be visible in tests.printComment "Hello world!":printComment $ "On top of the stack I see " <> stackRef @0lorentz,Test an invariant, fail if it does not hold.NThis won't be included into production contract and is executed only in tests.lorentz2Fix the current type of the stack to be given one.stackType @'[Natural]"stackType @(Integer : Natural : s)PstackType @'["balance" :! Integer, "toSpend" :! Integer, BigMap Address Integer]3Note that you can omit arbitrary parts of the type.>stackType @'["balance" :! Integer, "toSpend" :! _, BigMap _ _]None8!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpq1 lorentzLifted .lorentzLifted .lorentzLifted .lorentzLifted .lorentzLifted .lorentzLifted .4This could be just a constraint alias, but to avoid W types appearance in error messages we make a full type class with concrete instances.lorentzLifted .lorentzLifted .lorentz-A useful property which holds for reasonable  instances.It's a separate thing from  because it mentions b type parameter.lorentzLifted .None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp4 $# &%"!3453 $#&%"!45None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp9lorentz Provides 5 instance that prints Lorentz value via Michelson's V.7Result won't be very pretty, but this avoids requiring   or  instances.` ()*9:;<?@QRUVWXYZklmnopqrstvuwxy}~JVstvux:}WXYZ~(klmUnopqyRrw9Q )*;<None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmph:lorentzGeneric traversal for .lorentzReturns: 1. Notes corresponding to this level; 2. Field annotation for this level (and which should be used one level above).lorentz6Fetches information about all entrypoints - leaves of  tree.lorentz6Fetches information about all entrypoints - leaves of  tree.lorentz"Traverses sum type and constructs 7 which report constructor names via field annotations.lorentzBuild  by parameter type.lorentzEntrypoints tree - skeleton on  tree later used to distinguish between constructors-entrypoints and constructors which consolidate a whole pack of entrypoints.lorentz6We are in the intermediate node and need to go deeper.lorentzWe reached entrypoint argument. lorentzIWe reached complex parameter part and will need to ask how to process it. lorentz Extension of ,  , and  < which allow specifying root annotation for the parameters. lorentz Extension of : on parameters being defined as several nested datatypes.MIn particular, it will traverse the immediate sum type, and require another J for the inner complex datatypes. Only those inner types are considered which are the only fields in their respective constructors. Inner types should not themselves declare default entrypoint, we enforce this for better modularity. Each top-level constructor will be treated as entrypoint even if it contains a complex datatype within, in such case that would be an entrypoint corresponding to intermediate node in or tree. Comparing to  M this gives you more control over where and how entrypoints will be derived. lorentz Extension of : on parameters being defined as several nested datatypes.aIn particular, this will traverse sum types recursively, stopping at Michelson primitives (like =) and constructors with number of fields different from one.2It does not assign names to intermediate nodes of  tree, only to the very leaves.)If some entrypoint arguments have custom sv instance, this derivation way will not work. As a workaround, you can wrap your argument into some primitive (e.g. :!).lorentzImplementation of Jl which fits for case when your contract exposes multiple entrypoints via having sum type as its parameter.In particular, each constructor would produce a homonymous entrypoint with argument type equal to type of constructor field (each constructor should have only one field). Constructor called )' will designate the default entrypoint.lorentzAMakes up notes with proper field annotations for given parameter.lorentz=Makes up a way to lift entrypoint argument to full parameter.lorentz-Makes up descriptions of entrypoints calling.            None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpklorentzLifted .lorentzLifted .  None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmppJJlorentzJ is similar to lens Wrapped class without the method. It provides type family that is mainly used as constraint when unwrapping Lorentz instruction into a Haskell newtype and vice versa.JKJKNone7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpsNlorentzOWrap parameter into this to locally assign a way to derive entrypoints for it.NOPNOP0None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpu--./456789:;<=?@ABCDEFGIJKVXYZ[\]bcdefg   NOP-XYZ[\]JKIGFbEcDdCBe?@Af=;<:7589gV64   NOP-./None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp Vlorentz!Require several stacks to comply W constraint.Wlorentz"Zipping stack into tuple and back.Xlorentz-A type which contains the whole stack zipped.Ylorentz6Fold given stack into single value in typed Michelson.Zlorentz:Unfold given stack from a single value in typed Michelson.lorentz Version of / which performs some optimizations immediately.#In particular, this avoids glueing Nops and DIP Nops.[lorentz#Fold given stack into single value.\lorentz'Unfold given stack from a single value.]lorentz'Flatten both ends of instruction stack.^lorentz)Unflatten both ends of instruction stack.alorentzHSuch definition seems the only possible one we can support efficiently. VWXYZ[\]^ WXYZ[\V]^ None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp dlorentz)Modify the example value of an entrypointflorentzPut a document item.glorentzpGroup documentation built in the given piece of code into block dedicated to one thing, e.g. to one entrypoint.)Examples of doc items you can pass here: , .hlorentzfInsert documentation of the contract storage type. The type should be passed using type applications.ilorentzCGive a name to given contract. Apply it to the whole contract code.klorentzTakes an instruction that inserts documentation items with general information about the contract. Inserts it into general section. See .llorentzHInserts general information about the contract using the default format.This includes git revision and some other information common for all contracts. Git revision is left unknown in the library code and is supposed to be updated in an executable using e.g. m.plorentz1Leave only instructions related to documentation.This function is useful when your method executes a lambda coming from outside, but you know its properties and want to propagate its documentation to your contract code.|ABCDEFGHIJKLMNOP[\]^_`bacdefghdefghijklmnopq|fgFhjmnoiklpdeq[\Gbacdefgh_`]^HEMOPLABIJKNCDNone6!"#$%&'*,.012456789;<=>?@AHMNPSUVX_`befgkmp }lorentz'Documentation item for hash algorithms.~lorentzHash algorithm used in Tezos.lorentz Hash of type t evaluated from data of type a.lorentz^Open kind for hash algorithms, to make it more difficult to apply type arguments incorrectly.lorentz9Represents a signature, where signed data has given type.HSince we usually sign a packed data, a common pattern for this type is  TSignature ( signedData). If you don't want to use  , use plain TSignature ByteString instead.lorentz Represents a ( resulting from packing a value of type a.This is not+ guaranteed to keep some packed value, and unpack can fail. We do so because often we need to accept values of such type from user, and also because there is no simple way to check validity of packed data without performing full unpack. So this wrapper is rather a hint for users.lorentz0Everything which is represented as bytes inside.lorentzxSign data using Ed25519 curve. TODO [#456]: handle other methods, either all at once (if viable) or each one separatelylorentzEvaluate hash in Haskell world.xyz{|}~}~|{zyxNone7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmplorentz-This function transforms Lorentz values into  script_expr. script_expr is used in RPC as an argument in entrypoint designed for getting value by key from the big_map in Babylon. In order to convert value to the  script_expr9 we have to pack it, take blake2b hash and add specific expr prefix. Take a look at  https://gitlab.com/tezos/tezos/blob/6e25ae8eb385d9975a30388c7a7aa2a9a65bf184/src/proto_005_PsBabyM1/lib_protocol/script_expr_hash.ml and  https://gitlab.com/tezos/tezos/blob/6e25ae8eb385d9975a30388c7a7aa2a9a65bf184/src/proto_005_PsBabyM1/lib_protocol/contract_services.ml#L136 for more information.lorentz Similar to , but for values encoded as s. This is only used in tests.None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp(lorentzCoercions between a to b are permitted and safe.lorentzCoercion from a to b is permitted and safe.lorentzExplicitly allowed coercions.a  b proclaims that a can be casted to b& without violating any invariants of b.This relation is reflexive; it may be symmetric or not. It tends to be composable: casting complex types usually requires permission to cast their respective parts; for such types consider using 4 as implementation of the method of this typeclass.For cases when a cast from a to b| requires some validation, consider rather making a dedicated function which performs the necessary checks and then calls  forcedCoerce.lorentzAn optional method which helps passing -Wredundant-constraints check. Also, you can set specific implementation for it with specific sanity checks.lorentz9Whether two types have the same Michelson representation.lorentzCoercion for Haskell world.CWe discourage using this function on Lorentz types, consider using coerce instead. One of the reasons forthat is that in Lorentz it's common to declare types as newtypes consisting of existing primitives, and  forcedCoerceY tends to ignore all phantom type variables of newtypes thus violating their invariants.lorentzBConvert between values of types that have the same representation.iThis function is not safe in a sense that this allows * breaking invariants of casted type (example: UStore from morley-upgradeable), or * may stop compile on code changes (example: coercion of pair to a datatype with two fields will break if new field is added). Still, produced Michelson code will always be valid.=Prefer using one of more specific functions from this module.lorentz'Convert between two stacks via failing.lorentzSpecialized version of coerce_ to wrap into a haskell newtype.lorentzSpecialized version of coerce_ to unwrap a haskell newtype.lorentz"Lift given value to a named value.lorentzUnpack named value.lorentz)Coercion in Haskell world which respects .lorentzPCoerce between types which have an explicit permission for that in the face of  constraint.lorentz4Pretends that the top item of the stack was coerced.lorentzLocally provide given  instance.lorentzLocally provide bidirectional  instance.lorentzImplementation of { for types composed from smaller types. It helps to ensure that all necessary constraints are requested in instance head.JKJKNone8!"#$%&'*,-.012456789;<=>?@ACHMNPSUVX_`befgkmp?lorentzDProvides "case" arrow which works on different wrappers for clauses.lorentz#Lift an instruction to case clause.\You should write out constructor name corresponding to the clause explicitly. Prefix constructor name with "c" letter, otherwise your label will not be recognized by Haskell parser. Passing constructor name can be circumvented but doing so is not recomended as mentioning contructor name improves readability and allows avoiding some mistakes.lorentzLorentz analogy of , it works on plain  types.lorentzShortcut for multiple  constraints.lorentzA pair of field name and type.lorentzLike &, but allows constrainting field type.lorentz%Allows field access and modification.lorentz]Extract a field of a datatype replacing the value of this datatype with the extracted field.wFor this and the following functions you have to specify field name which is either record name or name attached with (:!) operator.lorentzLike , but leaves field named.lorentzFExtract a field of a datatype, leaving the original datatype on stack.lorentzLike , but leaves field named.lorentzSet a field of a datatype.lorentz)Apply given modifier to a datatype field.lorentzIMake up a datatype. You provide a pack of individual fields constructors.KEach element of the accepted record should be an instruction wrapped with T function. This instruction will have access to the stack at the moment of calling  construct. Instructions have to output fields of the built datatype, one per instruction; instructions order is expected to correspond to the order of fields in the datatype.lorentz Version of + which accepts tuple of field constructors.lorentz-Construct an object from fields on the stack.lorentz*Decompose a complex object into its fieldslorentz)Lift an instruction to field constructor.lorentz0Wrap entry in constructor. Useful for sum types.lorentz=Wrap entry in single-field constructor. Useful for sum types.lorentz$Pattern match on the given sum type.You have to provide a 8; containing case branches. To construct a case branch use  operator.lorentzLike ;, accepts a tuple of clauses, which may be more convenient.sIf user is experiencing problems with wierd errors about tuples while using this function, he should take look at 12 and ensure that his tuple isn't bigger than generated instances, if so, he should probably extend number of generated instances.lorentz?Unwrap a constructor with the given name. Useful for sum types.%+,-./876ij%ji876./-+,00None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpqp-lorentz6Provides arror for convenient entrypoint documentationlorentzLift entrypoint implementation.+Entrypoint names should go with "e" prefix.lorentzTraverse entry points and add parameter building step (which describes necessity to wrap parameter into some constructor of the given datatype) to all parameters described within given code.lorentz*Add corresponding parameter building step.MFirst argument is accumulator for Michelson description of the building step.lorentzConstraint for .lorentzPick a type documentation from .lorentz$Describes argument of an entrypoint.lorentz!Argument of the entrypoint. Pass  if no argument is required. lorentzhDescribes a way to lift an entrypoint argument into full parameter which can be passed to the contract.Steps are supposed to be applied in the order opposite to one in which they are given. E.g. suppose that an entrypoint is called as Run (Service1 arg)C; then the first step (actual last) should describe wrapping into RunQ constructor, and the second step (actual first) should be about wrapping into Service1 constructor. lorentz[Untyped representation of entrypoint, used for printing its michelson type representation. lorentz$Describes a parameter building step.SThis can be wrapping into (Haskell) constructor, or a more complex transformation. lorentzWraps something into constructor with given name. Constructor should be the one which corresponds to an entrypoint defined via field annotation, for more complex cases use . lorentz;Directly call an entrypoint marked with a field annotation.lorentz Other action.lorentzThis entrypoint cannot be called, which is possible when an explicit default entrypoint is present. This is not a true entrypoint but just some intermediate node in orP tree and neither it nor any of its parents are marked with a field annotation.It contains dummy  Bs which were assigned before entrypoints were taken into account.lorentz'Plain english description of this step.lorentz+How to construct parameter in Haskell code.lorentz4How to construct parameter working on raw Michelson.lorentzgWhen describing the way of parameter construction - piece of incremental builder for this description.lorentzuArgument stands for previously constructed parameter piece, and returned value - a piece constructed after our step.lorentz.Inserts a reference to an existing entrypoint.fThis helps to avoid duplication in the generated documentation, in order not to overwhelm the reader.lorentz=Describes the behaviour common for entrypoints of given kind.cThis has very special use cases, like contracts with mix of upgradeable and permanent entrypoints.lorentz3Describes the behaviour common for all entrypoints.}For instance, if your contract runs some checks before calling any entrypoint, you probably want to wrap those checks into EentrypointSection "Prior checks" (Proxy @CommonContractBehaviourKind).lorentzDefault value for ! type argument.lorentz4Describes location of entrypoints of the given kind.All such entrypoints will be placed under the same "entrypoints" section, and this instance defines characteristics of this section.lorentzzPosition of the respective entrypoints section in the doc. This shares the same positions space with all other doc items.lorentz+Name of the respective entrypoints section. lorentz2Description in the respective entrypoints section.!lorentz,Gathers information about single entrypoint.We assume that entry points might be of different kinds, which is designated by phantom type parameter. For instance, you may want to have several groups of entry points corresponding to various parts of a contract - specifying different kindL type argument for each of those groups will allow you defining different 9 instances with appropriate custom descriptions for them.%lorentz"Pattern that checks whether given  hides !" inside (of any entrypoint kind).0In case a specific kind is necessary, use plain (cast -> Just DEntrypoint{..}) construction instead.&lorentzDefault implementation of  for entrypoints.'lorentz0Mark code as part of entrypoint with given name.JThis is automatically called at most of the appropriate situations, like / calls.lorentzShow what given  does on a sample.(lorentzMake a  Z that tells about wrapping an argument into a constructor with given name and uses given # as description of Michelson part.lorentz5Go over contract code and update every occurrence of 5 documentation item, modifying param building steps.-lorentz5Go over contract code and update every occurrence of Y documentation item, adding the given step to its "how to build parameter" description.lorentz,Add necessary documentation to entry points..lorentzLike >, to be used for pattern-matching on a parameter or its part.}Modifies documentation accordingly. Including description of entrypoints' arguments, thus for them you will need to supply b instance./lorentz Version of . for tuples.0lorentzjWrapper for documenting single entrypoint which parameter isn't going to be unwrapped from some datatype. entryCases unwraps a datatype, however, sometimes we want to have entrypoint parameter to be not wrapped into some datatype.1lorentzWModify param building steps with respect to entrypoints that given parameter declares.Each contract with entrypoints should eventually call this function, otherwise, in case if contract uses built-in entrypoints feature, the resulting parameter building steps in the generated documentation will not consider entrypoints and thus may be incorrect.9Calling this twice over the same code is also prohibited.VThis method is for internal use, if you want to apply it to a contract manually, use 2.2lorentzUVersion of 'finalizeParamCallingDoc'' more convenient for manual call in a contract.3lorentzWhether 2) has already been applied to these steps.5lorentz Version of /C for contracts with flat parameter, use it when you need only one /& all over the contract implementation.lorentz6Surrouned a markdown text in a span tag with given id.:>[\      !"#$%&'()*+,-./012345:!"#$% '&  [\   (-)*>+,0/.21345None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpJlorentzLCode for a contract along with compilation options for the Lorentz compiler.It is expected that a J is one packaged entity, wholly controlled by its author. Therefore the author should be able to set all options that control contract's behavior.~This helps ensure that a given contract will be interpreted in the same way in all environments, like production and testing.Raw u2 should not be used for distribution of contracts.LlorentzThe contract itself.MlorentzBFlag which defines whether compiled Michelson contract will have CASTs (which drops parameter annotations) as a first instruction. Note that when flag is false, there still may be no CAST3 (in case when parameter type has no annotations).Nlorentz5General compilation options for the Lorentz compiler.Olorentz4Options to control Lorentz to Michelson compilation.QlorentzConfig for Michelson optimizer.Rlorentz(Function to transform strings with. See .Slorentz-Function to transform byte strings with. See .TlorentzRRuns Michelson optimizer with default config and does not touch strings and bytes.Ulorentz?Leave contract without any modifications. For testing purposes.Vlorentz%For use outside of Lorentz. Will use T.WlorentzUCompile Lorentz code, optionally running the optimizer, string and byte transformers.XlorentzCompile contract with T and M set to False.Ylorentz&Compile a whole contract to Michelson.Note that compiled contract can be ill-typed in terms of Michelson code when some of the compilation options are used (e.g. when ccoDisableInitialCast is TrueB, resulted contract can be ill-typed). However, compilation with !defaultContractCompilationOptions should be valid.Zlorentz_Interpret a Lorentz instruction, for test purposes. Note that this does not run the optimizer.[lorentzLike Z9, but works on lambda rather than arbitrary instruction.\lorentzLorentz version of analyzer.JKLMNOPQRSTUVWXYZ[\_`abcdOPQRSTU_`aVWJKLMNXYbdcZ[\None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpQelorentzRun a lambda with given input.Note that this always returns one value, but can accept multiple input values (in such case they are grouped into nested pairs).'For testing and demonstration purposes.florentzLike e&, assumes that no failure is possible.'For testing and demonstration purposes.import Lorentz.Instrnop -$ 55 sub -$ (3, 2)1 push 9 -$ ()9add # add -$ ((1, 2), 3)6glorentz(Version of (-$?) with arguments flipped.hlorentz'Version of (-$) with arguments flipped.ilorentz1Version of (-$) applicable to a series of values.efghiefghie2f2g2h2i2None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpjlorentz.Pretty-print a Haskell value as Michelson one.klorentz4Pretty-print a Lorentz contract into Michelson code.jkjk None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpllorentzEstimate code operation size.mlorentzEstimate value operation size.STz{|lmz{|STlmNone7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpխolorentz(Retain the value only if it is not zero.{lorentz Drop top n elements from the stack.~lorentz Version of G which uses Peano number. It is inteded for internal usage in Lorentz.lorentz Version of G which uses Peano number. It is inteded for internal usage in Lorentz.lorentz Similar to @ but works for lambdas with arbitrary size of input and output.Note that this instruction has its arguments flipped, lambda goes first. This seems to be the only reasonable way to achieve good inference.lorentz Version of @ that works for lambdas with arbitrary length input and output.lorentz Version of G which uses Peano number. It is inteded for internal usage in Lorentz.lorentz(Get a reference to the current contract.Note that, similar to  instruction, in Michelson k instruction can accept an entrypoint as field annotation, and without annotation specified it creates a contract* value which calls the default entrypoint.2This particular function carries the behaviour of SELFR before introduction of lightweight entrypoints feature. Thus the contract must not6 have explicit "default" entrypoint for this to work.DIf you are going to call a specific entrypoint of the contract, see .lorentzFMake a reference to the current contract, maybe a specific entrypoint.Note that, since information about parameter of the current contract is not carried around, in this function you need to specify parameter type p explicitly.lorentz-Get a reference to a contract by its address.*This instruction carries the behaviour of CONTRACTM before introduction of lightweight entrypoints feature. The contract must not5 have explicit "default" entrypoint for this to work.DIf you are going to call a specific entrypoint of the contract, see .lorentz<Make a reference to a contract, maybe a specific entrypoint.fWhen calling this function, make sure that parameter type is known. It's recommended that you supply 2 with a concrete parameter as the stack argument.lorentzSpecialized version of I for the case when you do not have compile-time evidence of appropriate ;%. For instance, if you have untyped y^ you can not have this evidence (the value is only available in runtime). If you have typed ?, use f to construct y.lorentz Version of N instruction which may accept address with already specified entrypoint name.TAlso you cannot specify entrypoint name here because this could result in conflict.lorentz Similar to  , works with W.=Validity of such operation cannot be ensured at compile time.lorentz-Execute given instruction on truncated stack.ZThis instruction requires you to specify the piece of stack to truncate as type argument.lorentzHelper instruction.jChecks whether given key present in the storage and fails if it is. This instruction leaves stack intact.lorentzLike <, but throw an error on attempt to overwrite existing entry.snopqrstuvwxyz{|}~suvwxyz{|}t~srpqnoNone8!"#$%&'*,-.012456789;<=>?@ACHMNPSUVX_`befgkmp[ lorentz Version of  for multiple variables.Ltype HasContext = HasNamedVars s ["x" := Integer, "f" := Lambda MText MText]lorentzIndicates that stack s contains a  name :! var or  name :? var value.lorentz*1-based position of the variable on stack.lorentzRequires type x to be an unnamed variable. When e.g. b sees a polymorphic variable, it can't judge whether is it a variable we are seeking for or not;  VarIsUnnamedE helps to assure the type system that given variable won't be named.lorentz with pretty error message.lorentzGet variable name.lorentzName of a variable on stack.lorentzGet the variable at nO-th position on stack, assuming that caller is sure that stack is long enough.@martoon: I'm not ready to fight the compiler regarding numerous complex constraints, so just assuring it that those constraints will hold.lorentz Version of ' that leaves a named variable on stack.lorentz>Take the element with given label on stack and copy it on top.eIf there are multiple variables with given label, the one closest to the top of the stack is picked. None8!"#$%&'*,-.012456789;<=>?@ACHMNPSUVX_`befgkmpKlorentz<Allows diving into stack referring expected new tip by type.Implemented with fun deps for conciseness; we can replace them with a type family anytime, but that would probably require more declarations.lorentz9Allows duplicating stack elements referring them by type.lorentz3Duplicate an element of stack referring it by type.IIf stack contains multiple entries of this type, compile error is raised.lorentzFDip repeatedly until element of the given type is on top of the stack.IIf stack contains multiple entries of this type, compile error is raised.lorentz2Remove element with the given type from the stack.!None8!"#$%&'*,-./012456789;<=>?@AHMNPSUVX_`befgkmp3lorentz*Helper which documents single constructor.lorentz0Information to be provided for documenting some  x.lorentzImplementation for h of the corresponding  Extensible.lorentzImplementation for c of the corresponding  Extensible.lorentz!Overall description of this type.lorentz1Generic implementation of toExtVal and fromExtVallorentz?Having a sum-type, yields a type-level list of its constructorslorentzTransform list of  s to list of  2s, assigning numbers to elements starting from 0. lorentz>Finds the constructor's position and argument type by its namelorentz'Errors related to fromExtVal conversion lorentzqHelper typeclass which allows us to sanely handle cases of no-arg constructor and constructor with one argument. lorentz3Pack argument on top of the stack, if any required.lorentzConverts a value from a Haskell representation to its extensible Michelson representation (i.e. (Natural, Bytestring) pair).lorentzConverts a value from an extensible Michelson representation to its Haskell sum-type representation. Fails if the Michelson representation points to a nun-existent constructor, or if we failed to unpack the argument.lorentzGWraps an argument on top of the stack into an Extensible representation"None9!"#$%&'*,-.012456789:;<=>?@AHMNPSUVX_`befgkmpZ*lorentz Documentation for custom errors.,Mentions that entrypoint throws given error.lorentz(Mentions that contract uses given error.lorentz/What should happen for this error to be raised.lorentzBrief version of R. This will appear along with the error when mentioned in entrypoint description.?By default, the first sentence of the full description is used.lorentz Error class.~By default this returns "unknown error" class; though you should provide explicit implementation in order to avoid a warning.lorentz(Clarification of error argument meaning.?Provide when it's not obvious, e.g. argument is not named with :!.NOTE: This should not; be an entire sentence, rather just the semantic backbone.Bad: * 9Error argument stands for the previous value of approval. Good: * the previous value of approval * Epair, first argument of which is one thing, and the second is anotherlorentz=Error class on how the error should be handled by the client.lorentzRNormal expected error. Examples: "insufficient balance", "wallet does not exist".lorentzaInvalid argument passed to entrypoint. Examples: your entrypoint accepts an enum represented as natT, and unknown value is provided. This includes more complex cases which involve multiple entrypoints. E.g. API provides iterator interface, middleware should care about using it hiding complex details and exposing a simpler API to user; then an attempt to request non-existing element would also correspond to an error from this class. lorentzzUnexpected error. Most likely it means that there is a bug in the contract or the contract has been deployed incorrectly.!lorentz/It's possible to leave error class unspecified. lorentzHow #& is actually represented in Michelson.#lorentzMaterial custom error.:Use this in pattern matches against error (e.g. in tests).'lorentz"Declares a custom error, defining error name - error argument relation.=If your error is supposed to carry no argument, then provide ().Note that this relation is defined globally rather than on per-contract basis, so define errors accordingly. If your error has argument specific to your contract, call it such that error name reflects its belonging to this contract.!This is the basic [error format].(lorentzType wrapper for an IsError.*lorentz!Use this type as replacement for () when you really( want to leave error cause unspecified.-lorentzConstraints which we require in a particular instance. You are not oblidged to often instantiate this correctly, it is only useful for some utilities..lorentz?Name of error as it appears in the corresponding section title./lorentz/What should happen for this error to be raised.0lorentzBrief version of /.This will appear along with the error when mentioned in entrypoint description. By default, the first sentence of the full description is used.1lorentz)How this error is represented in Haskell.2lorentz Error class.3lorentz8Which definitions documentation for this error mentions.4lorentzCaptured constraints which we require in a particular instance. This is a way to encode a bidirectional instance in the nowaday Haskell, for (class MyConstraint => ErrorHasDoc MyType instance it lets deducing  MyConstraint by ErrorHasDoc MyType.tYou are not oblidged to always instantiate, it is only useful for some utilities which otherwise would not compile.5lorentz Haskell type representing error.6lorentzConverts a Haskell error into Value representation.7lorentz Converts a Value into Haskell error.9lorentzImplementation of 6 via s.:lorentzImplementation of 7 via s.lorentz!Helper for managing descriptions.;lorentz"Fail with the given Haskell value.<lorentzTFail, providing a reference to the place in the code where this function is called.Like 5? in Haskell code, this instruction is for internal errors only.=lorentz/Description of error representation in Haskell.>lorentzDemote error tag to term level.@lorentzFail with given custom error.AlorentzSpecialization of @ for no-arg errors.Blorentz3Whether given error class is about internal errors.]Internal errors are not enlisted on per-entrypoint basis, only once for the entire contract.ClorentzImplementation of e (of bA typeclass) for Haskell types which sole purpose is to be error.lorentz!This is to be included on top of Errors) section of the generated documentation.Florentz)This instance cannot be implemented, use 5 instance instead.NlorentzIf #{ constructor is not provided its argument, we assume that this is no-arg error and interpret the passed value as complete.Qlorentz"Use this for internal errors only.NormalF error scenarios should use the mechanism of custom errors, see below.0! "#$%&'()*+,-./0123456789:;<=>?@ABC056789:,-./01234C=B*+();<'#$%&@"A! ?>#None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpkalorentz!QuasiQuote that helps generating ParameterHasEntrypoints instance.Usage: [entrypointDoc| Parameter <parameter-type> <optional-root-annotation> |] [entrypointDoc| Parameter plain |] [entrypointDoc| Parameter plain "root"|]  See this  ,https://indigo-lang.gitlab.io/contract-docs/tutorial! which includes this quasiquote.blorentz!QuasiQuote that helps generating CustomErrorHasDoc instance.Usage: t[errorDoc| <error-name> <error-type> <error-description> |] [errorDoc| "errorName" exception "Error description" |]  See this  ,https://indigo-lang.gitlab.io/contract-docs/tutorial! which includes this quasiquote.clorentz!QuasiQuote that helps generating  TypeHasDoc instance.Usage: V[typeDoc| <type> <description> |] [typeDoc| Storage "This is storage description" |]  See this  ,https://indigo-lang.gitlab.io/contract-docs/tutorial! which includes this quasiquote.abcabc$None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpL%dlorentzeNewtype over void result type used in tests to distinguish successful void result from other errors.;Usage example: lExpectFailWith (== VoidResult roleMaster)`mThis error is special - it can contain arguments of different types depending on entrypoint which raises it.glorentzvoid! type synonym as described in A1.ilorentzEntry point argument.jlorentzType of result reported via .klorentzview! type synonym as described in A1.qlorentzwConstraint for updateN that combines kind-agnostic constraint for Lorentz (Haskell) types and for our typed Michelson.lorentz$Kind-agnostic constraint for updateNtlorentzxConstraint for replaceN that combines kind-agnostic constraint for Lorentz (Haskell) types and for our typed Michelson.lorentz%Kind-agnostic constraint for replaceNlorentz(Various convenient instructions on maps.lorentzSpecialized version of .ulorentzInsert given element into map.vlorentzWInsert given element into map, ensuring that it does not overwrite any existing entry.=As first argument accepts container name (for error message).wlorentzDelete element from the map.zlorentzuConstraint for duupX that combines kind-agnostic constraint for Lorentz (Haskell) types and for our typed Michelson.lorentz"Kind-agnostic constraint for duupXlorentzxAnalog of the FAIL macro in Michelson. Its usage is discouraged because it doesn't carry any information about failure.lorentz[Custom Lorentz macro that drops element with given index (starting from 0) from the stack.lorentzDuplicate the top of the stack n times.@For example, `cloneX @3` has type `a : s :-> a : a : a : a : s`.lorentzDUU+P# macro. For example, `duupX @3` is DUUUP, it puts the 3-rd (starting from 1) element to the top of the stack. Note that it is implemented differently for `n "d 2` and for `n > 2`. In the latter case it is implemented using ,  and |. In the former case it uses specialized versions. There is also a minor difference with the implementation of `DUU*P` in Michelson. They implement DUUUUP as `DIP 3 { DUP }; DIG 4`. We implement it as `DIP 3 { DUP }; DIG 3`. These are equivalent. Our version is supposedly cheaper, at least it should be packed more efficiently due to the way numbers are packed.lorentz Version of L which accepts number of elements on input stack which should be preserved.YYou can treat this macro as calling a Michelson function with given number of arguments.lorentzInsert given element into set.!This is a separate function from  updateMap4 because stacks they operate with differ in length.lorentzWInsert given element into set, ensuring that it does not overwrite any existing entry.)As first argument accepts container name.lorentz"Delete given element from the set.lorentz^Replace nth element (0-indexed) with the one on the top of the stack. For example, `replaceN 93` replaces the 3rd element with the 0th one. `replaceN D0` is not a valid operation (and it is not implemented). `replaceN n1` is equivalent to `swap # drop` (and is the only one implemented like this). In all other cases `replaceN $n` will drop the nth element (`dipN 6n drop`) and then put the 0th one in its place (`dug (n-1)`).lorentzReplaces the nth element (0-indexed) with the result of the given "updating" instruction (binary with the return type equal to the second argument) applied to the 0th element and the nth element itself. For example, `updateN 53 cons` replaces the 3rd element with the result of ; applied to the topmost element and the 3rd one. `updateN I0 instr` is not a valid operation (and it is not implemented). `updateN 1 instr` is equivalent to instr$ (and so is implemented). `updateN c2 instr` is equivalent to `swap # dip instr` (and so is implemented). In all other cases `updateN En instr` will put the topmost element right above the nth one (`dug L(n-1)`) and then apply the function to them in place (`dipN @(n-1) instr`).lorentzPolymorphic version of k constructor.lorentz*Wrap internal representation of view into k itself.k8 is part of public standard and should not change often.lorentzUnwrap k" into its internal representation.k8 is part of public standard and should not change often.lorentz*Wrap internal representation of void into g itself.g8 is part of public standard and should not change often.lorentzUnwrap g" into its internal representation.g8 is part of public standard and should not change often.lorentzPush a value of contract type.Doing this via H instruction is not possible, so we need to perform extra actions here. Aside from contract] value itself you will need to specify which error to throw in case this value is not valid.lorentz$Get address of the current contract.0TODO [#373]: reimplement this using SELF_ADDRESSlorentz0Duplicate two topmost items on top of the stack.lorentz5Retain the value if it is not equal to the given one. non 0 -$ 5Just 5 non 0 -$ 0Nothinglorentz Version of  with a custom predicate. non' eq0 -$ 5Just 5 non' eq0 -$ 0Nothinglorentz!Check whether container is empty.kdefghijklmnopqrstuvwxyz{|}~k{|}~ztqxyrsopuvwklmnghijdef%None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmplorentz5Generic traversal for conversion between ADT sum and .lorentz1Entry points template derived from given ADT sum.lorentzConstraint required by  .lorentz#Make up a "case" over entry points.lorentzPattern-match on given UParam entries.bYou have to provide all case branches and a fallback action on case when entrypoint is not found.lThis function is unsafe because it does not make sure at type-level that entry points' names do not repeat.lorentz=An action invoked when user-provided entrypoint is not found.lorentz%Implementations of some entry points.,Note that this thing inherits properties of 8, e.g. you can Data.Vinyl.Core.rappendX implementations for two entrypoint sets when assembling scattered parts of a contract.lorentz#Wrapper for a single "case" branch.lorentz"This class is needed to implement .lorentzTurn a into a Haskell value. Since we don't know its type in compile time, we have to erase it using u. The user of this function can require arbitrary constraint to hold (depending on how they want to use the result).lorentzBThis type can store any value that satisfies a certain constraint.lorentz>Ensure that given entry points do no contain duplicated names.lorentz,Get type of entrypoint argument by its name.lorentzHomomorphic version of , forgets the exact interface.lorentzPseudo value for  type variable.lorentzpEncapsulates parameter for one of entry points. It keeps entrypoint name and corresponding argument serialized.dIn Haskell world, we keep an invariant of that contained value relates to one of entry points from entries list.lorentz6A convenient alias for type-level name-something pair.lorentzGAn entrypoint is described by two types: its name and type of argument.lorentz Construct a  safely.lorentz-Helper instruction which extracts content of .lorentzDefault implementation for , simply reports an error.lorentzPattern-match on given UParam entries.bYou have to provide all case branches and a fallback action on case when entrypoint is not found.lorentzLike (, but accepts a tuple of clauses, not a 8. lorentzMake up  from ADT sum.'Entry points template will consist of '(constructorName, constructorFieldType)@ pairs. Each constructor is expected to have exactly one field. lorentz:Note that calling given entrypoints involves constructing .lorentzAllows casts only between  and .    None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp& 'lorentzPredicate for if ... then .. else ...] construction, defines a kind of operation applied to the top elements of the current stack."Type arguments mean: 1. Input of ifS 2. Left branch input 3. Right branch input 4. Output of branches 5. Output of if7lorentzNExplicitly named binary condition, to ensure proper order of stack arguments.8lorentz"Provide the compared arguments to if branches.9lorentz Aliases for  used by do-blocks.:lorentzDefines semantics of if ... then ... else ... construction.;lorentzNamed version of 3.In this and similar operators you provide names of accepted stack operands as a safety measure of that they go in the expected order.<lorentzNamed version of 4.=lorentzNamed version of 5.>lorentzNamed version of 6.?lorentzNamed version of 1.@lorentzNamed version of 2.AlorentzVCondition modifier, makes stack operands of binary comparison to be available within if branches.! ',+()*-./0123456789:;<=>?@A!9 :',+()*-./012345678;<=>?@A ;4<4=4>4?4@4&None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp# BlorentzTags excluded from map.ClorentzXThis is a bidirectional map with correspondence between numeric and textual error tags.Dlorentz6Find all textual error tags that are used in typical FAILWITHA patterns within given instruction. Map them to natural numbers.Elorentz#Add more error tags to an existing C. It is useful when your contract consists of multiple parts (e. g. in case of contract upgrade), you have existing map for some part and want to add tags from another part to it. You can pass empty map as existing one if you just want to build C! from a set of textual tags. See F.FlorentzBuild C from a set of textual tags.GlorentzRemove some error tags from map. This way you say to remain these string tags intact, while others will be converted to numbers when this map is applied.2Note that later you have to apply this map using I%, otherwise an error would be raised.HlorentzFor each typical  that uses a string to represent error tag this function changes error tag to be a number using the supplied conversion map. It assumes that supplied map contains all such strings (and will error out if it does not). It will always be the case if you gather all error tags using D and build C from them using E.Ilorentz Similar to H>, but for case when you have excluded some tags from map via G. Needed, because both GV and this function do not tolerate unknown errors in contract code (for your safety).JlorentzThis function implements the simplest scenario of using this module's functionality: 1. Gather all error tags from a single instruction. 2. Turn them into error conversion map. 3. Apply this conversion.Klorentz<If you apply numeric error representation in your contract, 7" will stop working because it doesn't know about this transformation. This function takes this transformation into account. If a number is used as a tag, but it is not found in the passed map, we conservatively preserve that number (because this whole approach is rather a heuristic).Llorentz<If you apply numeric error representation in your contract, 6" will stop working because it doesn't know about this transformation. This function takes this transformation into account. If a string is used as a tag, but it is not found in the passed map, we conservatively preserve that string (because this whole approach is rather a heuristic). BCDEFGHIJKL CBDEFGHIJKL'None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp>lorentz;Helper typeclass which overloads representation for errors.lorentzHError representation with respect to tags being changed to numeric ones.Mlorentz'Some error with a numeric tag attached.lorentzHPseudo error which stands for textual errors converted to numeric codes.NlorentzBHandler which changes documentation for one particular error type.Olorentz Errors for Nlorentz=Given handler is not suitable, probably another one will fit.lorentzGGiven handler suits and tells that given error should remain unchanged.Plorentz0Adds a section which explains error tag mapping.Rlorentz=Describes where the error tag map is defined in Haskell code.lorentz@Anchor which refers to the section describing error tag mapping.Slorentz:Modify documentation generated for given code so that all #X mention not their textual error tag rather respective numeric one from the given map.hIf some documented error is not present in the map, it remains unmodified. This function may fail with 5- if contract uses some uncommon errors, see T for details.TlorentzExtended version of S which accepts error handlers.In most cases that function should be enough for your purposes, but it uses a fixed set of base handlers which may be not enough in case when you define your own errors. In this case define and pass all the necessary handlers to this function.It fails with 5S if some of the errors used in the contract cannot be handled with given handlers.UlorentzHandler for all #s.Vlorentz Handler for d.lorentz#Handler for textual error messages.Wlorentz3Handlers for most common errors defined in Lorentz. MNOPQRSTUVW PQRSTNOUVWM3None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmp@BCDEFGHIJKLMNOPQRSTUVW(None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpD lorentzPContract initiator should be contract admin in order to perform this operation.)None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpHalorentz!Replacement for uninhabited type.blorentz)Witness of that this code is unreachable.!lorentzSomeone constructed a type.abab*None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpK"ilorentzLorentz version of ).ijkijk+None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpXnslorentzLorentz version of 45.wlorentzInvert an isomorphism.xlorentz2Given a function that is its own inverse, make an s using it in both directions.ylorentzPThe isomorphism between two values with identical representation and semantics.zlorentzAThe isomorphism between two values with identical representation.The same precautions as for  apply here.{lorentz,The isomorphism between raw and named value.|lorentzbAbsence of value on the left hand side is associated with the given value on the right hand side.}lorentzdAbsence of value on the left hand side is associated with the default value on the right hand side. This is more general version of  nonIso ldef) since it can work with e.g. containers. stuvwxyz{|} stuvwxyz{|},None8!"#$%&'*,-.012456789;<=>?@ACHMNPSUVX_`befgkmpY2~lorentzIConcise way to write down constraints with expected content of a storage.Use it like follows: type StorageConstraint store = StorageContains store [ "fieldInt" := Int , "fieldNat" := Nat , "epsToNat" := Int ::-> Nat , "balances" := Address ~> Int ] lorentz-Indicates a stored entrypoint with the given param and store types.lorentz2Indicates a submap with given key and value types.lorentz*Provides operations on stored entrypoints.store/ is the storage containing both the entrypoint epName (note: it has to be in a k/ to take advantage of lazy evaluation) and the epStore field this operates on.lorentz/Datatype containing the full implementation of  typeclass.We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the  DerivingVia extension.)lorentzType synonym of a k mapping : (entrypoint names) to .*This is useful when defining instances of S as a storage field containing one or more entrypoints (lambdas) of the same type.lorentzType synonym for a q" that can be used as an entrypointlorentz*Provides operations on submaps of storage.lorentz/Datatype containing the full implementation of  typeclass.We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the  DerivingVia extension.)lorentz*Provides operations on fields for storage.lorentz/Datatype containing the full implementation of  typeclass.We use this grouping because in most cases the implementation will be chosen among the default ones, and initializing all methods at once is simpler and more consistent. (One can say that we are trying to emulate the  DerivingVia extension.)lorentzPick storage field.lorentz:Get storage field, preserving the storage itself on stack.lorentzUpdate storage field.lorentz Check value presence in storage.lorentzGet value in storage.lorentzUpdate a value in storage.lorentzDelete a value in storage.lorentzAdd a value in storage.lorentzJAdd a value in storage, but fail if it will overwrite some existing entry.lorentzExtracts and executes the epNameE entrypoint lambda from storage, returing the updated full storage (store) and the produced Us.lorentzPick stored entrypoint lambda.lorentzIGet stored entrypoint lambda, preserving the storage itself on the stack.lorentzBStores the entrypoint lambda in the storage. Fails if already set.lorentz5Pick the sub-storage that the entrypoint operates on.lorentzaGet the sub-storage that the entrypoint operates on, preserving the storage itself on the stack.lorentz7Update the sub-storage that the entrypoint operates on.lorentzImplementation of 0 for case of datatype keeping a pack of fields.lorentzImplementation of  for a datatype keeping a pack of fields, among which one has contains the entrypoint and another is what such entrypoint operates on.lorentzImplementation of  for a datatype that has a  for an $ that contains the entrypoint and a , for the field such entrypoint operates on.lorentzImplementation of  for a datatype that has a % that contains the entrypoint and a , for the field such entrypoint operates on.lorentzImplementation of + for a data type which has an instance of = inside. For instance, it can be used for top-level storage.lorentzImplementation of + for a data type which has an instance of = inside. For instance, it can be used for top-level storage.lorentzImplementation of + for a data type which has an instance of = inside. For instance, it can be used for top-level storage.lorentzPretend that given 0 implementation is made up for submap with name  desiredNameD, not its actual name. Logic of the implementation remains the same.AUse case: imagine that your code requires access to submap named X,, but in your storage that submap is called Y.. Then you implement the instance which makes X refer to Y: oinstance StoreHasSubmap Store X Key Value where storeSubmapOps = storeSubmapOpsReferTo #Y storeSubmapOpsForY lorentzPretend that given 0 implementation is made up for field with name  desiredNameE, not its actual name. Logic of the implementation remains the same. See also .lorentzPretend that given 5 implementation is made up for entrypoint with name  desiredNameE, not its actual name. Logic of the implementation remains the same. See also .lorentz>Change field operations so that they work on a modified field.For instance, to go from $StoreFieldOps Storage "name" Integer to /StoreFieldOps Storage "name" (value :! Integer) you can use "mapStoreFieldOps (namedIso #value)lorentz=Change submap operations so that they work on a modified key.lorentz?Change submap operations so that they work on a modified value.lorentz.Chain two implementations of field operations.eSuits for a case when your store does not contain its fields directly rather has a nested structure.lorentz5Chain implementations of field and submap operations.lorentziChain implementations of two submap operations sets. Used to provide shortcut access to a nested submap.This is very inefficient since on each access to substore it has to be serialized/deserialized. Use this implementation only if due to historical reasons migrating storage is difficult.LIso (Maybe substore) substore argument describes how to get substoreP value if it was absent in map and how to detect when it can be safely removed.Example of use: HsequenceStoreSubmapOps #mySubmap nonDefIso storeSubmapOps storeSubmapOpslorentzETurn submap operations into operations on a part of the submap value.>Normally, if you need this set of operations, it would be better to split your submap into several separate submaps, each operating with its own part of the value. This set of operations is pretty inefficient and exists only as a temporary measure, if due to historical reasons you have to leave storage format intact.0This implementation puts no distinction between value == Nothing and value == Just defValue cases. Getters, when notice a value equal to the default value, report its absence. Setters tend to remove the value from submap when possible.LIso (Maybe value) value and LIso (Maybe subvalue) subvaluex arguments describe how to get a value if it was absent in map and how to detect when it can be safely removed from map.Example of use: PzoomStoreSubmapOps #mySubmap nonDefIso nonDefIso storeSubmapOps storeFieldOpsADT"lorentz Utility to push the :! name of and entrypoint from its ;#lorentzUtility to extract an  from a , fails in case of .$lorentzUtility to set an < into a store. Fails in case the entrypoint is already set.lorentzUtility to create s from an entrypoint name (epName ) and an F implementation. Note that you need to merge multiple of these (with 9) if your field contains more than one entrypoint lambda.lorentz< can be used as standalone key-value storage if very needed.lorentzk\ can be used as standalone key-value storage, name of submap is not accounted in this case.?~?~9 9 -None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmplorentz actions parsed from CLI.lorentz-Specifies how to parse initial storage value.]Normally you pass some user data and call a function that constructs storage from that data.KIf storage is simple and can be easilly constructed manually, you can use .lorentzRewrite annotations in storage. We don't won't to uncoditionally override storage notes since after #20 we require notes to be non-empty, so we wrap them into .lorentzRun an action operating with .None7!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpl $#    &%"!'()*+,-./0123458769:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abacdefghijklmnopqrstvutwxyz{|}~ !"#$%-./456789:;<=?@ABCDEFGIJKKVXYZ[\]YZbcdefgnopqrstuvwxyz{|}~     JKKNOPdefghijklmnopqxyz{|}~      !"#$%&'()*+,-./012345JKLMNOPQRSTUVWXYZ[\_`abcdefghijklmnopqrstuvwxyz{|}~! "#$%&'()*+,-./01234-56789:;<=>?@ABCabcdefghijklmnopqrstuvwxyz{|}~  ',+()*-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWabstuvwxyz{|}~ $#    &%"!'()*+,-./0123458769:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abacdefghijklmnopqrstvutwxyz{|}~ !"#$%-./456789:;<=?@ABCDEFGIJKVXYZ[\]bcdefgnopqrstuvwxyz{|}~    JKNOPdefghijklmnopqxyz{|}~      !"#$%&'()*+,-./012345JKLMNOPQRSTUVWXYZ[\_`abcdefghijklmnopqrstuvwxyz{|}~! "#$%&'()*+,-./0123456789:;<=>?@ABCabcdefghijklmnopqrstuvwxyz{|}~  ',+()*-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWabstuvwxyz{|}~6None8!"#$%&'*,-.012456789;<=>?@AHMNPSUVX_`befgkmpn%&'()*+,-7897:;7:<78=7>?78@78A78B78C78D7EFGHIGHJ7KL7MN78O78PGQRSTU7VW7XY7Z[GQ\7X]7X^GQ_7Z`7Zabcdefg78hijk7lm7no7no7Ep7Eq78r78stuviwxyz{yz|}~}~}~}~}~9      !"#$%&''(())**+,--./0123456789::;<=>?>@ABCDDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                   .                                            !"#$%&'()*+,-./0123456789:;<;=;>;?;@;A;B;C;D;E;F;G;H;I;J;K;L;M;N;OPPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                          !"#$%&'()*+,-./001233456789:;<=>?@ABCDEFGHIJKLMNNOPQRSTUVWWXYZ[[\]]^_`abcdeefghijklmnopqrstuvwxyz{|}~        !"#$%&'()*+, - . / 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"T"U"U"V"W"X"Y"Z"["\"]"^"_"`"a"a"b"c"d"e"e"f"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""###$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'%(%)%*%+%,%-%.%<%/%0%1%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%[\]^_`abcdefghijklmnopqrstuv&w&x&y&z&{&|&}&~&&&''''''''''''''''''(())))))))**********+++++++++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--Q------------------      3  !"#$GQ%&'(#)*+,-.-/01234 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,W6X6Y6Z6[6\6]6^6_`lorentz-0.9.1-inplaceLorentz.PreludeLorentz.Rebinded Lorentz.ValueLorentz.Constraints.Scopes Lorentz.ADTLorentz.AnnotationLorentz.Entrypoints.DocLorentz Lorentz.DocLorentz.AddressLorentz.OpSizeLorentz.Entrypoints.HelpersLorentz.Entrypoints.CoreLorentz.Constraints.Derivative Lorentz.BaseLorentz.Common Lorentz.ExtLorentz.PolymorphicLorentz.Entrypoints.Impl Lorentz.ArithLorentz.WrappableLorentz.Entrypoints.Manual Lorentz.Zip Lorentz.Bytes Lorentz.PackLorentz.Coercions Lorentz.RunLorentz.Run.Simple Lorentz.Print Lorentz.InstrLorentz.ReferencedByNameLorentz.ReferencedLorentz.ExtensibleLorentz.ErrorsLorentz.Util.TH Lorentz.MacroLorentz.UParamLorentz.Errors.Numeric.ContractLorentz.Errors.Numeric.DocLorentz.Errors.Common Lorentz.EmptyLorentz.Default Lorentz.IsoLorentz.StoreClassLorentz.ContractRegistryNiceParameterFullLorentz.ConstraintsLorentz.EntrypointsUtil.TypeTuple InstancesLorentz.Errors.Numeric Control.LensIso Paths_lorentzbaseGHC.Base$GHC.Num fromIntegernegatereturn Data.String fromString<>memptymappendmconcatpureGHC.EnumBoundedghc-prim GHC.ClassesEqOrdGHC.ShowShow GHC.GenericsGeneric SemigroupMonoid GHC.TypesBoolinteger-wired-inGHC.Integer.TypeInteger GHC.NaturalNatural GHC.MaybeMaybe Data.EitherEitherFalseNothingJustTrueLeftRightbytestring-0.10.10.0Data.ByteString.Internal ByteString text-1.2.4.0Data.Text.InternalText.containers-0.6.2.1Data.Map.InternalMapGHC.OverloadedLabels fromLabel Data.ProxyProxymaxBoundminBoundstimessconcatQconstraints-0.12-88731eda343b25828d7dff94e12df3f49c882b1fd1671ac89d6decb72d065657Data.ConstraintwithDictData.Set.InternalSet[data-default-class-0.1.2.0-4272acf61cf305de58358a7df34113e19eeebed30a53e4d682ade7ae34d135e4Data.Default.ClassDefaultdefNnamed-0.3.0.1-86ae7a698201c2329abb8321517c8787cb9314c256914286e08a1fc5c4ca130aNamed.InternalargDefargFarg:!:?Xtext-manipulate-0.2.0.1-e590edf3724f1554202b1faab89075f750d296cb7b1c151745c677d4db47f82eData.Text.ManipulatetoSnaketoPascaltoCamelPuniversum-1.6.1-e496f505f04a42146f7829675f28b61cf244a0774d83314619c386f80abedb8aUniversum.TypeOpsUniversum.Debug undefinederrorMvinyl-0.12.1-d439574e5eb6284fd3a2115fac5488bae0beedfd3b3a9d02dc6d224597118650Data.Vinyl.Core:&RNilRecmorley-1.12.0-inplaceMichelson.TextmtMText Util.LabelLabelMichelson.Typed.Annotation insertTypeAnnMichelson.Typed.ExtractmkUType%Michelson.Typed.Haskell.CompatibilityligoCombLayout ligoLayoutMichelson.Typed.Haskell.DocconcreteTypeDocHaskellRepconcreteTypeDocHaskellRepUnsafeconcreteTypeDocMichelsonRep!concreteTypeDocMichelsonRepUnsafecustomTypeDocMdReferencedStoragedTypeDepgenericTypeDocDependencieshaskellAddNewtypeFieldhaskellRepNoFieldshaskellRepStripFieldPrefixhomomorphicTypeDocHaskellRephomomorphicTypeDocMdReferencehomomorphicTypeDocMichelsonReppoly1TypeDocMdReferencepoly2TypeDocMdReferenceMichelson.Typed.Haskell.ValuecoerceContractRefMichelson.Untyped.Entrypoints DefEpNameMichelson.Untyped.OpSizeopSizeHardLimitsmallTransferOpSizeMichelson.Typed.Aliases OperationValueMichelson.Typed.Entrypoints EpAddress eaAddress eaEntrypointDTypeHaveCommonTypeCtor IsHomomorphicSomeTypeWithDocTypeDocFieldDescriptions TypeHasDoctypeDocDependenciestypeDocHaskellReptypeDocMdDescriptiontypeDocMdReferencetypeDocMichelsonRep typeDocName%Michelson.Typed.Haskell.Instr.ProductConstructorFieldTypesInstrConstructCBigMapunBigMap ContractRef crAddress crEntrypointEntrypointCallIsoValueToTfromValtoValSomeEntrypointCallWellTypedIsoValueEpNameOpSizeunOpSize Tezos.AddressAddress Tezos.CoreChainId Tezos.CryptoKeyHashMutez PublicKey Signature TimestamponeMuteztimestampFromSecondstimestampFromUTCTimetimestampQuotetoMutez zeroMutez Michelson.Doc ContainsDocContainsUpdateableDocSomeDocDefinitionItem SomeDocItem ContractDoc DocItemPos DocSection docItemPosDocElemSubDoc DGitRevisionDocItemGHasAnnotationgGetAnnotation HasAnnotation getAnnotation annOptionsGenerateFieldAnnFlagGenerateFieldAnnNotGenerateFieldAnnFollowEntrypointFlagFollowEntrypointNotFollowEntrypoint AnnOptionsfieldAnnModifierdefaultAnnOptionsdropPrefixThenappendToctorNameToAnnWithOptionsgGetAnnotationNoField$fGHasAnnotation:*:$fGHasAnnotation:+:$fGHasAnnotationM1$fGHasAnnotationM10$fGHasAnnotationM11$fGHasAnnotationM12$fGHasAnnotationU1 DocGroupingattachDocCommonsbuildDocbuildMarkdownDoccontractDocToMarkdowndocDefinitionRefdocItemPositiondocItemSectionRef finalizedAsIs mdTocFromRefmkDGitRevision modifyDocmorleyRepoSettingssubDocToMarkdownbuildDocUnfinalizedmodifyDocEntirely cdContentscdDefinitionIds cdDefinitionscdDefinitionsSetDAnchorDComment DDescriptionDGeneralInfoSectionDGitRevisionKnownDGitRevisionUnknownDNamedeItemdeSubDocItemPlacementDocItemReferenceddocItemDependencies docItemRefdocItemSectionDescriptiondocItemSectionNamedocItemSectionNameStyledocItemToMarkdown docItemToToc docItemsOrder DocItemIdDocItemPlacementKindDocItemInDefinitionsDocItemInlined DocItemRef DocItemNoRefDocItemRefInlinedDocSectionNameStyleDocSectionNameBigDocSectionNameSmallGitRepoSettingsgrsMkGitRevisionWithFinalizedDoc Util.MarkdownMarkdown$fGHasAnnotationK1$fHasAnnotation(,,,,,,)$fHasAnnotation(,,,,,)$fHasAnnotation(,,,,)$fHasAnnotation(,,,)$fHasAnnotation(,,)$fHasAnnotation(,)$fHasAnnotationEither$fHasAnnotationOperation'$fHasAnnotation[]$fHasAnnotationSet$fHasAnnotationBigMap$fHasAnnotationMap$fHasAnnotationContractRef$fHasAnnotationChainId$fHasAnnotationSignature$fHasAnnotationPublicKey$fHasAnnotationTimestamp$fHasAnnotationKeyHash$fHasAnnotationEpAddress$fHasAnnotationAddress$fHasAnnotationMutez$fHasAnnotationByteString$fHasAnnotationBool$fHasAnnotationMText$fHasAnnotationNatural$fHasAnnotationInteger$fHasAnnotation()$fHasAnnotationMaybe$fHasAnnotationNamedF$fHasAnnotationNamedF0NiceComparableNicePrintedValueNiceFullPackedValueNiceUnpackedValueNicePackedValue NiceConstant NiceStorage NiceParameter CanHaveBigMapNoBigMapNoContractType NoOperation KnownValueniceParameterEviniceStorageEviniceConstantEvinicePackedValueEviniceUnpackedValueEvinicePrintedValueEvi $fKnownValuea$fNoOperationa$fNoContractTypea $fNoBigMapa$fCanHaveBigMapaRequireSumTypeCanHaveEntrypointsShouldHaveEntrypointsunHasEntrypoints ctorNameToAnn ctorNameToEp$fGenericShouldHaveEntrypoints$fIsoValueShouldHaveEntrypointsEpdNoneParameterContainsEntrypoints:>HasEntrypointOfType TrustEpNameHasDefEntrypointArgHasEntrypointArguseHasEntrypointArgGetEntrypointArgCustomNiceEntrypointName EntrypointRef CallDefaultCallNoExplicitDefaultEntrypointForbidExplicitDefaultEntrypointGetDefaultEntrypointArgGetEntrypointArgLookupParameterEntrypointAllParameterEntrypointsGetParameterEpDerivationParameterDeclaresEntrypointsParameterHasEntrypointsParameterEntrypointsDerivation EpCallingStep EpsWrapIn EpCallingDescepcdArgepcdEntrypoint epcdStepsEpConstructionRes EpConstructedEpConstructionFailedRequireAllUniqueEntrypointsRequireAllUniqueEntrypoints'EntrypointsDerivationEpdAllEntrypointsEpdLookupEntrypointepdNotesepdCallepdDescspepNotespepCallpepDescspepDescsWithDefparameterEntrypointsToNotesparameterEntrypointCallparameterEntrypointCallDefaultsepcCallRootCheckedeprNameparameterEntrypointCallCustom#$fHasEntrypointArgkcpTrustEpNamearg$$fEntrypointsDerivationTYPEEpdNonecp($fHasEntrypointArgTYPEcpEntrypointRefarg$fShowEpCallingStep$fEqEpCallingStep$fShowEpCallingDescMapLorentzInstrmapLorentzInstrLambda&SomeContractCode ContractCode ContractOut%>:-> LorentzInstrunLorentzInstrFII iGenericIfiAnyCodeiNonFailingCode iMapAnyCode iForceNotFailiWithVarAnnotations#parseLorentzValuetransformStringsLorentztransformBytesLorentzoptimizeLorentzWithConfoptimizeLorentz $fMonoid:->$fSemigroup:->$fBuildableParseLorentzError$fMapLorentzInstr:-> $fShow:->$fEq:->$fShowParseLorentzError$fEqParseLorentzError Entrypoint_ EntrypointFromContractReffromContractRef ToContractRef toContractRef ToTAddress toTAddress ToAddress toAddressFutureContractunFutureContract ToTAddress_TAddress unTAddresscallingTAddresscallingDefTAddress toTAddress_convertContractRef$fHasAnnotationFutureContract$fIsoValueFutureContract$fToAddressContractRef$fToAddressFutureContract$fToAddressTAddress$fToAddressEpAddress$fToAddressAddress$fToTAddresscpTAddress$fToTAddresscpAddress$fToContractRefargTAddress$fToContractRefcpFutureContract$fToContractRefcpContractRef$fFromContractRefcpAddress$fFromContractRefcpEpAddress!$fFromContractRefcpFutureContract$fFromContractRefcpContractRef$fGenericTAddress$fIsoValueTAddress$fHasAnnotationTAddressstackRef printComment testAssert stackTypeEDivOpHs EDivOpResHs EModOpResHs SliceOpHs ConcatOpHsGetOpHs GetOpKeyHs GetOpValHsUpdOpHs UpdOpKeyHs UpdOpParamsHsSizeOpHsIterOpHs IterOpElHsMapOpHs MapOpInpHs MapOpResHs IsoMapOpResMemOpHs MemOpKeyHs$fMemOpHsBigMap $fMemOpHsMap $fMemOpHsSet $fMapOpHs[] $fMapOpHsMap $fIterOpHsSet $fIterOpHs[] $fIterOpHsMap $fSizeOpHsMap $fSizeOpHs[] $fSizeOpHsSet$fSizeOpHsByteString$fSizeOpHsMText $fUpdOpHsSet$fUpdOpHsBigMap $fUpdOpHsMap$fGetOpHsBigMap $fGetOpHsMap$fConcatOpHsByteString$fConcatOpHsMText$fSliceOpHsByteString$fSliceOpHsMText$fEDivOpHsMutezNatural$fEDivOpHsMutezMutez$fEDivOpHsNaturalNatural$fEDivOpHsNaturalInteger$fEDivOpHsIntegerNatural$fEDivOpHsIntegerIntegerUtil.CustomGenericGenericStrategy rightCombalphabeticallyforbidUnnamedFieldscstr customGenericcustomGeneric'deriveFullTypefldfromDepthsStrategyhaskellBalancedleaveUnnamedFields leftBalancedleftComb reifyDataTypereorderingConstrsreorderingDatareorderingFields rightBalanced withDepths PrintAsValueList$fBuildablePrintAsValue BuildEPTreeEPTreeEPNodeEPLeaf EPDelegatePlainEntrypointsC EpdWithRoot EpdDelegate EpdRecursiveEpdPlain $fGEntrypointsNotesmodeEPLeaf:*:$fGEntrypointsNotesmodeEPLeafU1*$fGEntrypointsNotesEpdDelegateEPDelegateK1$fGEntrypointsNotesmodeepM1$fGEntrypointsNotesmodeEPNodeM1 $fGEntrypointsNotesmodeEPNode:+:$fGEntrypointsNotesmodeepM10#$fGEntrypointsNotesEpdRecursiveepK1($fEntrypointsDerivationTYPEEpdWithRootcp($fEntrypointsDerivationTYPEEpdDelegatecp)$fEntrypointsDerivationTYPEEpdRecursivecp%$fEntrypointsDerivationTYPEEpdPlaincp#$fGEntrypointsNotesmodeEPDelegateM1$fGEntrypointsNotesmodeEPLeafM1UnaryArithOpHsUnaryArithResHs ArithOpHs ArithResHs$fArithOpHsLsrNaturalNatural$fArithOpHsLslNaturalNatural$fArithOpHsXorBoolBool$fArithOpHsXorNaturalNatural$fArithOpHsAndBoolBool$fArithOpHsAndNaturalNatural$fArithOpHsAndIntegerNatural$fArithOpHsOrBoolBool$fArithOpHsOrNaturalNatural$fArithOpHsMulMutezNatural$fArithOpHsMulNaturalMutez$fArithOpHsMulIntegerInteger$fArithOpHsMulNaturalNatural$fArithOpHsMulIntegerNatural$fArithOpHsMulNaturalInteger$fArithOpHsSubMutezMutez $fArithOpHsSubTimestampTimestamp$fArithOpHsSubTimestampInteger$fArithOpHsSubIntegerInteger$fArithOpHsSubNaturalNatural$fArithOpHsSubIntegerNatural$fArithOpHsSubNaturalInteger$fArithOpHsAddMutezMutez$fArithOpHsAddIntegerTimestamp$fArithOpHsAddTimestampInteger$fArithOpHsAddIntegerInteger$fArithOpHsAddNaturalNatural$fArithOpHsAddIntegerNatural$fArithOpHsAddNaturalInteger$fUnaryArithOpHsGeInteger$fUnaryArithOpHsLeInteger$fUnaryArithOpHsGtInteger$fUnaryArithOpHsLtInteger$fUnaryArithOpHsNeqInteger$fUnaryArithOpHsEq'Integer$fUnaryArithOpHsNotBool$fUnaryArithOpHsNotNatural$fUnaryArithOpHsNotInteger$fUnaryArithOpHsNegNatural$fUnaryArithOpHsNegInteger$fUnaryArithOpHsAbsInteger Wrappable Unwrappable$fWrappableNamedF$fWrappableNamedF0ParameterWrapperunParameterWraper)$fParameterHasEntrypointsParameterWrapper2$fEntrypointsDerivationTYPEPwDerivParameterWrapper$fGenericParameterWrapper$fIsoValueParameterWrapper$fWrappableParameterWrapper ZipInstrsZipInstr ZippedStack zipInstrTypedunzipInstrTypedzipInstr unzipInstr zippingStackunzippingStack$fHasAnnotation:-> $fIsoValue:-> $fZipInstr: $fZipInstr:0 $fZipInstr[]DEntrypointExampledocdocGroup docStorage contractNamebuildLorentzDoccontractGeneralcontractGeneralDefaultbuildLorentzDocWithGitRevrenderLorentzDocrenderLorentzDocWithGitRevcutLorentzNonDocmkDEntrypointExample$fTypeHasDocFutureContract$fTypeHasDocTAddress$fTypeHasDoc:->$fContainsUpdateableDoc:->$fContainsDoc:->$fDocItemDEntrypointExampleKeccakSha3Blake2bSha512Sha256DHashAlgorithmKnownHashAlgorithmhashAlgorithmName computeHashtoHashHash HashUnsafeunHash TSignature unTSignaturePackedunPacked BytesLiketoBytes lSignEd22519toHashHs$fBytesLikeByteString$fTypeHasDocPacked$fBuildablePacked$fTypeHasDocTSignature$fBuildableTSignature$fBuildableHash$fDocItemDHashAlgorithm$fOrdDHashAlgorithm$fEqDHashAlgorithm$fKnownHashAlgorithmSha256$fKnownHashAlgorithmSha512$fKnownHashAlgorithmBlake2b$fTypeHasDocHash$fKnownHashAlgorithmSha3$fKnownHashAlgorithmKeccak $fShowPacked $fEqPacked $fOrdPacked$fGenericPacked$fIsoValuePacked$fHasAnnotationPacked$fBytesLikePacked$fShowTSignature$fGenericTSignature$fIsoValueTSignature$fHasAnnotationTSignature $fShowHash$fEqHash $fOrdHash $fGenericHash$fIsoValueHash$fHasAnnotationHash$fBytesLikeHash lPackValueRawlUnpackValueRaw lPackValue lUnpackValue lEncodeValuevalueToScriptExprexpressionToScriptExpr Coercible_ Castable_ CanCastTo castDummyMichelsonCoercible forcedCoerce forcedCoerce_gForcedCoerce_ fakeCoerce fakeCoercing coerceWrap coerceUnwraptoNamed fromNamed checkedCoercecheckedCoerce_checkedCoercing_allowCheckedCoerceToallowCheckedCoerce castDummyG$fCanCastToTYPETYPEHashHash'$fCanCastToTYPETYPETSignatureTSignature$fCanCastToTYPETYPEPackedPacked!$fCanCastToTYPETYPEHashByteString'$fCanCastToTYPETYPETSignatureByteString#$fCanCastToTYPETYPEPackedByteString*$fCanCastToTYPETYPEFutureContractEpAddress"$fCanCastToTYPETYPEAddressTAddress"$fCanCastToTYPETYPETAddressAddress!$fCanCastToTYPETYPE(,,,,,)(,,,,,)$fCanCastToTYPETYPE(,,,,)(,,,,)$fCanCastToTYPETYPE(,,,)(,,,)$fCanCastToTYPETYPE(,,)(,,)$fCanCastToTYPETYPE(,)(,)$fCanCastToTYPETYPENamedFNamedF)$fCanCastToTYPETYPEContractRefContractRef$fCanCastToTYPETYPE:->:->$fCanCastToTYPETYPEBigMapBigMap$fCanCastToTYPETYPEMapMap$fCanCastToTYPETYPESetSet$fCanCastToTYPETYPEEitherEither$fCanCastToTYPETYPEMaybeMaybe$fCanCastToTYPETYPE[][]$fCanCastTokkaaCaseTC CaseArrow/-> CaseClauseLHasFieldsOfType:= NamedFieldHasFieldOfTypeHasFieldtoField toFieldNamedgetField getFieldNamedsetField modifyField construct constructTconstructStack deconstruct fieldCtorwrap_wrapOnecase_caseT unwrapUnsafe_$fCaseArrownamebodyCaseClauseLRequireFlatEpDerivationRequireFlatParamEps EntryArrow#->DocumentEntrypointsDeriveCtorFieldDocderiveCtorFieldDocDEntrypointArgepaArg epaBuildingepaTypeParamBuildingStep PbsWrapInPbsCallEntrypoint PbsCustom PbsUncallableParamBuildingDesc pbdEnglish pbdHaskell pbdMichelson ParamBuilderunParamBuilderDEntrypointReferenceCommonEntrypointsBehaviourKindCommonContractBehaviourKindPlainEntrypointsKindEntrypointKindHasDocentrypointKindPosentrypointKindSectionName entrypointKindSectionDescription DEntrypointdepNamedepSubDEntrypointDocItemdiEntrypointToMarkdownentrypointSection mkPbsWrapInconstructDEpArg emptyDEpArg mkDEpUTypemkDEntrypointArgSimpleclarifyParamBuildingSteps entryCase_ entryCasedocumentEntrypointfinalizeParamCallingDoc'finalizeParamCallingDocareFinalizedParamBuildingStepsentryCaseSimple_entryCaseSimple$fDocItemDEntrypoint*$fEntrypointKindHasDocPlainEntrypointsKind1$fEntrypointKindHasDocCommonContractBehaviourKind4$fEntrypointKindHasDocCommonEntrypointsBehaviourKind$fDocItemDEntrypointReference$fEqParamBuilder$fShowParamBuilder$fBuildableParamBuilder$fBuildableParamBuildingStep$fDocItemDEntrypointArg$fDeriveCtorFieldDocconOneField$fDeriveCtorFieldDocconNoFields$fGDocumentEntrypointskindM1$fGDocumentEntrypointskind:+:$fGDocumentEntrypointskindM10$fEntryArrowTYPEkindnamebody$fShowParamBuildingDesc$fEqParamBuildingDesc$fShowParamBuildingStep$fEqParamBuildingStepContractcCodecDisableInitialCastcCompilationOptionsCompilationOptionscoOptimizerConfcoStringTransformercoBytesTransformerdefaultCompilationOptionsintactCompilationOptionscompileLorentzcompileLorentzWithOptionsdefaultContractcompileLorentzContractinterpretLorentzInstrinterpretLorentzLambdaanalyzeLorentz$fContainsUpdateableDocContract$fContainsDocContractcoBytesTransformerLcoOptimizerConfLcoStringTransformerLcCodeLcCompilationOptionsLcDisableInitialCastL-$?-$&?-&-<-$>printLorentzValueprintLorentzContractcontractOpSize valueOpSizeNonZerononZeroLorentzFunctorlmapConstraintDIPNLorentzConstraintDUGLorentzConstraintDIGLorentznop justCommentcommentcommentAroundFuncommentAroundStmtdropdropNdupswapdigPeanodigdugPeanodugpushsomenoneunitifNonepaircarcdrleftrightifLeftnilconsifConssizeemptySetemptyMap emptyBigMapmapitermemgetupdateif_looploopLeftlambdaexecexecuteapply applicatedip dipNPeanodipNfailWithcastpackunpackpackRaw unpackRawconcatconcat'sliceisNataddsubrsubmuledivabsneglsllsrorandxornotcompareeq0neq0lt0gt0le0ge0intself selfCallingcontractcontractCallingcontractCallingUnsaferunFutureContractepAddressToContracttransferTokens setDelegatecreateContractimplicitAccountnowamountbalancecheckSignaturesha256sha512blake2Bsha3keccakhashKeysourcesenderaddresschainIdlevelframedfailingWhenPresent updateNew$fLorentzFunctorMaybe$fNonZeroNatural$fNonZeroInteger HasNamedVars HasNamedVar VarIsUnnamed dupLNameddupL$fHasNamedVar[]namevar$fElemHasNamedVar:namevarFalse$fElemHasNamedVar:namevarTrue$fHasNamedVar:namevardupTdipTdropT$fDupTorigSta:$fDupTorigSta:0$fDupTorigSta[]$fDipTorigSta:dipInpdipOutout1$fDipTorigSta:dipInpdipOutout$fDipTorigSta[]dipInpdipOutoutExtensibleHasDocextensibleDocNameextensibleDocDependenciesextensibleDocMdDescriptionExtConversionErrorConstructorIndexNotFoundArgumentUnpackFailedWrapExtCExtVal ExtensibletoExtVal fromExtValwrapExt$fWrapExtNoFields$fWrapExtOneField$fBuildableExtConversionError$fGExtValkt:+:$fGExtValTYPEtM1$fGExtValTYPEtM10 $fGExtValktM1$fTypeHasDocExtensible$fDocumentCtorCtor$fGenericExtensible$fEqExtensible$fShowExtensible$fIsoValueExtensible$fHasAnnotationExtensible$fWrappableExtensible$fEqExtConversionError$fShowExtConversionErrorDThrowsDErrorCustomErrorHasDoccustomErrDocMdCausecustomErrDocMdCauseInEntrypointcustomErrClasscustomErrArgumentSemantics ErrorClassErrClassActionExceptionErrClassBadArgumentErrClassContractInternalErrClassUnknownRequireNoArgError CustomErrorceTagceArgErrorArg SomeErrorUnspecifiedError ErrorHasDocErrorRequirements errorDocNameerrorDocMdCauseerrorDocMdCauseInEntrypointerrorDocHaskellRep errorDocClasserrorDocDependencieserrorDocRequirementsIsError errorToVal errorFromVal ErrorScope isoErrorToValisoErrorFromVal failUsingfailUnexpectedcustomErrorDocHaskellRepGeneralerrorTagToMTexterrorTagToText failCustom failCustom_isInternalErrorClass typeDocMdDescriptionReferToError$fShow->$fEq->$fIsoValueCustomError$fBuildableCustomError$fBuildableErrorClass$fReadErrorClass$fErrorHasDoc->$fErrorHasDocUnspecifiedError$fErrorHasDoc()$fErrorHasDocMText $fIsError->$fIsErrorUnspecifiedError $fIsError()$fIsErrorMText$fShowSomeError$fBuildableSomeError $fEqSomeError$fErrorHasDocCustomError$fIsErrorCustomError$fDocItemDError $fOrdDError $fEqDError$fDocItemDThrows $fEqDThrows$fGenericUnspecifiedError$fIsoValueUnspecifiedError$fLiftErrorClass$fShowCustomError$fEqCustomError entrypointDocerrorDoctypeDoc VoidResult unVoidResultVoid_ voidParam voidResProxyView viewParamviewCallbackToUpdateN updateNImplConstraintUpdateNLorentzReplaceN replaceNImplConstraintReplaceNLorentz mapInsert mapInsertNew deleteMapDuupX duupXImplConstraintDuupXLorentzeqneqgtlegeltifEq0ifNeq0ifLt0ifGt0ifLe0ifGe0ifEqifNeqifLtifGtifLeifGefail_assert assertEq0 assertNeq0 assertLt0 assertGt0 assertLe0 assertGe0assertEq assertNeqassertLtassertGtassertLeassertGe assertNone assertSome assertLeft assertRight assertUsingdropXcloneXduupXframedNpapairppaiirunpaircdarcddrcaarcadrsetCarsetCdrmapCarmapCdrifRightifSomewhen_unless_whenSomewhenNone setInsert setInsertNew setDeletereplaceNupdateNbuildViewTuple buildViewmkViewwrapView unwrapViewview_ voidResultTagmkVoidvoid_wrapVoid unwrapVoidaddressToEpAddresspushContractRef selfAddressdupTop2 fromOptionisSomenonnon'isEmpty $fCloneXSas $fCloneXZas$fDuupX[][]Ssas1tail$fDuupXkkS:as1tail$fDuupXkkSsas1tail$fMapInstrsBigMap$fMapInstrsMap$fReplaceN[][]Ssamidtail$fReplaceNkkSsamidtail$fUpdateN[][]Ssabmidtail$fUpdateNk[]Ssabmidtail$fUpdateNk[]Ssabmidtail0$fBuildableView$fBuildableView0$fTypeHasDocView$fCanCastToTYPETYPEViewView$fBuildableVoid_$fTypeHasDocVoid_$fCanCastToTYPETYPEVoid_Void_$fIsoValueVoidResult$fErrorHasDocVoidResult$fIsErrorVoidResult$fTypeHasDocVoidResult$fEqView $fShowView $fGenericView$fHasAnnotationView$fGenericVoid_ $fShowVoid_$fHasAnnotationVoid_$fGenericVoidResult$fEqVoidResult$fIsoValueVoid_$fIsoValueViewUParamLinearizedUParamLinearize CaseUParamUParamFallbackEntrypointsImplEntrypointLookupErrorNoSuchEntrypoint UnpackUParam unpackUParamConstrainedSomeRequireUniqueEntrypointsLookupEntrypointUParam_ SomeInterfaceUParam UParamUnsafe?:EntrypointKindmkUParam unwrapUParamuparamFallbackFail caseUParam caseUParamT uparamFromAdt pbsUParam/$fCustomErrorHasDoc"uparamArgumentUnpackFailed"+$fCustomErrorHasDoc"uparamNoSuchEntrypoint"$fBuildableCustomError0$fTypeHasDocUParam$fCanCastToTYPETYPEUParamUParam$fBuildableConstrainedSome$fShowConstrainedSome$fCaseArrowname'bodyCaseClauseU $fBuildableEntrypointLookupError$fUnpackUParamc:$fUnpackUParamc[] $fCaseUParam:$fCaseUParam[]$fGUParamLinearizeM1$fGUParamLinearizeM10$fGUParamLinearizeM11$fGUParamLinearize:+:$fGUParamLinearizeM12$fGenericUParam $fEqUParam $fShowUParam$fIsoValueUParam$fHasAnnotationUParam$fWrappableUParam$fGenericEntrypointLookupError$fEqEntrypointLookupError$fShowEntrypointLookupError ConditionHoldsIsSomeIsNoneIsLeftIsRightIsConsIsNilIsZero IsNotZeroIsEqIsNeqIsLtIsGtIsLeIsGeNamedBinConditionPreserveArgsBinCondition>> ifThenElse<.>.<=.>=.==./=. keepIfArgsErrorTagExclusions ErrorTagMapgatherErrorTagsaddNewErrorTagsbuildErrorTagMapexcludeErrorTagsapplyErrorTagMapapplyErrorTagMapWithExclusionsuseNumericErrorserrorFromValNumericerrorToValNumericNumericErrorWrapperNumericErrorDocHandlerNumericErrorDocHandlerErrorDDescribeErrorTagMap detmSrcLocapplyErrorTagToErrorsDocapplyErrorTagToErrorsDocWithcustomErrorDocHandlervoidResultDocHandlerbaseErrorDocHandlers$fDocItemDDescribeErrorTagMap$fErrorHasDocNumericTextError$fErrorHasNumericDocVoidResult$fErrorHasNumericDocCustomError $fErrorHasDocNumericErrorWrapper$fEqDDescribeErrorTagMap$fOrdDDescribeErrorTagMap%$fCustomErrorHasDoc"senderIsNotAdmin"Emptyabsurd_"$fCustomErrorHasDoc"emptySupplied"$fTypeHasDocEmpty$fGenericEmpty$fIsoValueEmpty$fHasAnnotationEmptyLDefaultldeflIsDef $fLDefault(,)$fLDefaultNamedF $fLDefaultMap $fLDefaultSet $fLDefault[]$fLDefaultNatural$fLDefaultIntegerLIsoliToliFrom invertIso involutedIsocheckedCoerceIsoforcedCoerceIsonamedIsononIso nonDefIsoStorageContains::->~>StoreHasEntrypoint storeEpOpsStoreEntrypointOps sopToEpLambdasopSetEpLambda sopToEpStore sopSetEpStoreEntrypointsFieldEntrypointLambdaStoreHasSubmapstoreSubmapOpsStoreSubmapOpssopMemsopGet sopUpdate sopDelete sopInsert StoreHasField storeFieldOps StoreFieldOps sopToField sopSetField stToField stGetField stSetFieldstMemstGetstUpdatestDeletestInsert stInsertNew stEntrypoint stToEpLambda stGetEpLambda stSetEpLambda stToEpStore stGetEpStore stSetEpStorestoreFieldOpsADTstoreEntrypointOpsADTstoreEntrypointOpsFieldsstoreEntrypointOpsSubmapFieldstoreFieldOpsDeeperstoreSubmapOpsDeeperstoreEntrypointOpsDeeperstoreSubmapOpsReferTostoreFieldOpsReferTostoreEntrypointOpsReferTomapStoreFieldOpsmapStoreSubmapOpsKeymapStoreSubmapOpsValuecomposeStoreFieldOpscomposeStoreSubmapOpssequenceStoreSubmapOpscomposeStoreEntrypointOpszoomStoreSubmapOps mkStoreEp$fStoreHasSubmapMapnamekeyvalue"$fStoreHasSubmapBigMapnamekeyvalue CmdLnArgsPrintDocumentAnalyze PrintStorageContractRegistryunContractRegistry ContractInfo ciContractciIsDocumentedciStorageParserciStorageNotes?::printContractFromRegistryDoc argParserrunContractRegistry$fBuildableContractRegistryNamedEpMichelson.Typed.ArithOrParseLorentzErrorMichelson.PreprocesstransformStringstransformBytesMichelson.Typed.PolymorphicEDivOpSliceOpConcatOpGetOpUpdOpSizeOpMichelson.Typed.TTIterOpMapOpMemOpKeyQformatting-6.3.7-f657285dbde7b1a5d2c857e57ad9fbcce088a40b10e975edb665876b55f91c1aFormatting.Buildable BuildableGEntrypointsNotesEntrypointsNotesgMkEntrypointsNotesAllEntrypointsNotesTOrmkEntrypointsNotesmkEpLiftSequence mkEpDescs UnaryArithOpArithOp##HashAlgorithmKindMorley.Micheline.Expression Expression!Michelson.Typed.Haskell.Instr.Sum CaseClauseTypeGDocumentEntrypointsgDocumentEntrypointsdocumentEntrypoints CtorFieldpbSamplemodifyParamBuildingStepsmdAddIdMichelson.Typed.InstrCONTRACTSELF varPosition VarNamePrettyVarNameVarNamed dupLUnsafeDipTDupT DocumentCtorGExtVal GGetCtorsEnumerateCtorsCtorKindCtor LookupCtorWrapExt packForWrapCustomErrorReppickFirstSentenceerrorsDocumentationUpdateNConstraint'ReplaceNConstraint' MapInstrs mapUpdateDuupXConstraint'GUParamLinearizecaseUParamUnsafe CaseClauseUFAILWITHErrorHasNumericDocnumericErrorDocHaskellRepNumericTextErrorEheNotApplicableEheConversionUnnecessarydDescribeErrorTagMapAnchortextErrorDocHandlerD:R:ErrorArg"senderIsNotAdmin"D:R:ErrorArg"emptySupplied"pushStEpsomeStEpsetStEpversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName