@descent-vtt/spec-graph 0.7.0 → 0.9.0

package/dist/yaml.js

@@ -1,85 +1,133 @@
 /**
- * A front-matter reader for the subset of YAML that specifications actually use.
+ * What spec-graph reads out of a document's front matter.
  *
- * Front matter in an ADR is a flat bag of scalars and lists. Pulling in a full
- * YAML implementation to read `status: accepted` would add a parser with its own
- * CVE history, and would still need wrapping to recover the byte offset of the
- * value - which is the whole reason we parse it ourselves: when a status is
- * wrong, the report has to point at the line that declares it.
+ * The reader is spec-core's, copied into `src/vendor/spec-core/markdown/`: the
+ * subset of YAML that specifications use - scalars, quoted scalars, inline and
+ * block sequences, `#` comments and, as spec-graph reads it, one level of nested
+ * mapping flattened to `parent.child` - with the offset of every key and value,
+ * because when a status is wrong the report has to point at the line that
+ * declares it.
  *
- * Supported: scalars, quoted scalars, inline `[a, b]` sequences, block `- item`
- * sequences, one level of nested mapping (flattened to `parent.child`), and `#`
- * comments. Anything richer is preserved as the raw scalar text rather than
- * being silently mangled.
+ * Anything richer is recognised and not guessed at: a value continued on the
+ * next line, a plain value holding `: `, a block scalar, an anchor. Such a value
+ * is not read, and the reason is a parse problem at the value, so a key that
+ * says nothing to the graph says why under `--verbose`. Each problem says
+ * whether it left something out and which key, for the count a run prints
+ * without `--verbose`.
+ *
+ * What stays here is the shape the rest of spec-graph reads: a key in lower
+ * case, which is how a relation key, a status key and `fm.<key>` in a selector
+ * have always been compared, and a value that is a string or a list of them.
+ */
+import { frontMatterKind, readFrontMatter } from './vendor/spec-core/markdown/index.js';
+const NOTHING = { entries: [], problems: [] };
+/** A line that reads as `key:` at any indentation, and the key it names. */
+const KEY_SHAPE = /^[ \t]*([A-Za-z_][\w.-]*)[ \t]*:/;
+/** Reads a scanned document's front matter. */
+export function readEntries(scanned) {
+    const block = scanned.frontMatter;
+    if (block === null)
+        return neverClosed(scanned);
+    const index = scanned.index;
+    // The block and nothing after it: the reader splits what it is given into
+    // lines, and the body is none of its business.
+    const read = readFrontMatter(scanned.text.slice(0, block.bodyStart), { nested: true });
+    // The scan found a closed block, and the reader closes one by the same rule.
+    if (read === null)
+        return NOTHING;
+    const { entries, problems } = entriesOf(read, 0);
+    return {
+        entries,
+        problems: [
+            ...read.problems.map((problem) => {
+                // A key written twice is read, the last of it; any other line with a
+                // problem is not, and the key it looks like it names is what went
+                // missing - `  status: accepted`, indented under nothing, is a status.
+                const unread = !read.entries.some((entry) => entry.line === problem.line);
+                const text = index.lineText(problem.line + 1);
+                return {
+                    message: `front matter: ${problem.message}`,
+                    start: index.lineStart(problem.line + 1),
+                    end: index.lineEnd(problem.line + 1),
+                    unread,
+                    key: KEY_SHAPE.exec(text)?.[1]?.toLowerCase() ?? null,
+                };
+            }),
+            ...problems,
+        ].sort((a, b) => a.start - b.start),
+    };
+}
+/**
+ * Front matter that opens and never closes, which the scan reads as a rule
+ * and Markdown after it, so nothing in it reaches the graph.
+ *
+ * The scan closes a block by the rule the reader does, so this is the one case
+ * it leaves null with a first line that opens one. The usual cause is a closer
+ * that only looks like one: `----` and `....` closed front matter here before
+ * 0.9.0, and neither is one of YAML's document markers.
  */
-const KEY_LINE = /^(\s*)([A-Za-z0-9_.$-]+)\s*:(.*)$/;
-const SEQUENCE_ITEM = /^(\s*)-\s*(.*)$/;
+function neverClosed(scanned) {
+    const index = scanned.index;
+    const kind = frontMatterKind(index.lineText(1));
+    if (kind === null)
+        return NOTHING;
+    const delimiter = kind === 'yaml' ? '---' : '+++';
+    return {
+        entries: [],
+        problems: [
+            {
+                message: `front matter: opened here and never closed, so none of it is read - close it with "${delimiter}" on a line of its own`,
+                start: index.lineStart(1),
+                end: index.lineEnd(1),
+                unread: true,
+                key: null,
+            },
+        ],
+    };
+}
 /**
- * Parses front-matter text.
+ * Parses front-matter text: what lies between the delimiters, as
+ * `FrontMatter.raw` holds it.
  *
- * @param raw The text between the delimiters.
+ * @param raw The text between the delimiters. It cannot hold a line that would
+ *   close them, as text a scan read between them never does.
  * @param baseOffset Offset of `raw` within the containing file, so the returned
  *   spans address the file rather than the fragment.
  */
 export function parseFrontMatter(raw, baseOffset = 0) {
+    // The reader reads front matter at the top of a document, so the text goes
+    // back between delimiters, and every offset back by the four characters the
+    // opening one takes. The line break before the closing one is a blank line
+    // when `raw` already ends in one, and a blank line is no key's.
+    const read = readFrontMatter(`---\n${raw}\n---`, { nested: true });
+    // Never null: the text opens with a delimiter and closes with one.
+    return read === null ? [] : entriesOf(read, baseOffset - 4).entries;
+}
+/** The entries a reading holds, and the values it could not read as problems. */
+function entriesOf(read, shift) {
     const entries = [];
-    const lines = splitLines(raw);
-    for (let i = 0; i < lines.length; i += 1) {
-        const line = lines[i];
-        const match = KEY_LINE.exec(line.text);
-        if (!match)
-            continue;
-        const indent = match[1].length;
-        const key = match[2].toLowerCase();
-        const rest = match[3];
-        const restStart = line.start + indent + match[2].length + 1;
-        const trimmed = stripComment(rest).trim();
-        if (trimmed.length > 0) {
-            const valueStart = restStart + rest.indexOf(trimmed);
-            entries.push({
-                key,
-                value: parseScalarOrFlow(trimmed),
-                start: baseOffset + line.start + indent,
-                end: baseOffset + valueStart + trimmed.length,
-                valueStart: baseOffset + valueStart,
+    const problems = [];
+    for (const entry of read.entries) {
+        const { value } = entry;
+        if (value.kind === 'unsupported') {
+            problems.push({
+                message: `front matter: "${entry.key}" is not read: ${value.reason}`,
+                start: entry.valueStart + shift,
+                end: entry.valueEnd + shift,
+                unread: true,
+                key: entry.key.toLowerCase(),
             });
             continue;
         }
-        // An empty value opens either a block sequence or a nested mapping.
-        const block = readBlock(lines, i + 1, indent);
-        if (block.kind === 'sequence') {
-            entries.push({
-                key,
-                value: block.items,
-                start: baseOffset + line.start + indent,
-                end: baseOffset + block.end,
-                valueStart: baseOffset + block.valueStart,
-            });
-            i = block.lastIndex;
-        }
-        else if (block.kind === 'mapping') {
-            for (const child of block.entries) {
-                entries.push({
-                    key: `${key}.${child.key}`,
-                    value: child.value,
-                    start: baseOffset + child.start,
-                    end: baseOffset + child.end,
-                    valueStart: baseOffset + child.valueStart,
-                });
-            }
-            i = block.lastIndex;
-        }
-        else {
-            entries.push({
-                key,
-                value: '',
-                start: baseOffset + line.start + indent,
-                end: baseOffset + line.end,
-                valueStart: baseOffset + line.end,
-            });
-        }
+        entries.push({
+            key: entry.key.toLowerCase(),
+            value: value.kind === 'scalar' ? value.scalar.text : value.items.map((item) => item.text),
+            start: entry.keyStart + shift,
+            end: entry.valueEnd + shift,
+            valueStart: entry.valueStart + shift,
+        });
     }
-    return entries;
+    return { entries, problems };
 }
 /** Collapses parsed entries into the flat record stored on a document node. */
 export function toRecord(entries) {
@@ -98,143 +146,4 @@ export function valuesOf(entry) {
             : []
         : [...entry.value];
 }
-function splitLines(raw) {
-    const out = [];
-    let start = 0;
-    for (let i = 0; i <= raw.length; i += 1) {
-        if (i === raw.length || raw[i] === '\n') {
-            let end = i;
-            if (end > start && raw[end - 1] === '\r')
-                end -= 1;
-            out.push({ text: raw.slice(start, end), start, end });
-            start = i + 1;
-        }
-    }
-    if (out.length > 0 && out[out.length - 1].text === '' && raw.endsWith('\n'))
-        out.pop();
-    return out;
-}
-function readBlock(lines, from, indent) {
-    const items = [];
-    let valueStart = -1;
-    let end = -1;
-    let last = from - 1;
-    for (let i = from; i < lines.length; i += 1) {
-        const line = lines[i];
-        if (line.text.trim().length === 0) {
-            last = i;
-            continue;
-        }
-        const lineIndent = line.text.length - line.text.trimStart().length;
-        if (lineIndent <= indent)
-            break;
-        const seq = SEQUENCE_ITEM.exec(line.text);
-        if (!seq) {
-            if (items.length > 0)
-                break;
-            // A nested mapping: re-parse the indented region as its own document.
-            const region = collectRegion(lines, from, indent);
-            if (region.text.trim().length === 0)
-                return { kind: 'empty', lastIndex: from - 1 };
-            const nested = parseFrontMatter(region.text, region.start);
-            return { kind: 'mapping', entries: nested, lastIndex: region.lastIndex };
-        }
-        const value = stripComment(seq[2]).trim();
-        const offset = line.start + line.text.indexOf(value, seq[1].length + 1);
-        if (valueStart === -1)
-            valueStart = value.length > 0 ? offset : line.start;
-        items.push(unquote(value));
-        end = line.start + line.text.length;
-        last = i;
-    }
-    if (items.length === 0)
-        return { kind: 'empty', lastIndex: from - 1 };
-    return { kind: 'sequence', items, end, valueStart, lastIndex: last };
-}
-function collectRegion(lines, from, indent) {
-    let last = from - 1;
-    for (let i = from; i < lines.length; i += 1) {
-        const line = lines[i];
-        if (line.text.trim().length === 0) {
-            last = i;
-            continue;
-        }
-        const lineIndent = line.text.length - line.text.trimStart().length;
-        if (lineIndent <= indent)
-            break;
-        last = i;
-    }
-    if (last < from)
-        return { text: '', start: 0, lastIndex: from - 1 };
-    const start = lines[from].start;
-    const stop = lines[last].end;
-    const parts = [];
-    for (let i = from; i <= last; i += 1)
-        parts.push(lines[i].text);
-    return { text: parts.join('\n'), start, lastIndex: last };
-    void stop;
-}
-/** Drops a trailing `#` comment, respecting quotes. */
-function stripComment(value) {
-    let quote = null;
-    for (let i = 0; i < value.length; i += 1) {
-        const ch = value[i];
-        if (quote) {
-            if (ch === '\\')
-                i += 1;
-            else if (ch === quote)
-                quote = null;
-        }
-        else if (ch === '"' || ch === "'") {
-            quote = ch;
-        }
-        else if (ch === '#' && (i === 0 || value[i - 1] === ' ' || value[i - 1] === '\t')) {
-            return value.slice(0, i);
-        }
-    }
-    return value;
-}
-function parseScalarOrFlow(value) {
-    if (value.startsWith('[') && value.endsWith(']')) {
-        const inner = value.slice(1, -1).trim();
-        if (inner.length === 0)
-            return [];
-        return splitFlow(inner).map(unquote);
-    }
-    return unquote(value);
-}
-/** Splits `a, "b, c", d` on commas that are not inside quotes. */
-function splitFlow(value) {
-    const out = [];
-    let quote = null;
-    let start = 0;
-    for (let i = 0; i < value.length; i += 1) {
-        const ch = value[i];
-        if (quote) {
-            if (ch === '\\')
-                i += 1;
-            else if (ch === quote)
-                quote = null;
-        }
-        else if (ch === '"' || ch === "'") {
-            quote = ch;
-        }
-        else if (ch === ',') {
-            out.push(value.slice(start, i).trim());
-            start = i + 1;
-        }
-    }
-    out.push(value.slice(start).trim());
-    return out.filter((part) => part.length > 0);
-}
-function unquote(value) {
-    if (value.length >= 2) {
-        const first = value[0];
-        const last = value[value.length - 1];
-        if ((first === '"' && last === '"') || (first === "'" && last === "'")) {
-            return value.slice(1, -1).replace(/\\(.)/g, '$1');
-        }
-    }
-    return value;
-}
 //# sourceMappingURL=yaml.js.map

package/dist/yaml.js.map

@@ -1 +1 @@
-{"version":3,"file":"yaml.js","sourceRoot":"","sources":["../src/yaml.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAcH,MAAM,QAAQ,GAAG,mCAAmC,CAAC;AACrD,MAAM,aAAa,GAAG,iBAAiB,CAAC;AAExC;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW,EAAE,UAAU,GAAG,CAAC;IAC1D,MAAM,OAAO,GAAgB,EAAE,CAAC;IAChC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAc,CAAC;QACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,MAAM,MAAM,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;QAC3C,MAAM,GAAG,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,WAAW,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAChC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QACxE,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAE1C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACrD,OAAO,CAAC,IAAI,CAAC;gBACX,GAAG;gBACH,KAAK,EAAE,iBAAiB,CAAC,OAAO,CAAC;gBACjC,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM;gBACvC,GAAG,EAAE,UAAU,GAAG,UAAU,GAAG,OAAO,CAAC,MAAM;gBAC7C,UAAU,EAAE,UAAU,GAAG,UAAU;aACpC,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,oEAAoE;QACpE,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9C,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC;gBACX,GAAG;gBACH,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM;gBACvC,GAAG,EAAE,UAAU,GAAG,KAAK,CAAC,GAAG;gBAC3B,UAAU,EAAE,UAAU,GAAG,KAAK,CAAC,UAAU;aAC1C,CAAC,CAAC;YACH,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC;QACtB,CAAC;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACpC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClC,OAAO,CAAC,IAAI,CAAC;oBACX,GAAG,EAAE,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE;oBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC,KAAK;oBAC/B,GAAG,EAAE,UAAU,GAAG,KAAK,CAAC,GAAG;oBAC3B,UAAU,EAAE,UAAU,GAAG,KAAK,CAAC,UAAU;iBAC1C,CAAC,CAAC;YACL,CAAC;YACD,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC;gBACX,GAAG;gBACH,KAAK,EAAE,EAAE;gBACT,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM;gBACvC,GAAG,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG;gBAC1B,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG;aAClC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,QAAQ,CAAC,OAA6B;IACpD,MAAM,GAAG,GAA+C,EAAE,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,QAAQ,CAAC,KAA4B;IACnD,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ;QACpC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACtB,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YACf,CAAC,CAAC,EAAE;QACN,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAYD,SAAS,UAAU,CAAC,GAAW;IAC7B,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACxC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI;gBAAE,GAAG,IAAI,CAAC,CAAC;YACnD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACtD,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAK,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAe,CAAC,IAAI,KAAK,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACtG,OAAO,GAAG,CAAC;AACb,CAAC;AAOD,SAAS,SAAS,CAAC,KAA2B,EAAE,IAAY,EAAE,MAAc;IAC1E,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAc,CAAC;QACnC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,CAAC;YACT,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC;QACnE,IAAI,UAAU,IAAI,MAAM;YAAE,MAAM;QAEhC,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM;YAC5B,sEAAsE;YACtE,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YAClD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC;YACnF,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC;QAC3E,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAG,GAAG,CAAC,CAAC,CAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpF,IAAI,UAAU,KAAK,CAAC,CAAC;YAAE,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAC3E,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3B,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QACpC,IAAI,GAAG,CAAC,CAAC;IACX,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC;IACtE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACvE,CAAC;AAED,SAAS,aAAa,CACpB,KAA2B,EAC3B,IAAY,EACZ,MAAc;IAEd,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAc,CAAC;QACnC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,CAAC;YACT,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC;QACnE,IAAI,UAAU,IAAI,MAAM;YAAE,MAAM;QAChC,IAAI,GAAG,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,GAAG,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC;IACpE,MAAM,KAAK,GAAI,KAAK,CAAC,IAAI,CAAe,CAAC,KAAK,CAAC;IAC/C,MAAM,IAAI,GAAI,KAAK,CAAC,IAAI,CAAe,CAAC,GAAG,CAAC;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,CAAC;QAAE,KAAK,CAAC,IAAI,CAAE,KAAK,CAAC,CAAC,CAAe,CAAC,IAAI,CAAC,CAAC;IAC/E,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC1D,KAAK,IAAI,CAAC;AACZ,CAAC;AAED,uDAAuD;AACvD,SAAS,YAAY,CAAC,KAAa;IACjC,IAAI,KAAK,GAAkB,IAAI,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,EAAE,KAAK,IAAI;gBAAE,CAAC,IAAI,CAAC,CAAC;iBACnB,IAAI,EAAE,KAAK,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC;QACtC,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpC,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YACpF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAa;IACtC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAClC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AACxB,CAAC;AAED,kEAAkE;AAClE,SAAS,SAAS,CAAC,KAAa;IAC9B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,KAAK,GAAkB,IAAI,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,EAAE,KAAK,IAAI;gBAAE,CAAC,IAAI,CAAC,CAAC;iBACnB,IAAI,EAAE,KAAK,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC;QACtC,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpC,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACvC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACvE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * A front-matter reader for the subset of YAML that specifications actually use.\n *\n * Front matter in an ADR is a flat bag of scalars and lists. Pulling in a full\n * YAML implementation to read `status: accepted` would add a parser with its own\n * CVE history, and would still need wrapping to recover the byte offset of the\n * value - which is the whole reason we parse it ourselves: when a status is\n * wrong, the report has to point at the line that declares it.\n *\n * Supported: scalars, quoted scalars, inline `[a, b]` sequences, block `- item`\n * sequences, one level of nested mapping (flattened to `parent.child`), and `#`\n * comments. Anything richer is preserved as the raw scalar text rather than\n * being silently mangled.\n */\n\nexport interface YamlEntry {\n  /** Lower-cased key. Nested keys are flattened with a dot. */\n  readonly key: string;\n  readonly value: string | readonly string[];\n  /** Offset of the key. */\n  readonly start: number;\n  /** Offset just past the value. */\n  readonly end: number;\n  /** Offset of the first character of the value, for precise diagnostics. */\n  readonly valueStart: number;\n}\n\nconst KEY_LINE = /^(\\s*)([A-Za-z0-9_.$-]+)\\s*:(.*)$/;\nconst SEQUENCE_ITEM = /^(\\s*)-\\s*(.*)$/;\n\n/**\n * Parses front-matter text.\n *\n * @param raw The text between the delimiters.\n * @param baseOffset Offset of `raw` within the containing file, so the returned\n *   spans address the file rather than the fragment.\n */\nexport function parseFrontMatter(raw: string, baseOffset = 0): YamlEntry[] {\n  const entries: YamlEntry[] = [];\n  const lines = splitLines(raw);\n\n  for (let i = 0; i < lines.length; i += 1) {\n    const line = lines[i] as SplitLine;\n    const match = KEY_LINE.exec(line.text);\n    if (!match) continue;\n\n    const indent = (match[1] as string).length;\n    const key = (match[2] as string).toLowerCase();\n    const rest = match[3] as string;\n    const restStart = line.start + indent + (match[2] as string).length + 1;\n    const trimmed = stripComment(rest).trim();\n\n    if (trimmed.length > 0) {\n      const valueStart = restStart + rest.indexOf(trimmed);\n      entries.push({\n        key,\n        value: parseScalarOrFlow(trimmed),\n        start: baseOffset + line.start + indent,\n        end: baseOffset + valueStart + trimmed.length,\n        valueStart: baseOffset + valueStart,\n      });\n      continue;\n    }\n\n    // An empty value opens either a block sequence or a nested mapping.\n    const block = readBlock(lines, i + 1, indent);\n    if (block.kind === 'sequence') {\n      entries.push({\n        key,\n        value: block.items,\n        start: baseOffset + line.start + indent,\n        end: baseOffset + block.end,\n        valueStart: baseOffset + block.valueStart,\n      });\n      i = block.lastIndex;\n    } else if (block.kind === 'mapping') {\n      for (const child of block.entries) {\n        entries.push({\n          key: `${key}.${child.key}`,\n          value: child.value,\n          start: baseOffset + child.start,\n          end: baseOffset + child.end,\n          valueStart: baseOffset + child.valueStart,\n        });\n      }\n      i = block.lastIndex;\n    } else {\n      entries.push({\n        key,\n        value: '',\n        start: baseOffset + line.start + indent,\n        end: baseOffset + line.end,\n        valueStart: baseOffset + line.end,\n      });\n    }\n  }\n\n  return entries;\n}\n\n/** Collapses parsed entries into the flat record stored on a document node. */\nexport function toRecord(entries: readonly YamlEntry[]): Record<string, string | readonly string[]> {\n  const out: Record<string, string | readonly string[]> = {};\n  for (const entry of entries) out[entry.key] = entry.value;\n  return out;\n}\n\n/** Every value of a key as a flat list, whether it was a scalar or a sequence. */\nexport function valuesOf(entry: YamlEntry | undefined): string[] {\n  if (!entry) return [];\n  return typeof entry.value === 'string'\n    ? entry.value.length > 0\n      ? [entry.value]\n      : []\n    : [...entry.value];\n}\n\n/* -------------------------------------------------------------------------- */\n/* Internals                                                                  */\n/* -------------------------------------------------------------------------- */\n\ninterface SplitLine {\n  readonly text: string;\n  readonly start: number;\n  readonly end: number;\n}\n\nfunction splitLines(raw: string): SplitLine[] {\n  const out: SplitLine[] = [];\n  let start = 0;\n  for (let i = 0; i <= raw.length; i += 1) {\n    if (i === raw.length || raw[i] === '\\n') {\n      let end = i;\n      if (end > start && raw[end - 1] === '\\r') end -= 1;\n      out.push({ text: raw.slice(start, end), start, end });\n      start = i + 1;\n    }\n  }\n  if (out.length > 0 && (out[out.length - 1] as SplitLine).text === '' && raw.endsWith('\\n')) out.pop();\n  return out;\n}\n\ntype Block =\n  | { kind: 'sequence'; items: string[]; end: number; valueStart: number; lastIndex: number }\n  | { kind: 'mapping'; entries: YamlEntry[]; lastIndex: number }\n  | { kind: 'empty'; lastIndex: number };\n\nfunction readBlock(lines: readonly SplitLine[], from: number, indent: number): Block {\n  const items: string[] = [];\n  let valueStart = -1;\n  let end = -1;\n  let last = from - 1;\n\n  for (let i = from; i < lines.length; i += 1) {\n    const line = lines[i] as SplitLine;\n    if (line.text.trim().length === 0) {\n      last = i;\n      continue;\n    }\n    const lineIndent = line.text.length - line.text.trimStart().length;\n    if (lineIndent <= indent) break;\n\n    const seq = SEQUENCE_ITEM.exec(line.text);\n    if (!seq) {\n      if (items.length > 0) break;\n      // A nested mapping: re-parse the indented region as its own document.\n      const region = collectRegion(lines, from, indent);\n      if (region.text.trim().length === 0) return { kind: 'empty', lastIndex: from - 1 };\n      const nested = parseFrontMatter(region.text, region.start);\n      return { kind: 'mapping', entries: nested, lastIndex: region.lastIndex };\n    }\n\n    const value = stripComment(seq[2] as string).trim();\n    const offset = line.start + line.text.indexOf(value, (seq[1] as string).length + 1);\n    if (valueStart === -1) valueStart = value.length > 0 ? offset : line.start;\n    items.push(unquote(value));\n    end = line.start + line.text.length;\n    last = i;\n  }\n\n  if (items.length === 0) return { kind: 'empty', lastIndex: from - 1 };\n  return { kind: 'sequence', items, end, valueStart, lastIndex: last };\n}\n\nfunction collectRegion(\n  lines: readonly SplitLine[],\n  from: number,\n  indent: number,\n): { text: string; start: number; lastIndex: number } {\n  let last = from - 1;\n  for (let i = from; i < lines.length; i += 1) {\n    const line = lines[i] as SplitLine;\n    if (line.text.trim().length === 0) {\n      last = i;\n      continue;\n    }\n    const lineIndent = line.text.length - line.text.trimStart().length;\n    if (lineIndent <= indent) break;\n    last = i;\n  }\n  if (last < from) return { text: '', start: 0, lastIndex: from - 1 };\n  const start = (lines[from] as SplitLine).start;\n  const stop = (lines[last] as SplitLine).end;\n  const parts: string[] = [];\n  for (let i = from; i <= last; i += 1) parts.push((lines[i] as SplitLine).text);\n  return { text: parts.join('\\n'), start, lastIndex: last };\n  void stop;\n}\n\n/** Drops a trailing `#` comment, respecting quotes. */\nfunction stripComment(value: string): string {\n  let quote: string | null = null;\n  for (let i = 0; i < value.length; i += 1) {\n    const ch = value[i] as string;\n    if (quote) {\n      if (ch === '\\\\') i += 1;\n      else if (ch === quote) quote = null;\n    } else if (ch === '\"' || ch === \"'\") {\n      quote = ch;\n    } else if (ch === '#' && (i === 0 || value[i - 1] === ' ' || value[i - 1] === '\\t')) {\n      return value.slice(0, i);\n    }\n  }\n  return value;\n}\n\nfunction parseScalarOrFlow(value: string): string | string[] {\n  if (value.startsWith('[') && value.endsWith(']')) {\n    const inner = value.slice(1, -1).trim();\n    if (inner.length === 0) return [];\n    return splitFlow(inner).map(unquote);\n  }\n  return unquote(value);\n}\n\n/** Splits `a, \"b, c\", d` on commas that are not inside quotes. */\nfunction splitFlow(value: string): string[] {\n  const out: string[] = [];\n  let quote: string | null = null;\n  let start = 0;\n  for (let i = 0; i < value.length; i += 1) {\n    const ch = value[i] as string;\n    if (quote) {\n      if (ch === '\\\\') i += 1;\n      else if (ch === quote) quote = null;\n    } else if (ch === '\"' || ch === \"'\") {\n      quote = ch;\n    } else if (ch === ',') {\n      out.push(value.slice(start, i).trim());\n      start = i + 1;\n    }\n  }\n  out.push(value.slice(start).trim());\n  return out.filter((part) => part.length > 0);\n}\n\nfunction unquote(value: string): string {\n  if (value.length >= 2) {\n    const first = value[0];\n    const last = value[value.length - 1];\n    if ((first === '\"' && last === '\"') || (first === \"'\" && last === \"'\")) {\n      return value.slice(1, -1).replace(/\\\\(.)/g, '$1');\n    }\n  }\n  return value;\n}\n"]}
+{"version":3,"file":"yaml.js","sourceRoot":"","sources":["../src/yaml.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,eAAe,EAAE,eAAe,EAA4B,MAAM,sCAAsC,CAAC;AAqClH,MAAM,OAAO,GAAuB,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AAElE,4EAA4E;AAC5E,MAAM,SAAS,GAAG,kCAAkC,CAAC;AAErD,+CAA+C;AAC/C,MAAM,UAAU,WAAW,CAAC,OAAwB;IAClD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC;IAClC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,0EAA0E;IAC1E,+CAA+C;IAC/C,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IACvF,6EAA6E;IAC7E,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC;IAClC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACjD,OAAO;QACL,OAAO;QACP,QAAQ,EAAE;YACR,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC/B,qEAAqE;gBACrE,kEAAkE;gBAClE,uEAAuE;gBACvE,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBAC9C,OAAO;oBACL,OAAO,EAAE,iBAAiB,OAAO,CAAC,OAAO,EAAE;oBAC3C,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACxC,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACpC,MAAM;oBACN,GAAG,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,IAAI;iBACtD,CAAC;YACJ,CAAC,CAAC;YACF,GAAG,QAAQ;SACZ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;KACpC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,OAAwB;IAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAClD,OAAO;QACL,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE;YACR;gBACE,OAAO,EAAE,sFAAsF,SAAS,wBAAwB;gBAChI,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzB,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,IAAI;gBACZ,GAAG,EAAE,IAAI;aACV;SACF;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW,EAAE,UAAU,GAAG,CAAC;IAC1D,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,gEAAgE;IAChE,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IACnE,mEAAmE;IACnE,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;AACtE,CAAC;AAED,iFAAiF;AACjF,SAAS,SAAS,CAAC,IAAU,EAAE,KAAa;IAC1C,MAAM,OAAO,GAAgB,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;QACxB,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC;gBACZ,OAAO,EAAE,kBAAkB,KAAK,CAAC,GAAG,kBAAkB,KAAK,CAAC,MAAM,EAAE;gBACpE,KAAK,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK;gBAC/B,GAAG,EAAE,KAAK,CAAC,QAAQ,GAAG,KAAK;gBAC3B,MAAM,EAAE,IAAI;gBACZ,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE;aAC7B,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,OAAO,CAAC,IAAI,CAAC;YACX,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE;YAC5B,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YACzF,KAAK,EAAE,KAAK,CAAC,QAAQ,GAAG,KAAK;YAC7B,GAAG,EAAE,KAAK,CAAC,QAAQ,GAAG,KAAK;YAC3B,UAAU,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK;SACrC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AAC/B,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,QAAQ,CAAC,OAA6B;IACpD,MAAM,GAAG,GAA+C,EAAE,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,QAAQ,CAAC,KAA4B;IACnD,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ;QACpC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACtB,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YACf,CAAC,CAAC,EAAE;QACN,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/**\n * What spec-graph reads out of a document's front matter.\n *\n * The reader is spec-core's, copied into `src/vendor/spec-core/markdown/`: the\n * subset of YAML that specifications use - scalars, quoted scalars, inline and\n * block sequences, `#` comments and, as spec-graph reads it, one level of nested\n * mapping flattened to `parent.child` - with the offset of every key and value,\n * because when a status is wrong the report has to point at the line that\n * declares it.\n *\n * Anything richer is recognised and not guessed at: a value continued on the\n * next line, a plain value holding `: `, a block scalar, an anchor. Such a value\n * is not read, and the reason is a parse problem at the value, so a key that\n * says nothing to the graph says why under `--verbose`. Each problem says\n * whether it left something out and which key, for the count a run prints\n * without `--verbose`.\n *\n * What stays here is the shape the rest of spec-graph reads: a key in lower\n * case, which is how a relation key, a status key and `fm.<key>` in a selector\n * have always been compared, and a value that is a string or a list of them.\n */\n\nimport { frontMatterKind, readFrontMatter, type FrontMatter as Read } from './vendor/spec-core/markdown/index.js';\nimport type { ScannedDocument } from './markdown.js';\n\nexport interface YamlEntry {\n  /** Lower-cased key. Nested keys are flattened with a dot. */\n  readonly key: string;\n  readonly value: string | readonly string[];\n  /** Offset of the key. */\n  readonly start: number;\n  /** Offset just past the value. */\n  readonly end: number;\n  /** Offset of the first character of the value, for precise diagnostics. */\n  readonly valueStart: number;\n}\n\n/** Something in the front matter that was not read, and where. */\nexport interface FrontMatterProblem {\n  readonly message: string;\n  readonly start: number;\n  readonly end: number;\n  /**\n   * Whether it left something out: a value, a line or the whole block. A key\n   * written twice is a problem that leaves nothing out, since the last is read.\n   */\n  readonly unread: boolean;\n  /**\n   * The key, lower-cased, whose value or line was left out, when the line\n   * names one; `null` for a line that names none and for the whole block.\n   */\n  readonly key: string | null;\n}\n\nexport interface FrontMatterReading {\n  readonly entries: readonly YamlEntry[];\n  readonly problems: readonly FrontMatterProblem[];\n}\n\nconst NOTHING: FrontMatterReading = { entries: [], problems: [] };\n\n/** A line that reads as `key:` at any indentation, and the key it names. */\nconst KEY_SHAPE = /^[ \\t]*([A-Za-z_][\\w.-]*)[ \\t]*:/;\n\n/** Reads a scanned document's front matter. */\nexport function readEntries(scanned: ScannedDocument): FrontMatterReading {\n  const block = scanned.frontMatter;\n  if (block === null) return neverClosed(scanned);\n  const index = scanned.index;\n  // The block and nothing after it: the reader splits what it is given into\n  // lines, and the body is none of its business.\n  const read = readFrontMatter(scanned.text.slice(0, block.bodyStart), { nested: true });\n  // The scan found a closed block, and the reader closes one by the same rule.\n  if (read === null) return NOTHING;\n  const { entries, problems } = entriesOf(read, 0);\n  return {\n    entries,\n    problems: [\n      ...read.problems.map((problem) => {\n        // A key written twice is read, the last of it; any other line with a\n        // problem is not, and the key it looks like it names is what went\n        // missing - `  status: accepted`, indented under nothing, is a status.\n        const unread = !read.entries.some((entry) => entry.line === problem.line);\n        const text = index.lineText(problem.line + 1);\n        return {\n          message: `front matter: ${problem.message}`,\n          start: index.lineStart(problem.line + 1),\n          end: index.lineEnd(problem.line + 1),\n          unread,\n          key: KEY_SHAPE.exec(text)?.[1]?.toLowerCase() ?? null,\n        };\n      }),\n      ...problems,\n    ].sort((a, b) => a.start - b.start),\n  };\n}\n\n/**\n * Front matter that opens and never closes, which the scan reads as a rule\n * and Markdown after it, so nothing in it reaches the graph.\n *\n * The scan closes a block by the rule the reader does, so this is the one case\n * it leaves null with a first line that opens one. The usual cause is a closer\n * that only looks like one: `----` and `....` closed front matter here before\n * 0.9.0, and neither is one of YAML's document markers.\n */\nfunction neverClosed(scanned: ScannedDocument): FrontMatterReading {\n  const index = scanned.index;\n  const kind = frontMatterKind(index.lineText(1));\n  if (kind === null) return NOTHING;\n  const delimiter = kind === 'yaml' ? '---' : '+++';\n  return {\n    entries: [],\n    problems: [\n      {\n        message: `front matter: opened here and never closed, so none of it is read - close it with \"${delimiter}\" on a line of its own`,\n        start: index.lineStart(1),\n        end: index.lineEnd(1),\n        unread: true,\n        key: null,\n      },\n    ],\n  };\n}\n\n/**\n * Parses front-matter text: what lies between the delimiters, as\n * `FrontMatter.raw` holds it.\n *\n * @param raw The text between the delimiters. It cannot hold a line that would\n *   close them, as text a scan read between them never does.\n * @param baseOffset Offset of `raw` within the containing file, so the returned\n *   spans address the file rather than the fragment.\n */\nexport function parseFrontMatter(raw: string, baseOffset = 0): YamlEntry[] {\n  // The reader reads front matter at the top of a document, so the text goes\n  // back between delimiters, and every offset back by the four characters the\n  // opening one takes. The line break before the closing one is a blank line\n  // when `raw` already ends in one, and a blank line is no key's.\n  const read = readFrontMatter(`---\\n${raw}\\n---`, { nested: true });\n  // Never null: the text opens with a delimiter and closes with one.\n  return read === null ? [] : entriesOf(read, baseOffset - 4).entries;\n}\n\n/** The entries a reading holds, and the values it could not read as problems. */\nfunction entriesOf(read: Read, shift: number): { entries: YamlEntry[]; problems: FrontMatterProblem[] } {\n  const entries: YamlEntry[] = [];\n  const problems: FrontMatterProblem[] = [];\n  for (const entry of read.entries) {\n    const { value } = entry;\n    if (value.kind === 'unsupported') {\n      problems.push({\n        message: `front matter: \"${entry.key}\" is not read: ${value.reason}`,\n        start: entry.valueStart + shift,\n        end: entry.valueEnd + shift,\n        unread: true,\n        key: entry.key.toLowerCase(),\n      });\n      continue;\n    }\n    entries.push({\n      key: entry.key.toLowerCase(),\n      value: value.kind === 'scalar' ? value.scalar.text : value.items.map((item) => item.text),\n      start: entry.keyStart + shift,\n      end: entry.valueEnd + shift,\n      valueStart: entry.valueStart + shift,\n    });\n  }\n  return { entries, problems };\n}\n\n/** Collapses parsed entries into the flat record stored on a document node. */\nexport function toRecord(entries: readonly YamlEntry[]): Record<string, string | readonly string[]> {\n  const out: Record<string, string | readonly string[]> = {};\n  for (const entry of entries) out[entry.key] = entry.value;\n  return out;\n}\n\n/** Every value of a key as a flat list, whether it was a scalar or a sequence. */\nexport function valuesOf(entry: YamlEntry | undefined): string[] {\n  if (!entry) return [];\n  return typeof entry.value === 'string'\n    ? entry.value.length > 0\n      ? [entry.value]\n      : []\n    : [...entry.value];\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@descent-vtt/spec-graph",
-  "version": "0.7.0",
+  "version": "0.9.0",
   "description": "Turn Markdown specs into a verifiable relational graph. Catches ghost handovers, stale premises and broken references in CI.",
   "keywords": [
     "adr",
@@ -37,7 +37,8 @@
     "LICENSE",
     "README.md",
     "bin",
-    "dist"
+    "dist",
+    "src/vendor/spec-core/LICENSE"
   ],
   "publishConfig": {
     "access": "public"

package/src/vendor/spec-core/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 spec-core contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/src/vendor/spec-core/README.md

@@ -0,0 +1,8 @@
+# Vendored from spec-core
+
+These files are copies of modules from
+[spec-core](https://github.com/DescentVTT/spec-core), byte for byte. Do not edit them here: change
+spec-core, then run `node scripts/vendor.mjs --into <this tool>` there.
+`VENDOR.json` records the commit and the SHA-256 of every file, and this
+tool's tests fail when a file no longer matches its hash. `LICENSE` is
+spec-core's, and ships in this tool's package with the compiled copies.

package/dist/regex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"regex.js","sourceRoot":"","sources":["../src/regex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAEH,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,2EAA2E;AAC3E,MAAM,OAAO,YAAa,SAAQ,KAAK;IACrC,sCAAsC;IAC7B,MAAM,CAAS;IAExB,YAAY,OAAe,EAAE,MAAc;QACzC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,GAAG,IAAI,CAAC;AAsBzB,mFAAmF;AACnF,MAAM,GAAG,GAAY,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/F,MAAM,KAAK,GAAqB,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC/C,MAAM,IAAI,GAAqB;IAC7B,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;CACb,CAAC;AACF,iEAAiE;AACjE,MAAM,KAAK,GAAqB;IAC9B,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF;;;;;;;;GAQG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,+EAA+E;IAC/E,kEAAkE;IAClE,IAAI,IAAI,GAAG,GAAG;QAAE,OAAO,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACpE,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAC7C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,OAAO,CAAC,GAAY,EAAE,IAAY;IACzC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC;QAC3C,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACxF,GAAG,GAAG,IAAI,CAAC;YACX,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAClC,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,OAAO,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY;IACtD,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC7C,8EAA8E;IAC9E,uEAAuE;IACvE,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,OAAO,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,KAAK,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;QAC/D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,SAAS,CAAC,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;IAC5F,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,GAAY,EAAE,IAAY;IAChD,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC;AAClD,CAAC;AAED,SAAS,MAAM,CAAC,MAAwB,EAAE,IAAY;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAU,CAAC;QACjC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC5B,CAAC;AAgBD,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,MAAM,aAAa;IACA,MAAM,CAAS;IACxB,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACrC,sEAAsE;QACtE,2EAA2E;QAC3E,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/F,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,gBAAgB;QACtB,MAAM,OAAO,GAAW,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,CAAC,CAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;IACtF,CAAC;IAEO,aAAa;QACnB,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;gBAAE,MAAM;YAC9D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QACjD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7E,CAAC;IAEO,eAAe;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,sEAAsE;QACtE,yEAAyE;QACzE,yEAAyE;QACzE,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACjC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,YAAY,CAAC,yDAAyD,EAAE,KAAK,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC1E,CAAC;IAED,iFAAiF;IACzE,eAAe;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,MAAM,GAAwC,IAAI,CAAC;QAEvD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aAChD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aACrD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QAEnD,IAAI,MAAM,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAEjC,sEAAsE;QACtE,yEAAyE;QACzE,4BAA4B;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,WAAW;QACjB,MAAM,KAAK,GAAG,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,IAAI,GAAG,GAAG,GAAG;YAAE,MAAM,IAAI,YAAY,CAAC,8CAA8C,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrG,IAAI,CAAC,QAAQ,IAAK,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;QAC7C,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACtB,CAAC;IAEO,SAAS;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAEzB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,SAAS;gBACZ,MAAM,IAAI,YAAY,CAAC,+CAA+C,EAAE,KAAK,CAAC,CAAC;YACjF,KAAK,GAAG;gBACN,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3B,KAAK,GAAG;gBACN,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YAClD,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACpC,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;YAChD,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC9C,KAAK,GAAG,CAAC;YACT,KAAK,GAAG;gBACN,MAAM,IAAI,YAAY,CAAC,6BAA6B,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YACtE,KAAK,IAAI;gBACP,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B;gBACE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEnB,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/E,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,QAAQ,IAAK,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;YAC/C,CAAC;iBAAM,IAAI,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBACrE,MAAM,IAAI,YAAY,CACpB,6IAA6I,EAC7I,KAAK,CACN,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,YAAY,CAAC,qDAAqD,EAAE,KAAK,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACK,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;QACpC,IAAI,OAAO;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEhC,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACjE,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,qEAAqE;YACrE,oEAAoE;YACpE,gEAAgE;YAChE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC7G,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACxD,IAAI,GAAG,GAAG,IAAI;oBAAE,MAAM,IAAI,YAAY,CAAC,8CAA8C,EAAE,IAAI,CAAC,CAAC;gBAC7F,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM,IAAI,YAAY,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;QACvF,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED,gFAAgF;IACxE,cAAc;QACpB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAI,IAAI,CAAC,IAAI,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,4EAA4E;QAC5E,2DAA2D;QAC3D,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3C,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3C,MAAM,IAAI,YAAY,CAAC,oEAAoE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9G,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC;YAC3C,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,GAAG,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IACvD,CAAC;IAED,qEAAqE;IAC7D,WAAW;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,mBAAmB,EAAE,CAAC;QAC7F,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;IAC5D,CAAC;IAED,iEAAiE;IACzD,oBAAoB;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,YAAY,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;QACvF,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEnB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YACzC,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;oBACjD,MAAM,IAAI,YAAY,CAAC,2DAA2D,EAAE,KAAK,CAAC,CAAC;gBAC7F,CAAC;gBACD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACzC,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACzC,KAAK,GAAG,EAAE,CAAC;gBACT,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC3B,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACrD,MAAM,IAAI,YAAY,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;gBACjE,CAAC;gBACD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC5C,CAAC;YACD,KAAK,GAAG;gBACN,MAAM,IAAI,YAAY,CACpB,+GAA+G,EAC/G,KAAK,CACN,CAAC;YACJ,KAAK,GAAG,CAAC;YACT,KAAK,GAAG;gBACN,MAAM,IAAI,YAAY,CACpB,MAAM,IAAI,kHAAkH,EAC5H,KAAK,CACN,CAAC;YACJ;gBACE,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvB,MAAM,IAAI,YAAY,CACpB,4FAA4F,EAC5F,KAAK,CACN,CAAC;gBACJ,CAAC;gBACD,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,mEAAmE;oBACnE,sEAAsE;oBACtE,yDAAyD;oBACzD,MAAM,IAAI,YAAY,CAAC,qBAAqB,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC9D,CAAC;gBACD,OAAO,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,MAAc,EAAE,KAAa;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;QACrE,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,YAAY,CAAC,YAAY,MAAM,wBAAwB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAW,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/G,CAAC;QACD,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC;QACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAEO,IAAI;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;CACF;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,IAAI,CAAC,MAAe,EAAE,IAA+B;IAC5D,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;;QACnD,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,MAAM,CAAC,MAAwB;IACtC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,MAAM,IAAI,MAAM;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjD,OAAO,GAAG,CAAC;AACb,CAAC;AA0BD,MAAM,QAAQ;IACH,IAAI,GAAkB,EAAE,CAAC;IAE1B,GAAG,CAAwB,WAAc;QAC/C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YACpC,MAAM,IAAI,YAAY,CACpB,6FAA6F,WAAW,SAAS,EACjH,CAAC,CACF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5B,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,SAAS;QACP,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,IAAU;QAChB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,OAAO;gBACV,OAAO;YACT,KAAK,MAAM;gBACT,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;gBACxC,OAAO;YACT,KAAK,QAAQ;gBACX,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;gBACtD,OAAO;YACT,KAAK,QAAQ;gBACX,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;oBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAClD,OAAO;YACT,KAAK,WAAW,EAAE,CAAC;gBACjB,qEAAqE;gBACrE,sEAAsE;gBACtE,mCAAmC;gBACnC,MAAM,IAAI,GAAW,EAAE,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACpD,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;oBACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAS,CAAC,CAAC;oBACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC3C,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,CAAC;gBACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAS,CAAC,CAAC;gBAC5D,KAAK,MAAM,GAAG,IAAI,IAAI;oBAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC3C,OAAO;YACT,CAAC;YACD,KAAK,QAAQ;gBACX,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC3C,OAAO;QACX,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAU,EAAE,GAAW,EAAE,GAAW;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAEpD,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACpB,OAAO;QACT,CAAC;QAED,yEAAyE;QACzE,iDAAiD;QACjD,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK;YAAE,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IACjD,CAAC;CACF;AAyBD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,OAAO,GAAmB,EAAE;IACzE,MAAM,IAAI,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;IAChC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,CAAC;IACrB,2EAA2E;IAC3E,sEAAsE;IACtE,yEAAyE;IACzE,6CAA6C;IAC7C,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC;IAC/F,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;QAC1B,IAAI,EAAE,CAAC,OAAe,EAAW,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,cAAc,CAAC,IAAU;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC;QACpC,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,OAAO,KAAK,KAAK,SAAS,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,WAAW;YACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QAChE,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,iFAAiF;AACjF,MAAM,OAAO,GAAY,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAExD;;;;;;;;;;GAUG;AACH,MAAM,OAAO;IACM,GAAG,CAAa;IACjC,kDAAkD;IACjC,KAAK,CAAa;IACnC,+BAA+B;IACd,MAAM,CAAa;IACnB,IAAI,CAAY;IAChB,UAAU,CAAc;IACxB,QAAQ,CAAU;IAClB,UAAU,CAAU;IAErC;;;OAGG;IACc,OAAO,CAAa;IACrC,qEAAqE;IACpD,KAAK,CAAa;IAC3B,IAAI,CAAa;IACjB,IAAI,CAAa;IAEzB,YAAY,IAA4B,EAAE,QAAiB,EAAE,UAAmB;QAC9E,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAU,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAY,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE;YAC/B,QAAQ,WAAW,CAAC,EAAE,EAAE,CAAC;gBACvB,KAAK,MAAM;oBACT,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC;oBAChC,MAAM;gBACR,KAAK,OAAO;oBACV,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;oBACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;oBAC/B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;oBAChC,MAAM;gBACR,KAAK,MAAM;oBACT,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;oBAChC,MAAM;gBACR,KAAK,QAAQ;oBACX,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;oBACzB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC;oBAC5C,MAAM;gBACR,KAAK,OAAO;oBACV,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;oBACxB,MAAM;YACV,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,OAAe;QAClB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,QAAQ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACrD,IAAI,KAAK,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC7B,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvB,0EAA0E;gBAC1E,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,QAAQ,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAC;YACtC,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;gBAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAY,CAAC;gBACrC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBAAE,SAAS;gBAClF,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gBACpE,IAAI,QAAQ,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAC;YAChC,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,KAAK,CAAC;YACb,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,IAAI,CAAC,IAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,OAAe,EAAE,QAAgB;QAC7F,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACpD,IAAI,KAAK,GAAG,MAAM,CAAC;QACnB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QACrB,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAW,CAAC;YAClC,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,QAAQ;gBAAE,SAAS;YACvC,OAAO,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;YACvB,QAAQ,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChB,KAAK,QAAQ;oBACX,OAAO,CAAC,CAAC,CAAC;gBACZ,KAAK,OAAO;oBACV,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAW,CAAC;oBACnC,MAAM;gBACR,KAAK,QAAQ;oBACX,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAW,CAAC;oBACpC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAW,CAAC;oBACnC,MAAM;gBACR,KAAK,SAAS;oBACZ,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAc,EAAE,OAAO,EAAE,QAAQ,CAAC;wBAAE,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBACtF,MAAM;gBACR;oBACE,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,SAAS,KAAK,CAAC,SAAoB,EAAE,OAAe,EAAE,QAAgB;IACpE,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,QAAQ,KAAK,CAAC,CAAC;QACxB,KAAK,KAAK;YACR,OAAO,QAAQ,KAAK,OAAO,CAAC,MAAM,CAAC;QACrC,SAAS,CAAC;YACR,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpF,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,SAAS,KAAK,eAAe,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["/**\n * A regular-expression matcher that cannot backtrack.\n *\n * `~=` is the one predicate in the selector language that used to hand a\n * user-supplied string to `RegExp` and wait. That is tolerable at a prompt,\n * where a human can press Ctrl-C. It is not tolerable in `.spec-graph.json`,\n * where the same string runs unattended in CI against every node in the corpus.\n *\n * The cost is neither theoretical nor exotic. `^([A-Za-z0-9_]+[ ]?)+$` is what\n * somebody writes to say \"the title is words separated by single spaces\", and\n * against a title that does not match, V8 tries one branch per way of cutting\n * each word into pieces:\n *\n * ```text\n *                                                          RegExp      here\n * the quick brown fox jumps over the lazy dog!               0.9s      11us\n * the quick brown fox jumps over the lazy dog and!           5.4s      12us\n * the quick brown fox jumps over the lazy dog and keeps!     103s      13us\n * ```\n *\n * Each word of k letters can be cut into pieces 2^(k-1) ways, and the engine\n * tries the product of those, which is why adding one five-letter word costs\n * another factor of sixteen. A sixty-character title does not finish this year.\n *\n * So a pattern here is compiled to a **non-deterministic finite automaton** and\n * simulated over the subject one character at a time (Thompson, 1968), keeping\n * a set of live states instead of a stack of choices. Each state is visited at\n * most once per position, which makes the work exactly O(pattern x subject):\n * the right-hand column above, growing with the subject and not with the\n * pattern's ambiguity.\n *\n * What it costs is a dialect. Backreferences and lookaround are not regular and\n * have no place in a linear automaton, so they are **rejected while compiling**,\n * with a message and an offset, rather than accepted and then slow. That is the\n * whole trade: a predicate that finishes, against a short list of constructs\n * that a documentation selector never needed.\n *\n * Matching is unanchored and, by default, case-insensitive, because that is\n * what `~=` has always been - `new RegExp(source, 'i')` and `.test()`. Globs\n * compile to this as well, and a path on a case-sensitive filesystem needs the\n * case respected, which is the one option. There are no capture groups at all:\n * nothing asks where the match was, only whether there was one, which is why\n * this is a plain NFA simulation rather than a Pike VM.\n *\n * See ADR-0017.\n */\n\n/* -------------------------------------------------------------------------- */\n/* Errors                                                                     */\n/* -------------------------------------------------------------------------- */\n\n/** A pattern that will not compile, and where in it the problem starts. */\nexport class PatternError extends Error {\n  /** Offset into the pattern source. */\n  readonly offset: number;\n\n  constructor(message: string, offset: number) {\n    super(message);\n    this.name = 'PatternError';\n    this.offset = offset;\n  }\n}\n\n/**\n * Ceiling on the compiled program.\n *\n * Counted repetition is compiled by copying - `(ab){20}` is twenty copies -\n * which is part of what keeps the simulation flat, and also what makes\n * `(a{99}){99}` into ten thousand states. The bound has to live somewhere, and\n * a number checked while compiling is the only place it can be enforced without\n * measuring anything at match time.\n *\n * Far above any real selector: the widest pattern in this repository's own\n * tests compiles to seventeen states.\n */\nconst MAX_PROGRAM = 4096;\n\n/* -------------------------------------------------------------------------- */\n/* Character sets                                                             */\n/* -------------------------------------------------------------------------- */\n\n/** An inclusive range of UTF-16 code units. */\ntype Range = readonly [number, number];\n\n/**\n * A set of code units, as inclusive ranges.\n *\n * Code units rather than code points, because that is what a `RegExp` without\n * the `u` flag matches: `.` consumes one half of a surrogate pair, and so does\n * this. Agreeing with the engine this replaced matters more than being right\n * about astral planes, which no selector in any corpus has asked about.\n */\ninterface CharSet {\n  readonly negated: boolean;\n  readonly ranges: readonly Range[];\n}\n\n/** `.` - anything but a line terminator, which is the default `RegExp` reading. */\nconst DOT: CharSet = { negated: true, ranges: [[0x0a, 0x0a], [0x0d, 0x0d], [0x2028, 0x2029]] };\nconst DIGIT: readonly Range[] = [[0x30, 0x39]];\nconst WORD: readonly Range[] = [\n  [0x30, 0x39],\n  [0x41, 0x5a],\n  [0x5f, 0x5f],\n  [0x61, 0x7a],\n];\n/** `\\s`, taken from the specification rather than guessed at. */\nconst SPACE: readonly Range[] = [\n  [0x09, 0x0d],\n  [0x20, 0x20],\n  [0xa0, 0xa0],\n  [0x1680, 0x1680],\n  [0x2000, 0x200a],\n  [0x2028, 0x2029],\n  [0x202f, 0x202f],\n  [0x205f, 0x205f],\n  [0x3000, 0x3000],\n  [0xfeff, 0xfeff],\n];\n\n/**\n * Folds a code unit the way a case-insensitive `RegExp` does.\n *\n * This is `Canonicalize` from the language specification, non-Unicode mode:\n * upper-case the character, keep it unchanged if that produced anything other\n * than one code unit, and keep it unchanged if upper-casing dragged a\n * non-ASCII character into ASCII. The last clause is the one nobody expects and\n * the reason U+017F (long s) does not match `s`.\n */\nfunction canonical(code: number): number {\n  // Every subject a glob sees is mostly ASCII, where the answer needs no string.\n  // The general path below gives the same answer here, only slower.\n  if (code < 128) return code >= 97 && code <= 122 ? code - 32 : code;\n  const upper = String.fromCharCode(code).toUpperCase();\n  if (upper.length !== 1) return code;\n  const folded = upper.charCodeAt(0);\n  if (code >= 128 && folded < 128) return code;\n  return folded;\n}\n\n/**\n * Whether a set accepts a code unit, case-insensitively.\n *\n * The specification canonicalises both sides: a character matches a set when\n * *some* member of the set folds to the same thing it does. A single-character\n * member can be asked that exactly. A range cannot without a fold table for\n * every code unit, so a range is asked the question backwards - does the\n * character, or either of its own case forms, fall inside it - which is exact\n * for every character whose fold is its own case change, and therefore for\n * every range anyone has written.\n */\nfunction accepts(set: CharSet, code: number): boolean {\n  const folded = canonical(code);\n  let hit = false;\n  for (let i = 0; i < set.ranges.length; i += 1) {\n    const [low, high] = set.ranges[i] as Range;\n    if (low === high ? low === code || canonical(low) === folded : inRange(low, high, code)) {\n      hit = true;\n      break;\n    }\n  }\n  return set.negated ? !hit : hit;\n}\n\n/**\n * Whether some member of a range folds to the same thing a code unit does.\n *\n * Asked backwards, by trying the character's own case forms against the raw\n * range - and then checking that the form found there really does fold to the\n * same place, which is the part that is easy to leave out. U+017F upper-cases\n * to `S`, so without that check it matches `[A-Z]`, and it must not: the fold\n * keeps it outside ASCII, which is the same clause `isWordChar` gets wrong if\n * nobody is watching. The differential corpus caught both.\n */\nfunction inRange(low: number, high: number, code: number): boolean {\n  if (code >= low && code <= high) return true;\n  // An ASCII character's only other case form is its ASCII letter twin, and the\n  // two always fold together - so the loop below would ask exactly this.\n  if (code < 128) {\n    const twin = code >= 65 && code <= 90 ? code + 32 : code >= 97 && code <= 122 ? code - 32 : -1;\n    return twin >= low && twin <= high;\n  }\n  const folded = canonical(code);\n  const char = String.fromCharCode(code);\n  for (const variant of [char.toLowerCase(), char.toUpperCase()]) {\n    if (variant.length !== 1) continue;\n    const candidate = variant.charCodeAt(0);\n    if (candidate >= low && candidate <= high && canonical(candidate) === folded) return true;\n  }\n  return false;\n}\n\n/**\n * Whether a set accepts a code unit as written.\n *\n * What `RegExp` does without the `i` flag, and so none of the folding above\n * applies - which also means none of its one divergence does.\n */\nfunction acceptsExactly(set: CharSet, code: number): boolean {\n  return within(set.ranges, code) !== set.negated;\n}\n\nfunction within(ranges: readonly Range[], code: number): boolean {\n  for (let i = 0; i < ranges.length; i += 1) {\n    const range = ranges[i] as Range;\n    if (code >= range[0] && code <= range[1]) return true;\n  }\n  return false;\n}\n\n/**\n * Word characters for `\\b`, which is exactly `\\w` here.\n *\n * The specification does widen this set under case-insensitivity - to every\n * character that folds into it, which is U+017F (long s) and U+212A (the\n * Kelvin sign) - but only in Unicode mode, where `Canonicalize` has no clause\n * keeping a non-ASCII character out of ASCII. This is the non-Unicode dialect,\n * so both stay outside and the table for `\\w` answers for `\\b` as well.\n *\n * Written down because the first version of this function widened the set, and\n * the differential test against `RegExp` is what said otherwise. Reading the\n * clause was not enough; running it was. See ADR-0017.\n */\nfunction isWordChar(code: number): boolean {\n  return within(WORD, code);\n}\n\n/* -------------------------------------------------------------------------- */\n/* Syntax tree                                                                */\n/* -------------------------------------------------------------------------- */\n\ntype Assertion = 'start' | 'end' | 'word-boundary' | 'not-word-boundary';\n\ntype Node =\n  | { readonly kind: 'empty' }\n  | { readonly kind: 'char'; readonly set: CharSet }\n  | { readonly kind: 'assert'; readonly assertion: Assertion }\n  | { readonly kind: 'concat'; readonly parts: readonly Node[] }\n  | { readonly kind: 'alternate'; readonly options: readonly Node[] }\n  | { readonly kind: 'repeat'; readonly node: Node; readonly min: number; readonly max: number };\n\n/* -------------------------------------------------------------------------- */\n/* Parsing                                                                    */\n/* -------------------------------------------------------------------------- */\n\nclass PatternParser {\n  private readonly source: string;\n  private position = 0;\n\n  constructor(source: string) {\n    this.source = source;\n  }\n\n  parse(): Node {\n    const node = this.parseAlternation();\n    // Every character is an atom except the two that close something, and\n    // `parseSequence` stops on both, so anything left over is an unopened `)`.\n    if (this.position < this.source.length) throw new PatternError('unmatched \")\"', this.position);\n    return node;\n  }\n\n  private parseAlternation(): Node {\n    const options: Node[] = [this.parseSequence()];\n    while (this.peek() === '|') {\n      this.position += 1;\n      options.push(this.parseSequence());\n    }\n    return options.length === 1 ? (options[0] as Node) : { kind: 'alternate', options };\n  }\n\n  private parseSequence(): Node {\n    const parts: Node[] = [];\n    for (;;) {\n      const char = this.peek();\n      if (char === undefined || char === '|' || char === ')') break;\n      parts.push(this.parseQuantified());\n    }\n    if (parts.length === 0) return { kind: 'empty' };\n    return parts.length === 1 ? (parts[0] as Node) : { kind: 'concat', parts };\n  }\n\n  private parseQuantified(): Node {\n    const start = this.position;\n    // A group makes its contents quantifiable: `RegExp` rejects `\\b*` and\n    // accepts `(\\b)*`, which is the same nothing said twice, and this parser\n    // treats a group as transparent - so whether one was written is the only\n    // thing left that distinguishes the two.\n    const grouped = this.peek() === '(';\n    const atom = this.parseAtom();\n    const bounds = this.parseQuantifier();\n    if (bounds === null) return atom;\n    if (atom.kind === 'assert' && !grouped) {\n      throw new PatternError('nothing to repeat: a quantifier cannot follow an anchor', start);\n    }\n    return { kind: 'repeat', node: atom, min: bounds.min, max: bounds.max };\n  }\n\n  /** `*`, `+`, `?`, `{n}`, `{n,}`, `{n,m}`, and a trailing `?` that is ignored. */\n  private parseQuantifier(): { min: number; max: number } | null {\n    const char = this.peek();\n    let bounds: { min: number; max: number } | null = null;\n\n    if (char === '*') bounds = { min: 0, max: Infinity };\n    else if (char === '+') bounds = { min: 1, max: Infinity };\n    else if (char === '?') bounds = { min: 0, max: 1 };\n\n    if (bounds !== null) this.position += 1;\n    else if (char === '{') bounds = this.parseBraces();\n    if (bounds === null) return null;\n\n    // Laziness decides *which* match is found, and nothing here asks: the\n    // question is whether one exists, and a lazy quantifier accepts the same\n    // language as a greedy one.\n    if (this.peek() === '?') this.position += 1;\n    return bounds;\n  }\n\n  /**\n   * Reads `{n,m}`, or nothing.\n   *\n   * A `{` that does not open a counted repetition is a literal brace, which is\n   * what `RegExp` does with `a{` and what any pattern written against a\n   * document full of `{0}` placeholders depends on.\n   */\n  private parseBraces(): { min: number; max: number } | null {\n    const match = /^\\{(\\d+)(?:(,)(\\d*))?\\}/.exec(this.source.slice(this.position));\n    if (!match) return null;\n    const min = Number(match[1]);\n    const max = match[2] === undefined ? min : match[3] === '' ? Infinity : Number(match[3]);\n    if (min > max) throw new PatternError('numbers out of order in a counted repetition', this.position);\n    this.position += (match[0] as string).length;\n    return { min, max };\n  }\n\n  private parseAtom(): Node {\n    const start = this.position;\n    const char = this.peek();\n\n    switch (char) {\n      case undefined:\n        throw new PatternError('pattern ends where an expression was expected', start);\n      case '(':\n        return this.parseGroup();\n      case '[':\n        return { kind: 'char', set: this.parseClass() };\n      case '.':\n        this.position += 1;\n        return { kind: 'char', set: DOT };\n      case '^':\n        this.position += 1;\n        return { kind: 'assert', assertion: 'start' };\n      case '$':\n        this.position += 1;\n        return { kind: 'assert', assertion: 'end' };\n      case '*':\n      case '+':\n        throw new PatternError(`nothing to repeat before \"${char}\"`, start);\n      case '\\\\':\n        return this.parseEscape();\n      default:\n        this.position += 1;\n        return { kind: 'char', set: literal(char.charCodeAt(0)) };\n    }\n  }\n\n  /**\n   * A group, which is never a capture.\n   *\n   * `(a)` and `(?:a)` compile to the same automaton because nothing downstream\n   * can ask what `(a)` caught. A named group is accepted and its name dropped,\n   * so a pattern copied out of somewhere else keeps working.\n   */\n  private parseGroup(): Node {\n    const start = this.position;\n    this.position += 1;\n\n    if (this.source.startsWith('?:', this.position)) {\n      this.position += 2;\n    } else if (this.peek() === '?') {\n      const named = /^\\?<([A-Za-z_$][\\w$]*)>/.exec(this.source.slice(this.position));\n      if (named) {\n        this.position += (named[0] as string).length;\n      } else if (/^\\?(?:=|!|<=|<!)/.test(this.source.slice(this.position))) {\n        throw new PatternError(\n          'lookaround is not supported: an automaton that cannot backtrack cannot look ahead - use ^= $= or *= for a fixed prefix, suffix or substring',\n          start,\n        );\n      } else {\n        throw new PatternError('unsupported group: expected (?:...) or (?<name>...)', start);\n      }\n    }\n\n    const inner = this.parseAlternation();\n    if (this.peek() !== ')') throw new PatternError('unmatched \"(\"', start);\n    this.position += 1;\n    return inner;\n  }\n\n  /**\n   * Reads a `[...]` class.\n   *\n   * `[]` matches nothing and `[^]` matches anything, which reads like a mistake\n   * and is what every JavaScript engine does: the class ends at the first `]`,\n   * even when that `]` is the first character inside it.\n   */\n  private parseClass(): CharSet {\n    const start = this.position;\n    this.position += 1;\n    const negated = this.peek() === '^';\n    if (negated) this.position += 1;\n\n    const ranges: Range[] = [];\n    while (this.position < this.source.length && this.peek() !== ']') {\n      const low = this.parseClassAtom();\n      // A `-` between two single characters is a range. Anywhere else - at\n      // either end of the class, or beside a `\\d`-style set, which has no\n      // endpoint - it is a literal hyphen, exactly as Annex B has it.\n      if (this.peek() !== '-' || this.source[this.position + 1] === ']' || this.position + 1 >= this.source.length) {\n        push(ranges, low);\n        continue;\n      }\n      const dash = this.position;\n      this.position += 1;\n      const high = this.parseClassAtom();\n      if (typeof low === 'number' && typeof high === 'number') {\n        if (low > high) throw new PatternError('characters out of order in a character class', dash);\n        ranges.push([low, high]);\n        continue;\n      }\n      push(ranges, low);\n      ranges.push([0x2d, 0x2d]);\n      push(ranges, high);\n    }\n\n    if (this.peek() !== ']') throw new PatternError('unterminated character class', start);\n    this.position += 1;\n    return { negated, ranges };\n  }\n\n  /** One member of a class: a code unit, or a whole set for `\\d` and its kind. */\n  private parseClassAtom(): number | readonly Range[] {\n    if (this.peek() !== '\\\\') {\n      const code = (this.peek() as string).charCodeAt(0);\n      this.position += 1;\n      return code;\n    }\n    // `\\b` is a backspace inside a class and a word boundary outside one, which\n    // is the only place the two readings of an escape diverge.\n    if (this.source[this.position + 1] === 'b') {\n      this.position += 2;\n      return 0x08;\n    }\n    if (this.source[this.position + 1] === 'B') {\n      throw new PatternError('\"\\\\B\" is an assertion, not a character, so it cannot be in a class', this.position);\n    }\n    const set = this.parseCharacterEscape();\n    if (!set.negated && set.ranges.length === 1) {\n      const [low, high] = set.ranges[0] as Range;\n      if (low === high) return low;\n    }\n    return set.negated ? invert(set.ranges) : set.ranges;\n  }\n\n  /** An escape outside a class, where `\\b` and `\\B` are assertions. */\n  private parseEscape(): Node {\n    const next = this.source[this.position + 1];\n    if (next === 'b' || next === 'B') {\n      this.position += 2;\n      return { kind: 'assert', assertion: next === 'b' ? 'word-boundary' : 'not-word-boundary' };\n    }\n    return { kind: 'char', set: this.parseCharacterEscape() };\n  }\n\n  /** Every escape that stands for a character or a set of them. */\n  private parseCharacterEscape(): CharSet {\n    const start = this.position;\n    this.position += 1;\n    const char = this.peek();\n    if (char === undefined) throw new PatternError('pattern ends with a backslash', start);\n    this.position += 1;\n\n    switch (char) {\n      case 'd':\n        return { negated: false, ranges: DIGIT };\n      case 'D':\n        return { negated: true, ranges: DIGIT };\n      case 'w':\n        return { negated: false, ranges: WORD };\n      case 'W':\n        return { negated: true, ranges: WORD };\n      case 's':\n        return { negated: false, ranges: SPACE };\n      case 'S':\n        return { negated: true, ranges: SPACE };\n      case 'n':\n        return literal(0x0a);\n      case 'r':\n        return literal(0x0d);\n      case 't':\n        return literal(0x09);\n      case 'f':\n        return literal(0x0c);\n      case 'v':\n        return literal(0x0b);\n      case '0':\n        if (/^\\d/.test(this.source.slice(this.position))) {\n          throw new PatternError('an octal escape is not supported - write \\\\xHH or \\\\uHHHH', start);\n        }\n        return literal(0);\n      case 'x':\n        return literal(this.readHex(2, start));\n      case 'u':\n        return literal(this.readHex(4, start));\n      case 'c': {\n        const letter = this.peek();\n        if (letter === undefined || !/[A-Za-z]/.test(letter)) {\n          throw new PatternError('expected a letter after \"\\\\c\"', start);\n        }\n        this.position += 1;\n        return literal(letter.charCodeAt(0) % 32);\n      }\n      case 'k':\n        throw new PatternError(\n          'a named backreference is not supported: a backreference is not a regular expression, and this is an automaton',\n          start,\n        );\n      case 'p':\n      case 'P':\n        throw new PatternError(\n          `\"\\\\${char}\" needs a table of Unicode properties, which this matcher does not carry - write the characters out as a [class]`,\n          start,\n        );\n      default:\n        if (/[1-9]/.test(char)) {\n          throw new PatternError(\n            'a backreference is not supported: it is not a regular expression, and this is an automaton',\n            start,\n          );\n        }\n        if (/[A-Za-z]/.test(char)) {\n          // `RegExp` reads an unknown letter escape as the letter itself, so\n          // `\\A` quietly matches a capital A and `\\z` a lower-case z. Saying so\n          // is worth more than agreeing with a rule nobody wanted.\n          throw new PatternError(`unknown escape \"\\\\${char}\"`, start);\n        }\n        return literal(char.charCodeAt(0));\n    }\n  }\n\n  private readHex(digits: number, start: number): number {\n    const raw = this.source.slice(this.position, this.position + digits);\n    if (raw.length !== digits || !/^[0-9a-fA-F]+$/.test(raw)) {\n      throw new PatternError(`expected ${digits} hex digits after \"\\\\${this.source[start + 1] as string}\"`, start);\n    }\n    this.position += digits;\n    return Number.parseInt(raw, 16);\n  }\n\n  private peek(): string | undefined {\n    return this.source[this.position];\n  }\n}\n\nfunction literal(code: number): CharSet {\n  return { negated: false, ranges: [[code, code]] };\n}\n\nfunction push(ranges: Range[], atom: number | readonly Range[]): void {\n  if (typeof atom === 'number') ranges.push([atom, atom]);\n  else ranges.push(...atom);\n}\n\n/**\n * Complement of a range list, so `[\\D]` can sit inside a class.\n *\n * A negated escape is a set with no endpoints, and a class is a union of\n * ranges, so the only way to put one inside the other is to spell out what it\n * leaves.\n */\nfunction invert(ranges: readonly Range[]): readonly Range[] {\n  const sorted = [...ranges].sort((a, b) => a[0] - b[0]);\n  const out: Range[] = [];\n  let cursor = 0;\n  for (const [low, high] of sorted) {\n    if (low > cursor) out.push([cursor, low - 1]);\n    cursor = Math.max(cursor, high + 1);\n  }\n  if (cursor <= 0xffff) out.push([cursor, 0xffff]);\n  return out;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Compilation                                                                */\n/* -------------------------------------------------------------------------- */\n\ninterface Split {\n  readonly op: 'split';\n  /** Where the first branch starts. */\n  x: number;\n  /** Where the second branch starts. */\n  y: number;\n}\n\ninterface Jump {\n  readonly op: 'jump';\n  to: number;\n}\n\ntype Instruction =\n  | { readonly op: 'char'; readonly set: CharSet }\n  | Split\n  | Jump\n  | { readonly op: 'assert'; readonly assertion: Assertion }\n  | { readonly op: 'match' };\n\nclass Compiler {\n  readonly code: Instruction[] = [];\n\n  private add<T extends Instruction>(instruction: T): T {\n    if (this.code.length >= MAX_PROGRAM) {\n      throw new PatternError(\n        `pattern is too large: counted repetition is compiled by copying, and this needs more than ${MAX_PROGRAM} states`,\n        0,\n      );\n    }\n    this.code.push(instruction);\n    return instruction;\n  }\n\n  get here(): number {\n    return this.code.length;\n  }\n\n  emitMatch(): void {\n    this.add({ op: 'match' });\n  }\n\n  compile(node: Node): void {\n    switch (node.kind) {\n      case 'empty':\n        return;\n      case 'char':\n        this.add({ op: 'char', set: node.set });\n        return;\n      case 'assert':\n        this.add({ op: 'assert', assertion: node.assertion });\n        return;\n      case 'concat':\n        for (const part of node.parts) this.compile(part);\n        return;\n      case 'alternate': {\n        // One split per option but the last. Each split falls through to its\n        // own branch and points its second arm at the next split; each branch\n        // ends in a jump past all of them.\n        const ends: Jump[] = [];\n        for (let i = 0; i < node.options.length - 1; i += 1) {\n          const split = this.add({ op: 'split', x: 0, y: 0 });\n          split.x = this.here;\n          this.compile(node.options[i] as Node);\n          ends.push(this.add({ op: 'jump', to: 0 }));\n          split.y = this.here;\n        }\n        this.compile(node.options[node.options.length - 1] as Node);\n        for (const end of ends) end.to = this.here;\n        return;\n      }\n      case 'repeat':\n        this.repeat(node.node, node.min, node.max);\n        return;\n    }\n  }\n\n  private repeat(node: Node, min: number, max: number): void {\n    for (let i = 0; i < min; i += 1) this.compile(node);\n\n    if (max === Infinity) {\n      const split = this.add({ op: 'split', x: 0, y: 0 });\n      const body = this.here;\n      split.x = body;\n      this.compile(node);\n      this.add({ op: 'jump', to: body - 1 });\n      split.y = this.here;\n      return;\n    }\n\n    // `{2,5}` is two copies and then three optional ones, each able to leave\n    // for the far end rather than for the next copy.\n    const exits: Split[] = [];\n    for (let i = min; i < max; i += 1) {\n      const split = this.add({ op: 'split', x: 0, y: 0 });\n      split.x = this.here;\n      exits.push(split);\n      this.compile(node);\n    }\n    for (const split of exits) split.y = this.here;\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Simulation                                                                 */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A compiled pattern. Reusable and safe to cache.\n *\n * Not reentrant, which nothing can ask of it: `test` is synchronous and calls\n * out to nothing, and the buffers it keeps between subjects are what make it\n * cheap enough to run against every path a walk visits.\n */\nexport interface Matcher {\n  /** True when the pattern matches anywhere in the subject. */\n  test(subject: string): boolean;\n  /** State count. Published for the size test, and for nothing else. */\n  readonly size: number;\n}\n\nexport interface PatternOptions {\n  /** Fold case the way the `i` flag does. On unless set to `false`. */\n  readonly ignoreCase?: boolean | undefined;\n}\n\n/**\n * Compiles a pattern into a matcher.\n *\n * Throws {@link PatternError} on anything it cannot run in linear time, which\n * is the point: the alternative to a message here is a build that stops.\n */\nexport function compilePattern(source: string, options: PatternOptions = {}): Matcher {\n  const tree = new PatternParser(source).parse();\n  const compiler = new Compiler();\n  compiler.compile(tree);\n  compiler.emitMatch();\n  // A pattern that begins by asserting the start of the subject cannot match\n  // anywhere else, so the simulation stops seeding new threads at every\n  // position. Nothing depends on this being noticed - it is the difference\n  // between one pass and two over a long body.\n  const machine = new Machine(compiler.code, startsAnchored(tree), options.ignoreCase !== false);\n  return {\n    size: compiler.code.length,\n    test: (subject: string): boolean => machine.test(subject),\n  };\n}\n\n/** True when every path through the pattern opens by asserting the start. */\nfunction startsAnchored(node: Node): boolean {\n  switch (node.kind) {\n    case 'assert':\n      return node.assertion === 'start';\n    case 'concat': {\n      const first = node.parts[0];\n      return first !== undefined && startsAnchored(first);\n    }\n    case 'alternate':\n      return node.options.every((option) => startsAnchored(option));\n    case 'repeat':\n      return node.min > 0 && startsAnchored(node.node);\n    default:\n      return false;\n  }\n}\n\nconst OP_CHAR = 0;\nconst OP_SPLIT = 1;\nconst OP_JUMP = 2;\nconst OP_ASSERT = 3;\nconst OP_MATCH = 4;\n\n/** Fills the slots of states that are not characters, where nothing reads it. */\nconst NOTHING: CharSet = { negated: false, ranges: [] };\n\n/**\n * The simulation, over the program flattened into typed arrays.\n *\n * The compiler's instructions are objects of five shapes, and one loop reading\n * `op` off all five is a megamorphic property read on every step. Simulated that\n * way, with a fresh visited table per subject, a glob cost about 3.5\n * microseconds a path and a path that failed on its first character still paid\n * half a microsecond for the allocation. Flat arrays and buffers kept between\n * subjects bring those to 0.6 and 0.04 - `RegExp` takes 0.06 - which matters\n * because a walk tests every path it visits against every pattern.\n */\nclass Machine {\n  private readonly ops: Uint8Array;\n  /** A split's first branch, or a jump's target. */\n  private readonly first: Int32Array;\n  /** A split's second branch. */\n  private readonly second: Int32Array;\n  private readonly sets: CharSet[];\n  private readonly assertions: Assertion[];\n  private readonly anchored: boolean;\n  private readonly ignoreCase: boolean;\n\n  /**\n   * The position each state was last reached at. One visit per state per\n   * position is exactly what turns the exponent into a product.\n   */\n  private readonly visited: Int32Array;\n  /** Each visit pushes at most two states, so this cannot overflow. */\n  private readonly stack: Int32Array;\n  private live: Int32Array;\n  private next: Int32Array;\n\n  constructor(code: readonly Instruction[], anchored: boolean, ignoreCase: boolean) {\n    const size = code.length;\n    this.ops = new Uint8Array(size);\n    this.first = new Int32Array(size);\n    this.second = new Int32Array(size);\n    this.sets = new Array<CharSet>(size).fill(NOTHING);\n    this.assertions = new Array<Assertion>(size).fill('start');\n    this.anchored = anchored;\n    this.ignoreCase = ignoreCase;\n    this.visited = new Int32Array(size).fill(-1);\n    this.stack = new Int32Array(2 * size + 1);\n    this.live = new Int32Array(size);\n    this.next = new Int32Array(size);\n\n    code.forEach((instruction, pc) => {\n      switch (instruction.op) {\n        case 'char':\n          this.ops[pc] = OP_CHAR;\n          this.sets[pc] = instruction.set;\n          break;\n        case 'split':\n          this.ops[pc] = OP_SPLIT;\n          this.first[pc] = instruction.x;\n          this.second[pc] = instruction.y;\n          break;\n        case 'jump':\n          this.ops[pc] = OP_JUMP;\n          this.first[pc] = instruction.to;\n          break;\n        case 'assert':\n          this.ops[pc] = OP_ASSERT;\n          this.assertions[pc] = instruction.assertion;\n          break;\n        case 'match':\n          this.ops[pc] = OP_MATCH;\n          break;\n      }\n    });\n  }\n\n  test(subject: string): boolean {\n    const length = subject.length;\n    this.visited.fill(-1);\n\n    let live = this.live;\n    let next = this.next;\n    let alive = 0;\n\n    for (let position = 0; position <= length; position += 1) {\n      if (position === 0 || !this.anchored) {\n        alive = this.seed(live, alive, 0, subject, position);\n        if (alive < 0) return true;\n      } else if (alive === 0) {\n        // An anchored pattern gets one chance, and every thread from it has died.\n        return false;\n      }\n\n      if (position === length) return false;\n      const char = subject.charCodeAt(position);\n      let arriving = 0;\n      for (let i = 0; i < alive; i += 1) {\n        const pc = live[i] as number;\n        const set = this.sets[pc] as CharSet;\n        if (!(this.ignoreCase ? accepts(set, char) : acceptsExactly(set, char))) continue;\n        arriving = this.seed(next, arriving, pc + 1, subject, position + 1);\n        if (arriving < 0) return true;\n      }\n      const spent = live;\n      live = next;\n      next = spent;\n      alive = arriving;\n    }\n\n    return false;\n  }\n\n  /**\n   * Follows every zero-width transition out of one state, appending the\n   * character states it reaches to `list`.\n   *\n   * Returns the new length of the list, or -1 the moment a thread reaches the\n   * end of the pattern: the only question is whether a match exists, so there\n   * is no leftmost-longest to settle and no captures to keep, and the first\n   * thread to arrive is the answer.\n   *\n   * A stray thread at state 0 changes no answer: an unanchored pattern seeds it\n   * at every position anyway, and an anchored one opens by asserting the start.\n   * That makes two mutants here equivalent, with no test to write - the loop\n   * running once past an empty stack, and a jump read as a split, both of which\n   * add exactly that thread.\n   */\n  private seed(list: Int32Array, length: number, start: number, subject: string, position: number): number {\n    const { ops, first, second, visited, stack } = this;\n    let count = length;\n    let top = 0;\n    stack[top++] = start;\n    while (top > 0) {\n      const pc = stack[--top] as number;\n      if (visited[pc] === position) continue;\n      visited[pc] = position;\n      switch (ops[pc]) {\n        case OP_MATCH:\n          return -1;\n        case OP_JUMP:\n          stack[top++] = first[pc] as number;\n          break;\n        case OP_SPLIT:\n          stack[top++] = second[pc] as number;\n          stack[top++] = first[pc] as number;\n          break;\n        case OP_ASSERT:\n          if (holds(this.assertions[pc] as Assertion, subject, position)) stack[top++] = pc + 1;\n          break;\n        default:\n          list[count++] = pc;\n      }\n    }\n    return count;\n  }\n}\n\nfunction holds(assertion: Assertion, subject: string, position: number): boolean {\n  switch (assertion) {\n    case 'start':\n      return position === 0;\n    case 'end':\n      return position === subject.length;\n    default: {\n      const before = position > 0 && isWordChar(subject.charCodeAt(position - 1));\n      const after = position < subject.length && isWordChar(subject.charCodeAt(position));\n      return (before !== after) === (assertion === 'word-boundary');\n    }\n  }\n}\n"]}