adispatchd 0.0.0-stage → 0.1.0

package/dist/executors/workspace.js

@@ -0,0 +1,47 @@
+/**
+ * Safe workspace creation below `workspace.base_dir` (Spec §9, §20).
+ */
+import { mkdir, realpath, stat } from 'node:fs/promises';
+import path from 'node:path';
+import { isWithin, OrchestratorError, PathTraversalError, resolveStrictlyWithin } from '../core/index.js';
+/**
+ * Ensure `target` exists as a directory strictly below `baseDir` (never
+ * `baseDir` itself). Directories are created one segment at a time and each
+ * segment's real path is checked BEFORE anything is created below it, so a
+ * symlink inside `baseDir` cannot cause directories to be created outside.
+ * With `create: false` the existing directory is only verified.
+ *
+ * @throws PathTraversalError on lexical or symlink escapes
+ */
+export async function ensureWorkspaceWithin(baseDir, target, create) {
+    const resolved = resolveStrictlyWithin(baseDir, target);
+    if (create)
+        await mkdir(baseDir, { recursive: true });
+    const realBase = await realpath(baseDir);
+    const segments = path.relative(path.resolve(baseDir), resolved).split(path.sep);
+    let current = path.resolve(baseDir);
+    for (const segment of segments) {
+        current = path.join(current, segment);
+        if (create) {
+            try {
+                await mkdir(current);
+            }
+            catch (err) {
+                if (err.code !== 'EEXIST')
+                    throw err;
+            }
+        }
+        const real = await realpath(current);
+        if (!isWithin(realBase, real) || real === realBase) {
+            throw new PathTraversalError(`Workspace "${target}" resolves outside "${baseDir}" via symlink`, {
+                base: baseDir,
+                path: target,
+            });
+        }
+    }
+    const st = await stat(resolved);
+    if (!st.isDirectory())
+        throw new OrchestratorError('ENOTDIR', `working directory is not a directory: ${resolved}`);
+    return resolved;
+}
+//# sourceMappingURL=workspace.js.map

package/dist/executors/workspace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workspace.js","sourceRoot":"","sources":["../../src/executors/workspace.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AAE1G;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,OAAe,EAAE,MAAc,EAAE,MAAe;IAC1F,MAAM,QAAQ,GAAG,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACxD,IAAI,MAAM;QAAE,MAAM,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChF,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACpC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC;gBACH,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;oBAAE,MAAM,GAAG,CAAC;YAClE,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACnD,MAAM,IAAI,kBAAkB,CAAC,cAAc,MAAM,uBAAuB,OAAO,eAAe,EAAE;gBAC9F,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,MAAM;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE;QAAE,MAAM,IAAI,iBAAiB,CAAC,SAAS,EAAE,yCAAyC,QAAQ,EAAE,CAAC,CAAC;IACnH,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/filters/evaluate.d.ts

@@ -0,0 +1,77 @@
+/**
+ * Three-valued, lazy evaluator for the declarative filter AST (Spec §6, §7 step 5).
+ *
+ * - Kleene logic: `all` is false if any child is false, else unknown if any
+ *   child is unknown; `any` dually; `not unknown = unknown`.
+ * - Fields that cannot be resolved (`known: false`) evaluate to `unknown`,
+ *   never to 0/empty (Spec §6, §20.7).
+ * - Inside `all`/`any`, children that only need cheap fields are evaluated
+ *   first; evaluation short-circuits once the result is fixed, so expensive
+ *   fields are only resolved when needed.
+ * - Every evaluation returns a diagnostic trace (per rule: true / false /
+ *   unknown / not_evaluated) for dry-run and GUI.
+ */
+import { type FieldResolution, type FieldType, type FieldValue, type FilterNode, type FilterOperator, type FilterValue, type TriValue } from '../core/index.js';
+/** Value of a rule in a diagnostic trace. `not_evaluated` = skipped (short-circuit / dry-run). */
+export type TraceValue = TriValue | 'not_evaluated';
+/** Diagnostic trace of one AST node; mirrors the AST structure (children in original order). */
+export type FilterTrace = {
+    kind: 'all' | 'any';
+    /** Location in the AST, e.g. `$.all[1].any[0]` (root: {@link ROOT_PATH}). */
+    path: string;
+    value: TraceValue;
+    children: FilterTrace[];
+} | {
+    kind: 'not';
+    path: string;
+    value: TraceValue;
+    child: FilterTrace;
+} | {
+    kind: 'predicate';
+    path: string;
+    value: TraceValue;
+    field: string;
+    operator: FilterOperator;
+    expected: FilterValue;
+    /** Resolved field value (only when known). */
+    actual?: FieldValue;
+    /** Why the value is `unknown` (unknown field, missing permission, incompatible types, ...). */
+    reason?: string;
+} | {
+    kind: 'invalid';
+    path: string;
+    value: TraceValue;
+    reason: string;
+};
+/** Result of {@link evaluateFilter}. */
+export interface FilterEvaluation {
+    value: TriValue;
+    trace: FilterTrace;
+}
+/**
+ * Lazy access to an item's fields. Implementations should memoize; the
+ * evaluator additionally memoizes per evaluation.
+ */
+export interface FieldSource {
+    /** Resolve a field. Must not throw; failures are `{ known: false }`. */
+    resolve(field: string): Promise<FieldResolution> | FieldResolution;
+    /** True if resolving `field` is expensive (evaluated last, only on demand). */
+    isExpensive?(field: string): boolean;
+    /** Declared type of `field` (enables date semantics). */
+    fieldType?(field: string): FieldType | undefined;
+    /** True if string values of `field` compare without regard to case (e.g. GitHub labels). */
+    isCaseInsensitive?(field: string): boolean;
+}
+/** Root path used in traces. */
+export declare const ROOT_PATH = "$";
+/** All field names referenced by `node` (deduplicated, in first-occurrence order). */
+export declare function collectFields(node: FilterNode | undefined | null): string[];
+/** True if `node` is structurally a filter node (children are not checked). */
+export declare function isValidNode(node: unknown): node is FilterNode;
+/** Trace of `node` with every rule marked `not_evaluated` (short-circuit, dry-run). */
+export declare function notEvaluatedTrace(node: FilterNode, path?: string): FilterTrace;
+/**
+ * Evaluate `filter` against an item's fields. A missing filter (`undefined`/`null`)
+ * matches everything. Never throws: malformed nodes and resolver errors yield `unknown`.
+ */
+export declare function evaluateFilter(filter: FilterNode | undefined | null, source: FieldSource): Promise<FilterEvaluation>;

package/dist/filters/evaluate.js

@@ -0,0 +1,187 @@
+/**
+ * Three-valued, lazy evaluator for the declarative filter AST (Spec §6, §7 step 5).
+ *
+ * - Kleene logic: `all` is false if any child is false, else unknown if any
+ *   child is unknown; `any` dually; `not unknown = unknown`.
+ * - Fields that cannot be resolved (`known: false`) evaluate to `unknown`,
+ *   never to 0/empty (Spec §6, §20.7).
+ * - Inside `all`/`any`, children that only need cheap fields are evaluated
+ *   first; evaluation short-circuits once the result is fixed, so expensive
+ *   fields are only resolved when needed.
+ * - Every evaluation returns a diagnostic trace (per rule: true / false /
+ *   unknown / not_evaluated) for dry-run and GUI.
+ */
+import { isFilterAll, isFilterAny, isFilterNot, isFilterPredicate, } from '../core/index.js';
+import { applyOperator } from './predicate.js';
+/** Root path used in traces. */
+export const ROOT_PATH = '$';
+function childPath(parent, kind, index) {
+    return index === undefined ? `${parent}.${kind}` : `${parent}.${kind}[${index}]`;
+}
+/** All field names referenced by `node` (deduplicated, in first-occurrence order). */
+export function collectFields(node) {
+    const out = new Set();
+    const walk = (n) => {
+        if (!isValidNode(n))
+            return; // malformed subtrees are skipped (they evaluate to unknown)
+        if (isFilterAll(n))
+            n.all.forEach(walk);
+        else if (isFilterAny(n))
+            n.any.forEach(walk);
+        else if (isFilterNot(n))
+            walk(n.not);
+        else if (isFilterPredicate(n))
+            out.add(n.field);
+    };
+    if (node)
+        walk(node);
+    return [...out];
+}
+/** True if `node` is structurally a filter node (children are not checked). */
+export function isValidNode(node) {
+    if (node === null || typeof node !== 'object')
+        return false;
+    const n = node;
+    if ('all' in n)
+        return Array.isArray(n.all);
+    if ('any' in n)
+        return Array.isArray(n.any);
+    if ('not' in n)
+        return n.not !== null && typeof n.not === 'object';
+    return typeof n.field === 'string' && typeof n.operator === 'string';
+}
+/** Trace of `node` with every rule marked `not_evaluated` (short-circuit, dry-run). */
+export function notEvaluatedTrace(node, path = ROOT_PATH) {
+    if (!isValidNode(node))
+        return { kind: 'invalid', path, value: 'not_evaluated', reason: 'malformed filter node' };
+    if (isFilterAll(node) || isFilterAny(node)) {
+        const kind = isFilterAll(node) ? 'all' : 'any';
+        const children = isFilterAll(node) ? node.all : node.any;
+        return {
+            kind,
+            path,
+            value: 'not_evaluated',
+            children: children.map((c, i) => notEvaluatedTrace(c, childPath(path, kind, i))),
+        };
+    }
+    if (isFilterNot(node)) {
+        return { kind: 'not', path, value: 'not_evaluated', child: notEvaluatedTrace(node.not, childPath(path, 'not')) };
+    }
+    return {
+        kind: 'predicate',
+        path,
+        value: 'not_evaluated',
+        field: node.field,
+        operator: node.operator,
+        expected: node.value,
+    };
+}
+class Evaluation {
+    source;
+    cache = new Map();
+    costs = new WeakMap();
+    constructor(source) {
+        this.source = source;
+    }
+    resolve(field) {
+        let p = this.cache.get(field);
+        if (!p) {
+            p = Promise.resolve()
+                .then(() => this.source.resolve(field))
+                .catch((err) => ({
+                known: false,
+                reason: `field resolution failed: ${err instanceof Error ? err.message : String(err)}`,
+            }));
+            this.cache.set(field, p);
+        }
+        return p;
+    }
+    /** 0 = only cheap fields, 1 = needs at least one expensive field. Memoized per subtree. */
+    cost(node) {
+        if (!this.source.isExpensive || !isValidNode(node))
+            return 0;
+        const known = this.costs.get(node);
+        if (known !== undefined)
+            return known;
+        let cost;
+        if (isFilterAll(node))
+            cost = node.all.some((c) => this.cost(c) > 0) ? 1 : 0;
+        else if (isFilterAny(node))
+            cost = node.any.some((c) => this.cost(c) > 0) ? 1 : 0;
+        else if (isFilterNot(node))
+            cost = this.cost(node.not);
+        else
+            cost = this.source.isExpensive(node.field) ? 1 : 0;
+        this.costs.set(node, cost);
+        return cost;
+    }
+    async node(node, path) {
+        if (!isValidNode(node))
+            return { kind: 'invalid', path, value: 'unknown', reason: 'malformed filter node' };
+        if (isFilterAll(node))
+            return this.junction('all', node.all, path);
+        if (isFilterAny(node))
+            return this.junction('any', node.any, path);
+        if (isFilterNot(node)) {
+            const child = await this.node(node.not, childPath(path, 'not'));
+            const v = child.value;
+            const value = v === 'unknown' || v === 'not_evaluated' ? 'unknown' : !v;
+            return { kind: 'not', path, value, child };
+        }
+        return this.predicate(node, path);
+    }
+    async junction(kind, children, path) {
+        // `all`: false dominates; `any`: true dominates.
+        const dominant = kind === 'any';
+        const traces = new Array(children.length);
+        const order = children
+            .map((child, index) => ({ index, cost: this.cost(child) }))
+            .sort((a, b) => a.cost - b.cost || a.index - b.index);
+        let sawUnknown = false;
+        let decided = false;
+        for (const { index } of order) {
+            const child = children[index];
+            const p = childPath(path, kind, index);
+            if (decided) {
+                traces[index] = notEvaluatedTrace(child, p);
+                continue;
+            }
+            const t = await this.node(child, p);
+            traces[index] = t;
+            if (t.value === dominant)
+                decided = true;
+            else if (t.value !== !dominant)
+                sawUnknown = true;
+        }
+        const value = decided ? dominant : sawUnknown ? 'unknown' : !dominant;
+        return { kind, path, value, children: traces };
+    }
+    async predicate(node, path) {
+        const base = { kind: 'predicate', path, field: node.field, operator: node.operator, expected: node.value };
+        const resolution = await this.resolve(node.field);
+        if (!resolution.known)
+            return { ...base, value: 'unknown', reason: resolution.reason };
+        const fieldType = this.source.fieldType?.(node.field);
+        const caseInsensitive = this.source.isCaseInsensitive?.(node.field) ?? false;
+        const outcome = applyOperator(node.operator, resolution.value, node.value, fieldType, { caseInsensitive });
+        return {
+            ...base,
+            value: outcome.value,
+            actual: resolution.value,
+            ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),
+        };
+    }
+}
+/**
+ * Evaluate `filter` against an item's fields. A missing filter (`undefined`/`null`)
+ * matches everything. Never throws: malformed nodes and resolver errors yield `unknown`.
+ */
+export async function evaluateFilter(filter, source) {
+    if (filter === undefined || filter === null) {
+        return { value: true, trace: { kind: 'all', path: ROOT_PATH, value: true, children: [] } };
+    }
+    const trace = await new Evaluation(source).node(filter, ROOT_PATH);
+    const value = trace.value === 'not_evaluated' ? 'unknown' : trace.value;
+    return { value, trace };
+}
+//# sourceMappingURL=evaluate.js.map

package/dist/filters/evaluate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluate.js","sourceRoot":"","sources":["../../src/filters/evaluate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EACL,WAAW,EACX,WAAW,EACX,WAAW,EACX,iBAAiB,GAQlB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAkD/C,gCAAgC;AAChC,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAC;AAE7B,SAAS,SAAS,CAAC,MAAc,EAAE,IAAY,EAAE,KAAc;IAC7D,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC;AACnF,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,aAAa,CAAC,IAAmC;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,CAAa,EAAQ,EAAE;QACnC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,4DAA4D;QACzF,IAAI,WAAW,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,WAAW,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;aACxC,IAAI,WAAW,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAChC,IAAI,iBAAiB,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAClB,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,WAAW,CAAC,IAAa;IACvC,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5D,MAAM,CAAC,GAAG,IAA+B,CAAC;IAC1C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC;IACnE,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC;AACvE,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,iBAAiB,CAAC,IAAgB,EAAE,IAAI,GAAW,SAAS;IAC1E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,uBAAuB,EAAE,CAAC;IAClH,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/C,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,IAA8B,CAAC,GAAG,CAAC;QACpF,OAAO;YACL,IAAI;YACJ,IAAI;YACJ,KAAK,EAAE,eAAe;YACtB,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;SACjF,CAAC;IACJ,CAAC;IACD,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,iBAAiB,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;IACnH,CAAC;IACD,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,IAAI;QACJ,KAAK,EAAE,eAAe;QACtB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,QAAQ,EAAE,IAAI,CAAC,KAAK;KACrB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU;IAIe,MAAM;IAHlB,KAAK,GAAG,IAAI,GAAG,EAAoC,CAAC;IACpD,KAAK,GAAG,IAAI,OAAO,EAAkB,CAAC;IAEvD,YAA6B,MAAmB;sBAAnB,MAAM;IAAgB,CAAC;IAE5C,OAAO,CAAC,KAAa;QAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE;iBAClB,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;iBACtC,KAAK,CAAC,CAAC,GAAY,EAAmB,EAAE,CAAC,CAAC;gBACzC,KAAK,EAAE,KAAK;gBACZ,MAAM,EAAE,4BAA4B,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;aACvF,CAAC,CAAC,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,2FAA2F;IACnF,IAAI,CAAC,IAAgB;QAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,IAAY,CAAC;QACjB,IAAI,WAAW,CAAC,IAAI,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxE,IAAI,WAAW,CAAC,IAAI,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC7E,IAAI,WAAW,CAAC,IAAI,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAClD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAE,IAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,IAAgB,EAAE,IAAY;QACvC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,uBAAuB,EAAE,CAAC;QAC5G,IAAI,WAAW,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,WAAW,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;YACtB,MAAM,KAAK,GAAe,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,IAAmB,EAAE,QAAsB,EAAE,IAAY;QAC9E,iDAAiD;QACjD,MAAM,QAAQ,GAAG,IAAI,KAAK,KAAK,CAAC;QAChC,MAAM,MAAM,GAAgC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,QAAQ;aACnB,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAC1D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAe,CAAC;YAC5C,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACvC,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,CAAC,KAAK,CAAC,GAAG,iBAAiB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC5C,SAAS;YACX,CAAC;YACD,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ;gBAAE,OAAO,GAAG,IAAI,CAAC;iBACpC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ;gBAAE,UAAU,GAAG,IAAI,CAAC;QACpD,CAAC;QACD,MAAM,KAAK,GAAa,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAChF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAuB,EAAE,CAAC;IAClE,CAAC;IAEO,KAAK,CAAC,SAAS,CACrB,IAAqE,EACrE,IAAY;QAEZ,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,WAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QACpH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,CAAC,KAAK;YAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QACvF,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QAC7E,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,eAAe,EAAE,CAAC,CAAC;QAC3G,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,MAAM,EAAE,UAAU,CAAC,KAAK;YACxB,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE,CAAC;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,MAAqC,EACrC,MAAmB;IAEnB,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QAC5C,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;IAC7F,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACnE,MAAM,KAAK,GAAa,KAAK,CAAC,KAAK,KAAK,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;IAClF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC"}

package/dist/filters/fields.d.ts

@@ -0,0 +1,35 @@
+/**
+ * {@link FieldSource} for a {@link SourceItem}, implementing the batch contract
+ * of `SourceAdapter.resolveFields` (see docs/handoff/WI-01.md):
+ *
+ * - cheap fields come from `item.fields`;
+ * - on the first expensive field that is actually needed, ALL wanted expensive
+ *   fields of the item are requested in one `resolveFields` call;
+ * - results live only as long as this field source (one planning step / view
+ *   request) and are never written back into `item.fields`;
+ * - unknown fields, missing batch entries and resolver errors are `known: false`.
+ */
+import { type FieldDefinition, type FieldResolution, type FieldValue, type SourceItem } from '../core/index.js';
+import type { FieldSource } from './evaluate.js';
+/** Batch resolver with the signature of `SourceAdapter.resolveFields`. */
+export type ResolveFieldsFn = (item: SourceItem, fields: readonly string[]) => Promise<Record<string, FieldResolution>>;
+/** Options for {@link createItemFieldSource}. */
+export interface ItemFieldSourceOptions {
+    /** Field definitions of the item's adapter (`adapter.fieldDefinitions()`). */
+    definitions: readonly FieldDefinition[];
+    /** Usually `(item, fields) => adapter.resolveFields(item, fields)`. Without it expensive fields are unknown. */
+    resolveFields?: ResolveFieldsFn;
+    /**
+     * Fields the caller will possibly need (e.g. `collectFields(filter)` plus
+     * item-priority rule fields). All expensive ones among them are fetched in
+     * the first batch. Expensive fields not listed here are fetched on demand.
+     */
+    wantedFields?: readonly string[];
+    /**
+     * Additional values not provided by the adapter, e.g. `run.last_workflow`
+     * from the database for views. Take precedence over `item.fields`.
+     */
+    extraFields?: Record<string, FieldValue | FieldResolution>;
+}
+/** Create a memoizing {@link FieldSource} for one item. */
+export declare function createItemFieldSource(item: SourceItem, options: ItemFieldSourceOptions): FieldSource;

package/dist/filters/fields.js

@@ -0,0 +1,75 @@
+/**
+ * {@link FieldSource} for a {@link SourceItem}, implementing the batch contract
+ * of `SourceAdapter.resolveFields` (see docs/handoff/WI-01.md):
+ *
+ * - cheap fields come from `item.fields`;
+ * - on the first expensive field that is actually needed, ALL wanted expensive
+ *   fields of the item are requested in one `resolveFields` call;
+ * - results live only as long as this field source (one planning step / view
+ *   request) and are never written back into `item.fields`;
+ * - unknown fields, missing batch entries and resolver errors are `known: false`.
+ */
+import { errorMessage, } from '../core/index.js';
+function isResolution(v) {
+    return v !== null && typeof v === 'object' && !Array.isArray(v) && 'known' in v;
+}
+/** Create a memoizing {@link FieldSource} for one item. */
+export function createItemFieldSource(item, options) {
+    const defs = new Map(options.definitions.map((d) => [d.name, d]));
+    const extra = options.extraFields ?? {};
+    const fetched = new Map();
+    const isExpensive = (field) => !Object.hasOwn(extra, field) && defs.get(field)?.expensive === true;
+    const fetchBatch = (field) => {
+        const batch = new Set([field]);
+        for (const f of options.wantedFields ?? [])
+            if (isExpensive(f) && !fetched.has(f))
+                batch.add(f);
+        const names = [...batch];
+        const resolveFields = options.resolveFields;
+        const request = resolveFields
+            ? Promise.resolve()
+                .then(() => resolveFields(item, names))
+                .catch((err) => {
+                const reason = `field resolution failed: ${errorMessage(err)}`;
+                return Object.fromEntries(names.map((n) => [n, { known: false, reason }]));
+            })
+            : Promise.resolve({});
+        for (const name of names) {
+            fetched.set(name, request.then((res) => {
+                const r = Object.hasOwn(res, name) ? res[name] : undefined;
+                if (r && isResolution(r))
+                    return r;
+                return {
+                    known: false,
+                    reason: resolveFields ? `adapter returned no value for '${name}'` : `no resolver for expensive field '${name}'`,
+                };
+            }));
+        }
+    };
+    return {
+        isExpensive,
+        fieldType(field) {
+            return defs.get(field)?.type;
+        },
+        isCaseInsensitive(field) {
+            return !Object.hasOwn(extra, field) && defs.get(field)?.caseInsensitive === true;
+        },
+        resolve(field) {
+            if (Object.hasOwn(extra, field)) {
+                const v = extra[field];
+                return isResolution(v) ? v : { known: true, value: v };
+            }
+            const def = defs.get(field);
+            if (def?.expensive) {
+                if (!fetched.has(field))
+                    fetchBatch(field);
+                return fetched.get(field);
+            }
+            if (Object.hasOwn(item.fields, field)) {
+                return { known: true, value: item.fields[field] };
+            }
+            return { known: false, reason: def ? `field '${field}' not provided by source` : `unknown field '${field}'` };
+        },
+    };
+}
+//# sourceMappingURL=fields.js.map

package/dist/filters/fields.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fields.js","sourceRoot":"","sources":["../../src/filters/fields.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EACL,YAAY,GAMb,MAAM,kBAAkB,CAAC;AA4B1B,SAAS,YAAY,CAAC,CAAU;IAC9B,OAAO,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC;AAClF,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,qBAAqB,CAAC,IAAgB,EAAE,OAA+B;IACrF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAC;IAE5D,MAAM,WAAW,GAAG,CAAC,KAAa,EAAW,EAAE,CAC7C,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,SAAS,KAAK,IAAI,CAAC;IAEtE,MAAM,UAAU,GAAG,CAAC,KAAa,EAAQ,EAAE;QACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,YAAY,IAAI,EAAE;YAAE,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChG,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAC5C,MAAM,OAAO,GAA6C,aAAa;YACrE,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE;iBACd,IAAI,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;iBACtC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;gBACtB,MAAM,MAAM,GAAG,4BAA4B,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/D,OAAO,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAqB,CAAC,CAAC,CAAC,CAAC;YAChG,CAAC,CAAC;YACN,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CACT,IAAI,EACJ,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;gBACnB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC3D,IAAI,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC;gBACnC,OAAO;oBACL,KAAK,EAAE,KAAK;oBACZ,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,kCAAkC,IAAI,GAAG,CAAC,CAAC,CAAC,oCAAoC,IAAI,GAAG;iBAChH,CAAC;YACJ,CAAC,CAAC,CACH,CAAC;QACJ,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,WAAW;QACX,SAAS,CAAC,KAAa;YACrB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC;QAC/B,CAAC;QACD,iBAAiB,CAAC,KAAa;YAC7B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,eAAe,KAAK,IAAI,CAAC;QACnF,CAAC;QACD,OAAO,CAAC,KAAa;YACnB,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAiC,CAAC;gBACvD,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACzD,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,GAAG,EAAE,SAAS,EAAE,CAAC;gBACnB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC3C,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAA6B,CAAC;YACxD,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAe,EAAE,CAAC;YAClE,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,0BAA0B,CAAC,CAAC,CAAC,kBAAkB,KAAK,GAAG,EAAE,CAAC;QAChH,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/filters/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Component `filters` – public API (WI-04, Spec §6, §7).
+ * Other components import from this module only.
+ */
+export { applyOperator, type OperatorOptions, type PredicateOutcome } from './predicate.js';
+export { parseIsoDate } from './iso-date.js';
+export { collectFields, evaluateFilter, notEvaluatedTrace, ROOT_PATH, type FieldSource, type FilterEvaluation, type FilterTrace, type TraceValue, } from './evaluate.js';
+export { createItemFieldSource, type ItemFieldSourceOptions, type ResolveFieldsFn } from './fields.js';
+export { canPushDown, splitForPushdown, type PushdownSplit } from './pushdown.js';
+export { compareCandidates, naturalCompare, resolveItemPriority, sortCandidates, type ItemPriorityConfig, type ItemPriorityResult, type ItemPriorityRule, type PrioritizedCandidate, } from './priority.js';
+export { buildCheckContext, CHECK_CONTEXT_ENV, DEFAULT_CHECK_KILL_GRACE_MS, DEFAULT_MAX_CHECK_OUTPUT_BYTES, MINIMAL_ENV_KEYS, ShellCheckRunner, type ShellCheckContext, type ShellCheckKind, type ShellCheckResult, type ShellCheckRunnerOptions, type ShellCheckSpec, } from './shell-check.js';

package/dist/filters/index.js

@@ -0,0 +1,12 @@
+/**
+ * Component `filters` – public API (WI-04, Spec §6, §7).
+ * Other components import from this module only.
+ */
+export { applyOperator } from './predicate.js';
+export { parseIsoDate } from './iso-date.js';
+export { collectFields, evaluateFilter, notEvaluatedTrace, ROOT_PATH, } from './evaluate.js';
+export { createItemFieldSource } from './fields.js';
+export { canPushDown, splitForPushdown } from './pushdown.js';
+export { compareCandidates, naturalCompare, resolveItemPriority, sortCandidates, } from './priority.js';
+export { buildCheckContext, CHECK_CONTEXT_ENV, DEFAULT_CHECK_KILL_GRACE_MS, DEFAULT_MAX_CHECK_OUTPUT_BYTES, MINIMAL_ENV_KEYS, ShellCheckRunner, } from './shell-check.js';
+//# sourceMappingURL=index.js.map

package/dist/filters/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/filters/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,aAAa,EAA+C,MAAM,gBAAgB,CAAC;AAC5F,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EACL,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,SAAS,GAKV,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,qBAAqB,EAAqD,MAAM,aAAa,CAAC;AACvG,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAsB,MAAM,eAAe,CAAC;AAClF,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,mBAAmB,EACnB,cAAc,GAKf,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,2BAA2B,EAC3B,8BAA8B,EAC9B,gBAAgB,EAChB,gBAAgB,GAMjB,MAAM,kBAAkB,CAAC"}

package/dist/filters/iso-date.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Strict ISO-8601 parsing for filter comparisons and candidate ordering.
+ * Unlike `Date.parse`, this is independent of the host time zone and rejects
+ * non-ISO formats. Values without an offset are interpreted as UTC.
+ */
+/**
+ * Parse `YYYY-MM-DD` or `YYYY-MM-DDTHH:MM[:SS[.fff]][Z|±HH:MM]` to epoch ms.
+ * Returns `undefined` for anything else or for out-of-range components.
+ */
+export declare function parseIsoDate(value: unknown): number | undefined;

package/dist/filters/iso-date.js

@@ -0,0 +1,42 @@
+/**
+ * Strict ISO-8601 parsing for filter comparisons and candidate ordering.
+ * Unlike `Date.parse`, this is independent of the host time zone and rejects
+ * non-ISO formats. Values without an offset are interpreted as UTC.
+ */
+const ISO_RE = /^(\d{4})-(\d{2})-(\d{2})(?:T(\d{2}):(\d{2})(?::(\d{2})(?:\.(\d{1,9}))?)?(Z|[+-]\d{2}:\d{2})?)?$/;
+/**
+ * Parse `YYYY-MM-DD` or `YYYY-MM-DDTHH:MM[:SS[.fff]][Z|±HH:MM]` to epoch ms.
+ * Returns `undefined` for anything else or for out-of-range components.
+ */
+export function parseIsoDate(value) {
+    if (typeof value !== 'string')
+        return undefined;
+    const m = ISO_RE.exec(value);
+    if (!m)
+        return undefined;
+    const [, y, mo, d, h = '0', mi = '0', s = '0', frac = '', offset = 'Z'] = m;
+    const year = Number(y);
+    const month = Number(mo);
+    const day = Number(d);
+    const hour = Number(h);
+    const minute = Number(mi);
+    const second = Number(s);
+    if (month < 1 || month > 12 || day < 1 || hour > 23 || minute > 59 || second > 59)
+        return undefined;
+    const ms = Number(frac.padEnd(3, '0').slice(0, 3));
+    const utc = Date.UTC(year, month - 1, day, hour, minute, second, ms);
+    // Reject day overflow (e.g. 2026-02-30).
+    const check = new Date(utc);
+    if (check.getUTCFullYear() !== year || check.getUTCMonth() !== month - 1 || check.getUTCDate() !== day) {
+        return undefined;
+    }
+    if (offset === 'Z')
+        return utc;
+    const sign = offset.startsWith('-') ? -1 : 1;
+    const oh = Number(offset.slice(1, 3));
+    const om = Number(offset.slice(4, 6));
+    if (oh > 23 || om > 59)
+        return undefined;
+    return utc - sign * (oh * 60 + om) * 60_000;
+}
+//# sourceMappingURL=iso-date.js.map

package/dist/filters/iso-date.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iso-date.js","sourceRoot":"","sources":["../../src/filters/iso-date.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,MAAM,GACV,iGAAiG,CAAC;AAEpG;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAc;IACzC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAChD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACzB,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,IAAI,MAAM,GAAG,EAAE,IAAI,MAAM,GAAG,EAAE;QAAE,OAAO,SAAS,CAAC;IACpG,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACrE,yCAAyC;IACzC,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,KAAK,CAAC,cAAc,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,KAAK,GAAG,EAAE,CAAC;QACvG,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,MAAM,KAAK,GAAG;QAAE,OAAO,GAAG,CAAC;IAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;AAC9C,CAAC"}

package/dist/filters/predicate.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Operator semantics for single filter predicates (Spec §6).
+ *
+ * Every comparison is three-valued: incompatible types, unparsable dates or
+ * malformed operands yield `unknown` (with a reason) instead of guessing.
+ */
+import type { FieldType, FieldValue, FilterOperator, FilterValue, TriValue } from '../core/index.js';
+/** Outcome of applying one operator to a known field value. */
+export interface PredicateOutcome {
+    value: TriValue;
+    /** Why the outcome is `unknown`. */
+    reason?: string;
+}
+/** Per-field comparison options (from the adapter's field definition). */
+export interface OperatorOptions {
+    /** Compare string values without regard to case (e.g. GitHub labels). */
+    caseInsensitive?: boolean;
+}
+/**
+ * Apply `operator` to a known field value and the literal `expected`.
+ * `fieldType` (from the adapter's field definition) enables date semantics;
+ * `options.caseInsensitive` folds the case of all string values first.
+ */
+export declare function applyOperator(operator: FilterOperator, actualValue: FieldValue, expectedValue: FilterValue, fieldType?: FieldType, options?: OperatorOptions): PredicateOutcome;