@temperlang/std 0.3.0 → 0.5.0

package/regex.js.map

@@ -1 +1 @@
-{ "version": 3, "file": "js/std/regex.js", "sources": [ "std/regex.temper.md" ], "sourcesContent": [ "# Regex Data Model and Functionality\n\nThe structural data model for regex patterns enables direct construction, and\nthe Temper regex dialect compiles static regex text patterns to these objects.\n\nA focus here is on providing tools people can actually reach for when they need\nto do text processing. The execution should be faster on backends like Python\nthan writing raw code, and the implementation in backends like C should\napproximate what you'd like to have written manually.\n\nDue to inadequate and distinct Unicode handling in backend regex engines, the\ninitial feature set avoids character classes and properties but is still aware\nof code points. Parsing focused on limited sets of delimiters works best for\nnow.\n\nThe core feature set here focuses on both the data model and utility functions,\nsuch as matching regexes against strings.\n\n## Regex Data Model\n\nTemper regex representation is composed hierarchically of `RegexNode` objects.\nAnd perhaps the most fundamental `RegexNode` is the [Sequence](#sequence),\nbecause it enables multiple regex components to be strung together. For example,\n`/hi./` is a sequence of [CodePoints](#codepoints) `/hi/` and dot `/./`, but all\ncomponent types extend the `RegexNode` interface.\n\n```\nexport /*sealed*/ interface RegexNode {\n```\n\nBefore a regex is used, it must be compiled. This transforms a `RegexNode` tree\ninto a backend-native [Regex](#regex). Some helper functions compile on the fly,\nalthough it is faster to reuse a pre-compiled regex.\n\n```\n  // TODO(tjp, regex): Make this into a macro behind the scenes.\n  // TODO(tjp, regex): `compiled\u003cT\u003e(): Regex\u003cT\u003e`\n  public compiled(): Regex { new Regex(this) }\n```\n\nThe simplest use of a regular expression is if it is found in a string.\nAgain, it is better to compile to a `Regex` in advance than to repeatedly call\nconvenience methods on a `RegexNode`.\n\n```\n  public found(text: String): Boolean { compiled().found(text) }\n```\n\nYou can also return match details or perform text replacement. The returned\ngroups map contains an entry for each key in the order defined in the regex\npattern. If no \u0022full\u0022 group is defined, one is added automatically to capture\nthe full matched text.\n\nIn the future, we intend to support customized match types with fields to match\ncapture groups, statically checked where possible.\n\n```\n  // TODO(tjp, regex): Also macro because reification.\n\n  public find(text: String): Map\u003cString, Group\u003e | Bubble {\n    compiled().find(text)\n  }\n\n  public replace(\n    text: String, format: fn (Map\u003cString, Group\u003e): String\n  ): String {\n    compiled().replace(text, format)\n  }\n```\n\nThat's it for what you can do with regex patterns in Temper today, but there's\nmuch more to say on what kinds of regexes can be built.\n\n```\n}\n```\n\n## Regex Item Types\n\nA `Regex` is composed of a potential variety of subtypes.\n\n### Groups\n\nMultiple types of groups exist:\n\n- [Capture](#capture) `/(?\u003cname\u003e...)/` to remember match groups for later use.\n- Non-capturing group syntax `/(?:...)/`, which is simply a [Regex](#regex)\n  instance in the data model.\n\n### Capture\n\nTODO(tjp, regex): Change to named captures only!\n\n`Capture` is a [group](#groups) that remembers the matched text for later\naccess. Temper supports only named matches, with current intended syntax\n`/(?name = ...)/`.\n\n```\nexport class Capture extends RegexNode {\n  public name: String;\n  public /*early*/ item: RegexNode;\n}\n```\n\n### CodePart\n\nA component of a [CodeSet][#codeset], aka character class, which applies to a\nsubset of regex data types.\n\nHere, \u0022code\u0022 is short for \u0022code point\u0022 although \u0022char\u0022 might work better,\ndepending on expectations.\n\n```\nexport /*sealed*/ interface CodePart extends RegexNode {}\n```\n\n### CodePoints\n\nOne or more verbatim code points, where the sequence matters if within a\n[Regex](#regex) or not if within a [CodeSet](#codeset). Some escapes in\ntextual regex source, such as `/\\t/`, can be stored as raw code points.\n\nThe `String` here can enable more efficient storage than individual code\npoints, although the source text may require non-capture grouping. For example,\n`/(?:abc)?/` optionally matches the string `\u0022abc\u0022`, whereas `/abc?/` matches\n`\u0022ab\u0022` with an optional `\u0022c\u0022`.\n\n```\nexport class CodePoints extends CodePart {\n  public value: String;\n}\n```\n\n### Specials\n\nA number of special match forms exist. In the data model, these are empty\nclasses.\n\n- `.` - `Dot` In default mode, matches any Unicode code point except newline.\n- `^` - `Begin` in default mode matches zero-length at the beginning of a\n  string.\n- `\u0024` - `End` in default mode matches zero-length at the end of a string.\n- `\\b` - `WordBoundary` matches zero-length at the boundary between word and\n  non-word code points. More sophisticated Unicode compliance is TBD.\n- `\\s` (negated as `\\S`) - `Space` matches any horizontal space code point.\n  Details are TBD.\n- `\\w` (negated as `\\W`) - `Word` matches any word code point. Details are TBD.\n  This is currently defined in terms of old ASCII definitions because those are\n  clear. Perhaps this will stay that way, and Unicode properties like `\\p{L}`\n  will be used for human language needs.\n- `\\X` - `GraphemeCluster` might not be supported, but [here is some discussion\n  of how to implement it](\n  https://github.com/rust-lang/regex/issues/54#issuecomment-661905060).\n\n\u003cdetails\u003e\n\n```\nexport /*sealed*/ interface Special extends RegexNode {}\nexport let Begin: Special = do { class Begin extends Special {}; new Begin() };\nexport let Dot: Special = do { class Dot extends Special {}; new Dot() };\nexport let End: Special = do { class End extends Special {}; new End() };\n// TODO(tjp, regex): We can't easily support this at present across backends.\n// export let GraphemeCluster = do {\n//   class GraphemeCluster extends Special {}; new GraphemeCluster()\n// };\nexport let WordBoundary: Special = do {\n  class WordBoundary extends Special {}; new WordBoundary()\n};\n\nexport /*sealed*/ interface SpecialSet extends CodePart \u0026 Special {}\nexport let Digit: SpecialSet = do {\n  class Digit extends SpecialSet {}; new Digit()\n};\nexport let Space: SpecialSet = do {\n  class Space extends SpecialSet {}; new Space()\n};\nexport let Word: SpecialSet = do {\n  class Word extends SpecialSet {}; new Word()\n};\n```\n\n\u003c/details\u003e\n\n### CodeRange\n\nA code point range matches any code point in its inclusive bounds, such as\n`/[a-c]/`. In source, `-` is included in a code set either by escaping or by\nincluding it as the first or last character. A `CodeRange` is usually contained\ninside a [CodeSet](#codeset), and syntactically always is.\n\n```\nexport class CodeRange extends CodePart {\n  public min: Int;\n  public max: Int;\n}\n```\n\n### Itemized Regex Types\n\nMake an abstraction over Regex types that have lists of subitems. This can make\nprocessing more convenient.\n\n    export interface ItemizedRegex\u003cITEM extends RegexNode\u003e extends RegexNode {\n      public get items(): List\u003cITEM\u003e;\n    }\n\n### CodeSet\n\nA set of code points, any of which can match, such as `/[abc]/` matching any of\n`\u0022a\u0022`, `\u0022b\u0022`, or `\u0022c\u0022`. Alternatively, a negated set is the inverse of the code\npoints given, such as `/[^abc]/`, matching any code point that's not any of\nthese. This is also often called a character class.\n\nFurther, a subset of [specials](#specials) can also be used in code sets. A\nnegated code set of just a special set often has custom syntax. For example,\nnon-space can be said as either `/[^\\s]/` or `/\\S/`.\n\n```\nexport class CodeSet extends ItemizedRegex\u003cCodePart\u003e {\n  public items: List\u003cCodePart\u003e;\n  public negated: Boolean = false;\n}\n```\n\n### Or\n\n`Or` matches any one of multiple options, such as `/ab|cd|e*/`.\n\n```\nexport class Or extends ItemizedRegex\u003cRegexNode\u003e {\n  public /*early*/ items: List\u003cRegexNode\u003e;\n}\n```\n\n### Repeat\n\n`Repeat` matches from an minimum to a maximum number of repeats of a\nsubregex. This can be represented in regex source in a number of ways:\n\n- `?` matches 0 or 1.\n- `*` matches 0 or more.\n- `+` matches 1 or more.\n- `{m}` matches exactly `m` repetitions.\n- `{m,n}` matches between `m` and `n`. Missing `n` is a max of infinity. For\n  example, `{0,1}` is equivalent to `?`, and `{1,}` is equivalent to `+`.\n\nBy default, repetitions are greedy, matching as many repetitions as possible.\nIn regex source, any of the above can have `?` appended to indicated reluctant\n(aka non-greedy), matching as few repetitions as possible.\n\n```\nexport class Repeat extends RegexNode {\n  public /*early*/ item: RegexNode;\n  public min: Int;\n  public max: Int | Null; // where null means infinite\n  public reluctant: Boolean = false;\n}\n```\n\nWe also have convenience builders.\n\n```\nexport let entire(item: RegexNode): RegexNode {\n  new Sequence([Begin, item, End])\n}\n\nexport let oneOrMore(item: RegexNode, reluctant: Boolean = false): Repeat {\n  { item, min: 1, max: null, reluctant }\n}\n\nexport let optional(item: RegexNode, reluctant: Boolean = false): Repeat {\n  { item, min: 0, max: 1, reluctant }\n}\n```\n\n### Sequence\n\n`Sequence` strings along multiple other regexes in order.\n\n```\nexport class Sequence extends ItemizedRegex\u003cRegexNode\u003e {\n  public /*early*/ items: List\u003cRegexNode\u003e;\n}\n```\n\n## Match Objects\n\nFor detailed match results, call `find` on a regex to get a `Map` object from\n`String` keys to `Group` values.\n\n```\n// TODO Go back to a `Match` object with `groups` as a member so we can also\n// TODO easily return metadata alongside groups? Or is simpler better?\n// export class Match { // interface ... \u003cT = Map\u003cString, Group\u003e\u003e {\n//   public let groups: Map\u003cString, Group\u003e;\n// }\n\nexport class Group {\n  public let name: String;\n  public let value: String;\n  public let codePointsBegin: Int;\n}\n```\n\n## Compiled Regex Objects\n\nThe compiled form of a regex is mostly opaque, but it can be cached for more\nefficient reuse than working from a source [RegexNode](#regex-data-model).\n\n\u003cdetails\u003e\n\n```\n// Provides a workaround for access to std/regex from extension methods.\nclass RegexRefs {\n  public let codePoints: CodePoints = new CodePoints(\u0022\u0022);\n  public let group: Group = { name: \u0022\u0022, value: \u0022\u0022, codePointsBegin: 0 }\n  public let orObject: Or = new Or([]);\n}\n\nlet regexRefs = new RegexRefs();\n```\n\n\u003c/details\u003e\n\n```\n// TODO(tjp, regex): Generate subtypes of this interface later.\nexport class Regex { // interface ... \u003cT\u003e {\n```\n\nThe source `Regex` data is still available on compiled objects in case it's\nneeded for composition or other purposes.\n\n```\n  public let data: RegexNode;\n\n  public constructor(data: RegexNode) {\n    this.data = data;\n    compiled = compileFormatted(format());\n  }\n```\n\nA compiled regex exposes many of the same capabilities as `Regex`, but they are\nmore efficient to use repeatedly.\n\n```\n  public found(text: String): Boolean { compiledFound(compiled, text) }\n\n  public find(text: String): Map\u003cString, Group\u003e | Bubble {\n    compiledFind(compiled, text, regexRefs)\n  }\n\n  public replace(\n    text: String, format: fn (Map\u003cString, Group\u003e): String\n  ): String {\n    compiledReplace(compiled, text, format, regexRefs)\n  }\n```\n\nTODO(tjp, regex): Public method for replace with named references.\nTODO(tjp, regex): Any static checking?\n\n\u003cdetails\u003e\n\n```\n  let compiled: AnyValue;\n\n  // Extension functions on some backends need the private `compiled` value\n  // passed in directly.\n  @connected(\u0022Regex::compiledFound\u0022)\n  compiledFound(compiled: AnyValue, text: String): Boolean;\n\n  @connected(\u0022Regex::compiledFind\u0022)\n  compiledFind(\n    compiled: AnyValue, text: String, regexRefs: RegexRefs\n  ): Map\u003cString, Group\u003e | Bubble;\n\n  @connected(\u0022Regex::compileFormatted\u0022)\n  compileFormatted(formatted: String): AnyValue;\n\n  @connected(\u0022Regex::compiledReplace\u0022)\n  compiledReplace(\n    compiled: AnyValue,\n    text: String,\n    format: fn (Map\u003cString, Group\u003e): String,\n    regexRefs: RegexRefs,\n  ): String;\n\n  @connected(\u0022Regex::format\u0022)\n  format(): String { new RegexFormatter().format(data) }\n```\n\n\u003c/details\u003e\n\n```\n}\n```\n\n## Private implementation matters\n\nSome regex logic can be shared across backends. These features aren't directly\nexported to the user, however.\n\nThe intent is that these support features only get included in compiled Temper\ncode if usage depends on dynamically constructed regexes. If all regex building\nis done as stable values, we hope to generated backend compiled regexes purely\nat Temper compile time.\n\n### RegexFormatter\n\n\u003cdetails\u003e\n\n```\nclass RegexFormatter {\n  let out: ListBuilder\u003cString\u003e = new ListBuilder\u003cString\u003e();\n\n  public format(regex: RegexNode): String {\n    pushRegex(regex)\n    out.join(\u0022\u0022) { (x);; x }\n  }\n\n  pushRegex(regex: RegexNode): Void {\n    match (regex) {\n      // Aggregate types.\n      is Capture -\u003e pushCapture(regex);\n      is CodePoints -\u003e pushCodePoints(regex, false);\n      is CodeRange -\u003e pushCodeRange(regex);\n      is CodeSet -\u003e pushCodeSet(regex);\n      is Or -\u003e pushOr(regex);\n      is Repeat -\u003e pushRepeat(regex);\n      is Sequence -\u003e pushSequence(regex);\n      // Specials.\n      // Some of these will need to be customized on future backends.\n      Begin -\u003e out.add(\u0022^\u0022);\n      Dot -\u003e out.add(\u0022.\u0022);\n      End -\u003e out.add(\u0022\u0024\u0022);\n      WordBoundary -\u003e out.add(\u0022\\\\b\u0022);\n      // Special sets.\n      Digit -\u003e out.add(\u0022\\\\d\u0022);\n      Space -\u003e out.add(\u0022\\\\s\u0022);\n      Word -\u003e out.add(\u0022\\\\w\u0022);\n      // ...\n    }\n  }\n\n  pushCapture(capture: Capture): Void {\n    out.add(\u0022(\u0022);\n    // TODO(tjp, regex): Consistent name validation rules for all backends???\n    // TODO(tjp, regex): Validate here or in `Capture` constructor???\n    // TODO(tjp, regex): Validate here or where against reused names???\n    pushCaptureName(out, capture.name);\n    pushRegex(capture.item);\n    out.add(\u0022)\u0022);\n  }\n\n  @connected(\u0022RegexFormatter::pushCaptureName\u0022)\n  pushCaptureName(out: ListBuilder\u003cString\u003e, name: String): Void {\n    // All so far except Python use this form.\n    out.add(\u0022?\u003c\u0024{name}\u003e\u0022);\n  }\n\n  pushCode(code: Int, insideCodeSet: Boolean): Void {\n    // Expose private property to extension.\n    pushCodeTo(out, code, insideCodeSet);\n    // TODO(tjp, regex): Implement more in Temper once we can.\n    // if (escapeCodes[code] \u0026\u0026 false) {\n    //   out.add(\u0022\\\\\u0022);\n    //   // TODO(tjp, regex): How to convert back to strings?\n    // }\n  }\n\n  @connected(\u0022RegexFormatter::pushCodeTo\u0022)\n  pushCodeTo(out: ListBuilder\u003cString\u003e, code: Int, insideCodeSet: Boolean): Void;\n\n  pushCodePoints(codePoints: CodePoints, insideCodeSet: Boolean): Void {\n    for (\n      var slice = codePoints.value.codePoints;\n      !slice.isEmpty;\n      slice = slice.advance(1)\n    ) {\n      pushCode(slice.read(), insideCodeSet);\n    }\n  }\n\n  pushCodeRange(codeRange: CodeRange): Void {\n    out.add(\u0022[\u0022);\n    pushCodeRangeUnwrapped(codeRange);\n    out.add(\u0022]\u0022);\n  }\n\n  pushCodeRangeUnwrapped(codeRange: CodeRange): Void {\n    pushCode(codeRange.min, true);\n    out.add(\u0022-\u0022);\n    pushCode(codeRange.max, true);\n  }\n\n  pushCodeSet(codeSet: CodeSet): Void {\n    let adjusted = adjustCodeSet(codeSet, regexRefs);\n    match (adjusted) {\n      is CodeSet -\u003e do {\n        out.add(\u0022[\u0022);\n        if (adjusted.negated) {\n          out.add(\u0022^\u0022);\n        }\n        for (var i = 0; i \u003c adjusted.items.length; i += 1) {\n          pushCodeSetItem(adjusted.items[i]);\n        }\n        out.add(\u0022]\u0022);\n      }\n      else -\u003e pushRegex(adjusted);\n    }\n  }\n\n  @connected(\u0022RegexFormatter::adjustCodeSet\u0022)\n  adjustCodeSet(codeSet: CodeSet, regexRefs: RegexRefs): RegexNode { codeSet }\n\n  pushCodeSetItem(codePart: CodePart): Void {\n    match (codePart) {\n      is CodePoints -\u003e pushCodePoints(codePart, true);\n      is CodeRange -\u003e pushCodeRangeUnwrapped(codePart);\n      is SpecialSet -\u003e pushRegex(codePart);\n    }\n  }\n\n  pushOr(or: Or): Void {\n    if (!or.items.isEmpty) {\n      out.add(\u0022(?:\u0022);\n      // TODO(tjp, regex): See #822. Until `this` works better, no this in funs.\n      // TODO(tjp, regex): So just manually loop here. Sometimes faster, anyway?\n      pushRegex(or.items[0]);\n      for (var i = 1; i \u003c or.items.length; i += 1) {\n        out.add(\u0022|\u0022);\n        pushRegex(or.items[i]);\n      }\n      out.add(\u0022)\u0022);\n    }\n  }\n\n  pushRepeat(repeat: Repeat): Void {\n    // Always wrap the main sub-pattern here to make life easy\n    out.add(\u0022(?:\u0022);\n    pushRegex(repeat.item);\n    out.add(\u0022)\u0022);\n    // Then add the repetition part.\n    let min = repeat.min;\n    let max = repeat.max;\n    if (false) {\n    } else if (min == 0 \u0026\u0026 max == 1) {\n      out.add(\u0022?\u0022);\n    } else if (min == 0 \u0026\u0026 max == null) {\n      out.add(\u0022*\u0022);\n    } else if (min == 1 \u0026\u0026 max == null) {\n      out.add(\u0022+\u0022);\n    } else {\n      out.add(\u0022{\u0024{min.toString()}\u0022);\n      if (min != max) {\n        out.add(\u0022,\u0022);\n        if (max != null) {\n          out.add(max.as\u003cInt\u003e().toString());\n        }\n      }\n      out.add(\u0022}\u0022);\n    }\n    if (repeat.reluctant) {\n      out.add(\u0022?\u0022);\n    }\n  }\n\n  pushSequence(sequence: Sequence): Void {\n    // TODO(tjp, regex): Foreach loop/function would be nice.\n    for (var i = 0; i \u003c sequence.items.length; i += 1) {\n      pushRegex(sequence.items[i]);\n    }\n  }\n\n  // Put this here instead of the data model for now because I'm not sure this\n  // makes sense to be part of the public api right now.\n  public maxCode(codePart: CodePart): Int | Null {\n    match (codePart) {\n      is CodePoints -\u003e do {\n        // Iterating code points is the hardest of the current cases.\n        let value = codePart.value;\n        if (value.isEmpty) {\n          null\n        } else {\n          // My kingdom for a fold, or even just a max, in builtins.\n          var max = 0;\n          for (\n            var slice = value.codePoints;\n            !slice.isEmpty;\n            slice = slice.advance(1)\n          ) {\n            let next = slice.read();\n            if (next \u003e max) {\n              max = next;\n            }\n          }\n          max\n        }\n      }\n      // Others below are easy for now.\n      is CodeRange -\u003e codePart.max;\n      Digit -\u003e \u00229\u0022.codePoints.read();\n      Space -\u003e \u0022 \u0022.codePoints.read();\n      Word -\u003e \u0022z\u0022.codePoints.read();\n      // Actually unexpected, ever, but eh.\n      else -\u003e null;\n    }\n  }\n}\n```\n\n\u003c/details\u003e\n" ], "names": [ "Regex", "text", "format", "RegexNode", "compiled", "found", "find", "replace", "Capture", "name", "item", "CodePart", "CodePoints", "value", "Special", "SpecialSet", "CodeRange", "min", "max", "ItemizedRegex", "get.items", "CodeSet", "items", "negated", "Or", "Repeat", "reluctant", "Sequence", "Group", "codePointsBegin", "RegexRefs", "codePoints", "group", "orObject", "data", "regexRefs", "RegexFormatter", "out", "regex", "fn", "x", "return", "Begin", "Dot", "End", "WordBoundary", "Digit", "Space", "Word", "capture", "code", "insideCodeSet", "slice", "codeRange", "codeSet", "adjusted", "i", "codePart", "or", "repeat", "sequence", "next", "entire", "oneOrMore", "optional" ], "mappings": "AA2BA;AAAA;AAAA;AAUS,QAAqC,gBAAA,AAArC,EAAqC,AAAnB;AAAE,YAAI,CAAAA,KAAK,CAAC,IAAI,CAAC;AAAA;AAQnC,QAAuD,aAAA,AAAvD,CAAMC,MAAY,CAAqC,AAA1B;AAAE,QAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,KAAK,CAACA,MAAI,CAAC;AAAA;AAcrD,QAEN,YAAA,AAFM,CAAKA,MAAY,CAEvB,AAFsD;AACrD,QAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,IAAI,CAACA,MAAI,CAAC;AAAA;AAGhB,QAIN,eAAA,AAJM,CACLA,MAAY,CAAE,CAAAC,QAAuC,CAGtD,AAFS;AACR,QAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,OAAO,CAACD,MAAI,CAAE,CAAAC,QAAM,CAAC;AAAA,CACjC;AAxCyB,2OAwCzB;AAxCyB,aAAAC,SAAA,kCAwCzB,CAAA,AAxCyB,EAUnB,kBAAAC,eAAqC,EAQrC,gBAAAC,YAAuD,EAcvD,eAAAC,WAEN,EAEM,kBAAAC,cAIN,GAAA,AAxCyB,GAwCzB,CAAA,AAxCyB,EAwCzB;AA+BU,aAAAC,OAAA;AACE,uBAAM;AAAZ,EAAAC,OAAI;AACY,0BAAS;AAAf,EAAAC,QAAI,CAAW;AAFK;AAAA,cAC9BD,OAAY,CACF,CAAAC,OAAe,CAAA,AAFK;AAC9B,SAAAD,OAAI,EAAA,AAAJ,CAAAA,OAAI;AACM,SAAAC,QAAI,EAAA,AAAJ,CAAAA,OAAI,CAAA;AAAJ;AAAe,GAAA;AADzB;AAAA;AAAA,gBAAAD,OAAA;AAAA;AACU;AAAA;AAAA,gBAAAC,QAAA;AAAA;AAAA,CAAe,CAAA;AAFrBP,SAEqB,eAAA,AAFrBK,OAAA,CAEqB;AAaN,oCAA2B;AAA3B,aAAAG,QAAA,iCAA2B,CAAA,AAA3B,GAA2B,CAAA,AAA3B,EAAAR,SAA2B,EAAA,AAA3B,EAA2B;AAe1C,aAAAS,UAAA;AACG,uBAAM;AAAb,EAAAC,SAAK,CAAQ;AADmB;AAAA,cAChCA,QAAa,CAAA,AADmB;AAChC,SAAAA,SAAK,EAAA,AAAL,CAAAA,QAAK,CAAA;AAAL;AAAa,GAAA;AAAb;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CAAa,CAAA;AADTF,QACS,eAAA,AADTC,UAAA,CACS;AA4BM,mCAA0B;AAA1B,aAAAE,OAAA,gCAA0B,CAAA,AAA1B,GAA0B,CAAA,AAA1B,EAAAX,SAA0B,EAAA,AAA1B,EAA0B;AAY1B,sCAAsC;AAAtC,aAAAY,UAAA,mCAAsC,CAAA,AAAtC,GAAsC,CAAA,AAAtC,EAAAJ,QAAsC,CAAA,AAAtC,CAAAG,OAAsC,EAAA,AAAtC,EAAsC;AAsBrD,aAAAE,SAAA;AACC,uBAAG;AAAR,EAAAC,OAAG;AACE,uBAAG;AAAR,EAAAC,OAAG,CAAK;AAFuB;AAAA,cAC/BD,MAAQ,CACR,CAAAC,MAAQ,CAAA,AAFuB;AAC/B,SAAAD,OAAG,EAAA,AAAH,CAAAA,MAAG;AACH,SAAAC,OAAG,EAAA,AAAH,CAAAA,MAAG,CAAA;AAAH;AAAQ,GAAA;AADR;AAAA;AAAA,gBAAAD,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,OAAA;AAAA;AAAA,CAAQ,CAAA;AAFJP,QAEI,eAAA,AAFJK,SAAA,CAEI;AAUJ,QAAI,cAAK,AAAT,EAAuB;AAAA;AAAA,CAAA;AADf,mGACe;AADf,aAAAG,aAAA,sCACe,CAAA,AADf,EACR,eAAAC,aAAuB,GAAA,AADf,EAAAjB,SACe,EAAA,AADf,EACe;AAevB,aAAAkB,OAAA;AACG,gCAAc;AAArB,EAAAC,SAAK;AACI,wBAAO;AAAhB,EAAAC,WAAO,CAAiB;AAFoB;AAAA,cAC5CD,QAAqB,CACrB,CAAAC,UAAwB,CAAA,AAFoB;AAAA,QAEzB,EAAA,AAAnBA,UAAmB,IAAK,AAAL,KAAK,AAAL,EAAK,IAAA;AAAxB,MAAAA,UAAmB,EAAK,AAAL,MAAK;AAAA,KAAA;AADxB,SAAAD,SAAK,EAAA,AAAL,CAAAA,QAAK;AACL,SAAAC,WAAO,EAAA,AAAP,CAAAA,UAAO,CAAA;AAAP;AAAwB,GAAA;AADxB;AAAA;AAAA,gBAAAD,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,WAAA;AAAA;AAAA,CAAwB,CAAA;AAFpBJ,aAEoB,eAAA,AAFpBE,OAAA,CAEoB;AASpB,aAAAG,EAAA;AACa,iCAAe;AAAtB,EAAAF,SAAK,CAAiB;AADQ;AAAA,cAC9BA,QAAsB,CAAA,AADQ;AAC9B,SAAAA,SAAK,EAAA,AAAL,CAAAA,QAAK,CAAA;AAAL;AAAsB,GAAA;AAAtB;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CAAsB,CAAA;AAD5BH,aAC4B,eAAA,AAD5BK,EAAA,CAC4B;AAqB5B,aAAAC,MAAA;AACY,0BAAS;AAAf,EAAAf,QAAI;AACT,uBAAG;AAAR,EAAAO,OAAG;AACE,8BAAU;AAAf,EAAAC,OAAG;AACQ,wBAAO;AAAlB,EAAAQ,aAAS,CAAiB;AAJG;AAAA,cACnBhB,OAAe,CACzB,CAAAO,MAAQ,CACR,CAAAC,MAAe,CACf,CAAAQ,YAA0B,CAAA,AAJG;AAAA,QAIR,EAAA,AAArBA,YAAqB,IAAK,AAAL,KAAK,AAAL,EAAK,IAAA;AAA1B,MAAAA,YAAqB,EAAK,AAAL,MAAK;AAAA,KAAA;AAHhB,SAAAhB,QAAI,EAAA,AAAJ,CAAAA,OAAI;AACd,SAAAO,OAAG,EAAA,AAAH,CAAAA,MAAG;AACH,SAAAC,OAAG,EAAA,AAAH,CAAAA,MAAG;AACH,SAAAQ,aAAS,EAAA,AAAT,CAAAA,YAAS,CAAA;AAAT;AAA0B,GAAA;AAHhB;AAAA;AAAA,gBAAAhB,QAAA;AAAA;AACV;AAAA;AAAA,gBAAAO,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAQ,aAAA;AAAA;AAAA,CAA0B,CAAA;AAJtBvB,SAIsB,eAAA,AAJtBsB,MAAA,CAIsB;AAyBtB,aAAAE,QAAA;AACa,iCAAe;AAAtB,EAAAL,SAAK,CAAiB;AADc;AAAA,cACpCA,QAAsB,CAAA,AADc;AACpC,SAAAA,SAAK,EAAA,AAAL,CAAAA,QAAK,CAAA;AAAL;AAAsB,GAAA;AAAtB;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CAAsB,CAAA;AAD5BH,aAC4B,eAAA,AAD5BQ,QAAA,CAC4B;AAgB5B,aAAAC,KAAA;AACM,uBAAM;AAAZ,EAAAnB,QAAI;AACG,uBAAM;AAAb,EAAAI,SAAK;AACY,uBAAG;AAApB,EAAAgB,mBAAe,CAAK;AAHd;AAAA,cACNpB,OAAY,CACZ,CAAAI,QAAa,CACb,CAAAgB,kBAAoB,CAAA,AAHd;AACN,SAAApB,QAAI,EAAA,AAAJ,CAAAA,OAAI;AACJ,SAAAI,SAAK,EAAA,AAAL,CAAAA,QAAK;AACL,SAAAgB,mBAAe,EAAA,AAAf,CAAAA,kBAAe,CAAA;AAAnB;AAAwB,GAAA;AAFxB;AAAA;AAAA,gBAAApB,QAAA;AAAA;AACA;AAAA;AAAA,gBAAAI,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAgB,mBAAA;AAAA;AAAA,CAAwB;AAa3B,MAAAC,YAAA;AACmB,2BAAU;AAAtB,EAAAC,cAAU;AACH,sBAAK;AAAZ,EAAAC,SAAK;AACK,mBAAE;AAAZ,EAAAC,YAAQ,CAAiB;AAHtB;AAAA,cACHF,aAA2C,CAC3C,CAAAC,QAA0D,CAC1D,CAAAC,WAAyB,CAAA,AAHtB;AACsB,YAAkB;AAC5B,YAA2C;AAC3C,YAAU,CAAA;AAHtB,QACsB,EAAA,AAAzBF,aAAyB,IAAkB,AAAlB,KAAkB,AAAlB,EAAkB,IAAA;AAAlB,YAAkB,AAAlB,IAAI,CAAAnB,UAAU,CAAC,EAAE,CAAC,CAAA;AAA3C,MAAAmB,aAAyB,EAAkB,AAAlB,KAAkB;AAAA;AAAA,QAC5B,EAAA,AAAfC,QAAe,IAA2C,AAA3C,KAA2C,AAA3C,EAA2C,IAAA;AAA3C,YAA2C,AAA3C,IAAE,CAAAJ,KAAA,CAAM,EAAE,CAAS,GAAE,CAAmB,EAAC,CAAE,CAAA;AAA1D,MAAAI,QAAe,EAA2C,AAA3C,KAA2C;AAAA;AAAA,QAC3C,EAAA,AAAfC,WAAe,IAAU,AAAV,KAAU,AAAV,EAAU,IAAA;AAAV,YAAU,AAAV,IAAI,CAAAT,EAAE,CAAC,UAAC,EAAC,CAAC,CAAA;AAAzB,MAAAS,WAAe,EAAU,AAAV,KAAU;AAAA,KAAA;AAFzB,SAAAF,cAAU,EAAA,AAAV,CAAAA,aAAU;AACV,SAAAC,SAAK,EAAA,AAAL,CAAAA,QAAK;AACL,SAAAC,YAAQ,EAAA,AAAR,CAAAA,WAAQ,CAAA;AAAZ;AAA6B,GAAA;AAF7B;AAAA;AAAA,gBAAAF,cAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,YAAA;AAAA;AAAA;AAUI,aAAAjC,KAAA;AAOM,0BAAS;AAAf,EAAAkC,QAAI;AAER,mCAGN;AAHM,cAAYA,OAAe,CAGjC,AAHmC,EAC7B;AAAL,QAAI,CAACA,QAAI,EAAG,CAAAA,OAAI,AAAP;AACmB,YAAQ,EAAA,AAAR,KAAM,CAAA,AAAN,MAAM,EAAE,CAAA;AAAzB,YAA0B,EAAA,AAA1B,yBAAgB,CAAA,AAAhB,IAAgB,CAAC,KAAQ,CAAC,CAAA;AAArC,QAAQ,CAAA,AAAR9B,YAAQ,EAAG,KAA0B,AAA7B;AAA6B;AAAC;AAQjC;AAA8D,OAAA,AAA9D,CAAMH,OAAY,CAA4C,AAAjC;AAAE,gCAAa,CAAA,AAAb,IAAa,CAAC,KAAQ,CAAA,AAARG,YAAQ,CAAE,CAAAH,OAAI,CAAC;AAAA;AAE5D;AAEN,MAAA,AAFM,CAAKA,OAAY,CAEvB,AAFsD;AACrD,+BAAY,CAAA,AAAZ,IAAY,CAAC,KAAQ,CAAA,AAARG,YAAQ,CAAE,CAAAH,OAAI,CAAE,CAAAkC,YAAS,CAAC;AAAA;AAGlC;AAIN,SAAA,AAJM,CACLlC,OAAY,CAAE,CAAAC,SAAuC,CAGtD,AAFS;AACR,kCAAe,CAAA,AAAf,IAAe,CAAC,KAAQ,CAAA,AAARE,YAAQ,CAAE,CAAAH,OAAI,CAAE,CAAAC,SAAM,CAAE,CAAAiC,YAAS,CAAC;AAAA;AAUtC,wBAAQ;AAAlB,EAAA/B,YAAQ;AAwBZ;AAAsD,QAAA,AAAtD,EAAsD,AAArC;AAAE,UAAqB,AAArB,IAAI,CAAAgC,iBAAc,EAAE,CAAC,MAAM,CAAC,IAAI,CAAA,AAAJF,QAAI,CAAC;AAAA,GAAE;AAvD/C;AAAA;AAAA,gBAAAA,QAAA;AAAA;AAAA,CAuD+C;AAwBlD,MAAAE,iBAAA;AACK,8BAAmB;AAAxB,EAAAC,OAAG;AAEA;AAGN,QAAA,AAHM,CAAOC,QAAgB,CAG7B,AAHuC;AACtC,QAAS,CAAA,AAAT,SAAS,CAACA,QAAK,CAAC;AAChB,YAAG,EAAA,AAAH,KAAG,CAAA,AAAHD,OAAG;AAAU,aAAAE,KAAA,CAAGC,IAAC,CAAO,AAAH;AAAA,aAAAA,IAAC;AAAA,KAAA;AAAtB,UAAI,cAAI,CAAA,AAAR,IAAG,CAAM,GAAE,CAAE,CAAAD,KAAW;AAAA;AAG1B;AAsBC,WAAA,AAtBD,CAAUD,SAAgB,CAsBzB,AAtBiC,EAAA;AAAL,QAAAG,UAAI;AAG1B,aAAO;AAAI,aAkBf,CAAA;AAjBI,aAAU;AAAI,aAA4B;AAC1C,aAAS;AAAI,aAAoB;AACjC,aAAO;AAAI,aAAkB;AAC7B,aAAE;AAAI,aAAa;AACnB,aAAM;AAAI,aAAiB;AAC3B,aAAQ;AAAI,aAAmB,CAAA;AAN/B;AAAA,4BAAO,CAAA,AAFLH,SAAK,CAEP,CAAA9B,OAAO,EAAA;AAAP,aAAO,AAAP,KAAO;AAAA,KAAA,AAAP;AAAA,aAAO,AAAP,MAAO;AAAA,KAAA;AAFZ,eAqBD,CAAA,AArBC;AAAA,UAEK,KAAO,GAAA;AAAI;AAAA,iBAkBf,AAlBI,uBAAO,CAAA,AAFL8B,SAAK,CAEP,CAAA9B,OAAO,CAkBX;AAAA,SACF;AAAA;AAAA,SAAA;AAnBiB,YAAW,CAAA,AAAX,WAAW,CAAC,KAAK,CAAC;AAkBjC,cAAA;AAjBI;AAAA,gCAAU,CAAA,AAHR8B,SAAK,CAGP,CAAA1B,UAAU,EAAA;AAAV,iBAAU,AAAV,KAAU;AAAA,SAAA,AAAV;AAAA,iBAAU,AAAV,MAAU;AAAA,SAAA;AAAb,YAAG,KAAU,GAAA;AAAI;AAAA,mBAA4B,AAA1C,uBAAU,CAAA,AAHR0B,SAAK,CAGP,CAAA1B,UAAU,CAAgC;AAAA,WAkBhD;AAAA;AAAA,WAAA;AAlBoB,cAAc,CAAA,AAAd,cAAc,CAAC,KAAK,CAAE,MAAK,CAAC;AAAA;AAC1C;AAAA,kCAAS,CAAA,AAJP0B,SAAK,CAIP,CAAAtB,SAAS,EAAA;AAAT,mBAAS,AAAT,KAAS;AAAA,WAAA,AAAT;AAAA,mBAAS,AAAT,MAAS;AAAA,WAAA;AAAZ,cAAG,KAAS,GAAA;AAAI;AAAA,qBAAoB,AAAjC,uBAAS,CAAA,AAJPsB,SAAK,CAIP,CAAAtB,SAAS,CAAwB;AAAA,aAiBvC;AAAA;AAAA,aAAA;AAjBmB,gBAAa,CAAA,AAAb,aAAa,CAAC,KAAK,CAAC;AAAA;AACjC;AAAA,oCAAO,CAAA,AALLsB,SAAK,CAKP,CAAAjB,OAAO,EAAA;AAAP,qBAAO,AAAP,KAAO;AAAA,aAAA,AAAP;AAAA,qBAAO,AAAP,MAAO;AAAA,aAAA;AAAV,gBAAG,KAAO,GAAA;AAAI;AAAA,uBAAkB,AAA7B,uBAAO,CAAA,AALLiB,SAAK,CAKP,CAAAjB,OAAO,CAAsB;AAAA,eAgBnC;AAAA;AAAA,eAAA;AAhBiB,kBAAW,CAAA,AAAX,WAAW,CAAC,KAAK,CAAC;AAAA;AAC7B;AAAA,sCAAE,CAAA,AANAiB,SAAK,CAMP,CAAAd,EAAE,EAAA;AAAF,uBAAE,AAAF,KAAE;AAAA,eAAA,AAAF;AAAA,uBAAE,AAAF,MAAE;AAAA,eAAA;AAAL,kBAAG,KAAE,GAAA;AAAI;AAAA,yBAAa,AAAnB,uBAAE,CAAA,AANAc,SAAK,CAMP,CAAAd,EAAE,CAAiB;AAAA,iBAezB;AAAA;AAAA,iBAAA;AAfY,oBAAM,CAAA,AAAN,MAAM,CAAC,KAAK,CAAC;AAAA;AACnB;AAAA,wCAAM,CAAA,AAPJc,SAAK,CAOP,CAAAb,MAAM,EAAA;AAAN,yBAAM,AAAN,KAAM;AAAA,iBAAA,AAAN;AAAA,yBAAM,AAAN,MAAM;AAAA,iBAAA;AAAT,oBAAG,KAAM,GAAA;AAAI;AAAA,2BAAiB,AAA3B,uBAAM,CAAA,AAPJa,SAAK,CAOP,CAAAb,MAAM,CAAqB;AAAA,mBAcjC;AAAA;AAAA,mBAAA;AAdgB,sBAAU,CAAA,AAAV,UAAU,CAAC,KAAK,CAAC;AAAA;AAC3B;AAAA,0CAAQ,CAAA,AARNa,SAAK,CAQP,CAAAX,QAAQ,EAAA;AAAR,2BAAQ,AAAR,KAAQ;AAAA,mBAAA,AAAR;AAAA,2BAAQ,AAAR,MAAQ;AAAA,mBAAA;AAAX,sBAAG,KAAQ,GAAA;AAAI;AAAA,6BAAmB,AAA/B,uBAAQ,CAAA,AARNW,SAAK,CAQP,CAAAX,QAAQ,CAAuB;AAAA,qBAarC;AAAA;AAAA,qBAAA;AAbkB,wBAAY,CAAA,AAAZ,YAAY,CAAC,KAAK,CAAC;AAAA,wBAAA,AAAvB,KAGX,aAAK,CAAA,AAXAW,SAAK,CAWV,CAAAI,KAAK;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHL,OAAG,CAAK,IAAG,CAAC;AAAA,qBAUxB;AAAA;AAAA,qBAAA;AAVwB,wBAAA,AAHV,KAIX,aAAG,CAAA,AAZEC,SAAK,CAYV,CAAAK,GAAG;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHN,OAAG,CAAK,IAAG,CAAC;AAAA,qBAStB;AAAA;AAAA,qBAAA;AATsB,wBAAA,AAJR,KAKX,aAAG,CAAA,AAbEC,SAAK,CAaV,CAAAM,GAAG;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHP,OAAG,CAAK,SAAG,CAAC;AAAA,qBAQtB;AAAA;AAAA,qBAAA;AARsB,wBAAA,AALR,KAMX,aAAY,CAAA,AAdPC,SAAK,CAcV,CAAAO,YAAY;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHR,OAAG,CAAK,MAAK,CAAC;AAAA,qBAOjC;AAAA;AAAA,qBAAA;AAPiC,wBAAA,AANnB,KAQX,aAAK,CAAA,AAhBAC,SAAK,CAgBV,CAAAQ,KAAK;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHT,OAAG,CAAK,MAAK,CAAC;AAAA,qBAK1B;AAAA;AAAA,qBAAA;AAL0B,wBAAA,AARZ,KASX,aAAK,CAAA,AAjBAC,SAAK,CAiBV,CAAAS,KAAK;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHV,OAAG,CAAK,MAAK,CAAC;AAAA,qBAI1B;AAAA;AAAA,qBAAA;AAJ0B,wBAAA,AATZ,KAUX,aAAI,CAAA,AAlBCC,SAAK,CAkBV,CAAAU,IAAI;AAAI;AAAI,wCAAG,CAAA,AAAP,IAAG,CAAA,AAAHX,OAAG,CAAK,MAAK,CAAC;AAAA,qBAGzB;AAAA;AAAA,qBAAA;AAHyB;AAEvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAA;AArB0B,MAAAI,UAC3B,EAoBC,AApBD,OAoBC;AACF,YAAA,AAtB4B,CAAAA,UAAA;AAsB5B;AAAA;AAAA;AAED;AAQC,aAAA,AARD,CAAYQ,WAAgB,CAQ3B,AARmC;AAC9B,sBAAG,CAAA,AAAP,IAAG,CAAA,AAAHZ,OAAG,CAAK,IAAG,CAAC;AAII,aAAG,EAAA,AAAH,KAAG,CAAA,AAAHA,OAAG;AAAE,aAAY,EAAA,AAAZ,CAAAY,WAAO,CAAK,KAAA;AAAjC,QAAe,CAAA,AAAf,eAAe,CAAC,KAAG,CAAE,MAAY,CAAC;AACxB,aAAY,EAAA,AAAZ,CAAAA,WAAO,CAAK,KAAA;AAAtB,QAAS,CAAA,AAAT,SAAS,CAAC,KAAY,CAAC;AACnB,sBAAG,CAAA,AAAP,IAAG,CAAA,AAAHZ,OAAG,CAAK,IAAG,CAAC;AAAA;AAAC;AAIf;AAGC,iBAAA,AAHD,CAAgBA,OAAwB,CAAE,CAAA5B,QAAY,CAGrD,AAH6D;AAExD,sBAAG,CAAA,AAAP4B,OAAG,CAAK,YAAC,SAAE,CAAE,CAAA5B,QAAI,CAAC,SAAC,CAAC,CAAC;AAAA;AAAC;AAGxB;AAQC,UAAA,AARD,CAASyC,QAAS,CAAE,CAAAC,iBAAsB,CAQzC,AARiD;AAEhD,gCAAU,CAAA,AAAV,IAAU,CAAC,KAAG,CAAA,AAAHd,OAAG,CAAE,CAAAa,QAAI,CAAE,CAAAC,iBAAa,CAAC;AAAA;AAAC;AAWvC;AAQC,gBAAA,AARD,CAAepB,cAAsB,CAAE,CAAAoB,iBAAsB,CAQ5D,AARoE;AAMxD,aAAY,CAAA;AAFb,aAAgB,CAAA;AAFZ,aAA2B,EAAA,AAAV,qBAAU,CAAA,AAA3BpB,cAAU,CAAM,MAAW,CAAA;AAApC,OAAC,CAAAqB,SAAK,EAAG,MAA2B;AAKxC,kBAAA;AAND,UAEE,CAAC,CAAAA,SAAK,CAAQ,UAAA;AAGL,eAAY,AAAZ,CAAAA,SAAK,CAAC,IAAI,EAAE,CAAA;AAArB,YAAQ,CAAA,AAAR,QAAQ,CAAC,KAAY,CAAE,CAAAD,iBAAa,CAAC,CAAA;AAF7B,eAAgB,AAAhB,CAAAC,SAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAAxB,QAAAA,SAAK,AAAL,EAAwB,AAAhB,MAAgB;AAGzB;AAAA;AAAA;AAAA,KAAA;AAND;AAAA;AASF;AAIC,eAAA,AAJD,CAAcC,aAAoB,CAIjC,AAJyC;AACpC,sBAAG,CAAA,AAAP,IAAG,CAAA,AAAHhB,OAAG,CAAK,IAAG,CAAC;AACZ,QAAsB,CAAA,AAAtB,sBAAsB,CAACgB,aAAS,CAAC;AAC7B,sBAAG,CAAA,AAAP,IAAG,CAAA,AAAHhB,OAAG,CAAK,IAAG,CAAC;AAAA;AAAC;AAGf;AAIC,wBAAA,AAJD,CAAuBgB,aAAoB,CAI1C,AAJkD;AACxC,aAAa,EAAA,AAAb,CAAAA,aAAS,CAAI,IAAA;AAAtB,QAAQ,CAAA,AAAR,QAAQ,CAAC,KAAa,CAAE,KAAI,CAAC;AACzB,sBAAG,CAAA,AAAP,IAAG,CAAA,AAAHhB,OAAG,CAAK,IAAG,CAAC;AACH,aAAa,EAAA,AAAb,CAAAgB,aAAS,CAAI,IAAA;AAAtB,QAAQ,CAAA,AAAR,QAAQ,CAAC,KAAa,CAAE,KAAI,CAAC;AAAA;AAAC;AAGhC;AAeC,aAAA,AAfD,CAAYC,WAAgB,CAe3B,AAfmC;AAQV,aAAqB,CAAA;AALxC,aAAO;AAAI,aAWf,CAAA;AALqB,aAAiB,CAAA;AARvC,SAAI,CAAAC,YAAQ,EAAG,gCAAa,CAAA,AAAb,IAAa,CAAC,CAAAD,WAAO,CAAE,CAAAnB,YAAS,CAAC;AAE3C;AAAA,4BAAO,CAAA,AADLoB,YAAQ,CACV,CAAAlC,OAAO,EAAA;AAAP,aAAO,AAAP,KAAO;AAAA,KAAA,AAAP;AAAA,aAAO,AAAP,MAAO;AAAA;AAAA,gBAAA,AADZ;AAAA,UACK,KAAO,GAAA;AADZ,mBAYC,CAAA,AAZD;AACgB;AAAA,mBAWf,AAXI,uBAAO,CAAA,AADLkC,YAAQ,CACV,CAAAlC,OAAO,CAWX,CAAA;AAVO,8BAAG,CAAA,AAAP,IAAG,CAAA,AAAHgB,OAAG,CAAK,IAAG,CAAC;AAUf,WACF;AAAA;AAAA,WAAA;AAVS,mBAAQ,CAAQ;AAClB;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHA,OAAG,CAAK,IAAG,CAAC;AAAA,aASnB;AAAA;AAAA,aAAA;AATmB;AACb;AAAA;AACO,aAAC,CAAAmB,KAAC,EAAG,EAAC;AAEb,wBAAA;AAFmB,mBAAqB,AAArB,MAAQ,CAAM,MAAO,OAAA;AAAzC,gBAAgBA,KAAC,EAAG,MAAqB,GAAA;AACvB;AAAA,uBAAiB,AAAH,eAAA,AAAd,KAAQ,CAAM,MAAC,CAAAA,KAAC,CAAC;AAAA,eAMxC;AAAA;AAAA,eAAA;AANO,kBAAe,CAAA,AAAf,eAAe,CAAC,KAAiB,CAAC,CAAA;AADO,cAAAA,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,EAAI,EAAC;AAEhD;AAAA;AAAA;AAAA;AACD,eAAA;AAAI,8BAAG,CAAA,AAAP,IAAG,CAAA,AAAHnB,OAAG,CAAK,IAAG,CAAC,CAAA;AAThB,6BAYC;AAAA,WACF;AAAA,WAAA;AAJiB;AAIjB;AAAA,OAAA;AAFW,UAAS,CAAA,AAAT,SAAS,CAACkB,YAAQ,CAAC;AAAA,KAE9B;AAbC;AAYC;AAMH;AAMC,iBAAA,AAND,CAAgBE,YAAkB,CAMjC,AANyC,EAAA;AAAL,QAAAhB,UAAI;AAElC,aAAU;AAAI,aAGlB,CAAA;AAFI,aAAS;AAAI,aAAgC;AAC7C,aAAU;AAAI,aAAmB,CAAA;AAFjC;AAAA,4BAAU,CAAA,AADRgB,YAAQ,CACV,CAAA7C,UAAU,EAAA;AAAV,aAAU,AAAV,KAAU;AAAA,KAAA,AAAV;AAAA,aAAU,AAAV,MAAU;AAAA,KAAA;AADf,eAKD,CAAA,AALC;AAAA,UACK,KAAU,GAAA;AAAI;AAAA,iBAGlB,AAHI,uBAAU,CAAA,AADR6C,YAAQ,CACV,CAAA7C,UAAU,CAGd;AAAA,SACF;AAAA;AAAA,SAAA;AAJoB,YAAc,CAAA,AAAd,cAAc,CAAC,KAAQ,CAAE,KAAI,CAAC;AAGhD,cAAA;AAFI;AAAA,gCAAS,CAAA,AAFP6C,YAAQ,CAEV,CAAAzC,SAAS,EAAA;AAAT,iBAAS,AAAT,KAAS;AAAA,SAAA,AAAT;AAAA,iBAAS,AAAT,MAAS;AAAA,SAAA;AAAZ,YAAG,KAAS,GAAA;AAAI;AAAA,mBAAgC,AAA7C,uBAAS,CAAA,AAFPyC,YAAQ,CAEV,CAAAzC,SAAS,CAAoC;AAAA,WAGnD;AAAA;AAAA,WAAA;AAHmB,cAAsB,CAAA,AAAtB,sBAAsB,CAAC,KAAQ,CAAC;AAAA;AAC7C;AAAA,kCAAU,CAAA,AAHRyC,YAAQ,CAGV,CAAA1C,UAAU,EAAA;AAAV,mBAAU,AAAV,KAAU;AAAA,WAAA,AAAV;AAAA,mBAAU,AAAV,MAAU;AAAA,WAAA;AAAb,cAAG,KAAU,GAAA;AAAI;AAAA,qBAAmB,AAAjC,uBAAU,CAAA,AAHR0C,YAAQ,CAGV,CAAA1C,UAAU,CAAuB;AAAA,aAEvC;AAAA;AAAA,aAAA;AAFoB,gBAAS,CAAA,AAAT,SAAS,CAAC,KAAQ,CAAC;AAAA;AACrC;AAAA;AAAA;AAAA,OAAA;AALkC,MAAA0B,UACnC,EAIC,AAJD,OAIC;AACF,YAAA,AANoC,CAAAA,UAAA;AAMpC;AAAA;AAAA;AAED;AAYC,QAAA,AAZD,CAAOiB,MAAM,CAYZ,AAZoB;AAMG,aAAe,CAAA;AADzB,aAAW;AAGT,aAAW,CAAA;AAPJ,gBAAA,AAAjB,MAAC,GAAAA,MAAE,CAAM,MAAA,AAAR,MAAgB;AAAE,iBAWxB,CAAA,AAXwB;AACrB;AAAI,4BAAG,CAAA,AAAP,IAAG,CAAA,AAAHrB,OAAG,CAAK,MAAK,CAAC;AAGJ,iBAAW,AAAH,eAAA,AAARqB,MAAE,CAAM,MAAC,EAAC,CAAC;AAAA,SAOxB;AAAA;AAAA,SAAA;AAPG,YAAS,CAAA,AAAT,SAAS,CAAC,KAAW,CAAC;AACd,WAAC,CAAAF,KAAC,EAAG,EAAC;AAGb,sBAAA;AAHmB,iBAAe,AAAf,CAAAE,MAAE,CAAM,MAAO,OAAA;AAAnC,cAAgBF,KAAC,EAAG,MAAe,GAAA;AACjC;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHnB,OAAG,CAAK,IAAG,CAAC;AACF,qBAAW,AAAH,eAAA,AAARqB,MAAE,CAAM,MAAC,CAAAF,KAAC,CAAC;AAAA,aACtB;AAAA;AAAA,aAAA;AADC,gBAAS,CAAA,AAAT,SAAS,CAAC,KAAW,CAAC,CAAA;AAFa,YAAAA,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,EAAI,EAAC;AAG1C;AACD;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHnB,OAAG,CAAK,IAAG,CAAC;AAAA,aAEf;AAAA;AAAA,aAAA;AADE,8BAAA;AAFE;AAAA;AAAA;AAGJ;AAAA,KAAA;AAXC;AAUC;AAGH;AA4BC,YAAA,AA5BD,CAAWsB,UAAc,CA4BxB,AA5BgC,EAAA;AAAL,QAAAlB,UAAI;AAGpB,aAAW;AAME,aAAQ;AAER,aAAW;AAEX,aAAW;AAOpB,aAAsB,CAAA;AAA9B,aAAG,CAAA;AAlBT,eA0BD,CAAA,AA1BC;AAIA,SAAI,CAAAxB,OAAgB;AACpB,SAAI,CAAAC,OAAgB,CAAA;AALpB;AAAI,0BAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,MAAK,CAAC;AACJ,eAAW,AAAX,CAAAsB,UAAM,CAAK,KAAA;AAArB,YAAS,CAAA,AAAT,SAAS,CAAC,KAAW,CAAC;AAClB,0BAAG,CAAA,AAAP,IAAG,CAAA,AAAHtB,OAAG,CAAK,IAAG,CAAC;AAEF,QAAApB,OAAA,EAAU,AAAV,CAAA0C,UAAM,CAAI;AACV,QAAAzC,OAAA,EAAU,AAAV,CAAAyC,UAAM,CAAI;AAAA,OAqBrB;AAAA;AAAA,OAAA;AApBU,UACE1C,OAAG,IAAI,EAAC;AAAI,eAAQ,AAAR,CAAAC,OAAG,IAAI,EAAC;AAAA;AAAA;AAAA,OAAA;AAD/B,UACW;AACT;AAAI,4BAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,IAAG,CAAC;AAAA,SAkBf;AAAA;AAAA,SAAA;AAlBe,cAAA;AADH,YAEApB,OAAG,IAAI,EAAC;AAAI,iBAAW,AAAX,CAAAC,OAAG,IAAI,KAAI;AAAA;AAAA;AAAA,SAAA;AAHlC,YAGW;AACT;AAAI,8BAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,IAAG,CAAC;AAAA,WAgBf;AAAA;AAAA,WAAA;AAhBe,gBAAA;AADH,cAEApB,OAAG,IAAI,EAAC;AAAI,mBAAW,AAAX,CAAAC,OAAG,IAAI,KAAI;AAAA;AAAA;AAAA,WAAA;AAAvB;AACT;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,IAAG,CAAC;AAAA,aAcf;AAAA;AAAA,aAAA;AAde;AAEZ;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHA,OAAG,CAAK,YAAC,GAAC,CAAM,gBAAQ,CAAA,AAAZpB,OAAG,CAAW,CAAE,CAAC;AAAA,aAYhC;AAAA;AAAA,aAAA;AAZgC,gBACzBA,OAAG,IAAI,CAAAC,OAAG;AACZ;AAAI,kCAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,IAAG,CAAC;AAAA,eAUjB;AAAA;AAAA,eAAA;AAViB,kBACRnB,OAAG,IAAI,KAAI;AACb,uBAAG,AAAH,KAAG,CAAA,AAAHmB,OAAG;AAAK,qBAAA;AAAA,yBAAsB,AAAf,0BAAG,CAAA,AAAVnB,OAAG,CAAmB,CAAA;AAA1B,oCAAG,CAAA,AAAP,KAAG,CAAmB,gBAAQ,CAAA,AAAtB,KAAsB,CAAE,CAAC;AAAA,iBAQxC;AAAA;AAAA,iBAAA;AAPM;AAAA;AAAA;AACF;AAAA;AAAA;AACD;AAAI,gCAAG,CAAA,AAAP,IAAG,CAAA,AAAHmB,OAAG,CAAK,IAAG,CAAC;AAAA,aAKf;AAAA;AAAA,aAAA;AAJE;AAAA;AAAA;AACG,UAAAsB,UAAM,CAAU;AAClB;AAAI,4BAAG,CAAA,AAAP,IAAG,CAAA,AAAHtB,OAAG,CAAK,IAAG,CAAC;AAAA,SAEf;AAAA;AAAA,SAAA;AAFe;AACb;AAAA,OAAA;AA3ByB,MAAAI,UAyB1B,EAEC,AAFD,OAEC;AACF,YAAA,AA5B2B,CAAAA,UAAA;AA4B3B;AAAA;AAAA;AAED;AAKC,cAAA,AALD,CAAamB,YAAkB,CAK9B,AALsC,EAAA;AAAL,QAAAnB,UAAI;AAEhB,aAAqB;AAC7B,aAAiB,CAAA;AADrB,OAAC,CAAAe,KAAC,EAAG,EAAC;AAEb,eACF,CAAA,AADE;AAAA,oBAAA;AAFmB,eAAqB,AAArB,CAAAI,YAAQ,CAAM,MAAO,OAAA;AAAzC,YAAgBJ,KAAC,EAAG,MAAqB,GAAA;AAC7B;AAAA,mBAAiB,AAAH,eAAA,AAAdI,YAAQ,CAAM,MAAC,CAAAJ,KAAC,CAAC;AAAA,WAE9B;AAAA;AAAA,WAAA;AAFG,cAAS,CAAA,AAAT,SAAS,CAAC,KAAiB,CAAC,CAAA;AADa,UAAAA,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,EAAI,EAAC;AAEhD,gBAAA;AAJ+B,UAAAf,UAEhC;AAEC;AAAA;AAAA;AACF;AAAA;AAAA,UAAA,AALiC,CAAAA,UAAA;AAKjC;AAIM;AA+BN,SAAA,AA/BM,CAAQgB,YAAkB,CA+BhC,AA/B8C,EAAA;AAAX,QAAAhB,UAAU;AAWxB,aAAgB;AAEpB,aAAgB;AAWd,aAAY;AACnB,aAAqB;AACrB,aAAqB;AACtB,aAAqB,CAAA;AAzB1B,aAAU;AAAI,aA4BlB,CAAA;AANI,aAAS;AAAI,aAAY,CAAA;AAtBzB;AAAA,4BAAU,CAAA,AADRgB,YAAQ,CACV,CAAA7C,UAAU,EAAA;AAAV,aAAU,AAAV,KAAU;AAAA,KAAA,AAAV;AAAA,aAAU,AAAV,MAAU;AAAA,KAAA;AADf,eA8BD,CAAA,AA9BC;AAAA,UACK,KAAU,GAAA;AAAI;AAAA,iBA4BlB,AA5BI,uBAAU,CAAA,AADR6C,YAAQ,CACV,CAAA7C,UAAU,CA4Bd;AAAA,SACF;AAAA;AAAA,SAAA;AA3BK,aAAI,CAAAC,SAAK,EAAG,MAAQ,CAAM;AAC1B,YAAI,EAAAA,SAAa;AACf,UAAA4B,UAAA,EAAI,AAAJ,KAAI;AAAA,gBAAA;AAGD,aAAC,CAAAvB,OAAG,EAAG,EAAC;AAEG,iBAAgB,AAAV,qBAAU,CAAA,AAAhBL,SAAK,CAAW,CAAA;AAAzB,aAAC,CAAAuC,SAAK,EAAG,MAAgB;AAQ7B,wBAAA;AATD,gBAEE,CAAC,CAAAA,SAAK,CAAQ,UAAA;AAGd,mBAAI,CAAAS,QAAI,EAAS,AAAN,CAAAT,SAAK,CAAC,IAAI,EAAE;AAAA,kBACnBS,QAAI,EAAG,CAAA3C,OAAG;AACZ,gBAAAA,OAAG,AAAH,EAAU,AAAJ,CAAA2C,QAAI;AAAA;AACX;AAAA,eAAA;AALO,qBAAgB,AAAhB,CAAAT,SAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAAxB,cAAAA,SAAK,AAAL,EAAwB,AAAhB,MAAgB;AAMzB;AAAA;AAAA;AAAA,WAAA;AAZI,UAAAX,UAAA,EAcN,AAdM,CAAAvB,OAcN;AAAA;AASJ,cAAA;AANI;AAAA,gCAAS,CAAA,AAvBPuC,YAAQ,CAuBV,CAAAzC,SAAS,EAAA;AAAT,iBAAS,AAAT,KAAS;AAAA,SAAA,AAAT;AAAA,iBAAS,AAAT,MAAS;AAAA,SAAA;AAAZ,YAAG,KAAS;AAAI;AAAA,mBAAY,AAAzB,uBAAS,CAAA,AAvBPyC,YAAQ,CAuBV,CAAAzC,SAAS,CAAgB,CAAA;AAAZ,mBAAY,AAAZ,MAAQ,CAAI,IAAA;AAAZ,YAAAyB,UAAA,EAAY,AAAZ,MAAY;AAAA,WAO/B;AAAA;AAAA,WAAA;AAP+B,cAAA,AAAhB,KACZ,aAAK,CAAA,AAxBAgB,YAAQ,CAwBb,CAAAX,KAAK;AAAI,iBAAqB,AAAjB,qBAAU,CAAA,AAAd,GAAG,CAAW,CAAC,IAAI,EAAE,CAAA;AAArB;AAAA,YAAAL,UAAA,EAAqB,AAArB,MAAqB;AAAA,WAMjC;AAAA;AAAA,WAAA;AANiC,cAAA,AADlB,KAEZ,aAAK,CAAA,AAzBAgB,YAAQ,CAyBb,CAAAV,KAAK;AAAI,iBAAqB,AAAjB,qBAAU,CAAA,AAAd,GAAG,CAAW,CAAC,IAAI,EAAE,CAAA;AAArB;AAAA,YAAAN,UAAA,EAAqB,AAArB,MAAqB;AAAA,WAKjC;AAAA;AAAA,WAAA;AALiC,cAAA,AAFlB,KAGZ,aAAI,CAAA,AA1BCgB,YAAQ,CA0Bb,CAAAT,IAAI;AAAI,iBAAqB,AAAjB,qBAAU,CAAA,AAAd,GAAG,CAAW,CAAC,IAAI,EAAE,CAAA;AAArB;AAAA,YAAAP,UAAA,EAAqB,AAArB,MAAqB;AAAA,WAIhC;AAAA;AAAA,WAAA;AAJgC;AAErB,UAAAA,UAAA,EAAI,AAAJ,KAAI;AAAA;AAAA;AAEf,YAAA,AA/BmC,CAAAA,UAAA;AA+BnC;AAAA;AAAA,GAAA;AAnMkB;AAAA,cACfJ,OAAoD,CAAA,AADrC;AACY,aAAyB,CAAA;AADrC,QACY,EAAA,AAA3BA,OAA2B,IAAyB,AAAzB,KAAyB,AAAzB,EAAyB,IAAA;AAAzB,aAAyB,AAAzB,GAAyB,CAAA;AAApD,MAAAA,OAA2B,EAAyB,AAAzB,MAAyB;AAAA,KAAA;AAApD,SAAAA,OAAG,EAAA,AAAH,CAAAA,OAAG,CAAA;AAAP;AAAwD,GAAA;AADrC,CAmMlB;AAhSC,2BAAS;AAAb,KAAI,CAAAF,YAAS,EAAG,IAAI,CAAAL,YAAS,EAAE,CAAA;AAjKQ,MAAAY,SAAA;AAAsB;AAAA;AAAA;AAAA,CAAA;AAAtB5B,OAAsB,eAAA,AAAtB4B,SAAA,CAAsB,CAAA;AAA3C;AAAO,MAAA,AAAlB,MAAI,CAAAA,KAAK,EAAiD,IAAI,CAAAA,SAAK,EAAI;AACzC,MAAAC,OAAA;AAAoB;AAAA;AAAA;AAAA,CAAA;AAApB7B,OAAoB,eAAA,AAApB6B,OAAA,CAAoB,CAAA;AAAzC;AAAO,MAAA,AAAhB,MAAI,CAAAA,GAAG,EAA+C,IAAI,CAAAA,OAAG,EAAI;AACnC,MAAAC,OAAA;AAAoB;AAAA;AAAA;AAAA,CAAA;AAApB9B,OAAoB,eAAA,AAApB8B,OAAA,CAAoB,CAAA;AAAzC;AAAO,MAAA,AAAhB,MAAI,CAAAA,GAAG,EAA+C,IAAI,CAAAA,OAAG,EAAI;AAMhE,MAAAC,gBAAA;AAA6B;AAAA;AAAA;AAAA,CAAA;AAA7B/B,OAA6B,eAAA,AAA7B+B,gBAAA,CAA6B,CAAA;AADZ;AAAO,MAAA,AAAzB,MAAI,CAAAA,YAAY,EACkB,IAAI,CAAAA,gBAAY,EACxD;AAIO,MAAAC,SAAA;AAAyB;AAAA;AAAA;AAAA,CAAA;AAAzB/B,UAAyB,eAAA,AAAzB+B,SAAA,CAAyB,CAAA;AADf;AAAU,MAAA,AAArB,MAAI,CAAAA,KAAK,EACqB,IAAI,CAAAA,SAAK,EAC7C;AAEO,MAAAC,SAAA;AAAyB;AAAA;AAAA;AAAA,CAAA;AAAzBhC,UAAyB,eAAA,AAAzBgC,SAAA,CAAyB,CAAA;AADf;AAAU,MAAA,AAArB,MAAI,CAAAA,KAAK,EACqB,IAAI,CAAAA,SAAK,EAC7C;AAEO,MAAAC,QAAA;AAAwB;AAAA;AAAA;AAAA,CAAA;AAAxBjC,UAAwB,eAAA,AAAxBiC,QAAA,CAAwB,CAAA;AADf;AAAU,MAAA,AAApB,MAAI,CAAAA,IAAI,EACqB,IAAI,CAAAA,QAAI,EAC3C;AAoFM;AAEN,MAAA,AAFM,SAAI,CAAAc,MAAM,AAAV,CAAWpD,QAAe,CAEhC,AAF6C;AAC5C,YAAI,CAAAiB,QAAQ,CAAC,UAAC,CAAAe,KAAK,CAAE,CAAAhC,QAAI,CAAE,CAAAkC,GAAG,CAAC,CAAC;AAAA,CACjC;AAEM;AAEN,MAAA,AAFM,SAAI,CAAAmB,SAAS,AAAb,CAAcrD,QAAe,CAAE,CAAAgB,aAA0B,CAE/D,AAFyE,EAAA;AAAf,QAAA,AAArBA,aAAqB,IAAK,AAAL,KAAK,AAAL,EAAK,IAAA;AAA1B,IAAAA,aAAqB,EAAK,AAAL,MAAK;AAAA;AAC9D,YAAE,CAAAD,MAAA,CAAAf,QAAI,CAAO,EAAC,CAAO,KAAI,CAAE,CAAAgB,aAAS,CAAE;AAAA,CACvC;AAEM;AAEN,MAAA,AAFM,SAAI,CAAAsC,QAAQ,AAAZ,CAAatD,QAAe,CAAE,CAAAgB,aAA0B,CAE9D,AAFwE,EAAA;AAAf,QAAA,AAArBA,aAAqB,IAAK,AAAL,KAAK,AAAL,EAAK,IAAA;AAA1B,IAAAA,aAAqB,EAAK,AAAL,MAAK;AAAA;AAC7D,YAAE,CAAAD,MAAA,CAAAf,QAAI,CAAO,EAAC,CAAO,EAAC,CAAE,CAAAgB,aAAS,CAAE;AAAA,CACpC" }
+{ "version": 3, "file": "js/std/regex.js", "sources": [ "std/regex/regex.temper.md" ], "sourcesContent": [ "# Regex Data Model and Functionality\n\nThe structural data model for regex patterns enables direct construction, and\nthe Temper regex dialect compiles static regex text patterns to these objects.\n\nA focus here is on providing tools people can actually reach for when they need\nto do text processing. The execution should be faster on backends like Python\nthan writing raw code, and the implementation in backends like C should\napproximate what you'd like to have written manually.\n\nDue to inadequate and distinct Unicode handling in backend regex engines, the\ninitial feature set avoids character classes and properties but is still aware\nof code points. Parsing focused on limited sets of delimiters works best for\nnow.\n\nThe core feature set here focuses on both the data model and utility functions,\nsuch as matching regexes against strings.\n\n## Regex Data Model\n\nTemper regex representation is composed hierarchically of `RegexNode` objects.\nAnd perhaps the most fundamental `RegexNode` is the [Sequence](#sequence),\nbecause it enables multiple regex components to be strung together. For example,\n`/hi./` is a sequence of [CodePoints](#codepoints) `/hi/` and dot `/./`, but all\ncomponent types extend the `RegexNode` interface.\n\n```\nexport interface RegexNode {\n```\n\nBefore a regex is used, it must be compiled. This transforms a `RegexNode` tree\ninto a backend-native [Regex](#regex). Some helper functions compile on the fly,\nalthough it is faster to reuse a pre-compiled regex.\n\n```\n  // TODO(tjp, regex): Make this into a macro behind the scenes.\n  // TODO(tjp, regex): `compiled\u003cT\u003e(): Regex\u003cT\u003e`\n  public compiled(): Regex { new Regex(this) }\n```\n\nThe simplest use of a regular expression is if it is found in a string.\nAgain, it is better to compile to a `Regex` in advance than to repeatedly call\nconvenience methods on a `RegexNode`.\n\nTODO Remove convenience methods on RegexNode since we emphasize CompiledRegex\nnow?\n\n```\n  public found(text: String): Boolean { compiled().found(text) }\n```\n\nYou can also return match details. The returned groups map contains an entry for\neach key in the order defined in the regex pattern. If no \u0022full\u0022 group is\ndefined, one is added automatically to capture the full matched text.\n\nIn the future, we intend to support customized match types with fields to match\ncapture groups, statically checked where possible.\n\n```\n  // TODO(tjp, regex): Also macro because reification.\n\n  public find(text: String): Match | Bubble {\n    compiled().find(text)\n  }\n```\n\nReplace and split functions are also available. Both apply to all matches in\nthe string, replacing all or splitting at all.\n\n```\n  public replace(text: String, format: fn (Match): String): String {\n    compiled().replace(text, format)\n  }\n\n  public split(text: String): List\u003cString\u003e {\n    compiled().split(text)\n  }\n```\n\nThat's it for what you can do with regex patterns in Temper today, but there's\nmuch more to say on what kinds of regexes can be built.\n\n```\n}\n```\n\n## Regex Item Types\n\nA `Regex` is composed of a potential variety of subtypes.\n\n### Groups\n\nMultiple types of groups exist:\n\n- [Capture](#capture) `/(?\u003cname\u003e...)/` to remember match groups for later use.\n- Non-capturing group syntax `/(?:...)/`, which is simply a [Regex](#regex)\n  instance in the data model.\n\n### Capture\n\n`Capture` is a [group](#groups) that remembers the matched text for later\naccess. Temper supports only named matches, with current intended syntax\n`/(?name = ...)/`.\n\n```\nexport class Capture(\n  public let name: String,\n  public /*early*/ let item: RegexNode,\n) extends RegexNode {}\n```\n\n### CodePart\n\nA component of a [CodeSet][#codeset], aka character class, which applies to a\nsubset of regex data types.\n\nHere, \u0022code\u0022 is short for \u0022code point\u0022 although \u0022char\u0022 might work better,\ndepending on expectations.\n\n```\nexport interface CodePart extends RegexNode {}\n```\n\n### CodePoints\n\nOne or more verbatim code points, where the sequence matters if within a\n[Regex](#regex) or not if within a [CodeSet](#codeset). Some escapes in\ntextual regex source, such as `/\\t/`, can be stored as raw code points.\n\nThe `String` here can enable more efficient storage than individual code\npoints, although the source text may require non-capture grouping. For example,\n`/(?:abc)?/` optionally matches the string `\u0022abc\u0022`, whereas `/abc?/` matches\n`\u0022ab\u0022` with an optional `\u0022c\u0022`.\n\n```\nexport class CodePoints(\n  public let value: String,\n) extends CodePart {}\n```\n\n### Specials\n\nA number of special match forms exist. In the data model, these are empty\nclasses.\n\n- `.` - `Dot` In default mode, matches any Unicode code point except newline.\n- `^` - `Begin` in default mode matches zero-length at the beginning of a\n  string.\n- `\u0024` - `End` in default mode matches zero-length at the end of a string.\n- `\\b` - `WordBoundary` matches zero-length at the boundary between word and\n  non-word code points. More sophisticated Unicode compliance is TBD.\n- `\\s` (negated as `\\S`) - `Space` matches any horizontal space code point.\n  Details are TBD.\n- `\\w` (negated as `\\W`) - `Word` matches any word code point. Details are TBD.\n  This is currently defined in terms of old ASCII definitions because those are\n  clear. Perhaps this will stay that way, and Unicode properties like `\\p{L}`\n  will be used for human language needs.\n- `\\X` - `GraphemeCluster` might not be supported, but [here is some discussion\n  of how to implement it](\n  https://github.com/rust-lang/regex/issues/54#issuecomment-661905060).\n\n\u003cdetails\u003e\n\n```\nexport interface Special extends RegexNode {}\nexport let Begin: Special = do { class Begin extends Special {}; new Begin() };\nexport let Dot: Special = do { class Dot extends Special {}; new Dot() };\nexport let End: Special = do { class End extends Special {}; new End() };\n// TODO(tjp, regex): We can't easily support this at present across backends.\n// export let GraphemeCluster = do {\n//   class GraphemeCluster extends Special {}; new GraphemeCluster()\n// };\nexport let WordBoundary: Special = do {\n  class WordBoundary extends Special {}; new WordBoundary()\n};\n\nexport interface SpecialSet extends CodePart \u0026 Special {}\nexport let Digit: SpecialSet = do {\n  class Digit extends SpecialSet {}; new Digit()\n};\nexport let Space: SpecialSet = do {\n  class Space extends SpecialSet {}; new Space()\n};\nexport let Word: SpecialSet = do {\n  class Word extends SpecialSet {}; new Word()\n};\n```\n\n\u003c/details\u003e\n\n### CodeRange\n\nA code point range matches any code point in its inclusive bounds, such as\n`/[a-c]/`. In source, `-` is included in a code set either by escaping or by\nincluding it as the first or last character. A `CodeRange` is usually contained\ninside a [CodeSet](#codeset), and syntactically always is.\n\n```\nexport class CodeRange(\n  public let min: Int,\n  public let max: Int,\n) extends CodePart {}\n```\n\n### CodeSet\n\nA set of code points, any of which can match, such as `/[abc]/` matching any of\n`\u0022a\u0022`, `\u0022b\u0022`, or `\u0022c\u0022`. Alternatively, a negated set is the inverse of the code\npoints given, such as `/[^abc]/`, matching any code point that's not any of\nthese. This is also often called a character class.\n\nFurther, a subset of [specials](#specials) can also be used in code sets. A\nnegated code set of just a special set often has custom syntax. For example,\nnon-space can be said as either `/[^\\s]/` or `/\\S/`.\n\n```\nexport class CodeSet(\n  public let items: List\u003cCodePart\u003e,\n  public let negated: Boolean = false,\n) extends RegexNode {}\n```\n\n### Or\n\n`Or` matches any one of multiple options, such as `/ab|cd|e*/`.\n\n```\nexport class Or(\n  public /*early*/ let items: List\u003cRegexNode\u003e,\n) extends RegexNode {}\n```\n\n### Repeat\n\n`Repeat` matches from an minimum to a maximum number of repeats of a\nsubregex. This can be represented in regex source in a number of ways:\n\n- `?` matches 0 or 1.\n- `*` matches 0 or more.\n- `+` matches 1 or more.\n- `{m}` matches exactly `m` repetitions.\n- `{m,n}` matches between `m` and `n`. Missing `n` is a max of infinity. For\n  example, `{0,1}` is equivalent to `?`, and `{1,}` is equivalent to `+`.\n\nBy default, repetitions are greedy, matching as many repetitions as possible.\nIn regex source, any of the above can have `?` appended to indicated reluctant\n(aka non-greedy), matching as few repetitions as possible.\n\n```\nexport class Repeat(\n  public /*early*/ let item: RegexNode,\n  public let min: Int,\n  public let max: Int?, // where null means infinite\n  public let reluctant: Boolean = false,\n) extends RegexNode {}\n```\n\nWe also have convenience builders.\n\n```\nexport let entire(item: RegexNode): RegexNode {\n  new Sequence([Begin, item, End])\n}\n\nexport let oneOrMore(item: RegexNode, reluctant: Boolean = false): Repeat {\n  { item, min: 1, max: null, reluctant }\n}\n\nexport let optional(item: RegexNode, reluctant: Boolean = false): Repeat {\n  { item, min: 0, max: 1, reluctant }\n}\n```\n\n### Sequence\n\n`Sequence` strings along multiple other regexes in order.\n\n```\nexport class Sequence(\n  public /*early*/ let items: List\u003cRegexNode\u003e,\n) extends RegexNode {}\n```\n\n## Match Objects\n\nFor detailed match results, call `find` on a regex to get a `Match` object\nincluding a map from `String` keys to `Group` values. The iteration order of the\ngroup map is undefined.\n\nWe might support custom match types in the future with static properties instead\nof string-keyed groups. For example: `regex.find\u003cMyCapture\u003e(\u0022....\u0022)`\n\nTODO And sooner than that, we plan connected types for abstract mapping to\nbackend match objects that might not be maps.\n\n```\nexport class Match(\n  public let full: Group,\n  public let groups: Map\u003cString, Group\u003e,\n) {} // interface ... \u003cT = Map\u003cString, Group\u003e\u003e {\n\nexport class Group(\n  public let name: String,\n  public let value: String,\n  public let begin: StringIndex,\n  public let end: StringIndex,\n) {}\n```\n\n## Compiled Regex Objects\n\nThe compiled form of a regex is mostly opaque, but it can be cached for more\nefficient reuse than working from a source [RegexNode](#regex-data-model).\n\n\u003cdetails\u003e\n\n```\n// Provides a workaround for access to std/regex from extension methods that\n// sometimes get defined in temper-core for some backends. Also useful for\n// reference values for the interpreter.\n// TODO Avoid defining regex support in temper-core.\nclass RegexRefs(\n  public let codePoints: CodePoints = new CodePoints(\u0022\u0022),\n  public let group: Group = {\n    name: \u0022\u0022, value: \u0022\u0022, begin: String.begin, end: String.begin\n  },\n  public let match: Match = {\n    full: group,\n    groups: new Map\u003cString, Group\u003e([new Pair(\u0022\u0022, group)]),\n  },\n  public let orObject: Or = new Or([]),\n) {}\n\nlet regexRefs = new RegexRefs();\n```\n\n\u003c/details\u003e\n\nTODO Make Regex a connected type for lighter weight usage?\n\n```\nexport class Regex {\n```\n\nThe source `Regex` data is still available on compiled objects in case it's\nneeded for composition or other purposes.\n\n```\n  public let data: RegexNode;\n\n  public constructor(data: RegexNode) {\n    this.data = data;\n    // TODO Pull formatting out of here into a separate library or module???\n    let formatted = RegexFormatter.regexFormat(data);\n    compiled = RegexFormatter.regexCompileFormatted(data, formatted);\n  }\n```\n\nA compiled regex exposes many of the same capabilities as `RegexNode`, but they\nare more efficient to use repeatedly.\n\n```\n  public found(text: String): Boolean {\n    compiledFound(compiled, text)\n  }\n\n  public find(text: String, begin: StringIndex = String.begin): Match | Bubble {\n    compiledFind(compiled, text, begin, regexRefs)\n  }\n\n  public replace(text: String, format: fn (Match): String): String {\n    compiledReplace(compiled, text, format, regexRefs)\n  }\n\n  public split(text: String): List\u003cString\u003e {\n    compiledSplit(compiled, text, regexRefs)\n  }\n```\n\nTODO(tjp, regex): Any static checking for stable frontend regex values?\n\n\u003cdetails\u003e\n\n```\n  private let compiled: AnyValue;\n\n  // Extension functions on some backends need the private `compiled` value\n  // passed in directly.\n  @connected(\u0022Regex::compiledFound\u0022)\n  private compiledFound(compiled: AnyValue, text: String): Boolean;\n\n  @connected(\u0022Regex::compiledFind\u0022)\n  private compiledFind(\n    compiled: AnyValue, text: String, begin: StringIndex, regexRefs: RegexRefs\n  ): Match | Bubble;\n\n  @connected(\u0022Regex::compiledReplace\u0022)\n  private compiledReplace(\n    compiled: AnyValue,\n    text: String,\n    format: fn (Match): String,\n    regexRefs: RegexRefs,\n  ): String;\n\n  @connected(\u0022Regex::compiledSplit\u0022)\n  private compiledSplit(\n    compiled: AnyValue,\n    text: String,\n    regexRefs: RegexRefs,\n  ): List\u003cString\u003e;\n```\n\n\u003c/details\u003e\n\n```\n}\n```\n\n## Private implementation matters?\n\nSome regex logic can be shared across backends. These features aren't directly\nexported to the user, however.\n\nTODO But we do want this exported for pre-compiling where possible in backends.\n\nThe intent is that these support features only get included in compiled Temper\ncode if usage depends on dynamically constructed regexes. If all regex building\nis done as stable values, we hope to generated backend compiled regexes purely\nat Temper compile time.\n\n### RegexFormatter\n\n\u003cdetails\u003e\n\n```\nclass RegexFormatter {\n  private let out: StringBuilder = new StringBuilder();\n\n  @connected(\u0022Regex::compileFormatted\u0022)\n  public static regexCompileFormatted(\n    data: RegexNode, formatted: String\n  ): AnyValue;\n\n  @connected(\u0022Regex::format\u0022)\n  public static regexFormat(data: RegexNode): String {\n    new RegexFormatter().format(data)\n  }\n\n  public format(regex: RegexNode): String {\n    pushRegex(regex)\n    out.toString()\n  }\n\n  private pushRegex(regex: RegexNode): Void {\n    when (regex) {\n      // Aggregate types.\n      is Capture -\u003e pushCapture(regex);\n      is CodePoints -\u003e pushCodePoints(regex, false);\n      is CodeRange -\u003e pushCodeRange(regex);\n      is CodeSet -\u003e pushCodeSet(regex);\n      is Or -\u003e pushOr(regex);\n      is Repeat -\u003e pushRepeat(regex);\n      is Sequence -\u003e pushSequence(regex);\n      // Specials.\n      // Some of these will need to be customized on future backends.\n      Begin -\u003e out.append(\u0022^\u0022);\n      Dot -\u003e out.append(\u0022.\u0022);\n      End -\u003e out.append(\u0022\u0024\u0022);\n      WordBoundary -\u003e out.append(\u0022\\\\b\u0022);\n      // Special sets.\n      Digit -\u003e out.append(\u0022\\\\d\u0022);\n      Space -\u003e out.append(\u0022\\\\s\u0022);\n      Word -\u003e out.append(\u0022\\\\w\u0022);\n      // ...\n    }\n  }\n\n  private pushCapture(capture: Capture): Void {\n    out.append(\u0022(\u0022);\n    // TODO(tjp, regex): Consistent name validation rules for all backends???\n    // TODO(tjp, regex): Validate here or in `Capture` constructor???\n    // TODO(tjp, regex): Validate here or where against reused names???\n    pushCaptureName(out, capture.name);\n    pushRegex(capture.item);\n    out.append(\u0022)\u0022);\n  }\n\n  @connected(\u0022RegexFormatter::pushCaptureName\u0022)\n  private pushCaptureName(out: StringBuilder, name: String): Void {\n    // All so far except Python use this form.\n    out.append(\u0022?\u003c\u0024{name}\u003e\u0022);\n  }\n\n  private pushCode(code: Int, insideCodeSet: Boolean): Void { do {\n    // Goal here is to be pretty where commonly accepted by regex dialects.\n    // Start with pretty escapes to avoid needing numeric escapes.\n    let specialEscape = when (code) {\n      Codes.carriageReturn -\u003e \u0022r\u0022;\n      Codes.newline -\u003e \u0022n\u0022;\n      Codes.tab -\u003e \u0022t\u0022;\n      else -\u003e \u0022\u0022;\n    };\n    if (specialEscape != \u0022\u0022) {\n      out.append(\u0022\\\\\u0022);\n      out.append(specialEscape);\n      return;\n    }\n    // Look up in table for ascii range.\n    if (code \u003c= 0x7F) {\n      let escapeNeed = escapeNeeds[code];\n      if (\n        escapeNeed == needsSimpleEscape ||\n        (insideCodeSet \u0026\u0026 code == Codes.dash)\n      ) {\n        out.append(\u0022\\\\\u0022);\n        out.append(String.fromCodePoint(code));\n        return;\n      } else if (escapeNeed == needsNoEscape) {\n        out.append(String.fromCodePoint(code));\n        return;\n      }\n    }\n    // Not handled, so check additional ranges for plain vs numeric escape.\n    if (\n      code \u003e= Codes.supplementalMin || (\n        code \u003e Codes.highControlMax \u0026\u0026\n        !(\n          (Codes.surrogateMin \u003c= code \u0026\u0026 code \u003c= Codes.surrogateMax) ||\n          code == Codes.uint16Max\n        )\n      )\n    ) {\n      out.append(String.fromCodePoint(code));\n    } else {\n      // No pretty options above, so go numeric. Each backend often varies here.\n      pushCodeTo(out, code, insideCodeSet);\n    }\n  } orelse panic() } // fromCodePoint bubbles\n\n  @connected(\u0022RegexFormatter::pushCodeTo\u0022)\n  private pushCodeTo(out: StringBuilder, code: Int, insideCodeSet: Boolean): Void;\n\n  private pushCodePoints(codePoints: CodePoints, insideCodeSet: Boolean): Void {\n    let value = codePoints.value;\n    for (\n      var index = String.begin;\n      value.hasIndex(index);\n      index = value.next(index)\n    ) {\n      pushCode(value[index], insideCodeSet);\n    }\n  }\n\n  private pushCodeRange(codeRange: CodeRange): Void {\n    out.append(\u0022[\u0022);\n    pushCodeRangeUnwrapped(codeRange);\n    out.append(\u0022]\u0022);\n  }\n\n  private pushCodeRangeUnwrapped(codeRange: CodeRange): Void {\n    pushCode(codeRange.min, true);\n    out.append(\u0022-\u0022);\n    pushCode(codeRange.max, true);\n  }\n\n  private pushCodeSet(codeSet: CodeSet): Void {\n    let adjusted = adjustCodeSet(codeSet, regexRefs);\n    when (adjusted) {\n      is CodeSet -\u003e do {\n        out.append(\u0022[\u0022);\n        if (adjusted.negated) {\n          out.append(\u0022^\u0022);\n        }\n        for (var i = 0; i \u003c adjusted.items.length; i += 1) {\n          pushCodeSetItem(adjusted.items[i]);\n        }\n        out.append(\u0022]\u0022);\n      }\n      else -\u003e pushRegex(adjusted);\n    }\n  }\n\n  @connected(\u0022RegexFormatter::adjustCodeSet\u0022)\n  private adjustCodeSet(codeSet: CodeSet, regexRefs: RegexRefs): RegexNode { codeSet }\n\n  private pushCodeSetItem(codePart: CodePart): Void {\n    when (codePart) {\n      is CodePoints -\u003e pushCodePoints(codePart, true);\n      is CodeRange -\u003e pushCodeRangeUnwrapped(codePart);\n      is SpecialSet -\u003e pushRegex(codePart);\n    }\n  }\n\n  private pushOr(or: Or): Void {\n    if (!or.items.isEmpty) {\n      out.append(\u0022(?:\u0022);\n      // TODO(tjp, regex): See #822. Until `this` works better, no this in funs.\n      // TODO(tjp, regex): So just manually loop here. Sometimes faster, anyway?\n      pushRegex(or.items[0]);\n      for (var i = 1; i \u003c or.items.length; i += 1) {\n        out.append(\u0022|\u0022);\n        pushRegex(or.items[i]);\n      }\n      out.append(\u0022)\u0022);\n    }\n  }\n\n  private pushRepeat(repeat: Repeat): Void {\n    // Always wrap the main sub-pattern here to make life easy\n    out.append(\u0022(?:\u0022);\n    pushRegex(repeat.item);\n    out.append(\u0022)\u0022);\n    // Then add the repetition part.\n    let min = repeat.min;\n    let max = repeat.max;\n    if (false) {\n    } else if (min == 0 \u0026\u0026 max == 1) {\n      out.append(\u0022?\u0022);\n    } else if (min == 0 \u0026\u0026 max == null) {\n      out.append(\u0022*\u0022);\n    } else if (min == 1 \u0026\u0026 max == null) {\n      out.append(\u0022+\u0022);\n    } else {\n      out.append(\u0022{\u0024{min}\u0022);\n      if (min != max) {\n        out.append(\u0022,\u0022);\n        if (max != null) {\n          out.append(max.toString());\n        }\n      }\n      out.append(\u0022}\u0022);\n    }\n    if (repeat.reluctant) {\n      out.append(\u0022?\u0022);\n    }\n  }\n\n  private pushSequence(sequence: Sequence): Void {\n    // TODO(tjp, regex): Foreach loop/function would be nice.\n    for (var i = 0; i \u003c sequence.items.length; i += 1) {\n      pushRegex(sequence.items[i]);\n    }\n  }\n\n  // Put this here instead of the data model for now because I'm not sure this\n  // makes sense to be part of the public api right now.\n  public maxCode(codePart: CodePart): Int? {\n    when (codePart) {\n      is CodePoints -\u003e do {\n        // Iterating code points is the hardest of the current cases.\n        let value = codePart.value;\n        if (value.isEmpty) {\n          null\n        } else {\n          // My kingdom for a fold, or even just a max, in builtins.\n          var max = 0;\n          for (\n            var index = String.begin;\n            value.hasIndex(index);\n            index = value.next(index)\n          ) {\n            let next = value[index];\n            if (next \u003e max) {\n              max = next;\n            }\n          }\n          max\n        }\n      }\n      // Others below are easy for now.\n      is CodeRange -\u003e codePart.max;\n      Digit -\u003e Codes.digit9;\n      Space -\u003e Codes.space;\n      Word -\u003e Codes.lowerZ;\n      // Actually unexpected, ever, but eh.\n      else -\u003e null;\n    }\n  }\n}\n\n// Cache which chars you just but a blackslash in front of for escaping.\nlet escapeNeeds = buildEscapeNeeds();\nlet needsNoEscape = 0;\nlet needsNumericEscape = 1;\nlet needsSimpleEscape = 2;\nlet buildEscapeNeeds(): List\u003cInt\u003e {\n  let escapeNeeds = new ListBuilder\u003cInt\u003e();\n  for (var code = 0; code \u003c 0x7F; code += 1) {\n    escapeNeeds.add(\n      if (\n        // Dash needs escaping in code sets, but we'll handle that specially.\n        code == Codes.dash ||\n        code == Codes.space ||\n        code == Codes.underscore ||\n        (Codes.digit0 \u003c= code \u0026\u0026 code \u003c= Codes.digit9) ||\n        (Codes.upperA \u003c= code \u0026\u0026 code \u003c= Codes.upperZ) ||\n        (Codes.lowerA \u003c= code \u0026\u0026 code \u003c= Codes.lowerZ)\n      ) {\n        needsNoEscape\n      } else if (\n        // Ampersand and tilde need escaped only in python for now, but meh.\n        code == Codes.ampersand ||\n        code == Codes.backslash ||\n        code == Codes.caret ||\n        code == Codes.curlyLeft ||\n        code == Codes.curlyRight ||\n        code == Codes.dot ||\n        code == Codes.peso ||\n        code == Codes.pipe ||\n        code == Codes.plus ||\n        code == Codes.question ||\n        code == Codes.roundLeft ||\n        code == Codes.roundRight ||\n        code == Codes.slash ||\n        code == Codes.squareLeft ||\n        code == Codes.squareRight ||\n        code == Codes.star ||\n        code == Codes.tilde\n      ) {\n        needsSimpleEscape\n      } else {\n        // We'll also handle \\r, \\n, and \\t specially.\n        needsNumericEscape\n      },\n    );\n  }\n  escapeNeeds.toList()\n}\n\nclass Codes {\n  public static ampersand: Int = char'\u0026';\n  public static backslash: Int = char'\\\\';\n  public static caret: Int = char'^';\n  public static carriageReturn: Int = char'\\r';\n  public static curlyLeft: Int = char'{';\n  public static curlyRight: Int = char'}';\n  public static dash: Int = char'-';\n  public static dot: Int = char'.';\n  public static highControlMin: Int = 0x7F;\n  public static highControlMax: Int = 0x9F;\n  public static digit0: Int = char'0';\n  public static digit9: Int = char'9';\n  public static lowerA: Int = char'a';\n  public static lowerZ: Int = char'z';\n  public static newline: Int = char'\\n';\n  public static peso: Int = char'\u0024';\n  public static pipe: Int = char'|';\n  public static plus: Int = char'+';\n  public static question: Int = char'?';\n  public static roundLeft: Int = char'(';\n  public static roundRight: Int = char')';\n  public static slash: Int = char'/';\n  public static squareLeft: Int = char'[';\n  public static squareRight: Int = char']';\n  public static star: Int = char'*';\n  public static tab: Int = char'\\t';\n  public static tilde: Int = char'*';\n  public static upperA: Int = char'A';\n  public static upperZ: Int = char'Z';\n  public static space: Int = char' ';\n  public static surrogateMin: Int = 0xD800;\n  public static surrogateMax: Int = 0xDFFF;\n  public static supplementalMin: Int = 0x10000;\n  public static uint16Max: Int = 0xFFFF;\n  public static underscore: Int = char'_';\n}\n\n```\n\n\u003c/details\u003e\n" ], "names": [ "RegexNode", "Regex", "text", "format", "Capture", "name", "item", "CodePart", "CodePoints", "value", "Special", "SpecialSet", "CodeRange", "min", "max", "CodeSet", "items", "negated", "Or", "Repeat", "reluctant", "Sequence", "Match", "full", "groups", "Group", "begin", "end", "RegexRefs", "codePoints", "group", "match", "orObject", "data", "formatted", "RegexFormatter", "compiled", "regexRefs", "out", "regex", "pushRegex", "pushCapture", "pushCodePoints", "pushCodeRange", "pushCodeSet", "pushOr", "pushRepeat", "pushSequence", "Begin", "Dot", "End", "WordBoundary", "Digit", "Space", "Word", "capture", "pushCaptureName", "pushCode", "code", "insideCodeSet", "return", "fn", "specialEscape", "Codes", "escapeNeed", "escapeNeeds", "index", "codeRange", "pushCodeRangeUnwrapped", "codeSet", "adjusted", "i", "pushCodeSetItem", "codePart", "or", "repeat", "sequence", "next", "ampersand", "backslash", "caret", "carriageReturn", "curlyLeft", "curlyRight", "dash", "dot", "highControlMin", "highControlMax", "digit0", "digit9", "lowerA", "lowerZ", "newline", "peso", "pipe", "plus", "question", "roundLeft", "roundRight", "slash", "squareLeft", "squareRight", "star", "tab", "tilde", "upperA", "upperZ", "space", "surrogateMin", "surrogateMax", "supplementalMin", "uint16Max", "underscore", "buildEscapeNeeds", "entire", "oneOrMore", "optional" ], "mappings": "AA2BA;AAAA;AAAA;AAAiB,aAAAA,SAAA,iBAiDd,EAAA,AAvCM;AAAA;AAAqC,UAAA,AAArC,EAAqC,AAAnB;AAAE,cAAI,CAAAC,KAAK,CAAC,IAAI,CAAC;AAAA;AAWnC;AAAuD,OAAA,AAAvD,CAAMC,MAAY,CAAqC,AAA1B;AAAE,UAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,KAAK,CAACA,MAAI,CAAC;AAAA;AAarD;AAEN,MAAA,AAFM,CAAKA,MAAY,CAEvB,AAFyC;AACxC,UAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,IAAI,CAACA,MAAI,CAAC;AAAA;AAQhB;AAEN,SAAA,AAFM,CAAQA,MAAY,CAAE,CAAAC,QAA0B,CAEtD,AAFgE;AAC/D,UAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,OAAO,CAACD,MAAI,CAAE,CAAAC,QAAM,CAAC;AAAA;AAG3B;AAEN,OAAA,AAFM,CAAMD,MAAY,CAExB,AAFwC;AACvC,UAAW,AAAX,KAAQ,CAAA,AAAR,QAAQ,EAAE,CAAC,KAAK,CAACA,MAAI,CAAC;AAAA;AACvB;AA6BU,aAAAE,OAAA,iBAGO,CAAA,AAjFHJ,SAAA,CAiFG,AAFX;AAAU,uBAAM;AAAZ,EAAAK,QAAI;AACY,0BAAS;AAAf,EAAAC,QAAI;AACP;AAAA;AAAA,cAAA,AAHP,CAAAF,OAAA,CAGO,MAAA,AAFX,IAAgB,CAEL,OAAA,AADD,IAAmB,CAClB;AAAA;AAAA;AAAA,cAAA,AAFPC,OAAY,CACF,CAAAC,OAAe,CAClB;AAAA,aAAA;AAFP,SAAYD,QAAA,EAAA,AAAZ,CAAAA,OAAY;AACF,SAAeC,QAAA,EAAA,AAAf,CAAAA,OAAe,CAAA;AAAnB;AAAmB,GAClB;AAFX;AAAA;AAAA,gBAAAD,QAAA;AAAA;AACU;AAAA;AAAA,gBAAAC,QAAA;AAAA;AAAA,CACC;AAYH,aAAAC,QAAA,iBAA2B,CAAA,AA7F3BP,SAAA,CA6F2B;AAAA;AAe/B,aAAAQ,UAAA,iBAEM,CAAA,AAjBFD,QAAA,CAiBE,AADV;AAAW,uBAAM;AAAb,EAAAE,SAAK;AACC;AAAA,cAAA,AADNA,QAAa,CACP;AAAA,aAAA;AADN,SAAaA,SAAA,EAAA,AAAb,CAAAA,QAAa,CAAA;AAAjB;AAAiB,GACP;AADV;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CACU;AA2BF,aAAAC,OAAA,iBAA0B,CAAA,AAzI1BV,SAAA,CAyI0B;AAAA;AAY1B,aAAAW,UAAA,iBAAsC,CAAA,AAxDtCJ,QAAA,CA4CA,CAAAG,OAAA,CAYsC;AAAA;AAsB1C,aAAAE,SAAA,iBAGM,CAAA,AAjFFL,QAAA,CAiFE,AAFV;AAAS,uBAAG;AAAR,EAAAM,OAAG;AACE,uBAAG;AAAR,EAAAC,OAAG;AACG;AAAA;AAAA,cAAA,AAHN,CAAAF,SAAA,CAGM,MAAA,AAFV,GAAY,CAEF,OAAA,AADV,GAAY,CACF;AAAA;AAAA;AAAA,cAAA,AAFNC,MAAQ,CACR,CAAAC,MAAQ,CACF;AAAA,aAAA;AAFN,SAAQD,OAAA,EAAA,AAAR,CAAAA,MAAQ;AACR,SAAQC,OAAA,EAAA,AAAR,CAAAA,MAAQ,CAAA;AAAZ;AAAY,GACF;AAFV;AAAA;AAAA,gBAAAD,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,OAAA;AAAA;AAAA,CACU;AAeN,aAAAC,OAAA,iBAGO,CAAA,AAhMHf,SAAA,CAgMG,AAFX;AAAW,gCAAc;AAArB,EAAAgB,SAAK;AACI,wBAAO;AAAhB,EAAAC,WAAO;AACA;AAAA;AAAA,cAAA,AAHP,CAAAF,OAAA,CAGO,MAAA,AAFX,KAAyB,CAEd,OAAA,AADX,OAA4B,CACjB;AAAA;AAAA;AAAA,cAAA,AAFPC,QAAqB,CACrB,CAAAC,UAAwB,CACjB;AAAA,aAAA;AADX,OAAI,CAAAA,UAAwB;AAAA,QAAAA,UAAA,WAAA;AAAL,MAAAA,UAAA,EAAK,AAAL,MAAK;AAAA;AAAA,MAAAA,UAAA,GAAAA,UAAA;AAAA,KAAA;AADxB,SAAqBD,SAAA,EAAA,AAArB,CAAAA,QAAqB;AACrB,SAAwBC,WAAA,EAAA,AAAxB,CAAAA,UAAwB,CAAA;AAA5B;AAA4B,GACjB;AAFX;AAAA;AAAA,gBAAAD,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,WAAA;AAAA;AAAA,CACW;AAQP,aAAAC,EAAA,iBAEO,CAAA,AA1MHlB,SAAA,CA0MG,AADD;AAAW,iCAAe;AAAtB,EAAAgB,SAAK;AACR;AAAA,cAAA,AADGA,QAAsB,CACzB;AAAA,aAAA;AADG,SAAsBA,SAAA,EAAA,AAAtB,CAAAA,QAAsB,CAAA;AAA1B;AAA0B,GACzB;AADD;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CACC;AAoBP,aAAAG,MAAA,iBAKO,CAAA,AAnOHnB,SAAA,CAmOG,AAJD;AAAU,0BAAS;AAAf,EAAAM,QAAI;AACT,uBAAG;AAAR,EAAAO,OAAG;AACE,8BAAI;AAAT,EAAAC,OAAG;AACQ,wBAAO;AAAlB,EAAAM,aAAS;AACF;AAAA;AAAA,cAAA,AALP,CAAAD,MAAA,CAKO,MAAA,AAJD,IAAmB,CAIlB,OAAA,AAHX,GAAY,CAGD,OAAA,AAFX,GAAa,CAEF,OAAA,AADX,SAA8B,CACnB;AAAA;AAAA;AAAA,cAAA,AAJGb,OAAe,CACzB,CAAAO,MAAQ,CACR,CAAAC,MAAS,CACT,CAAAM,YAA0B,CACnB;AAAA,aAAA;AADX,OAAI,CAAAA,YAA0B;AAAA,QAAAA,YAAA,WAAA;AAAL,MAAAA,YAAA,EAAK,AAAL,MAAK;AAAA;AAAA,MAAAA,YAAA,GAAAA,YAAA;AAAA,KAAA;AAHhB,SAAed,QAAA,EAAA,AAAf,CAAAA,OAAe;AACzB,SAAQO,OAAA,EAAA,AAAR,CAAAA,MAAQ;AACR,SAASC,OAAA,EAAA,AAAT,CAAAA,MAAS;AACT,SAA0BM,aAAA,EAAA,AAA1B,CAAAA,YAA0B,CAAA;AAA9B;AAA8B,GACnB;AAJD;AAAA;AAAA,gBAAAd,QAAA;AAAA;AACV;AAAA;AAAA,gBAAAO,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,OAAA;AAAA;AACA;AAAA;AAAA,gBAAAM,aAAA;AAAA;AAAA,CACW;AAwBP,aAAAC,QAAA,iBAEO,CAAA,AA7PHrB,SAAA,CA6PG,AADD;AAAW,iCAAe;AAAtB,EAAAgB,SAAK;AACR;AAAA,cAAA,AADGA,QAAsB,CACzB;AAAA,aAAA;AADG,SAAsBA,SAAA,EAAA,AAAtB,CAAAA,QAAsB,CAAA;AAA1B;AAA0B,GACzB;AADD;AAAA;AAAA,gBAAAA,SAAA;AAAA;AAAA,CACC;AAgBP,aAAAM,KAAA,iBAGX,EAAA,AAFO;AAAU,sBAAK;AAAX,EAAAC,QAAI;AACI,mCAAkB;AAA1B,EAAAC,UAAM;AACjB;AAAA;AAAA,cAAA,AAHW,CAAAF,KAAA,CAGX,MAAA,AAFO,IAAe,CAEtB,OAAA,AADO,MAA8B,CACrC;AAAA;AAAA;AAAA,cAAA,AAFWC,OAAW,CACX,CAAAC,SAA0B,CACrC;AAAA,aAAA;AAFW,SAAWD,QAAA,EAAA,AAAX,CAAAA,OAAW;AACX,SAA0BC,UAAA,EAAA,AAA1B,CAAAA,SAA0B,CAAA;AAA9B;AAA8B,GACrC;AAFO;AAAA;AAAA,gBAAAD,QAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,UAAA;AAAA;AAAA,CACP;AAEW,aAAAC,KAAA,iBAKX,EAAA,AAJO;AAAU,uBAAM;AAAZ,EAAApB,QAAI;AACG,uBAAM;AAAb,EAAAI,SAAK;AACE,kCAAW;AAAlB,EAAAiB,SAAK;AACA,kCAAW;AAAhB,EAAAC,OAAG;AACd;AAAA;AAAA,cAAA,AALW,CAAAF,KAAA,CAKX,MAAA,AAJO,IAAgB,CAIvB,OAAA,AAHO,KAAiB,CAGxB,OAAA,AAFO,KAAsB,CAE7B,OAAA,AADO,GAAoB,CAC3B;AAAA;AAAA;AAAA,cAAA,AAJWpB,OAAY,CACZ,CAAAI,QAAa,CACb,CAAAiB,QAAkB,CAClB,CAAAC,MAAgB,CAC3B;AAAA,aAAA;AAJW,SAAYtB,QAAA,EAAA,AAAZ,CAAAA,OAAY;AACZ,SAAaI,SAAA,EAAA,AAAb,CAAAA,QAAa;AACb,SAAkBiB,SAAA,EAAA,AAAlB,CAAAA,QAAkB;AAClB,SAAgBC,OAAA,EAAA,AAAhB,CAAAA,MAAgB,CAAA;AAApB;AAAoB,GAC3B;AAJO;AAAA;AAAA,gBAAAtB,QAAA;AAAA;AACA;AAAA;AAAA,gBAAAI,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAiB,SAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,OAAA;AAAA;AAAA,CACP;AAeI,MAAAC,YAAA,iBAUJ,EAAA,AATO;AAAgB,2BAAU;AAAtB,EAAAC,cAAU;AACH,sBAAK;AAAZ,EAAAC,SAAK;AAGE,sBAAK;AAAZ,EAAAC,SAAK;AAIK,mBAAE;AAAZ,EAAAC,YAAQ;AACnB;AAAA;AAAA,cAAA,AAVI,CAAAJ,YAAA,CAUJ,MAAA,AATO,UAA+C,CAStD,OAAA,AARO,KAEN,CAMD,OAAA,AALO,KAGN,CAED,OAAA,AADO,QAA6B,CACpC;AAAA;AAAA;AAAA,cAAA,AATWC,aAA2C,CAC3C,CAAAC,QAEV,CACU,CAAAC,QAGV,CACU,CAAAC,WAAyB,CACpC;AAAA,aAAA;AAToC,YAAkB;AAC5B,YAEzB;AAGS,YAA6C,CAAA;AAF7B,YAGzB;AACyB,YAAU,CAAA;AAR7B,OAAI,CAAAH,aAA2C;AAAA,QAAAA,aAAA,WAAA;AAAlB,YAAkB,AAAlB,IAAI,CAAArB,UAAU,CAAC,EAAE,CAAC,CAAA;AAAlB,MAAAqB,aAAA,EAAkB,AAAlB,KAAkB;AAAA;AAAA,MAAAA,aAAA,GAAAA,aAAA;AAAA;AAC/C,OAAI,CAAAC,QAEV;AAAA,QAAAA,QAAA,WAAA;AAFyB,YAEzB,AAFyB,IACxB,CAAAL,KAAA,CAAM,EAAE,CAAS,GAAE,CAAS,EAAY,CAAO,EAAY,CAC5D,CAAA;AAFyB,MAAAK,QAAA,EAEzB,AAFyB,KAEzB;AAAA;AAAA,MAAAA,QAAA,GAAAA,QAAA;AAAA;AACM,OAAI,CAAAC,QAGV;AAAA,QAAAA,QAAA,WAAA;AADS,YAA6C,AAAzC,kBAAkB,CAAC,MAAqB,CAAA,AAArB,MAAqB,CAAA,AAArB,CAAK,kBAAI,CAAC,EAAE,CAAE,CAAAD,QAAK,CAAC,CAAC,EAAC,CAAA;AAF7B,YAGzB,AAHyB,IACxB,CAAAR,KAAA,CAAMQ,QAAK,CACH,KAA6C,CACtD,CAAA;AAHyB,MAAAC,QAAA,EAGzB,AAHyB,KAGzB;AAAA;AAAA,MAAAA,QAAA,GAAAA,QAAA;AAAA;AACM,OAAI,CAAAC,WAAyB;AAAA,QAAAA,WAAA,WAAA;AAAV,YAAU,AAAV,IAAI,CAAAd,EAAE,CAAC,MAAE,CAAA,AAAF,MAAE,CAAA,AAAF,EAAE,EAAC,CAAA;AAAV,MAAAc,WAAA,EAAU,AAAV,KAAU;AAAA;AAAA,MAAAA,WAAA,GAAAA,WAAA;AAAA,KAAA;AARzB,SAA2CH,cAAA,EAAA,AAA3C,CAAAA,aAA2C;AAC3C,SAEVC,SAAA,EAAA,AAFU,CAAAA,QAEV;AACU,SAGVC,SAAA,EAAA,AAHU,CAAAA,QAGV;AACU,SAAyBC,YAAA,EAAA,AAAzB,CAAAA,WAAyB,CAAA;AAA7B;AAA6B,GACpC;AATO;AAAA;AAAA,gBAAAH,cAAA;AAAA;AACA;AAAA;AAAA,gBAAAC,SAAA;AAAA;AAGA;AAAA;AAAA,gBAAAC,SAAA;AAAA;AAIA;AAAA;AAAA,gBAAAC,YAAA;AAAA;AAAA;AAWI,aAAA/B,KAAA,iBAoEI,EAAA,AA7DR;AAAU,0BAAS;AAAf,EAAAgC,QAAI;AAER,mCAKN;AALM,cAAYA,OAAe,CAKjC,AALM;AAAA,SAKN,IAAA;AAJC,gBAAY,CAAAA,OAAI,AAAhB;AAAA,QAAI,CAAYA,QAAA,EAAA,AAAJ,KAAI;AAEhB,SAAI,CAAAC,YAAS,EAAG,CAAAC,iBAAc,CAAY,YAACF,OAAI,CAAC;AACrC,YAAqD,EAAA,AAArD,0BAAqD,CAAA,AAAhBA,OAAI,CAAE,CAAAC,YAAS,CAAC,CAAA;AAAhE,QAAQ,CAAwDE,aAAA,EAAA,AAArD,KAAqD;AAAA;AAAC;AAQ5D;AAEN,OAAA,AAFM,CAAMlC,QAAY,CAExB,AAFmC;AAClC,iCAAa,CAAA,AAAb,IAAa,CAAC,KAAQ,CAAAkC,aAAA,CAAE,CAAAlC,QAAI,CAAC;AAAA;AAGxB;AAEN,MAAA,AAFM,CAAKA,QAAY,CAAE,CAAAwB,SAAiC,CAE1D,AAF4E,EAAA;AAAnD,QAAAA,SAAiC;AAAA,QAAAA,SAAA,WAAA;AAAZ,MAAAA,SAAA,EAAY,AAAZ,EAAY;AAAA;AAAA,MAAAA,SAAA,GAAAA,SAAA;AAAA;AACzD,gCAAY,CAAA,AAAZ,IAAY,CAAC,KAAQ,CAAAU,aAAA,CAAE,CAAAlC,QAAI,CAAE,CAAAwB,SAAK,CAAE,CAAAW,aAAS,CAAC;AAAA;AAGzC;AAEN,SAAA,AAFM,CAAQnC,QAAY,CAAE,CAAAC,UAA0B,CAEtD,AAFgE;AAC/D,mCAAe,CAAA,AAAf,IAAe,CAAC,KAAQ,CAAAiC,aAAA,CAAE,CAAAlC,QAAI,CAAE,CAAAC,UAAM,CAAE,CAAAkC,aAAS,CAAC;AAAA;AAG7C;AAEN,OAAA,AAFM,CAAMnC,QAAY,CAExB,AAFwC;AACvC,iCAAa,CAAA,AAAb,IAAa,CAAC,KAAQ,CAAAkC,aAAA,CAAE,CAAAlC,QAAI,CAAE,CAAAmC,aAAS,CAAC;AAAA;AASpB,wBAAQ;AAAlB,EAAAD,aAAQ,CAAU;AApCvB;AAAA;AAAA,gBAAAH,QAAA;AAAA;AAAA,CA6DQ;AA0BX,MAAAE,iBAAA,iBAkPH,EAAA,AAlPkB;AACF,yCAAa;AAAlB,EAAAG,QAAG;AAQD;AAEb,QAAA,AAFa,YAAW,AAAX,CAAYL,QAAe,CAExC,AAFkD;AACjD,UAAqB,AAArB,IAAI,CAAAE,iBAAc,EAAE,CAAC,MAAM,CAACF,QAAI,CAAC;AAAA;AAG5B;AAGN,QAAA,AAHM,CAAOM,SAAgB,CAG7B,AAHuC;AACtC,QAAS,CAAA,AAATC,cAAS,CAACD,SAAK,CAAC;AAChB,eAAG,CAAAD,QAAA;AAAW;AAGR;AAsBP,EAAAE,cAAA,AAtBO,CAAUD,SAAgB,CAsBjC,AAtByC;AAqBvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAAA;AApBD,QAEK,AAFCA,SAAK,WAEN,CAAAnC,OAAO;AAkBX,qCAAAmC,SAAA,EAAAnC,OAAA,EAAA;AAlBe,UAAW,CAAA,AAAXqC,gBAAW,CAAC,KAAK,CAAC;AAAA,UAAA,AAFlC,KAGK,AAHCF,SAAK,WAGN,CAAA/B,UAAU;AAiBd,qCAAA+B,SAAA,EAAA/B,UAAA,EAAA;AAjBkB,UAAc,CAAA,AAAdkC,mBAAc,CAAC,KAAK,CAAE,MAAK,CAAC;AAAA,UAAA,AAH/C,KAIK,AAJCH,SAAK,WAIN,CAAA3B,SAAS;AAgBb,qCAAA2B,SAAA,EAAA3B,SAAA,EAAA;AAhBiB,UAAa,CAAA,AAAb+B,kBAAa,CAAC,KAAK,CAAC;AAAA,UAAA,AAJtC,KAKK,AALCJ,SAAK,WAKN,CAAAxB,OAAO;AAeX,qCAAAwB,SAAA,EAAAxB,OAAA,EAAA;AAfe,UAAW,CAAA,AAAX6B,gBAAW,CAAC,KAAK,CAAC;AAAA,UAAA,AALlC,KAMK,AANCL,SAAK,WAMN,CAAArB,EAAE;AAcN,qCAAAqB,SAAA,EAAArB,EAAA,EAAA;AAdU,UAAM,CAAA,AAAN2B,WAAM,CAAC,KAAK,CAAC;AAAA,UAAA,AANxB,KAOK,AAPCN,SAAK,WAON,CAAApB,MAAM;AAaV,qCAAAoB,SAAA,EAAApB,MAAA,EAAA;AAbc,UAAU,CAAA,AAAV2B,eAAU,CAAC,KAAK,CAAC;AAAA,UAAA,AAPhC,KAQK,AARCP,SAAK,WAQN,CAAAlB,QAAQ;AAYZ,qCAAAkB,SAAA,EAAAlB,QAAA,EAAA;AAZgB,UAAY,CAAA,AAAZ0B,iBAAY,CAAC,KAAK,CAAC;AAAA,UAAA,AARpC,KAWE,MAAK,CAAA,AAAL,EAAK,CAAA,AAXDR,SAAK,CAWT,CAAAS,KAAK;AAAI,UAAG,CAAAV,QAAA,GAAQ,OAAI;AAAA,UAAA,AAX1B,KAYE,MAAG,CAAA,AAAH,EAAG,CAAA,AAZCC,SAAK,CAYT,CAAAU,GAAG;AAAI,UAAG,CAAAX,QAAA,GAAQ,OAAI;AAAA,UAAA,AAZxB,KAaE,MAAG,CAAA,AAAH,EAAG,CAAA,AAbCC,SAAK,CAaT,CAAAW,GAAG;AAAI,UAAG,CAAAZ,QAAA,GAAQ,YAAI;AAAA,UAAA,AAbxB,KAcE,MAAY,CAAA,AAAZ,EAAY,CAAA,AAdRC,SAAK,CAcT,CAAAY,YAAY;AAAI,UAAG,CAAAb,QAAA,GAAQ,SAAM;AAAA,UAAA,AAdnC,KAgBE,MAAK,CAAA,AAAL,EAAK,CAAA,AAhBDC,SAAK,CAgBT,CAAAa,KAAK;AAAI,UAAG,CAAAd,QAAA,GAAQ,SAAM;AAAA,UAAA,AAhB5B,KAiBE,MAAK,CAAA,AAAL,EAAK,CAAA,AAjBDC,SAAK,CAiBT,CAAAc,KAAK;AAAI,UAAG,CAAAf,QAAA,GAAQ,SAAM;AAAA,UAAA,AAjB5B,KAkBE,MAAI,CAAA,AAAJ,EAAI,CAAA,AAlBAC,SAAK,CAkBT,CAAAe,IAAI;AAAI,UAAG,CAAAhB,QAAA,GAAQ,SAAM;AAAA,KAE1B;AApBD;AAoBC;AAGK;AAQP,EAAAG,gBAAA,AARO,CAAYc,WAAgB,CAQnC,AAR2C;AAC1C,QAAG,CAAAjB,QAAA,GAAQ,OAAI;AAIC,aAAG,EAAA,AAAH,KAAG,CAAAA,QAAA;AAAE,aAAY,EAAA,AAAZ,CAAAiB,WAAO,CAAK,KAAA;AAAjC,QAAe,CAAA,AAAfC,oBAAe,CAAC,KAAG,CAAE,MAAY,CAAC;AACxB,aAAY,EAAA,AAAZ,CAAAD,WAAO,CAAK,KAAA;AAAtB,QAAS,CAAA,AAATf,cAAS,CAAC,KAAY,CAAC;AACvB,QAAG,CAAAF,QAAA,GAAQ,OAAI;AAAA;AAAC;AAIV;AAGP,EAAAkB,oBAAA,AAHO,CAAgBlB,OAAkB,CAAE,CAAAjC,QAAY,CAGvD,AAH+D;AAE9D,IAAAiC,OAAG,GAAQ,GAAC,UAAE,AAAH,EAAY,AAAP,CAAAjC,QAAO,AAAZ,EAAY,AAAF,SAAG;AAAA;AAAC;AAGnB;AA4CU,EAAAoD,aAAA,AA5CV,CAASC,QAAS,CAAE,CAAAC,iBAAsB,CA4ChC,AA5CwC,EAAA;AAAL,QAAAC,UAAI;AAmBjC,aAAkB,CAAA;AADL;AAIpB,aAA0B;AAG1B,aAA0B;AASJ,aAA0B,CAAA;AAAxD,cAAA;AADH,aAGC,CAAA;AAL0B;AAQlB,aAA0B,CAAA;AAvCiB,IAAAC,MA4CxC,CAAA,AA5CwC;AAAE;AAG1D,WAAI,CAAAC,iBAKH,CAAA;AALmB,YAClB,AADwBJ,QACxB,IAAoB,AAApB,CAAAK,SAAK,CAAe;AAAI,UAAAD,iBAAA,EAAG,AAAH,IAAG;AAAA,cAAA,AADT,KAElB,AAFwBJ,QAExB,IAAa,AAAb,CAAAK,SAAK,CAAQ;AAAI,UAAAD,iBAAA,EAAG,AAAH,IAAG;AAAA,cAAA,AAFF,KAGlB,AAHwBJ,QAGxB,IAAS,AAAT,CAAAK,SAAK,CAAI;AAAI,UAAAD,iBAAA,EAAG,AAAH,IAAG;AAAA;AACR,UAAAA,iBAAA,EAAE,AAAF,GAAE,CAAA;AAAN;AAEN,YAAIA,iBAAa,AAAb,IAAmB,AAAF,GAAE;AACrB,cAAG,CAAAxB,QAAA,GAAQ,QAAK;AAChB,cAAG,CAAAA,QAAA,GAAQ,IAAAwB,iBAAc;AACzB,UAAAF,UAAM,AAAN,EAAM,AAAN,OAAM,CAAA;AAAN,gBAAAC,MAAM;AACP;AAED,YAAIH,QAAI,AAAJ,GAAY,AAAJ,IAAI;AACd,eAAI,CAAAM,cAAU,EAAc,eAAA,AAAXC,eAAW,CAAC,CAAAP,QAAI,CAAC;AAEhC,cAAAM,cAAU,AAAV,IAA+B,AAAjB,EAAiB;AAAA;AAAA;AAC9B,gBAAAL,iBAAa;AAAI,qBAAkB,AAAlB,CAAAD,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAAA,aAAA;AAAnC;AAAA,WAAA;AAFH,cACE;AAGA,gBAAG,CAAAzB,QAAA,GAAQ,QAAK;AACL,mBAA0B,AAA1B,wBAA0B,CAAA,AAALoB,QAAI,CAAC,CAAA;AAArC,gBAAG,CAAApB,QAAA,GAAQ,SAA2B;AACtC,YAAAsB,UAAM,AAAN,EAAM,AAAN,OAAM,CAAA;AAAN,kBAAAC,MAAM;AACP,gBAAA,AAPD,KAOWG,cAAU,AAAV,IAA2B,AAAb,EAAa;AACzB,mBAA0B,AAA1B,wBAA0B,CAAA,AAALN,QAAI,CAAC,CAAA;AAArC,gBAAG,CAAApB,QAAA,GAAQ,SAA2B;AACtC,YAAAsB,UAAM,AAAN,EAAM,AAAN,OAAM,CAAA;AAAN,kBAAAC,MAAM;AACP;AACF;AAGC,YAAAH,QAAI,AAAJ,GAA6B,AAArB,CAAAK,SAAK,CAAgB;AAAA;AAAA;AAC3B,cAAAL,QAAI,AAAJ,EAA2B,AAApB,CAAAK,SAAK,CAAe;AAExB,gBAAAA,SAAK,CAAa,YAAA,AAAlB,GAA0B,AAAJ,CAAAL,QAAI;AAAI,qBAA0B,AAA1B,CAAAA,QAAI,AAAJ,GAA0B,AAAlB,CAAAK,SAAK,CAAa;AAAA;AAAA;AAAA,aAAA;AAAzD,gBAAC;AAAA;AAAA;AACD,qBAAuB,AAAvB,CAAAL,QAAI,AAAJ,IAAuB,AAAf,CAAAK,SAAK,CAAU;AAAA,aAAA;AAFzB,mBAGC,AAHD,EACE,MAED;AAAA;AAAA;AAAA,WAAA;AAJD;AAAA,SAAA;AAFJ,YACE;AAQW,iBAA0B,AAA1B,wBAA0B,CAAA,AAALL,QAAI,CAAC,CAAA;AAArC,cAAG,CAAApB,QAAA,GAAQ,SAA2B;AACvC;AAEC,sCAAU,CAAA,AAAV,IAAU,CAAC,KAAG,CAAAA,QAAA,CAAE,CAAAoB,QAAI,CAAE,CAAAC,iBAAa,CAAC;AACrC;AACF,OAAQ;AAAA,mBAAO;AAAA,OAAA;AA5CqC,MAAAC,UAAO,EA4C5C,AA5C4C,OA4C5C;AAAA;AAAE,UAAA,AA5CmC,CAAAA,UAAA;AA4CnC;AAKV;AASP,EAAAlB,mBAAA,AATO,CAAeb,cAAsB,CAAE,CAAA8B,iBAAsB,CASpE,AAT4E;AAOhE,aAAY,CAAA;AAFb,aAAiB,CAAA;AAJ3B,SAAI,CAAAlD,SAAK,EAAG,CAAAoB,cAAU,CAAM;AAEvB,OAAC,CAAAqC,SAAK,EAAG,EAAY,CAAA;AAD1B,kBAIE;AAFA,YAAAzD,SAAK,SAAU,CAAAyD,SAAM;AAAA;AAAA;AAGZ,aAAY,AAAP,eAAA,AAALzD,SAAK,CAAC,CAAAyD,SAAK,CAAC,CAAA;AAArB,UAAQ,CAAA,AAART,aAAQ,CAAC,KAAY,CAAE,CAAAE,iBAAa,CAAC,CAAA;AAF7B,aAAiB,AAAX,eAAI,CAAA,AAAVlD,SAAK,CAAM,CAAAyD,SAAK,CAAC,CAAA;AAAzB,MAAAA,SAAK,AAAL,EAAyB,AAAjB,MAAiB;AAG1B,KAAA;AAND;AAAA;AASM;AAIP,EAAAvB,kBAAA,AAJO,CAAcwB,aAAoB,CAIzC,AAJiD;AAChD,QAAG,CAAA7B,QAAA,GAAQ,OAAI;AACf,QAAsB,CAAA,AAAtB8B,2BAAsB,CAACD,aAAS,CAAC;AACjC,QAAG,CAAA7B,QAAA,GAAQ,OAAI;AAAA;AAAC;AAGV;AAIP,EAAA8B,2BAAA,AAJO,CAAuBD,aAAoB,CAIlD,AAJ0D;AAChD,aAAa,EAAA,AAAb,CAAAA,aAAS,CAAI,IAAA;AAAtB,QAAQ,CAAA,AAARV,aAAQ,CAAC,KAAa,CAAE,KAAI,CAAC;AAC7B,QAAG,CAAAnB,QAAA,GAAQ,OAAI;AACN,aAAa,EAAA,AAAb,CAAA6B,aAAS,CAAI,IAAA;AAAtB,QAAQ,CAAA,AAARV,aAAQ,CAAC,KAAa,CAAE,KAAI,CAAC;AAAA;AAAC;AAGxB;AAeP,EAAAb,gBAAA,AAfO,CAAYyB,WAAgB,CAenC,AAf2C;AAQlB,aAAqB;AACvB,aAAiB;AAKtC,cAAA;AAbD,SAAI,CAAAC,YAAQ,EAAG,gCAAa,CAAA,AAAb,IAAa,CAAC,CAAAD,WAAO,CAAE,CAAAhC,aAAS,CAAC;AAChD,QACK,AADCiC,YAAQ,WACT,CAAAvD,OAAO;AAWX,qCAAAuD,YAAA,EAAAvD,OAAA,EAAA;AAVG,UAAG,CAAAuB,QAAA,GAAQ,OAAI;AACf,UAAI,KAAQ,CAAQ;AAClB,YAAG,CAAAA,QAAA,GAAQ,OAAI;AAChB;AACO,SAAC,CAAAiC,KAAC,EAAG,EAAC,CAAA;AAAd,oBAAmD;AAA/B,eAAqB,AAArB,MAAQ,CAAM,MAAO,OAAA;AAAzB,cAAAA,KAAC,AAAD,EAAyB,AAArB,MAAqB;AAAA;AAAA;AACvB,eAAiB,AAAH,eAAA,AAAd,KAAQ,CAAM,MAAC,CAAAA,KAAC,CAAC,CAAA;AAAjC,YAAe,CAAA,AAAfC,oBAAe,CAAC,KAAiB,CAAC,CAAA;AADO,QAAAD,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,AAAD,EAAK,EAAC;AAEhD;AACD,UAAG,CAAAjC,QAAA,GAAQ,OAAI;AAChB;AACO,UAAS,CAAA,AAATE,cAAS,CAAC8B,YAAQ,CAAC,CAAA;AAAvB,KACL;AAZD;AAYC;AAMK;AAMP,EAAAE,oBAAA,AANO,CAAgBC,YAAkB,CAMzC,AANiD;AAK/C;AAAA;AAAA,cAAA;AAJD,QACK,AADCA,YAAQ,WACT,CAAAjE,UAAU;AAGd,qCAAAiE,YAAA,EAAAjE,UAAA,EAAA;AAHkB,UAAc,CAAA,AAAdkC,mBAAc,CAAC,KAAQ,CAAE,KAAI,CAAC;AAAA,UAAA,AADjD,KAEK,AAFC+B,YAAQ,WAET,CAAA7D,SAAS;AAEb,qCAAA6D,YAAA,EAAA7D,SAAA,EAAA;AAFiB,UAAsB,CAAA,AAAtBwD,2BAAsB,CAAC,KAAQ,CAAC;AAAA,UAAA,AAFlD,KAGK,AAHCK,YAAQ,WAGT,CAAA9D,UAAU;AACd,qCAAA8D,YAAA,EAAA9D,UAAA,EAAA;AADkB,UAAS,CAAA,AAAT6B,cAAS,CAAC,KAAQ,CAAC;AAAA,KACrC;AAJD;AAIC;AAGK;AAYP,EAAAK,WAAA,AAZO,CAAO6B,MAAM,CAYpB,AAZ4B;AAKf,aAAW;AACD,aAAe;AAEvB,aAAW,CAAA;AAPzB,QAAI,CAAC,GAAAA,MAAE,CAAM,MAAA,AAAR,MAAgB;AACnB,UAAG,CAAApC,QAAA,GAAQ,SAAM;AAGP,aAAW,AAAH,eAAA,AAARoC,MAAE,CAAM,MAAC,EAAC,CAAC,CAAA;AAArB,UAAS,CAAA,AAATlC,cAAS,CAAC,KAAW,CAAC;AACd,SAAC,CAAA+B,KAAC,EAAG,EAAC,CAAA;AAAd,oBAA6C;AAAzB,eAAe,AAAf,CAAAG,MAAE,CAAM,MAAO,OAAA;AAAnB,cAAAH,KAAC,AAAD,EAAmB,AAAf,MAAe;AAAA;AAAA;AACjC,YAAG,CAAAjC,QAAA,GAAQ,OAAI;AACL,eAAW,AAAH,eAAA,AAARoC,MAAE,CAAM,MAAC,CAAAH,KAAC,CAAC,CAAA;AAArB,YAAS,CAAA,AAAT/B,cAAS,CAAC,KAAW,CAAC,CAAA;AAFa,QAAA+B,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,AAAD,EAAK,EAAC;AAG1C;AACD,UAAG,CAAAjC,QAAA,GAAQ,OAAI;AAChB,KAAA;AAVD;AAUC;AAGK;AA4BP,EAAAQ,eAAA,AA5BO,CAAW6B,UAAc,CA4BhC,AA5BwC;AAgBxB,aAAO;AAIL,aAAc,CAAA;AAXR,aAAQ;AAER,aAAW;AAEX,aAAW,CAAA;AAXlC,QAAG,CAAArC,QAAA,GAAQ,SAAM;AACP,aAAW,EAAA,AAAX,CAAAqC,UAAM,CAAK,KAAA;AAArB,QAAS,CAAA,AAATnC,cAAS,CAAC,KAAW,CAAC;AACtB,QAAG,CAAAF,QAAA,GAAQ,OAAI;AAEf,SAAI,CAAAzB,OAAG,EAAG,CAAA8D,UAAM,CAAI;AACpB,SAAI,CAAA7D,OAAG,EAAG,CAAA6D,UAAM,CAAI;AAET,QAAA9D,OAAG,AAAH,IAAQ,AAAD,EAAC;AAAI,aAAQ,AAAR,CAAAC,OAAG,AAAH,IAAQ,AAAD,EAAC;AAAA;AAAA;AAAA,KAAA;AAD/B,QACW;AACT,UAAG,CAAAwB,QAAA,GAAQ,OAAI;AAChB,YAAA;AAAU,UAAAzB,OAAG,AAAH,IAAQ,AAAD,EAAC;AAAI,eAAW,AAAX,CAAAC,OAAW;AAAA;AAAA;AAAA,OAAA;AAHlC,UAGW;AACT,YAAG,CAAAwB,QAAA,GAAQ,OAAI;AAChB,cAAA;AAAU,YAAAzB,OAAG,AAAH,IAAQ,AAAD,EAAC;AAAI,iBAAW,AAAX,CAAAC,OAAW;AAAA;AAAA;AAAA,SAAA;AALlC,YAKW;AACT,cAAG,CAAAwB,QAAA,GAAQ,OAAI;AAChB;AACc,iBAAO,AAAL,CAAAzB,OAAG,CAAA,AAAL,QAAO,GAAA;AAApB,cAAG,CAAAyB,QAAA,GAAQ,GAAC,IAAC,AAAF,EAAS,AAAP,MAAQ;AACrB,cAAIzB,OAAG,AAAH,IAAU,AAAH,CAAAC,OAAG;AACZ,gBAAG,CAAAwB,QAAA,GAAQ,OAAI;AACf,gBAAI,EAAAxB,OAAW;AACF,qBAAc,AAC1B,CAAAA,OAAA,CAAA,AADY,QAAc,GAAA;AAAzB,kBAAG,CAAAwB,QAAA,GAAQ,SAAe;AAC3B;AACF;AACD,cAAG,CAAAA,QAAA,GAAQ,OAAI;AAChB;AAAA;AAAA;AACD,QAAIqC,UAAM,CAAU;AAClB,UAAG,CAAArC,QAAA,GAAQ,OAAI;AAChB,KAAA;AAFD;AAEC;AAGK;AAKP,EAAAS,iBAAA,AALO,CAAa6B,YAAkB,CAKtC,AAL8C;AAEzB,aAAqB;AAC7B,aAAiB,CAAA;AADrB,OAAC,CAAAL,KAAC,EAAG,EAAC,CAAA;AAAd,kBAAmD;AAA/B,aAAqB,AAArB,CAAAK,YAAQ,CAAM,MAAO,OAAA;AAAzB,YAAAL,KAAC,AAAD,EAAyB,AAArB,MAAqB;AAAA;AAAA;AAC7B,aAAiB,AAAH,eAAA,AAAdK,YAAQ,CAAM,MAAC,CAAAL,KAAC,CAAC,CAAA;AAA3B,UAAS,CAAA,AAAT/B,cAAS,CAAC,KAAiB,CAAC,CAAA;AADa,MAAA+B,KAAC,AAAD,EAAM,AAAN,CAAAA,KAAC,AAAD,EAAK,EAAC;AAEhD,KAAA;AAFD;AAAA;AAOK;AA+BN,SAAA,AA/BM,CAAQE,YAAkB,CA+BhC,AA/BwC,EAAA;AAAL,QAAAb,UAAI;AAatB,aAAiB;AAiBhC,cAAA;AA7BD,QACK,AADCa,YAAQ,WACT,CAAAjE,UAAU;AA4Bd,qCAAAiE,YAAA,EAAAjE,UAAA,EAAA;AA1BG,WAAI,CAAAC,SAAK,EAAG,MAAQ,CAAM;AAC1B,UAAI,EAAAA,SAAa;AACf,QAAAmD,UAAA,EAAI,AAAJ,KAAI;AACL;AAEI,WAAC,CAAA9C,OAAG,EAAG,EAAC;AAEN,WAAC,CAAAoD,SAAK,EAAG,EAAY,CAAA;AAD1B,sBAIE;AAFA,gBAAAzD,SAAK,SAAU,CAAAyD,SAAM;AAAA;AAAA;AAGrB,eAAI,CAAAW,QAAI,EAAQ,eAAA,AAALpE,SAAK,CAAC,CAAAyD,SAAK,CAAC;AACvB,cAAIW,QAAI,AAAJ,EAAU,AAAH,CAAA/D,OAAG;AACZ,YAAAA,OAAG,AAAH,EAAU,AAAJ,CAAA+D,QAAI;AACX,WAAA;AALO,iBAAiB,AAAX,eAAI,CAAA,AAAVpE,SAAK,CAAM,CAAAyD,SAAK,CAAC,CAAA;AAAzB,UAAAA,SAAK,AAAL,EAAyB,AAAjB,MAAiB;AAM1B,SAAA;AAZI,QAAAN,UAAA,EAcN,AAdM,CAAA9C,OAcN;AAAA;AACF,UAAA,AArBH,KAuBK,AAvBC2D,YAAQ,WAuBT,CAAA7D,SAAS;AAAI,MAAAgD,UAAA,EAAY,AAM7B,wBAAAa,YAAA,EAAA7D,SAAA,EAAA,AAN6B;AAAA,UAAA,AAvB9B,KAwBE,MAAK,CAAA,AAAL,EAAK,CAAA,AAxBD6D,YAAQ,CAwBZ,CAAArB,KAAK;AAAI,MAAAQ,UAAA,EAAY,AAAZ,CAAAG,SAAK,CAAO;AAAA,UAAA,AAxBvB,KAyBE,MAAK,CAAA,AAAL,EAAK,CAAA,AAzBDU,YAAQ,CAyBZ,CAAApB,KAAK;AAAI,MAAAO,UAAA,EAAW,AAAX,CAAAG,SAAK,CAAM;AAAA,UAAA,AAzBtB,KA0BE,MAAI,CAAA,AAAJ,EAAI,CAAA,AA1BAU,YAAQ,CA0BZ,CAAAnB,IAAI;AAAI,MAAAM,UAAA,EAAY,AAAZ,CAAAG,SAAK,CAAO;AAAA;AAEZ,MAAAH,UAAA,EAAI,AAAJ,KAAI,CAAA;AAAR;AAEP,UAAA,AA/BmC,CAAAA,UAAA;AA+BnC,GAAA;AAlPkB;AAAA;AACc,aAAmB,EAAA,AAAnB,IAAmB,EAAA;AAAxC,SAAwCtB,QAAA,EAAA,AAAnB,MAAmB,CAAA;AAA5C;AAA4C,GAAA;AADjC;AAsSf,MAAAyB,SAAA,iBAmCmC,EAAA,AAnC7B;AACe;AAAG,QAAA,AAAd,CAAAe,cAAS,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAd,UAAS,AAAT,EAAwB,AAAxB;AAAA,eAAwB,CAAA,AAAxBA,cAAwB;AAAA;AACb;AAAG,QAAA,AAAd,CAAAC,cAAS,EAAQ,GAAQ,CAAA;AAAd;AAAG,YAAA,AAAd,UAAS,AAAT,EAAyB,AAAzB;AAAA,eAAyB,CAAA,AAAzBA,cAAyB;AAAA;AAClB;AAAG,QAAA,AAAV,CAAAC,UAAK,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAV,MAAK,AAAL,EAAoB,AAApB;AAAA,eAAoB,CAAA,AAApBA,UAAoB;AAAA;AACJ;AAAG,QAAA,AAAnB,CAAAC,mBAAc,EAAQ,GAAQ,CAAA;AAAd;AAAG,YAAA,AAAnB,eAAc,AAAd,EAA8B,AAA9B;AAAA,eAA8B,CAAA,AAA9BA,mBAA8B;AAAA;AACnB;AAAG,QAAA,AAAd,CAAAC,cAAS,EAAQ,IAAO,CAAA;AAAb;AAAG,YAAA,AAAd,UAAS,AAAT,EAAwB,AAAxB;AAAA,eAAwB,CAAA,AAAxBA,cAAwB;AAAA;AACZ;AAAG,QAAA,AAAf,CAAAC,eAAU,EAAQ,IAAO,CAAA;AAAb;AAAG,YAAA,AAAf,WAAU,AAAV,EAAyB,AAAzB;AAAA,eAAyB,CAAA,AAAzBA,eAAyB;AAAA;AACnB;AAAG,QAAA,AAAT,CAAAC,SAAI,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAT,KAAI,AAAJ,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,SAAmB;AAAA;AACd;AAAG,QAAA,AAAR,CAAAC,QAAG,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAR,IAAG,AAAH,EAAkB,AAAlB;AAAA,eAAkB,CAAA,AAAlBA,QAAkB;AAAA;AACF;AAAG,QAAA,AAAnB,CAAAC,mBAAc,EAAQ,IAAI,CAAA;AAAV;AAAG,YAAA,AAAnB,eAAc,AAAd,EAA0B,AAA1B;AAAA,eAA0B,CAAA,AAA1BA,mBAA0B;AAAA;AACV;AAAG,QAAA,AAAnB,CAAAC,mBAAc,EAAQ,IAAI,CAAA;AAAV;AAAG,YAAA,AAAnB,eAAc,AAAd,EAA0B,AAA1B;AAAA,eAA0B,CAAA,AAA1BA,mBAA0B;AAAA;AAClB;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACb;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACb;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACb;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,IAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACZ;AAAG,QAAA,AAAZ,CAAAC,YAAO,EAAQ,GAAQ,CAAA;AAAd;AAAG,YAAA,AAAZ,QAAO,AAAP,EAAuB,AAAvB;AAAA,eAAuB,CAAA,AAAvBA,YAAuB;AAAA;AACjB;AAAG,QAAA,AAAT,CAAAC,SAAI,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAT,KAAI,AAAJ,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,SAAmB;AAAA;AACb;AAAG,QAAA,AAAT,CAAAC,SAAI,EAAQ,IAAO,CAAA;AAAb;AAAG,YAAA,AAAT,KAAI,AAAJ,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,SAAmB;AAAA;AACb;AAAG,QAAA,AAAT,CAAAC,SAAI,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAT,KAAI,AAAJ,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,SAAmB;AAAA;AACT;AAAG,QAAA,AAAb,CAAAC,aAAQ,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAb,SAAQ,AAAR,EAAuB,AAAvB;AAAA,eAAuB,CAAA,AAAvBA,aAAuB;AAAA;AACZ;AAAG,QAAA,AAAd,CAAAC,cAAS,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAd,UAAS,AAAT,EAAwB,AAAxB;AAAA,eAAwB,CAAA,AAAxBA,cAAwB;AAAA;AACZ;AAAG,QAAA,AAAf,CAAAC,eAAU,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAf,WAAU,AAAV,EAAyB,AAAzB;AAAA,eAAyB,CAAA,AAAzBA,eAAyB;AAAA;AAClB;AAAG,QAAA,AAAV,CAAAC,UAAK,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAV,MAAK,AAAL,EAAoB,AAApB;AAAA,eAAoB,CAAA,AAApBA,UAAoB;AAAA;AACR;AAAG,QAAA,AAAf,CAAAC,eAAU,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAf,WAAU,AAAV,EAAyB,AAAzB;AAAA,eAAyB,CAAA,AAAzBA,eAAyB;AAAA;AACZ;AAAG,QAAA,AAAhB,CAAAC,gBAAW,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAhB,YAAW,AAAX,EAA0B,AAA1B;AAAA,eAA0B,CAAA,AAA1BA,gBAA0B;AAAA;AACpB;AAAG,QAAA,AAAT,CAAAC,SAAI,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAT,KAAI,AAAJ,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,SAAmB;AAAA;AACd;AAAG,QAAA,AAAR,CAAAC,QAAG,EAAQ,EAAQ,CAAA;AAAd;AAAG,YAAA,AAAR,IAAG,AAAH,EAAmB,AAAnB;AAAA,eAAmB,CAAA,AAAnBA,QAAmB;AAAA;AACZ;AAAG,QAAA,AAAV,CAAAC,UAAK,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAV,MAAK,AAAL,EAAoB,AAApB;AAAA,eAAoB,CAAA,AAApBA,UAAoB;AAAA;AACZ;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACb;AAAG,QAAA,AAAX,CAAAC,WAAM,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAX,OAAM,AAAN,EAAqB,AAArB;AAAA,eAAqB,CAAA,AAArBA,WAAqB;AAAA;AACd;AAAG,QAAA,AAAV,CAAAC,UAAK,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAV,MAAK,AAAL,EAAoB,AAApB;AAAA,eAAoB,CAAA,AAApBA,UAAoB;AAAA;AACN;AAAG,QAAA,AAAjB,CAAAC,iBAAY,EAAQ,MAAM,CAAA;AAAZ;AAAG,YAAA,AAAjB,aAAY,AAAZ,EAA0B,AAA1B;AAAA,eAA0B,CAAA,AAA1BA,iBAA0B;AAAA;AACZ;AAAG,QAAA,AAAjB,CAAAC,iBAAY,EAAQ,MAAM,CAAA;AAAZ;AAAG,YAAA,AAAjB,aAAY,AAAZ,EAA0B,AAA1B;AAAA,eAA0B,CAAA,AAA1BA,iBAA0B;AAAA;AACT;AAAG,QAAA,AAApB,CAAAC,oBAAe,EAAQ,MAAO,CAAA;AAAb;AAAG,YAAA,AAApB,gBAAe,AAAf,EAA8B,AAA9B;AAAA,eAA8B,CAAA,AAA9BA,oBAA8B;AAAA;AACnB;AAAG,QAAA,AAAd,CAAAC,cAAS,EAAQ,MAAM,CAAA;AAAZ;AAAG,YAAA,AAAd,UAAS,AAAT,EAAuB,AAAvB;AAAA,eAAuB,CAAA,AAAvBA,cAAuB;AAAA;AACX;AAAG,QAAA,AAAf,CAAAC,eAAU,EAAQ,GAAO,CAAA;AAAb;AAAG,YAAA,AAAf,WAAU,AAAV,EAAyB,AAAzB;AAAA,eAAyB,CAAA,AAAzBA,eAAyB;AAAA,GAAA;AAnC7B;AAAA;AAAA;AAAA;AAAA,CAmC6B;AAvlBF,MAAAhE,SAAA,iBAAsB,CAAA,AAD5CtC,OAAA,CAC4C;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAA3C;AAAO,MAAA,AAAlB,MAAI,CAAAsC,KAAK,EAAiD,IAAI,CAAAA,SAAK,EAAI;AACzC,MAAAC,OAAA,iBAAoB,CAAA,AAFxCvC,OAAA,CAEwC;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAAzC;AAAO,MAAA,AAAhB,MAAI,CAAAuC,GAAG,EAA+C,IAAI,CAAAA,OAAG,EAAI;AACnC,MAAAC,OAAA,iBAAoB,CAAA,AAHxCxC,OAAA,CAGwC;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAAzC;AAAO,MAAA,AAAhB,MAAI,CAAAwC,GAAG,EAA+C,IAAI,CAAAA,OAAG,EAAI;AAMhE,MAAAC,gBAAA,iBAA6B,CAAA,AATpBzC,OAAA,CASoB;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AADZ;AAAO,MAAA,AAAzB,MAAI,CAAAyC,YAAY,EACkB,IAAI,CAAAA,gBAAY,EACxD;AAIO,MAAAC,SAAA,iBAAyB,CAAA,AAFhBzC,UAAA,CAEgB;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AADf;AAAU,MAAA,AAArB,MAAI,CAAAyC,KAAK,EACqB,IAAI,CAAAA,SAAK,EAC7C;AAEO,MAAAC,SAAA,iBAAyB,CAAA,AALhB1C,UAAA,CAKgB;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AADf;AAAU,MAAA,AAArB,MAAI,CAAA0C,KAAK,EACqB,IAAI,CAAAA,SAAK,EAC7C;AAEO,MAAAC,QAAA,iBAAwB,CAAA,AARf3C,UAAA,CAQe;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AADf;AAAU,MAAA,AAApB,MAAI,CAAA2C,IAAI,EACqB,IAAI,CAAAA,QAAI,EAC3C;AAofD,+BA0CC;AA1CD,QAAI,CAAA2D,oBAAgB,AAApB,EA0CC,AA1CiC;AASD,WAAoB;AACpB,WAAoB;AACpB,WAAoB,CAAA;AAD5C,YAAA;AADA,YAAA;AADuB,YAAA;AADL,YAAA;AADD;AAyBA,YAAA;AADO,YAAA;AADD,YAAA;AADL,YAAA;AADK,YAAA;AADD,YAAA;AADD,YAAA;AADJ,YAAA;AADA,YAAA;AADA,YAAA;AADD,YAAA;AADO,YAAA;AADD,YAAA;AADJ,YAAA;AADI,YAAA;AADA,YAAA;AAJvB,WAED,CAAA;AAbL,OAAI,CAAAhD,eAAW,EAAG,GAAsB;AAChC,KAAC,CAAAP,QAAI,EAAG,EAAC,CAAA;AAAjB,SAAmBA,QAAI,AAAJ,EAAW,AAAJ,IAAI;AAIxB,QAAAA,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAClB,UAAAL,QAAI,AAAJ,IAAmB,AAAX,CAAAK,SAAK,CAAM;AAAA;AAAA;AACnB,YAAAL,QAAI,AAAJ,IAAwB,AAAhB,CAAAK,SAAK,CAAW;AAAA;AAAA;AACvB,cAAAA,SAAK,CAAO,MAAA,AAAZ,GAAoB,AAAJ,CAAAL,QAAI;AAAI,mBAAoB,AAApB,CAAAA,QAAI,AAAJ,GAAoB,AAAZ,CAAAK,SAAK,CAAO;AAAA;AAAA;AAAA,WAAA;AAA7C,cAAC;AAAA;AAAA;AACA,gBAAAA,SAAK,CAAO,MAAA,AAAZ,GAAoB,AAAJ,CAAAL,QAAI;AAAI,qBAAoB,AAApB,CAAAA,QAAI,AAAJ,GAAoB,AAAZ,CAAAK,SAAK,CAAO;AAAA;AAAA;AAAA,aAAA;AAA7C,gBAAC;AAAA;AAAA;AACA,kBAAAA,SAAK,CAAO,MAAA,AAAZ,GAAoB,AAAJ,CAAAL,QAAI;AAAI,uBAAoB,AAApB,CAAAA,QAAI,AAAJ,GAAoB,AAAZ,CAAAK,SAAK,CAAO;AAAA;AAAA;AAAA,eAAA;AAA5C;AAAA,aAAA;AADD;AAAA,WAAA;AADA;AAAA,SAAA;AADA;AAAA,OAAA;AADA;AAAA,KAAA;AAHF,QAEE;AAOA,aAAa,AAAb,EAAa;AACd,YAAA;AAEC,UAAAL,QAAI,AAAJ,IAAuB,AAAf,CAAAK,SAAK,CAAU;AAAA;AAAA;AACvB,YAAAL,QAAI,AAAJ,IAAuB,AAAf,CAAAK,SAAK,CAAU;AAAA;AAAA;AACvB,cAAAL,QAAI,AAAJ,IAAmB,AAAX,CAAAK,SAAK,CAAM;AAAA;AAAA;AACnB,gBAAAL,QAAI,AAAJ,IAAuB,AAAf,CAAAK,SAAK,CAAU;AAAA;AAAA;AACvB,kBAAAL,QAAI,AAAJ,IAAwB,AAAhB,CAAAK,SAAK,CAAW;AAAA;AAAA;AACxB,oBAAAL,QAAI,AAAJ,IAAiB,AAAT,CAAAK,SAAK,CAAI;AAAA;AAAA;AACjB,sBAAAL,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAClB,wBAAAL,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAClB,0BAAAL,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAClB,4BAAAL,QAAI,AAAJ,IAAsB,AAAd,CAAAK,SAAK,CAAS;AAAA;AAAA;AACtB,8BAAAL,QAAI,AAAJ,IAAuB,AAAf,CAAAK,SAAK,CAAU;AAAA;AAAA;AACvB,gCAAAL,QAAI,AAAJ,IAAwB,AAAhB,CAAAK,SAAK,CAAW;AAAA;AAAA;AACxB,kCAAAL,QAAI,AAAJ,IAAmB,AAAX,CAAAK,SAAK,CAAM;AAAA;AAAA;AACnB,oCAAAL,QAAI,AAAJ,IAAwB,AAAhB,CAAAK,SAAK,CAAW;AAAA;AAAA;AACxB,sCAAAL,QAAI,AAAJ,IAAyB,AAAjB,CAAAK,SAAK,CAAY;AAAA;AAAA;AACzB,wCAAAL,QAAI,AAAJ,IAAkB,AAAV,CAAAK,SAAK,CAAK;AAAA;AAAA;AAClB,6CAAmB,AAAnB,CAAAL,QAAI,AAAJ,IAAmB,AAAX,CAAAK,SAAK,CAAM;AAAA,qCAAA;AADnB;AAAA,mCAAA;AADA;AAAA,iCAAA;AADA;AAAA,+BAAA;AADA;AAAA,6BAAA;AADA;AAAA,2BAAA;AADA;AAAA,yBAAA;AADA;AAAA,uBAAA;AADA;AAAA,qBAAA;AADA;AAAA,mBAAA;AADA;AAAA,iBAAA;AADA;AAAA,eAAA;AADA;AAAA,aAAA;AADA;AAAA,WAAA;AADA;AAAA,SAAA;AADA;AAAA,OAAA;AAbF,UAYE;AAkBA,eAAiB,AAAjB,EAAiB;AAClB;AAEC,eAAkB,AAAlB,EAAkB;AACnB;AAAA,KAAA;AAnCS,sBAAG,CAAA,AAAfE,eAAW,CACT,MAkCC,CACF,CAAA;AArC6B,IAAAP,QAAI,AAAJ,EAAS,AAAT,CAAAA,QAAI,AAAJ,EAAQ,EAAC;AAsCxC;AACD,QAAY,sBAAM,CAAA,AAAlBO,eAAW,CAAS;AAAA,CACrB;AA9CG,4BAAW;AAAf,KAAI,CAAAA,eAAW,EAAG,CAAAgD,oBAAgB,EAAE,CAAA;AA5VhC,2BAAS;AAAb,KAAI,CAAA5E,aAAS,EAAG,IAAI,CAAAT,YAAS,EAAE,CAAA;AAzExB;AAEN,MAAA,AAFM,SAAI,CAAAsF,MAAM,AAAV,CAAW5G,QAAe,CAEhC,AAF6C;AAC5C,YAAI,CAAAe,QAAQ,CAAC,MAAkB,CAAA,AAAlB,MAAkB,CAAA,AAAlB,CAAC2B,KAAK,CAAE,CAAA1C,QAAI,CAAE,CAAA4C,GAAG,CAAC,EAAC;AAAA,CACjC;AAEM;AAEN,MAAA,AAFM,SAAI,CAAAiE,SAAS,AAAb,CAAc7G,QAAe,CAAE,CAAAc,aAA0B,CAE/D,AAFyE,EAAA;AAApC,MAAAA,aAA0B;AAAA,MAAAA,aAAA,WAAA;AAAL,IAAAA,aAAA,EAAK,AAAL,MAAK;AAAA;AAAA,IAAAA,aAAA,GAAAA,aAAA;AAAA;AAC9D,YAAE,CAAAD,MAAA,CAAAb,QAAI,CAAO,EAAC,CAAO,KAAI,CAAE,CAAAc,aAAS,CAAE;AAAA,CACvC;AAEM;AAEN,MAAA,AAFM,SAAI,CAAAgG,QAAQ,AAAZ,CAAa9G,QAAe,CAAE,CAAAc,aAA0B,CAE9D,AAFwE,EAAA;AAApC,MAAAA,aAA0B;AAAA,MAAAA,aAAA,WAAA;AAAL,IAAAA,aAAA,EAAK,AAAL,MAAK;AAAA;AAAA,IAAAA,aAAA,GAAAA,aAAA;AAAA;AAC7D,YAAE,CAAAD,MAAA,CAAAb,QAAI,CAAO,EAAC,CAAO,EAAC,CAAE,CAAAc,aAAS,CAAE;AAAA,CACpC" }

package/temporal.js

@@ -1,59 +1,109 @@
 import {
-  modIntInt as modIntInt_299, listify as listify_69, intToString as intToString_190, stringCodePoints as stringCodePoints_140, strCat as strCat_129
+  JsonProducer as JsonProducer_1006, JsonSyntaxTree as JsonSyntaxTree_1011, InterchangeContext as InterchangeContext_1012, JsonAdapter as JsonAdapter_1013, JsonString as JsonString_1021
+} from "./json.js";
+import {
+  type as type__1014, requireInstanceOf as requireInstanceOf__1022, modIntInt as modIntInt_1029, stringGet as stringGet_1040, stringNext as stringNext_1041, stringCountBetween as stringCountBetween_1043
 } from "@temperlang/core";
-// Type nym`std//temporal.temper.md`.Date connected to globalThis.Date
+class DateJsonAdapter_1001 extends type__1014(JsonAdapter_1013) {
+  /**
+   * @param {globalThis.Date} x_1003
+   * @param {JsonProducer_1006} p_1004
+   */
+  encodeToJson(x_1003, p_1004) {
+    encodeToJson_1005(x_1003, p_1004);
+    return;
+  }
+  /**
+   * @param {JsonSyntaxTree_1011} t_1008
+   * @param {InterchangeContext_1012} ic_1009
+   * @returns {globalThis.Date}
+   */
+  decodeFromJson(t_1008, ic_1009) {
+    return decodeFromJson_1010(t_1008, ic_1009);
+  }
+  constructor() {
+    super ();
+    return;
+  }
+}
+// Type `std/temporal/`.Date connected to globalThis.Date
+/**
+ * @param {globalThis.Date} this_1015
+ * @param {JsonProducer_1006} p_1016
+ */
+function encodeToJson_1005(this_1015, p_1016) {
+  let t_1017 = this_1015.toISOString().split("T")[0];
+  p_1016.stringValue(t_1017);
+  return;
+}
+/**
+ * @param {JsonSyntaxTree_1011} t_1018
+ * @param {InterchangeContext_1012} ic_1019
+ * @returns {globalThis.Date}
+ */
+function decodeFromJson_1010(t_1018, ic_1019) {
+  let t_1020;
+  t_1020 = requireInstanceOf__1022(t_1018, JsonString_1021);
+  return new (globalThis.Date)(globalThis.Date.parse(t_1020.content));
+}
+/** @returns {JsonAdapter_1013<globalThis.Date>} */
+function jsonAdapter_1023() {
+  return new DateJsonAdapter_1001();
+}
 /** @type {Array<number>} */
-const daysInMonth_294 = listify_69(0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);
+const daysInMonth_1024 = Object.freeze([0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]);
 /**
- * @param {number} year_296
+ * @param {number} year_1026
  * @returns {boolean}
  */
-function isLeapYear_295(year_296) {
-  let return_297;
-  let t_298;
-  if (modIntInt_299(year_296, 4) === 0) {
-    if (modIntInt_299(year_296, 100) !== 0) {
-      return_297 = true;
+function isLeapYear_1025(year_1026) {
+  let return_1027;
+  let t_1028;
+  if (modIntInt_1029(year_1026, 4) === 0) {
+    if (modIntInt_1029(year_1026, 100) !== 0) {
+      return_1027 = true;
     } else {
-      t_298 = modIntInt_299(year_296, 400);
-      return_297 = t_298 === 0;
+      t_1028 = modIntInt_1029(year_1026, 400);
+      return_1027 = t_1028 === 0;
     }
   } else {
-    return_297 = false;
+    return_1027 = false;
   }
-  return return_297;
+  return return_1027;
 }
 /**
- * @param {string} padding_301
- * @param {number} num_302
- * @returns {string}
+ * @param {number} minWidth_1031
+ * @param {number} num_1032
+ * @param {globalThis.Array<string>} sb_1033
  */
-function pad_300(padding_301, num_302) {
-  let return_303;
-  let t_304;
-  const decimal_305 = intToString_190(num_302, 10);
-  let t_306 = stringCodePoints_140(decimal_305);
-  let decimalCodePoints_307 = t_306;
-  let sign_308;
-  if (decimalCodePoints_307.read() === 45) {
-    sign_308 = "-";
-    t_304 = decimalCodePoints_307.advance(1);
-    decimalCodePoints_307 = t_304;
+function padTo_1030(minWidth_1031, num_1032, sb_1033) {
+  let t_1034;
+  let t_1035;
+  let t_1036;
+  const decimal_1037 = num_1032.toString(10);
+  let decimalIndex_1038 = 0;
+  const decimalEnd_1039 = decimal_1037.length;
+  if (decimalIndex_1038 < decimalEnd_1039) {
+    t_1034 = stringGet_1040(decimal_1037, decimalIndex_1038);
+    t_1036 = t_1034 === 45;
   } else {
-    sign_308 = "";
+    t_1036 = false;
   }
-  const paddingCp_309 = stringCodePoints_140(padding_301);
-  const nNeeded_310 = paddingCp_309.length - decimalCodePoints_307.length;
-  if (nNeeded_310 <= 0) {
-    return_303 = decimal_305;
-  } else {
-    const pad_311 = paddingCp_309.limit(nNeeded_310).toString();
-    const decimalOnly_312 = decimalCodePoints_307.toString();
-    return_303 = strCat_129(sign_308, pad_311, decimalOnly_312);
+  if (t_1036) {
+    sb_1033[0] += "-";
+    t_1035 = stringNext_1041(decimal_1037, decimalIndex_1038);
+    decimalIndex_1038 = t_1035;
+  }
+  let t_1042 = stringCountBetween_1043(decimal_1037, decimalIndex_1038, decimalEnd_1039);
+  let nNeeded_1044 = minWidth_1031 - t_1042;
+  while (nNeeded_1044 > 0) {
+    sb_1033[0] += "0";
+    nNeeded_1044 = nNeeded_1044 - 1;
   }
-  return return_303;
+  sb_1033[0] += decimal_1037.substring(decimalIndex_1038, decimalEnd_1039);
+  return;
 }
 /** @type {Array<number>} */
-const dayOfWeekLookupTableLeapy_313 = listify_69(0, 0, 3, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6);
+const dayOfWeekLookupTableLeapy_1045 = Object.freeze([0, 0, 3, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6]);
 /** @type {Array<number>} */
-const dayOfWeekLookupTableNotLeapy_314 = listify_69(0, 0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5);
+const dayOfWeekLookupTableNotLeapy_1046 = Object.freeze([0, 0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5]);

package/temporal.js.map

@@ -1 +1 @@
-{ "version": 3, "file": "js/std/temporal.js", "sources": [ "std/temporal.temper.md" ], "sourcesContent": [ "# Temporal\n\nWe're creating an initial Date type to help with developing\nTemper's machinery to connect to existing Date types in\ntarget languages.\n\nSome facts about the Gregorian calendar.\n\n    /** Indexed by the month number: 1 = January */\n    let daysInMonth = [\n      0,\n      /* January   */ 31,\n      /* February  */ 28, // Special case leap days\n      /* March     */ 31,\n      /* April     */ 30,\n      /* May       */ 31,\n      /* June      */ 30,\n      /* July      */ 31,\n      /* August    */ 31,\n      /* September */ 30,\n      /* October   */ 31,\n      /* November  */ 30,\n      /* December  */ 31,\n    ];\n\n    let isLeapYear(year: Int): Boolean {\n       year % 4 == 0 \u0026\u0026 (year % 100 != 0 || year % 400 == 0)\n    }\n\n    /**\n     * If the decimal representation of \\|num\\| is longer than [padding],\n     * then that representation.\n     * Otherwise any sign for [num] followed by the prefix of [padding]\n     * that would bring the integer portion up to the length of [padding].\n     *\n     * ```temper\n     * pad(\u00220000\u0022, 123) == \u00220123\u0022) \u0026\u0026\n     * pad(\u0022000\u0022, 123) == \u0022123\u0022) \u0026\u0026\n     * pad(\u002200\u0022, 123) == \u0022123\u0022) \u0026\u0026\n     * pad(\u00220000\u0022, -123) == \u0022-0123\u0022) \u0026\u0026\n     * pad(\u0022000\u0022, -123) == \u0022-123\u0022) \u0026\u0026\n     * pad(\u002200\u0022, -123) == \u0022-123\u0022)\n     * ```\n     */\n    let pad(padding: String, num: Int): String {\n      let decimal = num.toString(10);\n      var decimalCodePoints = decimal.codePoints;\n      let sign: String;\n      if (decimalCodePoints.read() == 45 /* - */) {\n        sign = \u0022-\u0022;\n        decimalCodePoints = decimalCodePoints.advance(1);\n      } else {\n        sign = \u0022\u0022;\n      }\n      let paddingCp = padding.codePoints;\n      let nNeeded = paddingCp.length - decimalCodePoints.length;\n      if (nNeeded \u003c= 0) {\n        decimal\n      } else {\n        let pad = paddingCp.limit(nNeeded).toString();\n        let decimalOnly = decimalCodePoints.toString();\n        \u0022\u0024{sign}\u0024{pad}\u0024{decimalOnly}\u0022\n      }\n    }\n\n    // Relates months (one-indexed) to numbers used in day-of-week\n    // computations non-leapy.\n    let dayOfWeekLookupTableLeapy: List\u003cInt\u003e = [\n      0, // Not a month\n      0, 3, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6,\n    ];\n    let dayOfWeekLookupTableNotLeapy: List\u003cInt\u003e = [\n      0, // Not a month\n      0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5,\n    ];\n\nHere's just enough of a Date type to get us started.\n\n    /**\n     * A Date identifies a day in the proleptic Gregorian calendar.\n     * It is unconnected to a time of day or a timezone.\n     */\n    @connected(\u0022Date\u0022)\n    export class Date {\n      /** The year.  1900 means 1900. */\n      @connected(\u0022Date::getYear\u0022)\n      public year: Int;\n      /** The month of the year in [1, 12]. */\n      @connected(\u0022Date::getMonth\u0022)\n      public month: Int;\n      /**\n       * The day of the month in [1, 31]\n       * additionally constrained by the length of [month].\n       */\n      @connected(\u0022Date::getDay\u0022)\n      public day: Int;\n\n      @connected(\u0022Date::constructor\u0022)\n      public constructor(year: Int, month: Int, day: Int): Void | Bubble {\n        if (1 \u003c= month \u0026\u0026 month \u003c= 12 \u0026\u0026\n            1 \u003c= day \u0026\u0026 (\n              (month != 2 || day != 29)\n              ? day \u003c= daysInMonth[month]\n              : isLeapYear(year))) {\n          this.year = year;\n          this.month = month;\n          this.day = day;\n        } else {\n          bubble();\n        }\n      }\n\n      /** An ISO 8601 Date string with dashes like \u00222000-12-31\u0022. */\n      @connected(\u0022Date::toString\u0022)\n      public toString(): String {\n         \u0022\u0024{pad(\u00220000\u0022, year)\n        }-\u0024{pad(\u002200\u0022,   month)\n        }-\u0024{pad(\u002200\u0022,   day)}\u0022\n      }\n\n      /**\n       * The count of whole years between the two dates.\n       *\n       * Think of this as floor of the magnitude of a range:\n       *\n       *     ⌊ [start, end] ⌋\n       *\n       * If you think of it as subtraction, you have to reverse\n       * the order of arguments.\n       *\n       *     ⌊ end - start ⌋, NOT ⌊ start - end ⌋\n       *\n       * \u0022Whole year\u0022 is based on month/day calculations, not\n       * day-of-year.  This means that there is one full year\n       * between 2020-03-01 and 2021-03-01 even though, because\n       * February of 2020 has 29 days, 2020-03-01 is the 61st\n       * day of 2020 but 2021-03-01 is only the 60th day of\n       * that year.\n       */\n      @connected(\u0022Date::yearsBetween\u0022)\n      public static let yearsBetween(start: Date, end: Date): Int {\n        let yearDelta = end.year - start.year;\n        let monthDelta = end.month - start.month;\n        yearDelta - (\n            // If the end month/day is before the start's then we\n            // don't have a full year.\n            (monthDelta \u003c 0 || monthDelta == 0 \u0026\u0026 end.day \u003c start.day)\n            ? 1 : 0)\n      }\n\n      /** Today's date in UTC */\n      // TODO: take a zone\n      @connected(\u0022Date::today\u0022)\n      public static let today(): Date;\n\n      /**\n       * ISO 8601 weekday number.\n       *\n       * | Number | Weekday  |\n       * | ------ | -------- |\n       * |      1 | Monday   |\n       * |      2 | Tuesday  |\n       * |      3 | Monday   |\n       * |      4 | Thursday |\n       * |      5 | Friday   |\n       * |      6 | Saturday |\n       * |      7 | Sunday   |\n       */\n      @connected(\u0022Date::getDayOfWeek\u0022)\n      public get dayOfWeek(): Int {\n        // Gauss's method.\n        let y = year;\n        let c = if (y \u003e= 0) { y / 100 } else { -(-y / 100) };\n        let yy = y - (c * 100);\n        // See note below about avoiding negative modulus to see why\n        // some of the offsets differ from Wikipedia's rendering of\n        // Gauss's formula.\n        let janFirst = (8 + 5*((yy + 3) % 4) + 3*(yy - 1) + 5*(c % 4)) % 7;\n        let table = if (isLeapYear(y)) {\n          dayOfWeekLookupTableLeapy\n        } else {\n          dayOfWeekLookupTableNotLeapy\n        };\n        let monthOffset = table[month];\n        // Gauss's method produces a number in 0..6 but\n        // ISO assigns 1..7 where all values are the same\n        // except that Sunday is 7 instead of 0.\n        // Below we do (day + 6) since that is equivalent to\n        // (day - 1) where we end up % 7 but avoids any chance\n        // of a negative left operand to `%`.\n        let gaussWeekday = (janFirst + (day + 6) + monthOffset) % 7;\n        gaussWeekday == 0 ? 7 : gaussWeekday\n      }\n    };\n\nTODO: an auto-balancing Date builder.\nParse from ISO\nOther temporal values\nDay of week\n" ], "names": [ "daysInMonth", "isLeapYear", "year", "return", "pad", "padding", "num", "decimal", "decimalCodePoints", "sign", "paddingCp", "nNeeded", "decimalOnly", "dayOfWeekLookupTableLeapy", "dayOfWeekLookupTableNotLeapy" ], "mappings": "AASI;AAAA;AAAA;AA0Ea,sEA6GV;AAvLC,4BAAW;AAAf,KAAI,CAAAA,eAAW,EAAG,WAAC,CACjB,CAAC,CACe,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACF,GAAE,CACnB;AAED,yDAEC;AAFD,QAAI,CAAAC,cAAU,AAAd,CAAeC,QAAS,CAEvB,AAFkC,EAAA;AAAR,MAAAC,UAAO;AACM,WAAU,CAAA;AAA/C,MAAK,aAAC,CAAA,AAAND,QAAI,CAAG,EAAC,KAAI,EAAC;AAAK,QAAK,aAAC,CAAA,AAANA,QAAI,CAAG,IAAG,KAAI,EAAC;AAAA,MAAAC,UAAA;AAAA;AAAI,aAAU,AAAL,cAAC,CAAA,AAAND,QAAI,CAAG,IAAG,EAAA;AAAV,MAAAC,UAAA,EAAe,AAAf,MAAU,IAAI,EAAC;AAAA;AAAA;AAAC,IAAAA,UAAA;AAAA;AACvD,QAAA,AAF0B,CAAAA,UAAA;AAE1B;AAiBD,sFAmBC;AAnBD,QAAI,CAAAC,OAAG,AAAP,CAAQC,WAAe,CAAE,CAAAC,OAAQ,CAmBhC,AAnB0C,EAAA;AAAP,MAAAH,UAAM;AAMlB,WAA4B,CAAA;AALlD,OAAI,CAAAI,WAAO,EAAO,gBAAQ,CAAA,AAAZD,OAAG,CAAU,GAAE,CAAC;AACN,WAAkB,EAAA,AAAV,qBAAU,CAAA,AAAlBC,WAAO,CAAW,CAAA;AAAvC,KAAC,CAAAC,qBAAiB,EAAG,MAAkB;AAC1C,KAAI,CAAAC,QAAY;AACZ,MAAkB,AAAlBD,qBAAiB,CAAC,IAAI,EAAE,IAAI,GAAE;AAChC,IAAAC,QAAI,AAAJ,EAAU,AAAH,IAAG;AACU,WAA4B,AAA5B,CAAAD,qBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAAhD,IAAAA,qBAAiB,AAAjB,EAAgD,AAA5B,MAA4B;AACjD;AACC,IAAAC,QAAI,AAAJ,EAAS,AAAF,GAAE;AAAA;AAEX,OAAI,CAAAC,aAAS,EAAW,qBAAU,CAAA,AAAlBL,WAAO,CAAW;AAClC,OAAI,CAAAM,WAAO,EAAG,CAAAD,aAAS,CAAO,MAAA,AAAhB,EAAmB,CAAAF,qBAAiB,CAAO;AAAA,MACrDG,WAAO,GAAI,EAAC;AACd,IAAAR,UAAA,EAAO,AAAP,CAAAI,WAAO;AAAA;AAEP,SAAI,CAAAH,OAAG,EAA4B,AAAzB,CAAAM,aAAS,CAAC,KAAK,CAACC,WAAO,CAAC,CAAC,QAAQ,EAAE;AAC7C,SAAI,CAAAC,eAAW,EAAqB,AAAlB,CAAAJ,qBAAiB,CAAC,QAAQ,EAAE;AAC9C,IAAAL,UAAA,EAA6B,AAA7B,YAAGM,QAAI,CAAG,CAAAL,OAAG,CAAG,CAAAQ,eAAW,CAAE;AAC9B;AACF,QAAA,AAnBmC,CAAAT,UAAA;AAmBnC;AAI8B,4BAAS;AAAxC,KAAI,CAAAU,6BAAyB,EAAc,WAAC,CAC1C,CAAC,CACD,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CACnC;AACiC,4BAAS;AAA3C,KAAI,CAAAC,gCAA4B,EAAc,WAAC,CAC7C,CAAC,CACD,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CAAE,EAAC,CACnC" }
+{ "version": 3, "file": "js/std/temporal.js", "sourceRoot": "std/", "sources": [ "temporal/temporal.temper.md", "json/json.temper.md" ], "sourcesContent": [ "# Temporal\n\nWe're creating an initial Date type to help with developing\nTemper's machinery to connect to existing Date types in\ntarget languages.\n\nSome facts about the Gregorian calendar.\n\n    /** Indexed by the month number: 1 = January */\n    let daysInMonth = [\n      0,\n      /* January   */ 31,\n      /* February  */ 28, // Special case leap days\n      /* March     */ 31,\n      /* April     */ 30,\n      /* May       */ 31,\n      /* June      */ 30,\n      /* July      */ 31,\n      /* August    */ 31,\n      /* September */ 30,\n      /* October   */ 31,\n      /* November  */ 30,\n      /* December  */ 31,\n    ];\n\n    let isLeapYear(year: Int): Boolean {\n       year % 4 == 0 \u0026\u0026 (year % 100 != 0 || year % 400 == 0)\n    }\n\n    /**\n     * If the decimal representation of \\|num\\| is longer than [minWidth],\n     * then appends that representation.\n     * Otherwise any sign for [num] followed by enough zeroes to bring the\n     * whole length up to [minWidth].\n     *\n     * ```temper\n     * // When the width is greater than the decimal's length,\n     * // we pad to that width.\n     * \u00220123\u0022 == do {\n     *   let sb = new StringBuilder();\n     *   padTo(4, 123, sb);\n     *   sb.toString()\n     * }\n     *\n     * // When the width is the same or lesser, we just use the string form.\n     * \u0022123\u0022 == do {\n     *   let sb = new StringBuilder();\n     *   padTo(2, 123, sb);\n     *   sb.toString()\n     * }\n     *\n     * // The sign is always on the left.\n     * \u0022-01\u0022 == do {\n     *   let sb = new StringBuilder();\n     *   padTo(3, -1, sb);\n     *   sb.toString()\n     * }\n     * ```\n     */\n    let padTo(minWidth: Int, num: Int, sb: StringBuilder): Void {\n      let decimal = num.toString(10);\n      var decimalIndex = String.begin;\n      let decimalEnd = decimal.end;\n      if (decimalIndex \u003c decimalEnd \u0026\u0026 decimal[decimalIndex] == char'-') {\n        sb.append(\u0022-\u0022);\n        decimalIndex = decimal.next(decimalIndex);\n      }\n      var nNeeded = minWidth - decimal.countBetween(decimalIndex, decimalEnd);\n      while (nNeeded \u003e 0) {\n        sb.append('0');\n        nNeeded -= 1;\n      }\n      sb.appendBetween(decimal, decimalIndex, decimalEnd);\n    }\n\n    // Relates months (one-indexed) to numbers used in day-of-week\n    // computations non-leapy.\n    let dayOfWeekLookupTableLeapy: List\u003cInt\u003e = [\n      0, // Not a month\n      0, 3, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6,\n    ];\n    let dayOfWeekLookupTableNotLeapy: List\u003cInt\u003e = [\n      0, // Not a month\n      0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5,\n    ];\n\nHere's just enough of a Date type to get us started.\n\n    /**\n     * A Date identifies a day in the proleptic Gregorian calendar.\n     * It is unconnected to a time of day or a timezone.\n     */\n    @json\n    @connected(\u0022Date\u0022)\n    export class Date {\n      /** The year.  1900 means 1900. */\n      @connected(\u0022Date::getYear\u0022)\n      public year: Int;\n      /** The month of the year in [1, 12]. */\n      @connected(\u0022Date::getMonth\u0022)\n      public month: Int;\n      /**\n       * The day of the month in [1, 31]\n       * additionally constrained by the length of [month].\n       */\n      @connected(\u0022Date::getDay\u0022)\n      public day: Int;\n\n      @connected(\u0022Date::constructor\u0022)\n      public constructor(year: Int, month: Int, day: Int): Void | Bubble {\n        if (1 \u003c= month \u0026\u0026 month \u003c= 12 \u0026\u0026\n            1 \u003c= day \u0026\u0026 (\n              if (month != 2 || day != 29) {\n                day \u003c= daysInMonth[month]\n              } else {\n                isLeapYear(year)\n              })) {\n          this.year = year;\n          this.month = month;\n          this.day = day;\n        } else {\n          bubble();\n        }\n      }\n\n      /** An ISO 8601 Date string with dashes like \u00222000-12-31\u0022. */\n      @connected(\u0022Date::toString\u0022)\n      public toString(): String {\n        let sb = new StringBuilder();\n        padTo(4, year, sb);\n        sb.append(\u0022-\u0022);\n        padTo(2, month, sb);\n        sb.append(\u0022-\u0022);\n        padTo(2, day, sb);\n        return sb.toString();\n      }\n\n      /** Parses a Date from an ISO 8601 Date string with dashes like \u00222000-12-21\u0022. */\n      @connected(\u0022Date::fromIsoString\u0022)\n      public static fromIsoString(isoString: String): Date | Bubble {\n        let end = isoString.end;\n        var strIndex = isoString.prev(isoString.prev(end));\n        // strIndex at '^'\n        // YYYY-MM-^DD\n        let beforeDay = strIndex;\n        strIndex = isoString.prev(strIndex);\n        // YYYY-MM^-DD\n        let afterMonth = strIndex;\n        if (!isoString.hasIndex(afterMonth) || isoString[strIndex] != char'-') {\n          bubble();\n        }\n        strIndex = isoString.prev(isoString.prev(strIndex));\n        // YYYY-^MM-DD\n        let beforeMonth = strIndex;\n        strIndex = isoString.prev(strIndex);\n        // YYYY^-MM-DD\n        if (isoString[strIndex] != char'-' ||\n            !isoString.hasAtLeast(String.begin, strIndex, 4)) {\n          bubble();\n        }\n        let day   = isoString.slice(beforeDay,    end)       .toInt(10);\n        let month = isoString.slice(beforeMonth,  afterMonth).toInt(10);\n        let year  = isoString.slice(String.begin, strIndex)  .toInt(10);\n        return new Date(year, month, day);\n      }\n\n      /**\n       * The count of whole years between the two dates.\n       *\n       * Think of this as floor of the magnitude of a range:\n       *\n       *     ⌊ [start, end] ⌋\n       *\n       * If you think of it as subtraction, you have to reverse\n       * the order of arguments.\n       *\n       *     ⌊ end - start ⌋, NOT ⌊ start - end ⌋\n       *\n       * \u0022Whole year\u0022 is based on month/day calculations, not\n       * day-of-year.  This means that there is one full year\n       * between 2020-03-01 and 2021-03-01 even though, because\n       * February of 2020 has 29 days, 2020-03-01 is the 61st\n       * day of 2020 but 2021-03-01 is only the 60th day of\n       * that year.\n       */\n      @connected(\u0022Date::yearsBetween\u0022)\n      public static let yearsBetween(start: Date, end: Date): Int {\n        let yearDelta = end.year - start.year;\n        let monthDelta = end.month - start.month;\n        yearDelta - (\n            // If the end month/day is before the start's then we\n            // don't have a full year.\n            if (monthDelta \u003c 0 || monthDelta == 0 \u0026\u0026 end.day \u003c start.day) {\n              1\n            } else {\n              0\n            })\n      }\n\n      /** Today's date in UTC */\n      // TODO: take a zone\n      @connected(\u0022Date::today\u0022)\n      public static let today(): Date;\n\n      /**\n       * ISO 8601 weekday number.\n       *\n       * | Number | Weekday  |\n       * | ------ | -------- |\n       * |      1 | Monday   |\n       * |      2 | Tuesday  |\n       * |      3 | Monday   |\n       * |      4 | Thursday |\n       * |      5 | Friday   |\n       * |      6 | Saturday |\n       * |      7 | Sunday   |\n       */\n      @connected(\u0022Date::getDayOfWeek\u0022)\n      public get dayOfWeek(): Int {\n        // Gauss's method.\n        let y = year;\n        let c = if (y \u003e= 0) { y / 100 } else { -(-y / 100) };\n        let yy = y - (c * 100);\n        // See note below about avoiding negative modulus to see why\n        // some of the offsets differ from Wikipedia's rendering of\n        // Gauss's formula.\n        let janFirst = (8 + 5*((yy + 3) % 4) + 3*(yy - 1) + 5*(c % 4)) % 7;\n        let table = if (isLeapYear(y)) {\n          dayOfWeekLookupTableLeapy\n        } else {\n          dayOfWeekLookupTableNotLeapy\n        };\n        let monthOffset = table[month];\n        // Gauss's method produces a number in 0..6 but\n        // ISO assigns 1..7 where all values are the same\n        // except that Sunday is 7 instead of 0.\n        // Below we do (day + 6) since that is equivalent to\n        // (day - 1) where we end up % 7 but avoids any chance\n        // of a negative left operand to `%`.\n        let gaussWeekday = (janFirst + (day + 6) + monthOffset) % 7;\n        if (gaussWeekday == 0) { 7 } else { gaussWeekday }\n      }\n\n      public encodeToJson(p: JsonProducer): Void {\n        p.stringValue(toString());\n      }\n\n      public static decodeFromJson(\n        t: JsonSyntaxTree,\n        ic: InterchangeContext,\n      ): Date | Bubble {\n        Date.fromIsoString((t as JsonString).content)\n      }\n    };\n\nDates marshal to and from JSON via the ISO string form.\n\n    let {\n      InterchangeContext,\n      JsonProducer,\n      JsonString,\n      JsonSyntaxTree\n    } = import(\u0022../json\u0022);\n\nTODO: an auto-balancing Date builder.\nOther temporal values\nDay of week\n", "# JSON support\n\nThe `@json` decorator for Temper classes supports converting values to\nand from the JSON data interchange format.\n\nThis module provides JSON value representations to support\nunmarshalling, converting a JSON text to domain value(s), and it\nprovides a JSON builder to support marshalling domain values to JSON.\n\n## Standard\n\nFor the purposes of this document, \u0022JSON\u0022 is defined by [ECMA-404],\n\u0022*The JSON data interchange syntax*.\u0022\n\n## Context\n\nProducers and consumers may need to engage in [content negotiation].\n\nFor example, a marshaller might benefit from having access to a version\nheader from a Web API request to distinguish clients that can accept the\nlatest version from those that need a deprecated version.\n\n    export interface InterchangeContext {\n      public getHeader(headerName: String): String?;\n    }\n\nAnd for convenience, here's a blank interchange context.\n\n    export class NullInterchangeContext extends InterchangeContext {\n      public getHeader(headerName: String): String? { null }\n\n      public static instance = new NullInterchangeContext();\n    }\n\n## Marshalling support\n\n    export interface JsonProducer {\n      public interchangeContext: InterchangeContext;\n\n      // A JSON object value is specified by a start-object\n      // event, zero or more property key/value pairs\n      // (see below) and an end-object event.\n\n      public startObject(): Void;\n      public endObject(): Void;\n\n      // Within the start and end of an object\n      // you may have zero or more pairs of\n      // a property key followed by a nested value.\n\n      public objectKey(key: String): Void;\n\n      // To emit an array, start it, emit\n      // zero or more nested values, then end it.\n\n      public startArray(): Void;\n      public endArray(): Void;\n\n      // Emitters for simple values\n\n      public nullValue(): Void;\n      public booleanValue(x: Boolean): Void;\n\n      // Numeric values come in several flavours\n\n      public intValue(x: Int): Void;\n      public float64Value(x: Float64): Void;\n      /**\n       * A number that fits the JSON number grammar to allow\n       * interchange of numbers that are not easily represntible\n       * using numeric types that Temper connects to.\n       */\n      public numericTokenValue(x: String): Void;\n\n      public stringValue(x: String): Void;\n\n      public get parseErrorReceiver(): JsonParseErrorReceiver? { null }\n    }\n\nThis API does allow for specifying malformed JSON outputs as below.\nImplementations must allow for such specifications until allowing\nfor observation of the produced output.\nA streaming JSON implementation may treat flushing a portion of\noutput to an output channel as an observation and expose an error\nthen.\n\nAn implementation may choose to treat a number of top-level values\nother than one (`[] []`) as well-formed or malformed, for example to\nsupport related interchange formats like [JSON Lines].\n\nAn implementation may use a variety of strategies to represent\ntraditionally unrepresentable values like special floating point\n*NaN* (not a number) and ±infinities.\n\nAn implementation may use a variety of strategies to deal with\na valid JSON string value (whether used as a property key or a value)\nthat is not a [scalar value string], for example, because it contains a\nUTF-16 surrogate that is not part of a well-formed surrogate pair.\n\n```temper inert\n//// Malformed object\nmyJsonProducer1.startObject();\n// no end for object or array\n\n// misisng start for object or array\nmyJsonProducer2.endObject();\n\n// mismatch start and end\nmyJsonProducer3.startArray();\nmyJsonProducer3.endObject();\n\n// malformed properties\nmyJsonProducer4.startObject();\n// missing key\nmyJsonProducer4.nullValue();\nmyJsonProducer4.endObject();\n\nmyJsonProducer5.startObject();\nmyJsonProducer5.objectKey(\u0022k\u0022);\n// missing value\nmyJsonProducer5.endObject();\n\n//// Malformed values\n// questionable numbers\nmyJsonProducer6.float64Value(NaN);\nmyJsonProducer7.float64Value(Infinity);\nmyJsonProducer8.numericTokenValue(\u00221.\u0022);\n// questionable strings\nmyJsonProducer9.stringValue(\u0022\\uD800\u0022);\n\n//// No unique top-level value (see MAY above)\nmyJsonProducer10.nullValue();\nmyJsonProducer11.nullValue();\n```\n\n## Unmarshalling support\n\nUnmarshalling involves turning JSON source texts (which specify state)\ninto domain values (with state and behaviour).\n\nIt is convenient to have a syntax tree for JSON.  Often, unmarshalling\ninvolves looking at select object properties to figure out how to interpret\nthe whole, by trying rules like the below:\n\n- if it has keys `x` and `y`, delegate to the *Point2d* unmarshaller,\n- or if it has keys `radius` and `centroid`, delegate to the *Circle* unmarshaller,\n- ...\n\nThere may not be an order of keys that makes it easy to consume a stream of\nevents to implement those rules, and expecting all producers to use the same\nkey order would lead to brittle unmarshalling.\n\n    export sealed interface JsonSyntaxTree {\n      public produce(p: JsonProducer): Void;\n    }\n\n    export class JsonObject(\n      public properties: Map\u003cString, List\u003cJsonSyntaxTree\u003e\u003e,\n    ) extends JsonSyntaxTree {\n\n      /**\n       * The JSON value tree associated with the given property key or null\n       * if there is no such value.\n       *\n       * The properties map contains a list of sub-trees because JSON\n       * allows duplicate properties.  ECMA-404 §6 notes (emphasis added):\n       *\n       * \u003e The JSON syntax does not impose any restrictions on the strings\n       * \u003e used as names, **does not require that name strings be unique**,\n       * \u003e and does not assign any significance to the ordering of\n       * \u003e name/value pairs.\n       *\n       * When widely used JSON parsers need to relate a property key\n       * to a single value, they tend to prefer the last key/value pair\n       * from a JSON object.  For example:\n       *\n       * JS:\n       *\n       *     JSON.parse('{\u0022x\u0022:\u0022first\u0022,\u0022x\u0022:\u0022last\u0022}').x === 'last'\n       *\n       * Python:\n       *\n       *     import json\n       *     json.loads('{\u0022x\u0022:\u0022first\u0022,\u0022x\u0022:\u0022last\u0022}')['x'] == 'last'\n       *\n       * C#:\n       *\n       *    using System.Text.Json;\n       * \t\tJsonDocument d = JsonDocument.Parse(\n       * \t\t\t\u0022\u0022\u0022\n       * \t\t\t{\u0022x\u0022:\u0022first\u0022,\u0022x\u0022:\u0022last\u0022}\n       * \t\t\t\u0022\u0022\u0022\n       * \t\t);\n       * \t\td.RootElement.GetProperty(\u0022x\u0022).GetString() == \u0022last\u0022\n       */\n      public propertyValueOrNull(propertyKey: String): JsonSyntaxTree? {\n        let treeList = this.properties.getOr(propertyKey, []);\n\n        let lastIndex = treeList.length - 1;\n        if (lastIndex \u003e= 0) {\n          treeList[lastIndex]\n        } else {\n          null\n        }\n      }\n\n      public propertyValueOrBubble(propertyKey: String): JsonSyntaxTree | Bubble {\n        propertyValueOrNull(propertyKey) as JsonSyntaxTree\n      }\n\n      public produce(p: JsonProducer): Void {\n        p.startObject();\n        properties.forEach { (k: String, vs: List\u003cJsonSyntaxTree\u003e);;\n          vs.forEach { (v: JsonSyntaxTree);;\n            p.objectKey(k);\n            v.produce(p);\n          }\n        }\n        p.endObject();\n      }\n    }\n\n    export class JsonArray(\n      public elements: List\u003cJsonSyntaxTree\u003e,\n    ) extends JsonSyntaxTree {\n\n      public produce(p: JsonProducer): Void {\n        p.startArray();\n        elements.forEach { (v: JsonSyntaxTree);;\n          v.produce(p);\n        }\n        p.endArray();\n      }\n    }\n\n    export class JsonBoolean(\n      public content: Boolean,\n    ) extends JsonSyntaxTree {\n      public produce(p: JsonProducer): Void {\n        p.booleanValue(content);\n      }\n    }\n\n    export class JsonNull extends JsonSyntaxTree {\n      public produce(p: JsonProducer): Void {\n        p.nullValue();\n      }\n    }\n\n    export class JsonString(\n      public content: String,\n    ) extends JsonSyntaxTree {\n      public produce(p: JsonProducer): Void {\n        p.stringValue(content);\n      }\n    }\n\n    export sealed interface JsonNumeric extends JsonSyntaxTree {\n      public asJsonNumericToken(): String;\n\n      public asInt(): Int | Bubble;\n      public asFloat64(): Float64 | Bubble;\n    }\n\n    export class JsonInt(\n      public content: Int,\n    ) extends JsonNumeric {\n      public produce(p: JsonProducer): Void {\n        p.intValue(content);\n      }\n\n      public asJsonNumericToken(): String {\n        content.toString()\n      }\n\n      public asInt(): Int { content }\n\n      public asFloat64(): Float64 | Bubble { content.toFloat64() }\n    }\n\n    export class JsonFloat64(\n      public content: Float64,\n    ) extends JsonNumeric {\n      public produce(p: JsonProducer): Void {\n        p.float64Value(content);\n      }\n\n      public asJsonNumericToken(): String {\n        content.toString()\n      }\n\n      public asInt(): Int | Bubble { content.toInt() }\n\n      public asFloat64(): Float64 { content }\n    }\n\n    export class JsonNumericToken(\n      public content: String,\n    ) extends JsonNumeric {\n      public produce(p: JsonProducer): Void {\n        p.numericTokenValue(content);\n      }\n\n      public asJsonNumericToken(): String {\n        content\n      }\n\n      public asInt(): Int | Bubble {\n        content.toInt() orelse content.toFloat64().toInt()\n      }\n\n      public asFloat64(): Float64 | Bubble { content.toFloat64() }\n    }\n\nThe *produce* method allows a JSON syntax tree to describe itself to a\nJSON producer so JSON syntax trees, while useful during unmarshalling\ncan also help with marshalling.\n\n## Producing JSON text\n\nA JSON producer that appends to an internal buffer lets us produce\nJSON source text.\n\n    // A state machine lets us figure out when to insert commas.\n    let JSON_STATE_OPEN_OBJECT = 0; // Last was \u0022{\u0022\n    let JSON_STATE_AFTER_KEY = 1; // Last was property key\n    let JSON_STATE_AFTER_PROPERTY = 2; // Last was property value\n    let JSON_STATE_OPEN_ARRAY = 3; // Last was \u0022[\u0022\n    let JSON_STATE_AFTER_ELEMENT = 4; // Last was array element\n    let JSON_STATE_NO_VALUE = 5;\n    let JSON_STATE_ONE_VALUE = 6;\n\n    export class JsonTextProducer extends JsonProducer {\n      public interchangeContext: InterchangeContext;\n      private buffer: StringBuilder;\n      private stack: ListBuilder\u003cInt\u003e;\n      private var wellFormed: Boolean;\n\n      public constructor(\n        interchangeContext: InterchangeContext = NullInterchangeContext.instance\n      ): Void {\n        this.interchangeContext = interchangeContext;\n        this.buffer = new StringBuilder();\n        this.stack = new ListBuilder\u003cInt\u003e();\n        this.stack.add(JSON_STATE_NO_VALUE);\n        this.wellFormed = true;\n      }\n\n      private state(): Int {\n        stack.getOr(stack.length - 1, -1)\n      }\n\n      private beforeValue(): Void {\n        let currentState = state();\n        when (currentState) {\n          JSON_STATE_OPEN_ARRAY -\u003e\n            stack[stack.length - 1] = JSON_STATE_AFTER_ELEMENT;\n          JSON_STATE_AFTER_ELEMENT -\u003e buffer.append(\u0022,\u0022);\n          JSON_STATE_AFTER_KEY -\u003e\n            stack[stack.length - 1] = JSON_STATE_AFTER_PROPERTY;\n          JSON_STATE_NO_VALUE -\u003e\n            stack[stack.length - 1] = JSON_STATE_ONE_VALUE;\n          JSON_STATE_ONE_VALUE, JSON_STATE_AFTER_PROPERTY -\u003e\n            wellFormed = false;\n        }\n      }\n\n      public startObject(): Void {\n        beforeValue();\n        buffer.append(\u0022{\u0022);\n        stack.add(JSON_STATE_OPEN_OBJECT);\n      }\n\n      public endObject(): Void {\n        buffer.append(\u0022}\u0022);\n        let currentState = state();\n        if (JSON_STATE_OPEN_OBJECT == currentState ||\n            JSON_STATE_AFTER_PROPERTY == currentState) {\n          stack.removeLast();\n        } else {\n          wellFormed = false;\n        }\n      }\n\n      public objectKey(key: String): Void {\n        let currentState = state();\n        when (currentState) {\n          JSON_STATE_OPEN_OBJECT -\u003e void;\n          JSON_STATE_AFTER_PROPERTY -\u003e buffer.append(\u0022,\u0022);\n          else -\u003e wellFormed = false;\n        }\n        encodeJsonString(key, buffer);\n        buffer.append(\u0022:\u0022);\n        if (currentState \u003e= 0) {\n          stack[stack.length - 1] = JSON_STATE_AFTER_KEY;\n        }\n      }\n\n      public startArray(): Void {\n        beforeValue();\n        buffer.append(\u0022[\u0022);\n        stack.add(JSON_STATE_OPEN_ARRAY);\n      }\n\n      public endArray(): Void {\n        buffer.append(\u0022]\u0022);\n        let currentState = state();\n        if (JSON_STATE_OPEN_ARRAY == currentState ||\n            JSON_STATE_AFTER_ELEMENT == currentState) {\n          stack.removeLast();\n        } else {\n          wellFormed = false;\n        }\n      }\n\n      public nullValue(): Void {\n        beforeValue();\n        buffer.append(\u0022null\u0022);\n      }\n\n      public booleanValue(x: Boolean): Void {\n        beforeValue();\n        buffer.append(if (x) { \u0022true\u0022 } else { \u0022false\u0022 });\n      }\n\n      public intValue(x: Int): Void {\n        beforeValue();\n        buffer.append(x.toString());\n      }\n\n      public float64Value(x: Float64): Void {\n        beforeValue();\n        buffer.append(x.toString());\n      }\n\n      public numericTokenValue(x: String): Void {\n        // TODO check syntax of x and maybe set malformed\n        beforeValue();\n        buffer.append(x);\n      }\n\n      public stringValue(x: String): Void {\n        beforeValue();\n        encodeJsonString(x, buffer);\n      }\n\n      public toJsonString(): String | Bubble {\n        if (wellFormed \u0026\u0026 stack.length == 1 \u0026\u0026 state() == JSON_STATE_ONE_VALUE) {\n          return buffer.toString();\n        } else {\n          bubble();\n        }\n      }\n    }\n\n    let encodeJsonString(x: String, buffer: StringBuilder): Void {\n      buffer.append(\u0022\\\u0022\u0022);\n      var i = String.begin;\n      var emitted = i;\n      while (x.hasIndex(i)) {\n        // The choice of which code-points to escape and which\n        // escape sequences to use is the same as those made in\n        // ES262 § 25.5.2.3: QuoteJSONString\n        // as long as the string has no orphaned surrogates.\n        // This means that the output will work in many parsers\n        // while still allowing use of JSON.stringify in JavaScript\n        // where keeping code-size low by not shipping a JSON encoder\n        // is important.\n\n        let cp = x[i];\n        let replacement = when (cp) {\n          char'\\b'     -\u003e \u0022\\\\b\u0022;\n          char'\\t'     -\u003e \u0022\\\\t\u0022;\n          char'\\n'     -\u003e \u0022\\\\n\u0022;\n          char'\\f'     -\u003e \u0022\\\\f\u0022;\n          char'\\r'     -\u003e \u0022\\\\r\u0022;\n          char'\u0022'      -\u003e \u0022\\\\\\\u0022\u0022;\n          char'\\\\'     -\u003e \u0022\\\\\\\\\u0022;\n          else         -\u003e\n            // Control characters and non-USV code-points.\n            if (cp \u003c 0x20 || 0xD800 \u003c= cp \u0026\u0026 cp \u003c= 0xDFFF) {\n              \u0022\\\\u\u0022\n            } else {\n              \u0022\u0022\n            };\n        };\n\n        let nextI = x.next(i);\n\n        if (replacement != \u0022\u0022) {\n          buffer.appendBetween(x, emitted, i);\n          buffer.append(replacement);\n          if (replacement == \u0022\\\\u\u0022) {\n            encodeHex4(cp, buffer);\n          }\n          emitted = nextI;\n        }\n\n        i = nextI;\n      }\n      buffer.appendBetween(x, emitted, i);\n      buffer.append(\u0022\\\u0022\u0022);\n    }\n\n    let hexDigits = [\n      '0', '1', '2', '3', '4', '5', '6', '7',\n      '8', '9', 'a', 'b', 'c', 'd', 'e', 'f',\n    ];\n\n    let encodeHex4(cp: Int, buffer: StringBuilder): Void {\n      let b0 = (cp / 0x1000) \u0026 0xf;\n      let b1 = (cp / 0x100) \u0026 0xf;\n      let b2 = (cp / 0x10) \u0026 0xf;\n      let b3 = cp \u0026 0xf;\n      buffer.append(hexDigits[b0]);\n      buffer.append(hexDigits[b1]);\n      buffer.append(hexDigits[b2]);\n      buffer.append(hexDigits[b3]);\n    }\n\n## Parsing JSON\n\nJSON tokens, like `{` and `\u0022foo\u0022` correspond fairly closely to events\nlike *JsonProducer.startObject* and *JsonProducer.stringValue* respectively.\n\n*JsonSyntaxTree* knows how to describe itself to a *JsonProducer*, but we can\nalso craft a *JsonProducer* that constructs a syntax tree.\n\nFirst, we need a way to explain syntax errors, ideally in a way that lets\na *JsonProducer* represent both the valid JSON or the error.\n\n    export interface JsonParseErrorReceiver {\n      public explainJsonError(explanation: String): Void;\n    }\n\nNow, we are ready to build a *JsonProducer* that produces a syntax tree given\nvalid JSON, but if given a string that is not valid JSON, it has a syntax error.\n\n    export class JsonSyntaxTreeProducer extends JsonProducer \u0026 JsonParseErrorReceiver {\n      private stack: ListBuilder\u003cListBuilder\u003cJsonSyntaxTree\u003e\u003e;\n      private var error: String?;\n      public get interchangeContext(): InterchangeContext {\n        NullInterchangeContext.instance\n      }\n\n      public constructor() {\n        stack = new ListBuilder\u003cListBuilder\u003cJsonSyntaxTree\u003e\u003e();\n        stack.add(new ListBuilder\u003cJsonSyntaxTree\u003e());\n        error = null;\n      }\n\n      private storeValue(v: JsonSyntaxTree): Void {\n        if (!stack.isEmpty) {\n          stack[stack.length - 1].add(v);\n        }\n      }\n\n      public startObject(): Void {\n        stack.add(new ListBuilder\u003cJsonSyntaxTree\u003e());\n      }\n\n      public endObject(): Void {\n        if (stack.isEmpty) {\n          return;\n        }\n        let ls = stack.removeLast();\n        // In the common case, there are no duplicate keys.\n        let m = new MapBuilder\u003cString, List\u003cJsonSyntaxTree\u003e\u003e();\n        // But we need a way to accumulate them when there are duplicate keys.\n        var multis: MapBuilder\u003cString, ListBuilder\u003cJsonSyntaxTree\u003e\u003e? = null;\n        for (var i = 0, n = ls.length \u0026 -2; i \u003c n;) {\n          let keyTree = ls[i++];\n          if (!(keyTree is JsonString)) { break }\n          let key = (keyTree as JsonString orelse panic()).content;\n          let value = ls[i++];\n\n          if (m.has(key)) {\n            if (multis == null) {\n              multis = new MapBuilder\u003cString, ListBuilder\u003cJsonSyntaxTree\u003e\u003e();\n            }\n            let mb = multis as MapBuilder\u003cString, ListBuilder\u003cJsonSyntaxTree\u003e\u003e orelse panic();\n            if (!mb.has(key)) {\n              mb[key] = (m[key] orelse panic()).toListBuilder();\n            }\n            (mb[key] orelse panic()).add(value);\n          } else {\n            m[key] = [value];\n          }\n        }\n\n        let multis = multis; // lock it in down here for inference\n        if (multis != null) {\n          multis.forEach { (k: String, vs: ListBuilder\u003cJsonSyntaxTree\u003e);;\n            m[k] = vs.toList();\n          }\n        }\n\n        storeValue(new JsonObject(m.toMap()));\n      }\n\n      public objectKey(key: String): Void {\n        storeValue(new JsonString(key));\n      }\n\n      public startArray(): Void {\n        stack.add(new ListBuilder\u003cJsonSyntaxTree\u003e());\n      }\n\n      public endArray(): Void {\n        if (stack.isEmpty) {\n          return;\n        }\n        let ls = stack.removeLast();\n        storeValue(new JsonArray(ls.toList()));\n      }\n\n      public nullValue(): Void {\n        storeValue(new JsonNull());\n      }\n\n      public booleanValue(x: Boolean): Void {\n        storeValue(new JsonBoolean(x));\n      }\n\n      public intValue(x: Int): Void {\n        storeValue(new JsonInt(x));\n      }\n\n      public float64Value(x: Float64): Void {\n        storeValue(new JsonFloat64(x));\n      }\n\n      public numericTokenValue(x: String): Void {\n        storeValue(new JsonNumericToken(x));\n      }\n\n      public stringValue(x: String): Void {\n        storeValue(new JsonString(x));\n      }\n\n      public toJsonSyntaxTree(): JsonSyntaxTree | Bubble {\n        if (stack.length != 1 || error != null) { bubble() }\n        let ls = stack[0];\n        if (ls.length != 1) { bubble() }\n        ls[0]\n      }\n\n      public get jsonError(): String? { error }\n\n      public get parseErrorReceiver(): JsonParseErrorReceiver { this }\n\n      public explainJsonError(error: String): Void {\n        this.error = error;\n      }\n    }\n\nSome helpers let us route errors:\n\n    let expectedTokenError(\n      sourceText: String,\n      i: StringIndex,\n      out: JsonProducer,\n      shortExplanation: String,\n    ): Void {\n      let gotten = if (sourceText.hasIndex(i)) {\n        \u0022`\u0024{ sourceText.slice(i, sourceText.end) }`\u0022\n      } else {\n        \u0022end-of-file\u0022\n      };\n      storeJsonError(out, \u0022Expected \u0024{shortExplanation}, but got \u0024{gotten}\u0022);\n    }\n\n    let storeJsonError(out: JsonProducer, explanation: String): Void {\n      out.parseErrorReceiver?.explainJsonError(explanation);\n    }\n\nNext, a JSON string parser that drives a *JsonProducer*.\n\n    export let parseJsonToProducer(sourceText: String, out: JsonProducer): Void {\n      var i = String.begin;\n      let afterValue = parseJsonValue(sourceText, i, out);\n      if (afterValue is StringIndex) { // else parseJsonValue must have stored an error\n        i = skipJsonSpaces(sourceText, afterValue);\n        if (sourceText.hasIndex(i) \u0026\u0026 out.parseErrorReceiver != null) {\n          storeJsonError(out, \u0022Extraneous JSON `\u0024{sourceText.slice(i, sourceText.end)}`\u0022);\n        }\n      }\n    }\n\nA recursive descent parser without backtracking works just fine for JSON because the\nnext non-space character perfectly predicts the next production.\nAll `// \u003e ` comments are followed by quotes from ECMA-404 2nd edition.\nEach parsing helper takes the *StringIndex* before parsing and returns\nthe *StringIndex* at the end of the content it parsed, or maybe *null* if parsing\nfailed.\n\n    // \u003e Insignificant whitespace is allowed before or after any token.\n    // \u003e Whitespace is any sequence of one or more of the following code\n    // \u003e points:\n    // \u003e   character tabulation (U+0009),\n    // \u003e   line feed (U+000A),\n    // \u003e   carriage return (U+000D), and\n    // \u003e   space (U+0020).\n    let skipJsonSpaces(sourceText: String, var i: StringIndex): StringIndex {\n      while (sourceText.hasIndex(i)) {\n        when (sourceText[i]) {\n          0x9, 0xA, 0xD, 0x20 -\u003e void;\n          else -\u003e break;\n        }\n        i = sourceText.next(i);\n      }\n      return i;\n    }\n\n    let parseJsonValue(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption {\n      i = skipJsonSpaces(sourceText, i);\n      if (!sourceText.hasIndex(i)) {\n        expectedTokenError(sourceText, i, out, \u0022JSON value\u0022);\n        return StringIndex.none\n      }\n      when (sourceText[i]) {\n        char'{' -\u003e parseJsonObject(sourceText, i, out);\n        char'[' -\u003e parseJsonArray(sourceText, i, out);\n        char'\u0022' -\u003e parseJsonString(sourceText, i, out);\n        char't', char'f' -\u003e parseJsonBoolean(sourceText, i, out);\n        char'n' -\u003e parseJsonNull(sourceText, i, out);\n        else -\u003e parseJsonNumber(sourceText, i, out);\n      }\n    }\n\nFor a JSON object, parsing looks for a '{', then optionally a property.\nAfter a property, if there is a ',' parsing looks for another property.\nAfter the last property or lone '{', there must be a '}'.\n\n    let parseJsonObject(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption { do {\n      if (!sourceText.hasIndex(i) || sourceText[i] != char'{') {\n        expectedTokenError(sourceText, i, out, \u0022'{'\u0022);\n        return StringIndex.none;\n      }\n      out.startObject();\n      i = skipJsonSpaces(sourceText, sourceText.next(i));\n      if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] != char'}') {\n        while (true) {\n          let keyBuffer = new StringBuilder();\n          let afterKey = parseJsonStringTo(sourceText, i, keyBuffer, out);\n          if (!(afterKey is StringIndex)) { return StringIndex.none; }\n          out.objectKey(keyBuffer.toString());\n          i = skipJsonSpaces(sourceText, afterKey as StringIndex orelse panic());\n          if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char':') {\n            i = sourceText.next(i);\n            let afterPropertyValue = parseJsonValue(sourceText, i, out);\n            if (!(afterPropertyValue is StringIndex)) {\n              return StringIndex.none;\n            }\n            i = afterPropertyValue as StringIndex;\n          } else {\n            expectedTokenError(sourceText, i, out, \u0022':'\u0022);\n            return StringIndex.none;\n          }\n\n          i = skipJsonSpaces(sourceText, i);\n          if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char',') {\n            i = skipJsonSpaces(sourceText, sourceText.next(i));\n            continue;\n          } else {\n            break;\n          }\n        }\n      }\n\n      if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char'}') {\n        out.endObject();\n        return sourceText.next(i);\n      } else {\n        expectedTokenError(sourceText, i, out, \u0022'}'\u0022);\n        return StringIndex.none;\n      }\n    } orelse panic() } // See https://github.com/temperlang/temper/issues/203\n\nFor a JSON array, parsing looks for a '\\[', and an optional element value.\nAfter each element value, if there is a ',', parsing looks for another element\nvalue.  After the last element value or lone '\\[', there must be a '\\]'.\n\n    let parseJsonArray(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption { do {\n      if (!sourceText.hasIndex(i) || sourceText[i] != char'[') {\n        expectedTokenError(sourceText, i, out, \u0022'['\u0022);\n        return StringIndex.none;\n      }\n      out.startArray();\n      i = skipJsonSpaces(sourceText, sourceText.next(i));\n      if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] != char']') {\n        while (true) {\n          let afterElementValue = parseJsonValue(sourceText, i, out);\n          if (!(afterElementValue is StringIndex)) {\n            return StringIndex.none;\n          }\n          i = afterElementValue as StringIndex;\n\n          i = skipJsonSpaces(sourceText, i);\n          if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char',') {\n            i = skipJsonSpaces(sourceText, sourceText.next(i));\n            continue;\n          } else {\n            break;\n          }\n        }\n      }\n\n      if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char']') {\n        out.endArray();\n        return sourceText.next(i);\n      } else {\n        expectedTokenError(sourceText, i, out, \u0022']'\u0022);\n        return StringIndex.none;\n      }\n    } orelse panic() } // See https://github.com/temperlang/temper/issues/203\n\nA string consists of double-quotes with a select group of C-style escape sequences.\nThe characters that are allowed unescaped inside the quotes are any except ASCII\ncontrol characters.\n\n\u003e To escape a code point that is not in the Basic Multilingual Plane,\n\u003e the character may be represented as a twelve-character sequence,\n\u003e encoding the UTF-16 surrogate pair corresponding to the code point.\n\nThis suggests that when only one of a surrogate pair is escaped, that it is\ntreated as multiple code points.  This implementation collapses them into\na single code-point for consistency with backends with native UTF-16 strings\nwhere such a distinction is not possible to represent.\n\n    let parseJsonString(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption {\n      let sb = new StringBuilder();\n      let after = parseJsonStringTo(sourceText, i, sb, out);\n      if (after is StringIndex) {\n        out.stringValue(sb.toString());\n      }\n      return after;\n    }\n\n    let parseJsonStringTo(\n      sourceText: String, var i: StringIndex, sb: StringBuilder,\n      errOut: JsonProducer\n    ): StringIndexOption {\n      if (!sourceText.hasIndex(i) || sourceText[i] != char'\u0022') {\n        expectedTokenError(sourceText, i, errOut, '\u0022');\n        return StringIndex.none;\n      }\n      i = sourceText.next(i);\n\n      // Hold onto lead surrogates until we find out whether there's a trailing\n      // surrogate or not.\n      var leadSurrogate: Int = -1;\n\n      var consumed = i;\n      while (sourceText.hasIndex(i)) {\n        let cp = sourceText[i];\n        if (cp == char'\u0022') { break }\n        var iNext = sourceText.next(i);\n        let end = sourceText.end;\n\n        // Emit anything between consumed and i if there\n        // is a pending surrogate or escaped characters.\n        var needToFlush = false;\n\n        // Decode one code-point or UTF-16 surrogate\n        var decodedCp = if (cp != char'\\\\') {\n          cp\n        } else {\n          needToFlush = true;\n          if (!sourceText.hasIndex(iNext)) {\n            expectedTokenError(sourceText, iNext, errOut, \u0022escape sequence\u0022);\n            return StringIndex.none;\n          }\n          let esc0 = sourceText[iNext];\n          iNext = sourceText.next(iNext);\n          when (esc0) {\n            char'\u0022', char'\\\\', char'/' -\u003e esc0;\n            char'b' -\u003e char'\\b';\n            char'f' -\u003e char'\\f';\n            char'n' -\u003e char'\\n';\n            char'r' -\u003e char'\\r';\n            char't' -\u003e char'\\t';\n            char'u' -\u003e do {\n              let hex: Int = if (sourceText.hasAtLeast(iNext, end, 4)) {\n                let startHex = iNext;\n                iNext = sourceText.next(iNext);\n                iNext = sourceText.next(iNext);\n                iNext = sourceText.next(iNext);\n                iNext = sourceText.next(iNext);\n                decodeHexUnsigned(sourceText, startHex, iNext)\n              } else {\n                -1\n              };\n              if (hex \u003c 0) {\n                expectedTokenError(sourceText, iNext, errOut, \u0022four hex digits\u0022);\n                return StringIndex.none;\n              }\n              hex\n            }\n            else -\u003e do {\n              expectedTokenError(sourceText, iNext, errOut, \u0022escape sequence\u0022);\n              return StringIndex.none;\n            }\n          }\n        };\n\n        // If we have two surrogates, combine them into one code-point.\n        // If we have a lead surrogate, make sure we can wait.\n        if (leadSurrogate \u003e= 0) {\n          needToFlush = true;\n          let lead = leadSurrogate;\n          if (0xDC00 \u003c= decodedCp \u0026\u0026 decodedCp \u003c= 0xDFFF) {\n            leadSurrogate = -1;\n            decodedCp = (\n              0x10000 +\n              (((lead - 0xD800) * 0x400) | (decodedCp - 0xDC00))\n            );\n          }\n        } else if (0xD800 \u003c= decodedCp \u0026\u0026 decodedCp \u003c= 0xDBFF) {\n          needToFlush = true;\n        }\n\n        // Consume characters from sourceText onto sb if it's timely\n        // to do so.\n        if (needToFlush) {\n          sb.appendBetween(sourceText, consumed, i);\n          if (leadSurrogate \u003e= 0) {\n            // Not combined with a trailing surrogate.\n            sb.appendCodePoint(leadSurrogate) orelse panic();\n          }\n          if (0xD800 \u003c= decodedCp \u0026\u0026 decodedCp \u003c= 0xDBFF) {\n            leadSurrogate = decodedCp;\n          } else {\n            leadSurrogate = -1;\n            sb.appendCodePoint(decodedCp) orelse panic();\n          }\n          consumed = iNext;\n        }\n\n        i = iNext;\n      }\n\n      if (!sourceText.hasIndex(i) || sourceText[i] != char'\u0022') {\n        expectedTokenError(sourceText, i, errOut, '\u0022');\n        StringIndex.none\n      } else {\n        if (leadSurrogate \u003e= 0) {\n          sb.appendCodePoint(leadSurrogate) orelse panic();\n        } else {\n          sb.appendBetween(sourceText, consumed, i);\n        }\n        i = sourceText.next(i); // Consume closing quote\n        i\n      }\n    }\n\n    let decodeHexUnsigned(\n      sourceText: String, start: StringIndex, limit: StringIndex\n    ): Int {\n      var n = 0;\n      var i = start;\n      while (i.compareTo(limit) \u003c 0) {\n        let cp = sourceText[i];\n        let digit = if (char'0' \u003c= cp \u0026\u0026 cp \u003c= char'0') {\n          cp - char'0'\n        } else if (char'A' \u003c= cp \u0026\u0026 cp \u003c= char'F') {\n          cp - char'A' + 10\n        } else if (char'a' \u003c= cp \u0026\u0026 cp \u003c= char'f') {\n          cp - char'a' + 10\n        } else {\n          return -1;\n        }\n        n = (n * 16) + digit;\n        i = sourceText.next(i);\n      }\n      n\n    }\n\n    let parseJsonBoolean(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption {\n      let ch0 = if (sourceText.hasIndex(i)) {\n        sourceText[i]\n      } else {\n        0\n      };\n      let end = sourceText.end;\n\n      let keyword: String?;\n      let n: Int;\n      when (ch0) {\n        char'f' -\u003e do { keyword = \u0022false\u0022; n = 5 };\n        char't' -\u003e do { keyword = \u0022true\u0022; n = 4 };\n        else    -\u003e do { keyword = null; n = 0 };\n      }\n\n      if (keyword != null) {\n        if (sourceText.hasAtLeast(i, end, n)) {\n          let after = afterSubstring(sourceText, i, keyword);\n          if (after is StringIndex) {\n            out.booleanValue(n == 4);\n            return after;\n          }\n        }\n      }\n\n      expectedTokenError(sourceText, i, out, \u0022`false` or `true`\u0022);\n      return StringIndex.none;\n    }\n\n    let parseJsonNull(\n      sourceText: String, i: StringIndex, out: JsonProducer\n    ): StringIndexOption {\n      let after = afterSubstring(sourceText, i, \u0022null\u0022);\n\n      if (after is StringIndex) {\n        out.nullValue();\n        return after;\n      }\n\n      expectedTokenError(sourceText, i, out, \u0022`null`\u0022);\n      return StringIndex.none;\n    }\n\n    let afterSubstring(\n      string: String,\n      inString: StringIndex,\n      substring: String\n    ): StringIndexOption {\n      var i = inString;\n      var j = String.begin;\n      while (substring.hasIndex(j)) {\n        if (!string.hasIndex(i)) {\n          return StringIndex.none;\n        }\n        if (string[i] != substring[j]) {\n          return StringIndex.none;\n        }\n        i = string.next(i);\n        j = substring.next(j);\n      }\n      i\n    }\n\nAs usual, the number grammar is the single largest sub-grammar.\nWe accumulate an integer portion separately from a decimal portion.\nIf either of those is past the common representability limits for *Int*\nor *Float64*, then we use the lossless numeric syntax tree variant.\n\n    let parseJsonNumber(\n      sourceText: String, var i: StringIndex, out: JsonProducer\n    ): StringIndexOption { do {\n      var isNegative = false;\n      let startOfNumber = i;\n      if (sourceText.hasIndex(i) \u0026\u0026 sourceText[i] == char'-') {\n        isNegative = true;\n        i = sourceText.next(i);\n      }\n\n      // Find the whole portion, the portion before any fraction\n      // or exponent.\n      // 0 | [1-9][0-9]*\n      let digit0 = if (sourceText.hasIndex(i)) { sourceText[i] } else { -1 };\n      if (digit0 \u003c char'0' || char'9' \u003c digit0) {\n        // parseJsonValue comes here for any unrecognized code-points\n        let error = if (!isNegative \u0026\u0026 digit0 != char'.') {\n          \u0022JSON value\u0022\n        } else {\n          \u0022digit\u0022\n        };\n        expectedTokenError(sourceText, i, out, error);\n        return StringIndex.none;\n      }\n      i = sourceText.next(i);\n      var nDigits = 1;\n      var tentativeValue = (digit0 - char'0').toFloat64() orelse panic();\n      if (char'0' != digit0) {\n        while (sourceText.hasIndex(i)) {\n          let possibleDigit = sourceText[i];\n          if (char'0' \u003c= possibleDigit \u0026\u0026 possibleDigit \u003c= char'9') {\n            i = sourceText.next(i);\n            nDigits += 1;\n            tentativeValue = tentativeValue * 10.0 +\n                (possibleDigit - char'0').toFloat64();\n          } else {\n            break;\n          }\n        }\n      }\n\n      // optional fraction component\n      // '.' [0-9]+\n      var nDigitsAfterPoint = 0;\n      if (sourceText.hasIndex(i) \u0026\u0026 char'.' == sourceText[i]) {\n        i = sourceText.next(i);\n        let afterPoint = i;\n        while (sourceText.hasIndex(i)) {\n          let possibleDigit = sourceText[i];\n          if (char'0' \u003c= possibleDigit \u0026\u0026 possibleDigit \u003c= char'9') {\n            i = sourceText.next(i);\n            nDigits += 1;\n            nDigitsAfterPoint += 1;\n            tentativeValue = tentativeValue * 10.0 +\n                (possibleDigit - char'0').toFloat64();\n          } else {\n            break;\n          }\n        }\n        if (i == afterPoint) {\n          // ECMA-404 does not allow \u00220.\u0022 with no digit after the point.\n          expectedTokenError(sourceText, i, out, \u0022digit\u0022);\n          return StringIndex.none;\n        }\n      }\n\n      // optional exponent\n      // [eE] [+\\-]? [0-9]+\n      var nExponentDigits = 0;\n      if (sourceText.hasIndex(i) \u0026\u0026 char'e' == (sourceText[i] | 32)) {\n        i = sourceText.next(i);\n        if (!sourceText.hasIndex(i)) {\n          expectedTokenError(sourceText, i, out, \u0022sign or digit\u0022);\n          return StringIndex.none;\n        }\n        let afterE = sourceText[i];\n        if (afterE == char'+' || afterE == char'-') {\n          i = sourceText.next(i);\n        }\n        while (sourceText.hasIndex(i)) {\n          let possibleDigit = sourceText[i];\n          if (char'0' \u003c= possibleDigit \u0026\u0026 possibleDigit \u003c= char'9') {\n            i = sourceText.next(i);\n            nExponentDigits += 1;\n          } else {\n            break;\n          }\n        }\n        if (nExponentDigits == 0) {\n          expectedTokenError(sourceText, i, out, \u0022exponent digit\u0022);\n          return StringIndex.none;\n        }\n      }\n      let afterExponent = i;\n\n      if (nExponentDigits == 0 \u0026\u0026 nDigitsAfterPoint == 0) {\n        // An integer literal.\n        let value = if (isNegative) { -tentativeValue } else { tentativeValue };\n        if (nDigits \u003c= 10 \u0026\u0026 -2147483648.0 \u003c= value \u0026\u0026 value \u003c= 2147483647.0) {\n          // Guaranteed representible int value.\n          out.intValue(value.toInt() orelse panic());\n          return i;\n        }\n      }\n\n      let numericTokenString = sourceText.slice(startOfNumber, i);\n      var doubleValue = NaN;\n      if (nExponentDigits != 0 || nDigitsAfterPoint != 0) {\n        do {\n          doubleValue = numericTokenString.toFloat64();\n        } orelse do {\n          // Fall back to numeric token below\n          ;\n        }\n      }\n\n      if (doubleValue != -Infinity \u0026\u0026 doubleValue != Infinity \u0026\u0026\n          doubleValue != NaN) {\n        out.float64Value(doubleValue);\n      } else {\n        out.numericTokenValue(numericTokenString);\n      }\n      return i;\n    } orelse panic() } // See https://github.com/temperlang/temper/issues/203\n\nAs a convenience, the *parseJson* helper just creates a tree producer,\ncalls the parser and gets the tree.\n\n    export let parseJson(sourceText: String): JsonSyntaxTree | Bubble {\n      let p = new JsonSyntaxTreeProducer();\n      parseJsonToProducer(sourceText, p);\n      // TODO: if there is a syntax error, produce it.\n      p.toJsonSyntaxTree()\n    }\n\n## Type adapters\n\nType adapters allow converting values of a type to and from JSON.\nSee the `@json` type decorator for details which makes sure that\nthe decorated type has a static method that gets an adapter for the\ntype.\n\n    export interface JsonAdapter\u003cT\u003e {\n      public encodeToJson(x: T, p: JsonProducer): Void;\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): T | Bubble;\n    }\n\nOur intrinsic types, like *Boolean* need json adapters.  Static extensions\nlet us make *Boolean.jsonAdapter()* work as if it were built in.\n\n    class BooleanJsonAdapter extends JsonAdapter\u003cBoolean\u003e {\n      public encodeToJson(x: Boolean, p: JsonProducer): Void {\n        p.booleanValue(x);\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): Boolean | Bubble {\n        (t as JsonBoolean).content\n      }\n    }\n\n    @staticExtension(Boolean, \u0022jsonAdapter\u0022)\n    export let booleanJsonAdapter(): JsonAdapter\u003cBoolean\u003e {\n      new BooleanJsonAdapter()\n    }\n\n    class Float64JsonAdapter extends JsonAdapter\u003cFloat64\u003e {\n      public encodeToJson(x: Float64, p: JsonProducer): Void {\n        p.float64Value(x);\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): Float64 | Bubble {\n        (t as JsonNumeric).asFloat64()\n      }\n    }\n\n    @staticExtension(Float64, \u0022jsonAdapter\u0022)\n    export let float64JsonAdapter(): JsonAdapter\u003cFloat64\u003e {\n      new Float64JsonAdapter()\n    }\n\n    class IntJsonAdapter extends JsonAdapter\u003cInt\u003e {\n      public encodeToJson(x: Int, p: JsonProducer): Void {\n        p.intValue(x);\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): Int | Bubble {\n        (t as JsonNumeric).asInt()\n      }\n    }\n\n    @staticExtension(Int, \u0022jsonAdapter\u0022)\n    export let intJsonAdapter(): JsonAdapter\u003cInt\u003e {\n      new IntJsonAdapter()\n    }\n\n    class StringJsonAdapter extends JsonAdapter\u003cString\u003e {\n      public encodeToJson(x: String, p: JsonProducer): Void {\n        p.stringValue(x);\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): String | Bubble {\n        (t as JsonString).content\n      }\n    }\n\n    @staticExtension(String, \u0022jsonAdapter\u0022)\n    export let stringJsonAdapter(): JsonAdapter\u003cString\u003e {\n      new StringJsonAdapter()\n    }\n\n    class ListJsonAdapter\u003cT\u003e(\n      private adapterForT: JsonAdapter\u003cT\u003e,\n    ) extends JsonAdapter\u003cList\u003cT\u003e\u003e {\n      public encodeToJson(x: List\u003cT\u003e, p: JsonProducer): Void {\n        p.startArray();\n        for (let el of x) {\n          adapterForT.encodeToJson(el, p);\n        }\n        p.endArray();\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): List\u003cT\u003e | Bubble {\n        let b = new ListBuilder\u003cT\u003e();\n        let elements = (t as JsonArray).elements;\n        let n = elements.length;\n        var i = 0;\n        while (i \u003c n) {\n          let el = elements[i];\n          i += 1;\n          b.add(adapterForT.decodeFromJson(el, ic));\n        }\n        b.toList()\n      }\n    }\n\n    @staticExtension(List, \u0022jsonAdapter\u0022)\n    export let listJsonAdapter\u003cT\u003e(adapterForT: JsonAdapter\u003cT\u003e): JsonAdapter\u003cList\u003cT\u003e\u003e {\n      new ListJsonAdapter\u003cT\u003e(adapterForT)\n    }\n\n    export class OrNullJsonAdapter\u003cT\u003e(\n      private adapterForT: JsonAdapter\u003cT\u003e,\n    ) extends JsonAdapter\u003cT?\u003e {\n      public encodeToJson(x: T?, p: JsonProducer): Void {\n        if (x == null) {\n          p.nullValue();\n        } else {\n          adapterForT.encodeToJson(x, p);\n        }\n      }\n      public decodeFromJson(t: JsonSyntaxTree, ic: InterchangeContext): T? | Bubble {\n        if (t is JsonNull) {\n          null\n        } else {\n          adapterForT.decodeFromJson(t, ic)\n        }\n      }\n    }\n\n[ECMA-404]: https://ecma-international.org/publications-and-standards/standards/ecma-404/\n[content negotiation]: https://developer.mozilla.org/en-US/docs/Web/HTTP/Content_negotiation\n[JSON Lines]: https://jsonlines.org/\n[scalar value string]: https://infra.spec.whatwg.org/#scalar-value-string\n" ], "names": [ "JsonProducer", "JsonSyntaxTree", "InterchangeContext", "JsonAdapter", "JsonString", "DateJsonAdapter", "x", "p", "encodeToJson", "t", "ic", "decodeFromJson", "this", "jsonAdapter", "daysInMonth", "isLeapYear", "year", "return", "padTo", "minWidth", "num", "sb", "decimal", "decimalIndex", "decimalEnd", "nNeeded", "dayOfWeekLookupTableLeapy", "dayOfWeekLookupTableNotLeapy" ], "mappings": "AD4FS;ADAA,EDAAA,YDAA,uBDAAC,cDAA,yBDAAC,kBDAA,4BDAA,A,C,W,qBD+JmB,CDAAE,UDAe,GDAA,ADAf;ADAe,MDAA,A;ADlPvC;ADAA;ADAA,0BDAA;A,M,oB,oBDsqCiBD,gBDAA,CDAA,A;A;A,cDnlCZ,CDAAG,MDAA,EDAAC,MDAA;ADAA,IDAAC,iBDAA,CDAAF,MDAA,EDAAC,MDAA;ADAA;ADAA,GDAA;A;A,gBDAA,CDAAE,MDAA,EDAAC,ODAA;ADAA,WDAAC,mBDAA,CDAAF,MDAA,EDAAC,ODAA;ADAA,GDAA;A;A;A;A;A;ADEQ,yDD8JV;ADTM,kFDEN;ADFM,SDAAF,iBDAY,ADAZ,CDAaI,SDAA,EDAAL,MDAe,CDElC,ADF0C;ADC3B,YDAU,EDAA,ADAV,CDAAK,SDAQ,CDAE,4BDAA;ADAxB,EDAAL,MDAC,CDAC,WDAW,CDAC,MDAU,CDAC;ADAA;ADAC;ADGd,wHDKb;ADLa,SDAAI,mBDAc,ADAd,CDCZF,MDAiB,CDCjB,CDAAC,ODAsB,CDGvB,ADFgB;ADCK,YDAe,CDAA;ADAf,UDAe,ADAV,wBDAU,CDAA,ADAfD,MDAC,CDAI,CDAAL,eDAU,EDAA;ADAnC,oDDA6C,CDAA,ADAzB,MDAe,CDAS,QDAC;ADAA,CDC9C;A;A,S,gBDhKE;ADAA,aDAAC,oBDAA;ADAA,CDAA;ADnFD,4BDAW;ADAf,KDAI,CDAAS,gBDAW,EDAG,ODcjB,CDAA,ADdiB,MDcjB,CDAA,ADdiB,CDChB,CDAC,CDCe,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCF,GDAE,CDCnB;ADED,0DDEC;ADFD,QDAI,CDAAC,eDAU,ADAd,CDAeC,SDAS,CDEvB,ADFkC,EDAA;ADAR,MDAAC,WDAO;ADCM,YDAU,CDAA;ADA/C,MDAK,cDAC,CDAA,ADAND,SDAI,CDAG,EDAC,CDAA,ADAR,IDAa,ADAD,EDAC;ADAK,QDAK,cDAC,CDAA,ADANA,SDAI,CDAG,IDAG,CDAA,ADAV,IDAe,ADAD,EDAC;ADAA,MDAAC,WDAA;ADAA;ADAI,cDAU,ADAL,eDAC,CDAA,ADAND,SDAI,CDAG,IDAG,EDAA;ADAV,MDAAC,WDAA,EDAe,ADAf,ODAU,ADAV,IDAe,ADAD,EDAC;ADAA,KDAA;ADAlC;ADAmC,IDAAA,WDAA;ADAA,GDAA;ADCvD,QDAA,ADF0B,CDAAA,WDAA;ADE1B;ADgCD,iHDcC;ADdD,QDAI,CDAAC,UDAK,ADAT,CDAUC,aDAa,CDAE,CDAAC,QDAQ,CDAE,CDAAC,ODAiB,CDcnD,ADd2D;ADIzB,YDAqB;ADErC,YDA0B,CDAA;ADFV,YDAgC,CDAA;ADHjE,ODAI,CDAAC,YDAO,EDAG,CDAAF,QDAG,CDAA,ADAH,QDAgB,CDAA,ADAH,EDAE,CDAC;ADC3B,KDAC,CDAAG,iBDAY,EDAG,EDAY;ADC/B,ODAI,CDAAC,eDAU,EDAG,CDAAF,YDAO,CDAA,ADAP,MDAW;ADCxB,MDAAC,iBDAY,EDAG,CDAAC,eDAU;ADAI,YDAqB,ADAd,gBDAA,ADAPF,YDAO,CDAC,CDAAC,iBDAY,CDAC,CDAA;ADArB,YDAgC,ADAhC,ODAqB,ADArB,IDAgC,ADAP,GDAO;ADAA;ADAA;ADAA,GDAA;ADAjE,MDAI;ADCF,IDAAF,ODAE,GDAQ,ODAI;ADCC,YDA0B,ADAlB,gBDAI,CDAA,ADAZC,YDAO,CDAM,CDAAC,iBDAY,CDAC,CDAA;ADAzC,IDAAA,iBDAY,ADAZ,EDAyC,ADA1B,ODA0B;ADC1C;ADCwB,YDA8C,EDAA,ADAtC,wBDAY,CDAA,ADApBD,YDAO,CDAc,CDAAC,iBDAY,CDAE,CDAAC,eDAU,CDAC,CDAA;ADApE,KDAC,CDAAC,YDAO,EDAG,CDAAN,aDAQ,ADAR,EDAW,ODA8C;ADCvE,SDAOM,YDAO,ADAP,EDAW,ADAD,EDAC;ADChB,IDAAJ,ODAE,GDAQ,ODAI;ADCd,IDAAI,YDAO,ADAP,EDAY,ADAZ,CDAAA,YDAO,ADAP,EDAW,EDAC;ADCb;ADCD,EDAAJ,ODAE,GDAe,IDAAC,YDAO,WDAEC,iBDAY,CDAE,CDAAC,eDAU,CDAC;ADAA;ADAC;ADKvB,4BDAS;ADAxC,KDAI,CDAAE,8BDAyB,EDAc,ODG1C,CDAA,ADH0C,MDG1C,CDAA,ADH0C,CDCzC,CDAC,CDCD,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDCnC;ADCiC,4BDAS;ADA3C,KDAI,CDAAC,iCDA4B,EDAc,ODG7C,CDAA,ADH6C,MDG7C,CDAA,ADH6C,CDC5C,CDAC,CDCD,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDAE,EDAC,CDCnC" }