@batalabs/virlow-mcp-core 3.11.4

package/dist/memories-enabled.js

@@ -0,0 +1,29 @@
+/**
+ * Whether the user has switched AI memories on, read fresh from the account.
+ *
+ * Deliberately not cached for the session. Turning the switch *on* being slow
+ * is an inconvenience; turning it *off* being slow is a privacy control that
+ * does not work. A user who switches memories off in the app expects the next
+ * tool call to respect it, not the next time they happen to restart their
+ * editor — and they would have no way to discover the difference.
+ *
+ * The cost is one GET alongside operations that already list folders, page
+ * through notes, decrypt, and embed.
+ */
+export async function memoriesAllowed(api) {
+    try {
+        const me = await api.me();
+        // An API that predates the column omits the field. Treat an unknown answer
+        // as "not enabled": this decides whether an AI may record facts about the
+        // user, and guessing yes is the expensive direction to be wrong in.
+        return me.memoriesEnabled === true;
+    }
+    catch {
+        // Fail closed. A network blip briefly disabling memories is a far better
+        // failure than a revoked setting continuing to work.
+        return false;
+    }
+}
+export const MEMORIES_DISABLED_MESSAGE = 'AI memories are switched off for this account. Turn on "AI memories" in ' +
+    'Settings → Security in the Virlow app to use this tool.';
+//# sourceMappingURL=memories-enabled.js.map

package/dist/memories-enabled.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memories-enabled.js","sourceRoot":"","sources":["../src/memories-enabled.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,GAAc;IAClD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC;QAC1B,2EAA2E;QAC3E,0EAA0E;QAC1E,oEAAoE;QACpE,OAAO,EAAE,CAAC,eAAe,KAAK,IAAI,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,yEAAyE;QACzE,qDAAqD;QACrD,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GACpC,0EAA0E;IAC1E,yDAAyD,CAAC"}

package/dist/memories.d.ts

@@ -0,0 +1,86 @@
+import { type Embedder } from '@batalabs/virlow-memory';
+import { type VirlowApi } from './api';
+import type { EmbeddingCache } from './embedding-cache';
+import { type MemoryMeta } from './memory-note';
+import type { Vault } from './vault';
+export declare const SYNC_PAGE_LIMIT = 100;
+export interface CachedMemory {
+    id: string;
+    label: string;
+    text: string;
+    meta: MemoryMeta;
+    namespace?: string;
+    folderId: string;
+    embedding: Float32Array;
+    updatedAt: string;
+}
+export interface SimilarMemory {
+    id: string;
+    label: string;
+    text: string;
+    similarity: number;
+}
+export type SyncResult = {
+    added: number;
+    updated: number;
+    removed: number;
+    embedded: number;
+};
+export declare class MemoryStore {
+    private readonly api;
+    private readonly vault;
+    private readonly embedder;
+    private readonly cacheFactory;
+    private readonly cache;
+    private tree;
+    private embeddings;
+    private embeddingsLoaded;
+    private syncInFlight;
+    private mutationChain;
+    /** Bumped every time clear() runs (i.e. every lock). Operations capture it
+     * at the top and re-check before every cache write, so anything still
+     * awaiting the network or a decrypt when the vault locked can never write
+     * decrypted plaintext back into a cache the user just emptied. */
+    private epoch;
+    constructor(api: VirlowApi, vault: Vault, embedder: Embedder, cacheFactory: (userId: string) => EmbeddingCache);
+    clear(): void;
+    get size(): number;
+    /** Concurrent callers share one in-flight sync so two overlapping tool
+     * calls never double up on network, decrypt, or embedding work. */
+    sync(): Promise<SyncResult>;
+    private doSync;
+    add(label: string, text: string, namespace?: string, meta?: MemoryMeta): Promise<{
+        action: 'stored' | 'updated';
+        id: string;
+        similar: SimilarMemory[];
+    }>;
+    search(query: string, namespace?: string, limit?: number): Promise<Array<Omit<CachedMemory, 'embedding' | 'folderId' | 'updatedAt'> & {
+        similarity: number;
+    }>>;
+    /** Requires a prior sync() in the same unlock to have populated the cache. */
+    list(namespace?: string): CachedMemory[];
+    update(id: string, changes: {
+        label?: string;
+        text?: string;
+        meta?: MemoryMeta;
+    }): Promise<void>;
+    /** Trashes the note — recoverable from the app's Trash, never hard-deleted. */
+    delete(id: string): Promise<void>;
+    /** Dedupe and search candidates: the named namespace plus the global root. */
+    private candidatesFor;
+    /** Create or update a memory note, encrypting through the note field
+     * helpers. `noteId === null` creates. */
+    private writeNote;
+    private decryptRow;
+    private requireTree;
+    private requireEmbeddings;
+    /** Persisting after a lock would write vectors the user just cleared. */
+    private saveEmbeddings;
+    private requireSession;
+    /** Serializes add/update/delete so two overlapping mutation tool calls never
+     * interleave — two concurrent near-duplicate adds must run their
+     * dedupe-check-then-write critical section one at a time, or both would miss
+     * the other's pending write and both create. */
+    private enqueue;
+}
+//# sourceMappingURL=memories.d.ts.map

package/dist/memories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memories.d.ts","sourceRoot":"","sources":["../src/memories.ts"],"names":[],"mappings":"AAKA,OAAO,EAIL,KAAK,QAAQ,EACd,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAA0C,KAAK,SAAS,EAAE,MAAM,OAAO,CAAC;AAC/E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAKL,KAAK,UAAU,EAChB,MAAM,eAAe,CAAC;AAEvB,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAErC,eAAO,MAAM,eAAe,MAAM,CAAC;AAEnC,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,YAAY,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAIF,qBAAa,WAAW;IAepB,OAAO,CAAC,QAAQ,CAAC,GAAG;IACpB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,YAAY;IAjB/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmC;IACzD,OAAO,CAAC,IAAI,CAA2B;IACvC,OAAO,CAAC,UAAU,CAA+B;IACjD,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,YAAY,CAAoC;IACxD,OAAO,CAAC,aAAa,CAAuC;IAE5D;;;sEAGkE;IAClE,OAAO,CAAC,KAAK,CAAK;gBAGC,GAAG,EAAE,SAAS,EACd,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,QAAQ,EAClB,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,cAAc;IAKnE,KAAK,IAAI,IAAI;IAQb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;uEACmE;IACnE,IAAI,IAAI,OAAO,CAAC,UAAU,CAAC;YAOb,MAAM;IA+FpB,GAAG,CACD,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,SAAS,CAAC,EAAE,MAAM,EAClB,IAAI,GAAE,UAAe,GACpB,OAAO,CAAC;QAAE,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,aAAa,EAAE,CAAA;KAAE,CAAC;IAwE5E,MAAM,CACV,KAAK,EAAE,MAAM,EACb,SAAS,CAAC,EAAE,MAAM,EAClB,KAAK,SAAK,GACT,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC,GAAG;QAAE,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAkBtG,8EAA8E;IAC9E,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,YAAY,EAAE;IAOxC,MAAM,CACJ,EAAE,EAAE,MAAM,EACV,OAAO,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,UAAU,CAAA;KAAE,GAC5D,OAAO,CAAC,IAAI,CAAC;IAyBhB,+EAA+E;IAC/E,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAYjC,8EAA8E;IAC9E,OAAO,CAAC,aAAa;IAYrB;6CACyC;YAC3B,SAAS;YAiCT,UAAU;YAWV,WAAW;YAKX,iBAAiB;IAS/B,yEAAyE;YAC3D,cAAc;IAK5B,OAAO,CAAC,cAAc;IAMtB;;;oDAGgD;IAChD,OAAO,CAAC,OAAO;CAKhB"}

package/dist/memories.js

@@ -0,0 +1,350 @@
+import { bytesToBase64, decryptNoteFields, encryptNoteFields, } from '@batalabs/virlow-crypto';
+import { findDuplicate, findSimilar, rankBySimilarity, } from '@batalabs/virlow-memory';
+import { ApiError } from './api';
+import { mergeMeta, parseMemoryNote, serializeMemoryBody, toCodeEnvelope, } from './memory-note';
+import { ensureNamespace, resolveMemoryTree } from './memory-tree';
+export const SYNC_PAGE_LIMIT = 100;
+const round3 = (n) => Math.round(n * 1000) / 1000;
+export class MemoryStore {
+    api;
+    vault;
+    embedder;
+    cacheFactory;
+    cache = new Map();
+    tree = null;
+    embeddings = null;
+    embeddingsLoaded = false;
+    syncInFlight = null;
+    mutationChain = Promise.resolve();
+    /** Bumped every time clear() runs (i.e. every lock). Operations capture it
+     * at the top and re-check before every cache write, so anything still
+     * awaiting the network or a decrypt when the vault locked can never write
+     * decrypted plaintext back into a cache the user just emptied. */
+    epoch = 0;
+    constructor(api, vault, embedder, cacheFactory) {
+        this.api = api;
+        this.vault = vault;
+        this.embedder = embedder;
+        this.cacheFactory = cacheFactory;
+        this.vault.onLock = () => this.clear();
+    }
+    clear() {
+        this.cache.clear();
+        this.tree = null;
+        this.embeddings = null;
+        this.embeddingsLoaded = false;
+        this.epoch++;
+    }
+    get size() {
+        return this.cache.size;
+    }
+    /** Concurrent callers share one in-flight sync so two overlapping tool
+     * calls never double up on network, decrypt, or embedding work. */
+    sync() {
+        this.syncInFlight ??= this.doSync().finally(() => {
+            this.syncInFlight = null;
+        });
+        return this.syncInFlight;
+    }
+    async doSync() {
+        const key = this.requireSession();
+        const startEpoch = this.epoch;
+        const result = { added: 0, updated: 0, removed: 0, embedded: 0 };
+        const tree = await this.requireTree();
+        const embeddings = await this.requireEmbeddings(key);
+        const seen = new Set();
+        for (const folderId of tree.folderIds()) {
+            let page = 1;
+            for (;;) {
+                let batch;
+                try {
+                    batch = await this.api.listNotes({
+                        folderId,
+                        deleted: false,
+                        page,
+                        limit: SYNC_PAGE_LIMIT,
+                    });
+                }
+                catch (err) {
+                    // The folder was deleted between resolving the tree and walking it.
+                    // Drop the stale tree so the next sync re-resolves, and move on.
+                    if (err instanceof ApiError && err.status === 404) {
+                        this.tree = null;
+                        break;
+                    }
+                    throw err;
+                }
+                for (const row of batch.notes) {
+                    // Hidden notes are segregated in the app; they are not memories.
+                    if (row.hidden === true)
+                        continue;
+                    seen.add(row.id);
+                    const existing = this.cache.get(row.id);
+                    if (existing && existing.updatedAt === row.updatedAt) {
+                        // Unchanged, but it may have been dragged to another subfolder.
+                        if (existing.folderId !== folderId) {
+                            const moved = {
+                                ...existing,
+                                folderId,
+                                ...namespaceField(tree.namespaceOf(folderId)),
+                            };
+                            if (this.epoch === startEpoch)
+                                this.cache.set(row.id, moved);
+                            result.updated++;
+                        }
+                        continue;
+                    }
+                    const { title, content } = await this.decryptRow(key, row);
+                    const { fact, meta } = parseMemoryNote(content);
+                    let embedding = embeddings.get(row.id, row.updatedAt);
+                    if (!embedding) {
+                        embedding = await this.embedder.embed(embeddingInput(title, fact));
+                        result.embedded++;
+                    }
+                    if (this.epoch !== startEpoch)
+                        continue;
+                    embeddings.set(row.id, row.updatedAt, embedding);
+                    this.cache.set(row.id, {
+                        id: row.id,
+                        label: title,
+                        text: fact,
+                        meta,
+                        folderId,
+                        ...namespaceField(tree.namespaceOf(folderId)),
+                        embedding,
+                        updatedAt: row.updatedAt,
+                    });
+                    if (existing)
+                        result.updated++;
+                    else
+                        result.added++;
+                }
+                if (page >= batch.pagination.pages || batch.notes.length === 0)
+                    break;
+                page++;
+            }
+        }
+        // Anything no longer in the tree was trashed, hidden, or moved out of the
+        // memories folder: it stops being a memory.
+        if (this.epoch === startEpoch) {
+            for (const id of [...this.cache.keys()]) {
+                if (seen.has(id))
+                    continue;
+                this.cache.delete(id);
+                embeddings.delete(id);
+                result.removed++;
+            }
+            await embeddings.save(key);
+        }
+        return result;
+    }
+    add(label, text, namespace, meta = {}) {
+        return this.enqueue(async () => {
+            await this.sync();
+            const key = this.requireSession();
+            const startEpoch = this.epoch;
+            const embedding = await this.embedder.embed(embeddingInput(label, text));
+            const candidates = this.candidatesFor(namespace);
+            const hit = findDuplicate(embedding, candidates);
+            if (hit) {
+                // Same memory said again: fold it into the existing note rather than
+                // accumulating near-identical copies. Its metadata carries forward.
+                const existing = this.cache.get(hit.id);
+                const merged = mergeMeta(existing.meta, meta);
+                const row = await this.writeNote(key, hit.id, label, text, merged);
+                if (this.epoch === startEpoch) {
+                    this.cache.set(hit.id, {
+                        ...existing,
+                        label,
+                        text,
+                        meta: merged,
+                        embedding,
+                        updatedAt: row.updatedAt,
+                    });
+                    this.embeddings?.set(hit.id, row.updatedAt, embedding);
+                    await this.saveEmbeddings(key, startEpoch);
+                }
+                return { action: 'updated', id: hit.id, similar: [] };
+            }
+            const tree = await this.requireTree();
+            const folderId = namespace !== undefined
+                ? await ensureNamespace(this.api, tree, namespace)
+                : tree.rootId;
+            const stamped = {
+                ...meta,
+                source: meta.source ?? 'virlow-mcp',
+                created: meta.created ?? new Date().toISOString(),
+            };
+            const row = await this.writeNote(key, null, label, text, stamped, folderId);
+            if (this.epoch === startEpoch) {
+                this.cache.set(row.id, {
+                    id: row.id,
+                    label,
+                    text,
+                    meta: stamped,
+                    folderId,
+                    ...namespaceField(tree.namespaceOf(folderId)),
+                    embedding,
+                    updatedAt: row.updatedAt,
+                });
+                this.embeddings?.set(row.id, row.updatedAt, embedding);
+                await this.saveEmbeddings(key, startEpoch);
+            }
+            // Close enough to be worth mentioning, not close enough to merge.
+            const similar = findSimilar(embedding, candidates).map(({ id, similarity }) => {
+                const memory = this.cache.get(id);
+                return {
+                    id,
+                    label: memory.label,
+                    text: memory.text,
+                    similarity: round3(similarity),
+                };
+            });
+            return { action: 'stored', id: row.id, similar };
+        });
+    }
+    async search(query, namespace, limit = 10) {
+        await this.sync();
+        this.requireSession();
+        const embedding = await this.embedder.embed(query);
+        const ranked = rankBySimilarity(embedding, this.candidatesFor(namespace), limit);
+        return ranked.map(({ id, similarity }) => {
+            const memory = this.cache.get(id);
+            return {
+                id,
+                label: memory.label,
+                text: memory.text,
+                meta: memory.meta,
+                ...namespaceField(memory.namespace),
+                similarity: round3(similarity),
+            };
+        });
+    }
+    /** Requires a prior sync() in the same unlock to have populated the cache. */
+    list(namespace) {
+        this.requireSession();
+        return [...this.cache.values()].filter((m) => namespace === undefined || m.namespace === namespace || m.namespace === undefined);
+    }
+    update(id, changes) {
+        return this.enqueue(async () => {
+            // Sync first: without it a cache miss (fresh unlock, or a memory this
+            // device never saw) would overwrite the server note with defaults and
+            // wipe its metadata. If the id is still missing afterwards it genuinely
+            // does not exist — never guess-write over it.
+            await this.sync();
+            const key = this.requireSession();
+            const startEpoch = this.epoch;
+            const existing = this.cache.get(id);
+            if (!existing)
+                throw new Error(`Memory ${id} not found`);
+            const label = changes.label ?? existing.label;
+            const text = changes.text ?? existing.text;
+            const meta = mergeMeta(existing.meta, changes.meta ?? {});
+            const row = await this.writeNote(key, id, label, text, meta);
+            const embedding = await this.embedder.embed(embeddingInput(label, text));
+            if (this.epoch !== startEpoch)
+                return;
+            this.cache.set(id, { ...existing, label, text, meta, embedding, updatedAt: row.updatedAt });
+            this.embeddings?.set(id, row.updatedAt, embedding);
+            await this.saveEmbeddings(key, startEpoch);
+        });
+    }
+    /** Trashes the note — recoverable from the app's Trash, never hard-deleted. */
+    delete(id) {
+        return this.enqueue(async () => {
+            const key = this.requireSession();
+            const startEpoch = this.epoch;
+            await this.api.updateNote(id, { deleted: true });
+            if (this.epoch !== startEpoch)
+                return;
+            this.cache.delete(id);
+            this.embeddings?.delete(id);
+            await this.saveEmbeddings(key, startEpoch);
+        });
+    }
+    /** Dedupe and search candidates: the named namespace plus the global root. */
+    candidatesFor(namespace) {
+        const result = [];
+        for (const memory of this.cache.values()) {
+            if (memory.namespace === namespace || memory.namespace === undefined) {
+                result.push({ id: memory.id, embedding: memory.embedding });
+            }
+        }
+        return result;
+    }
+    /** Create or update a memory note, encrypting through the note field
+     * helpers. `noteId === null` creates. */
+    async writeNote(key, noteId, label, text, meta, folderId) {
+        const body = toCodeEnvelope(serializeMemoryBody(text, meta));
+        const salt = bytesToBase64(crypto.getRandomValues(new Uint8Array(32)));
+        const { encryptedTitle, encryptedContent, iv } = await encryptNoteFields(key, label, body);
+        const write = {
+            title: '[ENCRYPTED]',
+            content: '[ENCRYPTED]',
+            encryptedTitle,
+            encryptedContent,
+            iv,
+            salt,
+            type: 'code',
+            // Mirrored so the app can filter memories by tag. The frontmatter stays
+            // the source of truth; this column follows it on every write we make.
+            tags: meta.tags ?? [],
+        };
+        if (folderId !== undefined)
+            write.folderId = folderId;
+        return noteId === null
+            ? this.api.createNote(write)
+            : this.api.updateNote(noteId, write);
+    }
+    async decryptRow(key, row) {
+        if (row.encryptedTitle && row.encryptedContent && row.iv) {
+            return decryptNoteFields(key, row.encryptedTitle, row.encryptedContent, row.iv);
+        }
+        // A legacy plaintext note the user filed under Memories by hand.
+        return { title: row.title, content: row.content };
+    }
+    async requireTree() {
+        this.tree ??= await resolveMemoryTree(this.api);
+        return this.tree;
+    }
+    async requireEmbeddings(key) {
+        this.embeddings ??= this.cacheFactory(this.vault.session.userId);
+        if (!this.embeddingsLoaded) {
+            await this.embeddings.load(key);
+            this.embeddingsLoaded = true;
+        }
+        return this.embeddings;
+    }
+    /** Persisting after a lock would write vectors the user just cleared. */
+    async saveEmbeddings(key, startEpoch) {
+        if (this.epoch !== startEpoch)
+            return;
+        await this.embeddings?.save(key);
+    }
+    requireSession() {
+        const key = this.vault.session.key;
+        this.vault.touch();
+        return key;
+    }
+    /** Serializes add/update/delete so two overlapping mutation tool calls never
+     * interleave — two concurrent near-duplicate adds must run their
+     * dedupe-check-then-write critical section one at a time, or both would miss
+     * the other's pending write and both create. */
+    enqueue(fn) {
+        const next = this.mutationChain.then(fn, fn);
+        this.mutationChain = next.catch(() => { });
+        return next;
+    }
+}
+/** The metadata is deliberately excluded: it is near-identical boilerplate
+ * across the corpus, so embedding it would raise the similarity floor
+ * everywhere and quietly change what the dedupe thresholds mean. */
+function embeddingInput(label, fact) {
+    return `${label}\n${fact}`;
+}
+/** `exactOptionalPropertyTypes` forbids assigning undefined to an optional
+ * property, so an absent namespace omits the key entirely. */
+function namespaceField(namespace) {
+    return namespace === undefined ? {} : { namespace };
+}
+//# sourceMappingURL=memories.js.map

package/dist/memories.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memories.js","sourceRoot":"","sources":["../src/memories.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,aAAa,EACb,WAAW,EACX,gBAAgB,GAEjB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAgD,MAAM,OAAO,CAAC;AAE/E,OAAO,EACL,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,cAAc,GAEf,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAmB,MAAM,eAAe,CAAC;AAGpF,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAC;AA2BnC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AAE1D,MAAM,OAAO,WAAW;IAeH;IACA;IACA;IACA;IAjBF,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;IACjD,IAAI,GAAsB,IAAI,CAAC;IAC/B,UAAU,GAA0B,IAAI,CAAC;IACzC,gBAAgB,GAAG,KAAK,CAAC;IACzB,YAAY,GAA+B,IAAI,CAAC;IAChD,aAAa,GAAqB,OAAO,CAAC,OAAO,EAAE,CAAC;IAE5D;;;sEAGkE;IAC1D,KAAK,GAAG,CAAC,CAAC;IAElB,YACmB,GAAc,EACd,KAAY,EACZ,QAAkB,EAClB,YAAgD;QAHhD,QAAG,GAAH,GAAG,CAAW;QACd,UAAK,GAAL,KAAK,CAAO;QACZ,aAAQ,GAAR,QAAQ,CAAU;QAClB,iBAAY,GAAZ,YAAY,CAAoC;QAEjE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;uEACmE;IACnE,IAAI;QACF,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;YAC/C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAEO,KAAK,CAAC,MAAM;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;QAC9B,MAAM,MAAM,GAAe,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QAE7E,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,SAAS,CAAC;gBACR,IAAI,KAAK,CAAC;gBACV,IAAI,CAAC;oBACH,KAAK,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;wBAC/B,QAAQ;wBACR,OAAO,EAAE,KAAK;wBACd,IAAI;wBACJ,KAAK,EAAE,eAAe;qBACvB,CAAC,CAAC;gBACL,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,oEAAoE;oBACpE,iEAAiE;oBACjE,IAAI,GAAG,YAAY,QAAQ,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;wBAClD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;wBACjB,MAAM;oBACR,CAAC;oBACD,MAAM,GAAG,CAAC;gBACZ,CAAC;gBAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC9B,iEAAiE;oBACjE,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI;wBAAE,SAAS;oBAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAEjB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,QAAQ,IAAI,QAAQ,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS,EAAE,CAAC;wBACrD,gEAAgE;wBAChE,IAAI,QAAQ,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;4BACnC,MAAM,KAAK,GAAiB;gCAC1B,GAAG,QAAQ;gCACX,QAAQ;gCACR,GAAG,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;6BAC9C,CAAC;4BACF,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU;gCAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;4BAC7D,MAAM,CAAC,OAAO,EAAE,CAAC;wBACnB,CAAC;wBACD,SAAS;oBACX,CAAC;oBAED,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBAC3D,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;oBAEhD,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;oBACtD,IAAI,CAAC,SAAS,EAAE,CAAC;wBACf,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;wBACnE,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,CAAC;oBAED,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU;wBAAE,SAAS;oBACxC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACjD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;wBACrB,EAAE,EAAE,GAAG,CAAC,EAAE;wBACV,KAAK,EAAE,KAAK;wBACZ,IAAI,EAAE,IAAI;wBACV,IAAI;wBACJ,QAAQ;wBACR,GAAG,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;wBAC7C,SAAS;wBACT,SAAS,EAAE,GAAG,CAAC,SAAS;qBACzB,CAAC,CAAC;oBACH,IAAI,QAAQ;wBAAE,MAAM,CAAC,OAAO,EAAE,CAAC;;wBAC1B,MAAM,CAAC,KAAK,EAAE,CAAC;gBACtB,CAAC;gBAED,IAAI,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAM;gBACtE,IAAI,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,4CAA4C;QAC5C,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YAC9B,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBACxC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACtB,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACtB,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,CAAC;YACD,MAAM,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,GAAG,CACD,KAAa,EACb,IAAY,EACZ,SAAkB,EAClB,OAAmB,EAAE;QAErB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;YAC7B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAC9B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACzE,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAEjD,MAAM,GAAG,GAAG,aAAa,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACjD,IAAI,GAAG,EAAE,CAAC;gBACR,qEAAqE;gBACrE,oEAAoE;gBACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBACzC,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC9C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBACnE,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;oBAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;wBACrB,GAAG,QAAQ;wBACX,KAAK;wBACL,IAAI;wBACJ,IAAI,EAAE,MAAM;wBACZ,SAAS;wBACT,SAAS,EAAE,GAAG,CAAC,SAAS;qBACzB,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACvD,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;gBAC7C,CAAC;gBACD,OAAO,EAAE,MAAM,EAAE,SAAkB,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACjE,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YACtC,MAAM,QAAQ,GACZ,SAAS,KAAK,SAAS;gBACrB,CAAC,CAAC,MAAM,eAAe,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC;gBAClD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAElB,MAAM,OAAO,GAAe;gBAC1B,GAAG,IAAI;gBACP,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,YAAY;gBACnC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aAClD,CAAC;YACF,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YAE5E,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;oBACrB,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,KAAK;oBACL,IAAI;oBACJ,IAAI,EAAE,OAAO;oBACb,QAAQ;oBACR,GAAG,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;oBAC7C,SAAS;oBACT,SAAS,EAAE,GAAG,CAAC,SAAS;iBACzB,CAAC,CAAC;gBACH,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YAC7C,CAAC;YAED,kEAAkE;YAClE,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;gBAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBACnC,OAAO;oBACL,EAAE;oBACF,KAAK,EAAE,MAAM,CAAC,KAAK;oBACnB,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;iBAC/B,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,OAAO,EAAE,MAAM,EAAE,QAAiB,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC;QAC5D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,CACV,KAAa,EACb,SAAkB,EAClB,KAAK,GAAG,EAAE;QAEV,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACnC,OAAO;gBACL,EAAE;gBACF,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,GAAG,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC;gBACnC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;aAC/B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,IAAI,CAAC,SAAkB;QACrB,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,CACzF,CAAC;IACJ,CAAC;IAED,MAAM,CACJ,EAAU,EACV,OAA6D;QAE7D,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;YAC7B,sEAAsE;YACtE,sEAAsE;YACtE,wEAAwE;YACxE,8CAA8C;YAC9C,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAEzD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC;YAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC;YAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;YAC1D,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC7D,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YAEzE,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;YAC5F,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACnD,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,EAAU;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAC9B,MAAM,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YACjD,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO;YACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IACtE,aAAa,CACnB,SAAkB;QAElB,MAAM,MAAM,GAAmD,EAAE,CAAC;QAClE,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACrE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;6CACyC;IACjC,KAAK,CAAC,SAAS,CACrB,GAAc,EACd,MAAqB,EACrB,KAAa,EACb,IAAY,EACZ,IAAgB,EAChB,QAAiB;QAEjB,MAAM,IAAI,GAAG,cAAc,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,EAAE,cAAc,EAAE,gBAAgB,EAAE,EAAE,EAAE,GAAG,MAAM,iBAAiB,CACtE,GAAG,EACH,KAAK,EACL,IAAI,CACL,CAAC;QACF,MAAM,KAAK,GAAc;YACvB,KAAK,EAAE,aAAa;YACpB,OAAO,EAAE,aAAa;YACtB,cAAc;YACd,gBAAgB;YAChB,EAAE;YACF,IAAI;YACJ,IAAI,EAAE,MAAM;YACZ,wEAAwE;YACxE,sEAAsE;YACtE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;SACtB,CAAC;QACF,IAAI,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACtD,OAAO,MAAM,KAAK,IAAI;YACpB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC;YAC5B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,GAAc,EACd,GAAY;QAEZ,IAAI,GAAG,CAAC,cAAc,IAAI,GAAG,CAAC,gBAAgB,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC;YACzD,OAAO,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,iEAAiE;QACjE,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;IACpD,CAAC;IAEO,KAAK,CAAC,WAAW;QACvB,IAAI,CAAC,IAAI,KAAK,MAAM,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAEO,KAAK,CAAC,iBAAiB,CAAC,GAAc;QAC5C,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,yEAAyE;IACjE,KAAK,CAAC,cAAc,CAAC,GAAc,EAAE,UAAkB;QAC7D,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU;YAAE,OAAO;QACtC,MAAM,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAEO,cAAc;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;oDAGgD;IACxC,OAAO,CAAI,EAAoB;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;oEAEoE;AACpE,SAAS,cAAc,CAAC,KAAa,EAAE,IAAY;IACjD,OAAO,GAAG,KAAK,KAAK,IAAI,EAAE,CAAC;AAC7B,CAAC;AAED;8DAC8D;AAC9D,SAAS,cAAc,CAAC,SAA6B;IACnD,OAAO,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;AACtD,CAAC"}

package/dist/memory-note.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Metadata carried in a memory note's YAML frontmatter. Every key is optional.
+ *
+ * Deliberately absent: `id`, `label`, and `namespace`. The note id, the note
+ * title, and the containing subfolder already own those, and duplicating them
+ * here would create a second source of truth that goes stale the moment the
+ * user renames or drags the note in the app.
+ */
+export interface MemoryMeta {
+    /** Which agent or tool wrote the memory. */
+    source?: string;
+    tags?: string[];
+    /** Free-form: 'high', '0.8' — stored and editable, nothing ranks on it yet. */
+    confidence?: string;
+    /** ISO timestamp of the first write; never overwritten by later updates. */
+    created?: string;
+}
+export interface ParsedMemoryNote {
+    fact: string;
+    meta: MemoryMeta;
+}
+/** The app's code editor stores content as this envelope; `code` is what the
+ * user sees and edits in Monaco. */
+export declare function toCodeEnvelope(body: string): string;
+/**
+ * Split a decrypted note body into its fact and metadata.
+ *
+ * Total by construction: a missing fence, unparseable YAML, frontmatter that
+ * is not a mapping, or a note that was never a memory note at all all yield
+ * `{ fact: <the whole body>, meta: {} }`. A human edits these by hand, so a
+ * syntax error must cost them a bit of metadata, never the memory.
+ */
+export declare function parseMemoryNote(decryptedContent: string): ParsedMemoryNote;
+/**
+ * Canonical memory body: frontmatter then the fact, or just the fact when
+ * there is no metadata to record.
+ */
+export declare function serializeMemoryBody(fact: string, meta: MemoryMeta): string;
+/**
+ * Metadata for an update: named keys win, unnamed keys carry forward, and
+ * `created` is pinned to the first write so an in-place dedupe merge cannot
+ * make an old memory look new.
+ */
+export declare function mergeMeta(existing: MemoryMeta, changes: MemoryMeta): MemoryMeta;
+//# sourceMappingURL=memory-note.d.ts.map

package/dist/memory-note.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-note.d.ts","sourceRoot":"","sources":["../src/memory-note.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,WAAW,UAAU;IACzB,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,+EAA+E;IAC/E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,4EAA4E;IAC5E,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;CAClB;AAOD;oCACoC;AACpC,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD;AAiDD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,gBAAgB,EAAE,MAAM,GAAG,gBAAgB,CAgC1E;AAUD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,MAAM,CAsB1E;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,UAAU,CAW/E"}