@tonycasey/lisa 1.2.0 → 2.0.0

package/dist/lib/infrastructure/services/RecursionService.d.ts

@@ -0,0 +1,50 @@
+import type { IRecursionService, IRecursionResult, IRecursionConfig, IMemoryService, ITaskService } from '../../domain';
+/**
+ * Service for searching memory when planning.
+ *
+ * When a user submits a prompt in plan mode, this service searches
+ * memory for relevant context: previous decisions, learnings, and tasks.
+ */
+export declare class RecursionService implements IRecursionService {
+    private readonly memory;
+    private readonly tasks;
+    private readonly config;
+    constructor(memory: IMemoryService, tasks: ITaskService, config?: Partial<IRecursionConfig>);
+    /**
+     * Check if recursion should run for a given prompt.
+     */
+    shouldRun(prompt: string, permissionMode: string): boolean;
+    /**
+     * Run memory recursion for a plan mode prompt.
+     */
+    run(prompt: string, groupIds: readonly string[]): Promise<IRecursionResult>;
+    /**
+     * Extract meaningful topics from a prompt.
+     */
+    private extractTopics;
+    /**
+     * Search memory for facts of a specific type.
+     */
+    private searchByType;
+    /**
+     * Search for related tasks.
+     */
+    private searchTasks;
+    /**
+     * Format a memory fact for display.
+     */
+    private formatFact;
+    /**
+     * Format a task for display.
+     */
+    private formatTask;
+    /**
+     * Get a tag value by prefix.
+     */
+    private getTag;
+    /**
+     * Build formatted summary output.
+     */
+    private buildSummary;
+}
+//# sourceMappingURL=RecursionService.d.ts.map

package/dist/lib/infrastructure/services/RecursionService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RecursionService.d.ts","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/RecursionService.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,iBAAiB,EACjB,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EACd,YAAY,EAGb,MAAM,cAAc,CAAC;AAkDtB;;;;;GAKG;AACH,qBAAa,gBAAiB,YAAW,iBAAiB;IAItD,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,KAAK;IAJxB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAmB;gBAGvB,MAAM,EAAE,cAAc,EACtB,KAAK,EAAE,YAAY,EACpC,MAAM,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC;IAKpC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,OAAO;IAmB1D;;OAEG;IACG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAqDjF;;OAEG;IACH,OAAO,CAAC,aAAa;IAuBrB;;OAEG;YACW,YAAY;IAwB1B;;OAEG;YACW,WAAW;IAuBzB;;OAEG;IACH,OAAO,CAAC,UAAU;IAKlB;;OAEG;IACH,OAAO,CAAC,UAAU;IAQlB;;OAEG;IACH,OAAO,CAAC,MAAM;IAMd;;OAEG;IACH,OAAO,CAAC,YAAY;CAwBrB"}

package/dist/lib/infrastructure/services/RecursionService.js

@@ -0,0 +1,233 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecursionService = void 0;
+/**
+ * Default configuration for recursion.
+ */
+const DEFAULT_CONFIG = {
+    minPromptLength: 20,
+    maxResultsPerType: 3,
+    queryTimeoutMs: 3000,
+};
+/**
+ * Common stop words to filter from topic extraction.
+ */
+const STOP_WORDS = new Set([
+    'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'must', 'shall', 'can', 'need', 'dare',
+    'ought', 'used', 'to', 'of', 'in', 'for', 'on', 'with', 'at', 'by',
+    'from', 'as', 'into', 'through', 'during', 'before', 'after', 'above',
+    'below', 'between', 'under', 'again', 'further', 'then', 'once',
+    'and', 'but', 'or', 'nor', 'so', 'yet', 'both', 'either', 'neither',
+    'not', 'only', 'own', 'same', 'than', 'too', 'very', 'just', 'also',
+    'now', 'here', 'there', 'when', 'where', 'why', 'how', 'all', 'each',
+    'every', 'any', 'some', 'no', 'this', 'that', 'these', 'those',
+    'what', 'which', 'who', 'whom', 'its', 'it', 'i', 'me', 'my', 'myself',
+    'we', 'our', 'ours', 'ourselves', 'you', 'your', 'yours', 'yourself',
+    'yourselves', 'he', 'him', 'his', 'himself', 'she', 'her', 'hers',
+    'herself', 'they', 'them', 'their', 'theirs', 'themselves',
+    'want', 'like', 'add', 'create', 'make', 'build', 'implement', 'write',
+    'update', 'change', 'modify', 'remove', 'delete', 'fix', 'help', 'please',
+    'using', 'use',
+]);
+/**
+ * Technical patterns that should be prioritized in topic extraction.
+ */
+const TECH_PATTERNS = /^(api|db|cache|auth|config|service|handler|controller|model|schema|test|hook|event|memory|task|session)$/i;
+/**
+ * Empty result constant.
+ */
+const EMPTY_RESULT = {
+    hasContext: false,
+    decisions: [],
+    learnings: [],
+    relatedTasks: [],
+    summary: '',
+};
+/**
+ * Service for searching memory when planning.
+ *
+ * When a user submits a prompt in plan mode, this service searches
+ * memory for relevant context: previous decisions, learnings, and tasks.
+ */
+class RecursionService {
+    constructor(memory, tasks, config) {
+        this.memory = memory;
+        this.tasks = tasks;
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Check if recursion should run for a given prompt.
+     */
+    shouldRun(prompt, permissionMode) {
+        // Must be in plan mode
+        if (permissionMode !== 'plan') {
+            return false;
+        }
+        // Skip short prompts
+        if (prompt.length < this.config.minPromptLength) {
+            return false;
+        }
+        // Skip commands
+        if (prompt.trim().startsWith('/')) {
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Run memory recursion for a plan mode prompt.
+     */
+    async run(prompt, groupIds) {
+        // Extract topics from prompt
+        const topics = this.extractTopics(prompt);
+        if (topics.length === 0) {
+            return EMPTY_RESULT;
+        }
+        // Build search query from topics
+        const query = topics.join(' ');
+        // Run searches in parallel with timeout
+        const timeoutPromise = new Promise((resolve) => {
+            setTimeout(() => resolve([[], [], []]), this.config.queryTimeoutMs);
+        });
+        const searchPromise = Promise.all([
+            this.searchByType(groupIds, query, 'decision'),
+            this.searchByType(groupIds, query, 'retrospective'),
+            this.searchTasks(groupIds, query),
+        ]);
+        let decisions = [];
+        let learnings = [];
+        let taskResults = [];
+        try {
+            [decisions, learnings, taskResults] = await Promise.race([searchPromise, timeoutPromise]);
+        }
+        catch {
+            // On error, return empty results
+            return EMPTY_RESULT;
+        }
+        // Format results
+        const formattedDecisions = decisions.map((d) => this.formatFact(d));
+        const formattedLearnings = learnings.map((l) => this.formatFact(l));
+        const formattedTasks = taskResults.map((t) => this.formatTask(t));
+        // Check if we found anything
+        const hasContext = formattedDecisions.length > 0 || formattedLearnings.length > 0 || formattedTasks.length > 0;
+        if (!hasContext) {
+            return EMPTY_RESULT;
+        }
+        return {
+            hasContext: true,
+            decisions: formattedDecisions,
+            learnings: formattedLearnings,
+            relatedTasks: formattedTasks,
+            summary: this.buildSummary(formattedDecisions, formattedLearnings, formattedTasks),
+        };
+    }
+    /**
+     * Extract meaningful topics from a prompt.
+     */
+    extractTopics(prompt) {
+        // Normalize and split
+        const words = prompt
+            .toLowerCase()
+            .replace(/[^a-z0-9\s-_]/g, ' ')
+            .split(/\s+/)
+            .filter((w) => w.length > 2 && !STOP_WORDS.has(w));
+        // Dedupe
+        const unique = [...new Set(words)];
+        // Prioritize technical terms and longer words
+        unique.sort((a, b) => {
+            const aIsTech = TECH_PATTERNS.test(a);
+            const bIsTech = TECH_PATTERNS.test(b);
+            if (aIsTech && !bIsTech)
+                return -1;
+            if (bIsTech && !aIsTech)
+                return 1;
+            return b.length - a.length;
+        });
+        return unique.slice(0, 5);
+    }
+    /**
+     * Search memory for facts of a specific type.
+     */
+    async searchByType(groupIds, query, type) {
+        try {
+            // Search with the query - the memory service will filter by tags if supported
+            const results = await this.memory.searchFacts(groupIds, `${type} ${query}`, this.config.maxResultsPerType * 2);
+            // Filter to items with matching type tag and limit results
+            const filtered = results
+                .filter((r) => r.tags?.some((t) => t === `type:${type}`))
+                .slice(0, this.config.maxResultsPerType);
+            return filtered;
+        }
+        catch {
+            return [];
+        }
+    }
+    /**
+     * Search for related tasks.
+     */
+    async searchTasks(groupIds, query) {
+        try {
+            // Use task service to get tasks
+            const allTasks = await this.tasks.getTasksSimple(groupIds);
+            // Filter tasks by query relevance (simple keyword matching)
+            const queryWords = query.toLowerCase().split(/\s+/);
+            const relevant = allTasks
+                .filter((task) => {
+                const title = task.title.toLowerCase();
+                return queryWords.some((word) => title.includes(word));
+            })
+                .slice(0, this.config.maxResultsPerType);
+            return relevant;
+        }
+        catch {
+            return [];
+        }
+    }
+    /**
+     * Format a memory fact for display.
+     */
+    formatFact(item) {
+        const text = item.fact || item.name || '<unknown>';
+        return text.length > 120 ? text.slice(0, 117) + '...' : text;
+    }
+    /**
+     * Format a task for display.
+     */
+    formatTask(task) {
+        const prefix = task.key ? `#${task.key}` : '';
+        const suffix = task.status && task.status !== 'unknown' ? ` (${task.status})` : '';
+        const text = `${prefix} ${task.title}${suffix}`.trim();
+        return text.length > 100 ? text.slice(0, 97) + '...' : text;
+    }
+    /**
+     * Get a tag value by prefix.
+     */
+    getTag(tags, prefix) {
+        if (!tags)
+            return null;
+        const tag = tags.find((t) => t.startsWith(prefix));
+        return tag ? tag.replace(prefix, '') : null;
+    }
+    /**
+     * Build formatted summary output.
+     */
+    buildSummary(decisions, learnings, tasks) {
+        const sections = [];
+        if (decisions.length > 0) {
+            sections.push('📌 Previous Decisions:');
+            decisions.forEach((d) => sections.push(`  - ${d}`));
+        }
+        if (learnings.length > 0) {
+            sections.push('📝 Learnings:');
+            learnings.forEach((l) => sections.push(`  - ${l}`));
+        }
+        if (tasks.length > 0) {
+            sections.push('📋 Related Tasks:');
+            tasks.forEach((t) => sections.push(`  - ${t}`));
+        }
+        return sections.join('\n');
+    }
+}
+exports.RecursionService = RecursionService;
+//# sourceMappingURL=RecursionService.js.map

package/dist/lib/infrastructure/services/RecursionService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RecursionService.js","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/RecursionService.ts"],"names":[],"mappings":";;;AAUA;;GAEG;AACH,MAAM,cAAc,GAAqB;IACvC,eAAe,EAAE,EAAE;IACnB,iBAAiB,EAAE,CAAC;IACpB,cAAc,EAAE,IAAI;CACrB,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAChE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI;IAClE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO;IACrE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM;IAC/D,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS;IACnE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACnE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACpE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IAC9D,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ;IACtE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU;IACpE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACjE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,YAAY;IAC1D,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO;IACtE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ;IACzE,OAAO,EAAE,KAAK;CACf,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,aAAa,GAAG,2GAA2G,CAAC;AAElI;;GAEG;AACH,MAAM,YAAY,GAAqB;IACrC,UAAU,EAAE,KAAK;IACjB,SAAS,EAAE,EAAE;IACb,SAAS,EAAE,EAAE;IACb,YAAY,EAAE,EAAE;IAChB,OAAO,EAAE,EAAE;CACZ,CAAC;AAEF;;;;;GAKG;AACH,MAAa,gBAAgB;IAG3B,YACmB,MAAsB,EACtB,KAAmB,EACpC,MAAkC;QAFjB,WAAM,GAAN,MAAM,CAAgB;QACtB,UAAK,GAAL,KAAK,CAAc;QAGpC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc,EAAE,cAAsB;QAC9C,uBAAuB;QACvB,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,qBAAqB;QACrB,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAChD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,gBAAgB;QAChB,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,QAA2B;QACnD,6BAA6B;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,YAAY,CAAC;QACtB,CAAC;QAED,iCAAiC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE/B,wCAAwC;QACxC,MAAM,cAAc,GAAG,IAAI,OAAO,CAA0C,CAAC,OAAO,EAAE,EAAE;YACtF,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC;QAEH,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC;YAChC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,UAAU,CAAC;YAC9C,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,eAAe,CAAC;YACnD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC;SAClC,CAAC,CAAC;QAEH,IAAI,SAAS,GAAkB,EAAE,CAAC;QAClC,IAAI,SAAS,GAAkB,EAAE,CAAC;QAClC,IAAI,WAAW,GAAY,EAAE,CAAC;QAE9B,IAAI,CAAC;YACH,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC,CAAC;QAC5F,CAAC;QAAC,MAAM,CAAC;YACP,iCAAiC;YACjC,OAAO,YAAY,CAAC;QACtB,CAAC;QAED,iBAAiB;QACjB,MAAM,kBAAkB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,kBAAkB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,6BAA6B;QAC7B,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAE/G,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,YAAY,CAAC;QACtB,CAAC;QAED,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,SAAS,EAAE,kBAAkB;YAC7B,SAAS,EAAE,kBAAkB;YAC7B,YAAY,EAAE,cAAc;YAC5B,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,cAAc,CAAC;SACnF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,MAAc;QAClC,sBAAsB;QACtB,MAAM,KAAK,GAAG,MAAM;aACjB,WAAW,EAAE;aACb,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC;aAC9B,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAErD,SAAS;QACT,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAEnC,8CAA8C;QAC9C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,OAAO,IAAI,CAAC,OAAO;gBAAE,OAAO,CAAC,CAAC,CAAC;YACnC,IAAI,OAAO,IAAI,CAAC,OAAO;gBAAE,OAAO,CAAC,CAAC;YAClC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY,CACxB,QAA2B,EAC3B,KAAa,EACb,IAAY;QAEZ,IAAI,CAAC;YACH,8EAA8E;YAC9E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAC3C,QAAQ,EACR,GAAG,IAAI,IAAI,KAAK,EAAE,EAClB,IAAI,CAAC,MAAM,CAAC,iBAAiB,GAAG,CAAC,CAClC,CAAC;YAEF,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,OAAO;iBACrB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,EAAE,CAAC,CAAC;iBACxD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAE3C,OAAO,QAAQ,CAAC;QAClB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CACvB,QAA2B,EAC3B,KAAa;QAEb,IAAI,CAAC;YACH,gCAAgC;YAChC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YAE3D,4DAA4D;YAC5D,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,QAAQ;iBACtB,MAAM,CAAC,CAAC,IAAW,EAAE,EAAE;gBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC;iBACD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAE3C,OAAO,QAAmB,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAiB;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC;QACnD,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAW;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAEnF,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,KAAK,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;QACvD,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9D,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,IAAmC,EAAE,MAAc;QAChE,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACnD,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9C,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,SAA4B,EAC5B,SAA4B,EAC5B,KAAwB;QAExB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACxC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC/B,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;YACnC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;CACF;AA/ND,4CA+NC"}

package/dist/lib/infrastructure/services/SessionCaptureService.d.ts

@@ -0,0 +1,31 @@
+import type { ISessionCaptureService, ICapturedWork } from '../../domain';
+/**
+ * Service for capturing session work.
+ *
+ * NOTE: This is a STUB implementation. The actual session capture logic
+ * lives in session-stop-worker.ts and is invoked via hooks (session-stop.ts).
+ *
+ * This stub exists to satisfy the ISessionCaptureService interface for
+ * library consumers who may want to integrate session capture differently.
+ *
+ * For the full implementation, see:
+ * - src/project/.claude/hooks/session-stop.ts (hook that spawns worker)
+ * - src/project/.claude/hooks/session-stop-worker.ts (actual capture logic)
+ *
+ * @see https://github.com/your-repo/issues/XXX for implementation tracking
+ */
+export declare class SessionCaptureService implements ISessionCaptureService {
+    /**
+     * Capture work from the current session.
+     *
+     * STUB: Returns empty result. The actual implementation is in session-stop-worker.ts.
+     *
+     * A full implementation would:
+     * 1. Read session transcript from Claude's session files
+     * 2. Parse transcript for meaningful work (file changes, decisions)
+     * 3. Extract facts worth remembering using complexity rating
+     * 4. Save to Graphiti via MCP
+     */
+    captureSessionWork(_sessionId?: string): Promise<ICapturedWork>;
+}
+//# sourceMappingURL=SessionCaptureService.d.ts.map

package/dist/lib/infrastructure/services/SessionCaptureService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SessionCaptureService.d.ts","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/SessionCaptureService.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,sBAAsB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAG1E;;;;;;;;;;;;;;GAcG;AACH,qBAAa,qBAAsB,YAAW,sBAAsB;IAClE;;;;;;;;;;OAUG;IACG,kBAAkB,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC;CAItE"}

package/dist/lib/infrastructure/services/SessionCaptureService.js

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SessionCaptureService = void 0;
+const domain_1 = require("../../domain");
+/**
+ * Service for capturing session work.
+ *
+ * NOTE: This is a STUB implementation. The actual session capture logic
+ * lives in session-stop-worker.ts and is invoked via hooks (session-stop.ts).
+ *
+ * This stub exists to satisfy the ISessionCaptureService interface for
+ * library consumers who may want to integrate session capture differently.
+ *
+ * For the full implementation, see:
+ * - src/project/.claude/hooks/session-stop.ts (hook that spawns worker)
+ * - src/project/.claude/hooks/session-stop-worker.ts (actual capture logic)
+ *
+ * @see https://github.com/your-repo/issues/XXX for implementation tracking
+ */
+class SessionCaptureService {
+    /**
+     * Capture work from the current session.
+     *
+     * STUB: Returns empty result. The actual implementation is in session-stop-worker.ts.
+     *
+     * A full implementation would:
+     * 1. Read session transcript from Claude's session files
+     * 2. Parse transcript for meaningful work (file changes, decisions)
+     * 3. Extract facts worth remembering using complexity rating
+     * 4. Save to Graphiti via MCP
+     */
+    async captureSessionWork(_sessionId) {
+        // Return empty result - actual logic is in session-stop-worker.ts
+        return (0, domain_1.emptyCapturedWork)();
+    }
+}
+exports.SessionCaptureService = SessionCaptureService;
+//# sourceMappingURL=SessionCaptureService.js.map

package/dist/lib/infrastructure/services/SessionCaptureService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SessionCaptureService.js","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/SessionCaptureService.ts"],"names":[],"mappings":";;;AACA,yCAAiD;AAEjD;;;;;;;;;;;;;;GAcG;AACH,MAAa,qBAAqB;IAChC;;;;;;;;;;OAUG;IACH,KAAK,CAAC,kBAAkB,CAAC,UAAmB;QAC1C,kEAAkE;QAClE,OAAO,IAAA,0BAAiB,GAAE,CAAC;IAC7B,CAAC;CACF;AAhBD,sDAgBC"}

package/dist/lib/infrastructure/services/TaskService.d.ts

@@ -0,0 +1,38 @@
+import type { ITaskService, IMcpClient, ITask, ITaskInput, ITaskUpdate, ITaskCounts, ILogger } from '../../domain';
+import type { IRepositoryRouter } from '../../domain/interfaces/dal';
+/**
+ * Task service implementation.
+ * Supports both direct MCP and DAL router backends.
+ */
+export declare class TaskService implements ITaskService {
+    private readonly mcp;
+    private readonly router?;
+    private readonly logger;
+    constructor(mcp: IMcpClient, router?: IRepositoryRouter | undefined, logger?: ILogger);
+    /**
+     * Get all tasks for a group.
+     */
+    getTasks(groupIds: readonly string[], aliases: readonly string[], branch: string | null): Promise<readonly ITask[]>;
+    /**
+     * Create a new task.
+     */
+    createTask(groupId: string, task: ITaskInput): Promise<ITask>;
+    /**
+     * Update an existing task.
+     */
+    updateTask(groupId: string, taskId: string, updates: ITaskUpdate): Promise<ITask>;
+    private getTaskId;
+    private getTaskNum;
+    private getTaskStatus;
+    /**
+     * Get task counts using DAL router (optimized for Neo4j).
+     * Falls back to in-memory counting if router not available.
+     */
+    getTaskCounts(groupIds: readonly string[]): Promise<ITaskCounts>;
+    /**
+     * Get tasks with simple interface (no aliases/branch).
+     * Uses DAL router when available.
+     */
+    getTasksSimple(groupIds: readonly string[]): Promise<readonly ITask[]>;
+}
+//# sourceMappingURL=TaskService.d.ts.map

package/dist/lib/infrastructure/services/TaskService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TaskService.d.ts","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/TaskService.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEnH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAsBrE;;;GAGG;AACH,qBAAa,WAAY,YAAW,YAAY;IAI5C,OAAO,CAAC,QAAQ,CAAC,GAAG;IACpB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IAJ1B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAU;gBAGd,GAAG,EAAE,UAAU,EACf,MAAM,CAAC,EAAE,iBAAiB,YAAA,EAC3C,MAAM,CAAC,EAAE,OAAO;IAKlB;;OAEG;IACG,QAAQ,CACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,MAAM,EAAE,MAAM,GAAG,IAAI,GACpB,OAAO,CAAC,SAAS,KAAK,EAAE,CAAC;IAiD5B;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC;IA+BnE;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC;IAkCvF,OAAO,CAAC,SAAS;IAKjB,OAAO,CAAC,UAAU;IAKlB,OAAO,CAAC,aAAa;IAOrB;;;OAGG;IACG,aAAa,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAyCtE;;;OAGG;IACG,cAAc,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,KAAK,EAAE,CAAC;CAsD7E"}

package/dist/lib/infrastructure/services/TaskService.js

@@ -0,0 +1,227 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TaskService = void 0;
+const context_1 = require("../context");
+const logging_1 = require("../logging");
+/**
+ * Task service implementation.
+ * Supports both direct MCP and DAL router backends.
+ */
+class TaskService {
+    constructor(mcp, router, logger) {
+        this.mcp = mcp;
+        this.router = router;
+        this.logger = logger ?? new logging_1.NullLogger();
+    }
+    /**
+     * Get all tasks for a group.
+     */
+    async getTasks(groupIds, aliases, branch) {
+        this.logger.debug('Getting tasks', { groupIds, aliases, branch });
+        const tasks = [];
+        const seenUuids = new Set();
+        for (const alias of aliases) {
+            const taskParams = {
+                query: 'task',
+                tags: ['type:task', ...context_1.ContextDetector.repoTags({ repo: alias, branch })],
+                max_nodes: 200,
+                group_ids: [...groupIds],
+            };
+            const [taskResp] = await this.mcp.call('search_nodes', taskParams);
+            const nodes = taskResp?.result?.nodes || taskResp?.nodes || [];
+            for (const node of nodes) {
+                const uuid = node.uuid || `${node.name}-${node.fact}`;
+                if (seenUuids.has(uuid))
+                    continue;
+                seenUuids.add(uuid);
+                const key = this.getTaskNum(node.tags) || this.getTaskId(node.tags);
+                if (!key)
+                    continue;
+                tasks.push({
+                    key,
+                    status: this.getTaskStatus(node.tags),
+                    title: node.name || node.fact || node.uuid || '<untitled>',
+                    blocked: (node.tags || [])
+                        .filter((t) => t.startsWith('blocked_by:'))
+                        .map((t) => t.replace('blocked_by:', '')),
+                    created_at: node.created_at,
+                });
+            }
+        }
+        // Sort by creation date descending
+        tasks.sort((a, b) => {
+            const ad = a.created_at ? new Date(a.created_at).getTime() : 0;
+            const bd = b.created_at ? new Date(b.created_at).getTime() : 0;
+            return bd - ad;
+        });
+        this.logger.info('Tasks loaded', { count: tasks.length });
+        return tasks;
+    }
+    /**
+     * Create a new task.
+     */
+    async createTask(groupId, task) {
+        this.logger.debug('Creating task', { groupId, title: task.title, status: task.status });
+        const taskId = `task-${Date.now()}`;
+        const tags = [
+            'type:task',
+            `task_id:${taskId}`,
+            `status:${task.status || 'ready'}`,
+        ];
+        if (task.blocked) {
+            task.blocked.forEach((b) => tags.push(`blocked_by:${b}`));
+        }
+        await this.mcp.call('add_memory', {
+            content: task.title,
+            group_ids: [groupId],
+            tags,
+        });
+        this.logger.info('Task created', { taskId, status: task.status || 'ready' });
+        return {
+            key: taskId,
+            status: task.status || 'ready',
+            title: task.title,
+            blocked: task.blocked || [],
+            created_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Update an existing task.
+     */
+    async updateTask(groupId, taskId, updates) {
+        this.logger.debug('Updating task', { groupId, taskId, updates });
+        const tags = ['type:task', `task_id:${taskId}`];
+        if (updates.status) {
+            tags.push(`status:${updates.status}`);
+        }
+        if (updates.blocked) {
+            updates.blocked.forEach((b) => tags.push(`blocked_by:${b}`));
+        }
+        const content = updates.title || `Task ${taskId} updated`;
+        await this.mcp.call('add_memory', {
+            content,
+            group_ids: [groupId],
+            tags,
+        });
+        this.logger.info('Task updated', { taskId, status: updates.status });
+        return {
+            key: taskId,
+            status: updates.status || 'unknown',
+            title: updates.title || content,
+            blocked: updates.blocked || [],
+            created_at: new Date().toISOString(),
+        };
+    }
+    // --- Helper methods ---
+    getTaskId(tags = []) {
+        const t = tags.find((x) => x.startsWith('task_id:'));
+        return t ? t.replace('task_id:', '') : null;
+    }
+    getTaskNum(tags = []) {
+        const t = tags.find((x) => x.startsWith('task_num:'));
+        return t ? t.replace('task_num:', '') : null;
+    }
+    getTaskStatus(tags = []) {
+        const t = tags.find((x) => x.startsWith('status:'));
+        const status = t ? t.replace('status:', '').toLowerCase() : 'unknown';
+        const validStatuses = ['ready', 'in-progress', 'blocked', 'done', 'closed', 'unknown'];
+        return validStatuses.includes(status) ? status : 'unknown';
+    }
+    /**
+     * Get task counts using DAL router (optimized for Neo4j).
+     * Falls back to in-memory counting if router not available.
+     */
+    async getTaskCounts(groupIds) {
+        this.logger.debug('Getting task counts', { groupIds });
+        if (this.router) {
+            try {
+                const repo = this.router.getTaskRepository('aggregate');
+                if ('getCounts' in repo) {
+                    const counts = await repo.getCounts(groupIds);
+                    this.logger.debug('Task counts from DAL router', { counts });
+                    return counts;
+                }
+            }
+            catch (error) {
+                this.logger.debug('DAL router aggregate failed, falling back to in-memory', {
+                    error: error.message
+                });
+            }
+        }
+        // Fall back: load all tasks and count in memory
+        const tasks = await this.getTasksSimple(groupIds);
+        const counts = {
+            ready: 0,
+            'in-progress': 0,
+            blocked: 0,
+            done: 0,
+            closed: 0,
+            unknown: 0,
+        };
+        for (const task of tasks) {
+            if (task.status in counts) {
+                counts[task.status]++;
+            }
+            else {
+                counts.unknown++;
+            }
+        }
+        this.logger.debug('Task counts computed in-memory', { counts });
+        return counts;
+    }
+    /**
+     * Get tasks with simple interface (no aliases/branch).
+     * Uses DAL router when available.
+     */
+    async getTasksSimple(groupIds) {
+        this.logger.debug('Getting tasks (simple)', { groupIds });
+        if (this.router) {
+            try {
+                const repo = this.router.getTaskRepository('list');
+                const result = await repo.findByGroupIds(groupIds, {
+                    sort: { field: 'created_at', order: 'desc' },
+                    limit: 200,
+                });
+                this.logger.debug('Tasks loaded via DAL router', { count: result.items.length });
+                return result.items;
+            }
+            catch (error) {
+                this.logger.debug('DAL router list failed, falling back to MCP', {
+                    error: error.message
+                });
+            }
+        }
+        // Fall back to MCP path
+        const [taskResp] = await this.mcp.call('search_nodes', {
+            query: 'task',
+            tags: ['type:task'],
+            max_nodes: 200,
+            group_ids: [...groupIds],
+        });
+        const nodes = taskResp?.result?.nodes || taskResp?.nodes || [];
+        const tasks = [];
+        for (const node of nodes) {
+            const key = this.getTaskNum(node.tags) || this.getTaskId(node.tags);
+            if (!key)
+                continue;
+            tasks.push({
+                key,
+                status: this.getTaskStatus(node.tags),
+                title: node.name || node.fact || node.uuid || '<untitled>',
+                blocked: (node.tags || [])
+                    .filter((t) => t.startsWith('blocked_by:'))
+                    .map((t) => t.replace('blocked_by:', '')),
+                created_at: node.created_at,
+            });
+        }
+        const sorted = tasks.sort((a, b) => {
+            const ad = a.created_at ? new Date(a.created_at).getTime() : 0;
+            const bd = b.created_at ? new Date(b.created_at).getTime() : 0;
+            return bd - ad;
+        });
+        this.logger.debug('Tasks loaded via MCP', { count: sorted.length });
+        return sorted;
+    }
+}
+exports.TaskService = TaskService;
+//# sourceMappingURL=TaskService.js.map