@lumenflow/memory 1.0.0

package/dist/mem-summarize-core.js

@@ -0,0 +1,263 @@
+/**
+ * Memory Summarize Core (WU-1471)
+ *
+ * Rollup older memory nodes into summary nodes for compaction.
+ * Implements forgetting as first-class feature.
+ *
+ * Features:
+ * - Aggregate checkpoint/note/discovery nodes into summaries
+ * - Mark originals for cleanup after summary creation
+ * - Respect lifecycle TTL (ephemeral, session, wu, project)
+ * - Support dry-run mode for preview
+ *
+ * @see {@link tools/mem-summarize.mjs} - CLI wrapper
+ * @see {@link tools/__tests__/mem-summarize.test.mjs} - Tests
+ */
+import { loadMemory, appendNode } from './memory-store.js';
+import { generateMemId } from './mem-id.js';
+import { validateMemoryNode } from './memory-schema.js';
+import path from 'node:path';
+/**
+ * Memory directory path relative to base directory
+ */
+const MEMORY_DIR = '.beacon/memory';
+/**
+ * Node types that can be summarized
+ */
+const SUMMARIZABLE_TYPES = ['discovery', 'checkpoint', 'note', 'session'];
+/**
+ * Lifecycles that should NOT be marked for cleanup after summarization
+ * Project-level nodes persist across WUs (architectural knowledge)
+ */
+const PROTECTED_LIFECYCLES = ['project'];
+/**
+ * Filter nodes that can be summarized for a given WU.
+ *
+ * Excludes:
+ * - Nodes from different WUs
+ * - Ephemeral lifecycle nodes (already transient)
+ * - Already-summarized nodes (have summarized_into metadata)
+ * - Summary nodes themselves
+ *
+ * @param nodes - All memory nodes
+ * @param wuId - WU ID to filter by
+ * @returns Summarizable nodes
+ */
+export function filterSummarizableNodes(nodes, wuId) {
+    return nodes.filter((node) => {
+        // Must belong to the specified WU
+        if (node.wu_id !== wuId) {
+            return false;
+        }
+        // Exclude ephemeral lifecycle (already transient)
+        if (node.lifecycle === 'ephemeral') {
+            return false;
+        }
+        // Exclude already-summarized nodes
+        if (node.metadata?.summarized_into) {
+            return false;
+        }
+        // Exclude summary nodes themselves
+        if (node.type === 'summary') {
+            return false;
+        }
+        // Include all summarizable types
+        return SUMMARIZABLE_TYPES.includes(node.type);
+    });
+}
+/**
+ * Calculate compaction ratio (source nodes / summary nodes).
+ *
+ * @param sourceCount - Number of source nodes
+ * @param summaryCount - Number of summary nodes created
+ * @returns Compaction ratio (0 if invalid input)
+ */
+export function getCompactionRatio(sourceCount, summaryCount) {
+    if (sourceCount === 0 || summaryCount === 0) {
+        return 0;
+    }
+    return sourceCount / summaryCount;
+}
+/**
+ * Group nodes by type for organized summary content.
+ *
+ * @param nodes - Nodes to group
+ * @returns Nodes grouped by type
+ */
+function groupNodesByType(nodes) {
+    const groups = new Map();
+    for (const node of nodes) {
+        if (!groups.has(node.type)) {
+            groups.set(node.type, []);
+        }
+        const typeGroup = groups.get(node.type);
+        if (typeGroup) {
+            typeGroup.push(node);
+        }
+    }
+    return groups;
+}
+/**
+ * Generate aggregated summary content from source nodes.
+ *
+ * Organizes content by node type with clear sections.
+ *
+ * @param nodes - Source nodes to aggregate
+ * @param wuId - WU ID for the summary
+ * @returns Aggregated content
+ */
+function generateSummaryContent(nodes, wuId) {
+    const groups = groupNodesByType(nodes);
+    const sections = [];
+    sections.push(`# Summary for ${wuId}`);
+    sections.push(`Aggregated from ${nodes.length} node(s)`);
+    // Process each type in order
+    const typeOrder = ['discovery', 'checkpoint', 'note', 'session'];
+    for (const type of typeOrder) {
+        const typeNodes = groups.get(type);
+        if (!typeNodes || typeNodes.length === 0) {
+            continue;
+        }
+        sections.push(`## ${type.charAt(0).toUpperCase() + type.slice(1)}(s)`);
+        for (const node of typeNodes) {
+            // Bullet point with content, truncated if very long
+            const content = node.content.length > 200 ? `${node.content.slice(0, 197)}...` : node.content;
+            sections.push(`- ${content}`);
+        }
+    }
+    return sections.join('\n');
+}
+/**
+ * Filter nodes that should be marked for cleanup.
+ *
+ * Project-lifecycle nodes are protected from cleanup as they
+ * contain architectural knowledge that should persist.
+ *
+ * @param nodes - Source nodes
+ * @returns Nodes to mark for cleanup
+ */
+function filterNodesForCleanup(nodes) {
+    return nodes.filter((node) => !PROTECTED_LIFECYCLES.includes(node.lifecycle));
+}
+/**
+ * Create a summary node from source nodes.
+ *
+ * @param sourceNodes - Source nodes to summarize
+ * @param wuId - WU ID for the summary
+ * @returns Summary node (not yet persisted)
+ */
+function createSummaryNode(sourceNodes, wuId) {
+    const timestamp = new Date().toISOString();
+    const content = generateSummaryContent(sourceNodes, wuId);
+    const id = generateMemId(`summary-${wuId}-${timestamp}`);
+    const summary = {
+        id,
+        type: 'summary',
+        lifecycle: 'project', // Summaries persist across WUs
+        content,
+        created_at: timestamp,
+        wu_id: wuId,
+        metadata: {
+            source_nodes: sourceNodes.map((n) => n.id),
+            source_count: sourceNodes.length,
+            summarized_at: timestamp,
+        },
+    };
+    // Validate the summary node
+    const validation = validateMemoryNode(summary);
+    if (!validation.success) {
+        const issues = validation.error.issues
+            .map((i) => `${i.path.join('.')}: ${i.message}`)
+            .join(', ');
+        throw new Error(`Summary node validation failed: ${issues}`);
+    }
+    return summary;
+}
+/**
+ * Create cleanup marker nodes for original nodes.
+ *
+ * Adds summarized_into metadata to mark nodes as incorporated
+ * into a summary, making them eligible for cleanup.
+ *
+ * @param nodes - Nodes to mark
+ * @param summaryId - ID of the summary node
+ * @returns Updated nodes with cleanup markers
+ */
+function createCleanupMarkers(nodes, summaryId) {
+    const timestamp = new Date().toISOString();
+    return nodes.map((node) => ({
+        ...node,
+        updated_at: timestamp,
+        metadata: {
+            ...node.metadata,
+            summarized_into: summaryId,
+            summarized_at: timestamp,
+        },
+    }));
+}
+/**
+ * Summarize memory nodes for a closed WU.
+ *
+ * Aggregates checkpoint, note, and discovery nodes into a single
+ * summary node. Original nodes are marked for cleanup (unless
+ * they have project lifecycle).
+ *
+ * @param baseDir - Base directory containing .beacon/memory/
+ * @param options - Summarization options
+ * @returns Result with summary and cleanup info
+ * @throws If no summarizable nodes found for WU
+ *
+ * @example
+ * // Summarize nodes for a completed WU
+ * const result = await summarizeWu(baseDir, { wuId: 'WU-1234' });
+ * console.log(`Created summary ${result.summary.id}`);
+ * console.log(`Compaction ratio: ${result.compactionRatio}:1`);
+ *
+ * @example
+ * // Preview without modifications
+ * const preview = await summarizeWu(baseDir, {
+ *   wuId: 'WU-1234',
+ *   dryRun: true,
+ * });
+ */
+export async function summarizeWu(baseDir, options) {
+    const { wuId, dryRun = false } = options;
+    const memoryDir = path.join(baseDir, MEMORY_DIR);
+    // Load existing memory
+    const memory = await loadMemory(memoryDir);
+    // Filter summarizable nodes
+    const summarizable = filterSummarizableNodes(memory.nodes, wuId);
+    if (summarizable.length === 0) {
+        throw new Error(`No summarizable nodes found for ${wuId}`);
+    }
+    // Create summary node
+    const summary = createSummaryNode(summarizable, wuId);
+    // Determine which nodes to mark for cleanup
+    const cleanupNodes = filterNodesForCleanup(summarizable);
+    const markedForCleanup = cleanupNodes.map((n) => n.id);
+    // Calculate compaction ratio
+    const compactionRatio = getCompactionRatio(summarizable.length, 1);
+    // If dry-run, return preview without modifications
+    if (dryRun) {
+        return {
+            success: true,
+            summary,
+            markedForCleanup,
+            dryRun: true,
+            compactionRatio,
+        };
+    }
+    // Persist summary node - cast is safe as summary conforms to MemoryNode schema
+    await appendNode(memoryDir, summary);
+    // Mark original nodes for cleanup
+    const cleanupMarkers = createCleanupMarkers(cleanupNodes, summary.id);
+    for (const marker of cleanupMarkers) {
+        await appendNode(memoryDir, marker);
+    }
+    return {
+        success: true,
+        summary,
+        markedForCleanup,
+        compactionRatio,
+    };
+}

package/dist/mem-summarize-core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mem-summarize-core.js","sourceRoot":"","sources":["../src/mem-summarize-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B;;GAEG;AACH,MAAM,UAAU,GAAG,gBAAgB,CAAC;AAEpC;;GAEG;AACH,MAAM,kBAAkB,GAAG,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;AAE1E;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAAC,SAAS,CAAC,CAAC;AAEzC;;GAEG;AAEH;;;;GAIG;AAEH;;;;;;;GAOG;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAK,EAAE,IAAI;IACjD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3B,kCAAkC;QAClC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,kDAAkD;QAClD,IAAI,IAAI,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mCAAmC;QACnC,IAAI,IAAI,CAAC,QAAQ,EAAE,eAAe,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mCAAmC;QACnC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,iCAAiC;QACjC,OAAO,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,WAAW,EAAE,YAAY;IAC1D,IAAI,WAAW,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,WAAW,GAAG,YAAY,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,KAAK;IAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,sBAAsB,CAAC,KAAK,EAAE,IAAI;IACzC,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,EAAE,CAAC;IAEpB,QAAQ,CAAC,IAAI,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC;IACvC,QAAQ,CAAC,IAAI,CAAC,mBAAmB,KAAK,CAAC,MAAM,UAAU,CAAC,CAAC;IAEzD,6BAA6B;IAC7B,MAAM,SAAS,GAAG,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAEjE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEvE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,oDAAoD;YACpD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YAC9F,QAAQ,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CAAC,KAAK;IAClC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,WAAW,EAAE,IAAI;IAC1C,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,MAAM,OAAO,GAAG,sBAAsB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,EAAE,GAAG,aAAa,CAAC,WAAW,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC;IAEzD,MAAM,OAAO,GAAG;QACd,EAAE;QACF,IAAI,EAAE,SAAS;QACf,SAAS,EAAE,SAAS,EAAE,+BAA+B;QACrD,OAAO;QACP,UAAU,EAAE,SAAS;QACrB,KAAK,EAAE,IAAI;QACX,QAAQ,EAAE;YACR,YAAY,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,YAAY,EAAE,WAAW,CAAC,MAAM;YAChC,aAAa,EAAE,SAAS;SACzB;KACF,CAAC;IAEF,4BAA4B;IAC5B,MAAM,UAAU,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC/C,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM;aACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;aAC/C,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,mCAAmC,MAAM,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,oBAAoB,CAAC,KAAK,EAAE,SAAS;IAC5C,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE3C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC1B,GAAG,IAAI;QACP,UAAU,EAAE,SAAS;QACrB,QAAQ,EAAE;YACR,GAAG,IAAI,CAAC,QAAQ;YAChB,eAAe,EAAE,SAAS;YAC1B,aAAa,EAAE,SAAS;SACzB;KACF,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,OAAO,EAAE,OAAO;IAChD,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,OAAO,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAEjD,uBAAuB;IACvB,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,SAAS,CAAC,CAAC;IAE3C,4BAA4B;IAC5B,MAAM,YAAY,GAAG,uBAAuB,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAEjE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED,sBAAsB;IACtB,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAEtD,4CAA4C;IAC5C,MAAM,YAAY,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAAC;IACzD,MAAM,gBAAgB,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEvD,6BAA6B;IAC7B,MAAM,eAAe,GAAG,kBAAkB,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEnE,mDAAmD;IACnD,IAAI,MAAM,EAAE,CAAC;QACX,OAAO;YACL,OAAO,EAAE,IAAI;YACb,OAAO;YACP,gBAAgB;YAChB,MAAM,EAAE,IAAI;YACZ,eAAe;SAChB,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,MAAM,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAErC,kCAAkC;IAClC,MAAM,cAAc,GAAG,oBAAoB,CAAC,YAAY,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACtE,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI;QACb,OAAO;QACP,gBAAgB;QAChB,eAAe;KAChB,CAAC;AACJ,CAAC"}

package/dist/mem-triage-core.d.ts

@@ -0,0 +1,127 @@
+/**
+ * Memory Triage Core (WU-1470)
+ *
+ * Review discovery nodes and promote to WUs or archive.
+ *
+ * Features:
+ * - List open discovery nodes with deterministic ordering
+ * - Promote discovery to WU (integrates with wu:create)
+ * - Archive discovery without promotion
+ *
+ * @see {@link tools/mem-triage.mjs} - CLI wrapper
+ * @see {@link tools/__tests__/mem-triage.test.mjs} - Tests
+ */
+/**
+ * Memory node structure for triage operations
+ */
+interface TriageMemoryNode {
+    id: string;
+    type: string;
+    lifecycle: string;
+    content: string;
+    created_at: string;
+    updated_at?: string;
+    wu_id?: string;
+    session_id?: string;
+    metadata?: Record<string, unknown>;
+    tags?: string[];
+}
+/**
+ * Options for listing discoveries
+ */
+export interface ListOptions {
+    /** Filter by WU ID (or 'unlinked' for nodes without wu_id) */
+    wuId?: string;
+    /** Filter by tag */
+    tag?: string;
+}
+/**
+ * List open discovery nodes.
+ *
+ * Returns unblocked, non-archived discovery nodes in deterministic order.
+ *
+ * @param baseDir - Base directory
+ * @param options - Filter options
+ * @returns Open discovery nodes
+ */
+export declare function listOpenDiscoveries(baseDir: string, options?: ListOptions): Promise<TriageMemoryNode[]>;
+/**
+ * Options for archiving a discovery
+ */
+export interface ArchiveOptions {
+    /** Node ID to archive */
+    nodeId: string;
+    /** Archive reason */
+    reason: string;
+}
+/**
+ * Result of archiving a discovery
+ */
+export interface ArchiveResult {
+    /** Whether archiving succeeded */
+    success: boolean;
+    /** Archived node ID */
+    nodeId: string;
+}
+/**
+ * Archive a discovery node without promotion.
+ *
+ * Sets metadata.status to 'archived' and records the reason.
+ *
+ * @param baseDir - Base directory
+ * @param options - Archive options
+ * @returns Archive result
+ * @throws If node not found, not a discovery, or already archived
+ */
+export declare function archiveDiscovery(baseDir: string, options: ArchiveOptions): Promise<ArchiveResult>;
+/**
+ * Options for promoting a discovery to a WU
+ */
+export interface PromoteOptions {
+    /** Node ID to promote */
+    nodeId: string;
+    /** WU lane */
+    lane: string;
+    /** Custom WU title (defaults to discovery content) */
+    title?: string;
+    /** Explicit WU ID (defaults to next available) */
+    wuId?: string;
+    /** Priority override */
+    priority?: string;
+    /** If true, return spec without creating WU */
+    dryRun?: boolean;
+}
+/**
+ * WU specification generated from promotion
+ */
+export interface WUSpec {
+    /** WU ID */
+    id: string;
+    /** WU title */
+    title: string;
+    /** WU lane */
+    lane: string;
+    /** WU priority */
+    priority: string;
+    /** WU notes with provenance */
+    notes: string;
+}
+/**
+ * Result of promoting a discovery
+ */
+export interface PromoteResult {
+    /** Whether promotion succeeded */
+    success: boolean;
+    /** Generated WU specification */
+    wuSpec: WUSpec;
+}
+/**
+ * Promote a discovery node to a WU.
+ *
+ * @param baseDir - Base directory
+ * @param options - Promote options
+ * @returns Promotion result
+ * @throws If node not found, not a discovery, or already closed
+ */
+export declare function promoteDiscovery(baseDir: string, options: PromoteOptions): Promise<PromoteResult>;
+export {};

package/dist/mem-triage-core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mem-triage-core.d.ts","sourceRoot":"","sources":["../src/mem-triage-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA6KH;;;;GAIG;AAEH;;;;;;;;GAQG;AACH,wBAAsB,mBAAmB,CAAC,OAAO,KAAA,EAAE,OAAO,KAAK,kBAgC9D;AAED;;;;GAIG;AAEH;;;;GAIG;AAEH;;;;;;;;;GASG;AACH,wBAAsB,gBAAgB,CAAC,OAAO,KAAA,EAAE,OAAO,KAAA;;;GAsCtD;AAwED;;;;;;;GAOG;AACH,wBAAsB,gBAAgB,CAAC,OAAO,KAAA,EAAE,OAAO,KAAA;;;;;;;;;GA2CtD"}