@gate-forge/core 0.1.0

package/dist/baselines/index.js

@@ -0,0 +1,186 @@
+/**
+ * Baselines (pin #3, invariant 4): `.gateforge/baselines/obligations.json`
+ * — `{schemaVersion: 1, fingerprints: string[]}` storing forgiven
+ * obligation fingerprints (pin #2). Baselines may only ever SHRINK to a
+ * strict subset: `[A, B] → [A, NEW]` is rejected (GF-07), `[A, B] → [A]`
+ * passes (GF-08). Loading and writing are synchronous, matching
+ * `loadConfig`'s convention.
+ */
+import { mkdirSync, readFileSync, writeFileSync } from 'node:fs';
+import { dirname } from 'node:path';
+import { compareStrings } from '../graph/util.js';
+import { BaselineSchema } from '../schemas/baseline.js';
+/**
+ * Error raised for any fail-closed baseline problem: missing file,
+ * unparsable JSON, schema violation, or a non-strict-subset update
+ * (GF-07's count-preserving debt laundering).
+ */
+export class GateforgeBaselineError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'GateforgeBaselineError';
+    }
+}
+/**
+ * Loads and validates a baseline document. Fail-closed: a missing,
+ * unparsable, or schema-violating file throws — callers decide whether
+ * that means "no baseline yet" for their flow.
+ *
+ * Args:
+ *   path: baseline file path (default `.gateforge/baselines/obligations.json`).
+ *
+ * Returns:
+ *   Baseline: the validated document (sorted, duplicate-free fingerprints).
+ *
+ * Throws:
+ *   GateforgeBaselineError: on any load or validation failure.
+ */
+export function loadBaseline(path) {
+    let document;
+    try {
+        document = JSON.parse(readFileSync(path, 'utf8'));
+    }
+    catch (error) {
+        throw new GateforgeBaselineError(`baseline '${path}' could not be loaded: ${error instanceof Error ? error.message : String(error)}`);
+    }
+    const result = BaselineSchema.safeParse(document);
+    if (!result.success) {
+        const issues = result.error.issues
+            .map((issue) => `${issue.path.join('.') || '<baseline>'}: ${issue.message}`)
+            .join('; ');
+        throw new GateforgeBaselineError(`baseline '${path}' failed validation: ${issues}`);
+    }
+    return result.data;
+}
+/**
+ * Whether a baseline update is a strict subset (invariant 4): every
+ * fingerprint in `next` exists in `current` AND at least one fingerprint
+ * is removed. `[A, B] → [A, B]` is not an update (nothing was resolved)
+ * and `[A, B] → [A, NEW]` fails (GF-07); `[A, B] → [A]` passes (GF-08).
+ *
+ * Args:
+ *   current: the baseline on disk.
+ *   next: the proposed replacement.
+ *
+ * Returns:
+ *   boolean: true only for a non-empty proper subset.
+ */
+export function canUpdate(current, next) {
+    if (next.fingerprints.length >= current.fingerprints.length)
+        return false;
+    const known = {};
+    for (const fingerprint of current.fingerprints)
+        known[fingerprint] = true;
+    return next.fingerprints.every((fingerprint) => fingerprint in known);
+}
+/**
+ * THE ONE SANCTIONED BULK-ADD (phase 8 workstream C, `gateforge adopt`):
+ * builds the adoption baseline from every currently-unresolved
+ * fingerprint, WITHOUT the strict-subset check. This is the controlled
+ * escape GF-07/08's anti-laundering invariant demands: adoption is a
+ * dated, count-annotated, loudly-printed event recorded in
+ * `adoption.json` (see baselines/adoption.ts), and it happens at most
+ * once per repo — the adopt command refuses a second bulk-add and sends
+ * subsequent debt to `updateBaseline` (shrink-only) or the gate itself.
+ * The companion record gates enforcement: `check` honors a baseline only
+ * when its adoption record exists, so this function's output can never
+ * forgive silently. Input order is irrelevant; duplicates are collapsed
+ * (the red set is collected from disjoint sources — verdicts and
+ * blocking entries — so duplicates are expected to be absent, not an
+ * error like in `updateBaseline`).
+ *
+ * Args:
+ *   fingerprints: the unresolved fingerprints captured at adoption time.
+ *
+ * Returns:
+ *   Baseline: the validated initial baseline document (sorted, unique).
+ */
+export function adoptBaseline(fingerprints) {
+    const seen = {};
+    const unique = [];
+    for (const fingerprint of fingerprints) {
+        if (fingerprint in seen)
+            continue;
+        seen[fingerprint] = true;
+        unique.push(fingerprint);
+    }
+    unique.sort(compareStrings);
+    return BaselineSchema.parse({ schemaVersion: 1, fingerprints: unique });
+}
+/**
+ * Builds the next baseline from raw fingerprints, enforcing the strict-
+ * subset rule (invariant 4) against `current`. Input order is irrelevant:
+ * the result is sorted; duplicates in the input are an error.
+ *
+ * Args:
+ *   current: the baseline on disk.
+ *   fingerprints: the resolved fingerprints to keep.
+ *
+ * Returns:
+ *   Baseline: the validated next document.
+ *
+ * Throws:
+ *   GateforgeBaselineError: on duplicates or a non-strict-subset update
+ *   (naming the added fingerprints — GF-07's laundering attempt).
+ */
+export function updateBaseline(current, fingerprints) {
+    const seen = {};
+    const unique = [];
+    for (const fingerprint of fingerprints) {
+        if (fingerprint in seen)
+            continue;
+        seen[fingerprint] = true;
+        unique.push(fingerprint);
+    }
+    if (unique.length !== fingerprints.length) {
+        throw new GateforgeBaselineError('baseline update input contains duplicate fingerprints');
+    }
+    unique.sort(compareStrings);
+    const next = BaselineSchema.parse({ schemaVersion: 1, fingerprints: unique });
+    if (!canUpdate(current, next)) {
+        const known = {};
+        for (const fingerprint of current.fingerprints)
+            known[fingerprint] = true;
+        const added = unique.filter((fingerprint) => !(fingerprint in known));
+        throw new GateforgeBaselineError(`baseline update rejected: not a strict subset of the current baseline ` +
+            `(invariant 4) — added ${added.length} new fingerprint(s): ` +
+            `${added.join(', ') || '<none>'}; new (never-adopted) obligations do not belong in the ` +
+            'baseline — prove them with witnessed test evidence (docs/guides/new-table-playbook.md) ' +
+            'or waive them (`gateforge waive`)');
+    }
+    return next;
+}
+/**
+ * Serializes a baseline for on-disk storage: sorted 2-space JSON with a
+ * trailing newline (reviewable in diffs; canonical hashing is a separate
+ * pin-#1 concern and does not apply to this file's formatting).
+ *
+ * Args:
+ *   baseline: the document to serialize.
+ *
+ * Returns:
+ *   string: the file content.
+ */
+export function serializeBaseline(baseline) {
+    return `${JSON.stringify(baseline, null, 2)}\n`;
+}
+/**
+ * Writes a baseline to disk, creating parent directories as needed.
+ *
+ * Args:
+ *   path: destination file path.
+ *   baseline: the document to write.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file cannot be written.
+ */
+export function writeBaseline(path, baseline) {
+    try {
+        mkdirSync(dirname(path), { recursive: true });
+        writeFileSync(path, serializeBaseline(baseline), 'utf8');
+    }
+    catch (error) {
+        throw new GateforgeBaselineError(`baseline '${path}' could not be written: ${error instanceof Error ? error.message : String(error)}`);
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/baselines/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/baselines/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAiB,MAAM,wBAAwB,CAAC;AAEvE;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,wBAAwB,CAAC;IACvC,CAAC;CACF;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,IAAI,QAAiB,CAAC;IACtB,IAAI,CAAC;QACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,sBAAsB,CAC9B,aAAa,IAAI,0BAA0B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CACpG,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM;aAC/B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,YAAY,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;aAC3E,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,sBAAsB,CAAC,aAAa,IAAI,wBAAwB,MAAM,EAAE,CAAC,CAAC;IACtF,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,OAAiB,EAAE,IAAc;IACzD,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1E,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,KAAK,MAAM,WAAW,IAAI,OAAO,CAAC,YAAY;QAAE,KAAK,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;IAC1E,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC;AACxE,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,aAAa,CAAC,YAA+B;IAC3D,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,IAAI,WAAW,IAAI,IAAI;YAAE,SAAS;QAClC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC5B,OAAO,cAAc,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,cAAc,CAAC,OAAiB,EAAE,YAA+B;IAC/E,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,IAAI,WAAW,IAAI,IAAI;YAAE,SAAS;QAClC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3B,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,IAAI,sBAAsB,CAAC,uDAAuD,CAAC,CAAC;IAC5F,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC;IAC9E,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAyB,EAAE,CAAC;QACvC,KAAK,MAAM,WAAW,IAAI,OAAO,CAAC,YAAY;YAAE,KAAK,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QAC1E,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,CAAC;QACtE,MAAM,IAAI,sBAAsB,CAC9B,wEAAwE;YACtE,yBAAyB,KAAK,CAAC,MAAM,uBAAuB;YAC5D,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,yDAAyD;YACxF,yFAAyF;YACzF,mCAAmC,CACtC,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAkB;IAClD,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;AAClD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,QAAkB;IAC5D,IAAI,CAAC;QACH,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9C,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,sBAAsB,CAC9B,aAAa,IAAI,2BAA2B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CACrG,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/canonical-json.d.ts

@@ -0,0 +1,51 @@
+/** Any JSON-representable value. */
+export type JsonValue = string | number | boolean | null | JsonValue[] | {
+    [key: string]: JsonValue;
+};
+/**
+ * Type predicate narrowing an unknown value to {@link JsonValue}.
+ * Accepts plain objects and arrays only — class instances (Date, Map,
+ * custom types) are rejected even when property-less.
+ */
+export declare function isJsonValue(value: unknown): value is JsonValue;
+/**
+ * Serializes a value to its GF-canonical-JSON string form (pin #1).
+ *
+ * Object keys are sorted recursively (by UTF-16 code units, matching the
+ * JS default string comparison). No whitespace is emitted. Integers are
+ * serialized plain; non-integer finite numbers fall back to the shortest
+ * round-trip decimal form (out of v1 scope, but deterministic). NaN and
+ * Infinity throw — they have no canonical representation.
+ *
+ * Array order is preserved: arrays are ordered values, never sorted.
+ *
+ * Args:
+ *   value: JSON-representable value to canonicalize.
+ *
+ * Returns:
+ *   string: GF-canonical-JSON text, ready to hash or compare byte-wise.
+ */
+export declare function canonicalJson(value: JsonValue): string;
+/**
+ * Computes the lowercase hex sha256 digest of a string or byte buffer.
+ *
+ * Args:
+ *   input: UTF-8 text (e.g. a canonical JSON string) or raw bytes.
+ *
+ * Returns:
+ *   string: 64-char lowercase hex digest.
+ */
+export declare function sha256Hex(input: string | Uint8Array): string;
+/**
+ * Hashes a value as GF-canonical-JSON: `sha256(canonicalJson(value))` (pin #1).
+ * This is the single primitive behind fingerprints, GPP/3 digests, and
+ * witness record ids.
+ *
+ * Args:
+ *   value: JSON-representable value to hash.
+ *
+ * Returns:
+ *   string: 64-char lowercase hex digest of the canonical form.
+ */
+export declare function sha256Canonical(value: JsonValue): string;
+//# sourceMappingURL=canonical-json.d.ts.map

package/dist/canonical-json.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-json.d.ts","sourceRoot":"","sources":["../src/canonical-json.ts"],"names":[],"mappings":"AAaA,oCAAoC;AACpC,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,OAAO,GACP,IAAI,GACJ,SAAS,EAAE,GACX;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,CAAC;AAEjC;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAsB9D;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CA2BtD;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAE5D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAExD"}

package/dist/canonical-json.js

@@ -0,0 +1,112 @@
+/**
+ * GF-canonical-JSON and sha256 helpers (Interface pin #1).
+ *
+ * GF-canonical-JSON: UTF-8 text, object keys recursively sorted, no
+ * whitespace between tokens, integers serialized plain (`1`, not `1.0`).
+ * ALL gateforge hashes — fingerprints, GPP digests, witness record ids —
+ * are `sha256` hex digests over the GF-canonical-JSON of the named object.
+ * This is deliberately NOT RFC 8785: v1 payloads contain only strings,
+ * integers, booleans, null, arrays, and objects (no floats), so the
+ * canonical form is fully defined by key sorting plus JSON escaping.
+ */
+import { createHash } from 'node:crypto';
+/**
+ * Type predicate narrowing an unknown value to {@link JsonValue}.
+ * Accepts plain objects and arrays only — class instances (Date, Map,
+ * custom types) are rejected even when property-less.
+ */
+export function isJsonValue(value) {
+    if (value === null ||
+        typeof value === 'string' ||
+        typeof value === 'boolean') {
+        return true;
+    }
+    if (typeof value === 'number') {
+        return Number.isFinite(value);
+    }
+    if (Array.isArray(value)) {
+        return value.every(isJsonValue);
+    }
+    if (typeof value === 'object') {
+        const proto = Object.getPrototypeOf(value);
+        if (proto !== Object.prototype && proto !== null) {
+            return false;
+        }
+        return Object.values(value).every(isJsonValue);
+    }
+    return false;
+}
+/**
+ * Serializes a value to its GF-canonical-JSON string form (pin #1).
+ *
+ * Object keys are sorted recursively (by UTF-16 code units, matching the
+ * JS default string comparison). No whitespace is emitted. Integers are
+ * serialized plain; non-integer finite numbers fall back to the shortest
+ * round-trip decimal form (out of v1 scope, but deterministic). NaN and
+ * Infinity throw — they have no canonical representation.
+ *
+ * Array order is preserved: arrays are ordered values, never sorted.
+ *
+ * Args:
+ *   value: JSON-representable value to canonicalize.
+ *
+ * Returns:
+ *   string: GF-canonical-JSON text, ready to hash or compare byte-wise.
+ */
+export function canonicalJson(value) {
+    if (value === null)
+        return 'null';
+    if (typeof value === 'string')
+        return JSON.stringify(value);
+    if (typeof value === 'boolean')
+        return value ? 'true' : 'false';
+    if (typeof value === 'number') {
+        if (!Number.isFinite(value)) {
+            throw new TypeError(`canonicalJson: ${String(value)} has no canonical JSON representation`);
+        }
+        return Number.isInteger(value) ? String(value) : JSON.stringify(value);
+    }
+    if (Array.isArray(value)) {
+        return `[${value.map(canonicalJson).join(',')}]`;
+    }
+    const keys = Object.keys(value).sort();
+    const members = [];
+    for (const key of keys) {
+        const member = value[key];
+        // An explicitly-undefined member is ABSENT for hashing purposes —
+        // identical to the key not being present (JSON.stringify semantics).
+        // Without this, zod-parsed artifacts carrying optional keys as
+        // explicit undefined values would crash fingerprinting.
+        if (member === undefined)
+            continue;
+        members.push(`${JSON.stringify(key)}:${canonicalJson(member)}`);
+    }
+    return `{${members.join(',')}}`;
+}
+/**
+ * Computes the lowercase hex sha256 digest of a string or byte buffer.
+ *
+ * Args:
+ *   input: UTF-8 text (e.g. a canonical JSON string) or raw bytes.
+ *
+ * Returns:
+ *   string: 64-char lowercase hex digest.
+ */
+export function sha256Hex(input) {
+    return createHash('sha256').update(input).digest('hex');
+}
+/**
+ * Hashes a value as GF-canonical-JSON: `sha256(canonicalJson(value))` (pin #1).
+ * This is the single primitive behind fingerprints, GPP/3 digests, and
+ * witness record ids.
+ *
+ * Args:
+ *   value: JSON-representable value to hash.
+ *
+ * Returns:
+ *   string: 64-char lowercase hex digest of the canonical form.
+ */
+export function sha256Canonical(value) {
+    return sha256Hex(canonicalJson(value));
+}
+//# sourceMappingURL=canonical-json.js.map

package/dist/canonical-json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-json.js","sourceRoot":"","sources":["../src/canonical-json.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAWzC;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAc;IACxC,IACE,KAAK,KAAK,IAAI;QACd,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAY,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,KAAK,KAAK,MAAM,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACjD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5D,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IAChE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,SAAS,CACjB,kBAAkB,MAAM,CAAC,KAAK,CAAC,uCAAuC,CACvE,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACnD,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACvC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,kEAAkE;QAClE,qEAAqE;QACrE,+DAA+D;QAC/D,wDAAwD;QACxD,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,aAAa,CAAC,MAAmB,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC;IACD,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAClC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAAC,KAAgB;IAC9C,OAAO,SAAS,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACzC,CAAC"}

package/dist/classifier/bind.d.ts

@@ -0,0 +1,64 @@
+import type { GraphResource, ResourceGraph } from '../graph/schema.js';
+import type { BlockingEntry } from '../policy/index.js';
+import type { ClassificationSignal } from '../schemas/classification-signal.js';
+import type { ClassificationPolicy } from '../schemas/classification-policy.js';
+import { type ClassificationResult, type ClassifierResourceRef } from './classify.js';
+/** Everything one classification pass over a graph needs. */
+export interface RunClassificationInput {
+    /** The built resource graph (pre-binding). */
+    graph: ResourceGraph;
+    /** Every detector contribution's `classificationSignals`, config order. */
+    signals: readonly ClassificationSignal[];
+    /**
+     * HOST-ISSUED authority signals (declarations / closed-world proofs
+     * minted by the engine, e.g. from configured source-declaration
+     * markers). Never forwarded plugin output.
+     */
+    authority?: readonly ClassificationSignal[];
+    /** The validated classification policy. */
+    policy: ClassificationPolicy;
+    /** Reviewed adapter names available for binding. */
+    adapters: readonly string[];
+    scan?: {
+        requestedPaths: string[];
+        scannedPaths: string[];
+        /** Per-detector coverage reports (judged against policy.coverage). */
+        coverage?: Array<{
+            detector: string;
+            scannedPaths: string[];
+        }>;
+        configuredDetectors: number;
+        successfulDetectors: number;
+    };
+}
+/** The result of one classification pass over a graph. */
+export interface GraphClassification {
+    /** The graph with decisions bound (deterministically re-sorted). */
+    graph: ResourceGraph;
+    /** The raw classifier result (decisions, stale/invalid signals). */
+    classification: ClassificationResult;
+    /** Classifier blocks projected as policy-engine blocking entries. */
+    blocking: BlockingEntry[];
+}
+/** Projects one graph resource into the classifier's resource reference. */
+export declare function resourceRef(resource: GraphResource): ClassifierResourceRef;
+/**
+ * Runs the deterministic classifier over the graph and rebinds its
+ * decisions. See the module doc for the contract.
+ *
+ * Args:
+ *   input: graph, detector signals, classification policy, adapters.
+ *
+ * Returns:
+ *   GraphClassification: bound graph, raw result, blocking entries.
+ */
+export declare function runClassification(input: RunClassificationInput): GraphClassification;
+/**
+ * Projects classifier blocks into policy-engine blocking entries:
+ * per-decision blocks (contradictions, incomplete proofs, unresolved
+ * delete semantics, missing adapters) plus document-level stale targets
+ * and invalid signals. Every entry names its typed code so an AI can
+ * resolve it in code — never by obtaining human approval.
+ */
+export declare function classifierBlocking(result: ClassificationResult, graph: ResourceGraph): BlockingEntry[];
+//# sourceMappingURL=bind.d.ts.map

package/dist/classifier/bind.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bind.d.ts","sourceRoot":"","sources":["../../src/classifier/bind.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEvE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAChF,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAChF,OAAO,EAGL,KAAK,oBAAoB,EACzB,KAAK,qBAAqB,EAC3B,MAAM,eAAe,CAAC;AAEvB,6DAA6D;AAC7D,MAAM,WAAW,sBAAsB;IACrC,8CAA8C;IAC9C,KAAK,EAAE,aAAa,CAAC;IACrB,2EAA2E;IAC3E,OAAO,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC;;;;OAIG;IACH,SAAS,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC5C,2CAA2C;IAC3C,MAAM,EAAE,oBAAoB,CAAC;IAC7B,oDAAoD;IACpD,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,IAAI,CAAC,EAAE;QACL,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,sEAAsE;QACtE,QAAQ,CAAC,EAAE,KAAK,CAAC;YAAE,QAAQ,EAAE,MAAM,CAAC;YAAC,YAAY,EAAE,MAAM,EAAE,CAAA;SAAE,CAAC,CAAC;QAC/D,mBAAmB,EAAE,MAAM,CAAC;QAC5B,mBAAmB,EAAE,MAAM,CAAC;KAC7B,CAAC;CACH;AACD,0DAA0D;AAC1D,MAAM,WAAW,mBAAmB;IAClC,oEAAoE;IACpE,KAAK,EAAE,aAAa,CAAC;IACrB,oEAAoE;IACpE,cAAc,EAAE,oBAAoB,CAAC;IACrC,qEAAqE;IACrE,QAAQ,EAAE,aAAa,EAAE,CAAC;CAC3B;AAED,4EAA4E;AAC5E,wBAAgB,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,qBAAqB,CAU1E;AAwED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,sBAAsB,GAAG,mBAAmB,CAgDpF;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,oBAAoB,EAC5B,KAAK,EAAE,aAAa,GACnB,aAAa,EAAE,CA8CjB"}

package/dist/classifier/bind.js

@@ -0,0 +1,188 @@
+import { compareLocations, compareStrings } from '../graph/util.js';
+import { classifyResources, } from './classify.js';
+/** Projects one graph resource into the classifier's resource reference. */
+export function resourceRef(resource) {
+    return {
+        name: resource.name,
+        id: resource.id,
+        kind: resource.kind,
+        source: resource.source,
+        location: resource.location,
+        detector: resource.detector,
+        attributes: resource.attributes,
+    };
+}
+/**
+ * The binding key of a resource or decision: the exact (name, kind,
+ * source, location) tuple — unique per resource declaration and stable
+ * across the sort the classifier applies to its decisions.
+ */
+function bindingKey(part) {
+    return (`${part.name}\u0000${part.kind}\u0000${part.source}\u0000` +
+        `${part.location.file}\u0000${part.location.line}\u0000${part.location.col}`);
+}
+/** Sorts bound resources exactly like the graph builder does. */
+function sortResources(resources) {
+    return [...resources].sort((a, b) => {
+        if (a.id !== null && b.id !== null) {
+            const byId = compareStrings(a.id, b.id);
+            if (byId !== 0)
+                return byId;
+        }
+        if (a.id !== null)
+            return -1;
+        if (b.id !== null)
+            return 1;
+        return (compareStrings(a.name, b.name) ||
+            compareStrings(a.source, b.source) ||
+            compareLocations(a.location, b.location));
+    });
+}
+/** Binds one decision's classification onto one graph resource. */
+function bindDecision(resource, decision) {
+    if (decision === undefined || decision.classification === null)
+        return resource;
+    const bound = decision.classification;
+    const { exposure, plane, primaryKey, evidenceAdapter, evidenceLane } = bound;
+    return {
+        ...resource,
+        id: `${plane}.${resource.name}`,
+        plane,
+        exposure,
+        classification: {
+            exposure,
+            plane,
+            lifecycle: bound.lifecycle,
+            primaryKey,
+            // The claims lane rides with the classification: without it a
+            // user-facing endpoint bound here would fail ClassificationSchema
+            // (user-facing without adapter) at graph validation.
+            ...(evidenceLane !== undefined ? { evidenceLane } : {}),
+            ...(evidenceAdapter !== undefined ? { evidenceAdapter } : {}),
+        },
+        classificationTrace: {
+            rules: [...bound.rules],
+            defaultsApplied: [...bound.defaultsApplied],
+            contributingSignalIds: [...bound.contributingSignalIds],
+            contributingDetectors: [...bound.contributingDetectors],
+            contradictions: bound.contradictions.map((entry) => ({ ...entry })),
+            unresolvedDimensions: [...bound.unresolvedDimensions],
+            decisionFingerprint: bound.decisionFingerprint,
+        },
+    };
+}
+/**
+ * Runs the deterministic classifier over the graph and rebinds its
+ * decisions. See the module doc for the contract.
+ *
+ * Args:
+ *   input: graph, detector signals, classification policy, adapters.
+ *
+ * Returns:
+ *   GraphClassification: bound graph, raw result, blocking entries.
+ */
+export function runClassification(input) {
+    const refs = input.graph.resources.map(resourceRef);
+    const result = classifyResources({
+        resources: refs,
+        signals: [...input.signals],
+        authority: input.authority ? [...input.authority] : [],
+        policy: input.policy,
+        adapters: input.adapters,
+        scan: {
+            requestedPaths: input.scan?.requestedPaths ?? [],
+            scannedPaths: input.scan?.scannedPaths ?? [],
+            coverage: input.scan?.coverage,
+            configuredDetectors: input.scan?.configuredDetectors ?? 1,
+            successfulDetectors: input.scan?.successfulDetectors ?? 1,
+            findings: input.graph.findings.map((finding) => ({
+                code: finding.code,
+                locations: finding.locations,
+            })),
+            unresolved: input.graph.unresolved.map((entry) => ({ location: entry.reason.location })),
+        },
+    });
+    const byKey = new Map();
+    for (const decision of result.decisions)
+        byKey.set(bindingKey(decision), decision);
+    const resources = input.graph.resources.map((resource) => bindDecision(resource, byKey.get(bindingKey(resource))));
+    const postBindingFindings = [...input.graph.findings];
+    const byId = new Map();
+    for (const resource of resources) {
+        if (resource.id === null)
+            continue;
+        const group = byId.get(resource.id) ?? [];
+        group.push(resource);
+        byId.set(resource.id, group);
+    }
+    for (const [id, group] of byId) {
+        if (group.length < 2)
+            continue;
+        postBindingFindings.push({
+            code: 'DUPLICATE_BOUND_RESOURCE_ID',
+            detail: `resources ${group.map((resource) => resource.name).join(', ')} bind to duplicate id '${id}'`,
+            locations: group.map((resource) => resource.location),
+            detectorId: 'gateforge.classifier',
+        });
+    }
+    return {
+        graph: { ...input.graph, findings: postBindingFindings, resources: sortResources(resources) },
+        classification: result,
+        blocking: classifierBlocking(result, { ...input.graph, findings: postBindingFindings }),
+    };
+}
+/**
+ * Projects classifier blocks into policy-engine blocking entries:
+ * per-decision blocks (contradictions, incomplete proofs, unresolved
+ * delete semantics, missing adapters) plus document-level stale targets
+ * and invalid signals. Every entry names its typed code so an AI can
+ * resolve it in code — never by obtaining human approval.
+ */
+export function classifierBlocking(result, graph) {
+    const locations = new Map();
+    for (const resource of graph.resources) {
+        locations.set(bindingKey(resource), resource.location);
+    }
+    const entries = [];
+    for (const decision of result.decisions) {
+        const fallback = locations.get(bindingKey(decision)) ?? null;
+        for (const block of decision.blocks) {
+            entries.push({
+                kind: 'classification',
+                resourceId: block.resourceId ?? decision.resourceId,
+                name: decision.name,
+                detail: `[${block.code}] ${block.detail}`,
+                location: block.locations[0] ?? fallback,
+            });
+        }
+    }
+    for (const stale of result.staleTargets) {
+        entries.push({
+            kind: 'classification',
+            resourceId: null,
+            name: null,
+            detail: `[${stale.code}] ${stale.detail}`,
+            location: stale.locations[0] ?? null,
+        });
+    }
+    for (const invalid of result.invalidSignals) {
+        entries.push({
+            kind: 'classification',
+            resourceId: null,
+            name: null,
+            detail: `[${invalid.code}] ${invalid.detail}`,
+            location: invalid.locations[0] ?? null,
+        });
+    }
+    for (const unauthorized of result.unauthorizedSuppressive) {
+        entries.push({
+            kind: 'classification',
+            resourceId: null,
+            name: null,
+            detail: `[${unauthorized.code}] ${unauthorized.detail}`,
+            location: unauthorized.locations[0] ?? null,
+        });
+    }
+    return entries;
+}
+//# sourceMappingURL=bind.js.map

package/dist/classifier/bind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bind.js","sourceRoot":"","sources":["../../src/classifier/bind.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAIpE,OAAO,EACL,iBAAiB,GAIlB,MAAM,eAAe,CAAC;AAqCvB,4EAA4E;AAC5E,MAAM,UAAU,WAAW,CAAC,QAAuB;IACjD,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,UAAU,EAAE,QAAQ,CAAC,UAAU;KAChC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAKnB;IACC,OAAO,CACL,GAAG,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,MAAM,QAAQ;QAC1D,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAC7E,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,SAAS,aAAa,CAAC,SAA0B;IAC/C,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAClC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,OAAO,CACL,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;YAC9B,cAAc,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;YAClC,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CACzC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,mEAAmE;AACnE,SAAS,YAAY,CACnB,QAAuB,EACvB,QAA4C;IAE5C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,cAAc,KAAK,IAAI;QAAE,OAAO,QAAQ,CAAC;IAChF,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC;IACtC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IAC7E,OAAO;QACL,GAAG,QAAQ;QACX,EAAE,EAAE,GAAG,KAAK,IAAI,QAAQ,CAAC,IAAI,EAAE;QAC/B,KAAK;QACL,QAAQ;QACR,cAAc,EAAE;YACd,QAAQ;YACR,KAAK;YACL,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU;YACV,8DAA8D;YAC9D,kEAAkE;YAClE,qDAAqD;YACrD,GAAG,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9D;QACD,mBAAmB,EAAE;YACnB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;YACvB,eAAe,EAAE,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC;YAC3C,qBAAqB,EAAE,CAAC,GAAG,KAAK,CAAC,qBAAqB,CAAC;YACvD,qBAAqB,EAAE,CAAC,GAAG,KAAK,CAAC,qBAAqB,CAAC;YACvD,cAAc,EAAE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;YACnE,oBAAoB,EAAE,CAAC,GAAG,KAAK,CAAC,oBAAoB,CAAC;YACrD,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;SAC/C;KACe,CAAC;AACrB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAA6B;IAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,iBAAiB,CAAC;QAC/B,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;QAC3B,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE;QACtD,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,IAAI,EAAE;YACJ,cAAc,EAAE,KAAK,CAAC,IAAI,EAAE,cAAc,IAAI,EAAE;YAChD,YAAY,EAAE,KAAK,CAAC,IAAI,EAAE,YAAY,IAAI,EAAE;YAC5C,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ;YAC9B,mBAAmB,EAAE,KAAK,CAAC,IAAI,EAAE,mBAAmB,IAAI,CAAC;YACzD,mBAAmB,EAAE,KAAK,CAAC,IAAI,EAAE,mBAAmB,IAAI,CAAC;YACzD,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC/C,IAAI,EAAE,OAAO,CAAC,IAAI;gBAClB,SAAS,EAAE,OAAO,CAAC,SAAS;aAC7B,CAAC,CAAC;YACH,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;SACzF;KACF,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkC,CAAC;IACxD,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS;QAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;IACnF,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CACvD,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CACxD,CAAC;IACF,MAAM,mBAAmB,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,mBAAmB,CAAC,IAAI,CAAC;YACvB,IAAI,EAAE,6BAA6B;YACnC,MAAM,EAAE,aAAa,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,0BAA0B,EAAE,GAAG;YACrG,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC;YACrD,UAAU,EAAE,sBAAsB;SACnC,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,KAAK,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,mBAAmB,EAAE,SAAS,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;QAC7F,cAAc,EAAE,MAAM;QACtB,QAAQ,EAAE,kBAAkB,CAAC,MAAM,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,mBAAmB,EAAE,CAAC;KACxF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAA4B,EAC5B,KAAoB;IAEpB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACvC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC;QAC7D,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,gBAAgB;gBACtB,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU;gBACnD,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE;gBACzC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,QAAQ;aACzC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,gBAAgB;YACtB,UAAU,EAAE,IAAI;YAChB,IAAI,EAAE,IAAI;YACV,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE;YACzC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI;SACrC,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,gBAAgB;YACtB,UAAU,EAAE,IAAI;YAChB,IAAI,EAAE,IAAI;YACV,MAAM,EAAE,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE;YAC7C,QAAQ,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI;SACvC,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,uBAAuB,EAAE,CAAC;QAC1D,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,gBAAgB;YACtB,UAAU,EAAE,IAAI;YAChB,IAAI,EAAE,IAAI;YACV,MAAM,EAAE,IAAI,YAAY,CAAC,IAAI,KAAK,YAAY,CAAC,MAAM,EAAE;YACvD,QAAQ,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI;SAC5C,CAAC,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}