hippo-memory 1.15.0 → 1.17.0

package/dist/graph.js

@@ -0,0 +1,433 @@
+/**
+ * E3.3 graph layer over consolidated state - the graph-on-consolidated guard.
+ * (docs/plans/2026-06-01-e3-graph-guard.md).
+ *
+ * A graph of canonical `entities` (person/project/customer/system/policy/decision) and
+ * `relations` (owns/supersedes/depends-on/blocked-by/references) sits ON TOP OF
+ * consolidated memories. The hard rule: the graph NEVER indexes the raw layer - every
+ * entity and relation references a memory whose `kind IN ('distilled','superseded')`,
+ * never `kind='raw'`. Enforced at the DB level (CHECK on source_kind/kind + BEFORE
+ * INSERT and BEFORE UPDATE triggers that tie source_kind/kind to the FK'd memory's
+ * actual kind and enforce tenant-match - relations also reject cross-tenant edges), so
+ * the forbidden state is unrepresentable regardless of code path. These helpers
+ * surface the same guard as clear throws BEFORE hitting the trigger backstop.
+ *
+ * Scope (E3.3 first slice): the substrate + the guard + a thin insert/load/enqueue
+ * API. The `graph_extraction_queue` is the interface the deferred `hippo sleep`
+ * enqueue-hook + E3.1 entity extraction will call. No operator surface (CLI/HTTP/SDK)
+ * until E3.2 multi-hop recall.
+ */
+import { openHippoDb, closeHippoDb } from './db.js';
+import { assertTenantId } from './store.js';
+export const GRAPH_ENTITY_TYPES = new Set([
+    'person', 'project', 'customer', 'system', 'policy', 'decision',
+]);
+export const GRAPH_RELATION_TYPES = new Set([
+    'owns', 'supersedes', 'depends-on', 'blocked-by', 'references',
+]);
+export const VALID_QUEUE_STATES = new Set([
+    'pending', 'processed', 'skipped',
+]);
+export const MAX_ENTITY_NAME_LEN = 512;
+function rowToEntity(row) {
+    return {
+        id: row.id,
+        tenantId: row.tenant_id,
+        entityType: row.entity_type,
+        name: row.name,
+        memoryId: row.memory_id,
+        sourceKind: row.source_kind,
+        createdAt: row.created_at,
+    };
+}
+function rowToRelation(row) {
+    return {
+        id: row.id,
+        tenantId: row.tenant_id,
+        fromEntityId: row.from_entity_id,
+        toEntityId: row.to_entity_id,
+        relType: row.rel_type,
+        memoryId: row.memory_id,
+        sourceKind: row.source_kind,
+        createdAt: row.created_at,
+    };
+}
+function rowToQueueItem(row) {
+    return {
+        id: row.id,
+        tenantId: row.tenant_id,
+        memoryId: row.memory_id,
+        kind: row.kind,
+        status: row.status,
+        enqueuedAt: row.enqueued_at,
+        processedAt: row.processed_at,
+    };
+}
+const ENTITY_COLS = `id, tenant_id, entity_type, name, memory_id, source_kind, created_at`;
+const RELATION_COLS = `id, tenant_id, from_entity_id, to_entity_id, rel_type, memory_id, source_kind, created_at`;
+const QUEUE_COLS = `id, tenant_id, memory_id, kind, status, enqueued_at, processed_at`;
+/**
+ * Look up a memory and assert it is a valid CONSOLIDATED source for the graph: it
+ * exists, belongs to `tenantId`, and is not raw. Returns its kind (the source_kind to
+ * store). Throws a clear error otherwise. This is the code-level mirror of the DB
+ * trigger guard (which is the unbypassable backstop).
+ */
+function resolveConsolidatedSource(db, tenantId, memoryId, label) {
+    const row = db.prepare(`SELECT kind, tenant_id FROM memories WHERE id = ?`).get(memoryId);
+    if (!row) {
+        throw new Error(`${label}: source memory ${memoryId} not found`);
+    }
+    if (row.tenant_id !== tenantId) {
+        throw new Error(`${label}: source memory ${memoryId} belongs to another tenant`);
+    }
+    if (row.kind === 'raw') {
+        throw new Error(`${label}: source memory ${memoryId} is raw; the graph indexes consolidated state only`);
+    }
+    if (row.kind !== 'distilled' && row.kind !== 'superseded') {
+        throw new Error(`${label}: source memory ${memoryId} has unsupported kind '${row.kind}'`);
+    }
+    return row.kind;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Insert a graph entity extracted from a consolidated memory. Throws if the source
+ * memory is missing / cross-tenant / raw (the DB trigger is the backstop).
+ */
+export function insertEntity(hippoRoot, tenantId, opts) {
+    assertTenantId('insertEntity', tenantId);
+    if (!GRAPH_ENTITY_TYPES.has(opts.entityType)) {
+        throw new Error(`insertEntity: entityType must be one of ${Array.from(GRAPH_ENTITY_TYPES).join('|')}; got ${opts.entityType}`);
+    }
+    const name = (opts.name ?? '').trim();
+    if (name.length === 0)
+        throw new Error('insertEntity: name is required');
+    if (name.length > MAX_ENTITY_NAME_LEN) {
+        throw new Error(`insertEntity: name exceeds the ${MAX_ENTITY_NAME_LEN}-char cap`);
+    }
+    const now = new Date().toISOString();
+    const db = openHippoDb(hippoRoot);
+    try {
+        const sourceKind = resolveConsolidatedSource(db, tenantId, opts.memoryId, 'insertEntity');
+        const result = db.prepare(`
+      INSERT INTO entities(tenant_id, entity_type, name, memory_id, source_kind, created_at)
+      VALUES (?, ?, ?, ?, ?, ?)
+    `).run(tenantId, opts.entityType, name, opts.memoryId, sourceKind, now);
+        const id = Number(result.lastInsertRowid ?? 0);
+        const row = db.prepare(`SELECT ${ENTITY_COLS} FROM entities WHERE id = ?`).get(id);
+        if (!row)
+            throw new Error('insertEntity: failed to reload inserted entity');
+        return rowToEntity(row);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+/**
+ * Insert a graph relation between two entities, sourced from a consolidated memory.
+ * Both entities must exist in the same tenant; the source memory must be consolidated.
+ */
+export function insertRelation(hippoRoot, tenantId, opts) {
+    assertTenantId('insertRelation', tenantId);
+    if (!GRAPH_RELATION_TYPES.has(opts.relType)) {
+        throw new Error(`insertRelation: relType must be one of ${Array.from(GRAPH_RELATION_TYPES).join('|')}; got ${opts.relType}`);
+    }
+    const now = new Date().toISOString();
+    const db = openHippoDb(hippoRoot);
+    try {
+        for (const [eid, role] of [[opts.fromEntityId, 'from'], [opts.toEntityId, 'to']]) {
+            const ent = db.prepare(`SELECT tenant_id FROM entities WHERE id = ?`).get(eid);
+            if (!ent)
+                throw new Error(`insertRelation: ${role}_entity ${eid} not found`);
+            if (ent.tenant_id !== tenantId) {
+                throw new Error(`insertRelation: ${role}_entity ${eid} belongs to another tenant (no cross-tenant edges)`);
+            }
+        }
+        const sourceKind = resolveConsolidatedSource(db, tenantId, opts.memoryId, 'insertRelation');
+        const result = db.prepare(`
+      INSERT INTO relations(tenant_id, from_entity_id, to_entity_id, rel_type, memory_id, source_kind, created_at)
+      VALUES (?, ?, ?, ?, ?, ?, ?)
+    `).run(tenantId, opts.fromEntityId, opts.toEntityId, opts.relType, opts.memoryId, sourceKind, now);
+        const id = Number(result.lastInsertRowid ?? 0);
+        const row = db.prepare(`SELECT ${RELATION_COLS} FROM relations WHERE id = ?`).get(id);
+        if (!row)
+            throw new Error('insertRelation: failed to reload inserted relation');
+        return rowToRelation(row);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+export function loadEntityById(hippoRoot, tenantId, id) {
+    assertTenantId('loadEntityById', tenantId);
+    const db = openHippoDb(hippoRoot);
+    try {
+        const row = db.prepare(`SELECT ${ENTITY_COLS} FROM entities WHERE id = ? AND tenant_id = ?`)
+            .get(id, tenantId);
+        return row ? rowToEntity(row) : null;
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+export function loadEntities(hippoRoot, tenantId, opts = {}) {
+    assertTenantId('loadEntities', tenantId);
+    const limit = opts.limit ?? 100;
+    if (opts.entityType && !GRAPH_ENTITY_TYPES.has(opts.entityType)) {
+        throw new Error(`loadEntities: entityType must be one of ${Array.from(GRAPH_ENTITY_TYPES).join('|')}; got ${opts.entityType}`);
+    }
+    const db = openHippoDb(hippoRoot);
+    try {
+        const clauses = ['tenant_id = ?'];
+        const params = [tenantId];
+        if (opts.entityType) {
+            clauses.push('entity_type = ?');
+            params.push(opts.entityType);
+        }
+        params.push(limit);
+        const rows = db.prepare(`
+      SELECT ${ENTITY_COLS} FROM entities
+      WHERE ${clauses.join(' AND ')}
+      ORDER BY created_at DESC, id DESC
+      LIMIT ?
+    `).all(...params);
+        return rows.map(rowToEntity);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+export function loadRelations(hippoRoot, tenantId, opts = {}) {
+    assertTenantId('loadRelations', tenantId);
+    const limit = opts.limit ?? 100;
+    const db = openHippoDb(hippoRoot);
+    try {
+        const clauses = ['tenant_id = ?'];
+        const params = [tenantId];
+        if (opts.fromEntityId !== undefined) {
+            clauses.push('from_entity_id = ?');
+            params.push(opts.fromEntityId);
+        }
+        params.push(limit);
+        const rows = db.prepare(`
+      SELECT ${RELATION_COLS} FROM relations
+      WHERE ${clauses.join(' AND ')}
+      ORDER BY created_at DESC, id DESC
+      LIMIT ?
+    `).all(...params);
+        return rows.map(rowToRelation);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+// ---------------------------------------------------------------------------
+// E3.2 multi-hop recall read helpers (SELECT-only; the check-graph-writes lint
+// permits these here and in the read-only consumer src/graph-recall.ts).
+// ---------------------------------------------------------------------------
+/** Chunk size for IN-list queries: well under SQLite's 999-bound-variable default
+ *  (leaves headroom for the tenant_id param + the doubled list in neighbour lookups). */
+const IN_LIST_CHUNK = 400;
+/**
+ * Map consolidated source memory ids -> their graph entities. The SEED step of E3.2
+ * multi-hop recall (recall result memory ids -> entities to traverse from). Tenant-
+ * scoped, read-only; chunks the IN-list under the SQLite variable cap.
+ */
+export function loadEntitiesByMemoryId(hippoRoot, tenantId, memoryIds) {
+    assertTenantId('loadEntitiesByMemoryId', tenantId);
+    if (memoryIds.length === 0)
+        return [];
+    const db = openHippoDb(hippoRoot);
+    try {
+        const out = [];
+        for (let i = 0; i < memoryIds.length; i += IN_LIST_CHUNK) {
+            const slice = memoryIds.slice(i, i + IN_LIST_CHUNK);
+            const ph = slice.map(() => '?').join(',');
+            const rows = db.prepare(`
+        SELECT ${ENTITY_COLS} FROM entities
+        WHERE tenant_id = ? AND memory_id IN (${ph})
+      `).all(tenantId, ...slice);
+            out.push(...rows.map(rowToEntity));
+        }
+        return out;
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+/**
+ * Load entities by their primary ids. Resolves the entity rows reached during the BFS
+ * (whose `memory_id` maps back to a recall result). Tenant-scoped, read-only.
+ */
+export function loadEntitiesByIds(hippoRoot, tenantId, ids) {
+    assertTenantId('loadEntitiesByIds', tenantId);
+    if (ids.length === 0)
+        return [];
+    const db = openHippoDb(hippoRoot);
+    try {
+        const out = [];
+        for (let i = 0; i < ids.length; i += IN_LIST_CHUNK) {
+            const slice = ids.slice(i, i + IN_LIST_CHUNK);
+            const ph = slice.map(() => '?').join(',');
+            const rows = db.prepare(`
+        SELECT ${ENTITY_COLS} FROM entities
+        WHERE tenant_id = ? AND id IN (${ph})
+      `).all(tenantId, ...slice);
+            out.push(...rows.map(rowToEntity));
+        }
+        return out;
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+/**
+ * All relations touching ANY of `entityIds` in EITHER direction (from OR to) — the
+ * per-hop neighbour query for E3.2 multi-hop traversal. ONE query for the whole frontier
+ * (not one per node): this is the bidirectional read `loadRelations` (from-only) lacks,
+ * and avoids an N+1 across BFS frontier nodes. `limit` caps rows for the frontier and
+ * must be a non-negative integer (the raw `LIMIT ?` rejects a fractional value).
+ */
+export function loadNeighborRelations(hippoRoot, tenantId, entityIds, opts = {}) {
+    assertTenantId('loadNeighborRelations', tenantId);
+    if (entityIds.length === 0)
+        return [];
+    const limit = opts.limit ?? 1000;
+    if (!Number.isInteger(limit) || limit < 0) {
+        throw new Error(`loadNeighborRelations: limit must be a non-negative integer; got ${limit}`);
+    }
+    const db = openHippoDb(hippoRoot);
+    try {
+        // `limit` is applied PER CHUNK; a frontier spanning >IN_LIST_CHUNK ids could return
+        // up to limit*chunks rows before the by-id dedup below. Harmless for E3.2 (the
+        // frontier is bounded by maxNeighbors <= 200 << IN_LIST_CHUNK, so a single chunk,
+        // and the BFS re-enforces the per-hop fanout cap), but note the semantics if a
+        // tighter total cap is ever needed.
+        const byId = new Map();
+        for (let i = 0; i < entityIds.length; i += IN_LIST_CHUNK) {
+            const slice = entityIds.slice(i, i + IN_LIST_CHUNK);
+            const ph = slice.map(() => '?').join(',');
+            const rows = db.prepare(`
+        SELECT ${RELATION_COLS} FROM relations
+        WHERE tenant_id = ? AND (from_entity_id IN (${ph}) OR to_entity_id IN (${ph}))
+        ORDER BY created_at DESC, id DESC
+        LIMIT ?
+      `).all(tenantId, ...slice, ...slice, limit);
+            for (const r of rows)
+                byId.set(r.id, rowToRelation(r));
+        }
+        return Array.from(byId.values());
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+// ---------------------------------------------------------------------------
+// Extraction queue (the interface the deferred sleep enqueue-hook + E3.1 will use)
+// ---------------------------------------------------------------------------
+/**
+ * Enqueue a consolidated memory for later graph extraction. Rejects a raw / missing /
+ * cross-tenant memory (the DB trigger is the backstop). The producer hook in
+ * `hippo sleep` is deferred (E3.1); this is the API it will call.
+ */
+export function enqueueExtraction(hippoRoot, tenantId, memoryId) {
+    assertTenantId('enqueueExtraction', tenantId);
+    const now = new Date().toISOString();
+    const db = openHippoDb(hippoRoot);
+    try {
+        const kind = resolveConsolidatedSource(db, tenantId, memoryId, 'enqueueExtraction');
+        const result = db.prepare(`
+      INSERT INTO graph_extraction_queue(tenant_id, memory_id, kind, status, enqueued_at, processed_at)
+      VALUES (?, ?, ?, 'pending', ?, NULL)
+    `).run(tenantId, memoryId, kind, now);
+        const id = Number(result.lastInsertRowid ?? 0);
+        const row = db.prepare(`SELECT ${QUEUE_COLS} FROM graph_extraction_queue WHERE id = ?`).get(id);
+        if (!row)
+            throw new Error('enqueueExtraction: failed to reload queue item');
+        return rowToQueueItem(row);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+export function loadExtractionQueue(hippoRoot, tenantId, opts = {}) {
+    assertTenantId('loadExtractionQueue', tenantId);
+    const limit = opts.limit ?? 100;
+    if (opts.status && !VALID_QUEUE_STATES.has(opts.status)) {
+        throw new Error(`loadExtractionQueue: status must be one of ${Array.from(VALID_QUEUE_STATES).join('|')}; got ${opts.status}`);
+    }
+    const db = openHippoDb(hippoRoot);
+    try {
+        const clauses = ['tenant_id = ?'];
+        const params = [tenantId];
+        if (opts.status) {
+            clauses.push('status = ?');
+            params.push(opts.status);
+        }
+        params.push(limit);
+        const rows = db.prepare(`
+      SELECT ${QUEUE_COLS} FROM graph_extraction_queue
+      WHERE ${clauses.join(' AND ')}
+      ORDER BY enqueued_at ASC, id ASC
+      LIMIT ?
+    `).all(...params);
+        return rows.map(rowToQueueItem);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+/**
+ * Mark a queue item terminal (processed | skipped). Only `status`/`processed_at`
+ * change, so the consolidated-source guard trigger (which fires on
+ * memory_id/kind/tenant_id changes) is not involved. CAS on the current status to a
+ * non-terminal 'pending'.
+ */
+export function markExtractionProcessed(hippoRoot, tenantId, id, status = 'processed') {
+    assertTenantId('markExtractionProcessed', tenantId);
+    const now = new Date().toISOString();
+    const db = openHippoDb(hippoRoot);
+    try {
+        const updated = db.prepare(`
+      UPDATE graph_extraction_queue
+      SET status = ?, processed_at = ?
+      WHERE id = ? AND tenant_id = ? AND status = 'pending'
+    `).run(status, now, id, tenantId);
+        if (updated.changes === 0) {
+            const existing = db.prepare(`SELECT status FROM graph_extraction_queue WHERE id = ? AND tenant_id = ?`)
+                .get(id, tenantId);
+            if (!existing)
+                throw new Error(`markExtractionProcessed: queue item ${id} not found for tenant ${tenantId}`);
+            throw new Error(`markExtractionProcessed: queue item ${id} is not pending (status='${existing.status}')`);
+        }
+        const row = db.prepare(`SELECT ${QUEUE_COLS} FROM graph_extraction_queue WHERE id = ? AND tenant_id = ?`)
+            .get(id, tenantId);
+        if (!row)
+            throw new Error(`markExtractionProcessed: queue item ${id} not found after UPDATE`);
+        return rowToQueueItem(row);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+/**
+ * Delete ALL entities for a tenant (relations cascade via the from/to FKs). Returns
+ * the number of entities deleted. The rebuild primitive for graph extraction: the
+ * deterministic graph is a pure derived function of the consolidated objects, so an
+ * extract clears then re-derives. Lives in graph.ts (the sole sanctioned graph
+ * writer), so the E3.3 CI lint permits this `DELETE FROM entities`. Does NOT touch
+ * graph_extraction_queue (the enqueue-hook's domain).
+ */
+export function clearGraph(hippoRoot, tenantId) {
+    assertTenantId('clearGraph', tenantId);
+    const db = openHippoDb(hippoRoot);
+    try {
+        const res = db.prepare(`DELETE FROM entities WHERE tenant_id = ?`).run(tenantId);
+        return Number(res.changes ?? 0);
+    }
+    finally {
+        closeHippoDb(db);
+    }
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAY5C,MAAM,CAAC,MAAM,kBAAkB,GAA4B,IAAI,GAAG,CAAa;IAC7E,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU;CAChE,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,oBAAoB,GAA8B,IAAI,GAAG,CAAe;IACnF,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY;CAC/D,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAkC,IAAI,GAAG,CAAmB;IACzF,SAAS,EAAE,WAAW,EAAE,SAAS;CAClC,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAkFvC,SAAS,WAAW,CAAC,GAAc;IACjC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,UAAU,EAAE,GAAG,CAAC,WAAyB;QACzC,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,UAAU,EAAE,GAAG,CAAC,WAAyB;QACzC,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC;AACJ,CAAC;AACD,SAAS,aAAa,CAAC,GAAgB;IACrC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,YAAY,EAAE,GAAG,CAAC,cAAc;QAChC,UAAU,EAAE,GAAG,CAAC,YAAY;QAC5B,OAAO,EAAE,GAAG,CAAC,QAAwB;QACrC,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,UAAU,EAAE,GAAG,CAAC,WAAyB;QACzC,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC;AACJ,CAAC;AACD,SAAS,cAAc,CAAC,GAAa;IACnC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,IAAI,EAAE,GAAG,CAAC,IAAkB;QAC5B,MAAM,EAAE,GAAG,CAAC,MAA0B;QACtC,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,WAAW,EAAE,GAAG,CAAC,YAAY;KAC9B,CAAC;AACJ,CAAC;AAED,MAAM,WAAW,GAAG,sEAAsE,CAAC;AAC3F,MAAM,aAAa,GAAG,2FAA2F,CAAC;AAClH,MAAM,UAAU,GAAG,mEAAmE,CAAC;AAUvF;;;;;GAKG;AACH,SAAS,yBAAyB,CAAC,EAAU,EAAE,QAAgB,EAAE,QAAgB,EAAE,KAAa;IAC9F,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAE3E,CAAC;IACd,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,mBAAmB,QAAQ,YAAY,CAAC,CAAC;IACnE,CAAC;IACD,IAAI,GAAG,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,mBAAmB,QAAQ,4BAA4B,CAAC,CAAC;IACnF,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,mBAAmB,QAAQ,oDAAoD,CAAC,CAAC;IAC3G,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,mBAAmB,QAAQ,0BAA0B,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,SAAiB,EACjB,QAAgB,EAChB,IAAsB;IAEtB,cAAc,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IACzC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,2CAA2C,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IACjI,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACzE,IAAI,IAAI,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,kCAAkC,mBAAmB,WAAW,CAAC,CAAC;IACpF,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,yBAAyB,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGzB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,WAAW,6BAA6B,CAAC,CAAC,GAAG,CAAC,EAAE,CAA0B,CAAC;QAC5G,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC5E,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,SAAiB,EACjB,QAAgB,EAChB,IAAwB;IAExB,cAAc,CAAC,gBAAgB,EAAE,QAAQ,CAAC,CAAC;IAC3C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,0CAA0C,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC/H,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAU,EAAE,CAAC;YAC1F,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC,GAAG,CAAC,GAAG,CAAsC,CAAC;YACpH,IAAI,CAAC,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC;YAC7E,IAAI,GAAG,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,WAAW,GAAG,oDAAoD,CAAC,CAAC;YAC7G,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,yBAAyB,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGzB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QACnG,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,aAAa,8BAA8B,CAAC,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;QACjH,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;QAChF,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,SAAiB,EAAE,QAAgB,EAAE,EAAU;IAC5E,cAAc,CAAC,gBAAgB,EAAE,QAAQ,CAAC,CAAC;IAC3C,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,WAAW,+CAA+C,CAAC;aACzF,GAAG,CAAC,EAAE,EAAE,QAAQ,CAA0B,CAAC;QAC9C,OAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvC,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,SAAiB,EACjB,QAAgB,EAChB,OAAoD,EAAE;IAEtD,cAAc,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAChC,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,KAAK,CAAC,2CAA2C,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IACjI,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,CAAC;QAClC,MAAM,MAAM,GAAc,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;eACb,WAAW;cACZ,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAgB,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/B,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,SAAiB,EACjB,QAAgB,EAChB,OAAkD,EAAE;IAEpD,cAAc,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAChC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,CAAC;QAClC,MAAM,MAAM,GAAc,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;eACb,aAAa;cACd,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAkB,CAAC;QACnC,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,+EAA+E;AAC/E,yEAAyE;AACzE,8EAA8E;AAE9E;yFACyF;AACzF,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAAiB,EACjB,QAAgB,EAChB,SAAmB;IAEnB,cAAc,CAAC,wBAAwB,EAAE,QAAQ,CAAC,CAAC;IACnD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC;YACpD,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;iBACb,WAAW;gDACoB,EAAE;OAC3C,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAgB,CAAC;YAC1C,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAiB,EACjB,QAAgB,EAChB,GAAa;IAEb,cAAc,CAAC,mBAAmB,EAAE,QAAQ,CAAC,CAAC;IAC9C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC;YACnD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC;YAC9C,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;iBACb,WAAW;yCACa,EAAE;OACpC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAgB,CAAC;YAC1C,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAAiB,EACjB,QAAgB,EAChB,SAAmB,EACnB,OAA2B,EAAE;IAE7B,cAAc,CAAC,uBAAuB,EAAE,QAAQ,CAAC,CAAC;IAClD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;IACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,oEAAoE,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,oFAAoF;QACpF,+EAA+E;QAC/E,kFAAkF;QAClF,+EAA+E;QAC/E,oCAAoC;QACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC;YACpD,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;iBACb,aAAa;sDACwB,EAAE,yBAAyB,EAAE;;;OAG5E,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,KAAK,EAAE,GAAG,KAAK,EAAE,KAAK,CAAkB,CAAC;YAC7D,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,mFAAmF;AACnF,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAiB,EACjB,QAAgB,EAChB,QAAgB;IAEhB,cAAc,CAAC,mBAAmB,EAAE,QAAQ,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,yBAAyB,CAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC;QACpF,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGzB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,UAAU,2CAA2C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAyB,CAAC;QACxH,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC5E,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,SAAiB,EACjB,QAAgB,EAChB,OAAsD,EAAE;IAExD,cAAc,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAChC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CAAC,8CAA8C,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChI,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,CAAC;QAClC,MAAM,MAAM,GAAc,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;eACb,UAAU;cACX,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAe,CAAC;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,SAAiB,EACjB,QAAgB,EAChB,EAAU,EACV,SAAkC,WAAW;IAE7C,cAAc,CAAC,yBAAyB,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAI1B,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClC,IAAI,OAAO,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,0EAA0E,CAAC;iBACpG,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAmC,CAAC;YACvD,IAAI,CAAC,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,EAAE,yBAAyB,QAAQ,EAAE,CAAC,CAAC;YAC7G,MAAM,IAAI,KAAK,CAAC,uCAAuC,EAAE,4BAA4B,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC;QAC5G,CAAC;QACD,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,UAAU,6DAA6D,CAAC;aACtG,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAyB,CAAC;QAC7C,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,EAAE,yBAAyB,CAAC,CAAC;QAC9F,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,QAAgB;IAC5D,cAAc,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IACvC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IAClC,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC"}

package/dist/incidents.d.ts

@@ -0,0 +1,100 @@
+/**
+ * E2 incident first-class object (docs/plans/2026-05-29-e2-incident-object.md).
+ *
+ * An incident is a postmortem capsule: a recorded operational event with a
+ * lifecycle and optional linked receipts (the memories that are its evidence).
+ * The `incidents` table is the source of truth: an incident stays `open`
+ * regardless of memory decay. A memory row still mirrors the incident for
+ * recall surfaces but is NOT canonical — memory_id is NULLABLE with ON DELETE
+ * SET NULL so forget/consolidate/archive gracefully orphans the incident row.
+ *
+ * Lifecycle: open -> resolved (a resolution was recorded; the incident stays on
+ * record with resolution_text + resolved_at) or open|resolved -> closed
+ * (retired with closed_at). This is NOT decision's supersede: there is no
+ * superseded_by self-FK, no supersede CAS, and no supersede trigger.
+ *
+ * Tenant scoping: every helper requires tenantId. BEFORE INSERT/UPDATE triggers
+ * enforce incidents.tenant_id == the referenced memory's tenant_id. Mirrors the
+ * v30 decisions pattern (src/decisions.ts).
+ *
+ * Dual-write atomicity: `saveIncident` writes the memory + incidents row inside
+ * writeEntry's SAVEPOINT 'write_entry' (store.ts) via the afterWrite hook, so a
+ * failure in any step rolls all of them back. Pattern matches saveDecision.
+ *
+ * linked_memory_ids ("linked receipts"): a JSON-encoded array of memory ids on
+ * the row, default `[]`. On save, every id must exist in the SAME tenant; a
+ * cross-tenant or nonexistent id is rejected (throw) before the insert.
+ */
+export type IncidentStatus = 'open' | 'resolved' | 'closed';
+export declare const VALID_INCIDENT_STATES: ReadonlySet<IncidentStatus>;
+export interface Incident {
+    id: number;
+    /** Nullable: ON DELETE SET NULL lets memory deletion (forget / consolidate /
+     *  archive) proceed without breaking the incident row. */
+    memoryId: string | null;
+    tenantId: string;
+    incidentText: string;
+    context: string | null;
+    status: IncidentStatus;
+    /** Set only when status === 'resolved'. */
+    resolutionText: string | null;
+    resolvedAt: string | null;
+    closedAt: string | null;
+    /** Linked receipts: memory ids that are this incident's evidence. */
+    linkedMemoryIds: string[];
+    createdAt: string;
+}
+export interface SaveIncidentOpts {
+    incidentText: string;
+    context?: string;
+    /** Memory ids (linked receipts) that are this incident's evidence. Each must
+     *  exist in the same tenant; cross-tenant/nonexistent ids are rejected. */
+    linkedMemoryIds?: string[];
+    /** Extra memory tags merged after ['incident'] (the CLI passes path-context
+     *  tags; HTTP/SDK pass none). */
+    extraTags?: string[];
+}
+export interface ListIncidentsOpts {
+    status?: IncidentStatus;
+    limit?: number;
+}
+/**
+ * Create an incident. Writes the memory mirror + the incidents row atomically
+ * inside writeEntry's SAVEPOINT 'write_entry'.
+ *
+ * The memory mirror: tags ['incident', ...extraTags], source 'incident',
+ * confidence 'verified', half_life INCIDENT_HALF_LIFE_DAYS, content =
+ * "<text>\n\nContext: <context>" when context is given.
+ *
+ * linked_memory_ids are validated BEFORE insert: each must exist in the SAME
+ * tenant. A cross-tenant or nonexistent id throws and rolls back the whole
+ * write. The validated ids are stored as JSON.stringify(validated).
+ */
+export declare function saveIncident(hippoRoot: string, tenantId: string, opts: SaveIncidentOpts, actor?: string): Incident;
+/**
+ * Resolve an open incident (open -> resolved). Records resolution_text +
+ * resolved_at; the incident stays on record. CAS guard: WHERE status='open';
+ * 0 changes distinguishes not-found from not-open so callers surface the right
+ * error. Emits incident_resolve.
+ */
+export declare function resolveIncident(hippoRoot: string, tenantId: string, id: number, resolutionText: string, actor?: string): Incident;
+/**
+ * Close (retire) an incident from open or resolved (open|resolved -> closed).
+ * Updates closed_at only; the memory mirror is not mutated. CAS guard: WHERE
+ * status IN ('open','resolved'); 0 changes distinguishes not-found from
+ * wrong-state. Emits incident_close.
+ */
+export declare function closeIncident(hippoRoot: string, tenantId: string, id: number, actor?: string): Incident;
+export declare function loadIncidentById(hippoRoot: string, tenantId: string, id: number): Incident | null;
+export declare function loadIncidents(hippoRoot: string, tenantId: string, opts?: ListIncidentsOpts): Incident[];
+export declare function loadOpenIncidents(hippoRoot: string, tenantId: string, opts?: {
+    limit?: number;
+}): Incident[];
+/**
+ * Resolve a memory id to the table id of the OPEN incident backed by that
+ * memory, or null when the memory has no open incident row. Extracted so a
+ * memory-id-based lookup is unit-testable at the store layer (mirror of
+ * resolveActiveDecisionIdByMemory).
+ */
+export declare function resolveActiveIncidentIdByMemory(hippoRoot: string, tenantId: string, memoryId: string): number | null;
+//# sourceMappingURL=incidents.d.ts.map

package/dist/incidents.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"incidents.d.ts","sourceRoot":"","sources":["../src/incidents.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAWH,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,UAAU,GAAG,QAAQ,CAAC;AAE5D,eAAO,MAAM,qBAAqB,EAAE,WAAW,CAAC,cAAc,CAI5D,CAAC;AAEH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX;8DAC0D;IAC1D,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,MAAM,EAAE,cAAc,CAAC;IACvB,2CAA2C;IAC3C,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,qEAAqE;IACrE,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;+EAC2E;IAC3E,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B;qCACiC;IACjC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAyDD;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,gBAAgB,EACtB,KAAK,GAAE,MAAc,GACpB,QAAQ,CAmFV;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,EAAE,EAAE,MAAM,EACV,cAAc,EAAE,MAAM,EACtB,KAAK,GAAE,MAAc,GACpB,QAAQ,CAqDV;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,EAAE,EAAE,MAAM,EACV,KAAK,GAAE,MAAc,GACpB,QAAQ,CAkDV;AAED,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,EAAE,EAAE,MAAM,GACT,QAAQ,GAAG,IAAI,CAUjB;AAED,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE,iBAAsB,GAC3B,QAAQ,EAAE,CA8BZ;AAED,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5B,QAAQ,EAAE,CAEZ;AAED;;;;;GAKG;AACH,wBAAgB,+BAA+B,CAC7C,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,GACf,MAAM,GAAG,IAAI,CAWf"}