@descent-vtt/spec-graph 0.2.0

package/dist/select.js

@@ -0,0 +1,413 @@
+/**
+ * The selector language.
+ *
+ * Rules and users ask the graph the same kinds of question, so they use the same
+ * machinery. Every built-in diagnostic is a path query plus a message; anything
+ * a rule can find, `spec-graph query` can find too, which means a team can
+ * express a convention spec-graph never anticipated without writing a plugin.
+ *
+ * ```text
+ * item[openness=open] -delegates-to-> document[phase=retired]
+ * document[phase=active] -assumes,depends-on-> document[phase=retired]
+ * document =supersedes=> document[phase=active]
+ * item[state=obviated] <-assumes- *
+ * *[path^=docs/adr] -blocked-by-> item[openness=open]
+ * ```
+ *
+ * A query evaluates to **paths**, not endpoints. A rule that has the whole path
+ * can say "ADR-0004 line 31 delegates this to ADR-0002, which was retired in
+ * March" instead of naming two documents and leaving the reader to reconstruct
+ * the relationship.
+ */
+import { receptivityOf } from './lifecycle.js';
+import { documentOf } from './resolve.js';
+import { EDGE_KINDS } from './types.js';
+export class QueryError extends Error {
+    /** Offset into the query string where the problem starts. */
+    offset;
+    constructor(message, offset) {
+        super(message);
+        this.name = 'QueryError';
+        this.offset = offset;
+    }
+}
+/** Guards against a pathological query fanning out over a huge corpus. */
+export const DEFAULT_MATCH_LIMIT = 10_000;
+/* -------------------------------------------------------------------------- */
+/* Parsing                                                                    */
+/* -------------------------------------------------------------------------- */
+const NODE_KINDS = {
+    document: 'document',
+    documents: 'document',
+    doc: 'document',
+    docs: 'document',
+    item: 'item',
+    items: 'item',
+    node: null,
+    nodes: null,
+    any: null,
+    '*': null,
+};
+/** Compiles a selector string into a {@link QuerySpec}. */
+export function parseQuery(source) {
+    const parser = new Parser(source);
+    const start = parser.parseNodeMatcher();
+    const steps = [];
+    parser.skipSpace();
+    while (!parser.atEnd()) {
+        steps.push(parser.parseStep());
+        parser.skipSpace();
+    }
+    return { start, steps };
+}
+class Parser {
+    source;
+    position = 0;
+    constructor(source) {
+        this.source = source;
+    }
+    atEnd() {
+        return this.position >= this.source.length;
+    }
+    skipSpace() {
+        while (this.position < this.source.length && /\s/.test(this.source[this.position]))
+            this.position += 1;
+    }
+    parseNodeMatcher() {
+        this.skipSpace();
+        let kind = null;
+        const word = /^[A-Za-z]+|^\*/.exec(this.source.slice(this.position));
+        if (word) {
+            const text = word[0].toLowerCase();
+            if (!(text in NODE_KINDS)) {
+                throw new QueryError(`unknown node type "${word[0]}", expected one of: document, item, * (any)`, this.position);
+            }
+            kind = NODE_KINDS[text];
+            this.position += word[0].length;
+        }
+        else if (this.source[this.position] !== '[') {
+            throw new QueryError('expected a node type (document, item or *) or a [predicate]', this.position);
+        }
+        const predicates = [];
+        while (this.source[this.position] === '[')
+            predicates.push(this.parsePredicate());
+        return { kind, predicates };
+    }
+    parsePredicate() {
+        this.position += 1;
+        const keyMatch = /^[A-Za-z_][A-Za-z0-9_.:-]*/.exec(this.source.slice(this.position));
+        if (!keyMatch)
+            throw new QueryError('expected an attribute name after "["', this.position);
+        const key = keyMatch[0].toLowerCase();
+        this.position += keyMatch[0].length;
+        if (this.source[this.position] === ']') {
+            this.position += 1;
+            return { key, operator: 'exists', value: '' };
+        }
+        const operatorMatch = /^(!=|\^=|\$=|\*=|~=|=)/.exec(this.source.slice(this.position));
+        if (!operatorMatch) {
+            throw new QueryError(`expected an operator (=, !=, ^=, $=, *=, ~=) or "]" after "${key}"`, this.position);
+        }
+        const operator = operatorMatch[0];
+        this.position += operator.length;
+        const value = this.parseValue();
+        if (this.source[this.position] !== ']')
+            throw new QueryError('expected "]" to close the predicate', this.position);
+        this.position += 1;
+        return { key, operator, value };
+    }
+    parseValue() {
+        const quote = this.source[this.position];
+        if (quote === '"' || quote === "'") {
+            this.position += 1;
+            let out = '';
+            while (this.position < this.source.length && this.source[this.position] !== quote) {
+                if (this.source[this.position] === '\\')
+                    this.position += 1;
+                out += this.source[this.position] ?? '';
+                this.position += 1;
+            }
+            if (this.source[this.position] !== quote)
+                throw new QueryError('unterminated quoted value', this.position);
+            this.position += 1;
+            return out;
+        }
+        const match = /^[^\]\s]*/.exec(this.source.slice(this.position));
+        const value = (match?.[0] ?? '');
+        this.position += value.length;
+        return value;
+    }
+    parseStep() {
+        const rest = this.source.slice(this.position);
+        // The forward form is lazy because its terminator is two characters (`->`),
+        // which cannot be confused with the hyphen inside `delegates-to`. The
+        // backward terminator is a single `-`, so it must be greedy and backtrack:
+        // matching lazily would read `<-delegates-to-` as the relation `delegates`.
+        const forward = /^(-|=)([A-Za-z,*-]*?)(->|=>)/.exec(rest);
+        const backward = /^(<-|<=)([A-Za-z,*-]*)(-|=)(?=\s|$|[A-Za-z*[])/.exec(rest);
+        if (forward && (!backward || (forward.index ?? 0) <= (backward.index ?? 0))) {
+            const transitive = forward[1] === '=';
+            const closing = forward[3];
+            if ((closing === '=>') !== transitive) {
+                throw new QueryError('mismatched arrow: use -kind-> for one hop or =kind=> for transitive', this.position);
+            }
+            const kinds = this.parseKinds(forward[2], this.position + 1);
+            this.position += forward[0].length;
+            return { direction: 'out', kinds, transitive, node: this.parseNodeMatcher() };
+        }
+        if (backward) {
+            const transitive = backward[1] === '<=';
+            const closing = backward[3];
+            if ((closing === '=') !== transitive) {
+                throw new QueryError('mismatched arrow: use <-kind- for one hop or <=kind= for transitive', this.position);
+            }
+            const kinds = this.parseKinds(backward[2], this.position + 2);
+            this.position += backward[0].length;
+            return { direction: 'in', kinds, transitive, node: this.parseNodeMatcher() };
+        }
+        throw new QueryError('expected a relation step such as -delegates-to->, <-assumes- or =supersedes=>', this.position);
+    }
+    parseKinds(raw, offset) {
+        const trimmed = raw.trim();
+        if (trimmed.length === 0 || trimmed === '*')
+            return null;
+        const kinds = [];
+        for (const part of trimmed.split(',')) {
+            const name = part.trim().toLowerCase();
+            if (name.length === 0)
+                continue;
+            if (!EDGE_KINDS.includes(name)) {
+                throw new QueryError(`unknown relation "${name}", expected one of: ${EDGE_KINDS.join(', ')}`, offset);
+            }
+            kinds.push(name);
+        }
+        return kinds.length > 0 ? kinds : null;
+    }
+}
+/* -------------------------------------------------------------------------- */
+/* Attributes                                                                 */
+/* -------------------------------------------------------------------------- */
+/**
+ * The values a predicate key sees on a node.
+ *
+ * Multi-valued keys (`alias`, `section`) match when *any* value matches, which
+ * is what makes `[section=Open Questions]` read the way people expect.
+ */
+export function attributesOf(node, key, graph) {
+    switch (key) {
+        case 'id':
+            return [node.id];
+        case 'kind':
+            return [node.kind];
+        case 'title':
+            return [node.title];
+        case 'file':
+            return [node.at.file];
+        case 'line':
+            return [String(node.at.span.start.line)];
+        case 'document':
+            return [node.kind === 'item' ? node.document : node.id];
+        default:
+            break;
+    }
+    if (node.kind === 'document') {
+        switch (key) {
+            case 'path':
+                return [node.path];
+            case 'phase':
+                return [node.phase];
+            case 'status':
+                return node.rawStatus === null ? [] : [node.rawStatus];
+            case 'receptivity':
+                return [receptivityOf(node.phase)];
+            case 'alias':
+                return [...node.aliases];
+            default:
+                break;
+        }
+        if (key.startsWith('fm.')) {
+            const value = node.frontMatter[key.slice(3)];
+            if (value === undefined)
+                return [];
+            return typeof value === 'string' ? [value] : [...value];
+        }
+        return [];
+    }
+    // An item inherits its document's lifecycle. Without this, the two rules that
+    // matter most could not be written as queries at all, because the question
+    // they ask - "is the document holding this obligation still open?" - is about
+    // the owner, not the item.
+    if (key === 'phase' || key === 'receptivity' || key === 'status' || key === 'path' || key === 'alias') {
+        const owner = graph?.owningDocument(node.id);
+        if (owner)
+            return attributesOf(owner, key, graph);
+        return key === 'path' ? [node.at.file] : [];
+    }
+    switch (key) {
+        case 'state':
+        case 'disposition':
+            return [node.disposition];
+        case 'openness':
+            return [node.openness];
+        case 'section':
+            return [...node.section];
+        case 'text':
+            return [node.text];
+        case 'body':
+            return [node.body];
+        case 'evidence':
+            return [node.evidence.source];
+        case 'conflicted':
+            return [node.conflicts.length > 0 ? 'true' : 'false'];
+        default:
+            return [];
+    }
+}
+function testPredicate(node, predicate, graph) {
+    const values = attributesOf(node, predicate.key, graph);
+    const needle = predicate.value.toLowerCase();
+    if (predicate.operator === 'exists')
+        return values.some((value) => value.length > 0);
+    if (predicate.operator === '!=')
+        return !values.some((value) => value.toLowerCase() === needle);
+    return values.some((raw) => {
+        const value = raw.toLowerCase();
+        switch (predicate.operator) {
+            case '=':
+                return value === needle;
+            case '^=':
+                return value.startsWith(needle);
+            case '$=':
+                return value.endsWith(needle);
+            case '*=':
+                return value.includes(needle);
+            case '~=':
+                return safeRegExp(predicate.value).test(raw);
+            default:
+                return false;
+        }
+    });
+}
+const regexCache = new Map();
+function safeRegExp(source) {
+    const cached = regexCache.get(source);
+    if (cached)
+        return cached;
+    let expression;
+    try {
+        expression = new RegExp(source, 'i');
+    }
+    catch {
+        // An invalid pattern matches nothing rather than crashing a whole run.
+        expression = /(?!)/;
+    }
+    regexCache.set(source, expression);
+    return expression;
+}
+/** True when a node satisfies a matcher. */
+export function matches(node, matcher, graph) {
+    if (matcher.kind !== null && node.kind !== matcher.kind)
+        return false;
+    return matcher.predicates.every((predicate) => testPredicate(node, predicate, graph));
+}
+/** Runs a compiled query and returns every matching path. */
+export function execute(graph, spec, options = {}) {
+    const limit = options.limit ?? DEFAULT_MATCH_LIMIT;
+    const allowReflexive = options.allowReflexive ?? false;
+    let frontier = [];
+    for (const node of graph.nodes.values()) {
+        if (matches(node, spec.start, graph))
+            frontier.push({ nodes: [node], edges: [] });
+    }
+    for (const step of spec.steps) {
+        const next = [];
+        const seen = new Set();
+        for (const match of frontier) {
+            const tail = match.nodes[match.nodes.length - 1];
+            for (const { node, path } of expand(graph, tail, step, allowReflexive)) {
+                if (!matches(node, step.node, graph))
+                    continue;
+                const key = `${match.nodes.map((n) => n.id).join('>')}>${node.id}`;
+                if (seen.has(key))
+                    continue;
+                seen.add(key);
+                next.push({ nodes: [...match.nodes, node], edges: [...match.edges, ...path] });
+                if (next.length >= limit)
+                    break;
+            }
+            if (next.length >= limit)
+                break;
+        }
+        frontier = next;
+        if (frontier.length === 0)
+            break;
+    }
+    return frontier;
+}
+function expand(graph, from, step, allowReflexive) {
+    const kinds = step.kinds ?? [];
+    const out = [];
+    if (!step.transitive) {
+        const edges = step.direction === 'out' ? graph.out(from.id, kinds) : graph.in(from.id, kinds);
+        for (const edge of edges) {
+            if (!allowReflexive && edge.reflexive)
+                continue;
+            const targetId = step.direction === 'out' ? edge.to : edge.from;
+            const node = graph.node(targetId);
+            if (node)
+                out.push({ node, path: [edge] });
+        }
+        return out;
+    }
+    // Transitive steps take the shortest path to each reachable node, which keeps
+    // the result deterministic and the reported evidence minimal.
+    const reached = step.direction === 'out'
+        ? graph.reach(from.id, kinds)
+        : reachIncoming(graph, from.id, kinds);
+    for (const [id, path] of reached) {
+        if (!allowReflexive && path.every((edge) => edge.reflexive))
+            continue;
+        const node = graph.node(id);
+        if (node)
+            out.push({ node, path });
+    }
+    return out;
+}
+function reachIncoming(graph, id, kinds) {
+    const paths = new Map();
+    const pathTo = new Map([[id, []]]);
+    const queue = [id];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const prefix = pathTo.get(current);
+        for (const edge of graph.in(current, kinds)) {
+            if (pathTo.has(edge.from) && edge.from !== id)
+                continue;
+            const path = [...prefix, edge];
+            if (edge.from === id) {
+                if (!paths.has(id))
+                    paths.set(id, path);
+                continue;
+            }
+            pathTo.set(edge.from, path);
+            paths.set(edge.from, path);
+            queue.push(edge.from);
+        }
+    }
+    return paths;
+}
+/** Parses and runs a selector in one call. */
+export function query(graph, selector, options) {
+    return execute(graph, parseQuery(selector), options);
+}
+/** Renders a match as `A -kind-> B`, for reports and for `--explain`. */
+export function renderMatch(match) {
+    const parts = [match.nodes[0]?.id ?? ''];
+    for (let i = 0; i < match.edges.length; i += 1) {
+        const edge = match.edges[i];
+        const node = match.nodes[i + 1];
+        parts.push(`-${edge.kind}->`, node?.id ?? documentOf(edge.to));
+    }
+    return parts.join(' ');
+}
+//# sourceMappingURL=select.js.map

package/dist/select.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"select.js","sourceRoot":"","sources":["../src/select.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,OAAO,EAAE,UAAU,EAA0D,MAAM,YAAY,CAAC;AAwChG,MAAM,OAAO,UAAW,SAAQ,KAAK;IACnC,6DAA6D;IACpD,MAAM,CAAS;IAExB,YAAY,OAAe,EAAE,MAAc;QACzC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,0EAA0E;AAC1E,MAAM,CAAC,MAAM,mBAAmB,GAAG,MAAM,CAAC;AAE1C,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,MAAM,UAAU,GAA8C;IAC5D,QAAQ,EAAE,UAAU;IACpB,SAAS,EAAE,UAAU;IACrB,GAAG,EAAE,UAAU;IACf,IAAI,EAAE,UAAU;IAChB,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,IAAI;IACV,KAAK,EAAE,IAAI;IACX,GAAG,EAAE,IAAI;IACT,GAAG,EAAE,IAAI;CACV,CAAC;AAEF,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CAAC,MAAc;IACvC,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;IACxC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,MAAM;IACO,MAAM,CAAS;IACxB,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAW,CAAC;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;IACnH,CAAC;IAED,gBAAgB;QACd,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,IAAI,GAAoB,IAAI,CAAC;QACjC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrE,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,IAAI,GAAI,IAAI,CAAC,CAAC,CAAY,CAAC,WAAW,EAAE,CAAC;YAC/C,IAAI,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,UAAU,CAClB,sBAAsB,IAAI,CAAC,CAAC,CAAC,6CAA6C,EAC1E,IAAI,CAAC,QAAQ,CACd,CAAC;YACJ,CAAC;YACD,IAAI,GAAG,UAAU,CAAC,IAAI,CAAoB,CAAC;YAC3C,IAAI,CAAC,QAAQ,IAAK,IAAI,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;QAC9C,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,EAAE,CAAC;YAC9C,MAAM,IAAI,UAAU,CAAC,6DAA6D,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrG,CAAC;QAED,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;QAClF,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IAC9B,CAAC;IAEO,cAAc;QACpB,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,QAAQ,GAAG,4BAA4B,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3F,MAAM,GAAG,GAAI,QAAQ,CAAC,CAAC,CAAY,CAAC,WAAW,EAAE,CAAC;QAClD,IAAI,CAAC,QAAQ,IAAK,QAAQ,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;QAEhD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,EAAE,CAAC;YACvC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAChD,CAAC;QAED,MAAM,aAAa,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtF,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,MAAM,IAAI,UAAU,CAClB,8DAA8D,GAAG,GAAG,EACpE,IAAI,CAAC,QAAQ,CACd,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAa,CAAC;QAC9C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC;QAEjC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,qCAAqC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnH,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAClC,CAAC;IAEO,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;YACnC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,IAAI,GAAG,GAAG,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;gBAClF,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI;oBAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBAC5D,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACxC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,KAAK;gBAAE,MAAM,IAAI,UAAU,CAAC,2BAA2B,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3G,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,GAAG,CAAC;QACb,CAAC;QACD,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjE,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAW,CAAC;QAC3C,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS;QACP,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,4EAA4E;QAC5E,sEAAsE;QACtE,2EAA2E;QAC3E,4EAA4E;QAC5E,MAAM,OAAO,GAAG,8BAA8B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1D,MAAM,QAAQ,GAAG,gDAAgD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7E,IAAI,OAAO,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5E,MAAM,UAAU,GAAI,OAAO,CAAC,CAAC,CAAY,KAAK,GAAG,CAAC;YAClD,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;YACrC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;gBACtC,MAAM,IAAI,UAAU,CAAC,qEAAqE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7G,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAW,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,QAAQ,IAAK,OAAO,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;YAC/C,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,gBAAgB,EAAE,EAAE,CAAC;QAChF,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,UAAU,GAAI,QAAQ,CAAC,CAAC,CAAY,KAAK,IAAI,CAAC;YACpD,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;YACtC,IAAI,CAAC,OAAO,KAAK,GAAG,CAAC,KAAK,UAAU,EAAE,CAAC;gBACrC,MAAM,IAAI,UAAU,CAAC,qEAAqE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7G,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAW,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,QAAQ,IAAK,QAAQ,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;YAChD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,gBAAgB,EAAE,EAAE,CAAC;QAC/E,CAAC;QAED,MAAM,IAAI,UAAU,CAClB,+EAA+E,EAC/E,IAAI,CAAC,QAAQ,CACd,CAAC;IACJ,CAAC;IAEO,UAAU,CAAC,GAAW,EAAE,MAAc;QAC5C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QACzD,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAE,UAAgC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtD,MAAM,IAAI,UAAU,CAAC,qBAAqB,IAAI,uBAAuB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACxG,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAgB,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;CACF;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc,EAAE,GAAW,EAAE,KAAiB;IACzE,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,IAAI;YACP,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACxB,KAAK,MAAM;YACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,KAAK,UAAU;YACb,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1D;YACE,MAAM;IACV,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,QAAQ,GAAG,EAAE,CAAC;YACZ,KAAK,MAAM;gBACT,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,OAAO;gBACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzD,KAAK,aAAa;gBAChB,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,KAAK,OAAO;gBACV,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B;gBACE,MAAM;QACV,CAAC;QACD,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,EAAE,CAAC;YACnC,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,8EAA8E;IAC9E,2EAA2E;IAC3E,8EAA8E;IAC9E,2BAA2B;IAC3B,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,aAAa,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;QACtG,MAAM,KAAK,GAAG,KAAK,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,KAAK;YAAE,OAAO,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAClD,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9C,CAAC;IAED,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,OAAO,CAAC;QACb,KAAK,aAAa;YAChB,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5B,KAAK,UAAU;YACb,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,KAAK,SAAS;YACZ,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,UAAU;YACb,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChC,KAAK,YAAY;YACf,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACxD;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAc,EAAE,SAAoB,EAAE,KAAiB;IAC5E,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;IAE7C,IAAI,SAAS,CAAC,QAAQ,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrF,IAAI,SAAS,CAAC,QAAQ,KAAK,IAAI;QAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC;IAEhG,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;QACzB,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,GAAG;gBACN,OAAO,KAAK,KAAK,MAAM,CAAC;YAC1B,KAAK,IAAI;gBACP,OAAO,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAClC,KAAK,IAAI;gBACP,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChC,KAAK,IAAI;gBACP,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChC,KAAK,IAAI;gBACP,OAAO,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C;gBACE,OAAO,KAAK,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;AAE7C,SAAS,UAAU,CAAC,MAAc;IAChC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,IAAI,UAAkB,CAAC;IACvB,IAAI,CAAC;QACH,UAAU,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC;IAAC,MAAM,CAAC;QACP,uEAAuE;QACvE,UAAU,GAAG,MAAM,CAAC;IACtB,CAAC;IACD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACnC,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,OAAO,CAAC,IAAc,EAAE,OAAoB,EAAE,KAAiB;IAC7E,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACtE,OAAO,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;AACxF,CAAC;AA4BD,6DAA6D;AAC7D,MAAM,UAAU,OAAO,CAAC,KAAgB,EAAE,IAAe,EAAE,OAAO,GAAmB,EAAE;IACrF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,mBAAmB,CAAC;IACnD,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,KAAK,CAAC;IAEvD,IAAI,QAAQ,GAAY,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACpF,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAY,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAa,CAAC;YAC7D,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,cAAc,CAAC,EAAE,CAAC;gBACvE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;oBAAE,SAAS;gBAC/C,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBACnE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/E,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;oBAAE,MAAM;YAClC,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QAClC,CAAC;QAED,QAAQ,GAAG,IAAI,CAAC;QAChB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;IACnC,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAOD,SAAS,MAAM,CAAC,KAAgB,EAAE,IAAc,EAAE,IAAc,EAAE,cAAuB;IACvF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9F,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,SAAS;gBAAE,SAAS;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAChE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8EAA8E;IAC9E,8DAA8D;IAC9D,MAAM,OAAO,GACX,IAAI,CAAC,SAAS,KAAK,KAAK;QACtB,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC;QAC7B,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAE3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACjC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,SAAS;QACtE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,aAAa,CAAC,KAAgB,EAAE,EAAU,EAAE,KAA0B;IAC7E,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,CAA0B,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAa,CAAC,EAAE,CAAC,CAAC;IAE7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QACxC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAoB,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;YAC5C,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE;gBAAE,SAAS;YACxD,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE,CAAC;gBACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBACxC,SAAS;YACX,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,KAAK,CAAC,KAAgB,EAAE,QAAgB,EAAE,OAAwB;IAChF,OAAO,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,CAAC;AACvD,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,WAAW,CAAC,KAAY;IACtC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAS,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC","sourcesContent":["/**\n * The selector language.\n *\n * Rules and users ask the graph the same kinds of question, so they use the same\n * machinery. Every built-in diagnostic is a path query plus a message; anything\n * a rule can find, `spec-graph query` can find too, which means a team can\n * express a convention spec-graph never anticipated without writing a plugin.\n *\n * ```text\n * item[openness=open] -delegates-to-> document[phase=retired]\n * document[phase=active] -assumes,depends-on-> document[phase=retired]\n * document =supersedes=> document[phase=active]\n * item[state=obviated] <-assumes- *\n * *[path^=docs/adr] -blocked-by-> item[openness=open]\n * ```\n *\n * A query evaluates to **paths**, not endpoints. A rule that has the whole path\n * can say \"ADR-0004 line 31 delegates this to ADR-0002, which was retired in\n * March\" instead of naming two documents and leaving the reader to reconstruct\n * the relationship.\n */\n\nimport { receptivityOf } from './lifecycle.js';\nimport { documentOf } from './resolve.js';\nimport type { SpecGraph } from './graph.js';\nimport { EDGE_KINDS, type Edge, type EdgeKind, type NodeKind, type SpecNode } from './types.js';\n\n/* -------------------------------------------------------------------------- */\n/* Shapes                                                                     */\n/* -------------------------------------------------------------------------- */\n\nexport type Operator = '=' | '!=' | '^=' | '$=' | '*=' | '~=' | 'exists';\n\nexport interface Predicate {\n  readonly key: string;\n  readonly operator: Operator;\n  readonly value: string;\n}\n\nexport interface NodeMatcher {\n  /** `null` matches both documents and items. */\n  readonly kind: NodeKind | null;\n  readonly predicates: readonly Predicate[];\n}\n\nexport interface StepSpec {\n  readonly direction: 'out' | 'in';\n  /** `null` matches any edge kind. */\n  readonly kinds: readonly EdgeKind[] | null;\n  /** Follow the relation transitively, taking the shortest path to each node. */\n  readonly transitive: boolean;\n  readonly node: NodeMatcher;\n}\n\nexport interface QuerySpec {\n  readonly start: NodeMatcher;\n  readonly steps: readonly StepSpec[];\n}\n\n/** One path through the graph. `edges` always has one fewer entry than `nodes`. */\nexport interface Match {\n  readonly nodes: readonly SpecNode[];\n  readonly edges: readonly Edge[];\n}\n\nexport class QueryError extends Error {\n  /** Offset into the query string where the problem starts. */\n  readonly offset: number;\n\n  constructor(message: string, offset: number) {\n    super(message);\n    this.name = 'QueryError';\n    this.offset = offset;\n  }\n}\n\n/** Guards against a pathological query fanning out over a huge corpus. */\nexport const DEFAULT_MATCH_LIMIT = 10_000;\n\n/* -------------------------------------------------------------------------- */\n/* Parsing                                                                    */\n/* -------------------------------------------------------------------------- */\n\nconst NODE_KINDS: Readonly<Record<string, NodeKind | null>> = {\n  document: 'document',\n  documents: 'document',\n  doc: 'document',\n  docs: 'document',\n  item: 'item',\n  items: 'item',\n  node: null,\n  nodes: null,\n  any: null,\n  '*': null,\n};\n\n/** Compiles a selector string into a {@link QuerySpec}. */\nexport function parseQuery(source: string): QuerySpec {\n  const parser = new Parser(source);\n  const start = parser.parseNodeMatcher();\n  const steps: StepSpec[] = [];\n  parser.skipSpace();\n  while (!parser.atEnd()) {\n    steps.push(parser.parseStep());\n    parser.skipSpace();\n  }\n  return { start, steps };\n}\n\nclass Parser {\n  private readonly source: string;\n  private position = 0;\n\n  constructor(source: string) {\n    this.source = source;\n  }\n\n  atEnd(): boolean {\n    return this.position >= this.source.length;\n  }\n\n  skipSpace(): void {\n    while (this.position < this.source.length && /\\s/.test(this.source[this.position] as string)) this.position += 1;\n  }\n\n  parseNodeMatcher(): NodeMatcher {\n    this.skipSpace();\n    let kind: NodeKind | null = null;\n    const word = /^[A-Za-z]+|^\\*/.exec(this.source.slice(this.position));\n    if (word) {\n      const text = (word[0] as string).toLowerCase();\n      if (!(text in NODE_KINDS)) {\n        throw new QueryError(\n          `unknown node type \"${word[0]}\", expected one of: document, item, * (any)`,\n          this.position,\n        );\n      }\n      kind = NODE_KINDS[text] as NodeKind | null;\n      this.position += (word[0] as string).length;\n    } else if (this.source[this.position] !== '[') {\n      throw new QueryError('expected a node type (document, item or *) or a [predicate]', this.position);\n    }\n\n    const predicates: Predicate[] = [];\n    while (this.source[this.position] === '[') predicates.push(this.parsePredicate());\n    return { kind, predicates };\n  }\n\n  private parsePredicate(): Predicate {\n    this.position += 1;\n    const keyMatch = /^[A-Za-z_][A-Za-z0-9_.:-]*/.exec(this.source.slice(this.position));\n    if (!keyMatch) throw new QueryError('expected an attribute name after \"[\"', this.position);\n    const key = (keyMatch[0] as string).toLowerCase();\n    this.position += (keyMatch[0] as string).length;\n\n    if (this.source[this.position] === ']') {\n      this.position += 1;\n      return { key, operator: 'exists', value: '' };\n    }\n\n    const operatorMatch = /^(!=|\\^=|\\$=|\\*=|~=|=)/.exec(this.source.slice(this.position));\n    if (!operatorMatch) {\n      throw new QueryError(\n        `expected an operator (=, !=, ^=, $=, *=, ~=) or \"]\" after \"${key}\"`,\n        this.position,\n      );\n    }\n    const operator = operatorMatch[0] as Operator;\n    this.position += operator.length;\n\n    const value = this.parseValue();\n    if (this.source[this.position] !== ']') throw new QueryError('expected \"]\" to close the predicate', this.position);\n    this.position += 1;\n    return { key, operator, value };\n  }\n\n  private parseValue(): string {\n    const quote = this.source[this.position];\n    if (quote === '\"' || quote === \"'\") {\n      this.position += 1;\n      let out = '';\n      while (this.position < this.source.length && this.source[this.position] !== quote) {\n        if (this.source[this.position] === '\\\\') this.position += 1;\n        out += this.source[this.position] ?? '';\n        this.position += 1;\n      }\n      if (this.source[this.position] !== quote) throw new QueryError('unterminated quoted value', this.position);\n      this.position += 1;\n      return out;\n    }\n    const match = /^[^\\]\\s]*/.exec(this.source.slice(this.position));\n    const value = (match?.[0] ?? '') as string;\n    this.position += value.length;\n    return value;\n  }\n\n  parseStep(): StepSpec {\n    const rest = this.source.slice(this.position);\n    // The forward form is lazy because its terminator is two characters (`->`),\n    // which cannot be confused with the hyphen inside `delegates-to`. The\n    // backward terminator is a single `-`, so it must be greedy and backtrack:\n    // matching lazily would read `<-delegates-to-` as the relation `delegates`.\n    const forward = /^(-|=)([A-Za-z,*-]*?)(->|=>)/.exec(rest);\n    const backward = /^(<-|<=)([A-Za-z,*-]*)(-|=)(?=\\s|$|[A-Za-z*[])/.exec(rest);\n\n    if (forward && (!backward || (forward.index ?? 0) <= (backward.index ?? 0))) {\n      const transitive = (forward[1] as string) === '=';\n      const closing = forward[3] as string;\n      if ((closing === '=>') !== transitive) {\n        throw new QueryError('mismatched arrow: use -kind-> for one hop or =kind=> for transitive', this.position);\n      }\n      const kinds = this.parseKinds(forward[2] as string, this.position + 1);\n      this.position += (forward[0] as string).length;\n      return { direction: 'out', kinds, transitive, node: this.parseNodeMatcher() };\n    }\n\n    if (backward) {\n      const transitive = (backward[1] as string) === '<=';\n      const closing = backward[3] as string;\n      if ((closing === '=') !== transitive) {\n        throw new QueryError('mismatched arrow: use <-kind- for one hop or <=kind= for transitive', this.position);\n      }\n      const kinds = this.parseKinds(backward[2] as string, this.position + 2);\n      this.position += (backward[0] as string).length;\n      return { direction: 'in', kinds, transitive, node: this.parseNodeMatcher() };\n    }\n\n    throw new QueryError(\n      'expected a relation step such as -delegates-to->, <-assumes- or =supersedes=>',\n      this.position,\n    );\n  }\n\n  private parseKinds(raw: string, offset: number): readonly EdgeKind[] | null {\n    const trimmed = raw.trim();\n    if (trimmed.length === 0 || trimmed === '*') return null;\n    const kinds: EdgeKind[] = [];\n    for (const part of trimmed.split(',')) {\n      const name = part.trim().toLowerCase();\n      if (name.length === 0) continue;\n      if (!(EDGE_KINDS as readonly string[]).includes(name)) {\n        throw new QueryError(`unknown relation \"${name}\", expected one of: ${EDGE_KINDS.join(', ')}`, offset);\n      }\n      kinds.push(name as EdgeKind);\n    }\n    return kinds.length > 0 ? kinds : null;\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Attributes                                                                 */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The values a predicate key sees on a node.\n *\n * Multi-valued keys (`alias`, `section`) match when *any* value matches, which\n * is what makes `[section=Open Questions]` read the way people expect.\n */\nexport function attributesOf(node: SpecNode, key: string, graph?: SpecGraph): string[] {\n  switch (key) {\n    case 'id':\n      return [node.id];\n    case 'kind':\n      return [node.kind];\n    case 'title':\n      return [node.title];\n    case 'file':\n      return [node.at.file];\n    case 'line':\n      return [String(node.at.span.start.line)];\n    case 'document':\n      return [node.kind === 'item' ? node.document : node.id];\n    default:\n      break;\n  }\n\n  if (node.kind === 'document') {\n    switch (key) {\n      case 'path':\n        return [node.path];\n      case 'phase':\n        return [node.phase];\n      case 'status':\n        return node.rawStatus === null ? [] : [node.rawStatus];\n      case 'receptivity':\n        return [receptivityOf(node.phase)];\n      case 'alias':\n        return [...node.aliases];\n      default:\n        break;\n    }\n    if (key.startsWith('fm.')) {\n      const value = node.frontMatter[key.slice(3)];\n      if (value === undefined) return [];\n      return typeof value === 'string' ? [value] : [...value];\n    }\n    return [];\n  }\n\n  // An item inherits its document's lifecycle. Without this, the two rules that\n  // matter most could not be written as queries at all, because the question\n  // they ask - \"is the document holding this obligation still open?\" - is about\n  // the owner, not the item.\n  if (key === 'phase' || key === 'receptivity' || key === 'status' || key === 'path' || key === 'alias') {\n    const owner = graph?.owningDocument(node.id);\n    if (owner) return attributesOf(owner, key, graph);\n    return key === 'path' ? [node.at.file] : [];\n  }\n\n  switch (key) {\n    case 'state':\n    case 'disposition':\n      return [node.disposition];\n    case 'openness':\n      return [node.openness];\n    case 'section':\n      return [...node.section];\n    case 'text':\n      return [node.text];\n    case 'body':\n      return [node.body];\n    case 'evidence':\n      return [node.evidence.source];\n    case 'conflicted':\n      return [node.conflicts.length > 0 ? 'true' : 'false'];\n    default:\n      return [];\n  }\n}\n\nfunction testPredicate(node: SpecNode, predicate: Predicate, graph?: SpecGraph): boolean {\n  const values = attributesOf(node, predicate.key, graph);\n  const needle = predicate.value.toLowerCase();\n\n  if (predicate.operator === 'exists') return values.some((value) => value.length > 0);\n  if (predicate.operator === '!=') return !values.some((value) => value.toLowerCase() === needle);\n\n  return values.some((raw) => {\n    const value = raw.toLowerCase();\n    switch (predicate.operator) {\n      case '=':\n        return value === needle;\n      case '^=':\n        return value.startsWith(needle);\n      case '$=':\n        return value.endsWith(needle);\n      case '*=':\n        return value.includes(needle);\n      case '~=':\n        return safeRegExp(predicate.value).test(raw);\n      default:\n        return false;\n    }\n  });\n}\n\nconst regexCache = new Map<string, RegExp>();\n\nfunction safeRegExp(source: string): RegExp {\n  const cached = regexCache.get(source);\n  if (cached) return cached;\n  let expression: RegExp;\n  try {\n    expression = new RegExp(source, 'i');\n  } catch {\n    // An invalid pattern matches nothing rather than crashing a whole run.\n    expression = /(?!)/;\n  }\n  regexCache.set(source, expression);\n  return expression;\n}\n\n/** True when a node satisfies a matcher. */\nexport function matches(node: SpecNode, matcher: NodeMatcher, graph?: SpecGraph): boolean {\n  if (matcher.kind !== null && node.kind !== matcher.kind) return false;\n  return matcher.predicates.every((predicate) => testPredicate(node, predicate, graph));\n}\n\n/* -------------------------------------------------------------------------- */\n/* Execution                                                                  */\n/* -------------------------------------------------------------------------- */\n\nexport interface ExecuteOptions {\n  /**\n   * Cap on the paths produced by each traversal step.\n   *\n   * It bounds *expansion*, not the initial selection: a query with no steps\n   * returns every matching node. That asymmetry is deliberate. The limit exists\n   * so a query across a dense graph cannot fan out unboundedly, and the rules\n   * run through this engine - truncating the set of nodes a rule starts from\n   * would silently drop findings, whereas truncating a runaway expansion only\n   * ever drops paths that were already beyond reading.\n   */\n  readonly limit?: number | undefined;\n  /**\n   * Whether a step may stay inside one document.\n   *\n   * Off by default for reflexive edges: a document that links to itself is a\n   * formatting quirk, not a relationship, and letting those through turns every\n   * table of contents into a finding.\n   */\n  readonly allowReflexive?: boolean | undefined;\n}\n\n/** Runs a compiled query and returns every matching path. */\nexport function execute(graph: SpecGraph, spec: QuerySpec, options: ExecuteOptions = {}): Match[] {\n  const limit = options.limit ?? DEFAULT_MATCH_LIMIT;\n  const allowReflexive = options.allowReflexive ?? false;\n\n  let frontier: Match[] = [];\n  for (const node of graph.nodes.values()) {\n    if (matches(node, spec.start, graph)) frontier.push({ nodes: [node], edges: [] });\n  }\n\n  for (const step of spec.steps) {\n    const next: Match[] = [];\n    const seen = new Set<string>();\n\n    for (const match of frontier) {\n      const tail = match.nodes[match.nodes.length - 1] as SpecNode;\n      for (const { node, path } of expand(graph, tail, step, allowReflexive)) {\n        if (!matches(node, step.node, graph)) continue;\n        const key = `${match.nodes.map((n) => n.id).join('>')}>${node.id}`;\n        if (seen.has(key)) continue;\n        seen.add(key);\n        next.push({ nodes: [...match.nodes, node], edges: [...match.edges, ...path] });\n        if (next.length >= limit) break;\n      }\n      if (next.length >= limit) break;\n    }\n\n    frontier = next;\n    if (frontier.length === 0) break;\n  }\n\n  return frontier;\n}\n\ninterface Expansion {\n  readonly node: SpecNode;\n  readonly path: readonly Edge[];\n}\n\nfunction expand(graph: SpecGraph, from: SpecNode, step: StepSpec, allowReflexive: boolean): Expansion[] {\n  const kinds = step.kinds ?? [];\n  const out: Expansion[] = [];\n\n  if (!step.transitive) {\n    const edges = step.direction === 'out' ? graph.out(from.id, kinds) : graph.in(from.id, kinds);\n    for (const edge of edges) {\n      if (!allowReflexive && edge.reflexive) continue;\n      const targetId = step.direction === 'out' ? edge.to : edge.from;\n      const node = graph.node(targetId);\n      if (node) out.push({ node, path: [edge] });\n    }\n    return out;\n  }\n\n  // Transitive steps take the shortest path to each reachable node, which keeps\n  // the result deterministic and the reported evidence minimal.\n  const reached =\n    step.direction === 'out'\n      ? graph.reach(from.id, kinds)\n      : reachIncoming(graph, from.id, kinds);\n\n  for (const [id, path] of reached) {\n    if (!allowReflexive && path.every((edge) => edge.reflexive)) continue;\n    const node = graph.node(id);\n    if (node) out.push({ node, path });\n  }\n  return out;\n}\n\nfunction reachIncoming(graph: SpecGraph, id: string, kinds: readonly EdgeKind[]): Map<string, readonly Edge[]> {\n  const paths = new Map<string, readonly Edge[]>();\n  const pathTo = new Map<string, readonly Edge[]>([[id, []]]);\n  const queue: string[] = [id];\n\n  while (queue.length > 0) {\n    const current = queue.shift() as string;\n    const prefix = pathTo.get(current) as readonly Edge[];\n    for (const edge of graph.in(current, kinds)) {\n      if (pathTo.has(edge.from) && edge.from !== id) continue;\n      const path = [...prefix, edge];\n      if (edge.from === id) {\n        if (!paths.has(id)) paths.set(id, path);\n        continue;\n      }\n      pathTo.set(edge.from, path);\n      paths.set(edge.from, path);\n      queue.push(edge.from);\n    }\n  }\n  return paths;\n}\n\n/** Parses and runs a selector in one call. */\nexport function query(graph: SpecGraph, selector: string, options?: ExecuteOptions): Match[] {\n  return execute(graph, parseQuery(selector), options);\n}\n\n/** Renders a match as `A -kind-> B`, for reports and for `--explain`. */\nexport function renderMatch(match: Match): string {\n  const parts: string[] = [match.nodes[0]?.id ?? ''];\n  for (let i = 0; i < match.edges.length; i += 1) {\n    const edge = match.edges[i] as Edge;\n    const node = match.nodes[i + 1];\n    parts.push(`-${edge.kind}->`, node?.id ?? documentOf(edge.to));\n  }\n  return parts.join(' ');\n}\n"]}

package/dist/source.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Offset arithmetic.
+ *
+ * Every finding spec-graph reports points at a line and a column, and every
+ * intermediate structure carries raw offsets instead of copies of the text.
+ * Converting between the two is therefore on the hot path, so the line table is
+ * built once per file and searched with a binary search rather than by counting
+ * newlines from the start each time.
+ */
+import type { Position, SourceRef, Span } from './types.js';
+export interface LineIndex {
+    /** Number of lines. A file ending in a newline does not gain a trailing line. */
+    readonly lineCount: number;
+    /** Offset at which the given 1-based line starts. */
+    lineStart(line: number): number;
+    /** Offset just past the given 1-based line, excluding its terminator. */
+    lineEnd(line: number): number;
+    /** Text of the given 1-based line, without its terminator. */
+    lineText(line: number): string;
+    /** Convert an absolute offset to a `{ line, column }` position. */
+    positionAt(offset: number): Position;
+}
+/**
+ * Builds the line table for `text`.
+ *
+ * Recognises all three line terminators. `\r\n` counts once: a Windows checkout
+ * of a spec must produce the same line numbers as a POSIX one, or half the
+ * team gets diagnostics pointing at the wrong place.
+ */
+export declare function createLineIndex(text: string): LineIndex;
+/** Builds a {@link Span} from two offsets. */
+export declare function spanOf(index: LineIndex, start: number, end: number): Span;
+/** Builds a {@link SourceRef} from two offsets. */
+export declare function refOf(file: string, index: LineIndex, start: number, end: number): SourceRef;
+/** `path:line:column`, the form every editor and terminal knows how to open. */
+export declare function formatRef(ref: SourceRef): string;
+/**
+ * Sort key for deterministic report ordering.
+ *
+ * CI output that reorders between runs is output nobody diffs, so ordering is
+ * total: file, then line, then column, then length.
+ */
+export declare function compareRefs(a: SourceRef, b: SourceRef): number;

package/dist/source.js

@@ -0,0 +1,109 @@
+/**
+ * Offset arithmetic.
+ *
+ * Every finding spec-graph reports points at a line and a column, and every
+ * intermediate structure carries raw offsets instead of copies of the text.
+ * Converting between the two is therefore on the hot path, so the line table is
+ * built once per file and searched with a binary search rather than by counting
+ * newlines from the start each time.
+ */
+/**
+ * Builds the line table for `text`.
+ *
+ * Recognises all three line terminators. `\r\n` counts once: a Windows checkout
+ * of a spec must produce the same line numbers as a POSIX one, or half the
+ * team gets diagnostics pointing at the wrong place.
+ */
+export function createLineIndex(text) {
+    const starts = [0];
+    for (let i = 0; i < text.length; i += 1) {
+        const ch = text.charCodeAt(i);
+        if (ch === 10 /* \n */) {
+            starts.push(i + 1);
+        }
+        else if (ch === 13 /* \r */) {
+            if (text.charCodeAt(i + 1) === 10)
+                i += 1;
+            starts.push(i + 1);
+        }
+    }
+    // A terminator at the very end opens a line that contains nothing. Drop it so
+    // `lineCount` matches what an editor shows.
+    if (starts.length > 1 && starts[starts.length - 1] === text.length)
+        starts.pop();
+    const lineCount = starts.length;
+    const startOf = (line) => {
+        const clamped = line < 1 ? 1 : line > lineCount ? lineCount : line;
+        return starts[clamped - 1];
+    };
+    const endOf = (line) => {
+        const clamped = line < 1 ? 1 : line > lineCount ? lineCount : line;
+        if (clamped === lineCount) {
+            let end = text.length;
+            while (end > starts[clamped - 1]) {
+                const ch = text.charCodeAt(end - 1);
+                if (ch === 10 || ch === 13)
+                    end -= 1;
+                else
+                    break;
+            }
+            return end;
+        }
+        let end = starts[clamped];
+        while (end > starts[clamped - 1]) {
+            const ch = text.charCodeAt(end - 1);
+            if (ch === 10 || ch === 13)
+                end -= 1;
+            else
+                break;
+        }
+        return end;
+    };
+    return {
+        lineCount,
+        lineStart: startOf,
+        lineEnd: endOf,
+        lineText: (line) => text.slice(startOf(line), endOf(line)),
+        positionAt(offset) {
+            const clamped = offset < 0 ? 0 : offset > text.length ? text.length : offset;
+            let lo = 0;
+            let hi = starts.length - 1;
+            while (lo < hi) {
+                const mid = (lo + hi + 1) >> 1;
+                if (starts[mid] <= clamped)
+                    lo = mid;
+                else
+                    hi = mid - 1;
+            }
+            return { offset: clamped, line: lo + 1, column: clamped - starts[lo] + 1 };
+        },
+    };
+}
+/** Builds a {@link Span} from two offsets. */
+export function spanOf(index, start, end) {
+    return { start: index.positionAt(start), end: index.positionAt(end) };
+}
+/** Builds a {@link SourceRef} from two offsets. */
+export function refOf(file, index, start, end) {
+    return { file, span: spanOf(index, start, end) };
+}
+/** `path:line:column`, the form every editor and terminal knows how to open. */
+export function formatRef(ref) {
+    return `${ref.file}:${ref.span.start.line}:${ref.span.start.column}`;
+}
+/**
+ * Sort key for deterministic report ordering.
+ *
+ * CI output that reorders between runs is output nobody diffs, so ordering is
+ * total: file, then line, then column, then length.
+ */
+export function compareRefs(a, b) {
+    if (a.file !== b.file)
+        return a.file < b.file ? -1 : 1;
+    if (a.span.start.line !== b.span.start.line)
+        return a.span.start.line - b.span.start.line;
+    if (a.span.start.column !== b.span.start.column)
+        return a.span.start.column - b.span.start.column;
+    return a.span.end.offset - b.span.end.offset;
+}
+//# sourceMappingURL=source.js.map

package/dist/source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source.js","sourceRoot":"","sources":["../src/source.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAiBH;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,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,CAAC,QAAQ,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC;YAC9B,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,8EAA8E;IAC9E,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;IAEjF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;IAEhC,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACnE,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAW,CAAC;IACvC,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACnE,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,OAAO,GAAG,GAAI,MAAM,CAAC,OAAO,GAAG,CAAC,CAAY,EAAE,CAAC;gBAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBACpC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;oBAAE,GAAG,IAAI,CAAC,CAAC;;oBAChC,MAAM;YACb,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAW,CAAC;QACpC,OAAO,GAAG,GAAI,MAAM,CAAC,OAAO,GAAG,CAAC,CAAY,EAAE,CAAC;YAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACpC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC;;gBAChC,MAAM;QACb,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IAEF,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,CAAC,MAAc;YACvB,MAAM,OAAO,GAAG,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;YAC7E,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC3B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;gBACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC/B,IAAK,MAAM,CAAC,GAAG,CAAY,IAAI,OAAO;oBAAE,EAAE,GAAG,GAAG,CAAC;;oBAC5C,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YACpB,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,GAAI,MAAM,CAAC,EAAE,CAAY,GAAG,CAAC,EAAE,CAAC;QACzF,CAAC;KACF,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,MAAM,CAAC,KAAgB,EAAE,KAAa,EAAE,GAAW;IACjE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;AACxE,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,KAAK,CAAC,IAAY,EAAE,KAAgB,EAAE,KAAa,EAAE,GAAW;IAC9E,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;AACnD,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,SAAS,CAAC,GAAc;IACtC,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;AACvE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,CAAY,EAAE,CAAY;IACpD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IAC1F,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAClG,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;AAC/C,CAAC","sourcesContent":["/**\n * Offset arithmetic.\n *\n * Every finding spec-graph reports points at a line and a column, and every\n * intermediate structure carries raw offsets instead of copies of the text.\n * Converting between the two is therefore on the hot path, so the line table is\n * built once per file and searched with a binary search rather than by counting\n * newlines from the start each time.\n */\n\nimport type { Position, SourceRef, Span } from './types.js';\n\nexport interface LineIndex {\n  /** Number of lines. A file ending in a newline does not gain a trailing line. */\n  readonly lineCount: number;\n  /** Offset at which the given 1-based line starts. */\n  lineStart(line: number): number;\n  /** Offset just past the given 1-based line, excluding its terminator. */\n  lineEnd(line: number): number;\n  /** Text of the given 1-based line, without its terminator. */\n  lineText(line: number): string;\n  /** Convert an absolute offset to a `{ line, column }` position. */\n  positionAt(offset: number): Position;\n}\n\n/**\n * Builds the line table for `text`.\n *\n * Recognises all three line terminators. `\\r\\n` counts once: a Windows checkout\n * of a spec must produce the same line numbers as a POSIX one, or half the\n * team gets diagnostics pointing at the wrong place.\n */\nexport function createLineIndex(text: string): LineIndex {\n  const starts: number[] = [0];\n  for (let i = 0; i < text.length; i += 1) {\n    const ch = text.charCodeAt(i);\n    if (ch === 10 /* \\n */) {\n      starts.push(i + 1);\n    } else if (ch === 13 /* \\r */) {\n      if (text.charCodeAt(i + 1) === 10) i += 1;\n      starts.push(i + 1);\n    }\n  }\n  // A terminator at the very end opens a line that contains nothing. Drop it so\n  // `lineCount` matches what an editor shows.\n  if (starts.length > 1 && starts[starts.length - 1] === text.length) starts.pop();\n\n  const lineCount = starts.length;\n\n  const startOf = (line: number): number => {\n    const clamped = line < 1 ? 1 : line > lineCount ? lineCount : line;\n    return starts[clamped - 1] as number;\n  };\n\n  const endOf = (line: number): number => {\n    const clamped = line < 1 ? 1 : line > lineCount ? lineCount : line;\n    if (clamped === lineCount) {\n      let end = text.length;\n      while (end > (starts[clamped - 1] as number)) {\n        const ch = text.charCodeAt(end - 1);\n        if (ch === 10 || ch === 13) end -= 1;\n        else break;\n      }\n      return end;\n    }\n    let end = starts[clamped] as number;\n    while (end > (starts[clamped - 1] as number)) {\n      const ch = text.charCodeAt(end - 1);\n      if (ch === 10 || ch === 13) end -= 1;\n      else break;\n    }\n    return end;\n  };\n\n  return {\n    lineCount,\n    lineStart: startOf,\n    lineEnd: endOf,\n    lineText: (line) => text.slice(startOf(line), endOf(line)),\n    positionAt(offset: number): Position {\n      const clamped = offset < 0 ? 0 : offset > text.length ? text.length : offset;\n      let lo = 0;\n      let hi = starts.length - 1;\n      while (lo < hi) {\n        const mid = (lo + hi + 1) >> 1;\n        if ((starts[mid] as number) <= clamped) lo = mid;\n        else hi = mid - 1;\n      }\n      return { offset: clamped, line: lo + 1, column: clamped - (starts[lo] as number) + 1 };\n    },\n  };\n}\n\n/** Builds a {@link Span} from two offsets. */\nexport function spanOf(index: LineIndex, start: number, end: number): Span {\n  return { start: index.positionAt(start), end: index.positionAt(end) };\n}\n\n/** Builds a {@link SourceRef} from two offsets. */\nexport function refOf(file: string, index: LineIndex, start: number, end: number): SourceRef {\n  return { file, span: spanOf(index, start, end) };\n}\n\n/** `path:line:column`, the form every editor and terminal knows how to open. */\nexport function formatRef(ref: SourceRef): string {\n  return `${ref.file}:${ref.span.start.line}:${ref.span.start.column}`;\n}\n\n/**\n * Sort key for deterministic report ordering.\n *\n * CI output that reorders between runs is output nobody diffs, so ordering is\n * total: file, then line, then column, then length.\n */\nexport function compareRefs(a: SourceRef, b: SourceRef): number {\n  if (a.file !== b.file) return a.file < b.file ? -1 : 1;\n  if (a.span.start.line !== b.span.start.line) return a.span.start.line - b.span.start.line;\n  if (a.span.start.column !== b.span.start.column) return a.span.start.column - b.span.start.column;\n  return a.span.end.offset - b.span.end.offset;\n}\n"]}