@batalabs/virlow-mcp-core 3.19.0 → 3.68.0

package/dist/memory-graph.d.ts

@@ -0,0 +1,106 @@
+import type { MemoryMeta, MemoryRelation } from './memory-note.js';
+/**
+ * The memory graph, built from memories rather than stored beside them.
+ *
+ * A memory's frontmatter names the entities it is about (`about`) and the
+ * relations it asserts (`relations`). This module turns a set of memories
+ * into entities and edges, answers "is this still true" for a date, and
+ * ranks recall with the graph and recency as well as similarity. Pure: no
+ * network, no crypto, so every rule here is tested directly.
+ *
+ * Entities are names. Two mentions are the same entity when their names
+ * match ignoring case, spacing and a leading "the"; anything looser (Dana
+ * and Dana Whitfield) is a merge the AI or the person asks for, never a
+ * guess. See docs/memory-graph.md.
+ */
+export interface GraphMemory {
+    id: string;
+    label: string;
+    text: string;
+    meta: MemoryMeta;
+    namespace?: string;
+    updatedAt: string;
+}
+export interface Edge extends MemoryRelation {
+    /** The memory that asserted it. */
+    memoryId: string;
+}
+export interface Entity {
+    key: string;
+    /** The spelling most memories use. */
+    name: string;
+    memoryIds: Set<string>;
+    edges: Edge[];
+}
+export interface MemoryGraph {
+    entities: Map<string, Entity>;
+    edges: Edge[];
+}
+/** The matching key for a name: case, spacing and a leading article do not
+ *  make a different entity. */
+export declare function entityKey(name: string): string;
+/**
+ * Predicates where one side holds one value at a time, so a new fact ends
+ * the old one. Which side matters:
+ * - one object per subject: a person works at one place, reports to one
+ *   manager (Dana works_at Acme, then Dana works_at Initech);
+ * - one subject per object: a project has one lead (Dana leads Atlas, then
+ *   Sam leads Atlas).
+ * Anything else accumulates (prefers, uses, knows).
+ */
+export declare const ONE_OBJECT_PER_SUBJECT: Set<string>;
+export declare const ONE_SUBJECT_PER_OBJECT: Set<string>;
+/** Either kind: a predicate that holds one value at a time. */
+export declare const SINGLE_VALUED: Set<string>;
+/** snake_case, so "Works at" and "works_at" are one predicate. */
+export declare function normalizePredicate(p: string): string;
+/** Whether a span held at `at`: started on or before it, ended after it. */
+export declare function heldAt(from: string | undefined, to: string | undefined, at: number): boolean;
+/**
+ * Whether a memory's fact held at `at`. It starts at `valid_from`, else the
+ * earliest date its relations give (a fact about "since January" learned
+ * today started in January), else when it was learned.
+ */
+export declare function memoryHeldAt(memory: GraphMemory, at: number): boolean;
+export declare function buildGraph(memories: Iterable<GraphMemory>): MemoryGraph;
+/** Entities named in a piece of text (a prompt, a query), longest names
+ *  first so "Dana Whitfield" wins over "Dana". Whole words only. */
+export declare function entitiesMentioned(graph: MemoryGraph, text: string): Entity[];
+/** Entities one relation away from any of `from`. */
+export declare function neighbours(graph: MemoryGraph, from: Entity[]): Entity[];
+export interface RankInput {
+    memory: GraphMemory;
+    similarity: number;
+}
+/** How much the graph and recency move a similarity score. Small on
+ *  purpose: similarity still decides, the graph breaks ties and pulls in
+ *  facts that share an entity with the query but none of its words. */
+export declare const DIRECT_BOOST = 0.15;
+export declare const NEIGHBOUR_BOOST = 0.07;
+export declare function rankMemories(graph: MemoryGraph, query: string, scored: RankInput[], opts: {
+    at?: number;
+    includeHistory?: boolean;
+    limit: number;
+}): Array<RankInput & {
+    score: number;
+}>;
+/**
+ * Current edges a new relation replaces: same subject and single-valued
+ * predicate, a different object, still holding when the new one starts.
+ */
+export declare function supersededBy(graph: MemoryGraph, relation: MemoryRelation, at: number): Edge[];
+/**
+ * Housekeeping findings for a tidy pass: memories linked to nothing, names
+ * that look like one entity spelled two ways, and single-valued predicates
+ * holding two values at once.
+ */
+export declare function graphHealth(graph: MemoryGraph, memories: GraphMemory[], at?: number): {
+    unlinked: string[];
+    possibleDuplicates: [string, string][];
+    contradictions: {
+        subject: string;
+        predicate: string;
+        objects: string[];
+    }[];
+};
+//# sourceMappingURL=memory-graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.d.ts","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAEnE;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,WAAW;IAC1B,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,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,IAAK,SAAQ,cAAc;IAC1C,mCAAmC;IACnC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,MAAM;IACrB,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED;+BAC+B;AAC/B,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAM9C;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,sBAAsB,aAYjC,CAAC;AACH,eAAO,MAAM,sBAAsB,aAAwC,CAAC;AAE5E,+DAA+D;AAC/D,eAAO,MAAM,aAAa,aAAkE,CAAC;AAE7F,kEAAkE;AAClE,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAMpD;AAUD,4EAA4E;AAC5E,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,EAAE,EAAE,EAAE,MAAM,GAAG,SAAS,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAM5F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAOrE;AAED,wBAAgB,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,WAAW,CAuCvE;AAQD;oEACoE;AACpE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAkB5E;AAED,qDAAqD;AACrD,wBAAgB,UAAU,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAgBvE;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,WAAW,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;uEAEuE;AACvE,eAAO,MAAM,YAAY,OAAO,CAAC;AACjC,eAAO,MAAM,eAAe,OAAO,CAAC;AAIpC,wBAAgB,YAAY,CAC1B,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,SAAS,EAAE,EACnB,IAAI,EAAE;IAAE,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC7D,KAAK,CAAC,SAAS,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAsBtC;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,CAc7F;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE,EAAE,SAAa;;;;iBAmB/C,MAAM;mBAAa,MAAM;iBAAW,MAAM,EAAE;;EAsBpF"}

package/dist/memory-graph.js

@@ -0,0 +1,258 @@
+/** The matching key for a name: case, spacing and a leading article do not
+ *  make a different entity. */
+export function entityKey(name) {
+    return name
+        .trim()
+        .toLowerCase()
+        .replace(/\s+/g, ' ')
+        .replace(/^the /, '');
+}
+/**
+ * Predicates where one side holds one value at a time, so a new fact ends
+ * the old one. Which side matters:
+ * - one object per subject: a person works at one place, reports to one
+ *   manager (Dana works_at Acme, then Dana works_at Initech);
+ * - one subject per object: a project has one lead (Dana leads Atlas, then
+ *   Sam leads Atlas).
+ * Anything else accumulates (prefers, uses, knows).
+ */
+export const ONE_OBJECT_PER_SUBJECT = new Set([
+    'led_by',
+    'owned_by',
+    'managed_by',
+    'reports_to',
+    'works_at',
+    'lives_in',
+    'based_in',
+    'located_in',
+    'role',
+    'status',
+    'title',
+]);
+export const ONE_SUBJECT_PER_OBJECT = new Set(['leads', 'owns', 'manages']);
+/** Either kind: a predicate that holds one value at a time. */
+export const SINGLE_VALUED = new Set([...ONE_OBJECT_PER_SUBJECT, ...ONE_SUBJECT_PER_OBJECT]);
+/** snake_case, so "Works at" and "works_at" are one predicate. */
+export function normalizePredicate(p) {
+    return p
+        .trim()
+        .toLowerCase()
+        .replace(/[\s-]+/g, '_')
+        .replace(/[^a-z0-9_]/g, '');
+}
+/** A date or ISO timestamp as comparable milliseconds; bare dates are the
+ *  start of that UTC day. */
+function when(value) {
+    if (!value)
+        return null;
+    const t = Date.parse(value.length === 10 ? `${value}T00:00:00Z` : value);
+    return Number.isNaN(t) ? null : t;
+}
+/** Whether a span held at `at`: started on or before it, ended after it. */
+export function heldAt(from, to, at) {
+    const start = when(from);
+    const end = when(to);
+    if (start !== null && start > at)
+        return false;
+    if (end !== null && end <= at)
+        return false;
+    return true;
+}
+/**
+ * Whether a memory's fact held at `at`. It starts at `valid_from`, else the
+ * earliest date its relations give (a fact about "since January" learned
+ * today started in January), else when it was learned.
+ */
+export function memoryHeldAt(memory, at) {
+    const relationStarts = (memory.meta.relations ?? [])
+        .map((r) => r.from)
+        .filter((f) => !!f && when(f) !== null)
+        .sort((a, b) => when(a) - when(b));
+    const start = memory.meta.validFrom ?? relationStarts[0] ?? memory.meta.created;
+    return heldAt(start, memory.meta.validTo, at);
+}
+export function buildGraph(memories) {
+    const entities = new Map();
+    const spellings = new Map();
+    const edges = [];
+    const touch = (name, memoryId) => {
+        const key = entityKey(name);
+        let entity = entities.get(key);
+        if (!entity) {
+            entity = { key, name: name.trim(), memoryIds: new Set(), edges: [] };
+            entities.set(key, entity);
+            spellings.set(key, new Map());
+        }
+        entity.memoryIds.add(memoryId);
+        const counts = spellings.get(key);
+        counts.set(name.trim(), (counts.get(name.trim()) ?? 0) + 1);
+        return entity;
+    };
+    for (const memory of memories) {
+        for (const name of memory.meta.about ?? [])
+            touch(name, memory.id);
+        for (const relation of memory.meta.relations ?? []) {
+            const edge = { ...relation, p: normalizePredicate(relation.p), memoryId: memory.id };
+            edges.push(edge);
+            touch(relation.s, memory.id).edges.push(edge);
+            // The object is an entity only if something else names it as one;
+            // "async standups" as the object of prefers stays a literal.
+            const objectKey = entityKey(relation.o);
+            if (entities.has(objectKey) || isEntityLike(relation.o)) {
+                touch(relation.o, memory.id).edges.push(edge);
+            }
+        }
+    }
+    for (const [key, counts] of spellings) {
+        const [best] = [...counts.entries()].sort((a, b) => b[1] - a[1]);
+        if (best)
+            entities.get(key).name = best[0];
+    }
+    return { entities, edges };
+}
+/** A capitalised name reads as an entity (Atlas, Dana Whitfield, Fly.io);
+ *  a lower-case phrase reads as a value (async standups, dark mode). */
+function isEntityLike(value) {
+    return /^[A-Z0-9]/.test(value.trim());
+}
+/** Entities named in a piece of text (a prompt, a query), longest names
+ *  first so "Dana Whitfield" wins over "Dana". Whole words only. */
+export function entitiesMentioned(graph, text) {
+    // Dots survive only inside a name (Fly.io); a full stop after a word
+    // would otherwise hide the word.
+    const haystack = ` ${text
+        .toLowerCase()
+        .replace(/[^a-z0-9.\s]/g, ' ')
+        .replace(/\.(?![a-z0-9])|(?<![a-z0-9])\./g, ' ')
+        .replace(/\s+/g, ' ')} `;
+    const found = [];
+    const byLength = [...graph.entities.values()].sort((a, b) => b.key.length - a.key.length);
+    let remaining = haystack;
+    for (const entity of byLength) {
+        const needle = ` ${entity.key} `;
+        if (entity.key.length < 2 || !remaining.includes(needle))
+            continue;
+        found.push(entity);
+        remaining = remaining.split(needle).join(' ');
+    }
+    return found;
+}
+/** Entities one relation away from any of `from`. */
+export function neighbours(graph, from) {
+    const seen = new Set(from.map((e) => e.key));
+    const result = [];
+    for (const entity of from) {
+        for (const edge of entity.edges) {
+            for (const end of [edge.s, edge.o]) {
+                const key = entityKey(end);
+                const other = graph.entities.get(key);
+                if (other && !seen.has(key)) {
+                    seen.add(key);
+                    result.push(other);
+                }
+            }
+        }
+    }
+    return result;
+}
+/** How much the graph and recency move a similarity score. Small on
+ *  purpose: similarity still decides, the graph breaks ties and pulls in
+ *  facts that share an entity with the query but none of its words. */
+export const DIRECT_BOOST = 0.15;
+export const NEIGHBOUR_BOOST = 0.07;
+const RECENCY_WEIGHT = 0.08;
+const RECENCY_HORIZON_DAYS = 365;
+export function rankMemories(graph, query, scored, opts) {
+    const at = opts.at ?? Date.now();
+    const direct = entitiesMentioned(graph, query);
+    const near = neighbours(graph, direct);
+    const directIds = new Set(direct.flatMap((e) => [...e.memoryIds]));
+    const nearIds = new Set(near.flatMap((e) => [...e.memoryIds]));
+    return scored
+        .filter(({ memory }) => opts.includeHistory || memoryHeldAt(memory, at))
+        .map((item) => {
+        let score = item.similarity;
+        if (directIds.has(item.memory.id))
+            score += DIRECT_BOOST;
+        else if (nearIds.has(item.memory.id))
+            score += NEIGHBOUR_BOOST;
+        const updated = Date.parse(item.memory.updatedAt);
+        if (!Number.isNaN(updated)) {
+            const ageDays = Math.max(0, (at - updated) / 86_400_000);
+            score -= RECENCY_WEIGHT * Math.min(1, ageDays / RECENCY_HORIZON_DAYS);
+        }
+        return { ...item, score };
+    })
+        .sort((a, b) => b.score - a.score)
+        .slice(0, opts.limit);
+}
+/**
+ * Current edges a new relation replaces: same subject and single-valued
+ * predicate, a different object, still holding when the new one starts.
+ */
+export function supersededBy(graph, relation, at) {
+    const p = normalizePredicate(relation.p);
+    const s = entityKey(relation.s);
+    const o = entityKey(relation.o);
+    const bySubject = ONE_OBJECT_PER_SUBJECT.has(p);
+    const byObject = ONE_SUBJECT_PER_OBJECT.has(p);
+    if (!bySubject && !byObject)
+        return [];
+    return graph.edges.filter((edge) => {
+        if (edge.p !== p || !heldAt(edge.from, edge.to, at))
+            return false;
+        const es = entityKey(edge.s);
+        const eo = entityKey(edge.o);
+        if (es === s && eo === o)
+            return false;
+        return bySubject ? es === s : eo === o;
+    });
+}
+/**
+ * Housekeeping findings for a tidy pass: memories linked to nothing, names
+ * that look like one entity spelled two ways, and single-valued predicates
+ * holding two values at once.
+ */
+export function graphHealth(graph, memories, at = Date.now()) {
+    const unlinked = memories
+        .filter((m) => !(m.meta.about?.length || m.meta.relations?.length))
+        .map((m) => m.id);
+    const names = [...graph.entities.values()];
+    const possibleDuplicates = [];
+    for (let i = 0; i < names.length; i++) {
+        for (let j = i + 1; j < names.length; j++) {
+            const a = names[i].key;
+            const b = names[j].key;
+            const [short, long] = a.length <= b.length ? [a, b] : [b, a];
+            // "dana" and "dana whitfield": one name is the first word(s) of the other.
+            if (short.length >= 3 && long.startsWith(`${short} `)) {
+                possibleDuplicates.push([names[i].name, names[j].name]);
+            }
+        }
+    }
+    const contradictions = [];
+    // Keyed on the side that must be unique: the subject for works_at, the
+    // object for leads. `values` are the other side.
+    const current = new Map();
+    for (const edge of graph.edges) {
+        if (!SINGLE_VALUED.has(edge.p) || !heldAt(edge.from, edge.to, at))
+            continue;
+        const bySubject = ONE_OBJECT_PER_SUBJECT.has(edge.p);
+        const anchor = bySubject ? edge.s : edge.o;
+        const key = `${entityKey(anchor)}|${edge.p}`;
+        if (!current.has(key))
+            current.set(key, { anchor, predicate: edge.p, values: new Set() });
+        current.get(key).values.add(bySubject ? edge.o : edge.s);
+    }
+    for (const [key, { anchor, predicate, values }] of current) {
+        if (values.size < 2)
+            continue;
+        contradictions.push({
+            subject: graph.entities.get(key.split('|')[0])?.name ?? anchor,
+            predicate,
+            objects: [...values],
+        });
+    }
+    return { unlinked, possibleDuplicates, contradictions };
+}
+//# sourceMappingURL=memory-graph.js.map

package/dist/memory-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.js","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AA4CA;+BAC+B;AAC/B,MAAM,UAAU,SAAS,CAAC,IAAY;IACpC,OAAO,IAAI;SACR,IAAI,EAAE;SACN,WAAW,EAAE;SACb,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC;IAC5C,QAAQ;IACR,UAAU;IACV,YAAY;IACZ,YAAY;IACZ,UAAU;IACV,UAAU;IACV,UAAU;IACV,YAAY;IACZ,MAAM;IACN,QAAQ;IACR,OAAO;CACR,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;AAE5E,+DAA+D;AAC/D,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,sBAAsB,EAAE,GAAG,sBAAsB,CAAC,CAAC,CAAC;AAE7F,kEAAkE;AAClE,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC1C,OAAO,CAAC;SACL,IAAI,EAAE;SACN,WAAW,EAAE;SACb,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC;SACvB,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;AAChC,CAAC;AAED;6BAC6B;AAC7B,SAAS,IAAI,CAAC,KAAyB;IACrC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,MAAM,CAAC,IAAwB,EAAE,EAAsB,EAAE,EAAU;IACjF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACrB,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE;QAAE,OAAO,KAAK,CAAC;IAC5C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,MAAmB,EAAE,EAAU;IAC1D,MAAM,cAAc,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;SACjD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;SACnD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,IAAI,CAAC,CAAC,CAAY,GAAI,IAAI,CAAC,CAAC,CAAY,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IAChF,OAAO,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,QAA+B;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,QAAgB,EAAU,EAAE;QACvD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAAE,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QACnE,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAS,EAAE,GAAG,QAAQ,EAAE,CAAC,EAAE,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;YAC3F,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9C,kEAAkE;YAClE,6DAA6D;YAC7D,MAAM,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxD,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACtC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,IAAI,IAAI;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED;wEACwE;AACxE,SAAS,YAAY,CAAC,KAAa;IACjC,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;AACxC,CAAC;AAED;oEACoE;AACpE,MAAM,UAAU,iBAAiB,CAAC,KAAkB,EAAE,IAAY;IAChE,qEAAqE;IACrE,iCAAiC;IACjC,MAAM,QAAQ,GAAG,IAAI,IAAI;SACtB,WAAW,EAAE;SACb,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;SAC7B,OAAO,CAAC,iCAAiC,EAAE,GAAG,CAAC;SAC/C,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;IAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1F,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC;QACjC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAS;QACnE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,UAAU,CAAC,KAAkB,EAAE,IAAc;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACtC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAOD;;uEAEuE;AACvE,MAAM,CAAC,MAAM,YAAY,GAAG,IAAI,CAAC;AACjC,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAC;AACpC,MAAM,cAAc,GAAG,IAAI,CAAC;AAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAEjC,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,KAAa,EACb,MAAmB,EACnB,IAA8D;IAE9D,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAE/D,OAAO,MAAM;SACV,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;SACvE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAAE,KAAK,IAAI,YAAY,CAAC;aACpD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAAE,KAAK,IAAI,eAAe,CAAC;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC;YACzD,KAAK,IAAI,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,oBAAoB,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC;IAC5B,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,QAAwB,EAAE,EAAU;IACnF,MAAM,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,CAAC,SAAS,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACvC,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACjC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAClE,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACvC,OAAO,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAkB,EAAE,QAAuB,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE;IACtF,MAAM,QAAQ,GAAG,QAAQ;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;SAClE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEpB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,MAAM,kBAAkB,GAA4B,EAAE,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC;YACxB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC;YACxB,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,2EAA2E;YAC3E,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;gBACtD,kBAAkB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAqE,EAAE,CAAC;IAC5F,uEAAuE;IACvE,iDAAiD;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsE,CAAC;IAC9F,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC;YAAE,SAAS;QAC5E,MAAM,SAAS,GAAG,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QAC1F,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;QAC3D,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QAC9B,cAAc,CAAC,IAAI,CAAC;YAClB,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,IAAI,IAAI,MAAM;YAC/D,SAAS;YACT,OAAO,EAAE,CAAC,GAAG,MAAM,CAAC;SACrB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,kBAAkB,EAAE,cAAc,EAAE,CAAC;AAC1D,CAAC"}

package/dist/memory-note.d.ts

@@ -14,10 +14,51 @@ export interface MemoryMeta {
     confidence?: string;
     /** ISO timestamp of the first write; never overwritten by later updates. */
     created?: string;
+    /**
+     * `html` when the fact was written in the app's rich editor, so the body
+     * after the frontmatter is TipTap HTML rather than plain text. Absent
+     * means plain text, which is what the connector always writes: AI tools
+     * read and write text, and the app renders it as paragraphs.
+     */
+    format?: 'html';
+    /**
+     * The graph: the entities this fact is about (people, projects, places,
+     * tools), by name. Names are matched case-insensitively across memories,
+     * so every memory that says "Atlas" is about the same Atlas.
+     */
+    about?: string[];
+    /** Typed links the fact asserts, e.g. Sam leads Atlas. A relation lives on
+     *  the memory that asserted it, so every edge has a source to open, check
+     *  or delete. */
+    relations?: MemoryRelation[];
+    /** When the fact became true (YYYY-MM-DD or ISO). Absent: when it was
+     *  learned (`created`). */
+    validFrom?: string;
+    /** When the fact stopped being true. Facts are ended, never deleted, when
+     *  they are superseded, so history stays answerable. */
+    validTo?: string;
+    /** The memory that replaced this one, when one did. */
+    supersededBy?: string;
+}
+/**
+ * One edge: subject, predicate, object. `p` is a short verb phrase in
+ * snake_case ("leads", "works_at", "prefers"); `o` is an entity name or a
+ * literal ("async standups"). `from` and `to` bound when it held.
+ */
+export interface MemoryRelation {
+    s: string;
+    p: string;
+    o: string;
+    from?: string;
+    to?: string;
 }
 export interface ParsedMemoryNote {
+    /** The fact as plain text: what AI tools read, what gets embedded. For an
+     *  HTML body, its text with line breaks and list markers kept. */
     fact: string;
     meta: MemoryMeta;
+    /** The body as written, when `meta.format` is `html`. */
+    html?: string;
 }
 /**
  * The note type a memory is written as.
@@ -36,6 +77,20 @@ export declare const MEMORY_NOTE_TYPE = "memory";
  * (or a test) can build a legacy body and confirm it still reads.
  */
 export declare function toCodeEnvelope(body: string): string;
+/**
+ * A rich fact as text an AI can read: one line per paragraph, heading or
+ * list item, list items marked, code and inline marks reduced to their text.
+ * Entities are decoded, so a fact that talks about `<p>` tags reads back as
+ * exactly that.
+ */
+export declare function memoryHtmlToText(html: string): string;
+/**
+ * Plain text as the rich editor's HTML: a paragraph per blank-line-separated
+ * block, single line breaks kept, everything escaped. Used to open a
+ * connector-written (plain) memory in the editor.
+ */
+export declare function memoryTextToHtml(text: string): string;
+export declare function looksLikeHtml(fact: string): boolean;
 /**
  * Split a decrypted note body into its fact and metadata.
  *
@@ -50,6 +105,8 @@ export declare function parseMemoryNote(decryptedContent: string): ParsedMemoryN
  * there is no metadata to record.
  */
 export declare function serializeMemoryBody(fact: string, meta: MemoryMeta): string;
+/** The app's rich editor output, marked as HTML. */
+export declare function serializeMemoryHtml(html: 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

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

@@ -1 +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;;;;;;;;;;GAUG;AACH,eAAO,MAAM,gBAAgB,WAAW,CAAC;AAEzC;;;GAGG;AACH,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"}
+{"version":3,"file":"memory-note.d.ts","sourceRoot":"","sources":["../src/memory-note.ts"],"names":[],"mappings":"AAGA;;;;;;;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;IACjB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB;;qBAEiB;IACjB,SAAS,CAAC,EAAE,cAAc,EAAE,CAAC;IAC7B;+BAC2B;IAC3B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;4DACwD;IACxD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,uDAAuD;IACvD,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,gBAAgB;IAC/B;sEACkE;IAClE,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;IACjB,yDAAyD;IACzD,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAqDD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,gBAAgB,WAAW,CAAC;AAEzC;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD;AAsED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAgBrD;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAMrD;AAYD,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEnD;AASD;;;;;;;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,CAO1E;AAED,oDAAoD;AACpD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,MAAM,CAE1E;AAkCD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,UAAU,CAgB/E"}