aontu 0.60.0 → 0.62.0

package/dist/helpdoc.js

@@ -0,0 +1,59 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.INITDOC = exports.HELPDOC = void 0;
+const HELPDOC = [
+    {
+        "topic": "tasks",
+        "summary": "what do you want to do? — the verb for a job",
+        "source": "docs/skill/tasks.md",
+        "text": "# What do you want to do?\n\nThe verb for a job, found by the word you arrived with. aontu's own\nvocabulary is on the right; yours is probably on the left.\n\n## Start from a document that works\n\nNothing written yet? Do not invent the first document, edit one:\n\n```\naontu init            # into the working directory\naontu init model/     # or into a named one\nsh check.sh           # the four questions, on what was just written\n```\n\n`init` writes `model.aon` (an entity map constrained with `&:`),\n`data.aon` (an instance of it that holds) and `check.sh` (the four\nchecks to run after every edit). It never overwrites: if any\nof the three already stands there, it refuses and writes none of them.\n\n## Describe a domain\n\nAn **ontology**, a **schema**, a **data model**, a **contract** — in\naontu these are all one thing: a document. Write the entities as a\n**map keyed by name**, and say what every entry must satisfy with the\n`&:` template:\n\n```\nentity: {\n  &: {\n    table:  string\n    fields: { &: { type: string, required: *false | boolean } }\n  }\n  planet: { table: \"planets\", fields: { name: { type: \"string\" } } }\n  moon:   { table: \"moons\",   fields: { name: { type: \"string\" } } }\n}\n```\n\n`&:` is the construct to reach for first, and the one most easily\nmissed. It meets **every** key of the map it sits in. A quoted `\"*\"`\nis not a wildcard — it is a key named `*`, and a schema written that\nway constrains nothing while still reporting `valid`.\n\nPrefer a named map to a list unless the order is a fact (a migration\nsequence, a rule table tried in order). A key is an address, a name\nother parts can refer to, and a diff that shows one insertion instead\nof every following element renumbered.\n\n## Check data against a model\n\n```\naontu vet model.aon data.aon\n```\n\nExit `0` valid, `1` a contradiction, `3` incomplete (nothing\ncontradicts, but the model is not yet satisfied), `4` the model does\nnot stand up on its own. `--format json` for the machine-readable\nreport, `--closed` to refuse keys the model does not declare,\n`--max-errors <n>` to cap the list.\n\n**Make the check prove it checked something.** A check that examined\nnothing answers exactly like one that passed:\n\n```\naontu vet --coverage model.aon data.aon         # what did it examine?\naontu vet --strict-coverage model.aon data.aon  # exit 1 if nothing\n```\n\n`--coverage` reports how many data leaves a declaration constrained,\nthe data paths none did, and the declarations no data met.\n`--strict-coverage` exits 1 when the answer is nothing. The usual\ncause is the `\"*\"` mistake above: reach for `&:`.\n\n## Check the model is coherent with itself\n\n```\naontu relations model.aon        # declared entity edges: targets resolve, no cycles\naontu reaches planet moon model.aon   # does one entity reach another, at any remove?\naontu trim --check model.aon     # entries whose removal changes nothing\n```\n\n## Check code against a model\n\n```\naontu render --check src/ --profile go.aon model.aon\n```\n\n`render` writes code from the model; `--check` writes nothing and\nlists what on disk differs from what the model implies. That is the\ngate: the model is the truth, the code is the claim, and drift is a\nfinding. `--coverage` reports the other direction — model paths no\noutput consumed, and rendered declarations no rule produced.\n\n## Ask what a model says, and why\n\n```\naontu get  $.entity.planet.table model.aon\naontu why  $.entity.planet.table model.aon\naontu get  $.entity --keys       model.aon\naontu get  $.entity --types      model.aon\n```\n\n`why` names **every** contribution to a value, with the file and line\neach was written on. It is the first thing to run when a value is not\nwhat you expected, and the second thing to run when `vet` refuses.\n\n## Change a value without editing the file\n\n```\naontu set '$.entity.planet.table=planet_v2' --entry model.aon --overlay local.aon\n```\n\nThe change is checked before it is written; a change that contradicts\na pinned value is refused, and the file is left alone.\n\n## Gate a change to the model itself\n\n```\naontu subsume old.aon new.aon              # does the general admit every specific?\naontu breaking --against git#HEAD~1 model.aon\naontu hash model.aon                       # a pin that survives reformatting\n```\n\n## Hand a model to another agent\n\n```\naontu agentsmd --write AGENTS.md model.aon\n```\n\nSplices a derived stanza — the pin, the root keys, the shape, and the\ncommands spelled with paths that exist — between two markers, and\nleaves the rest of the file alone. Re-run it in the commit that\nchanges the model.\n\n## When something refuses\n\nRead the code in the brackets, then look it up:\n\n```\naontu explain no_scalar_unify\n```\n\nEvery finding carries a `code`, a `class`, a `path` and the **two\nsites** that disagree — the value and the constraint it failed, each\nwith its file and line. The class says what kind of answer it is:\n`conflict` (two things cannot both hold), `incomplete` (nothing is\nwrong yet, something is missing), `parse`, `reference`, `budget`.\n\nFull index: [`error-codes.md`](error-codes.md). The language on one\npage: [`grammar-card.md`](grammar-card.md). The worked ladder from\nplain JSON upward: [`examples.md`](examples.md).\n"
+    },
+    {
+        "topic": "language",
+        "summary": "the grammar card — everything the language spells, on one page",
+        "source": "docs/skill/grammar-card.md",
+        "text": "# aontu grammar card\n\nEverything the language spells, on one page. The published machine\ngrammars are [`grammar/aontu.abnf`](../../grammar/aontu.abnf) — the\nnotation a person reads, with railroad diagrams — and\n[`aontu.gbnf`](../../grammar/aontu.gbnf), `aontu.lark` and\n`aontu.tmLanguage.json` for constrained decoding, parsing and\nhighlighting; this is their human twin.\n\n## Values\n\n| Write | Means |\n|-------|-------|\n| `{\"a\":1}`, `a: 1` | a map; keys may be bare or quoted |\n| `[1,2]` | a list |\n| `\"s\"`, `1`, `1.5`, `true`, `null` | scalars, as JSON |\n| `0d9007199254740993` | an EXACT number, at any magnitude |\n| `string integer number float boolean null` | kinds: any value of that kind |\n| `top` | anything at all; `nil` is the failure |\n\n## Combining\n\n| Write | Means |\n|-------|-------|\n| `a & b` | both must hold — the meet |\n| `a \\| b` | either may hold — the join |\n| `*1 \\| integer` | either, with `1` the DEFAULT a generation picks |\n| | the branch keeps its kind: a later `1.5` is refused, not admitted |\n| `x: 1` twice | the two meet; `1 & 2` is an error, `1 & integer` is `1` |\n| `$.a.b` | the value at that path of this document |\n| `1 + 2` | arithmetic on concrete numbers |\n\n## Maps that say more\n\n| Write | Means |\n|-------|-------|\n| `{&: {k: integer}}` | a TEMPLATE every key must satisfy |\n| `close({a:1})` | no key beyond those named |\n| `{a?: 1}` | optional: dropped if unresolved |\n| `hide(x)` | evaluated, then dropped from the output |\n| `type(x)` | a definition, not a value: it generates nothing |\n| `deprecate(x, {msg:\"…\"})` | still works, and says so |\n| `refer(t) & path($.a.b)` | a checked LINK: the tree address must resolve, and `t` flows into it |\n\n## Constraints\n\n`min(n) max(n) above(n) below(n)` bound a number;\n`length(n)` and `unique()` bound a list or string;\n`re(\"^…$\")` matches a string; `neq(v)` refuses one value;\n`must(cond, \"why\")` is the escape hatch.\n\nBounds compose: `integer & min(1) & max(10)` is a range, and two\nranges meet to their overlap.\n\n## Files\n\n`@\"other.aon\"` includes another document — it unifies in, it does not\nconcatenate. (A constrained decoder is not given this: generated\ndocuments describe values, they do not load files.)\n"
+    },
+    {
+        "topic": "examples",
+        "summary": "the ladder — plain JSON, then one addition at a time",
+        "source": "docs/skill/examples.md",
+        "text": "# aontu by example\n\nThe ladder: start with the JSON you already know, add one thing at a\ntime. Every rung is a valid document.\n\n## 1. It is JSON\n\n```\n{\"service\": {\"name\": \"auth\", \"port\": 8080}}\n```\n\nBare keys and no commas also parse, so this is the same document:\n\n```\nservice: {\n  name: \"auth\"\n  port: 8080\n}\n```\n\n## 2. Say what a value MAY be\n\n```\nservice: {\n  name: string\n  port: integer\n}\n```\n\nNothing generates yet — this is a truth, not a value. `aontu vet\nservice.aon deploy.aon` says whether a deployment satisfies it.\n\n## 3. Say what it SHOULD be\n\n```\nservice: {\n  name: string\n  port: *8080 | integer      # 8080 unless told otherwise\n  replicas: *1 | integer\n}\n```\n\nNow it generates: `{\"service\":{\"name\":…,\"port\":8080,\"replicas\":1}}` —\nexcept `name`, which nothing has supplied. Defaults are picked at\ngeneration; they do not stop a caller from choosing something else.\n\n`*8080 | integer` means what it reads as: a caller's `9090` overrides\nit, and a caller's `1.5` is refused, because the branch admits only the\nkind it names. Write `*8080 | number` if any numeric value should be\nallowed to win.\n\n## 4. Say it once, for every key\n\n```\nservices: {\n  &: { port: integer, replicas: *1 | integer }\n  auth: { port: 8080 }\n  db:   { port: 5432, replicas: 3 }\n}\n```\n\nThe `&:` template meets EVERY key. `aontu why $.services.db.replicas`\nreports both contributions — the template's `*1|integer` and the\nliteral `3` — with the line each was written on.\n\n## 5. Bound it\n\n```\nservices: {\n  &: {\n    port: integer & min(1) & max(65535)\n    name: string & re(\"^[a-z][a-z0-9-]*$\")\n  }\n}\n```\n\nA port of `0` is now an error with a path, not a runtime surprise.\n\n## 6. Layer it\n\n```\n# base.aon\nservice: { image: string, replicas: *1 | integer }\n\n# prod.aon\n@\"base.aon\"\nservice: { image: \"auth:v2.3\", replicas: 5 }\n```\n\nUnification is order-independent: `base & prod` is `prod & base`. To\nchange a value without editing the file, append to an overlay:\n\n```\naontu set '$.service.replicas=7' --entry prod.aon --overlay local.aon\n```\n\nIf the value is PINNED rather than open, that command refuses and\nnames the pinning site — which is the honest answer, and where\n`aontu why` takes you next.\n"
+    },
+    {
+        "topic": "codes",
+        "summary": "what a refusal means, and what to do about it",
+        "source": "docs/skill/error-codes.md",
+        "text": "# What a refusal means\n\nEvery aontu error carries a **code**, and every code has a **class**.\nThe class says what kind of thing went wrong, which is what decides\nyour next move. The full registry — every code, its class, and the\nversion it appeared in — is\n[`test/spec/errcodes.tsv`](../../test/spec/errcodes.tsv), which the\ntest suite holds to the engine in both implementations.\n\n| Class | Meaning | What to do |\n|-------|---------|------------|\n| `parse` | the text is not a document | fix the syntax at the site the frame points at |\n| `conflict` | two values cannot both hold | one of them is wrong: `aontu why <path>` names both and where they were written |\n| `incomplete` | nothing contradicts, but the value is not concrete | supply what is missing, or accept it with `--partial` |\n| `reference` | a path names nothing | check the spelling; `aontu get $ --keys` lists what is there |\n| `compat` | a change breaks an earlier version | that is `aontu subsume` / `aontu breaking` talking: widen the change or version it |\n| `budget` | evaluation hit a deterministic limit | usually a cycle; simplify, or raise the budget deliberately |\n| `internal` | the engine surprised itself | a bug worth reporting |\n\n## The repair loop\n\n```\naontu vet schema.aon mine.aon --format json\n```\n\nThe exit code branches for you: `0` valid, `1` invalid (fix the\ndata), `3` incomplete (supply more), `4` the schema itself is\nunusable (fix the truth, not the data). Every finding carries\n`path`, `code`, and the sites on both sides — the data site first,\nbecause that is the one to edit. A site names **the file whose text\nit excerpts**, so its row and column are safe to edit at even when\nthe document loads others.\n\nRead `hint` before guessing. `message` is the one-line headline;\n`hint` is the engine's own explanation of the failure class with the\noffending values filled in, and for several codes it names the fix\noutright — `lossy_integer_literal` tells you to write the literal as\n`0d…`. It is absent for codes that have no hint text.\n\nFor a conflict, `aontu why <path> mine.aon` lists every contribution\nto that path with its role and source line, which turns \"these\ndisagree\" into \"these two lines disagree\".\n\nThen fix it:\n\n```\naontu set '$.replicas=5' --entry schema.aon --overlay mine.aon --in-place\n```\n\n`--in-place` rewrites the pinned literal **where it was written**, so\ncomments and layout survive. Without it, `set` APPENDS — which is the\nright thing when the document left a hole, and cannot work when it\npinned the wrong value, because unification only narrows.\n\nThe edit is verified before a byte is written: a site carries the\nsource text it covers, and the text at the span must match it. Where\nthat cannot be established — the value comes from a `&:` template or a\n`$ref`, two statements pin the path, the site names the opening token\nof a compound like `min(1)`, or the overlay `@\"includes\"` another\ndocument — the assignment is appended as usual and a **warning** says\nwhich case it hit. A warning never changes the verdict, so asking for\n`--in-place` cannot make a run fail that would have succeeded.\n"
+    },
+    {
+        "topic": "grammar",
+        "summary": "the published ABNF, for a parser or a constrained decoder",
+        "source": "grammar/aontu.abnf",
+        "text": "; Aontu --- published grammar (ABNF, RFC 5234 + RFC 7405).\n;\n; The same language as grammar/aontu.gbnf, rule for rule and name for\n; name, in the notation an RFC reader expects. The GBNF form is for a\n; constrained decoder; THIS form is for a person, and for the railroad\n; diagram in the language reference, which is generated from this file\n; (ts/scripts/figures.cjs).\n;\n; It covers the DOCUMENTED EMISSION SURFACE: what a model should be\n; allowed to write, which is a superset of JSON plus the operators,\n; constraints and marks the language's own canonical form emits. It is\n; CONSERVATIVE BY CONSTRUCTION --- it may accept less than the parser\n; does, never more. The same two deliberate exclusions the GBNF has:\n;\n;   - `@\"...\"` includes. A generated document should describe values,\n;     not reach for files.\n;   - Unquoted keys and the other spellings the parser tolerates.\n;     Canon quotes every key, and one spelling is what a grammar is\n;     for.\n;\n; TWO NOTATION CHOICES worth stating, because both are load-bearing.\n;\n; EVERY LITERAL IS CASE-SENSITIVE, spelled `%s\"...\"` (RFC 7405). A\n; plain `\"...\"` is case-INSENSITIVE in RFC 5234, and Aontu is not:\n; `TRUE` is a bare word and `true` is a boolean. The reader in\n; ts/scripts/abnf.cjs refuses a bare quoted string rather than guess\n; which was meant.\n;\n; ALTERNATION IS ORDERED. RFC 5234's `/` is formally unordered, and\n; the consumers of this file (a PEG-style matcher here, a railroad\n; renderer) take the first branch that matches. Where one spelling is\n; a prefix of another the longer comes first --- `exact` before\n; `number`, `refer` before `rem` before `re`, `biginteger` before\n; `boolean` --- so the ordered reading and the unordered one accept\n; the same language. ts/test/grammar.test.ts holds this file to the\n; whole canon corpus of test/spec/*.tsv, which is what proves it.\n\nroot      = ws value ws\n\n; No pipe. `|>` was parse-time sugar; it was removed, `x |> f(a)`\n; being written `f(x, a)`.\nvalue     = disjunct\n\ndisjunct  = conjunct *( ws %s\"|\" ws conjunct )\n\nconjunct  = prefixed *( ws %s\"&\" ws prefixed )\n\n; A preference marks the alternative a generation picks.\nprefixed  = %s\"*\" ws prefixed / sum\n\nsum       = atom *( ws %s\"+\" ws atom )\n\natom      = map\n          / list\n          / func\n          / ref\n          / kind\n          / place\n          / scalar\n          / %s\"(\" ws value ws %s\")\"\n\nmap       = %s\"{\" ws [ entry *( ws %s\",\" ws entry ) ws ] %s\"}\"\n\nentry     = spread / pair\n\n; The template every key of the bag must also satisfy.\nspread    = %s\"&\" ws %s\":\" ws value\n\npair      = string ws [ %s\"?\" ] ws %s\":\" ws value\n\n; A list ELEMENT is a value, not a pair --- only the template is keyed.\nlist      = %s\"[\" ws [ element *( ws %s\",\" ws element ) ws ] %s\"]\"\n\nelement   = spread / value\n\n; The builtins, applied. The name set is closed on purpose: an unknown\n; function is a parse-time error in the engine, so a grammar that\n; allowed any name would over-approximate.\nfunc      = name %s\"(\" ws [ value *( ws %s\",\" ws value ) ws ] %s\")\"\n\n; ORDER MATTERS where one name is a prefix of another: `refer` is\n; listed before `re`, and `rem` before `re` as well.\nname      = %s\"above\" / %s\"acyclic\" / %s\"add\" / %s\"below\" / %s\"close\"\n          / %s\"copy\" / %s\"deprecate\" / %s\"div\"\n          / %s\"each\" / %s\"emit\" / %s\"esc\" / %s\"filter\" / %s\"greatest\"\n          / %s\"hide\"\n          / %s\"inverse\" / %s\"join\" / %s\"key\" / %s\"least\"\n          / %s\"length\" / %s\"list\" / %s\"lower\" / %s\"map\" / %s\"match\"\n          / %s\"max\" / %s\"min\" / %s\"mod\" / %s\"move\"\n          / %s\"mul\" / %s\"must\"\n          / %s\"neq\"\n          / %s\"open\" / %s\"pack\" / %s\"path\" / %s\"pick\" / %s\"pref\"\n          / %s\"refer\" / %s\"rel\" / %s\"rem\" / %s\"rep\" / %s\"re\" / %s\"split\"\n          / %s\"super\"\n          / %s\"sub\" / %s\"sum\"\n          / %s\"type\"\n          / %s\"unique\" / %s\"upper\" / %s\"usc\"\n\n; A path reference, absolute from the document root. At least one\n; segment: a bare `$` is an incomplete expression, not a reference.\n; A RELATIVE reference has no `$`: `.n` names a sibling, resolved\n; against the enclosing map rather than the document root. Canon emits\n; one wherever a spread template survives unresolved, so a grammar\n; without it cannot parse this engine's own output. No conflict with\n; `number`: a numeric literal always starts with a digit or `-`.\nref       = %s\"$\" 1*( %s\".\" segment ) / 1*( %s\".\" segment )\n\n; No `-`: it is not a bare-text character (test/spec/op-chars.tsv pins\n; `a:6-2` as a parse error), so admitting it would over-approximate.\nsegment   = 1*( ALPHA / DIGIT / %s\"_\" )\n\n; The placeholder: a hole a call is filled through. BARE only --- `\"_\"`\n; is an ordinary string, and a longer bare word containing it is\n; ordinary text.\nplace     = %s\"_\"\n\n; `biginteger` before `bigdecimal` is not required (they differ at the\n; fourth character), but `biginteger` before `boolean` is: see the\n; ordered-alternation note above.\nkind      = %s\"biginteger\" / %s\"bigdecimal\" / %s\"boolean\" / %s\"float\"\n          / %s\"integer\" / %s\"number\" / %s\"string\" / %s\"top\" / %s\"nil\"\n\n; `exact` before `number`, or `0d5` would match `number` as the single\n; digit `0` and leave `d5` unconsumed.\nscalar    = string / exact / number / %s\"true\" / %s\"false\" / %s\"null\"\n\nstring    = DQUOTE *char DQUOTE\n\nchar      = unescaped / %x5C escape\n\n; Every code point but the quote and the backslash, which is what the\n; GBNF's `[^\"\\\\]` says. Control characters included: canon writes them\n; escaped, and a grammar that refused them would refuse less than the\n; parser accepts in the one direction this file may not.\nunescaped = %x00-21 / %x23-5B / %x5D-10FFFF\n\nescape    = DQUOTE / %x5C / %s\"/\" / %s\"b\" / %s\"f\" / %s\"n\" / %s\"r\"\n          / %s\"t\" / %s\"u\" hex hex hex hex\n\nhex       = DIGIT / %x41-46 / %x61-66\n\n; The exact leaves: arbitrary precision, spelled with the 0d marker.\nexact     = [ %s\"-\" ] %s\"0d\" digits [ %s\".\" digits ] [ exponent ]\n\nnumber    = [ %s\"-\" ] digits [ %s\".\" digits ] [ exponent ]\n\nexponent  = ( %s\"e\" / %s\"E\" ) [ %s\"-\" / %s\"+\" ] digits\n\ndigits    = 1*DIGIT\n\nws        = *( %x20 / %x09 / %x0A / %x0D )\n\n; RFC 5234's core rules, written out so this file stands alone.\nALPHA     = %x41-5A / %x61-7A\nDIGIT     = %x30-39\nDQUOTE    = %x22\n"
+    }
+];
+exports.HELPDOC = HELPDOC;
+const INITDOC = [
+    {
+        "file": "docs/skill/init/model.aon",
+        "name": "model.aon",
+        "mode": 420,
+        "text": "# model.aon --- the truth. `aontu vet model.aon data.aon` asks whether\n# a document satisfies it.\n#\n# `&:` is the construct to learn first: it meets EVERY key of the map\n# it sits in, so one statement constrains every entity. A quoted \"*\" is\n# not a wildcard -- it is a key named `*`, it meets nothing, and a\n# schema written that way reports `valid` over data that violates it.\n# `aontu vet --strict-coverage` refuses to pass such a check.\nentity: {\n  &: {\n    table: string & re(\"^[a-z][a-z0-9_]*$\")\n    fields: {\n      &: {\n        type: \"string\" | \"integer\" | \"boolean\"\n        required: *false | boolean\n      }\n    }\n  }\n}\n"
+    },
+    {
+        "file": "docs/skill/init/data.aon",
+        "name": "data.aon",
+        "mode": 420,
+        "text": "# data.aon --- an instance of the truth in model.aon. Edit it and run\n# check.sh: every change is checked against the model, and a change the\n# model refuses is named with the line it is on.\nentity: {\n  planet: {\n    table: \"planets\"\n    fields: {\n      name: { type: \"string\", required: true }\n      diameter: { type: \"integer\" }\n    }\n  }\n}\n"
+    },
+    {
+        "file": "docs/skill/init/check.sh",
+        "name": "check.sh",
+        "mode": 493,
+        "text": "#!/usr/bin/env sh\n# check.sh --- the four questions to ask of a model. Run it after\n# every edit to model.aon or data.aon.\n#\n# `aontu help tasks` maps a job to a verb; `aontu explain <code>` says\n# what a refusal means; `aontu help language` is the whole grammar on\n# one page. None of them needs a network.\nset -eu\n\nAONTU=\"${AONTU:-aontu}\"\ncd \"$(dirname \"$0\")\"\n\n# 1. Does the data satisfy the truth -- and did the check examine\n#    anything? --strict-coverage exits 1 on a check that constrained no\n#    value, which is the failure a passing gate hides.\n$AONTU vet --strict-coverage model.aon data.aon\n\n# 2. What does it say at a path?\n$AONTU get '$.entity.planet.table' data.aon\n\n# 3. Why does it say that? Every contribution, with the line it is on.\n$AONTU why '$.entity.planet.table' data.aon\n\n# 4. A pin for the truth: it survives reformatting and moves on any\n#    change of meaning.\n$AONTU hash model.aon\n\necho \"ok --- model.aon and data.aon agree\"\n"
+    }
+];
+exports.INITDOC = INITDOC;
+//# sourceMappingURL=helpdoc.js.map

package/dist/helpdoc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpdoc.js","sourceRoot":"","sources":["../src/helpdoc.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAcpD,MAAM,OAAO,GAAgB;IAC3B;QACE,OAAO,EAAE,OAAO;QAChB,SAAS,EAAE,8CAA8C;QACzD,QAAQ,EAAE,qBAAqB;QAC/B,MAAM,EAAE,0tKAA0tK;KACnuK;IACD;QACE,OAAO,EAAE,UAAU;QACnB,SAAS,EAAE,gEAAgE;QAC3E,QAAQ,EAAE,4BAA4B;QACtC,MAAM,EAAE,iuEAAiuE;KAC1uE;IACD;QACE,OAAO,EAAE,UAAU;QACnB,SAAS,EAAE,sDAAsD;QACjE,QAAQ,EAAE,wBAAwB;QAClC,MAAM,EAAE,uwEAAuwE;KAChxE;IACD;QACE,OAAO,EAAE,OAAO;QAChB,SAAS,EAAE,+CAA+C;QAC1D,QAAQ,EAAE,2BAA2B;QACrC,MAAM,EAAE,8mGAA8mG;KACvnG;IACD;QACE,OAAO,EAAE,SAAS;QAClB,SAAS,EAAE,2DAA2D;QACtE,QAAQ,EAAE,oBAAoB;QAC9B,MAAM,EAAE,m7MAAm7M;KAC57M;CACF,CAAA;QA+BQ,OAAO;AAtBhB,MAAM,OAAO,GAAe;IAC1B;QACE,MAAM,EAAE,2BAA2B;QACnC,MAAM,EAAE,WAAW;QACnB,MAAM,EAAE,GAAG;QACX,MAAM,EAAE,opBAAopB;KAC7pB;IACD;QACE,MAAM,EAAE,0BAA0B;QAClC,MAAM,EAAE,UAAU;QAClB,MAAM,EAAE,GAAG;QACX,MAAM,EAAE,2WAA2W;KACpX;IACD;QACE,MAAM,EAAE,0BAA0B;QAClC,MAAM,EAAE,UAAU;QAClB,MAAM,EAAE,GAAG;QACX,MAAM,EAAE,m+BAAm+B;KAC5+B;CACF,CAAA;QAGiB,OAAO"}

package/dist/hints.js

@@ -150,6 +150,16 @@ const hints = {
     render_unit: 'The unit asked for is not in the instance. The report names the\npath; the units are listed by `--format json`.',
     view_profile_unknown: 'The figure kind does not render into the profile asked for: there is no\ntext form of a node-link drawing and no Mermaid form of a matrix. The\nnote lists the profiles the kind declares; the first is its default.',
     format_check: 'The formatted text is not the same document, so nothing was written.\nThis is a formatter defect: please report it, with the source.',
+    // THIS PORT NEVER RAISES decimal_syntax -- Go's construct.go does,
+    // and go/hints.go's header records that the CODE is Go-only. The
+    // TEXT is here anyway, verbatim, because since G11 phase 3 this
+    // table is a LOOKUP surface as well as a message source: the code is
+    // in the shared registry (test/spec/errcodes.tsv), so
+    // `aontu explain decimal_syntax` must answer the same in both ports
+    // or the agent that met the error under one binary learns nothing
+    // from the other. An entry for a code this port cannot raise is
+    // never read on an error path, only on that lookup.
+    decimal_syntax: 'This 0d literal is not a valid exact number.',
     view_style_profile: 'Each profile has ONE way to carry the meaning of a figure\'s marks:\nSGR escapes for text, CSS classes for svg. Asking for the other one is\na usage error rather than a silent no-op. `none` works everywhere.',
     view_style_unknown: 'The styles are none, ansi and css, plus `auto` at the command line,\nwhich the command resolves before the library runs: whether the\ndestination is a terminal is not something a library can see.',
     view_rows_exceeded: 'The figure has more rows than --max-rows allows. This is a REFUSAL,\nnot a truncation: a view that quietly omits things is the failure the\nverb exists to avoid. Narrow the figure with --at or --relation, or\nraise the limit.',
@@ -162,7 +172,7 @@ const hints = {
     view_document_shape: 'A view document declares each figure as a map of view options --\nthe flag names without the dashes -- and every declaration must name\nits `kind` and the `out` file it draws into. This one names an option\nthat is not one, gives a value of the wrong shape, or leaves out what\nevery declaration needs. `aontu view --help` lists the options.',
     pack_data: 'The first argument to pack() is not a bag. `pack` makes one child\nper child of its DATA, so the data has to have children: a list of\nnames, or a map whose keys are the names.\n \nExamples:\n  pack([a,b], {x:1})     -> {..}  # A list of names;\n  pack({a:1,b:2}, {x:1}) -> {..}  # ... or a map, keyed by its keys;\n  pack(1, {x:1})         -> nil   # ... but a scalar has no children.',
     pack_key: 'A list packed by pack() holds something that is not a string. The\nelements of a packed list ARE the generated keys, and only a string\nis a key — an element keyed by its position would churn every\ngenerated child the moment the list was reordered.\n \nExamples:\n  pack([a,b], {x:1})   -> {..}  # Names;\n  pack(["a b"], {x:1}) -> {..}  # ... a quoted name is still a name;\n  pack([1,2], {x:1})   -> nil   # ... but a number is not one.',
-    each_data: 'The first argument to each() is not a bag. `each` makes one list\nelement per child of its DATA, so the data has to have children: a\nlist, or a map whose values become the elements in sorted-key order.\n \nExamples:\n  each([1,2])       -> [..]  # A list, in source order;\n  each({b:2,a:1})   -> [..]  # ... a map, in sorted-key order;\n  each(1)           -> nil   # ... but a scalar has no children.',
+    each_data: 'The first argument to each() is not a bag. `each` makes one list\nelement per child of its DATA, so the data has to have children: a\nlist, or a map whose values are taken in sorted-key order.\n \nExamples:\n  each([a,b], upper(_))  -> [..]  # A list, in source order;\n  each({b:2,a:1}, _)     -> [..]  # ... a map, in sorted-key order;\n  each(1, _)             -> nil   # ... but a scalar has no children.',
     filter_data: 'The first argument to filter() is not a bag. `filter` keeps the\nchildren of its DATA that already satisfy a condition, so the data\nhas to have children: a list, or a map.\n \nExamples:\n  filter([1,x], integer)      -> [..]  # A list;\n  filter({a:1,b:x}, integer)  -> {..}  # ... or a map, keys kept;\n  filter(1, integer)          -> nil   # ... but a scalar has none.',
     match_none: 'No pattern matched, and there is no default. `match` tries each\npattern in the order written and takes the first the value unifies\nwith; the value {value} unified with none of {tried}. Add a trailing\ndefault — the argument after the last pair — if the rest was meant\nto be allowed.\n \nExamples:\n  match(1, integer, ok)             -> "ok"   # The first pattern matches;\n  match(x, integer, ok, other)      -> "other"  # ... or the default does;\n  match(x, integer, ok)             -> nil    # ... but nothing here does.',
     emit_data: 'The first argument to emit() is not a bag. `emit` visits the\nchildren of its SELECTION, so the selection has to have children: a\nlist of nodes, or a map whose values are the nodes.\n \nExamples:\n  emit([{k:1}], {match:{k:1},body:[a]})   -> [..]  # A list of nodes;\n  emit({x:{k:1}}, {match:{k:1},body:[a]}) -> [..]  # ... or a map of them;\n  emit(1, {match:{k:1},body:[a]})         -> nil   # ... but not a scalar.',
@@ -174,6 +184,9 @@ const hints = {
     replace_overlap: "Two keys of a template's `replace` map overlap: {key} is inside\n{other}. A replacement is one left-to-right scan of the body's literal\ntext taking the longest key at each position, and a key inside\nanother is ambiguous whatever the order -- so it is refused on the\ntemplate, before any node is visited.\n \nExamples:\n  replace: {PIN: .pin, MSG: .msg}  # Two keys, neither inside the other;\n  replace: {PIN: .pin}            # ... or one alone;\n  replace: {P: .p, PIN: .pin}     # ... but P is inside PIN.",
     replace_unused: 'A key of a template\'s `replace` map matches nothing: {key} appears\nin none of the body\'s literal lines. A replacement key is an exact\nstring the body already holds as ordinary target text, so a key the\nbody does not hold means the template drifted from its map -- refused\nbefore any node is visited, since the drift is the same for every\nnode.\n \nExamples:\n  {replace: {PIN: .pin}, body: ["listen(PIN)"]}  # The body holds PIN;\n  {replace: {PIN: .pin}, body: ["pin: PIN"]}     # ... anywhere in a line;\n  {replace: {PIN: .pin}, body: ["listen(pin)"]}  # ... but not here.',
     replace_value: 'A replacement value is not text: the `replace` key {key} came to\n{value} at the node. A value reaches the body as a string -- a number\nor a boolean spells itself, as it does after `+` -- and it has to\nhave settled by the time the dispatch fires, so a map, a list, a\nnull or a value still unresolved is refused rather than written into\na file as something else.\n \nExamples:\n  replace: {PIN: .pin}    # A string field;\n  replace: {PORT: .port}  # ... or a number, as digits;\n  replace: {ALL: _}       # ... but the node itself is a map.',
+    // RETIRED with the name `form` (ADR-027): the function is `each` now
+    // and answers `each_data`. Registered still, errcodes.tsv being
+    // append-only, so a code a released engine raised keeps its meaning.
     form_data: 'The first argument to form() is not a bag. `form` makes one list\nelement per child of its DATA, so the data has to have children: a\nlist, or a map whose values are taken in sorted-key order.\n \nExamples:\n  form([a,b], upper(_))  -> [..]  # A list, in source order;\n  form({b:2,a:1}, _)     -> [..]  # ... a map, in sorted-key order;\n  form(1, _)             -> nil   # ... but a scalar has no children.',
     esc_variant: 'esc(), usc() or a template\'s `esc:` key were given a variant that\nnames no convention.\nA variant names a CONVENTION rather than a language, because several\nlanguages share one and one language has several. The names are `sq`,\n`sql`, `shell`, `xml`, `uri` and `regex`; written with no variant at\nall it is the C escape, JSON canonical, which covers the double-quoted\nliteral of every C-family language.\n \nExamples:\n  esc(text)          -> ...   # C / JSON, the default;\n  esc(text, sq)      -> ...   # ... single-quoted C-family;\n  esc(text, pascal)  -> nil   # ... but that is not a convention.',
     usc_malformed: 'usc() was given text the convention could not have produced,\nso there is nothing to read back out: a truncated code-point escape, an\nescape the convention does not define, or an escape character standing\nalone where the convention doubles it. `usc` is the LEFT inverse of\n`esc` and it is partial — every escaped value has an original, but not\nevery string is an escaped value.\n \nExamples:\n  usc(esc(text))     -> ...   # Whatever esc() wrote;\n  usc(text, sql)     -> ...   # ... in the same convention;\n  usc(text, shell)   -> nil   # ... but not in another one.',
@@ -488,7 +501,7 @@ const codeClasses = {
     // template checks are class `parse`: what is wrong is the TEMPLATE
     // as written, before any node. `replace_value` is class `conflict`:
     // the node's value and the body that wanted text disagreed.
-    // `form_data` is `each_data`'s twin.
+    // `form_data` is `each_data`'s retired twin (ADR-027).
     replace_overlap: 'parse',
     replace_unused: 'parse',
     replace_value: 'conflict',

package/dist/hints.js.map

@@ -1 +1 @@
-{"version":3,"file":"hints.js","sourceRoot":"","sources":["../src/hints.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;QA+wBlD,SAAS;AA7wBX;;;;;GAKG;AAEH,MAAM,KAAK,GAA2B;IAEpC,YAAY,EACV,qEAAqE;QACrE,gBAAgB;QAChB,kBAAkB;QAClB,oDAAoD;QACpD,mDAAmD;QACnD,0DAA0D;QAC1D,8DAA8D;IAEhE,WAAW,EACT,wDAAwD;QACxD,kBAAkB;QAClB,oDAAoD;QACpD,iEAAiE;QACjE,8DAA8D;IAEhE,OAAO,EACL,kEAAkE;QAClE,+CAA+C;IAEjD,MAAM,EACJ,qEAAqE;QACrE,oCAAoC;IAEtC,eAAe,EACb,uEAAuE;QACvE,qEAAqE;QACrE,qEAAqE;QACrE,yBAAyB;IAG3B,6DAA6D;IAC7D,eAAe,EAAE,6BAA6B;IAE9C,aAAa,EACX,qEAAqE;QACrE,oCAAoC;IAEtC,sBAAsB,EACpB,0DAA0D;IAE5D,gBAAgB,EAAE,gCAAgC;IAElD,cAAc,EACZ,4EAA4E;QAC5E,oCAAoC;IAEtC,uBAAuB,EACrB,0DAA0D;IAE5D,gBAAgB,EACd,uCAAuC;IAEzC,WAAW,EACT,kDAAkD;IAEpD,WAAW,EAAE,iDAAiD;IAE9D,iBAAiB,EACf,kEAAkE;QAClE,qEAAqE;QACrE,sEAAsE;QACtE,gEAAgE;QAChE,kBAAkB;QAClB,yEAAyE;QACzE,mEAAmE;QACnE,0EAA0E;QAC1E,0EAA0E;IAE5E,UAAU,EACR,mEAAmE;QACnE,qEAAqE;QACrE,8DAA8D;QAC9D,kCAAkC;QAClC,kBAAkB;QAClB,gEAAgE;QAChE,uEAAuE;QACvE,8DAA8D;QAC9D,wEAAwE;QACxE,oEAAoE;QACpE,0EAA0E;QAC1E,qEAAqE;IAEvE,IAAI,EACF,gEAAgE;QAChE,qCAAqC;QACrC,OAAO;QACP,oEAAoE;QACpE,qEAAqE;QACrE,gEAAgE;QAChE,mEAAmE;QACnE,mEAAmE;QACnE,qBAAqB;QACrB,kBAAkB;QAClB,kEAAkE;QAClE,oEAAoE;QACpE,yEAAyE;QACzE,oEAAoE;IAEtE,kBAAkB,EAChB,8DAA8D;QAC9D,aAAa;QACb,KAAK;QACL,gEAAgE;QAChE,qDAAqD;QACrD,KAAK;QACL,oFAAoF;QACpF,uCAAuC;QACvC,mDAAmD;QACnD,+DAA+D;QAC/D,uDAAuD;QACvD,2CAA2C;QAC3C,KAAK;QACL,iEAAiE;QACjE,2DAA2D;QAC3D,sEAAsE;QACtE,8DAA8D;QAC9D,KAAK;QACL,+DAA+D;QAC/D,UAAU;QACV,mEAAmE;QACnE,wDAAwD;QACxD,wDAAwD;QACxD,2DAA2D;QAC3D,kEAAkE;QAClE,yCAAyC;QACzC,kBAAkB;QAClB,sCAAsC;QACtC,wCAAwC;QACxC,4DAA4D;QAC5D,qDAAqD;QACrD,2DAA2D;IAE7D,aAAa,EACX,qEAAqE;QACrE,iDAAiD;QACjD,sEAAsE;QACtE,qEAAqE;QACrE,gDAAgD;IAElD,QAAQ,EACN,sEAAsE;QACtE,wBAAwB;IAE1B,OAAO,EAAE,wCAAwC;QAC/C,kBAAkB;QAClB,uFAAuF;QACvF,kGAAkG;IAEpG,iBAAiB;IACjB,eAAe,EAAE,6EAA6E;IAE9F,cAAc,EAAE,+XAA+X;IAE/Y,cAAc,EAAE,oeAAoe;IACpf,iBAAiB,EAAE,ivBAAivB;IAEpwB,UAAU,EAAE,+YAA+Y;IAC3Z,QAAQ,EAAE,8lBAA8lB;IAExmB,YAAY,EAAE,kaAAka;IAEhb,WAAW,EAAE,wjBAAwjB;IAErkB,UAAU,EAAE,yqBAAyqB;IAKrrB,oBAAoB,EAAE,wcAAwc;IAC9d,gBAAgB,EAAE,2SAA2S;IAC7T,WAAW,EAAE,2ZAA2Z;IACxa,cAAc,EAAE,8aAA8a;IAC9b,wBAAwB,EAAE,keAAke;IAC5f,YAAY,EAAE,gXAAgX;IAC9X,WAAW,EAAE,8gBAA8gB;IAC3hB,aAAa,EAAE,8jBAA8jB;IAE7kB,YAAY,EAAE,ioBAAioB;IAE/oB,cAAc,EAAE,2PAA2P;IAC3Q,gBAAgB,EAAE,+gBAA+gB;IACjiB,qBAAqB,EAAE,qRAAqR;IAE5S,iBAAiB,EAAE,4IAA4I;IAE/J,WAAW,EAAE,iIAAiI;IAC9I,WAAW,EAAE,8MAA8M;IAC3N,cAAc,EAAE,mPAAmP;IACnQ,aAAa,EAAE,6LAA6L;IAC5M,WAAW,EAAE,iHAAiH;IAC9H,oBAAoB,EAAE,sNAAsN;IAE5O,YAAY,EAAE,sIAAsI;IACpJ,kBAAkB,EAAE,iNAAiN;IACrO,kBAAkB,EAAE,qMAAqM;IAEzN,kBAAkB,EAAE,mOAAmO;IAEvP,eAAe,EAAE,kMAAkM;IAEnN,uBAAuB,EAAE,6KAA6K;IAEtM,eAAe,EAAE,yOAAyO;IAE1P,kBAAkB,EAAE,0HAA0H;IAE9I,gBAAgB,EAAE,6HAA6H;IAE/I,mBAAmB,EAAE,kKAAkK;IACvL,mBAAmB,EAAE,uVAAuV;IAE5W,SAAS,EAAE,mYAAmY;IAE9Y,QAAQ,EAAE,ybAAyb;IAEnc,SAAS,EAAE,qZAAqZ;IAEha,WAAW,EAAE,sXAAsX;IAEnY,UAAU,EAAE,ihBAAihB;IAE7hB,SAAS,EAAE,qaAAqa;IAEhb,UAAU,EAAE,6ZAA6Z;IAEza,aAAa,EAAE,wdAAwd;IAEve,SAAS,EAAE,0cAA0c;IAErd,QAAQ,EAAE,wlBAAwlB;IAElmB,SAAS,EAAE,ijBAAijB;IAE5jB,eAAe,EAAE,igBAAigB;IAElhB,cAAc,EAAE,wkBAAwkB;IAExlB,aAAa,EAAE,kiBAAkiB;IAEjjB,SAAS,EAAE,0ZAA0Z;IAEra,WAAW,EAAE,gmBAAgmB;IAE7mB,aAAa,EAAE,8jBAA8jB;IAE7kB,WAAW,EAAE,2dAA2d;IAExe,OAAO,EAAE,ylBAAylB;IAElmB,SAAS,EAAE,ifAAif;IAE5f,UAAU,EAAE,4aAA4a;IAGxb,WAAW,EAAE,6nBAA6nB;IAC1oB,cAAc,EAAE,ghBAAghB;IAEhiB,gBAAgB,EAAE,ijBAAijB;IAEnkB,YAAY,EAAE,4iBAA4iB;IAE1jB,qBAAqB;IACrB,cAAc,EAAE,yEAAyE;IACzF,cAAc,EAAE,kEAAkE;IAClF,OAAO,EAAE,gFAAgF;IAEzF,UAAU,EAAE,mGAAmG;IAE/G,uBAAuB;IAEvB,cAAc,EACZ,iEAAiE;QACjE,iEAAiE;QACjE,8DAA8D;QAC9D,+DAA+D;QAC/D,2BAA2B;QAC3B,kBAAkB;QAClB,8DAA8D;QAC9D,iEAAiE;QACjE,iDAAiD;IAEnD,qBAAqB,EACnB,gEAAgE;QAChE,kEAAkE;QAClE,kEAAkE;QAClE,qCAAqC;QACrC,qEAAqE;QACrE,oEAAoE;QACpE,kBAAkB;QAClB,8DAA8D;QAC9D,gEAAgE;QAChE,uEAAuE;QACvE,8DAA8D;QAC9D,4DAA4D;IAE9D,eAAe,EACb,yDAAyD;QACzD,4DAA4D;QAC5D,+DAA+D;QAC/D,mEAAmE;QACnE,qEAAqE;QACrE,sEAAsE;QACtE,yCAAyC;QACzC,kBAAkB;QAClB,kEAAkE;QAClE,6DAA6D;QAC7D,qEAAqE;QACrE,oDAAoD;QACpD,iEAAiE;IAEnE,QAAQ,EACN,8DAA8D;QAC9D,+DAA+D;QAC/D,mEAAmE;QACnE,iEAAiE;QACjE,6DAA6D;QAC7D,kBAAkB;QAClB,8DAA8D;QAC9D,mEAAmE;QACnE,qEAAqE;IAEvE,WAAW,EACT,mEAAmE;QACnE,sEAAsE;QACtE,mEAAmE;QACnE,kEAAkE;QAClE,kEAAkE;QAClE,oEAAoE;QACpE,6DAA6D;QAC7D,gEAAgE;QAChE,kBAAkB;QAClB,mEAAmE;QACnE,6DAA6D;QAC7D,4DAA4D;QAC5D,kEAAkE;QAClE,sDAAsD;IAExD,cAAc,EACZ,+DAA+D;QAC/D,kEAAkE;QAClE,gEAAgE;QAChE,2BAA2B;QAC3B,kBAAkB;QAClB,0CAA0C;QAC1C,+DAA+D;QAC/D,yDAAyD;QACzD,4DAA4D;IAE9D,eAAe,EACb,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,qEAAqE;QACrE,oBAAoB;QACpB,kBAAkB;QAClB,yDAAyD;QACzD,wEAAwE;QACxE,yDAAyD;IAE3D,cAAc,EACZ,qEAAqE;QACrE,gEAAgE;QAChE,mEAAmE;QACnE,sEAAsE;QACtE,8DAA8D;QAC9D,uBAAuB;QACvB,kBAAkB;QAClB,+CAA+C;QAC/C,sDAAsD;QACtD,+DAA+D;IAEjE,cAAc,EACZ,iEAAiE;QACjE,iEAAiE;QACjE,qEAAqE;QACrE,+DAA+D;QAC/D,mEAAmE;QACnE,mCAAmC;QACnC,kBAAkB;QAClB,yEAAyE;QACzE,mEAAmE;QACnE,0DAA0D;QAC1D,kEAAkE;QAClE,qEAAqE;IAEvE,cAAc,EACZ,qEAAqE;QACrE,qEAAqE;QACrE,mEAAmE;QACnE,qEAAqE;QACrE,oDAAoD;QACpD,oEAAoE;QACpE,cAAc;QACd,kBAAkB;QAClB,qDAAqD;QACrD,2DAA2D;QAC3D,kEAAkE;IAEpE,mBAAmB,EACjB,qEAAqE;QACrE,gEAAgE;QAChE,yBAAyB;QACzB,kEAAkE;QAClE,iEAAiE;QACjE,SAAS;QACT,kBAAkB;QAClB,uEAAuE;QACvE,oEAAoE;QACpE,kEAAkE;IAEpE,aAAa,EACX,oEAAoE;QACpE,oEAAoE;QACpE,wEAAwE;QACxE,uEAAuE;QACvE,QAAQ;QACR,kBAAkB;QAClB,sEAAsE;QACtE,4DAA4D;QAC5D,oEAAoE;IAEtE,iBAAiB,EACf,wEAAwE;QACxE,kBAAkB;QAClB,yDAAyD;QACzD,2DAA2D;QAC3D,4EAA4E;QAC5E,4EAA4E;IAE9E,iBAAiB,EAAE,mDAAmD;IACtE,KAAK,EAAE,+DAA+D;IACtE,MAAM,EAAE,gEAAgE;IAExE,kBAAkB;IAClB,KAAK,EAAE,mFAAmF;IAC1F,aAAa,EAAE,qFAAqF;IACpG,WAAW,EAAE,uXAAuX;IACpY,cAAc,EAAE,uFAAuF;IAEvG,kBAAkB;IAClB,aAAa,EAAE,gEAAgE;IAC/E,kBAAkB,EAAE,4EAA4E;IAEhG,4BAA4B;IAC5B,UAAU,EAAE,8DAA8D;IAC1E,KAAK,EAAE,0EAA0E;IAEjF,2BAA2B;IAC3B,QAAQ,EAAE,kGAAkG;IAC5G,mBAAmB,EAAE,6EAA6E;IAElG,2CAA2C;IAC3C,OAAO,EAAE,+DAA+D;IACxE,YAAY,EAAE,kFAAkF;IAEhG,gEAAgE;IAChE,uCAAuC;IACvC,iBAAiB,EAAE,yCAAyC;QAC1D,6DAA6D;QAC7D,+BAA+B;IAEjC,WAAW,EAAE,8CAA8C;IAE3D,qCAAqC;IACrC,MAAM,EAAE,wEAAwE;IAChF,MAAM,EAAE,iFAAiF;IACzF,SAAS,EAAE,wFAAwF;IACnG,SAAS,EAAE,6EAA6E;IAExF,qCAAqC;IACrC,IAAI,EAAE,wEAAwE;IAE9E,kBAAkB;IAClB,OAAO,EAAE,+DAA+D;IAExE,6CAA6C;IAC7C,OAAO,EAAE,kBAAkB;IAC3B,KAAK,EAAE,kBAAkB;IACzB,MAAM,EAAE,uBAAuB;IAC/B,MAAM,EAAE,mBAAmB;IAC3B,KAAK,EAAE,wBAAwB;CAChC,CAAA;QAgSC,KAAK;AA7RP,wEAAwE;AACxE,+DAA+D;AAC/D,uEAAuE;AACvE,uEAAuE;AACvE,oEAAoE;AACpE,sEAAsE;AACtE,qEAAqE;AACrE,uEAAuE;AACvE,kDAAkD;AAClD,MAAM,WAAW,GAA2B;IAC1C,oDAAoD;IACpD,KAAK,EAAE,OAAO;IACd,MAAM,EAAE,OAAO;IACf,aAAa,EAAE,OAAO;IACtB,aAAa,EAAE,OAAO;IACtB,cAAc,EAAE,OAAO;IACvB,cAAc,EAAE,OAAO;IACvB,iBAAiB,EAAE,OAAO;IAE1B,kEAAkE;IAClE,qEAAqE;IACrE,mEAAmE;IACnE,qBAAqB;IACrB,eAAe,EAAE,QAAQ;IACzB,qBAAqB,EAAE,QAAQ;IAC/B,sBAAsB,EAAE,QAAQ;IAChC,oBAAoB,EAAE,QAAQ;IAC9B,cAAc,EAAE,QAAQ;IACxB,yBAAyB,EAAE,QAAQ;IACnC,yBAAyB,EAAE,QAAQ;IACnC,iBAAiB,EAAE,QAAQ;IAC3B,yBAAyB,EAAE,QAAQ;IACnC,UAAU,EAAE,QAAQ;IACpB,iBAAiB,EAAE,QAAQ;IAE3B,kEAAkE;IAClE,8DAA8D;IAC9D,sDAAsD;IACtD,gBAAgB,EAAE,OAAO;IACzB,kBAAkB,EAAE,WAAW;IAC/B,eAAe,EAAE,WAAW;IAC5B,mBAAmB,EAAE,UAAU;IAE/B,8DAA8D;IAC9D,kEAAkE;IAClE,gEAAgE;IAChE,4DAA4D;IAC5D,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,gBAAgB,EAAE,WAAW;IAC7B,cAAc,EAAE,WAAW;IAE3B,gEAAgE;IAChE,mEAAmE;IACnE,8BAA8B;IAC9B,qBAAqB,EAAE,WAAW;IAClC,iBAAiB,EAAE,WAAW;IAC9B,oBAAoB,EAAE,WAAW;IACjC,kBAAkB,EAAE,WAAW;IAC/B,kBAAkB,EAAE,WAAW;IAC/B,qEAAqE;IACrE,gEAAgE;IAChE,mEAAmE;IACnE,4CAA4C;IAC5C,WAAW,EAAE,OAAO;IACpB,WAAW,EAAE,UAAU;IACvB,cAAc,EAAE,OAAO;IACvB,aAAa,EAAE,UAAU;IACzB,WAAW,EAAE,WAAW;IACxB,oEAAoE;IACpE,qEAAqE;IACrE,YAAY,EAAE,UAAU;IACxB,kBAAkB,EAAE,QAAQ;IAC5B,eAAe,EAAE,OAAO;IACxB,uBAAuB,EAAE,WAAW;IACpC,eAAe,EAAE,WAAW;IAC5B,kBAAkB,EAAE,WAAW;IAC/B,gBAAgB,EAAE,WAAW;IAC7B,mBAAmB,EAAE,WAAW;IAChC,mBAAmB,EAAE,WAAW;IAGhC,iEAAiE;IACjE,+DAA+D;IAC/D,0DAA0D;IAC1D,YAAY,EAAE,OAAO;IAErB,gEAAgE;IAChE,oEAAoE;IACpE,oEAAoE;IACpE,yBAAyB;IACzB,SAAS,EAAE,OAAO;IAClB,QAAQ,EAAE,OAAO;IACjB,SAAS,EAAE,OAAO;IAElB,kEAAkE;IAClE,+DAA+D;IAC/D,oEAAoE;IACpE,gEAAgE;IAChE,0CAA0C;IAC1C,WAAW,EAAE,OAAO;IACpB,UAAU,EAAE,UAAU;IAEtB,iEAAiE;IACjE,kEAAkE;IAClE,oEAAoE;IACpE,oEAAoE;IACpE,iEAAiE;IACjE,oEAAoE;IACpE,uCAAuC;IACvC,WAAW,EAAE,OAAO;IACpB,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,OAAO,EAAE,OAAO;IAChB,SAAS,EAAE,OAAO;IAElB,gEAAgE;IAChE,oEAAoE;IACpE,+DAA+D;IAC/D,iEAAiE;IACjE,mDAAmD;IACnD,SAAS,EAAE,OAAO;IAClB,UAAU,EAAE,OAAO;IACnB,aAAa,EAAE,OAAO;IACtB,SAAS,EAAE,OAAO;IAClB,SAAS,EAAE,UAAU;IACrB,QAAQ,EAAE,UAAU;IAEpB,4DAA4D;IAC5D,mEAAmE;IACnE,oEAAoE;IACpE,4DAA4D;IAC5D,qCAAqC;IACrC,eAAe,EAAE,OAAO;IACxB,cAAc,EAAE,OAAO;IACvB,aAAa,EAAE,UAAU;IACzB,SAAS,EAAE,OAAO;IAElB,kEAAkE;IAClE,8DAA8D;IAC9D,eAAe;IACf,UAAU,EAAE,UAAU;IAEtB,oEAAoE;IACpE,kEAAkE;IAClE,6DAA6D;IAC7D,8BAA8B;IAC9B,WAAW,EAAE,OAAO;IACpB,cAAc,EAAE,OAAO;IACvB,gBAAgB,EAAE,OAAO;IACzB,YAAY,EAAE,QAAQ;IAEtB,iEAAiE;IACjE,qEAAqE;IACrE,mEAAmE;IACnE,kEAAkE;IAClE,cAAc,EAAE,UAAU;IAC1B,wBAAwB,EAAE,UAAU;IACpC,YAAY,EAAE,OAAO;IACrB,WAAW,EAAE,UAAU;IACvB,oBAAoB,EAAE,YAAY;IAClC,gBAAgB,EAAE,QAAQ;IAC1B,UAAU,EAAE,OAAO;IACnB,YAAY,EAAE,OAAO;IACrB,YAAY,EAAE,OAAO;IACrB,qBAAqB,EAAE,OAAO;IAC9B,iBAAiB,EAAE,OAAO;IAC1B,kBAAkB,EAAE,OAAO;IAC3B,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,UAAU,EAAE,OAAO;IACnB,UAAU,EAAE,OAAO;IACnB,QAAQ,EAAE,OAAO;IACjB,cAAc,EAAE,OAAO;IAEvB,kEAAkE;IAClE,mEAAmE;IACnE,4DAA4D;IAC5D,UAAU,EAAE,UAAU;IACtB,IAAI,EAAE,UAAU;IAChB,kBAAkB,EAAE,UAAU;IAC9B,YAAY,EAAE,UAAU;IACxB,WAAW,EAAE,UAAU;IACvB,eAAe,EAAE,UAAU;IAC3B,aAAa,EAAE,UAAU;IACzB,iBAAiB,EAAE,UAAU;IAC7B,GAAG,EAAE,UAAU;IACf,IAAI,EAAE,UAAU;IAChB,MAAM,EAAE,UAAU;IAClB,WAAW,EAAE,UAAU;IACvB,OAAO,EAAE,UAAU;IACnB,KAAK,EAAE,UAAU;IACjB,OAAO,EAAE,UAAU;IACnB,YAAY,EAAE,UAAU;IACxB,eAAe,EAAE,UAAU;IAC3B,eAAe,EAAE,UAAU;IAC3B,mBAAmB,EAAE,UAAU;IAC/B,QAAQ,EAAE,UAAU;IACpB,cAAc,EAAE,UAAU;IAC1B,eAAe,EAAE,UAAU;IAC3B,WAAW,EAAE,UAAU;IACvB,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,qBAAqB,EAAE,UAAU;IACjC,GAAG,EAAE,UAAU;IACf,aAAa,EAAE,UAAU;IACzB,QAAQ,EAAE,UAAU;IACpB,YAAY,EAAE,UAAU;IACxB,SAAS,EAAE,UAAU;IACrB,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,UAAU;IACnB,EAAE,EAAE,UAAU;IACd,KAAK,EAAE,UAAU;IACjB,KAAK,EAAE,UAAU;IACjB,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,UAAU;IACnB,OAAO,EAAE,UAAU;IACnB,KAAK,EAAE,UAAU;IAEjB,mEAAmE;IACnE,MAAM,EAAE,YAAY;IACpB,eAAe,EAAE,YAAY;IAC7B,QAAQ,EAAE,YAAY;IACtB,aAAa,EAAE,YAAY;IAC3B,eAAe,EAAE,YAAY;IAC7B,sBAAsB,EAAE,YAAY;IACpC,cAAc,EAAE,YAAY;IAC5B,gBAAgB,EAAE,YAAY;IAC9B,uBAAuB,EAAE,YAAY;IACrC,iBAAiB,EAAE,YAAY;IAE/B,oDAAoD;IACpD,OAAO,EAAE,WAAW;IACpB,kEAAkE;IAClE,oEAAoE;IACpE,kEAAkE;IAClE,oBAAoB;IACpB,UAAU,EAAE,WAAW;IACvB,GAAG,EAAE,WAAW;IAChB,MAAM,EAAE,WAAW;IACnB,GAAG,EAAE,WAAW;IAChB,MAAM,EAAE,WAAW;IACnB,WAAW,EAAE,WAAW;IACxB,gBAAgB,EAAE,WAAW;IAC7B,gBAAgB,EAAE,WAAW;IAC7B,qBAAqB,EAAE,WAAW;IAElC,6CAA6C;IAC7C,WAAW,EAAE,QAAQ;IACrB,SAAS,EAAE,QAAQ;IACnB,aAAa,EAAE,QAAQ;IAEvB,6DAA6D;IAC7D,QAAQ,EAAE,UAAU;IACpB,YAAY,EAAE,UAAU;IACxB,UAAU,EAAE,UAAU;CACvB,CAAA;QA4BC,WAAW;AAzBb,uEAAuE;AACvE,sEAAsE;AACtE,oDAAoD;AACpD,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;AAG7D,gEAAgE;AAChE,8DAA8D;AAC9D,2DAA2D;AAC3D,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;QAChB,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,OAAO,WAAW,CAAC,MAAM,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAA;AACnB,CAAC,CAAC,iCAAiC"}
+{"version":3,"file":"hints.js","sourceRoot":"","sources":["../src/hints.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;QA6xBlD,SAAS;AA3xBX;;;;;GAKG;AAEH,MAAM,KAAK,GAA2B;IAEpC,YAAY,EACV,qEAAqE;QACrE,gBAAgB;QAChB,kBAAkB;QAClB,oDAAoD;QACpD,mDAAmD;QACnD,0DAA0D;QAC1D,8DAA8D;IAEhE,WAAW,EACT,wDAAwD;QACxD,kBAAkB;QAClB,oDAAoD;QACpD,iEAAiE;QACjE,8DAA8D;IAEhE,OAAO,EACL,kEAAkE;QAClE,+CAA+C;IAEjD,MAAM,EACJ,qEAAqE;QACrE,oCAAoC;IAEtC,eAAe,EACb,uEAAuE;QACvE,qEAAqE;QACrE,qEAAqE;QACrE,yBAAyB;IAG3B,6DAA6D;IAC7D,eAAe,EAAE,6BAA6B;IAE9C,aAAa,EACX,qEAAqE;QACrE,oCAAoC;IAEtC,sBAAsB,EACpB,0DAA0D;IAE5D,gBAAgB,EAAE,gCAAgC;IAElD,cAAc,EACZ,4EAA4E;QAC5E,oCAAoC;IAEtC,uBAAuB,EACrB,0DAA0D;IAE5D,gBAAgB,EACd,uCAAuC;IAEzC,WAAW,EACT,kDAAkD;IAEpD,WAAW,EAAE,iDAAiD;IAE9D,iBAAiB,EACf,kEAAkE;QAClE,qEAAqE;QACrE,sEAAsE;QACtE,gEAAgE;QAChE,kBAAkB;QAClB,yEAAyE;QACzE,mEAAmE;QACnE,0EAA0E;QAC1E,0EAA0E;IAE5E,UAAU,EACR,mEAAmE;QACnE,qEAAqE;QACrE,8DAA8D;QAC9D,kCAAkC;QAClC,kBAAkB;QAClB,gEAAgE;QAChE,uEAAuE;QACvE,8DAA8D;QAC9D,wEAAwE;QACxE,oEAAoE;QACpE,0EAA0E;QAC1E,qEAAqE;IAEvE,IAAI,EACF,gEAAgE;QAChE,qCAAqC;QACrC,OAAO;QACP,oEAAoE;QACpE,qEAAqE;QACrE,gEAAgE;QAChE,mEAAmE;QACnE,mEAAmE;QACnE,qBAAqB;QACrB,kBAAkB;QAClB,kEAAkE;QAClE,oEAAoE;QACpE,yEAAyE;QACzE,oEAAoE;IAEtE,kBAAkB,EAChB,8DAA8D;QAC9D,aAAa;QACb,KAAK;QACL,gEAAgE;QAChE,qDAAqD;QACrD,KAAK;QACL,oFAAoF;QACpF,uCAAuC;QACvC,mDAAmD;QACnD,+DAA+D;QAC/D,uDAAuD;QACvD,2CAA2C;QAC3C,KAAK;QACL,iEAAiE;QACjE,2DAA2D;QAC3D,sEAAsE;QACtE,8DAA8D;QAC9D,KAAK;QACL,+DAA+D;QAC/D,UAAU;QACV,mEAAmE;QACnE,wDAAwD;QACxD,wDAAwD;QACxD,2DAA2D;QAC3D,kEAAkE;QAClE,yCAAyC;QACzC,kBAAkB;QAClB,sCAAsC;QACtC,wCAAwC;QACxC,4DAA4D;QAC5D,qDAAqD;QACrD,2DAA2D;IAE7D,aAAa,EACX,qEAAqE;QACrE,iDAAiD;QACjD,sEAAsE;QACtE,qEAAqE;QACrE,gDAAgD;IAElD,QAAQ,EACN,sEAAsE;QACtE,wBAAwB;IAE1B,OAAO,EAAE,wCAAwC;QAC/C,kBAAkB;QAClB,uFAAuF;QACvF,kGAAkG;IAEpG,iBAAiB;IACjB,eAAe,EAAE,6EAA6E;IAE9F,cAAc,EAAE,+XAA+X;IAE/Y,cAAc,EAAE,oeAAoe;IACpf,iBAAiB,EAAE,ivBAAivB;IAEpwB,UAAU,EAAE,+YAA+Y;IAC3Z,QAAQ,EAAE,8lBAA8lB;IAExmB,YAAY,EAAE,kaAAka;IAEhb,WAAW,EAAE,wjBAAwjB;IAErkB,UAAU,EAAE,yqBAAyqB;IAKrrB,oBAAoB,EAAE,wcAAwc;IAC9d,gBAAgB,EAAE,2SAA2S;IAC7T,WAAW,EAAE,2ZAA2Z;IACxa,cAAc,EAAE,8aAA8a;IAC9b,wBAAwB,EAAE,keAAke;IAC5f,YAAY,EAAE,gXAAgX;IAC9X,WAAW,EAAE,8gBAA8gB;IAC3hB,aAAa,EAAE,8jBAA8jB;IAE7kB,YAAY,EAAE,ioBAAioB;IAE/oB,cAAc,EAAE,2PAA2P;IAC3Q,gBAAgB,EAAE,+gBAA+gB;IACjiB,qBAAqB,EAAE,qRAAqR;IAE5S,iBAAiB,EAAE,4IAA4I;IAE/J,WAAW,EAAE,iIAAiI;IAC9I,WAAW,EAAE,8MAA8M;IAC3N,cAAc,EAAE,mPAAmP;IACnQ,aAAa,EAAE,6LAA6L;IAC5M,WAAW,EAAE,iHAAiH;IAC9H,oBAAoB,EAAE,sNAAsN;IAE5O,YAAY,EAAE,sIAAsI;IAEpJ,mEAAmE;IACnE,iEAAiE;IACjE,gEAAgE;IAChE,qEAAqE;IACrE,sDAAsD;IACtD,oEAAoE;IACpE,kEAAkE;IAClE,gEAAgE;IAChE,oDAAoD;IACpD,cAAc,EAAE,8CAA8C;IAC9D,kBAAkB,EAAE,iNAAiN;IACrO,kBAAkB,EAAE,qMAAqM;IAEzN,kBAAkB,EAAE,mOAAmO;IAEvP,eAAe,EAAE,kMAAkM;IAEnN,uBAAuB,EAAE,6KAA6K;IAEtM,eAAe,EAAE,yOAAyO;IAE1P,kBAAkB,EAAE,0HAA0H;IAE9I,gBAAgB,EAAE,6HAA6H;IAE/I,mBAAmB,EAAE,kKAAkK;IACvL,mBAAmB,EAAE,uVAAuV;IAE5W,SAAS,EAAE,mYAAmY;IAE9Y,QAAQ,EAAE,ybAAyb;IAEnc,SAAS,EAAE,0ZAA0Z;IAEra,WAAW,EAAE,sXAAsX;IAEnY,UAAU,EAAE,ihBAAihB;IAE7hB,SAAS,EAAE,qaAAqa;IAEhb,UAAU,EAAE,6ZAA6Z;IAEza,aAAa,EAAE,wdAAwd;IAEve,SAAS,EAAE,0cAA0c;IAErd,QAAQ,EAAE,wlBAAwlB;IAElmB,SAAS,EAAE,ijBAAijB;IAE5jB,eAAe,EAAE,igBAAigB;IAElhB,cAAc,EAAE,wkBAAwkB;IAExlB,aAAa,EAAE,kiBAAkiB;IAEjjB,qEAAqE;IACrE,gEAAgE;IAChE,qEAAqE;IACrE,SAAS,EAAE,0ZAA0Z;IAEra,WAAW,EAAE,gmBAAgmB;IAE7mB,aAAa,EAAE,8jBAA8jB;IAE7kB,WAAW,EAAE,2dAA2d;IAExe,OAAO,EAAE,ylBAAylB;IAElmB,SAAS,EAAE,ifAAif;IAE5f,UAAU,EAAE,4aAA4a;IAGxb,WAAW,EAAE,6nBAA6nB;IAC1oB,cAAc,EAAE,ghBAAghB;IAEhiB,gBAAgB,EAAE,ijBAAijB;IAEnkB,YAAY,EAAE,4iBAA4iB;IAE1jB,qBAAqB;IACrB,cAAc,EAAE,yEAAyE;IACzF,cAAc,EAAE,kEAAkE;IAClF,OAAO,EAAE,gFAAgF;IAEzF,UAAU,EAAE,mGAAmG;IAE/G,uBAAuB;IAEvB,cAAc,EACZ,iEAAiE;QACjE,iEAAiE;QACjE,8DAA8D;QAC9D,+DAA+D;QAC/D,2BAA2B;QAC3B,kBAAkB;QAClB,8DAA8D;QAC9D,iEAAiE;QACjE,iDAAiD;IAEnD,qBAAqB,EACnB,gEAAgE;QAChE,kEAAkE;QAClE,kEAAkE;QAClE,qCAAqC;QACrC,qEAAqE;QACrE,oEAAoE;QACpE,kBAAkB;QAClB,8DAA8D;QAC9D,gEAAgE;QAChE,uEAAuE;QACvE,8DAA8D;QAC9D,4DAA4D;IAE9D,eAAe,EACb,yDAAyD;QACzD,4DAA4D;QAC5D,+DAA+D;QAC/D,mEAAmE;QACnE,qEAAqE;QACrE,sEAAsE;QACtE,yCAAyC;QACzC,kBAAkB;QAClB,kEAAkE;QAClE,6DAA6D;QAC7D,qEAAqE;QACrE,oDAAoD;QACpD,iEAAiE;IAEnE,QAAQ,EACN,8DAA8D;QAC9D,+DAA+D;QAC/D,mEAAmE;QACnE,iEAAiE;QACjE,6DAA6D;QAC7D,kBAAkB;QAClB,8DAA8D;QAC9D,mEAAmE;QACnE,qEAAqE;IAEvE,WAAW,EACT,mEAAmE;QACnE,sEAAsE;QACtE,mEAAmE;QACnE,kEAAkE;QAClE,kEAAkE;QAClE,oEAAoE;QACpE,6DAA6D;QAC7D,gEAAgE;QAChE,kBAAkB;QAClB,mEAAmE;QACnE,6DAA6D;QAC7D,4DAA4D;QAC5D,kEAAkE;QAClE,sDAAsD;IAExD,cAAc,EACZ,+DAA+D;QAC/D,kEAAkE;QAClE,gEAAgE;QAChE,2BAA2B;QAC3B,kBAAkB;QAClB,0CAA0C;QAC1C,+DAA+D;QAC/D,yDAAyD;QACzD,4DAA4D;IAE9D,eAAe,EACb,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,qEAAqE;QACrE,oBAAoB;QACpB,kBAAkB;QAClB,yDAAyD;QACzD,wEAAwE;QACxE,yDAAyD;IAE3D,cAAc,EACZ,qEAAqE;QACrE,gEAAgE;QAChE,mEAAmE;QACnE,sEAAsE;QACtE,8DAA8D;QAC9D,uBAAuB;QACvB,kBAAkB;QAClB,+CAA+C;QAC/C,sDAAsD;QACtD,+DAA+D;IAEjE,cAAc,EACZ,iEAAiE;QACjE,iEAAiE;QACjE,qEAAqE;QACrE,+DAA+D;QAC/D,mEAAmE;QACnE,mCAAmC;QACnC,kBAAkB;QAClB,yEAAyE;QACzE,mEAAmE;QACnE,0DAA0D;QAC1D,kEAAkE;QAClE,qEAAqE;IAEvE,cAAc,EACZ,qEAAqE;QACrE,qEAAqE;QACrE,mEAAmE;QACnE,qEAAqE;QACrE,oDAAoD;QACpD,oEAAoE;QACpE,cAAc;QACd,kBAAkB;QAClB,qDAAqD;QACrD,2DAA2D;QAC3D,kEAAkE;IAEpE,mBAAmB,EACjB,qEAAqE;QACrE,gEAAgE;QAChE,yBAAyB;QACzB,kEAAkE;QAClE,iEAAiE;QACjE,SAAS;QACT,kBAAkB;QAClB,uEAAuE;QACvE,oEAAoE;QACpE,kEAAkE;IAEpE,aAAa,EACX,oEAAoE;QACpE,oEAAoE;QACpE,wEAAwE;QACxE,uEAAuE;QACvE,QAAQ;QACR,kBAAkB;QAClB,sEAAsE;QACtE,4DAA4D;QAC5D,oEAAoE;IAEtE,iBAAiB,EACf,wEAAwE;QACxE,kBAAkB;QAClB,yDAAyD;QACzD,2DAA2D;QAC3D,4EAA4E;QAC5E,4EAA4E;IAE9E,iBAAiB,EAAE,mDAAmD;IACtE,KAAK,EAAE,+DAA+D;IACtE,MAAM,EAAE,gEAAgE;IAExE,kBAAkB;IAClB,KAAK,EAAE,mFAAmF;IAC1F,aAAa,EAAE,qFAAqF;IACpG,WAAW,EAAE,uXAAuX;IACpY,cAAc,EAAE,uFAAuF;IAEvG,kBAAkB;IAClB,aAAa,EAAE,gEAAgE;IAC/E,kBAAkB,EAAE,4EAA4E;IAEhG,4BAA4B;IAC5B,UAAU,EAAE,8DAA8D;IAC1E,KAAK,EAAE,0EAA0E;IAEjF,2BAA2B;IAC3B,QAAQ,EAAE,kGAAkG;IAC5G,mBAAmB,EAAE,6EAA6E;IAElG,2CAA2C;IAC3C,OAAO,EAAE,+DAA+D;IACxE,YAAY,EAAE,kFAAkF;IAEhG,gEAAgE;IAChE,uCAAuC;IACvC,iBAAiB,EAAE,yCAAyC;QAC1D,6DAA6D;QAC7D,+BAA+B;IAEjC,WAAW,EAAE,8CAA8C;IAE3D,qCAAqC;IACrC,MAAM,EAAE,wEAAwE;IAChF,MAAM,EAAE,iFAAiF;IACzF,SAAS,EAAE,wFAAwF;IACnG,SAAS,EAAE,6EAA6E;IAExF,qCAAqC;IACrC,IAAI,EAAE,wEAAwE;IAE9E,kBAAkB;IAClB,OAAO,EAAE,+DAA+D;IAExE,6CAA6C;IAC7C,OAAO,EAAE,kBAAkB;IAC3B,KAAK,EAAE,kBAAkB;IACzB,MAAM,EAAE,uBAAuB;IAC/B,MAAM,EAAE,mBAAmB;IAC3B,KAAK,EAAE,wBAAwB;CAChC,CAAA;QAgSC,KAAK;AA7RP,wEAAwE;AACxE,+DAA+D;AAC/D,uEAAuE;AACvE,uEAAuE;AACvE,oEAAoE;AACpE,sEAAsE;AACtE,qEAAqE;AACrE,uEAAuE;AACvE,kDAAkD;AAClD,MAAM,WAAW,GAA2B;IAC1C,oDAAoD;IACpD,KAAK,EAAE,OAAO;IACd,MAAM,EAAE,OAAO;IACf,aAAa,EAAE,OAAO;IACtB,aAAa,EAAE,OAAO;IACtB,cAAc,EAAE,OAAO;IACvB,cAAc,EAAE,OAAO;IACvB,iBAAiB,EAAE,OAAO;IAE1B,kEAAkE;IAClE,qEAAqE;IACrE,mEAAmE;IACnE,qBAAqB;IACrB,eAAe,EAAE,QAAQ;IACzB,qBAAqB,EAAE,QAAQ;IAC/B,sBAAsB,EAAE,QAAQ;IAChC,oBAAoB,EAAE,QAAQ;IAC9B,cAAc,EAAE,QAAQ;IACxB,yBAAyB,EAAE,QAAQ;IACnC,yBAAyB,EAAE,QAAQ;IACnC,iBAAiB,EAAE,QAAQ;IAC3B,yBAAyB,EAAE,QAAQ;IACnC,UAAU,EAAE,QAAQ;IACpB,iBAAiB,EAAE,QAAQ;IAE3B,kEAAkE;IAClE,8DAA8D;IAC9D,sDAAsD;IACtD,gBAAgB,EAAE,OAAO;IACzB,kBAAkB,EAAE,WAAW;IAC/B,eAAe,EAAE,WAAW;IAC5B,mBAAmB,EAAE,UAAU;IAE/B,8DAA8D;IAC9D,kEAAkE;IAClE,gEAAgE;IAChE,4DAA4D;IAC5D,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,gBAAgB,EAAE,WAAW;IAC7B,cAAc,EAAE,WAAW;IAE3B,gEAAgE;IAChE,mEAAmE;IACnE,8BAA8B;IAC9B,qBAAqB,EAAE,WAAW;IAClC,iBAAiB,EAAE,WAAW;IAC9B,oBAAoB,EAAE,WAAW;IACjC,kBAAkB,EAAE,WAAW;IAC/B,kBAAkB,EAAE,WAAW;IAC/B,qEAAqE;IACrE,gEAAgE;IAChE,mEAAmE;IACnE,4CAA4C;IAC5C,WAAW,EAAE,OAAO;IACpB,WAAW,EAAE,UAAU;IACvB,cAAc,EAAE,OAAO;IACvB,aAAa,EAAE,UAAU;IACzB,WAAW,EAAE,WAAW;IACxB,oEAAoE;IACpE,qEAAqE;IACrE,YAAY,EAAE,UAAU;IACxB,kBAAkB,EAAE,QAAQ;IAC5B,eAAe,EAAE,OAAO;IACxB,uBAAuB,EAAE,WAAW;IACpC,eAAe,EAAE,WAAW;IAC5B,kBAAkB,EAAE,WAAW;IAC/B,gBAAgB,EAAE,WAAW;IAC7B,mBAAmB,EAAE,WAAW;IAChC,mBAAmB,EAAE,WAAW;IAGhC,iEAAiE;IACjE,+DAA+D;IAC/D,0DAA0D;IAC1D,YAAY,EAAE,OAAO;IAErB,gEAAgE;IAChE,oEAAoE;IACpE,oEAAoE;IACpE,yBAAyB;IACzB,SAAS,EAAE,OAAO;IAClB,QAAQ,EAAE,OAAO;IACjB,SAAS,EAAE,OAAO;IAElB,kEAAkE;IAClE,+DAA+D;IAC/D,oEAAoE;IACpE,gEAAgE;IAChE,0CAA0C;IAC1C,WAAW,EAAE,OAAO;IACpB,UAAU,EAAE,UAAU;IAEtB,iEAAiE;IACjE,kEAAkE;IAClE,oEAAoE;IACpE,oEAAoE;IACpE,iEAAiE;IACjE,oEAAoE;IACpE,uCAAuC;IACvC,WAAW,EAAE,OAAO;IACpB,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,OAAO,EAAE,OAAO;IAChB,SAAS,EAAE,OAAO;IAElB,gEAAgE;IAChE,oEAAoE;IACpE,+DAA+D;IAC/D,iEAAiE;IACjE,mDAAmD;IACnD,SAAS,EAAE,OAAO;IAClB,UAAU,EAAE,OAAO;IACnB,aAAa,EAAE,OAAO;IACtB,SAAS,EAAE,OAAO;IAClB,SAAS,EAAE,UAAU;IACrB,QAAQ,EAAE,UAAU;IAEpB,4DAA4D;IAC5D,mEAAmE;IACnE,oEAAoE;IACpE,4DAA4D;IAC5D,uDAAuD;IACvD,eAAe,EAAE,OAAO;IACxB,cAAc,EAAE,OAAO;IACvB,aAAa,EAAE,UAAU;IACzB,SAAS,EAAE,OAAO;IAElB,kEAAkE;IAClE,8DAA8D;IAC9D,eAAe;IACf,UAAU,EAAE,UAAU;IAEtB,oEAAoE;IACpE,kEAAkE;IAClE,6DAA6D;IAC7D,8BAA8B;IAC9B,WAAW,EAAE,OAAO;IACpB,cAAc,EAAE,OAAO;IACvB,gBAAgB,EAAE,OAAO;IACzB,YAAY,EAAE,QAAQ;IAEtB,iEAAiE;IACjE,qEAAqE;IACrE,mEAAmE;IACnE,kEAAkE;IAClE,cAAc,EAAE,UAAU;IAC1B,wBAAwB,EAAE,UAAU;IACpC,YAAY,EAAE,OAAO;IACrB,WAAW,EAAE,UAAU;IACvB,oBAAoB,EAAE,YAAY;IAClC,gBAAgB,EAAE,QAAQ;IAC1B,UAAU,EAAE,OAAO;IACnB,YAAY,EAAE,OAAO;IACrB,YAAY,EAAE,OAAO;IACrB,qBAAqB,EAAE,OAAO;IAC9B,iBAAiB,EAAE,OAAO;IAC1B,kBAAkB,EAAE,OAAO;IAC3B,aAAa,EAAE,OAAO;IACtB,WAAW,EAAE,OAAO;IACpB,UAAU,EAAE,OAAO;IACnB,UAAU,EAAE,OAAO;IACnB,QAAQ,EAAE,OAAO;IACjB,cAAc,EAAE,OAAO;IAEvB,kEAAkE;IAClE,mEAAmE;IACnE,4DAA4D;IAC5D,UAAU,EAAE,UAAU;IACtB,IAAI,EAAE,UAAU;IAChB,kBAAkB,EAAE,UAAU;IAC9B,YAAY,EAAE,UAAU;IACxB,WAAW,EAAE,UAAU;IACvB,eAAe,EAAE,UAAU;IAC3B,aAAa,EAAE,UAAU;IACzB,iBAAiB,EAAE,UAAU;IAC7B,GAAG,EAAE,UAAU;IACf,IAAI,EAAE,UAAU;IAChB,MAAM,EAAE,UAAU;IAClB,WAAW,EAAE,UAAU;IACvB,OAAO,EAAE,UAAU;IACnB,KAAK,EAAE,UAAU;IACjB,OAAO,EAAE,UAAU;IACnB,YAAY,EAAE,UAAU;IACxB,eAAe,EAAE,UAAU;IAC3B,eAAe,EAAE,UAAU;IAC3B,mBAAmB,EAAE,UAAU;IAC/B,QAAQ,EAAE,UAAU;IACpB,cAAc,EAAE,UAAU;IAC1B,eAAe,EAAE,UAAU;IAC3B,WAAW,EAAE,UAAU;IACvB,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,cAAc,EAAE,UAAU;IAC1B,qBAAqB,EAAE,UAAU;IACjC,GAAG,EAAE,UAAU;IACf,aAAa,EAAE,UAAU;IACzB,QAAQ,EAAE,UAAU;IACpB,YAAY,EAAE,UAAU;IACxB,SAAS,EAAE,UAAU;IACrB,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,UAAU;IACnB,EAAE,EAAE,UAAU;IACd,KAAK,EAAE,UAAU;IACjB,KAAK,EAAE,UAAU;IACjB,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,UAAU;IACnB,OAAO,EAAE,UAAU;IACnB,KAAK,EAAE,UAAU;IAEjB,mEAAmE;IACnE,MAAM,EAAE,YAAY;IACpB,eAAe,EAAE,YAAY;IAC7B,QAAQ,EAAE,YAAY;IACtB,aAAa,EAAE,YAAY;IAC3B,eAAe,EAAE,YAAY;IAC7B,sBAAsB,EAAE,YAAY;IACpC,cAAc,EAAE,YAAY;IAC5B,gBAAgB,EAAE,YAAY;IAC9B,uBAAuB,EAAE,YAAY;IACrC,iBAAiB,EAAE,YAAY;IAE/B,oDAAoD;IACpD,OAAO,EAAE,WAAW;IACpB,kEAAkE;IAClE,oEAAoE;IACpE,kEAAkE;IAClE,oBAAoB;IACpB,UAAU,EAAE,WAAW;IACvB,GAAG,EAAE,WAAW;IAChB,MAAM,EAAE,WAAW;IACnB,GAAG,EAAE,WAAW;IAChB,MAAM,EAAE,WAAW;IACnB,WAAW,EAAE,WAAW;IACxB,gBAAgB,EAAE,WAAW;IAC7B,gBAAgB,EAAE,WAAW;IAC7B,qBAAqB,EAAE,WAAW;IAElC,6CAA6C;IAC7C,WAAW,EAAE,QAAQ;IACrB,SAAS,EAAE,QAAQ;IACnB,aAAa,EAAE,QAAQ;IAEvB,6DAA6D;IAC7D,QAAQ,EAAE,UAAU;IACpB,YAAY,EAAE,UAAU;IACxB,UAAU,EAAE,UAAU;CACvB,CAAA;QA4BC,WAAW;AAzBb,uEAAuE;AACvE,sEAAsE;AACtE,oDAAoD;AACpD,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;AAG7D,gEAAgE;AAChE,8DAA8D;AAC9D,2DAA2D;AAC3D,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;QAChB,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,OAAO,WAAW,CAAC,MAAM,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAA;AACnB,CAAC,CAAC,iCAAiC"}

package/dist/lang.js

@@ -71,8 +71,10 @@ const DeprecateFuncVal_1 = require("./val/DeprecateFuncVal");
 const ReferFuncVal_1 = require("./val/ReferFuncVal");
 const GraphAtomVal_1 = require("./val/GraphAtomVal");
 const PackFuncVal_1 = require("./val/PackFuncVal");
+const CmpFuncVal_1 = require("./val/CmpFuncVal");
+const NomFuncVal_1 = require("./val/NomFuncVal");
+const TranslateFuncVal_1 = require("./val/TranslateFuncVal");
 const EachFuncVal_1 = require("./val/EachFuncVal");
-const FormFuncVal_1 = require("./val/FormFuncVal");
 const FilterFuncVal_1 = require("./val/FilterFuncVal");
 const MatchFuncVal_1 = require("./val/MatchFuncVal");
 const EmitFuncVal_1 = require("./val/EmitFuncVal");
@@ -728,20 +730,23 @@ help isolate the syntax error.`,
         // govern. Lattice-inert; the verdict lands at generation.
         acyclic: GraphAtomVal_1.AcyclicFuncVal,
         inverse: GraphAtomVal_1.InverseFuncVal,
-        // G8 phase 1: the generation combinators. `pack` makes one keyed
-        // child per child of its data, `each` one list element; both clone
-        // their template per destination exactly as a spread does, and both
-        // wait for the model to settle before they fire (the staging rule,
-        // G8 phase 0).
+        // G8 phase 1: generation to KEYED CHILDREN. `pack` makes one keyed
+        // child per child of its data, cloning its template per
+        // destination exactly as a spread does, and waits for the model to
+        // settle before it fires (the staging rule, G8 phase 0).
         pack: PackFuncVal_1.PackFuncVal,
+        // RENDER P6: the order-preserving map, and generation to a LIST.
+        // `each` makes one list element per child of its data, being the
+        // template with `_` bound to the source child. It exists because
+        // `pick(pack(...))` re-sorts to code-point order, and a struct's
+        // fields or a file's imports are the model's order or they are
+        // wrong.
+        //
+        // Mentioning the hole makes it a BOUND instead: `each(d, _ & t)`
+        // meets each child with `t`, and `each(d, _)` is a bag's members
+        // as a list. That is what the retired meet-only `each` spelled
+        // (ADR-026), and why this one could take the name (ADR-027).
         each: EachFuncVal_1.EachFuncVal,
-        // RENDER P6: the order-preserving map. `form` makes one list
-        // element per child of its data, being the template with `_`
-        // bound to the source child -- a construction, where `each` is a
-        // bound (G9 §4). It exists because `pick(pack(...))` re-sorts to
-        // code-point order, and a struct's fields or a file's imports
-        // are the model's order or they are wrong.
-        form: FormFuncVal_1.FormFuncVal,
         // G8 phase 2: selection. `filter` keeps the children of a bag that
         // unify with a condition; `match` picks the first arm whose
         // pattern the scrutinee unifies with. Both select by
@@ -770,7 +775,8 @@ help isolate the syntax error.`,
         greatest: AggFuncVal_1.GreatestFuncVal,
         // Projection, which is what lets the aggregates reach a bag of
         // RECORDS: `sum(pick($.lines, amountCents))`. Not a clever `each`
-        // template -- `each` MEETS each child, and a meet cannot select.
+        // template -- `each(d, _ & t)` MEETS each child, and a meet cannot
+        // select.
         pick: AggFuncVal_1.PickFuncVal,
         // G9 phase 2: the fold to a STRING. `sum` folds with `add`; this
         // folds with `+`, so it inherits the one number-to-text rule and
@@ -794,6 +800,36 @@ help isolate the syntax error.`,
         usc: StrFuncVal_1.UscFuncVal,
         rep: StrFuncVal_1.RepFuncVal,
         split: StrFuncVal_1.SplitFuncVal,
+        // THE COMPONENT PRIMITIVES -- SPIKE (ts/src/val/CmpFuncVal.ts,
+        // docs/design/JOSTRACA.0.md). jostraca's component set, spelled
+        // as functions -- LOWER CASE, like every other builtin in this
+        // language, while the node each one builds names the jostraca
+        // component it drives (`file(...)` is aontu, `"File"` is
+        // jostraca's). A document then says what FILES it produces
+        // instead of filling in the `aontu:code` vocabulary as data.
+        // Eight of jostraca's ten: `copy` and `list` are already builtins
+        // here with unrelated meanings, so those two have no lower-case
+        // spelling to take (see ts/src/val/CmpFuncVal.ts).
+        //
+        // TypeScript only, and so deliberately NOT in
+        // test/spec/signature.tsv, BUILTIN_FUNCS (ts/src/lsp.ts) or the
+        // grammar/ files -- each is asserted in cross-port parity and a
+        // TS-only entry turns the Go suite red. Arity and argument shape
+        // are refused in CmpFuncVal.resolve for the same reason.
+        ...CmpFuncVal_1.CMP_FUNCS,
+        // NAME TRANSFORMATION -- SPIKE (ts/src/val/NamerFuncVal.ts).
+        // Generated code is mostly names, and no two targets spell them
+        // the same way. Splits a name into words whatever format it is
+        // written in, then renders it in the target's. TypeScript only,
+        // and out of the parity-pinned registries for the reason the
+        // component primitives are.
+        nom: NomFuncVal_1.NomFuncVal,
+        // PER-CHARACTER SUBSTITUTION AND DELETION -- SPIKE
+        // (ts/src/val/TranslateFuncVal.ts), after `tr`. Reads the source
+        // once and consults a table, which is what `rep` cannot do: a
+        // per-character map spelled as N `rep` calls composes wrongly,
+        // since each pass sees the previous one's output.
+        translate: TranslateFuncVal_1.TranslateFuncVal,
     };
     // A dangling operator (`a:1|`, `a:$`, `a:*` at end of input) leaves
     // null/undefined unfilled terms. Junction ops drop them (so `a:1&`
@@ -1904,13 +1940,13 @@ function makeModelResolver(options) {
     // remain available under every capability but 'none' — they are
     // host-provided, not document-requested, so confining them would
     // confine the host against itself.
-    // THE BUNDLED VOCABULARY (G4 phase 4, ts/src/std.ts) rides the
-    // memory leg: served from the engine itself, so it needs neither the
-    // filesystem nor package resolution and is available under every
-    // capability but `none` — which denies every include outright, that
-    // being what `none` means. Host entries and the capability's own set
-    // WIN over it: a caller that supplies its own `std/system` gets the
-    // one it supplied.
+    // A LANGUAGE-SUPPLIED MODEL DOES NOT RIDE THIS LEG (ADR-028). Every
+    // bundled schema is named under `aontu:` and answered by the scheme
+    // leg above, which returns before the memory resolver is built, so
+    // neither a host entry nor a capability's own file set can stand in
+    // front of one: `aontu:system` is the engine's, always. That is what
+    // the prefix buys, and it is why the bare-name leg that once let a
+    // caller shadow `std/system` is gone.
     let memResolver = (0, mem_1.makeMemResolver)(memCapability
         ? { ...capability.mem }
         : { ...(options.resolver?.mem || {}) });
@@ -2054,10 +2090,14 @@ function makeModelResolver(options) {
         // else -- the memory, module, file and package legs are never
         // asked, so nothing on disk can shadow one and a typo is refused
         // here, naming the set, rather than searched for. Available under
-        // every capability but `none`, checked just above, like the std
-        // names below. A path that is not a string (`a: @1`) is not a name
-        // at all: it falls through to the legs below and is not found there,
-        // as it always was.
+        // every capability but `none`, checked just above. A path that is
+        // not a string (`a: @1`) is not a name at all: it falls through to
+        // the legs below and is not found there, as it always was.
+        //
+        // This is the ONLY leg that serves a bundled model (ADR-028). The
+        // vocabularies once had bare names (`std/system`) and a second leg
+        // below to match them; the prefix is now the whole spelling, so one
+        // leg answers for every language-supplied schema.
         if ('string' === typeof path && path.startsWith(std_1.AONTU_SCHEME)) {
             const model = std_1.STD_SOURCES[path];
             if (null == model) {
@@ -2066,18 +2106,6 @@ function makeModelResolver(options) {
             record(ctx, path, 'std');
             return { found: true, path, full: path, kind: 'aon', src: model, search: [] };
         }
-        // THE BUNDLED VOCABULARY (G4 phase 4, ts/src/std.ts): served from
-        // the engine itself, so it needs neither the filesystem nor package
-        // resolution and is available under every capability but `none` —
-        // checked just above, that being what `none` means. Matched against
-        // the name the author WROTE, before the memory leg, so the kind is
-        // stated rather than guessed from an extension the bare name does
-        // not have.
-        const std = std_1.STD_SOURCES[path];
-        if (null != std) {
-            record(ctx, path, 'std');
-            return { found: true, path, full: path, kind: 'aon', src: std, search: [] };
-        }
         let search = [];
         let res = memResolver(path, popts, rule, ctx, jsonic);
         res.path = path;
@@ -2196,9 +2224,25 @@ for (const name in sig_1.funcSig) {
         POSITIONAL_ARG_FUNCS[name] = true;
     }
 }
-// [min, max]; a max of -1 is unbounded. Every name in funcMap has an
+// THE COMPONENT PRIMITIVES, listed by hand (the spike, see funcMap
+// above and ts/src/val/CmpFuncVal.ts). They carry no signature
+// declaration, so the derivation above cannot see them -- and
+// `file("main.ts", [...])` without an entry arrives as ONE raw array
+// term, which the call then reads as its spec. The leaves are here
+// too, so that a written second argument is COUNTED and refused as
+// the arity mistake it is rather than arriving as a one-element list
+// that is merely the wrong shape.
+for (const name of Object.keys(CmpFuncVal_1.CMP_FUNCS)) {
+    POSITIONAL_ARG_FUNCS[name] = true;
+}
+POSITIONAL_ARG_FUNCS['nom'] = true;
+POSITIONAL_ARG_FUNCS['translate'] = true;
+// [min, max]; a max of -1 is unbounded. Every DECLARED name has an
 // entry, and the arity is a property of the language rather than of
-// either port -- go/func.go derives the same table. A required slot
+// either port -- go/func.go derives the same table. The spike's
+// component primitives are the one exception: they carry no
+// declaration, so they have no entry here and refuse a bad count in
+// their own resolve (ts/src/val/CmpFuncVal.ts). A required slot
 // counts toward the minimum; a rest slot makes the maximum unbounded
 // and counts its group size (one, for a plain rest type) toward the
 // minimum, which is what gives `match` its floor of three and `neq`
@@ -2255,7 +2299,16 @@ function arityText(lo, hi) {
         return 'one or more arguments';
     }
     if (lo !== hi) {
-        return 0 === lo ? 'no arguments or one' : 'one argument or two';
+        if (0 === lo) {
+            return 'no arguments or one';
+        }
+        // The case range gave `upper` and `lower` a span rather than a
+        // pair, and a two-arm phrasing cannot say it: [1,3] read as "one
+        // argument or two", which is a wrong count rather than an
+        // imprecise one. Each arm here is a shape the table actually
+        // carries, and each is pinned by a row -- a phrasing for a count no
+        // entry has would be untested prose pretending to be tested.
+        return 3 === hi ? 'one to three arguments' : 'one argument or two';
     }
     // The {0,0} arm returned with the container kinds and acyclic()
     // (ADR-015): `map(1)` must not claim map takes exactly one.