@jmtrin/opencode-kevin 0.7.0 → 0.8.0

package/dist/plugin/okf.d.ts

@@ -0,0 +1,107 @@
+/** OKF v2 format version marker, written on the first header line. */
+export declare const OKF_VERSION = 2;
+/** A single canonicalized entry line may not exceed this many bytes. */
+export declare const MAX_LINE_BYTES = 4096;
+/** A serialized corpus may not exceed this many entries. */
+export declare const MAX_ENTRIES = 2000;
+export type OkfOp = "assert" | "tombstone";
+/**
+ * A v2 entry. The field set is plan §5.3/§5.4: the two integer
+ * counters (`evidence`, `recurrence`) are transported and
+ * `confidence` is DERIVED at read time — the file contains no
+ * floats at all, so two machines computing a confidence slightly
+ * differently still emit byte-identical lines.
+ */
+export interface OkfEntry {
+    entry_id: string;
+    type: "decision" | "rule" | "pattern" | "solution";
+    statement: string;
+    scope: string | null;
+    evidence: number;
+    recurrence: number;
+    origin: string;
+    author_hash: string | null;
+    op: OkfOp;
+    created_at: string;
+    supersedes: string | null;
+}
+/**
+ * Canonical JSON of an entry: keys in alphabetical order, no space
+ * argument, integers only (no float is ever written — plan §5.3).
+ * The object is constructed explicitly so the source object's
+ * insertion order can never leak into the bytes.
+ */
+export declare function canonicalize(e: OkfEntry): string;
+/**
+ * Emit the v2 file: three `#` header lines, then every entry sorted
+ * ascending by `entry_id`, one per line, LF endings, exactly one
+ * terminating newline. Entries over MAX_LINE_BYTES (measured in
+ * BYTES — a Japanese statement passes a `.length` check and fails a
+ * byte check) and corpora over MAX_ENTRIES are refused, not
+ * truncated (plan §5.3, physical rules).
+ */
+export declare function serialize(entries: OkfEntry[], repoId: string, version: string): string;
+/**
+ * Group both corpora by `entry_id`, fold each group through `join()`,
+ * and return the result sorted ascending by `entry_id`. Order of the
+ * inputs does not matter: join() is commutative, and the fold order is
+ * the only place input order could leak in — it cannot, by algebra.
+ */
+export declare function merge(a: OkfEntry[], b: OkfEntry[]): OkfEntry[];
+/**
+ * Derived, never serialized — reuses the v0.4.0 two-sided confidence
+ * formula verbatim (plan §5.4). A lesson that keeps recurring is
+ * DEMOTED rather than merely un-promoted; shared and local memories
+ * are repriced identically by the same formula.
+ */
+export declare function deriveConfidence(e: OkfEntry): number;
+export interface RejectedLine {
+    line: number;
+    reason: string;
+}
+export interface ParseResult {
+    version: number;
+    repoId: string | null;
+    /** Folded via join() and sorted ascending by entry_id. */
+    entries: OkfEntry[];
+    /** parse never throws; bad lines are reported. */
+    rejected: RejectedLine[];
+    /** Duplicate entry_ids collapsed by join(). */
+    folded: number;
+}
+/**
+ * v0.8.0 (K8-013 / plan §5.4, D8-13) — the field lattice. Every field
+ * resolves through a max, a min, or an absorbing boolean OR over a
+ * totally ordered set; there is no "prefer the newer" anywhere.
+ * Precondition: `a.entry_id === b.entry_id`.
+ */
+export declare function join(a: OkfEntry, b: OkfEntry): OkfEntry;
+/**
+ * parse() is a TOTAL function — it never throws, on any input,
+ * including binary (D8-14). The file is expected to arrive damaged:
+ * a conflict resolution leaves `<<<<<<< HEAD` markers, an editor
+ * truncates the last line, a merge tool mangles an encoding. Every
+ * unusable line becomes a `RejectedLine`; the good entries survive.
+ *
+ * Reason taxonomy (closed): not_okf, version_ahead, bad_json,
+ * missing_field, wrong_type, id_mismatch, unknown_op, line_too_long,
+ * corpus_too_large.
+ */
+export declare function parse(text: string): ParseResult;
+/**
+ * Compute the identity of an OKF entry: `fnv1a64("okf:v2\0" + type +
+ * "\0" + statement + "\0" + (scope ?? ""))`.
+ *
+ * D8-05 — deliberately NOT `fingerprint()`:
+ *  - it salts with `project_id`, so every clone would produce a
+ *    different id for the same rule, the shared file would accumulate
+ *    one entry per developer per rule, and the merge fold would never
+ *    once fire;
+ *  - it runs `normalize()`, which lowercases and rewrites
+ *    `path.ext:line:col` — both destructive for a curated statement,
+ *    where casing and file paths carry meaning.
+ *
+ * NUL separators keep (`rule`, "ab", "c") distinct from
+ * ("rule", "a", "bc") — plain concatenation could never.
+ */
+export declare function computeEntryId(type: string, statement: string, scope?: string | null): string;

package/dist/plugin/okf.js

@@ -0,0 +1,304 @@
+// ============================================================
+// Kevin 0.8.0 — OKF v2 codec (F2, K8-010 … K8-015)
+// ============================================================
+// The Open Kevin Format: the committed, shareable artifact of the
+// shared layer (plan §3.3). Everything in this module is a pure
+// function — no database, no filesystem, no clock. The format is
+// the release: if `join()` is not a semilattice then silent git
+// merges, order-independent imports and correct both-sides
+// conflict resolution all evaporate.
+//
+// Entry ids are deliberately the THIRD fingerprint identity
+// dimension in the codebase (v0.7.0's Principle 26; plan §3.3's
+// table). The first is `fingerprint()` (error text, salted with
+// `project_id`, normalized) and the second is the convention /
+// decision fingerprints of v0.7.0 (derived from the normalized
+// statement). This one is unsalted and un-normalized, and it is
+// the ONLY cross-machine-stable dimension in the schema.
+// ============================================================
+import { computeConfidence } from "./confidence.js";
+import { fnv1a64 } from "./fingerprint.js";
+/** OKF v2 format version marker, written on the first header line. */
+export const OKF_VERSION = 2;
+/** A single canonicalized entry line may not exceed this many bytes. */
+export const MAX_LINE_BYTES = 4096;
+/** A serialized corpus may not exceed this many entries. */
+export const MAX_ENTRIES = 2000;
+const OKF_KEY_ORDER = [
+    "author_hash",
+    "created_at",
+    "entry_id",
+    "evidence",
+    "op",
+    "origin",
+    "recurrence",
+    "scope",
+    "statement",
+    "supersedes",
+    "type",
+];
+/**
+ * Canonical JSON of an entry: keys in alphabetical order, no space
+ * argument, integers only (no float is ever written — plan §5.3).
+ * The object is constructed explicitly so the source object's
+ * insertion order can never leak into the bytes.
+ */
+export function canonicalize(e) {
+    const ordered = {};
+    for (const key of OKF_KEY_ORDER) {
+        ordered[key] = e[key];
+    }
+    return JSON.stringify(ordered);
+}
+/**
+ * Emit the v2 file: three `#` header lines, then every entry sorted
+ * ascending by `entry_id`, one per line, LF endings, exactly one
+ * terminating newline. Entries over MAX_LINE_BYTES (measured in
+ * BYTES — a Japanese statement passes a `.length` check and fails a
+ * byte check) and corpora over MAX_ENTRIES are refused, not
+ * truncated (plan §5.3, physical rules).
+ */
+export function serialize(entries, repoId, version) {
+    if (entries.length > MAX_ENTRIES) {
+        throw new Error(`okf: corpus of ${entries.length} entries exceeds MAX_ENTRIES (${MAX_ENTRIES})`);
+    }
+    const sorted = [...entries].sort((a, b) => a.entry_id < b.entry_id ? -1 : a.entry_id > b.entry_id ? 1 : 0);
+    const lines = [
+        `#okf ${OKF_VERSION}`,
+        `#repo ${repoId}`,
+        `#generated-by opencode-kevin/${version}`,
+    ];
+    for (const e of sorted) {
+        const line = canonicalize(e);
+        if (Buffer.byteLength(line, "utf8") > MAX_LINE_BYTES) {
+            throw new Error(`okf: entry ${e.entry_id} canonicalizes to ${Buffer.byteLength(line, "utf8")} bytes, over MAX_LINE_BYTES (${MAX_LINE_BYTES})`);
+        }
+        lines.push(line);
+    }
+    return `${lines.join("\n")}\n`;
+}
+/**
+ * Group both corpora by `entry_id`, fold each group through `join()`,
+ * and return the result sorted ascending by `entry_id`. Order of the
+ * inputs does not matter: join() is commutative, and the fold order is
+ * the only place input order could leak in — it cannot, by algebra.
+ */
+export function merge(a, b) {
+    const byId = new Map();
+    for (const e of [...a, ...b]) {
+        const existing = byId.get(e.entry_id);
+        byId.set(e.entry_id, existing ? join(existing, e) : e);
+    }
+    return [...byId.values()].sort((x, y) => x.entry_id < y.entry_id ? -1 : x.entry_id > y.entry_id ? 1 : 0);
+}
+/**
+ * Derived, never serialized — reuses the v0.4.0 two-sided confidence
+ * formula verbatim (plan §5.4). A lesson that keeps recurring is
+ * DEMOTED rather than merely un-promoted; shared and local memories
+ * are repriced identically by the same formula.
+ */
+export function deriveConfidence(e) {
+    return computeConfidence(e.evidence, e.recurrence);
+}
+const OKF_TYPES = new Set(["decision", "rule", "pattern", "solution"]);
+function pickMin(a, b) {
+    if (a === null)
+        return b;
+    if (b === null)
+        return a;
+    return a <= b ? a : b;
+}
+/**
+ * v0.8.0 (K8-013 / plan §5.4, D8-13) — the field lattice. Every field
+ * resolves through a max, a min, or an absorbing boolean OR over a
+ * totally ordered set; there is no "prefer the newer" anywhere.
+ * Precondition: `a.entry_id === b.entry_id`.
+ */
+export function join(a, b) {
+    return {
+        entry_id: a.entry_id,
+        // Equal by construction unless a hash collision — resolve by
+        // lexicographic min so the function stays total and deterministic.
+        type: a.type <= b.type ? a.type : b.type,
+        statement: a.statement <= b.statement ? a.statement : b.statement,
+        scope: pickMin(a.scope, b.scope),
+        evidence: Math.max(a.evidence, b.evidence),
+        recurrence: Math.max(a.recurrence, b.recurrence),
+        origin: a.origin <= b.origin ? a.origin : b.origin,
+        author_hash: pickMin(a.author_hash, b.author_hash),
+        // Tombstone absorbs: no undelete, no timestamp tiebreak (D8-09).
+        op: a.op === "tombstone" || b.op === "tombstone" ? "tombstone" : "assert",
+        // Birthday semantics: min is the only choice stable under replay.
+        created_at: a.created_at <= b.created_at ? a.created_at : b.created_at,
+        supersedes: pickMin(a.supersedes, b.supersedes),
+    };
+}
+/**
+ * parse() is a TOTAL function — it never throws, on any input,
+ * including binary (D8-14). The file is expected to arrive damaged:
+ * a conflict resolution leaves `<<<<<<< HEAD` markers, an editor
+ * truncates the last line, a merge tool mangles an encoding. Every
+ * unusable line becomes a `RejectedLine`; the good entries survive.
+ *
+ * Reason taxonomy (closed): not_okf, version_ahead, bad_json,
+ * missing_field, wrong_type, id_mismatch, unknown_op, line_too_long,
+ * corpus_too_large.
+ */
+export function parse(text) {
+    const rejected = [];
+    const reject = (line, reason) => {
+        rejected.push({ line, reason });
+    };
+    // A UTF-8 BOM breaks the `#okf ` prefix check; strip it first.
+    const body = text.replace(/^\uFEFF/, "");
+    const lines = body.split(/\r\n|\r|\n/);
+    let version = 0;
+    let repoId = null;
+    if (!(lines[0]?.startsWith("#okf ") ?? false)) {
+        reject(1, "not_okf");
+        return { version, repoId, entries: [], rejected, folded: 0 };
+    }
+    const declared = Number(lines[0].slice(5));
+    version = Number.isInteger(declared) && declared >= 0 ? declared : 0;
+    if (version > OKF_VERSION) {
+        // Guessing at a future format's semantics is how corpora get
+        // corrupted — refuse the whole file, never a best-effort parse.
+        return {
+            version,
+            repoId: null,
+            entries: [],
+            rejected: [{ line: 1, reason: "version_ahead" }],
+            folded: 0,
+        };
+    }
+    if (lines[1]?.startsWith("#repo ")) {
+        repoId = lines[1].slice(6) || null;
+    }
+    const byId = new Map();
+    let folded = 0;
+    let accepted = 0;
+    for (let i = 2; i < lines.length; i++) {
+        const line = lines[i];
+        if (line === "")
+            continue; // trailing newline / blank lines
+        if (line.startsWith("#"))
+            continue; // header/comment lines
+        const lineNo = i + 1;
+        if (Buffer.byteLength(line, "utf8") > MAX_LINE_BYTES) {
+            reject(lineNo, "line_too_long");
+            continue;
+        }
+        let raw;
+        try {
+            raw = JSON.parse(line);
+        }
+        catch {
+            reject(lineNo, "bad_json");
+            continue;
+        }
+        if (typeof raw !== "object" || raw === null) {
+            reject(lineNo, "bad_json");
+            continue;
+        }
+        const o = raw;
+        const missing = (k) => o[k] === undefined;
+        const wrong = (k, ok) => !missing(k) && !ok(o[k]);
+        const stringField = (k) => !wrong(k, (v) => typeof v === "string");
+        const nullableString = (k) => !wrong(k, (v) => v === null || typeof v === "string");
+        const intField = (k) => !wrong(k, (v) => typeof v === "number" && Number.isInteger(v) && v >= 0);
+        if (missing("entry_id"))
+            reject(lineNo, "missing_field");
+        else if (!stringField("entry_id"))
+            reject(lineNo, "wrong_type");
+        else if (missing("type"))
+            reject(lineNo, "missing_field");
+        else if (typeof o.type !== "string" || !OKF_TYPES.has(o.type))
+            reject(lineNo, "wrong_type");
+        else if (missing("statement"))
+            reject(lineNo, "missing_field");
+        else if (!stringField("statement"))
+            reject(lineNo, "wrong_type");
+        else if (!nullableString("scope"))
+            reject(lineNo, "wrong_type");
+        else if (missing("evidence"))
+            reject(lineNo, "missing_field");
+        else if (!intField("evidence"))
+            reject(lineNo, "wrong_type");
+        else if (missing("recurrence"))
+            reject(lineNo, "missing_field");
+        else if (!intField("recurrence"))
+            reject(lineNo, "wrong_type");
+        else if (missing("origin"))
+            reject(lineNo, "missing_field");
+        else if (!stringField("origin"))
+            reject(lineNo, "wrong_type");
+        else if (!nullableString("author_hash"))
+            reject(lineNo, "wrong_type");
+        else if (missing("op"))
+            reject(lineNo, "missing_field");
+        else if (o.op !== "assert" && o.op !== "tombstone")
+            reject(lineNo, "unknown_op");
+        else if (missing("created_at"))
+            reject(lineNo, "missing_field");
+        else if (!stringField("created_at"))
+            reject(lineNo, "wrong_type");
+        else if (!nullableString("supersedes"))
+            reject(lineNo, "wrong_type");
+        else {
+            // The tamper-evident check: a hand-edited statement without
+            // an updated entry_id is caught here, not silently ranked.
+            const recomputed = computeEntryId(o.type, o.statement, (o.scope ?? null));
+            if (recomputed !== o.entry_id) {
+                reject(lineNo, "id_mismatch");
+                continue;
+            }
+            const e = {
+                entry_id: o.entry_id,
+                type: o.type,
+                statement: o.statement,
+                scope: (o.scope ?? null),
+                evidence: o.evidence,
+                recurrence: o.recurrence,
+                origin: o.origin,
+                author_hash: (o.author_hash ?? null),
+                op: o.op,
+                created_at: o.created_at,
+                supersedes: (o.supersedes ?? null),
+            };
+            const existing = byId.get(e.entry_id);
+            if (existing) {
+                byId.set(e.entry_id, join(existing, e));
+                folded++;
+                continue;
+            }
+            if (accepted >= MAX_ENTRIES) {
+                reject(lineNo, "corpus_too_large");
+                continue;
+            }
+            byId.set(e.entry_id, e);
+            accepted++;
+        }
+    }
+    const entries = [...byId.values()].sort((a, b) => a.entry_id < b.entry_id ? -1 : a.entry_id > b.entry_id ? 1 : 0);
+    return { version, repoId, entries, rejected, folded };
+}
+/**
+ * Compute the identity of an OKF entry: `fnv1a64("okf:v2\0" + type +
+ * "\0" + statement + "\0" + (scope ?? ""))`.
+ *
+ * D8-05 — deliberately NOT `fingerprint()`:
+ *  - it salts with `project_id`, so every clone would produce a
+ *    different id for the same rule, the shared file would accumulate
+ *    one entry per developer per rule, and the merge fold would never
+ *    once fire;
+ *  - it runs `normalize()`, which lowercases and rewrites
+ *    `path.ext:line:col` — both destructive for a curated statement,
+ *    where casing and file paths carry meaning.
+ *
+ * NUL separators keep (`rule`, "ab", "c") distinct from
+ * ("rule", "a", "bc") — plain concatenation could never.
+ */
+export function computeEntryId(type, statement, scope) {
+    return fnv1a64(`okf:v2\u0000${type}\u0000${statement}\u0000${scope ?? ""}`);
+}
+//# sourceMappingURL=okf.js.map

package/dist/plugin/okf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"okf.js","sourceRoot":"","sources":["../../plugin/okf.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,kEAAkE;AAClE,gEAAgE;AAChE,iEAAiE;AACjE,gEAAgE;AAChE,2DAA2D;AAC3D,qCAAqC;AACrC,EAAE;AACF,4DAA4D;AAC5D,gEAAgE;AAChE,gEAAgE;AAChE,+DAA+D;AAC/D,+DAA+D;AAC/D,gEAAgE;AAChE,yDAAyD;AACzD,+DAA+D;AAE/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAE3C,sEAAsE;AACtE,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAE7B,wEAAwE;AACxE,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AAEnC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,WAAW,GAAG,IAAI,CAAC;AAyBhC,MAAM,aAAa,GAAG;IACrB,aAAa;IACb,YAAY;IACZ,UAAU;IACV,UAAU;IACV,IAAI;IACJ,QAAQ;IACR,YAAY;IACZ,OAAO;IACP,WAAW;IACX,YAAY;IACZ,MAAM;CACG,CAAC;AAEX;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,CAAW;IACvC,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CACxB,OAAmB,EACnB,MAAc,EACd,OAAe;IAEf,IAAI,OAAO,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CACd,kBAAkB,OAAO,CAAC,MAAM,iCAAiC,WAAW,GAAG,CAC/E,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAC;IACF,MAAM,KAAK,GAAa;QACvB,QAAQ,WAAW,EAAE;QACrB,SAAS,MAAM,EAAE;QACjB,gCAAgC,OAAO,EAAE;KACzC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,cAAc,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CACd,cAAc,CAAC,CAAC,QAAQ,qBAAqB,MAAM,CAAC,UAAU,CAC7D,IAAI,EACJ,MAAM,CACN,gCAAgC,cAAc,GAAG,CAClD,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CAAC,CAAa,EAAE,CAAa;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACvC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW;IAC3C,OAAO,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;AACpD,CAAC;AAkBD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;AAEvE,SAAS,OAAO,CAAC,CAAgB,EAAE,CAAgB;IAClD,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACzB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAC,CAAW,EAAE,CAAW;IAC5C,OAAO;QACN,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,6DAA6D;QAC7D,mEAAmE;QACnE,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QACxC,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;QACjE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC;QAChC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC;QAC1C,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC;QAChD,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;QAClD,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC;QAClD,iEAAiE;QACjE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,WAAW,IAAI,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ;QACzE,kEAAkE;QAClE,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;QACtE,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC;KAC/C,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CAAC,IAAY;IACjC,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,MAAc,EAAQ,EAAE;QACrD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IACjC,CAAC,CAAC;IAEF,+DAA+D;IAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAEvC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAkB,IAAI,CAAC;IACjC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QACrB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC9D,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,IAAI,OAAO,GAAG,WAAW,EAAE,CAAC;QAC3B,6DAA6D;QAC7D,gEAAgE;QAChE,OAAO;YACN,OAAO;YACP,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;YAChD,MAAM,EAAE,CAAC;SACT,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACpC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,EAAE;YAAE,SAAS,CAAC,iCAAiC;QAC5D,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,uBAAuB;QAC3D,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,cAAc,EAAE,CAAC;YACtD,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YAChC,SAAS;QACV,CAAC;QACD,IAAI,GAAY,CAAC;QACjB,IAAI,CAAC;YACJ,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACR,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAC3B,SAAS;QACV,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YAC7C,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAC3B,SAAS;QACV,CAAC;QACD,MAAM,CAAC,GAAG,GAA8B,CAAC;QAEzC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;QAC3D,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAA2B,EAAW,EAAE,CACjE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,WAAW,GAAG,CAAC,CAAS,EAAW,EAAE,CAC1C,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;QACzC,MAAM,cAAc,GAAG,CAAC,CAAS,EAAW,EAAE,CAC7C,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAW,EAAE,CACvC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAE1E,IAAI,OAAO,CAAC,UAAU,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACpD,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAC3D,IAAI,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACrD,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5D,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aACzB,IAAI,OAAO,CAAC,WAAW,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aAC1D,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAC5D,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAC3D,IAAI,OAAO,CAAC,UAAU,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACzD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aACxD,IAAI,OAAO,CAAC,YAAY,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aAC3D,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAC1D,IAAI,OAAO,CAAC,QAAQ,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACvD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aACzD,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aACjE,IAAI,OAAO,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACnD,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,WAAW;YACjD,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aACzB,IAAI,OAAO,CAAC,YAAY,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aAC3D,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAC7D,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;aAChE,CAAC;YACL,4DAA4D;YAC5D,2DAA2D;YAC3D,MAAM,UAAU,GAAG,cAAc,CAChC,CAAC,CAAC,IAAc,EAChB,CAAC,CAAC,SAAmB,EACrB,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAkB,CAClC,CAAC;YACF,IAAI,UAAU,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;gBAC9B,SAAS;YACV,CAAC;YACD,MAAM,CAAC,GAAa;gBACnB,QAAQ,EAAE,CAAC,CAAC,QAAkB;gBAC9B,IAAI,EAAE,CAAC,CAAC,IAAwB;gBAChC,SAAS,EAAE,CAAC,CAAC,SAAmB;gBAChC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAkB;gBACzC,QAAQ,EAAE,CAAC,CAAC,QAAkB;gBAC9B,UAAU,EAAE,CAAC,CAAC,UAAoB;gBAClC,MAAM,EAAE,CAAC,CAAC,MAAgB;gBAC1B,WAAW,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,IAAI,CAAkB;gBACrD,EAAE,EAAE,CAAC,CAAC,EAAW;gBACjB,UAAU,EAAE,CAAC,CAAC,UAAoB;gBAClC,UAAU,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,CAAkB;aACnD,CAAC;YACF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,EAAE,CAAC;gBACT,SAAS;YACV,CAAC;YACD,IAAI,QAAQ,IAAI,WAAW,EAAE,CAAC;gBAC7B,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;gBACnC,SAAS;YACV,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACxB,QAAQ,EAAE,CAAC;QACZ,CAAC;IACF,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChD,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAC;IACF,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AACvD,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,cAAc,CAC7B,IAAY,EACZ,SAAiB,EACjB,KAAqB;IAErB,OAAO,OAAO,CAAC,eAAe,IAAI,SAAS,SAAS,SAAS,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC;AAC7E,CAAC"}