@psiclawops/hypermem 0.9.0 → 0.9.1

package/dist/context-store.js

@@ -1,279 +0,0 @@
-/**
- * hypermem Context Store
- *
- * Manages the `contexts` table — a durable record of agent conversation
- * contexts that tracks which session is active, what the current head
- * message is, and supports archival and forking.
- *
- * Each agent + session pair has at most one active context at a time.
- * Contexts are the anchor point for the compositor: they track the
- * head message (most recent message included in composed context) and
- * link back to the underlying conversation.
- *
- * Design principles:
- *   - All functions take DatabaseSync as first arg (standalone, no classes)
- *   - Fully idempotent — safe to call on every startup
- *   - Head pointer is monotone-forward (never moves backward)
- *   - Archive is idempotent (no-op if already archived)
- */
-// ─── Internal Helpers ───────────────────────────────────────────
-function parseContextRow(row) {
-    return {
-        id: row.id,
-        agentId: row.agent_id,
-        sessionKey: row.session_key,
-        conversationId: row.conversation_id,
-        headMessageId: row.head_message_id ?? null,
-        parentContextId: row.parent_context_id ?? null,
-        status: row.status,
-        createdAt: row.created_at,
-        updatedAt: row.updated_at,
-        metadataJson: row.metadata_json ?? null,
-    };
-}
-function nowIso() {
-    return new Date().toISOString();
-}
-// ─── Schema ─────────────────────────────────────────────────────
-/**
- * Add the contexts table and related indexes to an existing messages.db.
- * Also ALTERs the messages table to add a context_id foreign key column.
- * Idempotent — safe to call on every startup.
- */
-export function ensureContextSchema(db) {
-    db.exec(`
-    CREATE TABLE IF NOT EXISTS contexts (
-      id INTEGER PRIMARY KEY,
-      agent_id TEXT NOT NULL,
-      session_key TEXT NOT NULL,
-      conversation_id INTEGER REFERENCES conversations(id),
-      head_message_id INTEGER REFERENCES messages(id),
-      parent_context_id INTEGER REFERENCES contexts(id),
-      status TEXT NOT NULL DEFAULT 'active',
-      created_at TEXT NOT NULL,
-      updated_at TEXT NOT NULL,
-      metadata_json TEXT
-    )
-  `);
-    db.exec(`
-    CREATE UNIQUE INDEX IF NOT EXISTS idx_contexts_active_session
-      ON contexts(agent_id, session_key, status)
-      WHERE status = 'active'
-  `);
-    db.exec(`
-    CREATE INDEX IF NOT EXISTS idx_contexts_head
-      ON contexts(head_message_id)
-  `);
-    // ALTER messages table to add context_id column (PRAGMA guard)
-    const msgCols = db.prepare('PRAGMA table_info(messages)').all().map(r => r.name);
-    if (!msgCols.includes('context_id')) {
-        db.exec('ALTER TABLE messages ADD COLUMN context_id INTEGER REFERENCES contexts(id)');
-    }
-}
-// ─── Context Operations ─────────────────────────────────────────
-/**
- * Get the active context for an agent + session pair.
- * Returns null if no active context exists.
- */
-export function getActiveContext(db, agentId, sessionKey) {
-    const row = db
-        .prepare('SELECT * FROM contexts WHERE agent_id = ? AND session_key = ? AND status = ?')
-        .get(agentId, sessionKey, 'active');
-    if (!row)
-        return null;
-    return parseContextRow(row);
-}
-/**
- * Get the active context for an agent + session, creating one if none exists.
- *
- * If an active context already exists, returns it unchanged.
- * Otherwise INSERTs a new context with status='active', head_message_id=NULL,
- * and the given conversationId.
- *
- * Idempotent — safe to call repeatedly.
- */
-export function getOrCreateActiveContext(db, agentId, sessionKey, conversationId) {
-    const existing = getActiveContext(db, agentId, sessionKey);
-    if (existing)
-        return existing;
-    const now = nowIso();
-    const result = db
-        .prepare(`INSERT INTO contexts (agent_id, session_key, conversation_id, head_message_id, parent_context_id, status, created_at, updated_at, metadata_json)
-       VALUES (?, ?, ?, NULL, NULL, 'active', ?, ?, NULL)`)
-        .run(agentId, sessionKey, conversationId, now, now);
-    return {
-        id: Number(result.lastInsertRowid),
-        agentId,
-        sessionKey,
-        conversationId,
-        headMessageId: null,
-        parentContextId: null,
-        status: 'active',
-        createdAt: now,
-        updatedAt: now,
-        metadataJson: null,
-    };
-}
-/**
- * Update the head message pointer for a context.
- *
- * Monotone forward: only updates if messageId > current head_message_id
- * (or current is NULL). This prevents accidental regression of the head
- * pointer, matching the compaction-fence monotone progress pattern.
- */
-export function updateContextHead(db, contextId, messageId) {
-    const now = nowIso();
-    const row = db
-        .prepare('SELECT head_message_id FROM contexts WHERE id = ?')
-        .get(contextId);
-    if (!row)
-        return;
-    // Monotone forward: only advance, never regress
-    if (row.head_message_id === null || messageId > row.head_message_id) {
-        db.prepare('UPDATE contexts SET head_message_id = ?, updated_at = ? WHERE id = ?').run(messageId, now, contextId);
-    }
-}
-/**
- * Archive a context, setting its status to 'archived'.
- * Idempotent — no-op if already archived.
- */
-export function archiveContext(db, contextId) {
-    const now = nowIso();
-    db.prepare(`UPDATE contexts SET status = 'archived', updated_at = ? WHERE id = ? AND status != 'archived'`).run(now, contextId);
-}
-/**
- * Get any context by id, regardless of status.
- * Returns null if not found.
- *
- * @boundary INSPECTION ONLY — not a mining entry point.
- * @policy See specs/DAG_HELPER_POLICY.md for helper classifications.
- * Do not use this function to retrieve messages for active composition or
- * historical mining. Use getArchivedContext + mineArchivedContext for archived
- * mining, and getActiveContext for composition-path access.
- */
-export function getContextById(db, contextId) {
-    const row = db
-        .prepare('SELECT * FROM contexts WHERE id = ?')
-        .get(contextId);
-    if (!row)
-        return null;
-    return parseContextRow(row);
-}
-/**
- * Get all archived or forked contexts for an agent.
- * Optionally filter by sessionKey and/or limit.
- * Returns in reverse-chronological order (most recently updated first).
- *
- * @policy See specs/DAG_HELPER_POLICY.md. This is the operator-safe
- * archived-context enumeration path.
- */
-export function getArchivedContexts(db, agentId, opts) {
-    let sql = "SELECT * FROM contexts WHERE agent_id = ? AND status IN ('archived', 'forked')";
-    const params = [agentId];
-    if (opts?.sessionKey) {
-        sql += ' AND session_key = ?';
-        params.push(opts.sessionKey);
-    }
-    sql += ' ORDER BY updated_at DESC';
-    if (opts?.limit) {
-        sql += ' LIMIT ?';
-        params.push(opts.limit);
-    }
-    const rows = db.prepare(sql).all(...params);
-    return rows.map(parseContextRow);
-}
-/**
- * Get an archived or forked context by id.
- * Returns null if the context does not exist OR if it is active.
- *
- * @policy See specs/DAG_HELPER_POLICY.md. This is the operator-safe
- * single-context lookup path.
- */
-export function getArchivedContext(db, contextId) {
-    const row = db
-        .prepare("SELECT * FROM contexts WHERE id = ? AND status IN ('archived', 'forked')")
-        .get(contextId);
-    if (!row)
-        return null;
-    return parseContextRow(row);
-}
-/**
- * Walk the parent_context_id chain upward from the given context.
- * Returns contexts in leaf-to-root order (starting context first).
- * Includes the starting context itself.
- * Caps traversal depth at 100 to avoid corrupt loops.
- *
- * @boundary STATUS-CROSSING BY DESIGN — this function traverses across
- * active, archived, and forked contexts without filtering by status.
- * @policy See specs/DAG_HELPER_POLICY.md for the call-site filtering rule.
- * If you need only archived/forked contexts in the lineage chain, filter
- * the returned array at the call site (e.g. `.filter(c => c.status !== 'active')`).
- */
-export function getContextLineage(db, contextId) {
-    const lineage = [];
-    const visited = new Set();
-    let currentId = contextId;
-    while (currentId !== null && lineage.length < 100) {
-        if (visited.has(currentId))
-            break; // loop guard
-        visited.add(currentId);
-        const row = db
-            .prepare('SELECT * FROM contexts WHERE id = ?')
-            .get(currentId);
-        if (!row)
-            break;
-        const ctx = parseContextRow(row);
-        lineage.push(ctx);
-        currentId = ctx.parentContextId;
-    }
-    return lineage;
-}
-/**
- * Get direct fork children of a context (contexts with parent_context_id = parentContextId).
- * Returns in ascending creation order.
- *
- * @boundary STATUS-CROSSING BY DESIGN — returns children regardless of their status
- * (may include active, archived, or forked children).
- * @policy See specs/DAG_HELPER_POLICY.md for the call-site filtering rule.
- * Filter at the call site if archived-only results are needed.
- */
-export function getForkChildren(db, parentContextId) {
-    const rows = db
-        .prepare('SELECT * FROM contexts WHERE parent_context_id = ? ORDER BY created_at ASC')
-        .all(parentContextId);
-    return rows.map(parseContextRow);
-}
-/**
- * Rotate a session's active context: archive the current active context
- * and create a new one, optionally linking back via parent_context_id.
- *
- * Used on session restarts/rotations so the new context starts with a
- * clean head pointer instead of inheriting the stale tail.
- *
- * Returns the newly created active context.
- * If no active context exists, simply creates one (no archive step).
- */
-export function rotateSessionContext(db, agentId, sessionKey, conversationId) {
-    const existing = getActiveContext(db, agentId, sessionKey);
-    if (existing) {
-        archiveContext(db, existing.id);
-    }
-    const now = nowIso();
-    const result = db
-        .prepare(`INSERT INTO contexts (agent_id, session_key, conversation_id, head_message_id, parent_context_id, status, created_at, updated_at, metadata_json)
-       VALUES (?, ?, ?, NULL, ?, 'active', ?, ?, NULL)`)
-        .run(agentId, sessionKey, conversationId, existing?.id ?? null, now, now);
-    return {
-        id: Number(result.lastInsertRowid),
-        agentId,
-        sessionKey,
-        conversationId,
-        headMessageId: null,
-        parentContextId: existing?.id ?? null,
-        status: 'active',
-        createdAt: now,
-        updatedAt: now,
-        metadataJson: null,
-    };
-}
-//# sourceMappingURL=context-store.js.map

package/dist/contradiction-audit-store.d.ts

@@ -1,54 +0,0 @@
-/**
- * hypermem Contradiction Audit Store
- *
- * Lightweight audit trail for contradiction detections during background indexing.
- * Records when the indexer identifies a new fact candidate that contradicts an
- * existing stored fact, without auto-resolving (autoResolve: false path).
- *
- * Stored in library.db under the contradiction_audits table (created on demand).
- * Used for observability and future contradiction resolution tooling.
- */
-import type { DatabaseSync } from 'node:sqlite';
-import type { ContradictionCandidate } from './contradiction-detector.js';
-export interface ContradictionAuditEntry {
-    id: number;
-    agentId: string;
-    newContent: string;
-    newDomain: string | null;
-    existingFactId: number;
-    existingContent: string;
-    similarityScore: number;
-    contradictionScore: number;
-    reason: string;
-    sourceRef: string | null;
-    createdAt: string;
-}
-export declare class ContradictionAuditStore {
-    private readonly db;
-    constructor(db: DatabaseSync);
-    private ensureTable;
-    /**
-     * Record a detected contradiction between a new fact candidate and an existing fact.
-     *
-     * @param agentId     - Agent whose fact was being indexed
-     * @param newFact     - The incoming fact candidate (not yet stored)
-     * @param candidate   - The contradiction candidate from ContradictionDetector
-     * @param opts        - Optional metadata (sourceRef = "msg:<id>" etc.)
-     */
-    recordFactAudit(agentId: string, newFact: {
-        content: string;
-        domain?: string | null;
-    }, candidate: ContradictionCandidate, opts?: {
-        sourceRef?: string;
-        status?: string;
-    }): void;
-    /**
-     * Fetch recent audit entries for an agent (most recent first).
-     */
-    getRecentAudits(agentId: string, limit?: number): ContradictionAuditEntry[];
-    /**
-     * Count unresolved audits for an agent.
-     */
-    countAudits(agentId: string): number;
-}
-//# sourceMappingURL=contradiction-audit-store.d.ts.map

package/dist/contradiction-audit-store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"contradiction-audit-store.d.ts","sourceRoot":"","sources":["../src/contradiction-audit-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AAE1E,MAAM,WAAW,uBAAuB;IACtC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qBAAa,uBAAuB;IACtB,OAAO,CAAC,QAAQ,CAAC,EAAE;gBAAF,EAAE,EAAE,YAAY;IAI7C,OAAO,CAAC,WAAW;IAiCnB;;;;;;;OAOG;IACH,eAAe,CACb,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,EACpD,SAAS,EAAE,sBAAsB,EACjC,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAC7C,IAAI;IAqBP;;OAEG;IACH,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,uBAAuB,EAAE;IAYvE;;OAEG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;CAMrC"}

package/dist/contradiction-audit-store.js

@@ -1,88 +0,0 @@
-/**
- * hypermem Contradiction Audit Store
- *
- * Lightweight audit trail for contradiction detections during background indexing.
- * Records when the indexer identifies a new fact candidate that contradicts an
- * existing stored fact, without auto-resolving (autoResolve: false path).
- *
- * Stored in library.db under the contradiction_audits table (created on demand).
- * Used for observability and future contradiction resolution tooling.
- */
-export class ContradictionAuditStore {
-    db;
-    constructor(db) {
-        this.db = db;
-        this.ensureTable();
-    }
-    ensureTable() {
-        // Synced with library-schema.ts v19 shape so in-memory test DBs match production.
-        // In real usage, setupLibraryDb() runs first and this CREATE TABLE is a no-op.
-        this.db.exec(`
-      CREATE TABLE IF NOT EXISTS contradiction_audits (
-        id                   INTEGER PRIMARY KEY AUTOINCREMENT,
-        agent_id             TEXT NOT NULL,
-        entity_type          TEXT NOT NULL CHECK(entity_type IN ('fact')),
-        new_content          TEXT NOT NULL,
-        new_domain           TEXT,
-        existing_fact_id     INTEGER NOT NULL,
-        existing_content     TEXT NOT NULL,
-        similarity_score     REAL NOT NULL DEFAULT 0,
-        contradiction_score  REAL NOT NULL DEFAULT 0,
-        reason               TEXT NOT NULL,
-        detector             TEXT NOT NULL DEFAULT 'heuristic_v1',
-        suggested_resolution TEXT NOT NULL DEFAULT 'review',
-        source_ref           TEXT,
-        status               TEXT NOT NULL DEFAULT 'pending'
-          CHECK(status IN ('pending', 'accepted', 'dismissed', 'auto-superseded', 'auto-invalidated')),
-        resolution_notes     TEXT,
-        created_at           TEXT NOT NULL DEFAULT (datetime('now')),
-        resolved_at          TEXT
-      );
-      CREATE INDEX IF NOT EXISTS idx_contradiction_audits_agent_status
-        ON contradiction_audits (agent_id, status, created_at DESC);
-      CREATE INDEX IF NOT EXISTS idx_contradiction_audits_existing_fact
-        ON contradiction_audits (existing_fact_id, status);
-      CREATE INDEX IF NOT EXISTS idx_contradiction_audits_agent
-        ON contradiction_audits (agent_id, created_at DESC);
-    `);
-    }
-    /**
-     * Record a detected contradiction between a new fact candidate and an existing fact.
-     *
-     * @param agentId     - Agent whose fact was being indexed
-     * @param newFact     - The incoming fact candidate (not yet stored)
-     * @param candidate   - The contradiction candidate from ContradictionDetector
-     * @param opts        - Optional metadata (sourceRef = "msg:<id>" etc.)
-     */
-    recordFactAudit(agentId, newFact, candidate, opts) {
-        const status = opts?.status ?? 'pending';
-        this.db.prepare(`
-      INSERT INTO contradiction_audits
-        (agent_id, entity_type, new_content, new_domain, existing_fact_id, existing_content,
-         similarity_score, contradiction_score, reason, source_ref, status, created_at)
-      VALUES (?, 'fact', ?, ?, ?, ?, ?, ?, ?, ?, ?, datetime('now'))
-    `).run(agentId, newFact.content, newFact.domain ?? null, candidate.existingFactId, candidate.existingContent, candidate.similarityScore, candidate.contradictionScore, candidate.reason, opts?.sourceRef ?? null, status);
-    }
-    /**
-     * Fetch recent audit entries for an agent (most recent first).
-     */
-    getRecentAudits(agentId, limit = 20) {
-        return this.db.prepare(`
-      SELECT
-        id, agent_id, new_content, new_domain, existing_fact_id, existing_content,
-        similarity_score, contradiction_score, reason, source_ref, created_at
-      FROM contradiction_audits
-      WHERE agent_id = ?
-      ORDER BY created_at DESC
-      LIMIT ?
-    `).all(agentId, limit);
-    }
-    /**
-     * Count unresolved audits for an agent.
-     */
-    countAudits(agentId) {
-        const row = this.db.prepare('SELECT COUNT(*) as cnt FROM contradiction_audits WHERE agent_id = ?').get(agentId);
-        return row?.cnt ?? 0;
-    }
-}
-//# sourceMappingURL=contradiction-audit-store.js.map

package/dist/contradiction-detector.d.ts

@@ -1,78 +0,0 @@
-/**
- * Contradiction Detector — heuristic-based contradiction detection for the fact store.
- *
- * Detects when a newly ingested fact contradicts existing active facts using
- * vector similarity (when available) and FTS candidate retrieval, scored by
- * pattern-based heuristics (negation, numeric conflict, state conflict, temporal).
- *
- * No LLM calls — v1 is purely heuristic. LLM-enhanced scoring is a future item.
- */
-import type { FactStore } from './fact-store.js';
-import type { VectorStore } from './vector-store.js';
-export interface ContradictionCandidate {
-    existingFactId: number;
-    existingContent: string;
-    similarityScore: number;
-    contradictionScore: number;
-    reason: string;
-}
-export interface ContradictionResult {
-    contradictions: ContradictionCandidate[];
-    autoResolved: boolean;
-    resolvedCount: number;
-}
-export interface ContradictionDetectorConfig {
-    /** Minimum similarity to consider as candidate. Default: 0.6 */
-    minSimilarity?: number;
-    /** Minimum contradiction score for auto-resolution. Default: 0.85 */
-    autoResolveThreshold?: number;
-    /** Max candidates to evaluate per ingest. Default: 10 */
-    maxCandidates?: number;
-    /** Enable auto-resolution. Default: true */
-    autoResolve?: boolean;
-}
-export declare class ContradictionDetector {
-    private readonly factStore;
-    private readonly vectorStore?;
-    private readonly config;
-    constructor(factStore: FactStore, vectorStore?: VectorStore | undefined, config?: ContradictionDetectorConfig);
-    /**
-     * On fact ingest, check if the new fact contradicts existing active facts.
-     * Uses vector similarity (when available) + FTS to find candidates, then
-     * scores each candidate with heuristic contradiction checks.
-     */
-    detectOnIngest(agentId: string, newFact: {
-        content: string;
-        domain?: string;
-    }): Promise<ContradictionResult>;
-    /**
-     * Resolve a detected contradiction between an existing fact and a new fact.
-     */
-    resolveContradiction(oldFactId: number, newFactId: number, resolution: 'supersede' | 'keep-both' | 'reject-new'): void;
-    /**
-     * Auto-resolve high-confidence contradictions: newer supersedes older.
-     * Only resolves candidates above the autoResolveThreshold.
-     *
-     * @param agentId - The agent whose facts are being resolved (for audit trail)
-     * @param candidates - Scored contradiction candidates from detectOnIngest
-     * @returns Count of auto-resolved contradictions
-     */
-    autoResolve(_agentId: string, candidates: ContradictionCandidate[]): Promise<number>;
-    /**
-     * Find candidate facts that might contradict the new fact.
-     * Uses vector search (if available) and FTS, deduplicates, and returns
-     * up to maxCandidates results above minSimilarity.
-     */
-    private findCandidates;
-    /**
-     * Score a candidate fact against the new fact content for contradiction.
-     * Returns a ContradictionCandidate if any heuristic fires, null otherwise.
-     */
-    private scoreContradiction;
-    /**
-     * Compute Jaccard-like token overlap between two texts.
-     * Returns 0-1 where 1 means identical token sets.
-     */
-    private tokenOverlapSimilarity;
-}
-//# sourceMappingURL=contradiction-detector.d.ts.map

package/dist/contradiction-detector.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"contradiction-detector.d.ts","sourceRoot":"","sources":["../src/contradiction-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAE,WAAW,EAAsB,MAAM,mBAAmB,CAAC;AAIzE,MAAM,WAAW,sBAAsB;IACrC,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,mBAAmB;IAClC,cAAc,EAAE,sBAAsB,EAAE,CAAC;IACzC,YAAY,EAAE,OAAO,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,2BAA2B;IAC1C,gEAAgE;IAChE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,qEAAqE;IACrE,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,yDAAyD;IACzD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4CAA4C;IAC5C,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAkKD,qBAAa,qBAAqB;IAI9B,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;IAJ/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAwC;gBAG5C,SAAS,EAAE,SAAS,EACpB,WAAW,CAAC,EAAE,WAAW,YAAA,EAC1C,MAAM,CAAC,EAAE,2BAA2B;IAKtC;;;;OAIG;IACG,cAAc,CAClB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAC5C,OAAO,CAAC,mBAAmB,CAAC;IAuB/B;;OAEG;IACH,oBAAoB,CAClB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,WAAW,GAAG,WAAW,GAAG,YAAY,GACnD,IAAI;IAcP;;;;;;;OAOG;IACG,WAAW,CACf,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,sBAAsB,EAAE,GACnC,OAAO,CAAC,MAAM,CAAC;IAoBlB;;;;OAIG;YACW,cAAc;IA0E5B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IA0D1B;;;OAGG;IACH,OAAO,CAAC,sBAAsB;CAa/B"}