@winspan/claude-forge 8.54.4 → 9.12.0

package/dist/core/storage/codegraph.js

@@ -0,0 +1,452 @@
+/**
+ * @file codegraph.ts
+ * CodeGraphStore — storage Operations for the independent codegraph DB.
+ *
+ * decision 95df9d97 / spec 1112-codegraph-call-graph-spec.md (Phase 1).
+ *
+ * This is the SQLite data layer for the call graph. Per Open Question Q1
+ * (user-approved) the graph lives in its OWN database
+ * (`~/.claude-forge/codegraph.db`), NOT the main data.db — so it can be
+ * rebuilt / dropped wholesale without disturbing the main DB's TTL sweep /
+ * VACUUM logic, and its FTS5 virtual tables stay isolated.
+ *
+ * Because the graph DB is standalone we do NOT extend SQLiteBase (which is
+ * wired to the main schema.sql + its migration chain). Instead this class owns
+ * a self-contained DDL string applied on first open ("首次访问建库建表" — the
+ * project has no auto-migration framework, CLAUDE.md). All `db.prepare` lives
+ * inside this Operations class, honoring the base.ts convention.
+ *
+ * Tables (cg_ prefix):
+ *   - cg_files   — per-file metadata (source_hash / mtime / lang)
+ *   - cg_nodes   — symbols, one-to-one with repo-map symbols
+ *   - cg_edges   — calls / imports / extends / implements (+ unresolved dst)
+ *   - cg_nodes_fts — FTS5 over (name, signature, doc) for code_search (Phase 2)
+ */
+import Database from 'better-sqlite3';
+import { existsSync, mkdirSync } from 'node:fs';
+import { dirname } from 'node:path';
+// ─────────────────────────────────────────────────────────────────────────────
+// Self-contained DDL (applied idempotently on open)
+// ─────────────────────────────────────────────────────────────────────────────
+const CODEGRAPH_SCHEMA = `
+CREATE TABLE IF NOT EXISTS cg_files (
+  file        TEXT PRIMARY KEY,
+  source_hash TEXT,
+  mtime       TEXT,
+  lang        TEXT
+);
+
+CREATE TABLE IF NOT EXISTS cg_nodes (
+  node_id   INTEGER PRIMARY KEY AUTOINCREMENT,
+  file      TEXT NOT NULL,
+  line      INTEGER NOT NULL,
+  kind      TEXT NOT NULL,
+  name      TEXT NOT NULL,
+  signature TEXT,
+  doc       TEXT,
+  exported  INTEGER NOT NULL DEFAULT 0,
+  FOREIGN KEY(file) REFERENCES cg_files(file) ON DELETE CASCADE
+);
+
+CREATE TABLE IF NOT EXISTS cg_edges (
+  edge_id       INTEGER PRIMARY KEY AUTOINCREMENT,
+  src_node      INTEGER NOT NULL,
+  dst_node      INTEGER,
+  edge_kind     TEXT NOT NULL CHECK(edge_kind IN ('calls','imports','extends','implements','references')),
+  dst_unresolved TEXT,
+  call_line     INTEGER,
+  FOREIGN KEY(src_node) REFERENCES cg_nodes(node_id) ON DELETE CASCADE,
+  FOREIGN KEY(dst_node) REFERENCES cg_nodes(node_id) ON DELETE CASCADE
+);
+
+CREATE VIRTUAL TABLE IF NOT EXISTS cg_nodes_fts USING fts5(
+  name,
+  signature,
+  doc,
+  content=''
+);
+
+CREATE INDEX IF NOT EXISTS idx_cg_edges_src ON cg_edges(src_node);
+CREATE INDEX IF NOT EXISTS idx_cg_edges_dst ON cg_edges(dst_node);
+CREATE INDEX IF NOT EXISTS idx_cg_edges_kind ON cg_edges(edge_kind);
+CREATE INDEX IF NOT EXISTS idx_cg_nodes_name ON cg_nodes(name);
+CREATE INDEX IF NOT EXISTS idx_cg_nodes_file ON cg_nodes(file);
+`;
+/** Project node rows down to the lighter candidate shape. */
+function toCandidates(rows) {
+    return rows.map((r) => ({ name: r.name, file: r.file, line: r.line, kind: r.kind }));
+}
+/**
+ * Operations over the independent codegraph SQLite DB.
+ *
+ * Construct with an absolute DB path (defaults to
+ * `FORGE_PATHS.codegraphDb()` at the call site). The DB + tables are created on
+ * first open if missing.
+ */
+export class CodeGraphStore {
+    db;
+    dbPath;
+    constructor(dbPath) {
+        this.dbPath = dbPath;
+        const dir = dirname(dbPath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        this.db = new Database(dbPath);
+        this.db.pragma('journal_mode = WAL');
+        this.db.pragma('synchronous = NORMAL');
+        this.db.pragma('foreign_keys = ON');
+        this.db.exec(CODEGRAPH_SCHEMA);
+        this.migrate();
+    }
+    /**
+     * Idempotent additive migrations for DBs created before a column existed.
+     * The schema's `CREATE TABLE IF NOT EXISTS` is a no-op on an existing table,
+     * so newly-added columns must be ALTER-ed in here. (The project has no auto
+     * migration framework; the graph DB is also fully rebuildable via
+     * `cf codegraph build --force`, but we migrate to keep stale DBs queryable.)
+     */
+    migrate() {
+        const cols = this.db
+            .prepare(`PRAGMA table_info(cg_edges)`)
+            .all();
+        if (!cols.some((c) => c.name === 'call_line')) {
+            this.db.exec(`ALTER TABLE cg_edges ADD COLUMN call_line INTEGER`);
+        }
+    }
+    /** Drop all graph data (used by `build --force` for a clean rebuild). */
+    reset() {
+        const tx = this.db.transaction(() => {
+            this.db.exec(`DELETE FROM cg_edges`);
+            // FTS rows are keyed by node rowid; clear the FTS index wholesale first.
+            this.db.exec(`INSERT INTO cg_nodes_fts(cg_nodes_fts) VALUES('delete-all')`);
+            this.db.exec(`DELETE FROM cg_nodes`);
+            this.db.exec(`DELETE FROM cg_files`);
+        });
+        tx();
+    }
+    /** Absolute path to the backing DB file. */
+    getDbPath() {
+        return this.dbPath;
+    }
+    /**
+     * @internal Escape hatch for tests / diagnostics only. Business code MUST
+     * use the named methods below — never `db.prepare()` from outside.
+     */
+    getDatabase() {
+        return this.db;
+    }
+    close() {
+        this.db.close();
+    }
+    /**
+     * Replace the entire graph for a single file in one transaction:
+     * delete the file's existing nodes/edges (FK cascade handles edges + FTS is
+     * cleaned by node-id) then re-insert nodes and edges.
+     *
+     * Edges are resolved against the GLOBAL node set after insert — so an edge
+     * whose destination lives in another file still resolves to a `dst_node`.
+     * Destinations not present in the DB are stored in `dst_unresolved`.
+     *
+     * @param file          src-relative file path (the cg_files PK).
+     * @param nodes         nodes belonging to `file`.
+     * @param edges         edges whose SOURCE belongs to `file`.
+     * @param meta          optional per-file metadata (source_hash / mtime / lang).
+     */
+    replaceFileGraph(file, nodes, edges, meta) {
+        const tx = this.db.transaction(() => {
+            // 1) Purge old rows for this file. FTS rows are keyed by the old node
+            //    rowids, so delete them explicitly before the nodes vanish.
+            const oldNodeIds = this.db
+                .prepare(`SELECT node_id FROM cg_nodes WHERE file = ?`)
+                .all(file);
+            const delFts = this.db.prepare(`INSERT INTO cg_nodes_fts(cg_nodes_fts, rowid, name, signature, doc)
+           VALUES('delete', ?, ?, ?, ?)`);
+            for (const { node_id } of oldNodeIds) {
+                const row = this.db
+                    .prepare(`SELECT name, signature, doc FROM cg_nodes WHERE node_id = ?`)
+                    .get(node_id);
+                delFts.run(node_id, row.name, row.signature ?? '', row.doc ?? '');
+            }
+            // Deleting the cg_files row cascades to cg_nodes, which cascades to
+            // cg_edges referencing those nodes as src OR dst.
+            this.db.prepare(`DELETE FROM cg_files WHERE file = ?`).run(file);
+            // 2) Re-insert the file row + nodes.
+            this.db
+                .prepare(`INSERT INTO cg_files(file, source_hash, mtime, lang)
+             VALUES(?, ?, ?, ?)`)
+                .run(file, meta?.source_hash ?? null, meta?.mtime ?? null, meta?.lang ?? 'ts');
+            const insNode = this.db.prepare(`INSERT INTO cg_nodes(file, line, kind, name, signature, doc, exported)
+           VALUES(?, ?, ?, ?, ?, ?, ?)`);
+            const insFts = this.db.prepare(`INSERT INTO cg_nodes_fts(rowid, name, signature, doc) VALUES(?, ?, ?, ?)`);
+            for (const n of nodes) {
+                const info = insNode.run(n.file, n.line, n.kind, n.name, n.signature ?? '', n.doc ?? null, n.exported ? 1 : 0);
+                insFts.run(Number(info.lastInsertRowid), n.name, n.signature ?? '', n.doc ?? '');
+            }
+            // 3) Insert edges, resolving dst to a node_id by (name, file) when
+            //    possible. Source nodes are looked up by (name, file) to disambiguate
+            //    same-named symbols across files; destinations resolve by the same
+            //    two-tuple (the extractor supplies `dstFile`) so that e.g. one of 22
+            //    `register` symbols binds to its OWN node, not whichever happened to
+            //    sort first. Falls back to name-only resolution when `dstFile` is
+            //    absent (older edges), then to dst_unresolved.
+            const insEdge = this.db.prepare(`INSERT INTO cg_edges(src_node, dst_node, edge_kind, dst_unresolved, call_line)
+           VALUES(?, ?, ?, ?, ?)`);
+            const findSrc = this.db.prepare(`SELECT node_id FROM cg_nodes WHERE name = ? AND file = ? LIMIT 1`);
+            const findDstByFile = this.db.prepare(`SELECT node_id FROM cg_nodes WHERE name = ? AND file = ? LIMIT 1`);
+            const findDstByName = this.db.prepare(`SELECT node_id FROM cg_nodes WHERE name = ? LIMIT 1`);
+            for (const e of edges) {
+                const src = findSrc.get(e.srcName, e.srcFile);
+                if (!src)
+                    continue; // src must exist; skip orphan edges defensively
+                let dstNode = null;
+                let dstUnresolved = e.dstUnresolved ?? null;
+                if (e.dstName) {
+                    let dst;
+                    if (e.dstFile) {
+                        dst = findDstByFile.get(e.dstName, e.dstFile);
+                    }
+                    // Fallback: name-only (edge predates dstFile, or the dst node landed
+                    // in a slightly different rel-path than the extractor reported).
+                    if (!dst) {
+                        dst = findDstByName.get(e.dstName);
+                    }
+                    if (dst) {
+                        dstNode = dst.node_id;
+                    }
+                    else {
+                        // dstName given but not in the scanned set → record as unresolved.
+                        dstUnresolved = e.dstName;
+                    }
+                }
+                insEdge.run(src.node_id, dstNode, e.edgeKind, dstUnresolved, e.callLine ?? null);
+            }
+        });
+        tx();
+    }
+    /** Look up a single node by its fully-qualified name (first match). */
+    getNode(name) {
+        const row = this.db
+            .prepare(`SELECT node_id, file, line, kind, name, signature, doc, exported
+           FROM cg_nodes WHERE name = ? LIMIT 1`)
+            .get(name);
+        if (!row)
+            return null;
+        return { ...row, exported: !!row.exported };
+    }
+    /** Look up a node by its surrogate id. */
+    getNodeById(nodeId) {
+        const row = this.db
+            .prepare(`SELECT node_id, file, line, kind, name, signature, doc, exported
+           FROM cg_nodes WHERE node_id = ?`)
+            .get(nodeId);
+        if (!row)
+            return null;
+        return { ...row, exported: !!row.exported };
+    }
+    /** All nodes sharing a fully-qualified name (collision set). */
+    getNodesByName(name) {
+        const rows = this.db
+            .prepare(`SELECT node_id, file, line, kind, name, signature, doc, exported
+           FROM cg_nodes WHERE name = ? ORDER BY file, line`)
+            .all(name);
+        return rows.map((r) => ({ ...r, exported: !!r.exported }));
+    }
+    /**
+     * Resolve a (possibly bare or suffix) symbol reference to a concrete node.
+     *
+     * Strategy: exact-name match first; if unique → resolved. If the exact name
+     * matches multiple nodes (collision), return them all as candidates so the
+     * caller can disambiguate rather than silently `LIMIT 1`. If the exact name
+     * misses entirely, fall back to a SUFFIX match (`%.<name>` — e.g. bare
+     * `close` → `SQLiteStorage.close`); a unique suffix hit resolves, multiple
+     * are surfaced as candidates. This is what makes bare names usable instead of
+     * silently returning found=false.
+     */
+    resolveSymbol(symbol) {
+        const exact = this.getNodesByName(symbol);
+        if (exact.length === 1) {
+            return { node: exact[0], candidates: toCandidates(exact), via: 'exact' };
+        }
+        if (exact.length > 1) {
+            return { node: null, candidates: toCandidates(exact), via: 'exact-ambiguous' };
+        }
+        // Suffix match: bare `close` → any `*.close`. Anchor on a `.` boundary so
+        // `close` does not also match `forceClose`.
+        const suffix = this.db
+            .prepare(`SELECT node_id, file, line, kind, name, signature, doc, exported
+           FROM cg_nodes WHERE name LIKE ? ORDER BY file, line`)
+            .all(`%.${symbol}`);
+        const suffixRows = suffix.map((r) => ({ ...r, exported: !!r.exported }));
+        if (suffixRows.length === 1) {
+            return { node: suffixRows[0], candidates: toCandidates(suffixRows), via: 'suffix' };
+        }
+        if (suffixRows.length > 1) {
+            return {
+                node: null,
+                candidates: toCandidates(suffixRows),
+                via: 'suffix-ambiguous',
+            };
+        }
+        return { node: null, candidates: [], via: 'none' };
+    }
+    /**
+     * Resolved callers of `nodeName` — nodes that have a `calls` edge pointing AT
+     * a node with this name. The reverse-edge primitive impact analysis builds on.
+     *
+     * When `nodeId` is supplied the query is scoped to that exact node, so
+     * collision names (22 `register`s) do not串台 — each caller set is keyed to
+     * its own node. Without `nodeId` the legacy name-only behavior is preserved.
+     */
+    getCallers(nodeName, nodeId) {
+        if (nodeId !== undefined) {
+            return this.db
+                .prepare(`SELECT src.node_id AS node_id, src.name AS name, src.file AS file,
+                  src.line AS line, src.kind AS kind, src.signature AS signature,
+                  e.edge_kind AS edge_kind, e.call_line AS call_line
+             FROM cg_edges e
+             JOIN cg_nodes src ON src.node_id = e.src_node
+            WHERE e.dst_node = ? AND e.edge_kind = 'calls'`)
+                .all(nodeId);
+        }
+        return this.db
+            .prepare(`SELECT src.node_id AS node_id, src.name AS name, src.file AS file,
+                src.line AS line, src.kind AS kind, src.signature AS signature,
+                e.edge_kind AS edge_kind, e.call_line AS call_line
+           FROM cg_edges e
+           JOIN cg_nodes dst ON dst.node_id = e.dst_node
+           JOIN cg_nodes src ON src.node_id = e.src_node
+          WHERE dst.name = ? AND e.edge_kind = 'calls'`)
+            .all(nodeName);
+    }
+    /**
+     * Resolved callees of `nodeName` — nodes a node with this name `calls`.
+     * Unresolved callees (external libs) are excluded; see
+     * {@link getUnresolvedCallees}. Pass `nodeId` to scope to a single node.
+     */
+    getCallees(nodeName, nodeId) {
+        if (nodeId !== undefined) {
+            return this.db
+                .prepare(`SELECT dst.node_id AS node_id, dst.name AS name, dst.file AS file,
+                  dst.line AS line, dst.kind AS kind, dst.signature AS signature,
+                  e.edge_kind AS edge_kind, e.call_line AS call_line
+             FROM cg_edges e
+             JOIN cg_nodes dst ON dst.node_id = e.dst_node
+            WHERE e.src_node = ? AND e.edge_kind = 'calls'`)
+                .all(nodeId);
+        }
+        return this.db
+            .prepare(`SELECT dst.node_id AS node_id, dst.name AS name, dst.file AS file,
+                dst.line AS line, dst.kind AS kind, dst.signature AS signature,
+                e.edge_kind AS edge_kind, e.call_line AS call_line
+           FROM cg_edges e
+           JOIN cg_nodes src ON src.node_id = e.src_node
+           JOIN cg_nodes dst ON dst.node_id = e.dst_node
+          WHERE src.name = ? AND e.edge_kind = 'calls'`)
+            .all(nodeName);
+    }
+    /**
+     * Inheritance callers — who `extends` or `implements` the named symbol.
+     * The `extends`/`implements` edges were always extracted + stored but never
+     * queryable (getCallers/getCallees hard-coded `edge_kind='calls'`), so
+     * "who implements LanguageAdapter" returned empty. This surfaces them.
+     *
+     * @param kinds  which heritage edges to include (default both).
+     * @param nodeId scope to a single node id (collision-safe) when supplied.
+     */
+    getInheritors(nodeName, kinds = ['extends', 'implements'], nodeId) {
+        const placeholders = kinds.map(() => '?').join(', ');
+        if (nodeId !== undefined) {
+            return this.db
+                .prepare(`SELECT src.node_id AS node_id, src.name AS name, src.file AS file,
+                  src.line AS line, src.kind AS kind, src.signature AS signature,
+                  e.edge_kind AS edge_kind, e.call_line AS call_line
+             FROM cg_edges e
+             JOIN cg_nodes src ON src.node_id = e.src_node
+            WHERE e.dst_node = ? AND e.edge_kind IN (${placeholders})`)
+                .all(nodeId, ...kinds);
+        }
+        return this.db
+            .prepare(`SELECT src.node_id AS node_id, src.name AS name, src.file AS file,
+                src.line AS line, src.kind AS kind, src.signature AS signature,
+                e.edge_kind AS edge_kind, e.call_line AS call_line
+           FROM cg_edges e
+           JOIN cg_nodes dst ON dst.node_id = e.dst_node
+           JOIN cg_nodes src ON src.node_id = e.src_node
+          WHERE dst.name = ? AND e.edge_kind IN (${placeholders})`)
+            .all(nodeName, ...kinds);
+    }
+    /**
+     * Unresolved (external) callee labels for `nodeName` — edges whose dst could
+     * not be resolved to a node in the scanned set. Pass `nodeId` to scope.
+     */
+    getUnresolvedCallees(nodeName, nodeId) {
+        if (nodeId !== undefined) {
+            const rows = this.db
+                .prepare(`SELECT e.dst_unresolved AS label
+             FROM cg_edges e
+            WHERE e.src_node = ? AND e.dst_node IS NULL
+              AND e.dst_unresolved IS NOT NULL`)
+                .all(nodeId);
+            return rows.map((r) => r.label);
+        }
+        const rows = this.db
+            .prepare(`SELECT e.dst_unresolved AS label
+           FROM cg_edges e
+           JOIN cg_nodes src ON src.node_id = e.src_node
+          WHERE src.name = ? AND e.dst_node IS NULL AND e.dst_unresolved IS NOT NULL`)
+            .all(nodeName);
+        return rows.map((r) => r.label);
+    }
+    /**
+     * FTS5 full-text search over (name, signature, doc). Returns up to `limit`
+     * hits. The query is passed to FTS5 MATCH; callers should sanitize untrusted
+     * input. Falls back to a LIKE substring scan if the FTS MATCH errors (e.g.
+     * a syntactically invalid FTS expression).
+     */
+    searchFts(query, limit = 20) {
+        try {
+            return this.db
+                .prepare(`SELECT n.name AS name, n.file AS file, n.line AS line,
+                  n.kind AS kind, n.signature AS signature
+             FROM cg_nodes_fts f
+             JOIN cg_nodes n ON n.node_id = f.rowid
+            WHERE cg_nodes_fts MATCH ?
+            LIMIT ?`)
+                .all(query, limit);
+        }
+        catch {
+            const like = `%${query}%`;
+            return this.db
+                .prepare(`SELECT name, file, line, kind, signature
+             FROM cg_nodes
+            WHERE name LIKE ? OR signature LIKE ?
+            LIMIT ?`)
+                .all(like, like, limit);
+        }
+    }
+    /** Total edge count for a given kind — used by build smoke checks. */
+    countEdges(kind) {
+        if (kind) {
+            const row = this.db
+                .prepare(`SELECT COUNT(*) AS c FROM cg_edges WHERE edge_kind = ?`)
+                .get(kind);
+            return row.c;
+        }
+        const row = this.db.prepare(`SELECT COUNT(*) AS c FROM cg_edges`).get();
+        return row.c;
+    }
+    /** Total node count. */
+    countNodes() {
+        const row = this.db.prepare(`SELECT COUNT(*) AS c FROM cg_nodes`).get();
+        return row.c;
+    }
+    /** List the files currently tracked in the graph. */
+    listFiles() {
+        const rows = this.db
+            .prepare(`SELECT file FROM cg_files ORDER BY file`)
+            .all();
+        return rows.map((r) => r.file);
+    }
+}
+//# sourceMappingURL=codegraph.js.map

package/dist/core/storage/codegraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"codegraph.js","sourceRoot":"","sources":["../../../src/core/storage/codegraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAChD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AA6DpC,gFAAgF;AAChF,oDAAoD;AACpD,gFAAgF;AAEhF,MAAM,gBAAgB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2CxB,CAAC;AAEF,6DAA6D;AAC7D,SAAS,YAAY,CAAC,IAAwB;IAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACvF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IACjB,EAAE,CAAoB;IACtB,MAAM,CAAS;IAEvB,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;QACvC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACpC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACK,OAAO;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,6BAA6B,CAAC;aACtC,GAAG,EAA6B,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,KAAK;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YAClC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACrC,yEAAyE;YACzE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;YAC5E,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACrC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QACH,EAAE,EAAE,CAAC;IACP,CAAC;IAED,4CAA4C;IAC5C,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,gBAAgB,CACd,IAAY,EACZ,KAAsB,EACtB,KAAsB,EACtB,IAA8D;QAE9D,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YAClC,sEAAsE;YACtE,gEAAgE;YAChE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE;iBACvB,OAAO,CAAC,6CAA6C,CAAC;iBACtD,GAAG,CAAC,IAAI,CAA+B,CAAC;YAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC5B;wCACgC,CACjC,CAAC;YACF,KAAK,MAAM,EAAE,OAAO,EAAE,IAAI,UAAU,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;qBAChB,OAAO,CAAC,6DAA6D,CAAC;qBACtE,GAAG,CAAC,OAAO,CAAmE,CAAC;gBAClF,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE,EAAE,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;YACpE,CAAC;YACD,oEAAoE;YACpE,kDAAkD;YAClD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEjE,qCAAqC;YACrC,IAAI,CAAC,EAAE;iBACJ,OAAO,CACN;gCACsB,CACvB;iBACA,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,IAAI,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC;YAEjF,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC7B;uCAC+B,CAChC,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC5B,0EAA0E,CAC3E,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CACtB,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,SAAS,IAAI,EAAE,EACjB,CAAC,CAAC,GAAG,IAAI,IAAI,EACb,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACnB,CAAC;gBACF,MAAM,CAAC,GAAG,CACR,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,EAC5B,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,SAAS,IAAI,EAAE,EACjB,CAAC,CAAC,GAAG,IAAI,EAAE,CACZ,CAAC;YACJ,CAAC;YAED,mEAAmE;YACnE,0EAA0E;YAC1E,uEAAuE;YACvE,yEAAyE;YACzE,yEAAyE;YACzE,sEAAsE;YACtE,mDAAmD;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC7B;iCACyB,CAC1B,CAAC;YACF,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC7B,kEAAkE,CACnE,CAAC;YACF,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACnC,kEAAkE,CACnE,CAAC;YACF,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACnC,qDAAqD,CACtD,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAoC,CAAC;gBACjF,IAAI,CAAC,GAAG;oBAAE,SAAS,CAAC,gDAAgD;gBAEpE,IAAI,OAAO,GAAkB,IAAI,CAAC;gBAClC,IAAI,aAAa,GAAkB,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC;gBAC3D,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;oBACd,IAAI,GAAoC,CAAC;oBACzC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;wBACd,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAE/B,CAAC;oBAChB,CAAC;oBACD,qEAAqE;oBACrE,iEAAiE;oBACjE,IAAI,CAAC,GAAG,EAAE,CAAC;wBACT,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAoC,CAAC;oBACxE,CAAC;oBACD,IAAI,GAAG,EAAE,CAAC;wBACR,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;oBACxB,CAAC;yBAAM,CAAC;wBACN,mEAAmE;wBACnE,aAAa,GAAG,CAAC,CAAC,OAAO,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE,aAAa,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;YACnF,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,EAAE,CAAC;IACP,CAAC;IAED,uEAAuE;IACvE,OAAO,CAAC,IAAY;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CACN;gDACwC,CACzC;aACA,GAAG,CAAC,IAAI,CAEE,CAAC;QACd,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,OAAO,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED,0CAA0C;IAC1C,WAAW,CAAC,MAAc;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CACN;2CACmC,CACpC;aACA,GAAG,CAAC,MAAM,CAEA,CAAC;QACd,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,OAAO,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED,gEAAgE;IAChE,cAAc,CAAC,IAAY;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CACN;4DACoD,CACrD;aACA,GAAG,CAAC,IAAI,CAAqE,CAAC;QACjF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;;OAUG;IACH,aAAa,CAAC,MAAc;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;QAC3E,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,iBAAiB,EAAE,CAAC;QACjF,CAAC;QAED,0EAA0E;QAC1E,4CAA4C;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CACN;+DACuD,CACxD;aACA,GAAG,CAAC,KAAK,MAAM,EAAE,CAEnB,CAAC;QACF,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACzE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;QACtF,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,IAAI,EAAE,IAAI;gBACV,UAAU,EAAE,YAAY,CAAC,UAAU,CAAC;gBACpC,GAAG,EAAE,kBAAkB;aACxB,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,QAAgB,EAAE,MAAe;QAC1C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;;;;2DAKiD,CAClD;iBACA,GAAG,CAAC,MAAM,CAAwB,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC,EAAE;aACX,OAAO,CACN;;;;;;uDAM+C,CAChD;aACA,GAAG,CAAC,QAAQ,CAAwB,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,QAAgB,EAAE,MAAe;QAC1C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;;;;2DAKiD,CAClD;iBACA,GAAG,CAAC,MAAM,CAAwB,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC,EAAE;aACX,OAAO,CACN;;;;;;uDAM+C,CAChD;aACA,GAAG,CAAC,QAAQ,CAAwB,CAAC;IAC1C,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CACX,QAAgB,EAChB,QAAyC,CAAC,SAAS,EAAE,YAAY,CAAC,EAClE,MAAe;QAEf,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;;;;uDAK6C,YAAY,GAAG,CAC7D;iBACA,GAAG,CAAC,MAAM,EAAE,GAAG,KAAK,CAAwB,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC,EAAE;aACX,OAAO,CACN;;;;;;mDAM2C,YAAY,GAAG,CAC3D;aACA,GAAG,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAwB,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,QAAgB,EAAE,MAAe;QACpD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;iBACjB,OAAO,CACN;;;+CAGqC,CACtC;iBACA,GAAG,CAAC,MAAM,CAA6B,CAAC;YAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CACN;;;qFAG6E,CAC9E;aACA,GAAG,CAAC,QAAQ,CAA6B,CAAC;QAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,KAAa,EAAE,KAAK,GAAG,EAAE;QACjC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;;;;oBAKU,CACX;iBACA,GAAG,CAAC,KAAK,EAAE,KAAK,CAAyB,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,GAAG,IAAI,KAAK,GAAG,CAAC;YAC1B,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;;oBAGU,CACX;iBACA,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAyB,CAAC;QACpD,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,UAAU,CAAC,IAAwB;QACjC,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;iBAChB,OAAO,CAAC,wDAAwD,CAAC;iBACjE,GAAG,CAAC,IAAI,CAAkB,CAAC;YAC9B,OAAO,GAAG,CAAC,CAAC,CAAC;QACf,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC,GAAG,EAAmB,CAAC;QACzF,OAAO,GAAG,CAAC,CAAC,CAAC;IACf,CAAC;IAED,wBAAwB;IACxB,UAAU;QACR,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC,GAAG,EAAmB,CAAC;QACzF,OAAO,GAAG,CAAC,CAAC,CAAC;IACf,CAAC;IAED,qDAAqD;IACrD,SAAS;QACP,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,yCAAyC,CAAC;aAClD,GAAG,EAA6B,CAAC;QACpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;CACF"}