stellar-memory 0.5.0

package/dist/engine/multiproject.js

@@ -0,0 +1,241 @@
+/**
+ * multiproject.ts — Multi-Project Galaxy management
+ *
+ * Manages runtime project switching and cross-project knowledge sharing.
+ * Universal memories are memories marked to appear in ALL project recall results.
+ *
+ * State: currentProject is the one mutable singleton in this module.
+ *        All other functions are pure queries or side-effectful writes to the DB.
+ */
+import { getUniversalMemories, setUniversal, listProjects, upsertSunState, getSunState, getMemoriesByProject, } from '../storage/queries.js';
+import { getDatabase } from '../storage/database.js';
+import { createLogger } from '../utils/logger.js';
+import { corona } from './corona.js';
+const log = createLogger('multiproject');
+// ---------------------------------------------------------------------------
+// State
+// ---------------------------------------------------------------------------
+let currentProject = process.env['STELLAR_PROJECT'] ?? 'default';
+// ---------------------------------------------------------------------------
+// Validation
+// ---------------------------------------------------------------------------
+const PROJECT_NAME_RE = /^[a-zA-Z0-9-]{1,50}$/;
+function validateProjectName(name) {
+    if (!PROJECT_NAME_RE.test(name)) {
+        throw new Error(`Invalid project name "${name}". Must be 1-50 alphanumeric characters or hyphens.`);
+    }
+}
+// ---------------------------------------------------------------------------
+// getCurrentProject
+// ---------------------------------------------------------------------------
+/**
+ * Return the currently active project name.
+ */
+export function getCurrentProject() {
+    return currentProject;
+}
+// ---------------------------------------------------------------------------
+// switchProject
+// ---------------------------------------------------------------------------
+/**
+ * Switch the active project at runtime without restarting.
+ *
+ * Returns info about the transition so callers can report it to the user.
+ */
+export function switchProject(project) {
+    validateProjectName(project);
+    const previous = currentProject;
+    currentProject = project;
+    log.info('Switched project', { previous, current: project });
+    const db = getDatabase();
+    const row = db.prepare(`
+    SELECT COUNT(*) as count FROM memories
+    WHERE project = ? AND deleted_at IS NULL
+  `).get(project);
+    const memoryCount = row?.count ?? 0;
+    // Reload the corona cache for the new project.
+    corona.switchProject(project);
+    return { previous, current: project, memoryCount };
+}
+// ---------------------------------------------------------------------------
+// createProject
+// ---------------------------------------------------------------------------
+/**
+ * Create a new project by seeding a sun_state entry for it.
+ * If the project already has a sun_state, returns created=false.
+ */
+export function createProject(name) {
+    validateProjectName(name);
+    const existing = getSunState(name);
+    if (existing) {
+        log.debug('Project already exists', { project: name });
+        return { project: name, created: false };
+    }
+    upsertSunState({ project: name });
+    log.info('Created new project', { project: name });
+    return { project: name, created: true };
+}
+// ---------------------------------------------------------------------------
+// listAllProjects
+// ---------------------------------------------------------------------------
+/**
+ * List all projects with basic statistics.
+ * Always includes 'default' even if it has no memories yet.
+ */
+export function listAllProjects() {
+    const projectCounts = listProjects();
+    // Build lookup map from DB results
+    const countMap = new Map(projectCounts.map(p => [p.project, p.count]));
+    // Ensure 'default' is always in the list
+    if (!countMap.has('default')) {
+        countMap.set('default', 0);
+    }
+    const db = getDatabase();
+    return [...countMap.entries()].map(([project, memoryCount]) => {
+        // Get last updated timestamp for this project
+        const lastRow = db.prepare(`
+      SELECT MAX(updated_at) as last_updated FROM memories
+      WHERE project = ? AND deleted_at IS NULL
+    `).get(project);
+        const lastUpdated = lastRow?.last_updated ?? new Date().toISOString();
+        // Check if this project has any universal memories
+        const univRow = db.prepare(`
+      SELECT COUNT(*) as count FROM memories
+      WHERE project = ? AND is_universal = 1 AND deleted_at IS NULL
+    `).get(project);
+        const hasUniversal = (univRow?.count ?? 0) > 0;
+        return { project, memoryCount, lastUpdated, hasUniversal };
+    }).sort((a, b) => b.memoryCount - a.memoryCount);
+}
+// ---------------------------------------------------------------------------
+// markUniversal
+// ---------------------------------------------------------------------------
+/**
+ * Mark (or unmark) a memory as universal.
+ * Universal memories surface in recall results for all projects.
+ */
+export function markUniversal(memoryId, isUniversal) {
+    setUniversal(memoryId, isUniversal);
+    log.info('Updated universal flag', { memoryId, isUniversal });
+}
+// ---------------------------------------------------------------------------
+// getUniversalContext
+// ---------------------------------------------------------------------------
+/**
+ * Get universal memories relevant to a project.
+ * Filters out memories that already belong to the current project
+ * (no need to surface them twice) and sorts by importance.
+ */
+export function getUniversalContext(project, limit = 20) {
+    const universals = getUniversalMemories(limit * 2);
+    return universals
+        .filter(m => m.project !== project)
+        .sort((a, b) => b.importance - a.importance)
+        .slice(0, limit);
+}
+// ---------------------------------------------------------------------------
+// detectUniversalCandidates
+// ---------------------------------------------------------------------------
+// Words/patterns that suggest project-specific content
+const PROJECT_SPECIFIC_PATTERNS = [
+    /\b(this project|our project|this repo|this codebase)\b/i,
+    /\b(localhost|127\.0\.0\.1|:3000|:8080)\b/i,
+    /\bTODO\b/,
+];
+function looksProjectSpecific(content) {
+    return PROJECT_SPECIFIC_PATTERNS.some(re => re.test(content));
+}
+/**
+ * Detect memories that are strong candidates to become universal.
+ *
+ * Criteria:
+ *   - type = 'procedural' (behavioral rules are generally universal)
+ *   - type = 'context' with generic technical content (no project-specific terms)
+ *   - importance > 0.8 (highly important knowledge tends to be broadly applicable)
+ *   - not already marked universal
+ */
+export function detectUniversalCandidates(project) {
+    const memories = getMemoriesByProject(project);
+    return memories.filter(m => {
+        if (m.is_universal)
+            return false; // already universal
+        if (looksProjectSpecific(m.content))
+            return false;
+        if (m.type === 'procedural')
+            return true;
+        if (m.type === 'context' && !looksProjectSpecific(m.content))
+            return true;
+        if (m.importance > 0.8)
+            return true;
+        return false;
+    });
+}
+// ---------------------------------------------------------------------------
+// getProjectStats
+// ---------------------------------------------------------------------------
+/**
+ * Detailed statistics for a single project.
+ */
+export function getProjectStats(project) {
+    const db = getDatabase();
+    // Basic count
+    const countRow = db.prepare(`
+    SELECT COUNT(*) as count FROM memories
+    WHERE project = ? AND deleted_at IS NULL
+  `).get(project);
+    const memoryCount = countRow?.count ?? 0;
+    // Zone distribution
+    const zoneRows = db.prepare(`
+    SELECT
+      CASE
+        WHEN distance < 1.0  THEN 'core'
+        WHEN distance < 5.0  THEN 'near'
+        WHEN distance < 15.0 THEN 'active'
+        WHEN distance < 40.0 THEN 'archive'
+        WHEN distance < 70.0 THEN 'fading'
+        ELSE 'forgotten'
+      END as zone,
+      COUNT(*) as count
+    FROM memories
+    WHERE project = ? AND deleted_at IS NULL
+    GROUP BY zone
+  `).all(project);
+    const zoneDistribution = {};
+    for (const row of zoneRows) {
+        zoneDistribution[row.zone] = row.count;
+    }
+    // Type distribution
+    const typeRows = db.prepare(`
+    SELECT type, COUNT(*) as count
+    FROM memories
+    WHERE project = ? AND deleted_at IS NULL
+    GROUP BY type
+  `).all(project);
+    const typeDistribution = {};
+    for (const row of typeRows) {
+        typeDistribution[row.type] = row.count;
+    }
+    // Universal count
+    const univRow = db.prepare(`
+    SELECT COUNT(*) as count FROM memories
+    WHERE project = ? AND is_universal = 1 AND deleted_at IS NULL
+  `).get(project);
+    const universalCount = univRow?.count ?? 0;
+    // Date range
+    const rangeRow = db.prepare(`
+    SELECT MIN(created_at) as oldest, MAX(created_at) as newest
+    FROM memories
+    WHERE project = ? AND deleted_at IS NULL
+  `).get(project);
+    const oldestMemory = rangeRow?.oldest ?? '';
+    const newestMemory = rangeRow?.newest ?? '';
+    return {
+        memoryCount,
+        zoneDistribution,
+        typeDistribution,
+        universalCount,
+        oldestMemory,
+        newestMemory,
+    };
+}
+//# sourceMappingURL=multiproject.js.map

package/dist/engine/multiproject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"multiproject.js","sourceRoot":"","sources":["../../src/engine/multiproject.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,YAAY,EACZ,cAAc,EACd,WAAW,EACX,oBAAoB,GACrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,MAAM,GAAG,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;AAEzC,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E,IAAI,cAAc,GAAW,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,SAAS,CAAC;AAEzE,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,MAAM,eAAe,GAAG,sBAAsB,CAAC;AAE/C,SAAS,mBAAmB,CAAC,IAAY;IACvC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CACb,yBAAyB,IAAI,qDAAqD,CACnF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,iBAAiB;IAC/B,OAAO,cAAc,CAAC;AACxB,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe;IAK3C,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAE7B,MAAM,QAAQ,GAAG,cAAc,CAAC;IAChC,cAAc,GAAG,OAAO,CAAC;IAEzB,GAAG,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IAE7D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAGtB,CAAC,CAAC,GAAG,CAAC,OAAO,CAAkC,CAAC;IAEjD,MAAM,WAAW,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,CAAC;IAEpC,+CAA+C;IAC/C,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE9B,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;AACrD,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAE1B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,QAAQ,EAAE,CAAC;QACb,GAAG,CAAC,KAAK,CAAC,wBAAwB,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACvD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC3C,CAAC;IAED,cAAc,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAClC,GAAG,CAAC,IAAI,CAAC,qBAAqB,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAEnD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,eAAe;IAM7B,MAAM,aAAa,GAAG,YAAY,EAAE,CAAC;IAErC,mCAAmC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvE,yCAAyC;IACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,OAAO,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,EAAE;QAC5D,8CAA8C;QAC9C,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAG1B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAgD,CAAC;QAE/D,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAEtE,mDAAmD;QACnD,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAG1B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAkC,CAAC;QAEjD,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAE/C,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;IAC7D,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;AACnD,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,WAAoB;IAClE,YAAY,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACpC,GAAG,CAAC,IAAI,CAAC,wBAAwB,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAe,EAAE,KAAK,GAAG,EAAE;IAC7D,MAAM,UAAU,GAAG,oBAAoB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAEnD,OAAO,UAAU;SACd,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC;SAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E,uDAAuD;AACvD,MAAM,yBAAyB,GAAG;IAChC,yDAAyD;IACzD,2CAA2C;IAC3C,UAAU;CACX,CAAC;AAEF,SAAS,oBAAoB,CAAC,OAAe;IAC3C,OAAO,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAe;IACvD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAE/C,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QACzB,IAAI,CAAC,CAAC,YAAY;YAAE,OAAO,KAAK,CAAC,CAAW,oBAAoB;QAChE,IAAI,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;QAElD,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,OAAO,IAAI,CAAC;QACzC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1E,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC;QAEpC,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe;IAQ7C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,cAAc;IACd,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAG3B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAkC,CAAC;IAEjD,MAAM,WAAW,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAC;IAEzC,oBAAoB;IACpB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;GAc3B,CAAC,CAAC,GAAG,CAAC,OAAO,CAA2C,CAAC;IAE1D,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,oBAAoB;IACpB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;GAK3B,CAAC,CAAC,GAAG,CAAC,OAAO,CAA2C,CAAC;IAE1D,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,kBAAkB;IAClB,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAG1B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAkC,CAAC;IAEjD,MAAM,cAAc,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC;IAE3C,aAAa;IACb,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;GAI3B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAiE,CAAC;IAEhF,MAAM,YAAY,GAAG,QAAQ,EAAE,MAAM,IAAI,EAAE,CAAC;IAC5C,MAAM,YAAY,GAAG,QAAQ,EAAE,MAAM,IAAI,EAAE,CAAC;IAE5C,OAAO;QACL,WAAW;QACX,gBAAgB;QAChB,gBAAgB;QAChB,cAAc;QACd,YAAY;QACZ,YAAY;KACb,CAAC;AACJ,CAAC"}

package/dist/engine/observation.d.ts

@@ -0,0 +1,82 @@
+/**
+ * observation.ts — Observational Memory ("Comet")
+ *
+ * Auto-extracts knowledge from raw conversation text and stores it as
+ * structured memories. Like comets that bring material from the outer
+ * solar system, observations bring new information from conversations
+ * into the memory system.
+ *
+ * Pipeline:
+ *   observe()           → extract pattern-matched memories from a chunk
+ *   reflect()           → categorize observations (novel / reinforcing / conflicting)
+ *   processConversation → full pipeline: split → observe → reflect → store
+ *
+ * No LLM is used — all extraction is done via keyword matching and heuristics.
+ */
+import type { Memory } from './types.js';
+/**
+ * Extract meaningful key terms from text.
+ *
+ * Filters out stop words and short tokens; keeps technical terms,
+ * proper nouns (by capitalization), version numbers, and path-like strings.
+ *
+ * Returns unique terms sorted by appearance order.
+ */
+export declare function extractKeyTerms(text: string): string[];
+/**
+ * Split a conversation into chunks suitable for observation.
+ *
+ * Splits on:
+ *   - Common turn markers: "User:", "Assistant:", "Human:", "AI:", "System:"
+ *   - Double newlines (paragraph breaks)
+ *
+ * Filters out empty or very short chunks.
+ * Chunks are bounded to 100-500 words each.
+ */
+export declare function splitConversation(text: string): string[];
+/**
+ * Observe a conversation chunk and extract structured memories from it.
+ *
+ * For each sentence that matches a known pattern (decision, error, milestone,
+ * task, context), a memory is created and stored.
+ *
+ * Returns the text observations extracted and the Memory objects created.
+ */
+export declare function observe(conversationChunk: string, project: string): {
+    observations: string[];
+    memories: Memory[];
+};
+/**
+ * Reflect on a list of observations against the existing memory store.
+ *
+ * Categorizes each observation string as:
+ *   - novel       : not found in existing memories (truly new)
+ *   - reinforcing : confirms an existing memory (we boost that memory)
+ *   - conflicting : appears to contradict an existing memory
+ *
+ * Heuristics:
+ *   - If an existing memory contains most of the same key terms → reinforcing
+ *   - If an existing memory uses contradicting signals (negation patterns) → conflicting
+ *   - Otherwise → novel
+ */
+export declare function reflect(newObservations: string[], project: string): Promise<{
+    novel: string[];
+    reinforcing: string[];
+    conflicting: string[];
+}>;
+/**
+ * Process a full conversation through the observe → reflect pipeline.
+ *
+ * Steps:
+ *   1. Split conversation into chunks.
+ *   2. Run observe() on each chunk to extract memories.
+ *   3. Run reflect() on the extracted observations.
+ *   4. Boost reinforced memories.
+ *   5. Return aggregate statistics.
+ */
+export declare function processConversation(conversation: string, project: string): Promise<{
+    memoriesCreated: number;
+    memoriesReinforced: number;
+    conflictsDetected: number;
+}>;
+//# sourceMappingURL=observation.d.ts.map