@quickchatai/quickreview 0.0.0-stage → 1.2.0

package/dist/src/archive/storepass.js

@@ -0,0 +1,409 @@
+// One STORE's archive writer (docs/archiving.md §5, §7.3): the
+// files that belong to no PR — the overseer's non-current transcripts
+// (`overseer.ts`) and pi's global session store (`piglobal.ts`) — go through
+// the SAME per-file protocol as a PR's (`gzfile.ts`), into one archive dir
+// with its own append-only manifest (`manifest.ts`), SHARDED — a write
+// rewrites one shard of at most STORE_SHARD_ENTRIES entries, never the
+// store's whole history.
+//
+//   - Each file: stop check, identity re-read, disk check, then `archiveFile`
+//     (sha256 + gzip into `.partial`, fsync, gunzip-verify, re-lstat, utimes,
+//     rename, dir fsync), then its manifest entry — durable before the next.
+//   - A file the manifest already holds with the SAME identity (a crash
+//     between its entry and its unlink) is never read again: unlink only.
+//   - An orphan gzip at the name (a crash between its rename and its entry)
+//     is adopted when it decompresses to the live bytes, kept under its own
+//     entry when it decompresses to other bytes (an earlier version), and
+//     redone only when it does not decompress at all — the PR pass's rule.
+//   - Unlinks come last, each only while the caller's re-check still allows
+//     it and the file's identity is the one hashed; then the stamps. A
+//     restore waiting for the mutex stops them (an unlink is a file
+//     boundary); a spent budget or a load hold does not.
+//
+// Nothing here spawns, injects, wakes or kills a session (rule 9), and
+// nothing reads or writes memory.
+import { mkdir, readFile, readdir } from "node:fs/promises";
+import { join } from "node:path";
+import { yieldToLoop } from "@quickchatai/pi-quickreview/src/yieldloop.js";
+import { archiveStamp, freshPassId, heldAsRecorded, identityFields, packedOf, placeArchive, placementOutcome, bytesHeld, } from "./archivewrite.js";
+import { sameIdentity, writeTextAtomic } from "./fsutil.js";
+import { identityOrNull, sweepPartials, unlinkIfIdentity, } from "./gzfile.js";
+import { MANIFEST_FILE, ManifestUnreadable, assertAppendOnly, cloneManifest, emptyManifest, indexEntries, manifestText, parseManifestText, placedArchive, } from "./manifest.js";
+import { SpanMeter } from "./prfiles.js";
+export const emptyStoreResult = (outcome, reason = null) => ({
+    outcome,
+    reason,
+    archived: 0,
+    bytesIn: 0,
+    bytesOut: 0,
+    removed: 0,
+    duplicatesRemoved: 0,
+    verifyFailures: 0,
+    keptLive: 0,
+});
+/** Settle a pass's outcome from how it ended: `partial` when it stopped
+ * (`stop` names why), was left incomplete (a verify failure named before a
+ * plain `incomplete`) or `waits` by design (that reason last); else `done`. */
+export function endStorePass(res, stop, incomplete, waits = null) {
+    res.outcome = stop || incomplete || waits ? "partial" : "done";
+    res.reason =
+        stop ?? (incomplete ? (res.verifyFailures > 0 ? "verify_failed" : "incomplete") : waits);
+    return res;
+}
+export { archiveFileSize, unlinkStopOf } from "./archivewrite.js";
+/** A pass with nothing to move: when `deps.settle` asks, the manifest is
+ * opened and every entry whose source is gone stamped (a crash between the
+ * last unlink and its stamp leaves one, and no later pass may come). Returns
+ * the pass's result: `none`, or `held` when the manifest cannot be read. */
+export async function settleStore(deps) {
+    if (!deps.settle)
+        return emptyStoreResult("none");
+    const writer = await StoreWriter.open(deps);
+    if (!writer)
+        return emptyStoreResult("held", "manifest_unreadable");
+    await writer.finish(new Set(), []);
+    return emptyStoreResult("none");
+}
+/**
+ * A store's manifest is SHARDED: `manifest.json` holds its first
+ * STORE_SHARD_ENTRIES entries, `manifest-2.json` the next, and so on — each
+ * shard a format-1 manifest of its own, append-only, written whole by tmp +
+ * fsync + rename + directory fsync. A store only grows (the size of pi's
+ * global store is unmeasured), and a JSON file is rewritten whole on every
+ * append, so a write rewrites only the shard it touches: its synchronous
+ * work — the copy, the append-only check, the stringify — is bounded by one
+ * shard, never by the store's history. A PR's manifest is not sharded: it
+ * holds one PR.
+ */
+export const STORE_SHARD_ENTRIES = 500;
+/** The file name of a store manifest's `k`-th shard (1-based). */
+export const shardName = (k) => (k === 1 ? MANIFEST_FILE : `manifest-${k}.json`);
+const SHARD_RE = /^manifest(?:-([1-9]\d*))?\.json$/;
+/**
+ * Every shard of the store manifest in `dir`, in order; none when there is
+ * none. ManifestUnreadable when one cannot be read or parsed, or when a shard
+ * in the run is missing (`manifest-3.json` beside no `manifest-2.json`) — a
+ * store's record is never read as fewer entries than it has. `measure` wraps
+ * each synchronous parse.
+ */
+export async function readStoreShards(dir, measure = (fn) => fn()) {
+    let names;
+    try {
+        names = await readdir(dir);
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return [];
+        throw new ManifestUnreadable(`${dir}: ${err.message}`);
+    }
+    const ks = [];
+    for (const n of names) {
+        const m = SHARD_RE.exec(n);
+        if (!m || m[1] === "1")
+            continue; // `manifest-1.json` is no shard's name
+        ks.push(m[1] ? Number(m[1]) : 1);
+    }
+    ks.sort((a, b) => a - b);
+    for (let i = 0; i < ks.length; i++)
+        if (ks[i] !== i + 1)
+            throw new ManifestUnreadable(`${join(dir, shardName(i + 1))} is missing beside ${shardName(ks.at(-1))} — the store's record is incomplete`);
+    const out = [];
+    for (const k of ks) {
+        const path = join(dir, shardName(k));
+        let text;
+        try {
+            text = await readFile(path, "utf8");
+        }
+        catch (err) {
+            throw new ManifestUnreadable(`${path}: ${err.message}`);
+        }
+        out.push({ name: shardName(k), m: measure(() => parseManifestText(text, path)) });
+    }
+    return out;
+}
+const fileish = (e) => e.kind === "transcript" || e.kind === "file";
+/**
+ * The manifest of one store and the appends a pass makes to it. Opened once
+ * per pass; every append is durable before the pass goes on.
+ */
+export class StoreWriter {
+    deps;
+    startedAt;
+    shards;
+    /** The latest record per source, across every shard. */
+    index = new Map();
+    /** Every archive name an entry references, across every shard. */
+    refs = new Set();
+    duplicates = new Set();
+    /** The shards this pass wrote to. */
+    touched = new Set();
+    meter;
+    passId;
+    result = emptyStoreResult("done");
+    constructor(deps, shards, startedAt, meter) {
+        this.deps = deps;
+        this.startedAt = startedAt;
+        this.shards = shards;
+        this.meter = meter;
+        const base = archiveStamp(deps.now());
+        const taken = meter.measure(() => new Set(shards.flatMap((s) => s.m.passes.map((p) => p.id))));
+        this.passId = freshPassId(base, (id) => taken.has(id));
+    }
+    /** Open the store's manifest (after sweeping stray `.partial`s — only the
+     * archiver writes this dir, under its strict mutex). An unreadable
+     * manifest is never overwritten: null, and the caller holds the store. */
+    static async open(deps) {
+        await sweepPartials(deps.dir);
+        const meter = deps.meter ?? new SpanMeter();
+        let shards;
+        try {
+            shards = await readStoreShards(deps.dir, (fn) => meter.measure(fn));
+        }
+        catch (err) {
+            if (!(err instanceof ManifestUnreadable))
+                throw err;
+            deps.verifyFailed(`manifest:${deps.subject}`, `archive ${deps.subject}: ${err.message} — the store is held and its manifest left as found`);
+            return null;
+        }
+        const w = new StoreWriter(deps, shards, deps.now().toISOString(), meter);
+        // The index, one shard at a time with a yield between: a large store is
+        // never indexed in one synchronous span.
+        for (const s of shards) {
+            meter.measure(() => w.absorb(s.m.entries));
+            await yieldToLoop();
+        }
+        return w;
+    }
+    absorb(entries) {
+        indexEntries(this.index, entries);
+        for (const e of entries) {
+            if (e.kind === "duplicate_removed")
+                this.duplicates.add(JSON.stringify([e.path, e.bytes, e.sha256]));
+            const a = placedArchive(e);
+            if (a !== null)
+                this.refs.add(a);
+        }
+    }
+    /** The latest record per source. */
+    records() {
+        return this.index;
+    }
+    /** Every entry, across the shards, in order. */
+    *entries() {
+        for (const s of this.shards)
+            yield* s.m.entries;
+    }
+    /**
+     * Rewrite shard `k`: this pass's record added to it when missing, then
+     * `mutate`; append-only, durable before the pass goes on. The copy, the
+     * check and the stringify are one measured span, bounded by the shard.
+     */
+    async rewrite(k, mutate) {
+        const shard = this.shards[k];
+        const { next, text } = this.meter.measure(() => {
+            const next = cloneManifest(shard.m);
+            if (!next.passes.some((p) => p.id === this.passId))
+                next.passes.push({ id: this.passId, kind: "archive", started_at: this.startedAt });
+            mutate(next);
+            assertAppendOnly(shard.m, next);
+            return { next, text: manifestText(next) };
+        });
+        await mkdir(this.deps.dir, { recursive: true });
+        await writeTextAtomic(join(this.deps.dir, shard.name), text);
+        shard.m = next;
+        this.touched.add(k);
+    }
+    /** Append entries — to the last shard up to its room, the rest to new
+     * ones — each shard's write durable before the next. */
+    async append(...entries) {
+        let rest = entries;
+        while (rest.length > 0) {
+            const last = this.shards.at(-1);
+            if (!last || last.m.entries.length >= STORE_SHARD_ENTRIES)
+                this.shards.push({
+                    name: shardName(this.shards.length + 1),
+                    m: emptyManifest(this.deps.subject),
+                });
+            const room = STORE_SHARD_ENTRIES - this.shards.at(-1).m.entries.length;
+            const chunk = rest.slice(0, room);
+            rest = rest.slice(room);
+            await this.rewrite(this.shards.length - 1, (next) => {
+                next.entries.push(...chunk);
+            });
+            this.meter.measure(() => this.absorb(chunk));
+        }
+    }
+    /** Is `f` archived already with exactly its identity (unlink only)? */
+    async alreadyHeld(f) {
+        const rec = this.index.get(f.source);
+        return (await heldAsRecorded(this.deps.dir, rec, f.identity)) ? rec : null;
+    }
+    /**
+     * One file through the protocol (or adoption of the orphan gzip already at
+     * its name — `placeArchive`). `entryOf` builds the entry for the name used.
+     * Returns the placed archive, or why not.
+     */
+    async archiveOne(f, entryOf, prefixBytes) {
+        const { deps } = this;
+        const r = await placeArchive({
+            path: f.path,
+            dir: deps.dir,
+            base: f.archive,
+            source: f.source,
+            who: deps.subject,
+            opts: {
+                level: deps.level,
+                bytesPerS: deps.bytesPerS,
+                signal: deps.signal,
+                identity: f.identity,
+                ...(prefixBytes !== undefined ? { prefixBytes } : {}),
+                ...(deps.step ? { step: deps.step } : {}),
+            },
+            refs: () => this.refs,
+            heldAlready: (sha256, bytes) => bytesHeld(this.entries(), deps.dir, sha256, bytes),
+            keep: (dest, p) => this.append(entryOf(dest, p)),
+            log: (m) => deps.log(m),
+        });
+        return placementOutcome(r, (detail) => {
+            this.result.verifyFailures += 1;
+            deps.verifyFailed(`file:${deps.subject}:${f.source}`, `archive ${deps.subject}: ${detail} — the source is kept`);
+        });
+    }
+    /** A transcript entry of this pass for `f`. */
+    transcriptEntry(f, extra = {}) {
+        return (archive, p) => ({
+            pass: this.passId,
+            kind: "transcript",
+            source: f.source,
+            archive,
+            ...p,
+            verified_at: this.deps.now().toISOString(),
+            ...extra,
+        });
+    }
+    /**
+     * Archive `files` in order: each through the protocol (or recognised as
+     * held already), its entry appended. Returns the unlinks the caller may
+     * make, and why the loop stopped (null = it went through every file).
+     */
+    async archiveAll(files) {
+        const unlinks = [];
+        let stop = null;
+        let incomplete = false;
+        for (const f of files) {
+            stop = this.deps.stopReason();
+            if (stop)
+                break;
+            if (!sameIdentity(f.identity, await identityOrNull(f.path))) {
+                // Moved since it was listed: left live, the next pass reads it again.
+                incomplete = true;
+                continue;
+            }
+            if (await this.alreadyHeld(f)) {
+                unlinks.push({ path: f.path, source: f.source, identity: identityFields(f.identity) });
+                continue;
+            }
+            const disk = await this.deps.diskFor(f.identity.size);
+            if (disk) {
+                stop = disk;
+                break;
+            }
+            const entryOf = this.transcriptEntry(f);
+            const out = await this.archiveOne(f, entryOf);
+            if (out === "verify_failed" || out === "changed") {
+                incomplete = true;
+                continue;
+            }
+            unlinks.push(await this.recordArchived(f, entryOf, out));
+        }
+        return { unlinks, stop, incomplete };
+    }
+    /** A file `archiveOne` placed: its entry appended (durable), the pass's
+     * counts updated; returns the unlink the caller may make. */
+    async recordArchived(f, entryOf, out) {
+        await this.append(entryOf(out.dest, packedOf(out.ok, f.identity)));
+        await this.deps.step?.("manifest_appended", { store: this.deps.subject, source: f.source });
+        this.result.archived += 1;
+        this.result.bytesIn += out.ok.bytes;
+        this.result.bytesOut += out.ok.gzBytes;
+        await yieldToLoop();
+        return { path: f.path, source: f.source, identity: identityFields(f.identity) };
+    }
+    /**
+     * The unlinks, each only while `allowed()` still says go and the file's
+     * identity is the one hashed; returns the sources removed (a source already
+     * gone counts — its entry verified). `allowed` returning a reason stops
+     * every unlink after it.
+     */
+    async unlinkAll(unlinks, allowed) {
+        const removed = new Set();
+        for (const u of unlinks) {
+            const why = allowed();
+            if (why)
+                return { removed, stop: why };
+            const r = await unlinkIfIdentity(u.path, u.identity);
+            if (r === "changed")
+                continue;
+            removed.add(u.source);
+            if (r === "removed") {
+                this.result.removed += 1;
+                await this.deps.step?.("unlinked", { store: this.deps.subject, path: u.path });
+            }
+        }
+        return { removed, stop: null };
+    }
+    /** Remove one proven duplicate (the legacy copy), only while its identity
+     * is the one compared. */
+    async removeDuplicate(path, id, entry, allowed) {
+        if (!sameIdentity(id, await identityOrNull(path)))
+            return false;
+        if (!this.duplicates.has(JSON.stringify([entry.path, entry.bytes, entry.sha256]))) {
+            await this.append({ ...entry, pass: this.passId, removed_at: this.deps.now().toISOString() });
+            await this.deps.step?.("duplicate_recorded", { store: this.deps.subject, path });
+        }
+        if (allowed())
+            return false;
+        const r = await unlinkIfIdentity(path, identityFields(id));
+        if (r === "removed") {
+            this.result.duplicatesRemoved += 1;
+            this.deps.duplicateRemoved?.();
+            await this.deps.step?.("duplicate_unlinked", { store: this.deps.subject, path });
+        }
+        return r === "removed";
+    }
+    /** Stamp what left (and every earlier entry whose source is gone — a crash
+     * between an unlink and its stamp), append the duplicate removals, finish
+     * the pass. Only the shards that change are rewritten. */
+    async finish(removed, duplicates) {
+        const at = this.deps.now().toISOString();
+        const gone = new Set(removed);
+        for (const s of this.shards) {
+            for (const e of s.m.entries)
+                if (fileish(e) &&
+                    e.source_removed_at === undefined &&
+                    !gone.has(e.source) &&
+                    (await identityOrNull(this.deps.liveOf(e.source))) === null)
+                    gone.add(e.source);
+            await yieldToLoop();
+        }
+        await this.append(...duplicates.map((d) => ({ ...d, pass: this.passId, removed_at: at })));
+        const unstamped = (e) => fileish(e) && e.source_removed_at === undefined && gone.has(e.source);
+        for (let k = 0; k < this.shards.length; k++) {
+            const s = this.shards[k];
+            const stamps = s.m.entries.some(unstamped);
+            const open = this.touched.has(k) &&
+                s.m.passes.some((p) => p.id === this.passId && p.finished_at === undefined);
+            if (!stamps && !open)
+                continue;
+            await this.rewrite(k, (next) => {
+                for (const e of next.entries)
+                    if (unstamped(e))
+                        e.source_removed_at = at;
+                const pass = next.passes.find((p) => p.id === this.passId);
+                if (pass && pass.finished_at === undefined)
+                    pass.finished_at = at;
+            });
+        }
+    }
+}
+//# sourceMappingURL=storepass.js.map

package/dist/src/archive/storepass.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storepass.js","sourceRoot":"","sources":["../../../src/archive/storepass.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,sEAAsE;AACtE,6EAA6E;AAC7E,2EAA2E;AAC3E,uEAAuE;AACvE,uEAAuE;AACvE,yBAAyB;AACzB,EAAE;AACF,8EAA8E;AAC9E,8EAA8E;AAC9E,6EAA6E;AAC7E,wEAAwE;AACxE,0EAA0E;AAC1E,4EAA4E;AAC5E,4EAA4E;AAC5E,0EAA0E;AAC1E,2EAA2E;AAC3E,4EAA4E;AAC5E,uEAAuE;AACvE,oEAAoE;AACpE,yDAAyD;AACzD,EAAE;AACF,uEAAuE;AACvE,kCAAkC;AAClC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,WAAW,EAAE,MAAM,8CAA8C,CAAC;AAC3E,OAAO,EACL,YAAY,EACZ,WAAW,EACX,cAAc,EACd,cAAc,EACd,QAAQ,EACR,YAAY,EACZ,gBAAgB,EAChB,SAAS,GAEV,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,eAAe,EAAqB,MAAM,aAAa,CAAC;AAC/E,OAAO,EACL,cAAc,EACd,aAAa,EACb,gBAAgB,GAGjB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,iBAAiB,EACjB,aAAa,GAMd,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AA+EzC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,OAAmC,EACnC,SAAwB,IAAI,EACX,EAAE,CAAC,CAAC;IACrB,OAAO;IACP,MAAM;IACN,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,CAAC;IACV,iBAAiB,EAAE,CAAC;IACpB,cAAc,EAAE,CAAC;IACjB,QAAQ,EAAE,CAAC;CACZ,CAAC,CAAC;AAEH;;+EAE+E;AAC/E,MAAM,UAAU,YAAY,CAC1B,GAAoB,EACpB,IAAmB,EACnB,UAAmB,EACnB,QAAuB,IAAI;IAE3B,GAAG,CAAC,OAAO,GAAG,IAAI,IAAI,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/D,GAAG,CAAC,MAAM;QACR,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,OAAO,EAAE,eAAe,EAAE,YAAY,EAAe,MAAM,mBAAmB,CAAC;AAE/E;;;4EAG4E;AAC5E,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,IAAmB;IACnD,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,MAAM;QAAE,OAAO,gBAAgB,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IACpE,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IACnC,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC;AAClC,CAAC;AASD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC,kEAAkE;AAClE,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;AAEjG,MAAM,QAAQ,GAAG,kCAAkC,CAAC;AAOpD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,GAAW,EACX,UAAiC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE;IAE7C,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;QAChE,MAAM,IAAI,kBAAkB,CAAC,GAAG,GAAG,KAAM,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,EAAE,GAAa,EAAE,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,SAAS,CAAC,uCAAuC;QACzE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;QAChC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;YACjB,MAAM,IAAI,kBAAkB,CAC1B,GAAG,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,sBAAsB,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,qCAAqC,CAC/G,CAAC;IACN,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,IAAY,CAAC;QACjB,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,kBAAkB,CAAC,GAAG,IAAI,KAAM,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;QACrE,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAgB,EAAkB,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;AAEnG;;;GAGG;AACH,MAAM,OAAO,WAAW;IAcH;IAEA;IAfF,MAAM,CAAU;IACjC,wDAAwD;IACvC,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC1D,kEAAkE;IACjD,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IACzB,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAChD,qCAAqC;IACpB,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5B,KAAK,CAAY;IACzB,MAAM,CAAS;IACf,MAAM,GAAoB,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAE5D,YACmB,IAAmB,EACpC,MAAe,EACE,SAAiB,EAClC,KAAgB;QAHC,SAAI,GAAJ,IAAI,CAAe;QAEnB,cAAS,GAAT,SAAS,CAAQ;QAGlC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;8EAE0E;IAC1E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAmB;QACnC,MAAM,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,SAAS,EAAE,CAAC;QAC5C,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,CAAC,GAAG,YAAY,kBAAkB,CAAC;gBAAE,MAAM,GAAG,CAAC;YACpD,IAAI,CAAC,YAAY,CACf,YAAY,IAAI,CAAC,OAAO,EAAE,EAC1B,WAAW,IAAI,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,qDAAqD,CAC7F,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,CAAC;QACzE,wEAAwE;QACxE,yCAAyC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC3C,MAAM,WAAW,EAAE,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAEO,MAAM,CAAC,OAAiC;QAC9C,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,IAAI,KAAK,mBAAmB;gBAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,gDAAgD;IACxC,CAAC,OAAO;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,OAAO,CAAC,CAAS,EAAE,MAA6B;QAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QAC9B,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE;YAC7C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC;gBAChD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,CAAC;YACb,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAChC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,MAAM,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7D,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QACf,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED;4DACwD;IACxD,KAAK,CAAC,MAAM,CAAC,GAAG,OAAwB;QACtC,IAAI,IAAI,GAAG,OAAO,CAAC;QACnB,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,mBAAmB;gBACvD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;oBACvC,CAAC,EAAE,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;iBACpC,CAAC,CAAC;YACL,MAAM,IAAI,GAAG,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;YACxE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxB,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;YAC9B,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,KAAK,CAAC,WAAW,CAAC,CAAY;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,CAAC,MAAM,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9E,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,UAAU,CACd,CAAY,EACZ,OAAkD,EAClD,WAAoB;QAEpB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,MAAM,CAAC,GAAG,MAAM,YAAY,CAAC;YAC3B,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,IAAI,EAAE,CAAC,CAAC,OAAO;YACf,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,GAAG,EAAE,IAAI,CAAC,OAAO;YACjB,IAAI,EAAE;gBACJ,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1C;YACD,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI;YACrB,WAAW,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC;YAClF,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChD,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;SACxB,CAAC,CAAC;QACH,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;YACpC,IAAI,CAAC,MAAM,CAAC,cAAc,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,YAAY,CACf,QAAQ,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,MAAM,EAAE,EAClC,WAAW,IAAI,CAAC,OAAO,KAAK,MAAM,uBAAuB,CAC1D,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,+CAA+C;IAC/C,eAAe,CAAC,CAAY,EAAE,QAA4B,EAAE;QAC1D,OAAO,CAAC,OAAe,EAAE,CAAS,EAAa,EAAE,CAAC,CAAC;YACjD,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,OAAO;YACP,GAAG,CAAC;YACJ,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;YAC1C,GAAG,KAAK;SACT,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,UAAU,CAAC,KAA2B;QAK1C,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,IAAI,IAAI,GAAkB,IAAI,CAAC;QAC/B,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9B,IAAI,IAAI;gBAAE,MAAM;YAChB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC5D,sEAAsE;gBACtE,UAAU,GAAG,IAAI,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,MAAM,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACvF,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACtD,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,GAAG,IAAI,CAAC;gBACZ,MAAM;YACR,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC9C,IAAI,GAAG,KAAK,eAAe,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACjD,UAAU,GAAG,IAAI,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IACvC,CAAC;IAED;iEAC6D;IAC7D,KAAK,CAAC,cAAc,CAClB,CAAY,EACZ,OAAkD,EAClD,GAAwC;QAExC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,mBAAmB,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5F,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC;QACvC,MAAM,WAAW,EAAE,CAAC;QACpB,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;IAClF,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS,CACb,OAA+B,EAC/B,OAA4B;QAE5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC;YACtB,IAAI,GAAG;gBAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;gBACzB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACjC,CAAC;IAED;8BAC0B;IAC1B,KAAK,CAAC,eAAe,CACnB,IAAY,EACZ,EAAgB,EAChB,KAAkD,EAClD,OAA4B;QAE5B,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,MAAM,cAAc,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;YAC9F,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,IAAI,OAAO,EAAE;YAAE,OAAO,KAAK,CAAC;QAC5B,MAAM,CAAC,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,iBAAiB,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,CAAC,KAAK,SAAS,CAAC;IACzB,CAAC;IAED;;8DAE0D;IAC1D,KAAK,CAAC,MAAM,CACV,OAA4B,EAC5B,UAAsE;QAEtE,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO;gBACzB,IACE,OAAO,CAAC,CAAC,CAAC;oBACV,CAAC,CAAC,iBAAiB,KAAK,SAAS;oBACjC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;oBACnB,CAAC,MAAM,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;oBAE3D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACvB,MAAM,WAAW,EAAE,CAAC;QACtB,CAAC;QACD,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,SAAS,GAAG,CAAC,CAAgB,EAAW,EAAE,CAC9C,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,iBAAiB,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3C,MAAM,IAAI,GACR,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAC9E,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI;gBAAE,SAAS;YAC/B,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;gBAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO;oBAAE,IAAI,SAAS,CAAC,CAAC,CAAC;wBAAG,CAAe,CAAC,iBAAiB,GAAG,EAAE,CAAC;gBACxF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC3D,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;oBAAE,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF"}

package/dist/src/backfill.js

@@ -0,0 +1,217 @@
+/** GitHub review state -> the daemon's verdict vocabulary. States absent from
+ * this table (DISMISSED, PENDING) are not verdicts and are never imported. */
+export const VERDICT_BY_REVIEW_STATE = {
+    APPROVED: "APPROVE",
+    CHANGES_REQUESTED: "REQUEST_CHANGES",
+    COMMENTED: "COMMENT",
+};
+export function verdictForReviewState(state) {
+    return VERDICT_BY_REVIEW_STATE[state.toUpperCase()] ?? null;
+}
+const SUMMARY_LIMIT = 800;
+// ---- enumeration -----------------------------------------------------------
+export function enumerationQueries(cfg) {
+    const repo = cfg.github.repo;
+    return [
+        `repo:${repo} is:pr label:"${cfg.backfill.reviewed_label}"`,
+        `repo:${repo} is:pr reviewed-by:${cfg.backfill.bot_login}`,
+    ];
+}
+/** Union of the two searches, ascending by PR number (oldest history first). */
+export async function enumeratePrs(source, cfg) {
+    const numbers = new Set();
+    for (const q of enumerationQueries(cfg)) {
+        for (const item of await source.searchIssuesPaged(q, cfg.backfill.max_search_pages)) {
+            if (Number.isInteger(item.number))
+                numbers.add(item.number);
+        }
+    }
+    return [...numbers].sort((a, b) => a - b);
+}
+export function triggerCandidates(timeline, cfg) {
+    const out = [];
+    for (const item of timeline) {
+        if (item.type === "LabeledEvent") {
+            if (item.label === cfg.backfill.trigger_label)
+                out.push({ ts: item.created_at, tier: 1 });
+            else if (item.label === cfg.backfill.in_progress_label &&
+                (item.actor === cfg.backfill.bot_actor || item.actor === cfg.backfill.bot_login)) {
+                out.push({ ts: item.created_at, tier: 2 });
+            }
+        }
+        else if (item.type === "ReviewRequestedEvent" &&
+            item.requested_team === cfg.backfill.review_team_slug) {
+            out.push({ ts: item.created_at, tier: 1 });
+        }
+    }
+    return out.sort((a, b) => (a.ts < b.ts ? -1 : a.ts > b.ts ? 1 : 0));
+}
+/** The trigger a review answered: the latest candidate strictly before it and
+ * strictly after the previous bot review on the same PR. Tier 1 wins outright;
+ * tier 2 (the dispatch label) is only consulted when no human ask is in range.
+ * Null when nothing qualifies — metrics can then tell "unknown" from
+ * "reconstructed". */
+export function triggerForReview(candidates, submittedAt, previousSubmittedAt) {
+    const inRange = candidates.filter((c) => c.ts < submittedAt && (previousSubmittedAt === null || c.ts > previousSubmittedAt));
+    for (const tier of [1, 2]) {
+        const hit = inRange.filter((c) => c.tier === tier).pop();
+        if (hit)
+            return hit.ts;
+    }
+    return null;
+}
+/** Pure planning step: history + the store's current facts -> rows to insert. */
+export function planPr(history, cfg, ctx) {
+    const plan = {
+        meta: {
+            pr: history.number,
+            title: history.title,
+            author: history.author,
+            created_at: history.created_at,
+            merged_at: history.merged_at,
+            closed_at: history.closed_at,
+            merged: history.merged ? 1 : 0,
+        },
+        rounds: [],
+        skipped_epoch: 0,
+        skipped_existing: 0,
+        skipped_state: 0,
+        reviews_seen: 0,
+    };
+    const candidates = triggerCandidates(history.timeline, cfg);
+    const reviews = history.reviews
+        .filter((r) => r.submitted_at !== null && r.database_id > 0)
+        .sort((a, b) => a.submitted_at < b.submitted_at ? -1 : a.submitted_at > b.submitted_at ? 1 : 0);
+    const accepted = [];
+    let previous = null;
+    for (const review of reviews) {
+        plan.reviews_seen++;
+        const submittedAt = review.submitted_at;
+        const trigger = triggerForReview(candidates, submittedAt, previous);
+        previous = submittedAt;
+        if (ctx.epoch !== null && submittedAt >= ctx.epoch) {
+            plan.skipped_epoch++;
+            continue;
+        }
+        const verdict = verdictForReviewState(review.state);
+        if (verdict === null) {
+            plan.skipped_state++;
+            continue;
+        }
+        if (ctx.imported.has(review.database_id)) {
+            plan.skipped_existing++;
+            continue;
+        }
+        accepted.push({ review, verdict, trigger });
+    }
+    // Numbering: 1..N on a PR the daemon never touched, otherwise descending
+    // below the PR's lowest existing round so live numbering stays untouched.
+    const base = ctx.minRoundNo === null ? 1 : ctx.minRoundNo - accepted.length;
+    accepted.forEach(({ review, verdict, trigger }, i) => {
+        const submittedAt = review.submitted_at;
+        plan.rounds.push({
+            pr: history.number,
+            round_no: base + i,
+            verdict,
+            started_at: trigger ?? submittedAt,
+            finished_at: submittedAt,
+            gh_review_id: review.database_id,
+            gh_commit_id: review.commit_oid,
+            trigger_ts: trigger,
+            summary: review.body ? review.body.slice(0, SUMMARY_LIMIT) : null,
+        });
+    });
+    return plan;
+}
+/** Run `workers` fetches at a time over `items`, preserving input order. */
+async function mapPool(items, workers, fn) {
+    const out = new Array(items.length);
+    let next = 0;
+    const worker = async () => {
+        for (;;) {
+            const i = next++;
+            if (i >= items.length)
+                return;
+            out[i] = await fn(items[i]);
+        }
+    };
+    await Promise.all(Array.from({ length: Math.max(1, Math.min(workers, items.length)) }, worker));
+    return out;
+}
+export async function runBackfill(store, source, cfg, opts = {}) {
+    const log = opts.log ?? (() => { });
+    const dryRun = opts.dryRun === true;
+    const epoch = store.daemonEpoch();
+    const imported = store.importedReviewIds();
+    log(`backfill: ${dryRun ? "PLAN (no writes)" : "IMPORT"} · epoch ${epoch ?? "(none — no daemon rounds yet)"}`);
+    let prs = await enumeratePrs(source, cfg);
+    const enumerated = prs.length;
+    if (opts.limit !== undefined && opts.limit >= 0)
+        prs = prs.slice(0, opts.limit);
+    log(`backfill: ${enumerated} PRs enumerated${prs.length !== enumerated ? ` · ${prs.length} after --limit` : ""}`);
+    const stats = {
+        prs_enumerated: enumerated,
+        prs_scanned: 0,
+        reviews_seen: 0,
+        reviews_imported: 0,
+        skipped_epoch: 0,
+        skipped_existing: 0,
+        skipped_state: 0,
+        meta_rows: 0,
+        prs_missing: 0,
+        epoch,
+        dry_run: dryRun,
+    };
+    const histories = await mapPool(prs, cfg.backfill.concurrency, async (n) => {
+        const history = await source.prReviewHistory(n, cfg.backfill.bot_login);
+        return { n, history };
+    });
+    for (const { n, history } of histories) {
+        if (!history) {
+            stats.prs_missing++;
+            continue;
+        }
+        stats.prs_scanned++;
+        const plan = planPr(history, cfg, { epoch, imported, minRoundNo: store.minRoundNo(n) });
+        stats.reviews_seen += plan.reviews_seen;
+        stats.skipped_epoch += plan.skipped_epoch;
+        stats.skipped_existing += plan.skipped_existing;
+        stats.skipped_state += plan.skipped_state;
+        if (plan.meta.created_at) {
+            if (!dryRun)
+                store.upsertBackfillPrMeta(plan.meta);
+            stats.meta_rows++;
+        }
+        if (dryRun) {
+            for (const r of plan.rounds) {
+                stats.reviews_imported++;
+                log(`  would import #${r.pr} historical ${r.verdict} @ ${r.finished_at} (trigger ${r.trigger_ts ?? "—"}; chronological round number assigned on import)`);
+            }
+            continue;
+        }
+        // All of a PR's rounds or none: the numbering is planned over the whole
+        // PR (oldest first), so a resumed import must plan it whole again.
+        const inserted = store.db.transaction(() => {
+            const results = plan.rounds.map((r) => store.insertBackfilledRound(r));
+            if (results.some(Boolean))
+                store.resequenceBackfilledRounds(n);
+            return results;
+        })();
+        plan.rounds.forEach((r, i) => {
+            if (inserted[i]) {
+                stats.reviews_imported++;
+                imported.add(r.gh_review_id);
+            }
+            else {
+                stats.skipped_existing++;
+            }
+        });
+        if (plan.rounds.length > 0)
+            log(`  #${plan.meta.pr}: +${plan.rounds.length} rounds`);
+    }
+    log(`backfill done: ${stats.prs_scanned} PRs scanned · ${stats.reviews_imported} reviews ${dryRun ? "planned" : "imported"} · ` +
+        `${stats.skipped_epoch} skipped (daemon era) · ${stats.skipped_existing} skipped (already imported) · ` +
+        `${stats.skipped_state} skipped (non-verdict state) · ${stats.meta_rows} PR meta rows`);
+    return stats;
+}
+//# sourceMappingURL=backfill.js.map