@quickchatai/pi-quickreview 0.0.0-stage → 1.1.0

package/dist/src/finding-chain.d.ts

@@ -0,0 +1,40 @@
+import type { RoundFindingRow } from "./storerows.js";
+/** A finding continuation address; the key may itself contain colons. */
+export declare function carriedToRef(roundNo: number, findingKey: string): string;
+export interface CarriedFinding {
+    round_no: number;
+    finding_key: string;
+    carried_to: string | null;
+}
+/** Follow known links once, ending at a missing target or a cycle. */
+export declare function walkFindingChain<T extends CarriedFinding>(rows: readonly T[], root: T): T[];
+/** Every unpointed root and its last known continuation. */
+export declare function findingChains<T extends CarriedFinding>(rows: readonly T[]): Array<{
+    root: T;
+    end: T;
+}>;
+/** Was this row posted on the PR? `posted` with a tag — a downgraded, killed,
+ * doubted or withheld entry never reached the author as itself. */
+export declare function isPostedRow(r: RoundFindingRow): boolean;
+/** How far a later round's entry may sit from a finding's line and still be
+ * that finding (lines move as the branch moves). */
+export declare const CONTINUATION_LINES = 10;
+/**
+ * Which entry of the round `e` names in `raised_in_round` is `e` again? Only
+ * an entry on the same path, sharing a lens, within `CONTINUATION_LINES`:
+ * the one carrying `e`'s key when it is such an entry, else the single
+ * nearest such entry (a file-level line counts as the farthest near one). A
+ * tie is nobody's: two findings a few lines apart in one file and one lens
+ * must not both inherit one entry's fate. Returns the owner's key, or null.
+ *
+ * An equal key ALONE is no match: sessions number their keys per round (f1,
+ * f2, …), so a later round's `f1` is usually a different finding; a key-only
+ * match would carry one finding's fate onto another far away in the file.
+ */
+export declare function predecessorOf(round: readonly RoundFindingRow[], e: RoundFindingRow): string | null;
+/** Could `b` be `a` again? The same path, a shared lens, within
+ * `CONTINUATION_LINES` (an entry without a line is near). The one eligibility
+ * rule of predecessor ownership and of the weak next-round match; who wins
+ * among the eligible is each caller's own rule. */
+export declare function sameSite(a: RoundFindingRow, b: RoundFindingRow): boolean;
+//# sourceMappingURL=finding-chain.d.ts.map

package/dist/src/finding-chain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-chain.d.ts","sourceRoot":"","sources":["../../src/finding-chain.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEtD,yEAAyE;AACzE,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAExE;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED,sEAAsE;AACtE,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,cAAc,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAa3F;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CAAC,CAAC,SAAS,cAAc,EACpD,IAAI,EAAE,SAAS,CAAC,EAAE,GACjB,KAAK,CAAC;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,GAAG,EAAE,CAAC,CAAA;CAAE,CAAC,CAK5B;AAED;mEACmE;AACnE,wBAAgB,WAAW,CAAC,CAAC,EAAE,eAAe,GAAG,OAAO,CAEvD;AAED;oDACoD;AACpD,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAMrC;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,eAAe,EAAE,EACjC,CAAC,EAAE,eAAe,GACjB,MAAM,GAAG,IAAI,CAUf;AAED;;;mDAGmD;AACnD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CAMxE"}

package/dist/src/finding-chain.js

@@ -0,0 +1,76 @@
+import { storedLensIds } from "./lensids.js";
+/** A finding continuation address; the key may itself contain colons. */
+export function carriedToRef(roundNo, findingKey) {
+    return `${roundNo}:${findingKey}`;
+}
+/** Follow known links once, ending at a missing target or a cycle. */
+export function walkFindingChain(rows, root) {
+    const byKey = new Map(rows.map((row) => [carriedToRef(row.round_no, row.finding_key), row]));
+    const seen = new Set();
+    const chain = [];
+    let row = root;
+    while (row) {
+        const key = carriedToRef(row.round_no, row.finding_key);
+        if (seen.has(key))
+            break;
+        seen.add(key);
+        chain.push(row);
+        row = row.carried_to ? byKey.get(row.carried_to) : undefined;
+    }
+    return chain;
+}
+/** Every unpointed root and its last known continuation. */
+export function findingChains(rows) {
+    const pointed = new Set(rows.map((row) => row.carried_to).filter((ref) => !!ref));
+    return rows
+        .filter((row) => !pointed.has(carriedToRef(row.round_no, row.finding_key)))
+        .map((root) => ({ root, end: walkFindingChain(rows, root).at(-1) }));
+}
+/** Was this row posted on the PR? `posted` with a tag — a downgraded, killed,
+ * doubted or withheld entry never reached the author as itself. */
+export function isPostedRow(r) {
+    return r.disposition === "posted" && r.posted_as !== null && r.posted_as.trim() !== "";
+}
+/** How far a later round's entry may sit from a finding's line and still be
+ * that finding (lines move as the branch moves). */
+export const CONTINUATION_LINES = 10;
+function lensIdsOf(row) {
+    return storedLensIds(row.lens_ids) ?? [];
+}
+/**
+ * Which entry of the round `e` names in `raised_in_round` is `e` again? Only
+ * an entry on the same path, sharing a lens, within `CONTINUATION_LINES`:
+ * the one carrying `e`'s key when it is such an entry, else the single
+ * nearest such entry (a file-level line counts as the farthest near one). A
+ * tie is nobody's: two findings a few lines apart in one file and one lens
+ * must not both inherit one entry's fate. Returns the owner's key, or null.
+ *
+ * An equal key ALONE is no match: sessions number their keys per round (f1,
+ * f2, …), so a later round's `f1` is usually a different finding; a key-only
+ * match would carry one finding's fate onto another far away in the file.
+ */
+export function predecessorOf(round, e) {
+    const dist = (s) => s.line === null || e.line === null ? CONTINUATION_LINES : Math.abs(s.line - e.line);
+    const candidates = round.filter((s) => sameSite(s, e));
+    const keyed = candidates.find((s) => s.finding_key === e.finding_key);
+    if (keyed)
+        return keyed.finding_key;
+    if (candidates.length === 0)
+        return null;
+    const best = Math.min(...candidates.map(dist));
+    const nearest = candidates.filter((s) => dist(s) === best);
+    return nearest.length === 1 ? nearest[0].finding_key : null;
+}
+/** Could `b` be `a` again? The same path, a shared lens, within
+ * `CONTINUATION_LINES` (an entry without a line is near). The one eligibility
+ * rule of predecessor ownership and of the weak next-round match; who wins
+ * among the eligible is each caller's own rule. */
+export function sameSite(a, b) {
+    if (!a.path || a.path !== b.path)
+        return false;
+    if (a.line !== null && b.line !== null && Math.abs(a.line - b.line) > CONTINUATION_LINES)
+        return false;
+    const ids = lensIdsOf(a);
+    return lensIdsOf(b).some((id) => ids.includes(id));
+}
+//# sourceMappingURL=finding-chain.js.map

package/dist/src/finding-chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-chain.js","sourceRoot":"","sources":["../../src/finding-chain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAG7C,yEAAyE;AACzE,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,UAAkB;IAC9D,OAAO,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC;AACpC,CAAC;AAQD,sEAAsE;AACtE,MAAM,UAAU,gBAAgB,CAA2B,IAAkB,EAAE,IAAO;IACpF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAI,GAAG,GAAkB,IAAI,CAAC;IAC9B,OAAO,GAAG,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM;QACzB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,aAAa,CAC3B,IAAkB;IAElB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAiB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjG,OAAO,IAAI;SACR,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;SAC1E,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED;mEACmE;AACnE,MAAM,UAAU,WAAW,CAAC,CAAkB;IAC5C,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;AACzF,CAAC;AAED;oDACoD;AACpD,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC,SAAS,SAAS,CAAC,GAAoB;IACrC,OAAO,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAiC,EACjC,CAAkB;IAElB,MAAM,IAAI,GAAG,CAAC,CAAkB,EAAE,EAAE,CAClC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC;IACtE,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,WAAW,CAAC;IACpC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3D,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED;;;mDAGmD;AACnD,MAAM,UAAU,QAAQ,CAAC,CAAkB,EAAE,CAAkB;IAC7D,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,kBAAkB;QACtF,OAAO,KAAK,CAAC;IACf,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AACrD,CAAC"}

package/dist/src/finding-row.d.ts

@@ -0,0 +1,24 @@
+import type { RoundFindingInput } from "./storerows.js";
+/** Semantic finding fields shared by file fallback and durable ingestion. */
+export declare function findingRowFields(f: RoundFindingInput): {
+    finding_key: string;
+    path: string | null;
+    line: number | null;
+    lens: string;
+    tier: string | null;
+    severity: string | null;
+    confidence: number | null;
+    reachability: string | null;
+    kind: string | null;
+    disposition: string;
+    axis: string | null;
+    word: string | null;
+    reason: string | null;
+    evidence: string | null;
+    posted_as: string | null;
+    raised_in_round: number | null;
+    thread_id: number | null;
+    title: string | null;
+    lens_ids: string;
+};
+//# sourceMappingURL=finding-row.d.ts.map

package/dist/src/finding-row.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-row.d.ts","sourceRoot":"","sources":["../../src/finding-row.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAExD,6EAA6E;AAC7E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,iBAAiB;;;;;;;;;;;;;;;;;;;;EAsBpD"}

package/dist/src/finding-row.js

@@ -0,0 +1,26 @@
+import { canonicalLensIds } from "./lensids.js";
+/** Semantic finding fields shared by file fallback and durable ingestion. */
+export function findingRowFields(f) {
+    return {
+        finding_key: f.key,
+        path: f.path ?? null,
+        line: f.line ?? null,
+        lens: f.lens ?? "",
+        tier: f.tier ?? null,
+        severity: f.severity ?? null,
+        confidence: f.confidence ?? null,
+        reachability: f.reachability ?? null,
+        kind: f.kind ?? null,
+        disposition: f.disposition ?? "unknown",
+        axis: f.axis ?? null,
+        word: f.word ?? null,
+        reason: f.reason ?? null,
+        evidence: f.evidence ?? null,
+        posted_as: f.posted_as ?? null,
+        raised_in_round: f.raised_in_round ?? null,
+        thread_id: f.thread_id ?? null,
+        title: f.title ?? null,
+        lens_ids: JSON.stringify(canonicalLensIds(f.lens ?? "")),
+    };
+}
+//# sourceMappingURL=finding-row.js.map

package/dist/src/finding-row.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-row.js","sourceRoot":"","sources":["../../src/finding-row.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAGhD,6EAA6E;AAC7E,MAAM,UAAU,gBAAgB,CAAC,CAAoB;IACnD,OAAO;QACL,WAAW,EAAE,CAAC,CAAC,GAAG;QAClB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE;QAClB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;QAC5B,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI;QAChC,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI;QACpC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,WAAW,EAAE,CAAC,CAAC,WAAW,IAAI,SAAS;QACvC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI;QACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;QAC5B,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;QAC9B,eAAe,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI;QAC1C,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;QAC9B,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;QACtB,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;KACzD,CAAC;AACJ,CAAC"}

package/dist/src/findingkey.d.ts

@@ -0,0 +1,99 @@
+/** A record field as a non-empty trimmed string, else null. */
+export declare function recordString(val: unknown): string | null;
+/** The record's entry array: `findings` first, else the legacy `candidates`
+ * spelling, else null. The ONE precedence the parser and the renderer share. */
+export declare function recordEntries(rec: Record<string, unknown>): unknown[] | null;
+/** A record field as a number — a finite number, or a decimal string a
+ * session wrote (`"0.7"`, `"12"`) — else null. The ONE coercion: the parser
+ * stores what the renderer posts, so a value both read must read alike. */
+export declare function recordNumber(val: unknown): number | null;
+/** The diff side a record entry's anchor counts on: `LEFT` in any case, else
+ * `RIGHT` (the default). The renderer posts on it and the post-check compares
+ * by it, so both read one side. */
+export declare function recordSide(val: unknown): "LEFT" | "RIGHT";
+/**
+ * What happened to a candidate finding. Closed set — the record is only
+ * countable if the disposition is.
+ *
+ * - `posted` — it survived validation and went out on the PR (the RAISE side,
+ *   the half adjudication actually needs).
+ * - `killed` — the validator vetoed it.
+ * - `downgraded` — the validator moved it (severity, confidence or
+ *   reachability). A `downgrade` survivor still goes out: recorded with its
+ *   `posted_as` it reads as posted (`entryDisposition`); without one it
+ *   is never posted, and the renderer reports it.
+ * - `doubted` — the validator could not stand behind the CLAIM (`DOUBT_WORDS`:
+ *   refuted, unverifiable, bad anchor). A validity veto is a mark, not a
+ *   deletion — kept here as "may not be valid", never posted on the PR,
+ *   shown in the TUI for the operator to judge.
+ * - `merged` / `folded` — merge-stage attrition: the same defect
+ *   collapsed into another finding, or a different defect carried as a
+ *   paragraph under one. Attrition here counts like a kill; it must never
+ *   vanish silently.
+ * - `withheld` — the session itself dropped it before the validator saw it,
+ *   or the profile's `[posting]` policy kept a survivor off the PR (a word
+ *   from `WITHHOLD_WORDS`: `over-budget`, `nits-off`, …) — kept, never posted.
+ * - `conceded` — REFUTED AND CONCEDED: previously posted, the author refuted
+ *   it and the reviewer accepted the refutation. This is the state that lets a
+ *   later round tell "escalating an open finding" (legitimate — blocking late
+ *   beats never) from "resurrecting a settled one" (not legitimate). Nothing
+ *   else in the system records it.
+ */
+declare const DISPOSITION_VALUES: readonly ["posted", "killed", "doubted", "downgraded", "merged", "folded", "withheld", "conceded"];
+export type FindingDisposition = (typeof DISPOSITION_VALUES)[number] | "unknown";
+/** A disposition as the closed set, under every spelling the aliases fold. */
+export declare function normalizeDisposition(raw: unknown): FindingDisposition;
+/**
+ * The disposition a record ENTRY acts on. A validator `downgrade` keeps the
+ * finding at the severity it names (packages/pi-plugin/src/templates.ts
+ * renderValidatorOutputNote), so a `downgraded` entry that went out under a
+ * tag (`posted_as`) is a posted survivor: the downgrade's `word` and `axis`
+ * stay on the entry, and it counts, renders and dedups as `posted`. Without a
+ * `posted_as` it stays `downgraded`, never posted. Every reader that asks
+ * "was this entry posted?" of a raw entry asks it here.
+ */
+export declare function entryDisposition(entry: Record<string, unknown>): FindingDisposition;
+/**
+ * The per-round key of the record entry at `index` of its `findings` array:
+ * the session's own handle (`id`, else `key`), and when it wrote neither, the
+ * stable fallback `<lens>@<path>:<line>#<index>`. This IS the parser's rule
+ * (`parseFindingsRecord` calls it), so a key computed here from the same
+ * record always names the same row.
+ */
+export declare function findingRecordKey(entry: Record<string, unknown>, index: number): string;
+/**
+ * The hidden marker the live render route appends to an inline comment:
+ * `<!-- qcr:f=<round_no>:<finding key> -->`. GitHub renders an HTML comment
+ * as nothing, so the reader never sees it. The key is percent-encoded down to
+ * `[A-Za-z0-9%._~]`, so no session-written key can close the comment early
+ * (`-->`), break the line, or collide with the separator. Never throws: the
+ * render route has no catch around it.
+ */
+export declare function findingMarker(roundNo: number, key: string): string;
+/** Matches a marker anywhere in a comment body. */
+export declare const FINDING_MARKER_RE: RegExp;
+/**
+ * The marker a comment body carries, if any. A malformed one is no marker.
+ *
+ * The LAST marker in the body is the real one: the render route appends it
+ * after the finding's text (`reviewrender.ts`), and that text is the
+ * reviewer's, which may quote PR content — a marker-shaped string a PR
+ * carries (or this repo's own tests, in a self-review) and the finding
+ * quotes comes BEFORE it. Taking the first match would link the comment to
+ * whatever finding the quoted text names.
+ */
+export declare function parseFindingMarker(body: string | null | undefined): {
+    round_no: number;
+    key: string;
+} | null;
+/** A body with every marker removed — what the comment reads as without it. */
+export declare function stripFindingMarkers(body: string): string;
+/** A recheck head as the recheck's own key: its first 12 characters,
+ * lowercased — so a full sha and its prefix are one head. */
+export declare function recheckHead12(head: string): string;
+/** The `finding_key` prefix of a recheck's own findings at `head`
+ * (`recheck:<head12>:`): the recheck writes its rows under it and the learner
+ * reads them back by it. */
+export declare function recheckKeyPrefix(head: string): string;
+export {};
+//# sourceMappingURL=findingkey.d.ts.map

package/dist/src/findingkey.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findingkey.d.ts","sourceRoot":"","sources":["../../src/findingkey.ts"],"names":[],"mappings":"AAWA,+DAA+D;AAC/D,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAIxD;AAED;gFACgF;AAChF,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,CAG5E;AAED;;2EAE2E;AAC3E,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAOxD;AAKD;;mCAEmC;AACnC,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAEzD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,QAAA,MAAM,kBAAkB,oGASd,CAAC;AAEX,MAAM,MAAM,kBAAkB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;AA2BjF,8EAA8E;AAC9E,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,OAAO,GAAG,kBAAkB,CAKrE;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,kBAAkB,CAKnF;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAKtF;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAElE;AAgBD,mDAAmD;AACnD,eAAO,MAAM,iBAAiB,QAAgD,CAAC;AAI/E;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAC9B;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAW1C;AAKD,+EAA+E;AAC/E,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;6DAC6D;AAC7D,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;4BAE4B;AAC5B,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAErD"}

package/dist/src/findingkey.js

@@ -0,0 +1,210 @@
+// A posted finding's identity, shared by the two ends that must agree on it
+// for outcome capture: the findings-record PARSER, which turns the
+// session's record into `round_findings` rows keyed by `(pr, round_no,
+// finding_key)`, and the live RENDER route, which stamps that key into every
+// inline comment it renders so the comment can be linked back to its row.
+// Beside it, the readings of a record entry every consumer must share: its
+// numbers and strings, its disposition (is it `posted`?) and its diff side.
+//
+// A leaf on purpose — no imports. `packages/pi-plugin/src/reviewrender.ts` is also the bench's
+// render step, and the bench must not pull the daemon's modules in with it.
+/** A record field as a non-empty trimmed string, else null. */
+export function recordString(val) {
+    if (typeof val !== "string")
+        return null;
+    const t = val.trim();
+    return t.length > 0 ? t : null;
+}
+/** The record's entry array: `findings` first, else the legacy `candidates`
+ * spelling, else null. The ONE precedence the parser and the renderer share. */
+export function recordEntries(rec) {
+    if (Array.isArray(rec.findings))
+        return rec.findings;
+    return Array.isArray(rec.candidates) ? rec.candidates : null;
+}
+/** A record field as a number — a finite number, or a decimal string a
+ * session wrote (`"0.7"`, `"12"`) — else null. The ONE coercion: the parser
+ * stores what the renderer posts, so a value both read must read alike. */
+export function recordNumber(val) {
+    if (typeof val === "number" && Number.isFinite(val))
+        return val;
+    if (typeof val === "string" && /^-?\d+(\.\d+)?$/.test(val.trim())) {
+        const number = Number(val.trim());
+        return Number.isFinite(number) ? number : null;
+    }
+    return null;
+}
+const str = recordString;
+const num = recordNumber;
+/** The diff side a record entry's anchor counts on: `LEFT` in any case, else
+ * `RIGHT` (the default). The renderer posts on it and the post-check compares
+ * by it, so both read one side. */
+export function recordSide(val) {
+    return recordString(val)?.toUpperCase() === "LEFT" ? "LEFT" : "RIGHT";
+}
+/**
+ * What happened to a candidate finding. Closed set — the record is only
+ * countable if the disposition is.
+ *
+ * - `posted` — it survived validation and went out on the PR (the RAISE side,
+ *   the half adjudication actually needs).
+ * - `killed` — the validator vetoed it.
+ * - `downgraded` — the validator moved it (severity, confidence or
+ *   reachability). A `downgrade` survivor still goes out: recorded with its
+ *   `posted_as` it reads as posted (`entryDisposition`); without one it
+ *   is never posted, and the renderer reports it.
+ * - `doubted` — the validator could not stand behind the CLAIM (`DOUBT_WORDS`:
+ *   refuted, unverifiable, bad anchor). A validity veto is a mark, not a
+ *   deletion — kept here as "may not be valid", never posted on the PR,
+ *   shown in the TUI for the operator to judge.
+ * - `merged` / `folded` — merge-stage attrition: the same defect
+ *   collapsed into another finding, or a different defect carried as a
+ *   paragraph under one. Attrition here counts like a kill; it must never
+ *   vanish silently.
+ * - `withheld` — the session itself dropped it before the validator saw it,
+ *   or the profile's `[posting]` policy kept a survivor off the PR (a word
+ *   from `WITHHOLD_WORDS`: `over-budget`, `nits-off`, …) — kept, never posted.
+ * - `conceded` — REFUTED AND CONCEDED: previously posted, the author refuted
+ *   it and the reviewer accepted the refutation. This is the state that lets a
+ *   later round tell "escalating an open finding" (legitimate — blocking late
+ *   beats never) from "resurrecting a settled one" (not legitimate). Nothing
+ *   else in the system records it.
+ */
+const DISPOSITION_VALUES = [
+    "posted",
+    "killed",
+    "doubted",
+    "downgraded",
+    "merged",
+    "folded",
+    "withheld",
+    "conceded",
+];
+const DISPOSITIONS = new Set(DISPOSITION_VALUES);
+/** Spellings a session plausibly writes, folded onto the closed set. Tolerant
+ * input, exactly like the verdict file's digit-string coercion — never a
+ * rejection reason. */
+const DISPOSITION_ALIASES = {
+    post: "posted",
+    survive: "posted",
+    survived: "posted",
+    kill: "killed",
+    vetoed: "killed",
+    doubt: "doubted",
+    "may-not-be-valid": "doubted",
+    downgrade: "downgraded",
+    demoted: "downgraded",
+    capped: "downgraded",
+    merge: "merged",
+    fold: "folded",
+    withhold: "withheld",
+    dropped: "withheld",
+    concede: "conceded",
+    "refuted-and-conceded": "conceded",
+    refuted_and_conceded: "conceded",
+};
+/** A disposition as the closed set, under every spelling the aliases fold. */
+export function normalizeDisposition(raw) {
+    if (typeof raw !== "string")
+        return "unknown";
+    const v = raw.trim().toLowerCase().replace(/\s+/g, "-");
+    if (DISPOSITIONS.has(v))
+        return v;
+    return DISPOSITION_ALIASES[v] ?? "unknown";
+}
+/**
+ * The disposition a record ENTRY acts on. A validator `downgrade` keeps the
+ * finding at the severity it names (packages/pi-plugin/src/templates.ts
+ * renderValidatorOutputNote), so a `downgraded` entry that went out under a
+ * tag (`posted_as`) is a posted survivor: the downgrade's `word` and `axis`
+ * stay on the entry, and it counts, renders and dedups as `posted`. Without a
+ * `posted_as` it stays `downgraded`, never posted. Every reader that asks
+ * "was this entry posted?" of a raw entry asks it here.
+ */
+export function entryDisposition(entry) {
+    const d = normalizeDisposition(entry.disposition);
+    if (d !== "downgraded")
+        return d;
+    const tag = entry.posted_as;
+    return typeof tag === "string" && tag.trim() !== "" ? "posted" : d;
+}
+/**
+ * The per-round key of the record entry at `index` of its `findings` array:
+ * the session's own handle (`id`, else `key`), and when it wrote neither, the
+ * stable fallback `<lens>@<path>:<line>#<index>`. This IS the parser's rule
+ * (`parseFindingsRecord` calls it), so a key computed here from the same
+ * record always names the same row.
+ */
+export function findingRecordKey(entry, index) {
+    const lens = str(entry.lens) ?? str(entry.name) ?? "";
+    const path = str(entry.path);
+    const line = num(entry.line);
+    return str(entry.id) ?? str(entry.key) ?? `${lens || "?"}@${path ?? "?"}:${line ?? "?"}#${index}`;
+}
+/**
+ * The hidden marker the live render route appends to an inline comment:
+ * `<!-- qcr:f=<round_no>:<finding key> -->`. GitHub renders an HTML comment
+ * as nothing, so the reader never sees it. The key is percent-encoded down to
+ * `[A-Za-z0-9%._~]`, so no session-written key can close the comment early
+ * (`-->`), break the line, or collide with the separator. Never throws: the
+ * render route has no catch around it.
+ */
+export function findingMarker(roundNo, key) {
+    return `<!-- qcr:f=${Math.trunc(roundNo)}:${encodeMarkerKey(key)} -->`;
+}
+/** A lone UTF-16 surrogate — what `encodeURIComponent` throws `URIError` on. */
+const LONE_SURROGATE = /[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?<![\uD800-\uDBFF])[\uDC00-\uDFFF]/g;
+function encodeMarkerKey(key) {
+    // A session-written key (a JSON `"\ud800"` escape parses) may hold a lone
+    // surrogate. It becomes U+FFFD first — what `String.prototype.toWellFormed`
+    // does, and what the key reads back as from the state database, whose UTF-8
+    // storage makes the same replacement — so the marker still names its row.
+    return encodeURIComponent(key.replace(LONE_SURROGATE, "�")).replace(/[!'()*-]/g, (c) => `%${c.charCodeAt(0).toString(16).toUpperCase().padStart(2, "0")}`);
+}
+/** Matches a marker anywhere in a comment body. */
+export const FINDING_MARKER_RE = /<!--\s*qcr:f=(\d+):([A-Za-z0-9%._~]+)\s*-->/;
+const FINDING_MARKER_ALL_RE = new RegExp(FINDING_MARKER_RE.source, "g");
+/**
+ * The marker a comment body carries, if any. A malformed one is no marker.
+ *
+ * The LAST marker in the body is the real one: the render route appends it
+ * after the finding's text (`reviewrender.ts`), and that text is the
+ * reviewer's, which may quote PR content — a marker-shaped string a PR
+ * carries (or this repo's own tests, in a self-review) and the finding
+ * quotes comes BEFORE it. Taking the first match would link the comment to
+ * whatever finding the quoted text names.
+ */
+export function parseFindingMarker(body) {
+    if (typeof body !== "string")
+        return null;
+    let m = null;
+    for (const hit of body.matchAll(FINDING_MARKER_ALL_RE))
+        m = hit;
+    if (!m)
+        return null;
+    try {
+        const key = decodeURIComponent(m[2]);
+        return key ? { round_no: Number(m[1]), key } : null;
+    }
+    catch {
+        return null;
+    }
+}
+/** Every marker in a body, with the newlines the render route put before it. */
+const FINDING_MARKER_STRIP_RE = new RegExp(`\\n*${FINDING_MARKER_RE.source}`, "g");
+/** A body with every marker removed — what the comment reads as without it. */
+export function stripFindingMarkers(body) {
+    return body.replace(FINDING_MARKER_STRIP_RE, "");
+}
+/** A recheck head as the recheck's own key: its first 12 characters,
+ * lowercased — so a full sha and its prefix are one head. */
+export function recheckHead12(head) {
+    return head.slice(0, 12).toLowerCase();
+}
+/** The `finding_key` prefix of a recheck's own findings at `head`
+ * (`recheck:<head12>:`): the recheck writes its rows under it and the learner
+ * reads them back by it. */
+export function recheckKeyPrefix(head) {
+    return `recheck:${recheckHead12(head)}:`;
+}
+//# sourceMappingURL=findingkey.js.map

package/dist/src/findingkey.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findingkey.js","sourceRoot":"","sources":["../../src/findingkey.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,mEAAmE;AACnE,uEAAuE;AACvE,6EAA6E;AAC7E,0EAA0E;AAC1E,2EAA2E;AAC3E,4EAA4E;AAC5E,EAAE;AACF,+FAA+F;AAC/F,4EAA4E;AAE5E,+DAA+D;AAC/D,MAAM,UAAU,YAAY,CAAC,GAAY;IACvC,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,CAAC;AAED;gFACgF;AAChF,MAAM,UAAU,aAAa,CAAC,GAA4B;IACxD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;QAAE,OAAO,GAAG,CAAC,QAAQ,CAAC;IACrD,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED;;2EAE2E;AAC3E,MAAM,UAAU,YAAY,CAAC,GAAY;IACvC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IAChE,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAClE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,GAAG,GAAG,YAAY,CAAC;AACzB,MAAM,GAAG,GAAG,YAAY,CAAC;AAEzB;;mCAEmC;AACnC,MAAM,UAAU,UAAU,CAAC,GAAY;IACrC,OAAO,YAAY,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;AACxE,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,kBAAkB,GAAG;IACzB,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,YAAY;IACZ,QAAQ;IACR,QAAQ;IACR,UAAU;IACV,UAAU;CACF,CAAC;AAIX,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAC,kBAAkB,CAAC,CAAC;AAEtE;;uBAEuB;AACvB,MAAM,mBAAmB,GAAiD;IACxE,IAAI,EAAE,QAAQ;IACd,OAAO,EAAE,QAAQ;IACjB,QAAQ,EAAE,QAAQ;IAClB,IAAI,EAAE,QAAQ;IACd,MAAM,EAAE,QAAQ;IAChB,KAAK,EAAE,SAAS;IAChB,kBAAkB,EAAE,SAAS;IAC7B,SAAS,EAAE,YAAY;IACvB,OAAO,EAAE,YAAY;IACrB,MAAM,EAAE,YAAY;IACpB,KAAK,EAAE,QAAQ;IACf,IAAI,EAAE,QAAQ;IACd,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,UAAU;IACnB,OAAO,EAAE,UAAU;IACnB,sBAAsB,EAAE,UAAU;IAClC,oBAAoB,EAAE,UAAU;CACjC,CAAC;AAEF,8EAA8E;AAC9E,MAAM,UAAU,oBAAoB,CAAC,GAAY;IAC/C,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACxD,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,CAAuB,CAAC;IACxD,OAAO,mBAAmB,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA8B;IAC7D,MAAM,CAAC,GAAG,oBAAoB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK,YAAY;QAAE,OAAO,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC;IAC5B,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA8B,EAAE,KAAa;IAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC;AACpG,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,GAAW;IACxD,OAAO,cAAc,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;AACzE,CAAC;AAED,gFAAgF;AAChF,MAAM,cAAc,GAAG,yEAAyE,CAAC;AAEjG,SAAS,eAAe,CAAC,GAAW;IAClC,0EAA0E;IAC1E,4EAA4E;IAC5E,4EAA4E;IAC5E,0EAA0E;IAC1E,OAAO,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CACjE,WAAW,EACX,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CACzE,CAAC;AACJ,CAAC;AAED,mDAAmD;AACnD,MAAM,CAAC,MAAM,iBAAiB,GAAG,6CAA6C,CAAC;AAE/E,MAAM,qBAAqB,GAAG,IAAI,MAAM,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAExE;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAA+B;IAE/B,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC1C,IAAI,CAAC,GAA2B,IAAI,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC;QAAE,CAAC,GAAG,GAAG,CAAC;IAChE,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;QACtC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACtD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,MAAM,uBAAuB,GAAG,IAAI,MAAM,CAAC,OAAO,iBAAiB,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC;AAEnF,+EAA+E;AAC/E,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,IAAI,CAAC,OAAO,CAAC,uBAAuB,EAAE,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;6DAC6D;AAC7D,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AACzC,CAAC;AAED;;4BAE4B;AAC5B,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,OAAO,WAAW,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;AAC3C,CAAC"}