@quickchatai/pi-quickreview 1.1.0 → 1.3.1

package/dist/src/scan/scan.d.ts

@@ -0,0 +1,354 @@
+import { planKey } from "../plankey.js";
+import { SCAN_DEEP_MAX_SUGGESTIONS, SCAN_PASS } from "../include.js";
+import { type Reachability } from "../severity.js";
+import { isMigrationFile } from "./facts.js";
+import { type CaseBudget, type UnitCut } from "./unitcut.js";
+/** The stage-1 lens (agents/scan/pass-scan.md). */
+export { SCAN_PASS };
+/** Lenses a stage-1 suggestion may NOT name (passes.ts), and the deep lenses
+ * stage 1 may point stage 2 at. */
+export { DIFF_ONLY_LENSES, SCAN_DEEP_LENSES } from "../passes.js";
+export { isMigrationFile };
+export type ExclusionReason = "test" | "migration" | "unreadable-kind" | "excluded-glob";
+/** Why stage 1 does not read `path`, or null when it does. */
+export declare function stage1Exclusion(path: string, excluded: (p: string) => boolean): ExclusionReason | null;
+export interface TreeFile {
+    path: string;
+    /** The git blob hash — the content hash the ledger keys on. */
+    blob: string;
+}
+export interface ScanCaseFile {
+    path: string;
+    blob: string;
+    /** Lines this case READS of the file for sizing and price: the whole file,
+     * or its `range`'s length. */
+    lines: number;
+    /** A file over one case is cut into line ranges (`cutRanges`): this case
+     * reads the whole file for context but reports only inside `range`. */
+    range?: FileRange;
+}
+/** One line range of a file too big for one case — 1-based, inclusive, and
+ * `total` the file's own line count (what the ledger's coverage needs). */
+export interface FileRange {
+    start: number;
+    end: number;
+    total: number;
+}
+/** Neighbouring ranges overlap by this many lines at most (a tenth of the
+ * window below that), so a finding straddling a cut sits whole in one. */
+export declare const RANGE_OVERLAP_MAX = 40;
+/**
+ * Cut a file of `total` lines into windows of at most `maxLines`: each
+ * window ends just before a top-level declaration found in its second half
+ * when the text is at hand (pulled above that declaration's decorators and
+ * comments), else at the limit; the next starts a few lines earlier
+ * (`RANGE_OVERLAP_MAX`), so neighbours overlap and nothing falls between
+ * them. A file that fits is one window. Deterministic.
+ */
+export declare function cutRanges(total: number, maxLines: number, text: string | null): FileRange[];
+/** Does the union of `ranges` cover every line of `start..end`? */
+export declare function rangesCover(ranges: readonly {
+    start: number;
+    end: number;
+}[], start: number, end: number): boolean;
+export interface ScanCasePlan {
+    /** The UNIT's name, never the part's. */
+    unit: string;
+    /** `<unit>` or `<unit>#<i>` — unitcut.ts's spelling. */
+    id: string;
+    part: number;
+    parts: number;
+    files: ScanCaseFile[];
+    lines: number;
+}
+export interface Stage1Plan {
+    cases: ScanCasePlan[];
+    /** Files stage 1 skips, by reason. */
+    excluded: Record<ExclusionReason, number>;
+    /** Readable files the ledger already covers at this content. */
+    covered: number;
+    /** Files at this sha no unit of the saved cut owns (the repo outgrew it). */
+    unassigned: string[];
+    /** Files the tree lists but whose text cannot be read (binary, too big). */
+    unreadable: number;
+    /** Each of those files and why (`binary`, `too-big`, `unreadable` when the
+     * tree cannot say) — reported, never silently absent from coverage. */
+    skipped: SkippedFile[];
+    /** Delta only: planned files whose content has NOT changed since the last
+     * scan but that no complete reading covers at it — never read (the rest of
+     * an unfinished scan, or unreadable then and readable now), or read only in
+     * part. A delta owes them as much as the changed ones (0 for a full plan). */
+    owed: number;
+}
+/** What a delta re-scan compares against. */
+export interface DeltaBasis {
+    /** Each path's newest content hash in the ledger for `pass-scan`. */
+    read: ReadonlyMap<string, string>;
+    /** The tree the last scan read: path → blob. */
+    baseline: ReadonlyMap<string, string>;
+}
+/** Has `f`'s content changed since the last scan? Newest read by the ledger
+ * at another content, or absent from / different in the last scan's tree.
+ * Not what a delta reads by: an unchanged file with no complete reading at
+ * this content is owed too (planStage1). */
+export declare function changedSince(f: TreeFile, basis: DeltaBasis): boolean;
+/** Why a listed file has no text for a lens. */
+export type UnreadableReason = "binary" | "too-big" | "unreadable";
+export interface SkippedFile {
+    path: string;
+    why: UnreadableReason;
+}
+export interface PlanInput {
+    cut: UnitCut;
+    files: readonly TreeFile[];
+    linesOf: (path: string) => number | null;
+    /** Why `linesOf` answered null; absent = `unreadable` (the reason unknown). */
+    whyUnreadable?: (path: string) => UnreadableReason | null;
+    /** `path\0blob` of each file's newest ledger reading for `pass-scan`. */
+    covered: ReadonlySet<string>;
+    exclude: readonly string[];
+    budget: CaseBudget;
+    /** A delta re-scan: files changed since the last scan, and every file no
+     * complete reading covers at its content (`covered`, `history`). */
+    delta?: DeltaBasis;
+    /** A file's text, where a range cut looks for declaration boundaries;
+     * absent (or null) = fixed windows. */
+    textOf?: (path: string) => string | null;
+    /** `path\0blob` → the line ranges the ledger's newest, still-incomplete
+     * reading holds for `pass-scan`: a range inside them is not read again. */
+    partial?: ReadonlyMap<string, readonly {
+        start: number;
+        end: number;
+    }[]>;
+    /** path → the ledger's newest `pass-scan` reading of it (any content):
+     * what orders the cases. Absent: the plan's own (unit) order stands. */
+    history?: ReadonlyMap<string, PriorReading>;
+}
+/** A file's newest reading as the plan orders by it (ledger.ts `readings`). */
+export interface PriorReading {
+    blob: string;
+    /** Whole file, or ranges covering every line. */
+    complete: boolean;
+    /** When that reading's newest row was written (ISO): among changed files
+     * the stalest reading runs first. */
+    at: string;
+}
+/**
+ * Coverage first. The hard stop ends a run whose actuals outrun its estimate
+ * before the plan's tail, so the tail must not be the same cases every run:
+ * a file the ledger never read, or whose newest reading was cut short
+ * between ranges, is tier 0; a file read before at other content is tier 1
+ * (changed); anything else is tier 2. A case takes its best file's
+ * tier; a tier keeps the plan's order.
+ */
+export declare function readTier(f: {
+    path: string;
+    blob: string;
+}, history: ReadonlyMap<string, PriorReading>): 0 | 1 | 2;
+export declare const coverKey: (path: string, blob: string) => string;
+/** Stage 1 over the saved cut at one tree: every readable, uncovered,
+ * non-excluded file (a delta the same set, counting what it owes unchanged
+ * as `owed`), one case per
+ * unit, split to fit — ordered coverage-first by `history` (readTier).
+ * Deterministic. */
+export declare function planStage1(input: PlanInput): Stage1Plan;
+/**
+ * The calibration pick: one case from each of up to `n` units spread across
+ * the size range (by the unit's planned lines), so the measured rate is not
+ * the rate of the smallest or the largest code alone. Deterministic.
+ */
+export declare function calibrationCases(plan: readonly ScanCasePlan[], n: number): ScanCasePlan[];
+/** A measured stage-1 price: dollars per thousand lines read, from finished
+ * cases of the SAME lens, tier, effort and validator setting. */
+export interface ScanRate {
+    usd_per_kline: number;
+    /** Priced cases it was measured over, and their lines and cost. */
+    cases: number;
+    lines: number;
+    cost_usd: number;
+}
+export declare function caseEstimate(lines: number, rate: Pick<ScanRate, "usd_per_kline">): number;
+/**
+ * Run `lanes` copies of `lane` to the end. One that throws aborts the rest
+ * and the throw is raised only once EVERY lane has stopped — never while a
+ * sibling is still in a paid case, which would otherwise go on spending and
+ * writing the run record after the run is settled and its slot released.
+ */
+export declare function drainLanes(lanes: number, lane: () => Promise<void>, abort: AbortController): Promise<void>;
+/** What a preview's key covers (packages/pi-plugin/src/plankey.ts, shared with `qcr review`). */
+export { planKey };
+export interface PromptContext {
+    /** Absolute path of the tree at the scan sha. */
+    root: string;
+    sha: string;
+    caseId: string;
+}
+/** Where a lens opens a tree file: its absolute path under the root. */
+export declare function treePath(root: string, path: string): string;
+/** The line every scan task carries about paths: the lens runs outside the
+ * tree (first-party cwd — the case runner), so a relative path it opens is
+ * some other checkout's file, never the scanned one. */
+export declare const TREE_PATHS_NOTE = "Your working directory is NOT the tree: a relative path opens some other checkout's file. Open every file \u2014 focus files, callers, tests \u2014 by its absolute path under the tree root (each focus file below says where). Paths in your answer are relative to the tree root.";
+/** One focus file as a task names it: its repo-relative path (what an
+ * answer anchors to), its size or range, and — given the tree root — the
+ * absolute path to open it by. */
+export declare function focusLine(f: ScanCaseFile, root?: string): string;
+/** The note a case with a ranged file carries, or none. */
+export declare function rangeNote(files: readonly ScanCaseFile[]): string[];
+/** The stage-1 task string for one case. */
+export declare function scanCasePrompt(c: ScanCasePlan, ctx: PromptContext, deepLenses?: readonly string[]): string;
+/** One candidate as a validator reads it, in the findings grammar — the
+ * scan's skeptic and the replay's validator alike. */
+export declare function candidateItem(f: ScanCandidate): string;
+/** The validator's task string over one case's stage-1 candidates. */
+export declare function scanValidatorPrompt(c: ScanCasePlan, candidates: readonly ScanCandidate[], ctx: PromptContext, lens?: string, label?: string): string;
+export declare const SEVERITIES: readonly ["P0", "P1", "P2", "P3", "nit"];
+export type ScanSeverity = (typeof SEVERITIES)[number];
+/** A finding's place: its file, its line range and its kind. */
+interface Placed {
+    path: string;
+    start: number;
+    end: number;
+    kind: string;
+}
+/**
+ * The candidate a validator's survivor stands for: one not yet `used`, on the
+ * same file with overlapping lines — the same kind first. One survivor stands
+ * for at most one candidate, so a duplicate on the same lines or a neighbour
+ * of another kind is never silently claimed by a survivor that did not mean
+ * it. The scan and the replay attribute survivors through this one rule.
+ */
+export declare function survivorSource<T extends Placed>(survivor: Placed, candidates: readonly T[], used: ReadonlySet<T>): T | undefined;
+/** A stage-1 candidate as read back, anchored or not yet checked. */
+export interface ScanCandidate {
+    path: string;
+    start: number;
+    end: number;
+    kind: string;
+    /** After the reachability cap (`capped_from` holds what the lens said). */
+    severity: ScanSeverity;
+    confidence: number | null;
+    /** The lens's `reachability:` field, or null when it wrote none (read as
+     * `routine`, exactly as a PR round reads it). */
+    reachability: Reachability | null;
+    /** The severity the lens wrote, when the reachability axis capped it —
+     * the posting map's gate (`reachabilityCappedSeverity`): contrived never
+     * blocks, plausible P2 is a question. Null when nothing was capped. */
+    capped_from: ScanSeverity | null;
+    claim: string;
+    evidence: string | null;
+    fix: string | null;
+    detail: string | null;
+}
+export interface ScanSuggestion {
+    lens: string;
+    files: string[];
+    reason: string;
+}
+export interface ParsedScanAnswer {
+    candidates: ScanCandidate[];
+    /** Items with no path, claim or line — never repaired. */
+    dropped: number;
+    suggestions: ScanSuggestion[];
+    /** Suggestions naming no allowed lens or no file, or past the cap. */
+    suggestions_dropped: number;
+    /** The findings block said NONE. */
+    none: boolean;
+}
+/** At most this many suggestions per case are kept — `SCAN_DEEP_MAX_SUGGESTIONS`
+ * in a deep scan, where every focus file is to be named in one. */
+export declare const MAX_SUGGESTIONS = 5;
+export { SCAN_DEEP_MAX_SUGGESTIONS };
+/** One lowercase word naming the class — the identity half of a kind. */
+export declare function normalizeKind(v: string | undefined): string;
+/**
+ * Read a `pass-scan` answer: its findings (line anchors required — a scan
+ * finding without lines is dropped, per the scan-mode anchor rule) and its
+ * deep-lens suggestions (lenses from `deepLenses` only, files as given — the
+ * caller checks they exist; at most `maxSuggestions`, default
+ * `MAX_SUGGESTIONS`). `root` strips an absolute tree prefix a lens wrote by
+ * mistake.
+ */
+export declare function parseScanAnswer(text: string, opts?: {
+    root?: string | null;
+    deepLenses?: readonly string[];
+    maxSuggestions?: number;
+}): ParsedScanAnswer;
+export interface DoubtLine {
+    /** The lens the validator named on the line. */
+    lens: string;
+    path: string;
+    line: number | null;
+    word: string;
+    reason: string;
+    /** The false-positive class the skeptic named (`[<slug>]` leading the
+     * reason — a SCAN_FALSE_POSITIVE_CLASSES slug), or null. */
+    class: string | null;
+}
+/** The slugs a doubt may name as its class — the ONE class list. */
+export declare const SCAN_FALSE_POSITIVE_SLUGS: readonly string[];
+/**
+ * Whether a skeptic's scenario is anchored: it cites at least one `path:line`
+ * of the path it traced. A `confirmed` scenario told as a prose chain of
+ * names and arrows with no `path:line` hides the hop the skeptic did not
+ * read — that hop is exactly the one it cannot cite. The engine checks that
+ * structure; the rest of the tightening lives in SCAN_SKEPTIC_ADDENDUM.
+ */
+export declare function scenarioIsAnchored(scenario: string): boolean;
+/** A survivor as the scan's skeptic sorted it. */
+export interface SkepticSurvivor extends ScanCandidate {
+    /** `confirmed` only with a written `scenario:` that cites a `path:line`
+     * (scenarioIsAnchored) — a demonstration not written down, or not anchored
+     * in the code it traced, is not one; anything else that survived is
+     * `likely` (the scenario kept, so the reader sees what was traced). */
+    validity: "confirmed" | "likely";
+    scenario: string | null;
+}
+/**
+ * Read the validator's answer over a scan case — the scan's skeptic: the
+ * survivors (its findings block — they carry the lens's anchors), each with
+ * its tier (`validity: confirmed` with a `scenario:` citing a `path:line`,
+ * else `likely`), its DOUBTED lines,
+ * `- <lens> <path:line> — <word>: [<class>] <reason>`, and its KILLED lines
+ * in the same shape. In a scan nothing is killed: the caller stores a KILLED
+ * line as a doubt exactly like a DOUBTED one (the frozen validator's kill
+ * paths — below-bar, restated, duplicate, a confidence under 0.5 — become a
+ * doubtful mark, never a deletion).
+ */
+export declare function parseValidatorAnswer(text: string, root: string | null): {
+    survivors: SkepticSurvivor[];
+    dropped: number;
+    doubted: DoubtLine[];
+    killed: DoubtLine[];
+    answered: boolean;
+};
+/** The anchored code, whitespace-normalised: each line's runs of whitespace
+ * collapsed, blank lines dropped — so a re-indent or a reflow is the same
+ * code, and a changed token is not. */
+export declare function normalizeCode(lines: readonly string[]): string;
+/** Lines `start..end` (1-based, inclusive) of `text`, or null when the range
+ * is not inside the file. */
+export declare function anchoredLines(text: string, start: number, end: number): string[] | null;
+/**
+ * Does a finding's evidence quote its anchored code? True when the evidence
+ * contains a whole anchored line (whitespace-normalised), or a quoted
+ * fragment of it — a `backticked` or "double-quoted" run that sits inside one
+ * of the anchored lines. An anchor with nothing quotable in it (braces, blank
+ * lines) cannot be checked and is not held against the finding. A finding
+ * whose evidence quotes only code ABOVE or BELOW its anchor — the function
+ * signature for a dereference twelve lines down — is exactly the misanchor
+ * this catches.
+ */
+export declare function evidenceQuotesAnchor(evidence: string | null, anchored: readonly string[]): boolean;
+/**
+ * A scan finding's fingerprint: file + lens + kind + a hash of the
+ * anchored code, whitespace-normalised. Stable across a re-scan that only
+ * moved the code or re-indented it; different when the code itself changed.
+ */
+export declare function findingFingerprint(f: {
+    path: string;
+    lens: string;
+    kind: string;
+    code: string;
+}): string;
+//# sourceMappingURL=scan.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scan.d.ts","sourceRoot":"","sources":["../../../src/scan/scan.ts"],"names":[],"mappings":"AAyBA,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAKxC,OAAO,EACL,yBAAyB,EAEzB,SAAS,EAEV,MAAM,eAAe,CAAC;AAEvB,OAAO,EAAmD,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAqB,KAAK,UAAU,EAAE,KAAK,OAAO,EAAE,MAAM,cAAc,CAAC;AAEhF,mDAAmD;AACnD,OAAO,EAAE,SAAS,EAAE,CAAC;AAErB;mCACmC;AACnC,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAElE,OAAO,EAAE,eAAe,EAAE,CAAC;AAE3B,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,WAAW,GAAG,iBAAiB,GAAG,eAAe,CAAC;AAEzF,8DAA8D;AAC9D,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,GAC/B,eAAe,GAAG,IAAI,CAMxB;AAID,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,+DAA+D;IAC/D,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb;kCAC8B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd;2EACuE;IACvE,KAAK,CAAC,EAAE,SAAS,CAAC;CACnB;AAED;2EAC2E;AAC3E,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf;AAED;0EAC0E;AAC1E,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAQpC;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,CA4B3F;AAED,mEAAmE;AACnE,wBAAgB,WAAW,CACzB,MAAM,EAAE,SAAS;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,EAAE,EACjD,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,GACV,OAAO,CAQT;AAED,MAAM,WAAW,YAAY;IAC3B,yCAAyC;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,wDAAwD;IACxD,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;IAC1C,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAC;IAChB,6EAA6E;IAC7E,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,4EAA4E;IAC5E,UAAU,EAAE,MAAM,CAAC;IACnB;2EACuE;IACvE,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB;;;kFAG8E;IAC9E,IAAI,EAAE,MAAM,CAAC;CACd;AAED,6CAA6C;AAC7C,MAAM,WAAW,UAAU;IACzB,qEAAqE;IACrE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,gDAAgD;IAChD,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACvC;AAED;;;4CAG4C;AAC5C,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAKpE;AAED,gDAAgD;AAChD,MAAM,MAAM,gBAAgB,GAAG,QAAQ,GAAG,SAAS,GAAG,YAAY,CAAC;AAEnE,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,gBAAgB,CAAC;CACvB;AAED,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,OAAO,CAAC;IACb,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IACzC,+EAA+E;IAC/E,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,gBAAgB,GAAG,IAAI,CAAC;IAC1D,yEAAyE;IACzE,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7B,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,MAAM,EAAE,UAAU,CAAC;IACnB;wEACoE;IACpE,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB;2CACuC;IACvC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IACzC;+EAC2E;IAC3E,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC,CAAC;IACzE;4EACwE;IACxE,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CAC7C;AAED,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,QAAQ,EAAE,OAAO,CAAC;IAClB;yCACqC;IACrC,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CACtB,CAAC,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EACjC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,GACzC,CAAC,GAAG,CAAC,GAAG,CAAC,CAIX;AAED,eAAO,MAAM,QAAQ,GAAI,MAAM,MAAM,EAAE,MAAM,MAAM,KAAG,MAA4B,CAAC;AAEnF;;;;oBAIoB;AACpB,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,UAAU,CAkHvD;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,YAAY,EAAE,CAUzF;AAID;iEACiE;AACjE,MAAM,WAAW,QAAQ;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,mEAAmE;IACnE,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,eAAe,CAAC,GAAG,MAAM,CAEzF;AAED;;;;;GAKG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,EACzB,KAAK,EAAE,eAAe,GACrB,OAAO,CAAC,IAAI,CAAC,CAaf;AAED,iGAAiG;AACjG,OAAO,EAAE,OAAO,EAAE,CAAC;AAInB,MAAM,WAAW,aAAa;IAC5B,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,wEAAwE;AACxE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED;;wDAEwD;AACxD,eAAO,MAAM,eAAe,yRACkP,CAAC;AAE/Q;;kCAEkC;AAClC,wBAAgB,SAAS,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,CAKhE;AAED,2DAA2D;AAC3D,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,GAAG,MAAM,EAAE,CAUlE;AAMD,4CAA4C;AAC5C,wBAAgB,cAAc,CAC5B,CAAC,EAAE,YAAY,EACf,GAAG,EAAE,aAAa,EAClB,UAAU,GAAE,SAAS,MAAM,EAAqB,GAC/C,MAAM,CAgBR;AAED;sDACsD;AACtD,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAkBtD;AAED,sEAAsE;AACtE,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,YAAY,EACf,UAAU,EAAE,SAAS,aAAa,EAAE,EACpC,GAAG,EAAE,aAAa,EAClB,IAAI,GAAE,MAAkB,EACxB,KAAK,SAA4B,GAChC,MAAM,CAiBR;AAID,eAAO,MAAM,UAAU,0CAA2C,CAAC;AACnE,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAEvD,gEAAgE;AAChE,UAAU,MAAM;IACd,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,EAC7C,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,SAAS,CAAC,EAAE,EACxB,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,GACnB,CAAC,GAAG,SAAS,CASf;AAED,qEAAqE;AACrE,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,2EAA2E;IAC3E,QAAQ,EAAE,YAAY,CAAC;IACvB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B;qDACiD;IACjD,YAAY,EAAE,YAAY,GAAG,IAAI,CAAC;IAClC;;2EAEuE;IACvE,WAAW,EAAE,YAAY,GAAG,IAAI,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACnB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,cAAc,EAAE,CAAC;IAC9B,sEAAsE;IACtE,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oCAAoC;IACpC,IAAI,EAAE,OAAO,CAAC;CACf;AAED;mEACmE;AACnE,eAAO,MAAM,eAAe,IAAI,CAAC;AACjC,OAAO,EAAE,yBAAyB,EAAE,CAAC;AAwErC,yEAAyE;AACzE,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAQ3D;AA0ED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE;IAAE,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAO,GAC3F,gBAAgB,CA+BlB;AAED,MAAM,WAAW,SAAS;IACxB,gDAAgD;IAChD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf;gEAC4D;IAC5D,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB;AAED,oEAAoE;AACpE,eAAO,MAAM,yBAAyB,EAAE,SAAS,MAAM,EAEtD,CAAC;AAUF;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAE5D;AAED,kDAAkD;AAClD,MAAM,WAAW,eAAgB,SAAQ,aAAa;IACpD;;;2EAGuE;IACvE,QAAQ,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AA+BD;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,GAAG,IAAI,GAClB;IACD,SAAS,EAAE,eAAe,EAAE,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,SAAS,EAAE,CAAC;IACrB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;CACnB,CAuBA;AAID;;uCAEuC;AACvC,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAK9D;AAED;6BAC6B;AAC7B,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAKvF;AASD;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,QAAQ,EAAE,SAAS,MAAM,EAAE,GAC1B,OAAO,CAWT;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,GAAG,MAAM,CAGT"}