@descent-vtt/spec-graph 0.8.0 → 0.9.0

package/dist/vendor/spec-core/text/lines.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Lines, offsets and masks.
+ *
+ * Every finding a spec-* tool reports points at a line and a column, and every
+ * structure the scanner builds carries raw offsets rather than copies of the
+ * text. Converting between the two is on the hot path, so the line table is
+ * built once per file and searched by bisection.
+ *
+ * All three line terminators end a line - `\n`, `\r\n` and a lone `\r`, as
+ * CommonMark has it - and `\r\n` counts once. A Windows checkout of a document
+ * must produce the line numbers a POSIX checkout does.
+ */
+export interface Position {
+    /** UTF-16 offset into the text. */
+    readonly offset: number;
+    /** 1-based. */
+    readonly line: number;
+    /** 1-based, in UTF-16 code units. */
+    readonly column: number;
+}
+export interface LineIndex {
+    /** Number of lines. A final terminator does not open a line of its own. */
+    readonly lineCount: number;
+    /** Offset at which a 1-based line starts. Out-of-range lines are clamped. */
+    lineStart(line: number): number;
+    /** Offset just past a 1-based line, before its terminator. */
+    lineEnd(line: number): number;
+    /** A 1-based line without its terminator. */
+    lineText(line: number): string;
+    /** The line and column of an offset. Out-of-range offsets are clamped. */
+    positionAt(offset: number): Position;
+}
+/** Offsets at which each line starts; index 0 is line 1. */
+export declare function lineStarts(text: string): number[];
+/** Builds the line table for a text. */
+export declare function createLineIndex(text: string): LineIndex;
+/**
+ * The line and column of an offset, by bisection over a line table.
+ *
+ * The search is half-open: `high` is one past the last candidate, and it
+ * narrows until one is left. There is no `- 1` to get wrong.
+ */
+export declare function locate(starts: readonly number[], offset: number): Position;
+/** A half-open range of offsets. */
+export interface Range {
+    readonly start: number;
+    readonly end: number;
+}
+/** Sorts and merges ranges; touching ranges merge. Empty ranges vanish. */
+export declare function mergeRanges(ranges: readonly Range[]): Range[];
+/** Whether an offset lies in one of a list of merged, sorted ranges. */
+export declare function inRanges(merged: readonly Range[], offset: number): boolean;
+/**
+ * Blanks the given ranges with spaces, keeping every other character and
+ * every line terminator where it was.
+ *
+ * Offsets survive a mask, which is the point: something found at offset 400
+ * of the masked text is at offset 400 of the original, on the same line. The
+ * replacement walks UTF-16 code units, so a surrogate pair becomes two spaces
+ * and every later offset still lands where it did.
+ */
+export declare function maskRanges(text: string, ranges: readonly Range[]): string;
+/** A text without a leading byte-order mark. */
+export declare function stripBom(text: string): string;
+/** The terminator a text mostly uses; `\n` when it has none or they tie. */
+export declare function lineEnding(text: string): '\n' | '\r\n';
+/**
+ * The lines of a text, without terminators. Unlike the line table, a final
+ * terminator does produce a last, empty line, so that joining the lines with
+ * the same terminator gives the text back byte for byte.
+ */
+export declare function splitLines(text: string): string[];

package/dist/vendor/spec-core/text/lines.js

@@ -0,0 +1,156 @@
+/**
+ * Lines, offsets and masks.
+ *
+ * Every finding a spec-* tool reports points at a line and a column, and every
+ * structure the scanner builds carries raw offsets rather than copies of the
+ * text. Converting between the two is on the hot path, so the line table is
+ * built once per file and searched by bisection.
+ *
+ * All three line terminators end a line - `\n`, `\r\n` and a lone `\r`, as
+ * CommonMark has it - and `\r\n` counts once. A Windows checkout of a document
+ * must produce the line numbers a POSIX checkout does.
+ */
+const LF = 10;
+const CR = 13;
+/** Offsets at which each line starts; index 0 is line 1. */
+export function lineStarts(text) {
+    const starts = [0];
+    for (let i = 0; i < text.length; i += 1) {
+        const ch = text.charCodeAt(i);
+        if (ch === LF) {
+            starts.push(i + 1);
+        }
+        else if (ch === CR) {
+            if (text.charCodeAt(i + 1) === LF)
+                i += 1;
+            starts.push(i + 1);
+        }
+    }
+    // A terminator at the very end opens a line that holds nothing; an editor
+    // does not count it, and neither does this.
+    if (starts.length > 1 && starts[starts.length - 1] === text.length)
+        starts.pop();
+    return starts;
+}
+/** Builds the line table for a text. */
+export function createLineIndex(text) {
+    const starts = lineStarts(text);
+    const lineCount = starts.length;
+    const clamp = (line) => (line < 1 ? 1 : line > lineCount ? lineCount : line);
+    const startOf = (line) => starts[clamp(line) - 1];
+    const endOf = (line) => {
+        const index = clamp(line);
+        const start = starts[index - 1];
+        let end = index === lineCount ? text.length : starts[index];
+        // At most two terminator characters, and never past the line's own start.
+        if (end > start && text.charCodeAt(end - 1) === LF)
+            end -= 1;
+        if (end > start && text.charCodeAt(end - 1) === CR)
+            end -= 1;
+        return end;
+    };
+    return {
+        lineCount,
+        lineStart: startOf,
+        lineEnd: endOf,
+        lineText: (line) => text.slice(startOf(line), endOf(line)),
+        positionAt: (offset) => locate(starts, offset < 0 ? 0 : offset > text.length ? text.length : offset),
+    };
+}
+/**
+ * The line and column of an offset, by bisection over a line table.
+ *
+ * The search is half-open: `high` is one past the last candidate, and it
+ * narrows until one is left. There is no `- 1` to get wrong.
+ */
+export function locate(starts, offset) {
+    let low = 0;
+    let high = starts.length;
+    while (high - low > 1) {
+        const mid = (low + high) >> 1;
+        if (starts[mid] <= offset)
+            low = mid;
+        else
+            high = mid;
+    }
+    return { offset, line: low + 1, column: offset - starts[low] + 1 };
+}
+/** Sorts and merges ranges; touching ranges merge. Empty ranges vanish. */
+export function mergeRanges(ranges) {
+    const sorted = ranges.filter((r) => r.end > r.start).sort((a, b) => a.start - b.start || a.end - b.end);
+    const out = [];
+    for (const range of sorted) {
+        const last = out[out.length - 1];
+        if (last !== undefined && range.start <= last.end)
+            last.end = Math.max(last.end, range.end);
+        else
+            out.push({ start: range.start, end: range.end });
+    }
+    return out;
+}
+/** Whether an offset lies in one of a list of merged, sorted ranges. */
+export function inRanges(merged, offset) {
+    let low = 0;
+    let high = merged.length;
+    while (low < high) {
+        const mid = (low + high) >> 1;
+        const range = merged[mid];
+        if (offset < range.start)
+            high = mid;
+        else if (offset >= range.end)
+            low = mid + 1;
+        else
+            return true;
+    }
+    return false;
+}
+const NOT_A_TERMINATOR = /[^\n\r]/g;
+/**
+ * Blanks the given ranges with spaces, keeping every other character and
+ * every line terminator where it was.
+ *
+ * Offsets survive a mask, which is the point: something found at offset 400
+ * of the masked text is at offset 400 of the original, on the same line. The
+ * replacement walks UTF-16 code units, so a surrogate pair becomes two spaces
+ * and every later offset still lands where it did.
+ */
+export function maskRanges(text, ranges) {
+    const merged = mergeRanges(ranges);
+    if (merged.length === 0)
+        return text;
+    let out = '';
+    let cursor = 0;
+    for (const range of merged) {
+        const start = Math.min(range.start, text.length);
+        const end = Math.min(range.end, text.length);
+        out += text.slice(cursor, start);
+        out += text.slice(start, end).replace(NOT_A_TERMINATOR, ' ');
+        cursor = end;
+    }
+    return out + text.slice(cursor);
+}
+/** A text without a leading byte-order mark. */
+export function stripBom(text) {
+    return text.charCodeAt(0) === 0xfeff ? text.slice(1) : text;
+}
+/** The terminator a text mostly uses; `\n` when it has none or they tie. */
+export function lineEnding(text) {
+    let crlf = 0;
+    let lf = 0;
+    for (let i = text.indexOf('\n'); i >= 0; i = text.indexOf('\n', i + 1)) {
+        if (i > 0 && text.charCodeAt(i - 1) === CR)
+            crlf += 1;
+        else
+            lf += 1;
+    }
+    return crlf > lf ? '\r\n' : '\n';
+}
+/**
+ * The lines of a text, without terminators. Unlike the line table, a final
+ * terminator does produce a last, empty line, so that joining the lines with
+ * the same terminator gives the text back byte for byte.
+ */
+export function splitLines(text) {
+    return text.split(/\r\n|\n|\r/);
+}
+//# sourceMappingURL=lines.js.map

package/dist/vendor/spec-core/text/lines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lines.js","sourceRoot":"","sources":["../../../../src/vendor/spec-core/text/lines.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAwBH,MAAM,EAAE,GAAG,EAAE,CAAC;AACd,MAAM,EAAE,GAAG,EAAE,CAAC;AAEd,4DAA4D;AAC5D,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,MAAM,GAAa,CAAC,CAAC,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE;gBAAE,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,0EAA0E;IAC1E,4CAA4C;IAC5C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM;QAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IACjF,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7F,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAW,CAAC;IAC5E,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAW,CAAC;QAC1C,IAAI,GAAG,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,MAAM,CAAC,KAAK,CAAY,CAAC;QACxE,0EAA0E;QAC1E,IAAI,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC;QAC7D,IAAI,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC;QAC7D,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,OAAO;QACL,SAAS;QACT,SAAS,EAAE,OAAO;QAClB,OAAO,EAAE,KAAK;QACd,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1D,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;KACrG,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,MAAyB,EAAE,MAAc;IAC9D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,OAAO,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAK,MAAM,CAAC,GAAG,CAAY,IAAI,MAAM;YAAE,GAAG,GAAG,GAAG,CAAC;;YAC5C,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,GAAI,MAAM,CAAC,GAAG,CAAY,GAAG,CAAC,EAAE,CAAC;AACjF,CAAC;AAQD,2EAA2E;AAC3E,MAAM,UAAU,WAAW,CAAC,MAAwB;IAClD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACxG,MAAM,GAAG,GAAqC,EAAE,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;;YACvF,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,QAAQ,CAAC,MAAwB,EAAE,MAAc;IAC/D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAU,CAAC;QACnC,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK;YAAE,IAAI,GAAG,GAAG,CAAC;aAChC,IAAI,MAAM,IAAI,KAAK,CAAC,GAAG;YAAE,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;;YACvC,OAAO,IAAI,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,gBAAgB,GAAG,UAAU,CAAC;AAEpC;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY,EAAE,MAAwB;IAC/D,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACjC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,CAAC;IACf,CAAC;IACD,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9D,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE;YAAE,IAAI,IAAI,CAAC,CAAC;;YACjD,EAAE,IAAI,CAAC,CAAC;IACf,CAAC;IACD,OAAO,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;AAClC,CAAC","sourcesContent":["/**\n * Lines, offsets and masks.\n *\n * Every finding a spec-* tool reports points at a line and a column, and every\n * structure the scanner builds carries raw offsets rather than copies of the\n * text. Converting between the two is on the hot path, so the line table is\n * built once per file and searched by bisection.\n *\n * All three line terminators end a line - `\\n`, `\\r\\n` and a lone `\\r`, as\n * CommonMark has it - and `\\r\\n` counts once. A Windows checkout of a document\n * must produce the line numbers a POSIX checkout does.\n */\n\nexport interface Position {\n  /** UTF-16 offset into the text. */\n  readonly offset: number;\n  /** 1-based. */\n  readonly line: number;\n  /** 1-based, in UTF-16 code units. */\n  readonly column: number;\n}\n\nexport interface LineIndex {\n  /** Number of lines. A final terminator does not open a line of its own. */\n  readonly lineCount: number;\n  /** Offset at which a 1-based line starts. Out-of-range lines are clamped. */\n  lineStart(line: number): number;\n  /** Offset just past a 1-based line, before its terminator. */\n  lineEnd(line: number): number;\n  /** A 1-based line without its terminator. */\n  lineText(line: number): string;\n  /** The line and column of an offset. Out-of-range offsets are clamped. */\n  positionAt(offset: number): Position;\n}\n\nconst LF = 10;\nconst CR = 13;\n\n/** Offsets at which each line starts; index 0 is line 1. */\nexport function lineStarts(text: string): number[] {\n  const starts: number[] = [0];\n  for (let i = 0; i < text.length; i += 1) {\n    const ch = text.charCodeAt(i);\n    if (ch === LF) {\n      starts.push(i + 1);\n    } else if (ch === CR) {\n      if (text.charCodeAt(i + 1) === LF) i += 1;\n      starts.push(i + 1);\n    }\n  }\n  // A terminator at the very end opens a line that holds nothing; an editor\n  // does not count it, and neither does this.\n  if (starts.length > 1 && starts[starts.length - 1] === text.length) starts.pop();\n  return starts;\n}\n\n/** Builds the line table for a text. */\nexport function createLineIndex(text: string): LineIndex {\n  const starts = lineStarts(text);\n  const lineCount = starts.length;\n  const clamp = (line: number): number => (line < 1 ? 1 : line > lineCount ? lineCount : line);\n  const startOf = (line: number): number => starts[clamp(line) - 1] as number;\n  const endOf = (line: number): number => {\n    const index = clamp(line);\n    const start = starts[index - 1] as number;\n    let end = index === lineCount ? text.length : (starts[index] as number);\n    // At most two terminator characters, and never past the line's own start.\n    if (end > start && text.charCodeAt(end - 1) === LF) end -= 1;\n    if (end > start && text.charCodeAt(end - 1) === CR) end -= 1;\n    return end;\n  };\n  return {\n    lineCount,\n    lineStart: startOf,\n    lineEnd: endOf,\n    lineText: (line) => text.slice(startOf(line), endOf(line)),\n    positionAt: (offset) => locate(starts, offset < 0 ? 0 : offset > text.length ? text.length : offset),\n  };\n}\n\n/**\n * The line and column of an offset, by bisection over a line table.\n *\n * The search is half-open: `high` is one past the last candidate, and it\n * narrows until one is left. There is no `- 1` to get wrong.\n */\nexport function locate(starts: readonly number[], offset: number): Position {\n  let low = 0;\n  let high = starts.length;\n  while (high - low > 1) {\n    const mid = (low + high) >> 1;\n    if ((starts[mid] as number) <= offset) low = mid;\n    else high = mid;\n  }\n  return { offset, line: low + 1, column: offset - (starts[low] as number) + 1 };\n}\n\n/** A half-open range of offsets. */\nexport interface Range {\n  readonly start: number;\n  readonly end: number;\n}\n\n/** Sorts and merges ranges; touching ranges merge. Empty ranges vanish. */\nexport function mergeRanges(ranges: readonly Range[]): Range[] {\n  const sorted = ranges.filter((r) => r.end > r.start).sort((a, b) => a.start - b.start || a.end - b.end);\n  const out: { start: number; end: number }[] = [];\n  for (const range of sorted) {\n    const last = out[out.length - 1];\n    if (last !== undefined && range.start <= last.end) last.end = Math.max(last.end, range.end);\n    else out.push({ start: range.start, end: range.end });\n  }\n  return out;\n}\n\n/** Whether an offset lies in one of a list of merged, sorted ranges. */\nexport function inRanges(merged: readonly Range[], offset: number): boolean {\n  let low = 0;\n  let high = merged.length;\n  while (low < high) {\n    const mid = (low + high) >> 1;\n    const range = merged[mid] as Range;\n    if (offset < range.start) high = mid;\n    else if (offset >= range.end) low = mid + 1;\n    else return true;\n  }\n  return false;\n}\n\nconst NOT_A_TERMINATOR = /[^\\n\\r]/g;\n\n/**\n * Blanks the given ranges with spaces, keeping every other character and\n * every line terminator where it was.\n *\n * Offsets survive a mask, which is the point: something found at offset 400\n * of the masked text is at offset 400 of the original, on the same line. The\n * replacement walks UTF-16 code units, so a surrogate pair becomes two spaces\n * and every later offset still lands where it did.\n */\nexport function maskRanges(text: string, ranges: readonly Range[]): string {\n  const merged = mergeRanges(ranges);\n  if (merged.length === 0) return text;\n  let out = '';\n  let cursor = 0;\n  for (const range of merged) {\n    const start = Math.min(range.start, text.length);\n    const end = Math.min(range.end, text.length);\n    out += text.slice(cursor, start);\n    out += text.slice(start, end).replace(NOT_A_TERMINATOR, ' ');\n    cursor = end;\n  }\n  return out + text.slice(cursor);\n}\n\n/** A text without a leading byte-order mark. */\nexport function stripBom(text: string): string {\n  return text.charCodeAt(0) === 0xfeff ? text.slice(1) : text;\n}\n\n/** The terminator a text mostly uses; `\\n` when it has none or they tie. */\nexport function lineEnding(text: string): '\\n' | '\\r\\n' {\n  let crlf = 0;\n  let lf = 0;\n  for (let i = text.indexOf('\\n'); i >= 0; i = text.indexOf('\\n', i + 1)) {\n    if (i > 0 && text.charCodeAt(i - 1) === CR) crlf += 1;\n    else lf += 1;\n  }\n  return crlf > lf ? '\\r\\n' : '\\n';\n}\n\n/**\n * The lines of a text, without terminators. Unlike the line table, a final\n * terminator does produce a last, empty line, so that joining the lines with\n * the same terminator gives the text back byte for byte.\n */\nexport function splitLines(text: string): string[] {\n  return text.split(/\\r\\n|\\n|\\r/);\n}\n"]}

package/dist/yaml.d.ts

@@ -1,17 +1,25 @@
 /**
- * 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 type { ScannedDocument } from './markdown.js';
 export interface YamlEntry {
     /** Lower-cased key. Nested keys are flattened with a dot. */
     readonly key: string;
@@ -23,10 +31,34 @@ export interface YamlEntry {
     /** Offset of the first character of the value, for precise diagnostics. */
     readonly valueStart: number;
 }
+/** Something in the front matter that was not read, and where. */
+export interface FrontMatterProblem {
+    readonly message: string;
+    readonly start: number;
+    readonly end: number;
+    /**
+     * Whether it left something out: a value, a line or the whole block. A key
+     * written twice is a problem that leaves nothing out, since the last is read.
+     */
+    readonly unread: boolean;
+    /**
+     * The key, lower-cased, whose value or line was left out, when the line
+     * names one; `null` for a line that names none and for the whole block.
+     */
+    readonly key: string | null;
+}
+export interface FrontMatterReading {
+    readonly entries: readonly YamlEntry[];
+    readonly problems: readonly FrontMatterProblem[];
+}
+/** Reads a scanned document's front matter. */
+export declare function readEntries(scanned: ScannedDocument): FrontMatterReading;
 /**
- * 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.
  */