@persql/context 0.1.0

package/dist/index.cjs

@@ -0,0 +1,549 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var index_exports = {};
+__export(index_exports, {
+  ContextStore: () => ContextStore,
+  EXTRACTION_JSON_SCHEMA: () => EXTRACTION_JSON_SCHEMA,
+  EXTRACTION_SYSTEM_PROMPT: () => EXTRACTION_SYSTEM_PROMPT,
+  SCHEMA_SQL: () => SCHEMA_SQL,
+  SCHEMA_VERSION: () => SCHEMA_VERSION,
+  TABLE_PREFIX: () => TABLE_PREFIX,
+  buildByTag: () => buildByTag,
+  buildEdgesAmong: () => buildEdgesAmong,
+  buildExtractionMessages: () => buildExtractionMessages,
+  buildForget: () => buildForget,
+  buildGet: () => buildGet,
+  buildInit: () => buildInit,
+  buildNeighborEntities: () => buildNeighborEntities,
+  buildRecall: () => buildRecall,
+  buildRecent: () => buildRecent,
+  buildRemember: () => buildRemember,
+  buildStats: () => buildStats,
+  buildSupersede: () => buildSupersede,
+  buildUpsertEdge: () => buildUpsertEdge,
+  buildUpsertEntity: () => buildUpsertEntity,
+  context: () => context,
+  entityId: () => entityId,
+  normalizeTags: () => normalizeTags,
+  toFtsQuery: () => toFtsQuery
+});
+module.exports = __toCommonJS(index_exports);
+
+// src/core.ts
+var SCHEMA_VERSION = 1;
+var TABLE_PREFIX = "ctx_";
+var T = TABLE_PREFIX;
+var SCHEMA_SQL = [
+  `CREATE TABLE IF NOT EXISTS ${T}memory (
+     id TEXT PRIMARY KEY,
+     kind TEXT NOT NULL DEFAULT 'fact',
+     topic TEXT,
+     body TEXT NOT NULL,
+     tags TEXT,
+     source TEXT,
+     created_at INTEGER NOT NULL,
+     superseded_by TEXT
+   )`,
+  `CREATE INDEX IF NOT EXISTS ${T}memory_kind ON ${T}memory(kind)`,
+  `CREATE INDEX IF NOT EXISTS ${T}memory_created ON ${T}memory(created_at)`,
+  `CREATE INDEX IF NOT EXISTS ${T}memory_superseded ON ${T}memory(superseded_by)`,
+  // External-content FTS index: body text is not duplicated, only indexed.
+  // Porter stemmer so "invoice" recalls "invoicing" without embeddings.
+  `CREATE VIRTUAL TABLE IF NOT EXISTS ${T}memory_fts USING fts5(
+     topic, body, tags,
+     content='${T}memory', content_rowid='rowid',
+     tokenize='porter unicode61'
+   )`,
+  `CREATE TRIGGER IF NOT EXISTS ${T}memory_ai AFTER INSERT ON ${T}memory BEGIN
+     INSERT INTO ${T}memory_fts(rowid, topic, body, tags)
+     VALUES (new.rowid, new.topic, new.body, new.tags);
+   END`,
+  `CREATE TRIGGER IF NOT EXISTS ${T}memory_ad AFTER DELETE ON ${T}memory BEGIN
+     INSERT INTO ${T}memory_fts(${T}memory_fts, rowid, topic, body, tags)
+     VALUES ('delete', old.rowid, old.topic, old.body, old.tags);
+   END`,
+  `CREATE TRIGGER IF NOT EXISTS ${T}memory_au AFTER UPDATE ON ${T}memory BEGIN
+     INSERT INTO ${T}memory_fts(${T}memory_fts, rowid, topic, body, tags)
+     VALUES ('delete', old.rowid, old.topic, old.body, old.tags);
+     INSERT INTO ${T}memory_fts(rowid, topic, body, tags)
+     VALUES (new.rowid, new.topic, new.body, new.tags);
+   END`,
+  `CREATE TABLE IF NOT EXISTS ${T}entity (
+     id TEXT PRIMARY KEY,
+     name TEXT NOT NULL,
+     kind TEXT,
+     body TEXT,
+     created_at INTEGER NOT NULL
+   )`,
+  `CREATE TABLE IF NOT EXISTS ${T}edge (
+     id TEXT PRIMARY KEY,
+     src TEXT NOT NULL,
+     rel TEXT NOT NULL,
+     dst TEXT NOT NULL,
+     source TEXT,
+     created_at INTEGER NOT NULL
+   )`,
+  `CREATE INDEX IF NOT EXISTS ${T}edge_src ON ${T}edge(src)`,
+  `CREATE INDEX IF NOT EXISTS ${T}edge_dst ON ${T}edge(dst)`
+];
+function buildInit() {
+  return SCHEMA_SQL.map((sql) => ({ sql, params: [] }));
+}
+var FTS_OPERATORS = /* @__PURE__ */ new Set(["and", "or", "not", "near"]);
+function normalizeTags(tags) {
+  if (!tags) return null;
+  const arr = Array.isArray(tags) ? tags : String(tags).split(/[,\s]+/);
+  const norm = Array.from(
+    new Set(arr.map((t) => t.trim().toLowerCase()).filter(Boolean))
+  );
+  return norm.length ? norm.join(" ") : null;
+}
+function toFtsQuery(input, opts = {}) {
+  if (opts.mode === "raw") return input.trim() || null;
+  const tokens = (input.match(/[\p{L}\p{N}_]+/gu) ?? []).filter(
+    (t) => !FTS_OPERATORS.has(t.toLowerCase())
+  );
+  if (!tokens.length) return null;
+  const joiner = opts.operator === "and" ? " AND " : " OR ";
+  return tokens.map((t) => `"${t}"`).join(joiner);
+}
+function slugId(prefix, s) {
+  const base = s.toLowerCase().replace(/[^a-z0-9]+/g, "-").replace(/^-+|-+$/g, "").slice(0, 96);
+  return prefix + (base || "x");
+}
+function entityId(name) {
+  return slugId("e_", name);
+}
+function resolveEntityRef(ref) {
+  return ref.startsWith("e_") ? ref : entityId(ref);
+}
+function edgeId(srcId, rel, dstId) {
+  return slugId("x_", `${srcId}|${rel}|${dstId}`);
+}
+var MEMORY_COLS = "id, kind, topic, body, tags, source, created_at AS createdAt, superseded_by AS supersededBy";
+function buildRemember(input, now, id) {
+  return {
+    sql: `INSERT INTO ${T}memory (id, kind, topic, body, tags, source, created_at, superseded_by)
+          VALUES (?, ?, ?, ?, ?, ?, ?, NULL)`,
+    params: [
+      id,
+      input.kind ?? "fact",
+      input.topic ?? null,
+      input.body,
+      normalizeTags(input.tags),
+      input.source ?? null,
+      now
+    ]
+  };
+}
+function buildSupersede(oldId, newId) {
+  return {
+    sql: `UPDATE ${T}memory SET superseded_by = ? WHERE id = ? AND superseded_by IS NULL`,
+    params: [newId, oldId]
+  };
+}
+function buildForget(id) {
+  return { sql: `DELETE FROM ${T}memory WHERE id = ?`, params: [id] };
+}
+function buildGet(id) {
+  return {
+    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory WHERE id = ?`,
+    params: [id]
+  };
+}
+function buildRecall(query, opts = {}) {
+  const match = toFtsQuery(query, { operator: opts.operator, mode: opts.mode });
+  if (!match) return null;
+  const where = [`${T}memory_fts MATCH ?`];
+  const params = [match];
+  if (!opts.includeSuperseded) where.push("m.superseded_by IS NULL");
+  if (opts.kind) {
+    where.push("m.kind = ?");
+    params.push(opts.kind);
+  }
+  if (opts.sinceMs != null) {
+    where.push("m.created_at >= ?");
+    params.push(opts.sinceMs);
+  }
+  params.push(opts.limit ?? 8);
+  return {
+    sql: `SELECT m.id, m.kind, m.topic, m.body, m.tags, m.source,
+                 m.created_at AS createdAt, m.superseded_by AS supersededBy
+          FROM ${T}memory_fts
+          JOIN ${T}memory m ON m.rowid = ${T}memory_fts.rowid
+          WHERE ${where.join(" AND ")}
+          ORDER BY ${T}memory_fts.rank
+          LIMIT ?`,
+    params
+  };
+}
+function buildRecent(opts = {}) {
+  const where = [];
+  const params = [];
+  if (!opts.includeSuperseded) where.push("superseded_by IS NULL");
+  if (opts.kind) {
+    where.push("kind = ?");
+    params.push(opts.kind);
+  }
+  params.push(opts.limit ?? 20);
+  return {
+    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory
+          ${where.length ? "WHERE " + where.join(" AND ") : ""}
+          ORDER BY created_at DESC
+          LIMIT ?`,
+    params
+  };
+}
+function buildByTag(tag, opts = {}) {
+  const t = tag.trim().toLowerCase();
+  const where = ["(' ' || COALESCE(tags, '') || ' ') LIKE ?"];
+  const params = [`% ${t} %`];
+  if (!opts.includeSuperseded) where.push("superseded_by IS NULL");
+  if (opts.kind) {
+    where.push("kind = ?");
+    params.push(opts.kind);
+  }
+  params.push(opts.limit ?? 20);
+  return {
+    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory
+          WHERE ${where.join(" AND ")}
+          ORDER BY created_at DESC
+          LIMIT ?`,
+    params
+  };
+}
+function buildStats() {
+  return {
+    sql: `SELECT
+            (SELECT count(*) FROM ${T}memory WHERE superseded_by IS NULL) AS facts,
+            (SELECT count(*) FROM ${T}memory) AS facts_total,
+            (SELECT count(*) FROM ${T}entity) AS entities,
+            (SELECT count(*) FROM ${T}edge) AS edges`,
+    params: []
+  };
+}
+function buildUpsertEntity(e, now) {
+  const id = e.id ?? entityId(e.name);
+  return {
+    sql: `INSERT INTO ${T}entity (id, name, kind, body, created_at)
+          VALUES (?, ?, ?, ?, ?)
+          ON CONFLICT(id) DO UPDATE SET
+            name = excluded.name,
+            kind = COALESCE(excluded.kind, ${T}entity.kind),
+            body = COALESCE(excluded.body, ${T}entity.body)`,
+    params: [id, e.name, e.kind ?? null, e.body ?? null, now]
+  };
+}
+function buildUpsertEdge(e, now) {
+  const srcId = resolveEntityRef(e.src);
+  const dstId = resolveEntityRef(e.dst);
+  const id = edgeId(srcId, e.rel, dstId);
+  return {
+    sql: `INSERT INTO ${T}edge (id, src, rel, dst, source, created_at)
+          VALUES (?, ?, ?, ?, ?, ?)
+          ON CONFLICT(id) DO UPDATE SET
+            source = COALESCE(excluded.source, ${T}edge.source)`,
+    params: [id, srcId, e.rel, dstId, e.source ?? null, now]
+  };
+}
+function buildNeighborEntities(seedId, depth, limit) {
+  return {
+    sql: `WITH RECURSIVE reach(id, depth) AS (
+            SELECT ?, 0
+            UNION
+            SELECT CASE WHEN e.src = reach.id THEN e.dst ELSE e.src END,
+                   reach.depth + 1
+            FROM reach
+            JOIN ${T}edge e ON (e.src = reach.id OR e.dst = reach.id)
+            WHERE reach.depth < ?
+          )
+          SELECT en.id, en.name, en.kind, en.body,
+                 en.created_at AS createdAt, MIN(reach.depth) AS depth
+          FROM reach
+          JOIN ${T}entity en ON en.id = reach.id
+          WHERE reach.depth > 0 AND en.id <> ?
+          GROUP BY en.id
+          ORDER BY depth, en.name
+          LIMIT ?`,
+    // The seed reappears at depth >0 via a round-trip on undirected edges;
+    // exclude it explicitly so it isn't listed as its own neighbor.
+    params: [seedId, depth, seedId, limit]
+  };
+}
+function buildEdgesAmong(ids) {
+  if (!ids.length) {
+    return { sql: `SELECT id, src, rel, dst, source, created_at AS createdAt FROM ${T}edge WHERE 0`, params: [] };
+  }
+  const ph = ids.map(() => "?").join(", ");
+  return {
+    sql: `SELECT id, src, rel, dst, source, created_at AS createdAt
+          FROM ${T}edge
+          WHERE src IN (${ph}) AND dst IN (${ph})`,
+    params: [...ids, ...ids]
+  };
+}
+var EXTRACTION_SYSTEM_PROMPT = `You extract durable, shareable context from raw text for a team of AI agents that will read it later by keyword.
+
+Return JSON: { "facts": [...], "entities": [...], "edges": [...] }.
+- facts: atomic, self-contained statements worth remembering across sessions \u2014 decisions, conventions, constraints, identifiers, preferences. Each: { "body": string, "topic"?: string, "tags"?: string[] }. Prefer specific and stable over transient chatter.
+- entities: named things \u2014 services, people, tables, repos, concepts. Each: { "name": string, "kind"?: string, "body"?: short description }.
+- edges: relationships between entities, referencing entity names. Each: { "src": name, "rel": string, "dst": name }.
+
+Be conservative: omit anything ephemeral or low-value. Use lowercase tags. If nothing is worth keeping, return empty arrays.`;
+function buildExtractionMessages(raw, opts = {}) {
+  return [
+    { role: "system", content: EXTRACTION_SYSTEM_PROMPT },
+    {
+      role: "user",
+      content: (opts.hint ? `Context: ${opts.hint}
+
+` : "") + raw
+    }
+  ];
+}
+var EXTRACTION_JSON_SCHEMA = {
+  type: "object",
+  properties: {
+    facts: {
+      type: "array",
+      items: {
+        type: "object",
+        properties: {
+          body: { type: "string" },
+          topic: { type: "string" },
+          tags: { type: "array", items: { type: "string" } }
+        },
+        required: ["body"]
+      }
+    },
+    entities: {
+      type: "array",
+      items: {
+        type: "object",
+        properties: {
+          name: { type: "string" },
+          kind: { type: "string" },
+          body: { type: "string" }
+        },
+        required: ["name"]
+      }
+    },
+    edges: {
+      type: "array",
+      items: {
+        type: "object",
+        properties: {
+          src: { type: "string" },
+          rel: { type: "string" },
+          dst: { type: "string" }
+        },
+        required: ["src", "rel", "dst"]
+      }
+    }
+  }
+};
+
+// src/index.ts
+function uid(prefix) {
+  const g = globalThis;
+  const r = g.crypto?.randomUUID?.() ?? `${Date.now().toString(36)}-${Math.floor(Math.random() * 1e9).toString(36)}`;
+  return prefix + r;
+}
+var ContextStore = class {
+  constructor(db, opts = {}) {
+    this.db = db;
+    this.opts = opts;
+  }
+  /** Create the schema (idempotent). Run once before first use. */
+  async init() {
+    await this.db.batch(buildInit());
+  }
+  // --- writes -------------------------------------------------------------
+  /** Store one structured fact/episode/artifact. Returns its id. */
+  async remember(input) {
+    const id = input.id ?? uid("m_");
+    const now = Date.now();
+    const stmts = [
+      buildRemember({ ...input, source: input.source ?? this.opts.source }, now, id)
+    ];
+    const sup = input.supersedes ? Array.isArray(input.supersedes) ? input.supersedes : [input.supersedes] : [];
+    for (const old of sup) stmts.push(buildSupersede(old, id));
+    await this.db.transaction(stmts);
+    return id;
+  }
+  /**
+   * Extract durable context from raw text and store it. The LLM runs on the
+   * write path; pass `extract` here or to the constructor (or use the hosted
+   * Context MCP, which runs extraction server-side and meters it).
+   */
+  async rememberRaw(raw, opts = {}) {
+    const extract = opts.extract ?? this.opts.extract;
+    if (!extract) {
+      throw new Error(
+        "ContextStore.rememberRaw needs an extractor: pass { extract } here or to the constructor, or use the hosted PerSQL Context MCP."
+      );
+    }
+    const extracted = await extract(raw, { hint: opts.hint });
+    return this.write(extracted, { source: opts.source });
+  }
+  /** Persist an already-extracted bundle of facts, entities, and edges. */
+  async write(extracted, opts = {}) {
+    const now = Date.now();
+    const source = opts.source ?? this.opts.source;
+    const stmts = [];
+    const memoryIds = [];
+    const entityIds = /* @__PURE__ */ new Set();
+    for (const f of extracted.facts ?? []) {
+      const id = uid("m_");
+      memoryIds.push(id);
+      stmts.push(buildRemember({ ...f, source }, now, id));
+    }
+    for (const e of extracted.entities ?? []) {
+      stmts.push(buildUpsertEntity(e, now));
+      entityIds.add(e.id ?? entityId(e.name));
+    }
+    for (const ed of extracted.edges ?? []) {
+      stmts.push(buildUpsertEntity({ name: ed.src }, now));
+      stmts.push(buildUpsertEntity({ name: ed.dst }, now));
+      stmts.push(buildUpsertEdge({ ...ed, source: ed.source ?? source }, now));
+      entityIds.add(entityId(ed.src));
+      entityIds.add(entityId(ed.dst));
+    }
+    if (stmts.length) await this.db.transaction(stmts);
+    return {
+      memoryIds,
+      entityIds: [...entityIds],
+      edgeCount: (extracted.edges ?? []).length
+    };
+  }
+  /** Mark older memory rows as replaced by `newId` (filtered out of recall). */
+  async supersede(oldIds, newId) {
+    const ids = Array.isArray(oldIds) ? oldIds : [oldIds];
+    await this.db.transaction(ids.map((o) => buildSupersede(o, newId)));
+  }
+  /** Hard-delete a memory row. */
+  async forget(id) {
+    const s = buildForget(id);
+    await this.db.query(s.sql, s.params);
+  }
+  /** Add a relationship between two entities (created if absent). */
+  async link(src, rel, dst, opts = {}) {
+    const now = Date.now();
+    await this.db.transaction([
+      buildUpsertEntity({ name: src }, now),
+      buildUpsertEntity({ name: dst }, now),
+      buildUpsertEdge(
+        { src, rel, dst, source: opts.source ?? this.opts.source },
+        now
+      )
+    ]);
+  }
+  // --- reads (no AI, pure lexical SQL) ------------------------------------
+  /** Keyword recall, BM25-ranked, most relevant first. */
+  async recall(query, opts = {}) {
+    const resolved = { ...opts };
+    if (opts.withinDays != null && opts.sinceMs == null) {
+      resolved.sinceMs = Date.now() - opts.withinDays * 864e5;
+    }
+    const s = buildRecall(query, resolved);
+    if (!s) return [];
+    const { data } = await this.db.query(s.sql, s.params);
+    return data;
+  }
+  /** Most recent memory rows. */
+  async recent(opts = {}) {
+    const s = buildRecent(opts);
+    const { data } = await this.db.query(s.sql, s.params);
+    return data;
+  }
+  /** Memory rows carrying a given tag. */
+  async byTag(tag, opts = {}) {
+    const s = buildByTag(tag, opts);
+    const { data } = await this.db.query(s.sql, s.params);
+    return data;
+  }
+  /** Fetch one memory row by id, or null. */
+  async get(id) {
+    const s = buildGet(id);
+    const { data } = await this.db.query(s.sql, s.params);
+    return data[0] ?? null;
+  }
+  /** The subgraph around an entity: reachable entities + the edges among them. */
+  async neighbors(name, opts = {}) {
+    const seed = name.startsWith("e_") ? name : entityId(name);
+    const depth = Math.min(Math.max(opts.depth ?? 1, 1), 4);
+    const entStmt = buildNeighborEntities(seed, depth, opts.limit ?? 50);
+    const { data: entities } = await this.db.query(
+      entStmt.sql,
+      entStmt.params
+    );
+    const ids = [seed, ...entities.map((e) => e.id)];
+    const edgeStmt = buildEdgesAmong(ids);
+    const { data: edges } = await this.db.query(
+      edgeStmt.sql,
+      edgeStmt.params
+    );
+    return { entities, edges };
+  }
+  /** Counts: current facts, total facts, entities, edges. */
+  async stats() {
+    const s = buildStats();
+    const { data } = await this.db.query(s.sql, s.params);
+    const r = data[0];
+    return {
+      facts: r?.facts ?? 0,
+      factsTotal: r?.facts_total ?? 0,
+      entities: r?.entities ?? 0,
+      edges: r?.edges ?? 0
+    };
+  }
+};
+function context(db, opts) {
+  return new ContextStore(db, opts);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ContextStore,
+  EXTRACTION_JSON_SCHEMA,
+  EXTRACTION_SYSTEM_PROMPT,
+  SCHEMA_SQL,
+  SCHEMA_VERSION,
+  TABLE_PREFIX,
+  buildByTag,
+  buildEdgesAmong,
+  buildExtractionMessages,
+  buildForget,
+  buildGet,
+  buildInit,
+  buildNeighborEntities,
+  buildRecall,
+  buildRecent,
+  buildRemember,
+  buildStats,
+  buildSupersede,
+  buildUpsertEdge,
+  buildUpsertEntity,
+  context,
+  entityId,
+  normalizeTags,
+  toFtsQuery
+});
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/core.ts"],"sourcesContent":["/**\n * @persql/context — shared, structured agent context on the PerSQL substrate.\n *\n * One store, readable and writable from every agent surface PerSQL speaks\n * (SDK, MCP, published endpoints, CLI). Reads and structured writes are plain\n * SQL over `@persql/sdk` — cheap, exact, lexical (FTS5). The raw-dump extract\n * path puts the LLM on the *write* side: file once, recall by keyword forever.\n */\n\nimport type { PerSQLDatabase } from \"@persql/sdk\";\nimport {\n  buildInit,\n  buildRemember,\n  buildSupersede,\n  buildForget,\n  buildGet,\n  buildRecall,\n  buildRecent,\n  buildByTag,\n  buildStats,\n  buildUpsertEntity,\n  buildUpsertEdge,\n  buildNeighborEntities,\n  buildEdgesAmong,\n  entityId,\n  type RememberInput,\n  type RecallOptions,\n  type ListOptions,\n  type MemoryRow,\n  type EntityInput,\n  type Edge,\n  type Entity,\n  type ExtractedContext,\n  type SqlStatement,\n} from \"./core\";\n\nexport * from \"./core\";\n\n/** Bring-your-own-LLM extractor, or use the hosted PerSQL Context worker. */\nexport type Extractor = (\n  raw: string,\n  ctx: { hint?: string }\n) => Promise<ExtractedContext>;\n\nexport interface ContextStoreOptions {\n  /** Default extractor for `rememberRaw` (model-agnostic; you supply it). */\n  extract?: Extractor;\n  /** Default provenance label stamped on writes (e.g. \"claude-code\"). */\n  source?: string;\n}\n\nexport interface WriteResult {\n  memoryIds: string[];\n  entityIds: string[];\n  edgeCount: number;\n}\n\nexport interface ContextStats {\n  facts: number;\n  factsTotal: number;\n  entities: number;\n  edges: number;\n}\n\nfunction uid(prefix: string): string {\n  const g = globalThis as { crypto?: { randomUUID?: () => string } };\n  const r =\n    g.crypto?.randomUUID?.() ??\n    `${Date.now().toString(36)}-${Math.floor(Math.random() * 1e9).toString(36)}`;\n  return prefix + r;\n}\n\nexport class ContextStore {\n  constructor(\n    private readonly db: PerSQLDatabase,\n    private readonly opts: ContextStoreOptions = {}\n  ) {}\n\n  /** Create the schema (idempotent). Run once before first use. */\n  async init(): Promise<void> {\n    await this.db.batch(buildInit());\n  }\n\n  // --- writes -------------------------------------------------------------\n\n  /** Store one structured fact/episode/artifact. Returns its id. */\n  async remember(input: RememberInput): Promise<string> {\n    const id = input.id ?? uid(\"m_\");\n    const now = Date.now();\n    const stmts: SqlStatement[] = [\n      buildRemember({ ...input, source: input.source ?? this.opts.source }, now, id),\n    ];\n    const sup = input.supersedes\n      ? Array.isArray(input.supersedes)\n        ? input.supersedes\n        : [input.supersedes]\n      : [];\n    for (const old of sup) stmts.push(buildSupersede(old, id));\n    await this.db.transaction(stmts);\n    return id;\n  }\n\n  /**\n   * Extract durable context from raw text and store it. The LLM runs on the\n   * write path; pass `extract` here or to the constructor (or use the hosted\n   * Context MCP, which runs extraction server-side and meters it).\n   */\n  async rememberRaw(\n    raw: string,\n    opts: { extract?: Extractor; hint?: string; source?: string } = {}\n  ): Promise<WriteResult> {\n    const extract = opts.extract ?? this.opts.extract;\n    if (!extract) {\n      throw new Error(\n        \"ContextStore.rememberRaw needs an extractor: pass { extract } here or to the constructor, or use the hosted PerSQL Context MCP.\"\n      );\n    }\n    const extracted = await extract(raw, { hint: opts.hint });\n    return this.write(extracted, { source: opts.source });\n  }\n\n  /** Persist an already-extracted bundle of facts, entities, and edges. */\n  async write(\n    extracted: ExtractedContext,\n    opts: { source?: string } = {}\n  ): Promise<WriteResult> {\n    const now = Date.now();\n    const source = opts.source ?? this.opts.source;\n    const stmts: SqlStatement[] = [];\n    const memoryIds: string[] = [];\n    const entityIds = new Set<string>();\n\n    for (const f of extracted.facts ?? []) {\n      const id = uid(\"m_\");\n      memoryIds.push(id);\n      stmts.push(buildRemember({ ...f, source }, now, id));\n    }\n    for (const e of extracted.entities ?? []) {\n      stmts.push(buildUpsertEntity(e, now));\n      entityIds.add(e.id ?? entityId(e.name));\n    }\n    for (const ed of extracted.edges ?? []) {\n      // Ensure both endpoints exist before linking them.\n      stmts.push(buildUpsertEntity({ name: ed.src }, now));\n      stmts.push(buildUpsertEntity({ name: ed.dst }, now));\n      stmts.push(buildUpsertEdge({ ...ed, source: ed.source ?? source }, now));\n      entityIds.add(entityId(ed.src));\n      entityIds.add(entityId(ed.dst));\n    }\n\n    if (stmts.length) await this.db.transaction(stmts);\n    return {\n      memoryIds,\n      entityIds: [...entityIds],\n      edgeCount: (extracted.edges ?? []).length,\n    };\n  }\n\n  /** Mark older memory rows as replaced by `newId` (filtered out of recall). */\n  async supersede(oldIds: string | string[], newId: string): Promise<void> {\n    const ids = Array.isArray(oldIds) ? oldIds : [oldIds];\n    await this.db.transaction(ids.map((o) => buildSupersede(o, newId)));\n  }\n\n  /** Hard-delete a memory row. */\n  async forget(id: string): Promise<void> {\n    const s = buildForget(id);\n    await this.db.query(s.sql, s.params);\n  }\n\n  /** Add a relationship between two entities (created if absent). */\n  async link(\n    src: string,\n    rel: string,\n    dst: string,\n    opts: { source?: string } = {}\n  ): Promise<void> {\n    const now = Date.now();\n    await this.db.transaction([\n      buildUpsertEntity({ name: src }, now),\n      buildUpsertEntity({ name: dst }, now),\n      buildUpsertEdge(\n        { src, rel, dst, source: opts.source ?? this.opts.source },\n        now\n      ),\n    ]);\n  }\n\n  // --- reads (no AI, pure lexical SQL) ------------------------------------\n\n  /** Keyword recall, BM25-ranked, most relevant first. */\n  async recall(query: string, opts: RecallOptions = {}): Promise<MemoryRow[]> {\n    const resolved: RecallOptions = { ...opts };\n    if (opts.withinDays != null && opts.sinceMs == null) {\n      resolved.sinceMs = Date.now() - opts.withinDays * 86_400_000;\n    }\n    const s = buildRecall(query, resolved);\n    if (!s) return [];\n    const { data } = await this.db.query<MemoryRow>(s.sql, s.params);\n    return data;\n  }\n\n  /** Most recent memory rows. */\n  async recent(opts: ListOptions = {}): Promise<MemoryRow[]> {\n    const s = buildRecent(opts);\n    const { data } = await this.db.query<MemoryRow>(s.sql, s.params);\n    return data;\n  }\n\n  /** Memory rows carrying a given tag. */\n  async byTag(tag: string, opts: ListOptions = {}): Promise<MemoryRow[]> {\n    const s = buildByTag(tag, opts);\n    const { data } = await this.db.query<MemoryRow>(s.sql, s.params);\n    return data;\n  }\n\n  /** Fetch one memory row by id, or null. */\n  async get(id: string): Promise<MemoryRow | null> {\n    const s = buildGet(id);\n    const { data } = await this.db.query<MemoryRow>(s.sql, s.params);\n    return data[0] ?? null;\n  }\n\n  /** The subgraph around an entity: reachable entities + the edges among them. */\n  async neighbors(\n    name: string,\n    opts: { depth?: number; limit?: number } = {}\n  ): Promise<{ entities: Entity[]; edges: Edge[] }> {\n    const seed = name.startsWith(\"e_\") ? name : entityId(name);\n    const depth = Math.min(Math.max(opts.depth ?? 1, 1), 4);\n    const entStmt = buildNeighborEntities(seed, depth, opts.limit ?? 50);\n    const { data: entities } = await this.db.query<Entity>(\n      entStmt.sql,\n      entStmt.params\n    );\n    const ids = [seed, ...entities.map((e) => e.id)];\n    const edgeStmt = buildEdgesAmong(ids);\n    const { data: edges } = await this.db.query<Edge>(\n      edgeStmt.sql,\n      edgeStmt.params\n    );\n    return { entities, edges };\n  }\n\n  /** Counts: current facts, total facts, entities, edges. */\n  async stats(): Promise<ContextStats> {\n    const s = buildStats();\n    const { data } = await this.db.query<{\n      facts: number;\n      facts_total: number;\n      entities: number;\n      edges: number;\n    }>(s.sql, s.params);\n    const r = data[0];\n    return {\n      facts: r?.facts ?? 0,\n      factsTotal: r?.facts_total ?? 0,\n      entities: r?.entities ?? 0,\n      edges: r?.edges ?? 0,\n    };\n  }\n}\n\n/** Wrap a PerSQL database handle as a shared context store. */\nexport function context(\n  db: PerSQLDatabase,\n  opts?: ContextStoreOptions\n): ContextStore {\n  return new ContextStore(db, opts);\n}\n","/**\n * @persql/context/core — zero-runtime-dependency engine.\n *\n * Schema DDL, SQL builders, and the extraction/compaction contracts shared by\n * the `@persql/context` SDK (client-side, over `@persql/sdk`) and the hosted\n * PerSQL Context worker (server-side, over `@persql/ai`). Keeping both sides on\n * the same builders means client-recall and server-recall can never drift.\n *\n * Retrieval is lexical: FTS5 with the porter stemmer, BM25-ranked. No vectors.\n */\n\nexport const SCHEMA_VERSION = 1;\nexport const TABLE_PREFIX = \"ctx_\";\nconst T = TABLE_PREFIX;\n\nexport type MemoryKind = \"fact\" | \"episode\" | \"artifact\";\n\nexport interface MemoryRow {\n  id: string;\n  kind: MemoryKind;\n  topic: string | null;\n  body: string;\n  tags: string | null;\n  source: string | null;\n  createdAt: number;\n  supersededBy: string | null;\n}\n\nexport interface Entity {\n  id: string;\n  name: string;\n  kind: string | null;\n  body: string | null;\n  createdAt: number;\n}\n\nexport interface Edge {\n  id: string;\n  src: string;\n  rel: string;\n  dst: string;\n  source: string | null;\n  createdAt: number;\n}\n\nexport interface RememberInput {\n  body: string;\n  topic?: string;\n  kind?: MemoryKind;\n  tags?: string[] | string;\n  source?: string;\n  supersedes?: string | string[];\n  id?: string;\n}\n\nexport interface EntityInput {\n  name: string;\n  kind?: string;\n  body?: string;\n  id?: string;\n}\n\nexport interface EdgeInput {\n  src: string;\n  rel: string;\n  dst: string;\n  source?: string;\n}\n\nexport interface RecallOptions {\n  limit?: number;\n  kind?: MemoryKind;\n  operator?: \"or\" | \"and\";\n  mode?: \"terms\" | \"raw\";\n  sinceMs?: number;\n  withinDays?: number;\n  includeSuperseded?: boolean;\n}\n\nexport interface ListOptions {\n  limit?: number;\n  kind?: MemoryKind;\n  includeSuperseded?: boolean;\n}\n\n/** The shape an extractor (LLM or the hosted worker) returns from raw text. */\nexport interface ExtractedContext {\n  facts?: Array<{ body: string; topic?: string; tags?: string[]; kind?: MemoryKind }>;\n  entities?: EntityInput[];\n  edges?: EdgeInput[];\n}\n\nexport interface SqlStatement {\n  sql: string;\n  params: unknown[];\n}\n\n// ---------------------------------------------------------------------------\n// Schema\n// ---------------------------------------------------------------------------\n\nexport const SCHEMA_SQL: string[] = [\n  `CREATE TABLE IF NOT EXISTS ${T}memory (\n     id TEXT PRIMARY KEY,\n     kind TEXT NOT NULL DEFAULT 'fact',\n     topic TEXT,\n     body TEXT NOT NULL,\n     tags TEXT,\n     source TEXT,\n     created_at INTEGER NOT NULL,\n     superseded_by TEXT\n   )`,\n  `CREATE INDEX IF NOT EXISTS ${T}memory_kind ON ${T}memory(kind)`,\n  `CREATE INDEX IF NOT EXISTS ${T}memory_created ON ${T}memory(created_at)`,\n  `CREATE INDEX IF NOT EXISTS ${T}memory_superseded ON ${T}memory(superseded_by)`,\n  // External-content FTS index: body text is not duplicated, only indexed.\n  // Porter stemmer so \"invoice\" recalls \"invoicing\" without embeddings.\n  `CREATE VIRTUAL TABLE IF NOT EXISTS ${T}memory_fts USING fts5(\n     topic, body, tags,\n     content='${T}memory', content_rowid='rowid',\n     tokenize='porter unicode61'\n   )`,\n  `CREATE TRIGGER IF NOT EXISTS ${T}memory_ai AFTER INSERT ON ${T}memory BEGIN\n     INSERT INTO ${T}memory_fts(rowid, topic, body, tags)\n     VALUES (new.rowid, new.topic, new.body, new.tags);\n   END`,\n  `CREATE TRIGGER IF NOT EXISTS ${T}memory_ad AFTER DELETE ON ${T}memory BEGIN\n     INSERT INTO ${T}memory_fts(${T}memory_fts, rowid, topic, body, tags)\n     VALUES ('delete', old.rowid, old.topic, old.body, old.tags);\n   END`,\n  `CREATE TRIGGER IF NOT EXISTS ${T}memory_au AFTER UPDATE ON ${T}memory BEGIN\n     INSERT INTO ${T}memory_fts(${T}memory_fts, rowid, topic, body, tags)\n     VALUES ('delete', old.rowid, old.topic, old.body, old.tags);\n     INSERT INTO ${T}memory_fts(rowid, topic, body, tags)\n     VALUES (new.rowid, new.topic, new.body, new.tags);\n   END`,\n  `CREATE TABLE IF NOT EXISTS ${T}entity (\n     id TEXT PRIMARY KEY,\n     name TEXT NOT NULL,\n     kind TEXT,\n     body TEXT,\n     created_at INTEGER NOT NULL\n   )`,\n  `CREATE TABLE IF NOT EXISTS ${T}edge (\n     id TEXT PRIMARY KEY,\n     src TEXT NOT NULL,\n     rel TEXT NOT NULL,\n     dst TEXT NOT NULL,\n     source TEXT,\n     created_at INTEGER NOT NULL\n   )`,\n  `CREATE INDEX IF NOT EXISTS ${T}edge_src ON ${T}edge(src)`,\n  `CREATE INDEX IF NOT EXISTS ${T}edge_dst ON ${T}edge(dst)`,\n];\n\nexport function buildInit(): SqlStatement[] {\n  return SCHEMA_SQL.map((sql) => ({ sql, params: [] }));\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nconst FTS_OPERATORS = new Set([\"and\", \"or\", \"not\", \"near\"]);\n\nexport function normalizeTags(tags?: string[] | string | null): string | null {\n  if (!tags) return null;\n  const arr = Array.isArray(tags) ? tags : String(tags).split(/[,\\s]+/);\n  const norm = Array.from(\n    new Set(arr.map((t) => t.trim().toLowerCase()).filter(Boolean))\n  );\n  return norm.length ? norm.join(\" \") : null;\n}\n\n/**\n * Turn arbitrary user text into a safe FTS5 MATCH expression. `terms` mode\n * (default) extracts word tokens, drops bare boolean operators, and ORs the\n * rest as quoted terms — so a caller can paste \"invoice OR billing\" or just\n * \"invoice billing\" and neither crashes the parser nor injects FTS syntax.\n * `raw` mode passes a hand-written FTS expression through untouched.\n */\nexport function toFtsQuery(\n  input: string,\n  opts: { operator?: \"or\" | \"and\"; mode?: \"terms\" | \"raw\" } = {}\n): string | null {\n  if (opts.mode === \"raw\") return input.trim() || null;\n  const tokens = (input.match(/[\\p{L}\\p{N}_]+/gu) ?? []).filter(\n    (t) => !FTS_OPERATORS.has(t.toLowerCase())\n  );\n  if (!tokens.length) return null;\n  const joiner = opts.operator === \"and\" ? \" AND \" : \" OR \";\n  return tokens.map((t) => `\"${t}\"`).join(joiner);\n}\n\nfunction slugId(prefix: string, s: string): string {\n  const base = s\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, \"-\")\n    .replace(/^-+|-+$/g, \"\")\n    .slice(0, 96);\n  return prefix + (base || \"x\");\n}\n\n/** Deterministic id for an entity, keyed on its name (case-insensitive). */\nexport function entityId(name: string): string {\n  return slugId(\"e_\", name);\n}\n\nfunction resolveEntityRef(ref: string): string {\n  return ref.startsWith(\"e_\") ? ref : entityId(ref);\n}\n\nfunction edgeId(srcId: string, rel: string, dstId: string): string {\n  return slugId(\"x_\", `${srcId}|${rel}|${dstId}`);\n}\n\nconst MEMORY_COLS =\n  \"id, kind, topic, body, tags, source, created_at AS createdAt, superseded_by AS supersededBy\";\n\n// ---------------------------------------------------------------------------\n// Memory builders\n// ---------------------------------------------------------------------------\n\nexport function buildRemember(\n  input: RememberInput,\n  now: number,\n  id: string\n): SqlStatement {\n  return {\n    sql: `INSERT INTO ${T}memory (id, kind, topic, body, tags, source, created_at, superseded_by)\n          VALUES (?, ?, ?, ?, ?, ?, ?, NULL)`,\n    params: [\n      id,\n      input.kind ?? \"fact\",\n      input.topic ?? null,\n      input.body,\n      normalizeTags(input.tags),\n      input.source ?? null,\n      now,\n    ],\n  };\n}\n\nexport function buildSupersede(oldId: string, newId: string): SqlStatement {\n  return {\n    sql: `UPDATE ${T}memory SET superseded_by = ? WHERE id = ? AND superseded_by IS NULL`,\n    params: [newId, oldId],\n  };\n}\n\nexport function buildForget(id: string): SqlStatement {\n  return { sql: `DELETE FROM ${T}memory WHERE id = ?`, params: [id] };\n}\n\nexport function buildGet(id: string): SqlStatement {\n  return {\n    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory WHERE id = ?`,\n    params: [id],\n  };\n}\n\nexport function buildRecall(\n  query: string,\n  opts: RecallOptions = {}\n): SqlStatement | null {\n  const match = toFtsQuery(query, { operator: opts.operator, mode: opts.mode });\n  if (!match) return null;\n  const where: string[] = [`${T}memory_fts MATCH ?`];\n  const params: unknown[] = [match];\n  if (!opts.includeSuperseded) where.push(\"m.superseded_by IS NULL\");\n  if (opts.kind) {\n    where.push(\"m.kind = ?\");\n    params.push(opts.kind);\n  }\n  if (opts.sinceMs != null) {\n    where.push(\"m.created_at >= ?\");\n    params.push(opts.sinceMs);\n  }\n  params.push(opts.limit ?? 8);\n  return {\n    sql: `SELECT m.id, m.kind, m.topic, m.body, m.tags, m.source,\n                 m.created_at AS createdAt, m.superseded_by AS supersededBy\n          FROM ${T}memory_fts\n          JOIN ${T}memory m ON m.rowid = ${T}memory_fts.rowid\n          WHERE ${where.join(\" AND \")}\n          ORDER BY ${T}memory_fts.rank\n          LIMIT ?`,\n    params,\n  };\n}\n\nexport function buildRecent(opts: ListOptions = {}): SqlStatement {\n  const where: string[] = [];\n  const params: unknown[] = [];\n  if (!opts.includeSuperseded) where.push(\"superseded_by IS NULL\");\n  if (opts.kind) {\n    where.push(\"kind = ?\");\n    params.push(opts.kind);\n  }\n  params.push(opts.limit ?? 20);\n  return {\n    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory\n          ${where.length ? \"WHERE \" + where.join(\" AND \") : \"\"}\n          ORDER BY created_at DESC\n          LIMIT ?`,\n    params,\n  };\n}\n\nexport function buildByTag(tag: string, opts: ListOptions = {}): SqlStatement {\n  const t = tag.trim().toLowerCase();\n  const where: string[] = [\"(' ' || COALESCE(tags, '') || ' ') LIKE ?\"];\n  const params: unknown[] = [`% ${t} %`];\n  if (!opts.includeSuperseded) where.push(\"superseded_by IS NULL\");\n  if (opts.kind) {\n    where.push(\"kind = ?\");\n    params.push(opts.kind);\n  }\n  params.push(opts.limit ?? 20);\n  return {\n    sql: `SELECT ${MEMORY_COLS} FROM ${T}memory\n          WHERE ${where.join(\" AND \")}\n          ORDER BY created_at DESC\n          LIMIT ?`,\n    params,\n  };\n}\n\nexport function buildStats(): SqlStatement {\n  return {\n    sql: `SELECT\n            (SELECT count(*) FROM ${T}memory WHERE superseded_by IS NULL) AS facts,\n            (SELECT count(*) FROM ${T}memory) AS facts_total,\n            (SELECT count(*) FROM ${T}entity) AS entities,\n            (SELECT count(*) FROM ${T}edge) AS edges`,\n    params: [],\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Graph builders\n// ---------------------------------------------------------------------------\n\nexport function buildUpsertEntity(e: EntityInput, now: number): SqlStatement {\n  const id = e.id ?? entityId(e.name);\n  return {\n    sql: `INSERT INTO ${T}entity (id, name, kind, body, created_at)\n          VALUES (?, ?, ?, ?, ?)\n          ON CONFLICT(id) DO UPDATE SET\n            name = excluded.name,\n            kind = COALESCE(excluded.kind, ${T}entity.kind),\n            body = COALESCE(excluded.body, ${T}entity.body)`,\n    params: [id, e.name, e.kind ?? null, e.body ?? null, now],\n  };\n}\n\nexport function buildUpsertEdge(e: EdgeInput, now: number): SqlStatement {\n  const srcId = resolveEntityRef(e.src);\n  const dstId = resolveEntityRef(e.dst);\n  const id = edgeId(srcId, e.rel, dstId);\n  return {\n    sql: `INSERT INTO ${T}edge (id, src, rel, dst, source, created_at)\n          VALUES (?, ?, ?, ?, ?, ?)\n          ON CONFLICT(id) DO UPDATE SET\n            source = COALESCE(excluded.source, ${T}edge.source)`,\n    params: [id, srcId, e.rel, dstId, e.source ?? null, now],\n  };\n}\n\n/** Entities reachable from a seed within `depth` hops (seed excluded). */\nexport function buildNeighborEntities(\n  seedId: string,\n  depth: number,\n  limit: number\n): SqlStatement {\n  return {\n    sql: `WITH RECURSIVE reach(id, depth) AS (\n            SELECT ?, 0\n            UNION\n            SELECT CASE WHEN e.src = reach.id THEN e.dst ELSE e.src END,\n                   reach.depth + 1\n            FROM reach\n            JOIN ${T}edge e ON (e.src = reach.id OR e.dst = reach.id)\n            WHERE reach.depth < ?\n          )\n          SELECT en.id, en.name, en.kind, en.body,\n                 en.created_at AS createdAt, MIN(reach.depth) AS depth\n          FROM reach\n          JOIN ${T}entity en ON en.id = reach.id\n          WHERE reach.depth > 0 AND en.id <> ?\n          GROUP BY en.id\n          ORDER BY depth, en.name\n          LIMIT ?`,\n    // The seed reappears at depth >0 via a round-trip on undirected edges;\n    // exclude it explicitly so it isn't listed as its own neighbor.\n    params: [seedId, depth, seedId, limit],\n  };\n}\n\nexport function buildEdgesAmong(ids: string[]): SqlStatement {\n  if (!ids.length) {\n    return { sql: `SELECT id, src, rel, dst, source, created_at AS createdAt FROM ${T}edge WHERE 0`, params: [] };\n  }\n  const ph = ids.map(() => \"?\").join(\", \");\n  return {\n    sql: `SELECT id, src, rel, dst, source, created_at AS createdAt\n          FROM ${T}edge\n          WHERE src IN (${ph}) AND dst IN (${ph})`,\n    params: [...ids, ...ids],\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Extraction / compaction contracts (used by the hosted worker + documented\n// for bring-your-own-LLM callers; kept here so the prompt is versioned with\n// the schema it has to populate).\n// ---------------------------------------------------------------------------\n\nexport const EXTRACTION_SYSTEM_PROMPT = `You extract durable, shareable context from raw text for a team of AI agents that will read it later by keyword.\n\nReturn JSON: { \"facts\": [...], \"entities\": [...], \"edges\": [...] }.\n- facts: atomic, self-contained statements worth remembering across sessions — decisions, conventions, constraints, identifiers, preferences. Each: { \"body\": string, \"topic\"?: string, \"tags\"?: string[] }. Prefer specific and stable over transient chatter.\n- entities: named things — services, people, tables, repos, concepts. Each: { \"name\": string, \"kind\"?: string, \"body\"?: short description }.\n- edges: relationships between entities, referencing entity names. Each: { \"src\": name, \"rel\": string, \"dst\": name }.\n\nBe conservative: omit anything ephemeral or low-value. Use lowercase tags. If nothing is worth keeping, return empty arrays.`;\n\nexport function buildExtractionMessages(\n  raw: string,\n  opts: { hint?: string } = {}\n): Array<{ role: \"system\" | \"user\"; content: string }> {\n  return [\n    { role: \"system\", content: EXTRACTION_SYSTEM_PROMPT },\n    {\n      role: \"user\",\n      content: (opts.hint ? `Context: ${opts.hint}\\n\\n` : \"\") + raw,\n    },\n  ];\n}\n\nexport const EXTRACTION_JSON_SCHEMA = {\n  type: \"object\",\n  properties: {\n    facts: {\n      type: \"array\",\n      items: {\n        type: \"object\",\n        properties: {\n          body: { type: \"string\" },\n          topic: { type: \"string\" },\n          tags: { type: \"array\", items: { type: \"string\" } },\n        },\n        required: [\"body\"],\n      },\n    },\n    entities: {\n      type: \"array\",\n      items: {\n        type: \"object\",\n        properties: {\n          name: { type: \"string\" },\n          kind: { type: \"string\" },\n          body: { type: \"string\" },\n        },\n        required: [\"name\"],\n      },\n    },\n    edges: {\n      type: \"array\",\n      items: {\n        type: \"object\",\n        properties: {\n          src: { type: \"string\" },\n          rel: { type: \"string\" },\n          dst: { type: \"string\" },\n        },\n        required: [\"src\", \"rel\", \"dst\"],\n      },\n    },\n  },\n} as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACWO,IAAM,iBAAiB;AACvB,IAAM,eAAe;AAC5B,IAAM,IAAI;AAwFH,IAAM,aAAuB;AAAA,EAClC,8BAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAU/B,8BAA8B,CAAC,kBAAkB,CAAC;AAAA,EAClD,8BAA8B,CAAC,qBAAqB,CAAC;AAAA,EACrD,8BAA8B,CAAC,wBAAwB,CAAC;AAAA;AAAA;AAAA,EAGxD,sCAAsC,CAAC;AAAA;AAAA,gBAEzB,CAAC;AAAA;AAAA;AAAA,EAGf,gCAAgC,CAAC,6BAA6B,CAAC;AAAA,mBAC9C,CAAC;AAAA;AAAA;AAAA,EAGlB,gCAAgC,CAAC,6BAA6B,CAAC;AAAA,mBAC9C,CAAC,cAAc,CAAC;AAAA;AAAA;AAAA,EAGjC,gCAAgC,CAAC,6BAA6B,CAAC;AAAA,mBAC9C,CAAC,cAAc,CAAC;AAAA;AAAA,mBAEhB,CAAC;AAAA;AAAA;AAAA,EAGlB,8BAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO/B,8BAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ/B,8BAA8B,CAAC,eAAe,CAAC;AAAA,EAC/C,8BAA8B,CAAC,eAAe,CAAC;AACjD;AAEO,SAAS,YAA4B;AAC1C,SAAO,WAAW,IAAI,CAAC,SAAS,EAAE,KAAK,QAAQ,CAAC,EAAE,EAAE;AACtD;AAMA,IAAM,gBAAgB,oBAAI,IAAI,CAAC,OAAO,MAAM,OAAO,MAAM,CAAC;AAEnD,SAAS,cAAc,MAAgD;AAC5E,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,MAAM,MAAM,QAAQ,IAAI,IAAI,OAAO,OAAO,IAAI,EAAE,MAAM,QAAQ;AACpE,QAAM,OAAO,MAAM;AAAA,IACjB,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,EAAE,OAAO,OAAO,CAAC;AAAA,EAChE;AACA,SAAO,KAAK,SAAS,KAAK,KAAK,GAAG,IAAI;AACxC;AASO,SAAS,WACd,OACA,OAA4D,CAAC,GAC9C;AACf,MAAI,KAAK,SAAS,MAAO,QAAO,MAAM,KAAK,KAAK;AAChD,QAAM,UAAU,MAAM,MAAM,kBAAkB,KAAK,CAAC,GAAG;AAAA,IACrD,CAAC,MAAM,CAAC,cAAc,IAAI,EAAE,YAAY,CAAC;AAAA,EAC3C;AACA,MAAI,CAAC,OAAO,OAAQ,QAAO;AAC3B,QAAM,SAAS,KAAK,aAAa,QAAQ,UAAU;AACnD,SAAO,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,MAAM;AAChD;AAEA,SAAS,OAAO,QAAgB,GAAmB;AACjD,QAAM,OAAO,EACV,YAAY,EACZ,QAAQ,eAAe,GAAG,EAC1B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,EAAE;AACd,SAAO,UAAU,QAAQ;AAC3B;AAGO,SAAS,SAAS,MAAsB;AAC7C,SAAO,OAAO,MAAM,IAAI;AAC1B;AAEA,SAAS,iBAAiB,KAAqB;AAC7C,SAAO,IAAI,WAAW,IAAI,IAAI,MAAM,SAAS,GAAG;AAClD;AAEA,SAAS,OAAO,OAAe,KAAa,OAAuB;AACjE,SAAO,OAAO,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,KAAK,EAAE;AAChD;AAEA,IAAM,cACJ;AAMK,SAAS,cACd,OACA,KACA,IACc;AACd,SAAO;AAAA,IACL,KAAK,eAAe,CAAC;AAAA;AAAA,IAErB,QAAQ;AAAA,MACN;AAAA,MACA,MAAM,QAAQ;AAAA,MACd,MAAM,SAAS;AAAA,MACf,MAAM;AAAA,MACN,cAAc,MAAM,IAAI;AAAA,MACxB,MAAM,UAAU;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,eAAe,OAAe,OAA6B;AACzE,SAAO;AAAA,IACL,KAAK,UAAU,CAAC;AAAA,IAChB,QAAQ,CAAC,OAAO,KAAK;AAAA,EACvB;AACF;AAEO,SAAS,YAAY,IAA0B;AACpD,SAAO,EAAE,KAAK,eAAe,CAAC,uBAAuB,QAAQ,CAAC,EAAE,EAAE;AACpE;AAEO,SAAS,SAAS,IAA0B;AACjD,SAAO;AAAA,IACL,KAAK,UAAU,WAAW,SAAS,CAAC;AAAA,IACpC,QAAQ,CAAC,EAAE;AAAA,EACb;AACF;AAEO,SAAS,YACd,OACA,OAAsB,CAAC,GACF;AACrB,QAAM,QAAQ,WAAW,OAAO,EAAE,UAAU,KAAK,UAAU,MAAM,KAAK,KAAK,CAAC;AAC5E,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAkB,CAAC,GAAG,CAAC,oBAAoB;AACjD,QAAM,SAAoB,CAAC,KAAK;AAChC,MAAI,CAAC,KAAK,kBAAmB,OAAM,KAAK,yBAAyB;AACjE,MAAI,KAAK,MAAM;AACb,UAAM,KAAK,YAAY;AACvB,WAAO,KAAK,KAAK,IAAI;AAAA,EACvB;AACA,MAAI,KAAK,WAAW,MAAM;AACxB,UAAM,KAAK,mBAAmB;AAC9B,WAAO,KAAK,KAAK,OAAO;AAAA,EAC1B;AACA,SAAO,KAAK,KAAK,SAAS,CAAC;AAC3B,SAAO;AAAA,IACL,KAAK;AAAA;AAAA,iBAEQ,CAAC;AAAA,iBACD,CAAC,yBAAyB,CAAC;AAAA,kBAC1B,MAAM,KAAK,OAAO,CAAC;AAAA,qBAChB,CAAC;AAAA;AAAA,IAElB;AAAA,EACF;AACF;AAEO,SAAS,YAAY,OAAoB,CAAC,GAAiB;AAChE,QAAM,QAAkB,CAAC;AACzB,QAAM,SAAoB,CAAC;AAC3B,MAAI,CAAC,KAAK,kBAAmB,OAAM,KAAK,uBAAuB;AAC/D,MAAI,KAAK,MAAM;AACb,UAAM,KAAK,UAAU;AACrB,WAAO,KAAK,KAAK,IAAI;AAAA,EACvB;AACA,SAAO,KAAK,KAAK,SAAS,EAAE;AAC5B,SAAO;AAAA,IACL,KAAK,UAAU,WAAW,SAAS,CAAC;AAAA,YAC5B,MAAM,SAAS,WAAW,MAAM,KAAK,OAAO,IAAI,EAAE;AAAA;AAAA;AAAA,IAG1D;AAAA,EACF;AACF;AAEO,SAAS,WAAW,KAAa,OAAoB,CAAC,GAAiB;AAC5E,QAAM,IAAI,IAAI,KAAK,EAAE,YAAY;AACjC,QAAM,QAAkB,CAAC,2CAA2C;AACpE,QAAM,SAAoB,CAAC,KAAK,CAAC,IAAI;AACrC,MAAI,CAAC,KAAK,kBAAmB,OAAM,KAAK,uBAAuB;AAC/D,MAAI,KAAK,MAAM;AACb,UAAM,KAAK,UAAU;AACrB,WAAO,KAAK,KAAK,IAAI;AAAA,EACvB;AACA,SAAO,KAAK,KAAK,SAAS,EAAE;AAC5B,SAAO;AAAA,IACL,KAAK,UAAU,WAAW,SAAS,CAAC;AAAA,kBACtB,MAAM,KAAK,OAAO,CAAC;AAAA;AAAA;AAAA,IAGjC;AAAA,EACF;AACF;AAEO,SAAS,aAA2B;AACzC,SAAO;AAAA,IACL,KAAK;AAAA,oCAC2B,CAAC;AAAA,oCACD,CAAC;AAAA,oCACD,CAAC;AAAA,oCACD,CAAC;AAAA,IACjC,QAAQ,CAAC;AAAA,EACX;AACF;AAMO,SAAS,kBAAkB,GAAgB,KAA2B;AAC3E,QAAM,KAAK,EAAE,MAAM,SAAS,EAAE,IAAI;AAClC,SAAO;AAAA,IACL,KAAK,eAAe,CAAC;AAAA;AAAA;AAAA;AAAA,6CAIoB,CAAC;AAAA,6CACD,CAAC;AAAA,IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,MAAM,EAAE,QAAQ,MAAM,GAAG;AAAA,EAC1D;AACF;AAEO,SAAS,gBAAgB,GAAc,KAA2B;AACvE,QAAM,QAAQ,iBAAiB,EAAE,GAAG;AACpC,QAAM,QAAQ,iBAAiB,EAAE,GAAG;AACpC,QAAM,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK;AACrC,SAAO;AAAA,IACL,KAAK,eAAe,CAAC;AAAA;AAAA;AAAA,iDAGwB,CAAC;AAAA,IAC9C,QAAQ,CAAC,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE,UAAU,MAAM,GAAG;AAAA,EACzD;AACF;AAGO,SAAS,sBACd,QACA,OACA,OACc;AACd,SAAO;AAAA,IACL,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAMU,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAMH,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOd,QAAQ,CAAC,QAAQ,OAAO,QAAQ,KAAK;AAAA,EACvC;AACF;AAEO,SAAS,gBAAgB,KAA6B;AAC3D,MAAI,CAAC,IAAI,QAAQ;AACf,WAAO,EAAE,KAAK,kEAAkE,CAAC,gBAAgB,QAAQ,CAAC,EAAE;AAAA,EAC9G;AACA,QAAM,KAAK,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI;AACvC,SAAO;AAAA,IACL,KAAK;AAAA,iBACQ,CAAC;AAAA,0BACQ,EAAE,iBAAiB,EAAE;AAAA,IAC3C,QAAQ,CAAC,GAAG,KAAK,GAAG,GAAG;AAAA,EACzB;AACF;AAQO,IAAM,2BAA2B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASjC,SAAS,wBACd,KACA,OAA0B,CAAC,GAC0B;AACrD,SAAO;AAAA,IACL,EAAE,MAAM,UAAU,SAAS,yBAAyB;AAAA,IACpD;AAAA,MACE,MAAM;AAAA,MACN,UAAU,KAAK,OAAO,YAAY,KAAK,IAAI;AAAA;AAAA,IAAS,MAAM;AAAA,IAC5D;AAAA,EACF;AACF;AAEO,IAAM,yBAAyB;AAAA,EACpC,MAAM;AAAA,EACN,YAAY;AAAA,IACV,OAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,UACV,MAAM,EAAE,MAAM,SAAS;AAAA,UACvB,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,MAAM,EAAE,MAAM,SAAS,OAAO,EAAE,MAAM,SAAS,EAAE;AAAA,QACnD;AAAA,QACA,UAAU,CAAC,MAAM;AAAA,MACnB;AAAA,IACF;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,UACV,MAAM,EAAE,MAAM,SAAS;AAAA,UACvB,MAAM,EAAE,MAAM,SAAS;AAAA,UACvB,MAAM,EAAE,MAAM,SAAS;AAAA,QACzB;AAAA,QACA,UAAU,CAAC,MAAM;AAAA,MACnB;AAAA,IACF;AAAA,IACA,OAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,UACV,KAAK,EAAE,MAAM,SAAS;AAAA,UACtB,KAAK,EAAE,MAAM,SAAS;AAAA,UACtB,KAAK,EAAE,MAAM,SAAS;AAAA,QACxB;AAAA,QACA,UAAU,CAAC,OAAO,OAAO,KAAK;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACF;;;ADhaA,SAAS,IAAI,QAAwB;AACnC,QAAM,IAAI;AACV,QAAM,IACJ,EAAE,QAAQ,aAAa,KACvB,GAAG,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,EAAE,SAAS,EAAE,CAAC;AAC5E,SAAO,SAAS;AAClB;AAEO,IAAM,eAAN,MAAmB;AAAA,EACxB,YACmB,IACA,OAA4B,CAAC,GAC9C;AAFiB;AACA;AAAA,EAChB;AAAA;AAAA,EAGH,MAAM,OAAsB;AAC1B,UAAM,KAAK,GAAG,MAAM,UAAU,CAAC;AAAA,EACjC;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,OAAuC;AACpD,UAAM,KAAK,MAAM,MAAM,IAAI,IAAI;AAC/B,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,QAAwB;AAAA,MAC5B,cAAc,EAAE,GAAG,OAAO,QAAQ,MAAM,UAAU,KAAK,KAAK,OAAO,GAAG,KAAK,EAAE;AAAA,IAC/E;AACA,UAAM,MAAM,MAAM,aACd,MAAM,QAAQ,MAAM,UAAU,IAC5B,MAAM,aACN,CAAC,MAAM,UAAU,IACnB,CAAC;AACL,eAAW,OAAO,IAAK,OAAM,KAAK,eAAe,KAAK,EAAE,CAAC;AACzD,UAAM,KAAK,GAAG,YAAY,KAAK;AAC/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YACJ,KACA,OAAgE,CAAC,GAC3C;AACtB,UAAM,UAAU,KAAK,WAAW,KAAK,KAAK;AAC1C,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,UAAM,YAAY,MAAM,QAAQ,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;AACxD,WAAO,KAAK,MAAM,WAAW,EAAE,QAAQ,KAAK,OAAO,CAAC;AAAA,EACtD;AAAA;AAAA,EAGA,MAAM,MACJ,WACA,OAA4B,CAAC,GACP;AACtB,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,SAAS,KAAK,UAAU,KAAK,KAAK;AACxC,UAAM,QAAwB,CAAC;AAC/B,UAAM,YAAsB,CAAC;AAC7B,UAAM,YAAY,oBAAI,IAAY;AAElC,eAAW,KAAK,UAAU,SAAS,CAAC,GAAG;AACrC,YAAM,KAAK,IAAI,IAAI;AACnB,gBAAU,KAAK,EAAE;AACjB,YAAM,KAAK,cAAc,EAAE,GAAG,GAAG,OAAO,GAAG,KAAK,EAAE,CAAC;AAAA,IACrD;AACA,eAAW,KAAK,UAAU,YAAY,CAAC,GAAG;AACxC,YAAM,KAAK,kBAAkB,GAAG,GAAG,CAAC;AACpC,gBAAU,IAAI,EAAE,MAAM,SAAS,EAAE,IAAI,CAAC;AAAA,IACxC;AACA,eAAW,MAAM,UAAU,SAAS,CAAC,GAAG;AAEtC,YAAM,KAAK,kBAAkB,EAAE,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;AACnD,YAAM,KAAK,kBAAkB,EAAE,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;AACnD,YAAM,KAAK,gBAAgB,EAAE,GAAG,IAAI,QAAQ,GAAG,UAAU,OAAO,GAAG,GAAG,CAAC;AACvE,gBAAU,IAAI,SAAS,GAAG,GAAG,CAAC;AAC9B,gBAAU,IAAI,SAAS,GAAG,GAAG,CAAC;AAAA,IAChC;AAEA,QAAI,MAAM,OAAQ,OAAM,KAAK,GAAG,YAAY,KAAK;AACjD,WAAO;AAAA,MACL;AAAA,MACA,WAAW,CAAC,GAAG,SAAS;AAAA,MACxB,YAAY,UAAU,SAAS,CAAC,GAAG;AAAA,IACrC;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,UAAU,QAA2B,OAA8B;AACvE,UAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;AACpD,UAAM,KAAK,GAAG,YAAY,IAAI,IAAI,CAAC,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC;AAAA,EACpE;AAAA;AAAA,EAGA,MAAM,OAAO,IAA2B;AACtC,UAAM,IAAI,YAAY,EAAE;AACxB,UAAM,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM;AAAA,EACrC;AAAA;AAAA,EAGA,MAAM,KACJ,KACA,KACA,KACA,OAA4B,CAAC,GACd;AACf,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,KAAK,GAAG,YAAY;AAAA,MACxB,kBAAkB,EAAE,MAAM,IAAI,GAAG,GAAG;AAAA,MACpC,kBAAkB,EAAE,MAAM,IAAI,GAAG,GAAG;AAAA,MACpC;AAAA,QACE,EAAE,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,KAAK,KAAK,OAAO;AAAA,QACzD;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO,OAAe,OAAsB,CAAC,GAAyB;AAC1E,UAAM,WAA0B,EAAE,GAAG,KAAK;AAC1C,QAAI,KAAK,cAAc,QAAQ,KAAK,WAAW,MAAM;AACnD,eAAS,UAAU,KAAK,IAAI,IAAI,KAAK,aAAa;AAAA,IACpD;AACA,UAAM,IAAI,YAAY,OAAO,QAAQ;AACrC,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,UAAM,EAAE,KAAK,IAAI,MAAM,KAAK,GAAG,MAAiB,EAAE,KAAK,EAAE,MAAM;AAC/D,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,OAAO,OAAoB,CAAC,GAAyB;AACzD,UAAM,IAAI,YAAY,IAAI;AAC1B,UAAM,EAAE,KAAK,IAAI,MAAM,KAAK,GAAG,MAAiB,EAAE,KAAK,EAAE,MAAM;AAC/D,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,MAAM,KAAa,OAAoB,CAAC,GAAyB;AACrE,UAAM,IAAI,WAAW,KAAK,IAAI;AAC9B,UAAM,EAAE,KAAK,IAAI,MAAM,KAAK,GAAG,MAAiB,EAAE,KAAK,EAAE,MAAM;AAC/D,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,IAAI,IAAuC;AAC/C,UAAM,IAAI,SAAS,EAAE;AACrB,UAAM,EAAE,KAAK,IAAI,MAAM,KAAK,GAAG,MAAiB,EAAE,KAAK,EAAE,MAAM;AAC/D,WAAO,KAAK,CAAC,KAAK;AAAA,EACpB;AAAA;AAAA,EAGA,MAAM,UACJ,MACA,OAA2C,CAAC,GACI;AAChD,UAAM,OAAO,KAAK,WAAW,IAAI,IAAI,OAAO,SAAS,IAAI;AACzD,UAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAK,SAAS,GAAG,CAAC,GAAG,CAAC;AACtD,UAAM,UAAU,sBAAsB,MAAM,OAAO,KAAK,SAAS,EAAE;AACnE,UAAM,EAAE,MAAM,SAAS,IAAI,MAAM,KAAK,GAAG;AAAA,MACvC,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV;AACA,UAAM,MAAM,CAAC,MAAM,GAAG,SAAS,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC/C,UAAM,WAAW,gBAAgB,GAAG;AACpC,UAAM,EAAE,MAAM,MAAM,IAAI,MAAM,KAAK,GAAG;AAAA,MACpC,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AACA,WAAO,EAAE,UAAU,MAAM;AAAA,EAC3B;AAAA;AAAA,EAGA,MAAM,QAA+B;AACnC,UAAM,IAAI,WAAW;AACrB,UAAM,EAAE,KAAK,IAAI,MAAM,KAAK,GAAG,MAK5B,EAAE,KAAK,EAAE,MAAM;AAClB,UAAM,IAAI,KAAK,CAAC;AAChB,WAAO;AAAA,MACL,OAAO,GAAG,SAAS;AAAA,MACnB,YAAY,GAAG,eAAe;AAAA,MAC9B,UAAU,GAAG,YAAY;AAAA,MACzB,OAAO,GAAG,SAAS;AAAA,IACrB;AAAA,EACF;AACF;AAGO,SAAS,QACd,IACA,MACc;AACd,SAAO,IAAI,aAAa,IAAI,IAAI;AAClC;","names":[]}