octie-cli 1.0.0

package/dist/core/storage/indexer.js

@@ -0,0 +1,350 @@
+/**
+ * Index Manager for fast task lookups
+ *
+ * Maintains pre-computed indexes for efficient queries:
+ * - Status-based grouping (byStatus)
+ * - Priority-based grouping (byPriority)
+ * - Root tasks (no incoming edges)
+ * - Orphan tasks (no edges)
+ * - Full-text search index (inverted index)
+ * - File reference index
+ *
+ * Provides O(1) incremental updates and O(n) full rebuild.
+ *
+ * @module core/storage
+ */
+import { TaskGraphStore } from '../graph/index.js';
+/**
+ * Index Manager class
+ *
+ * Maintains indexes for fast task queries and filtering.
+ */
+export class IndexManager {
+    /** Tasks grouped by status */
+    _byStatus;
+    /** Tasks grouped by priority */
+    _byPriority;
+    /** Full-text search index (term -> task IDs) */
+    _searchText;
+    /** File reference index (file path -> task IDs) */
+    _files;
+    /** Root tasks (no incoming edges) - cached */
+    _rootTasks;
+    /** Orphan tasks (no edges) - cached */
+    _orphanTasks;
+    /** Cached result object */
+    _cachedIndexes;
+    /**
+     * Create a new IndexManager
+     */
+    constructor() {
+        this._byStatus = new Map();
+        this._byPriority = new Map();
+        this._searchText = new Map();
+        this._files = new Map();
+        this._rootTasks = new Set();
+        this._orphanTasks = new Set();
+        this._cachedIndexes = null;
+        // Initialize status indexes
+        const statuses = ['ready', 'in_progress', 'in_review', 'completed', 'blocked'];
+        for (const status of statuses) {
+            this._byStatus.set(status, new Set());
+        }
+        // Initialize priority indexes
+        const priorities = ['top', 'second', 'later'];
+        for (const priority of priorities) {
+            this._byPriority.set(priority, new Set());
+        }
+    }
+    /**
+     * Incremental update for a single task
+     * Removes old task from indexes and adds new version
+     * O(1) operation for most cases
+     *
+     * @param task - New or updated task
+     * @param oldTask - Previous task state (for removal from old indexes)
+     * @param graph - TaskGraphStore for edge information
+     */
+    updateTask(task, oldTask, graph) {
+        // Remove old task from indexes if exists
+        if (oldTask) {
+            this._removeTask(oldTask);
+        }
+        // Add new task to indexes
+        this._addTask(task, graph);
+        // Invalidate cache
+        this._cachedIndexes = null;
+    }
+    /**
+     * Remove task from indexes
+     * @param task - Task to remove
+     * @private
+     */
+    _removeTask(task) {
+        // Remove from status index
+        this._byStatus.get(task.status)?.delete(task.id);
+        // Remove from priority index
+        this._byPriority.get(task.priority)?.delete(task.id);
+        // Remove from search index
+        const text = `${task.title} ${task.description} ${task.notes}`.toLowerCase();
+        const tokens = text.match(/\b\w+\b/g) || [];
+        for (const token of tokens) {
+            this._searchText.get(token)?.delete(task.id);
+            // Clean up empty token entries
+            if (this._searchText.get(token)?.size === 0) {
+                this._searchText.delete(token);
+            }
+        }
+        // Remove from file index
+        for (const filePath of task.related_files) {
+            this._files.get(filePath)?.delete(task.id);
+            // Clean up empty file entries
+            if (this._files.get(filePath)?.size === 0) {
+                this._files.delete(filePath);
+            }
+        }
+        // Remove from root/orphan caches (will be rebuilt on next get)
+        this._rootTasks.delete(task.id);
+        this._orphanTasks.delete(task.id);
+    }
+    /**
+     * Add task to indexes
+     * @param task - Task to add
+     * @param graph - TaskGraphStore for edge information
+     * @private
+     */
+    _addTask(task, graph) {
+        // Add to status index
+        if (!this._byStatus.has(task.status)) {
+            this._byStatus.set(task.status, new Set());
+        }
+        this._byStatus.get(task.status).add(task.id);
+        // Add to priority index
+        if (!this._byPriority.has(task.priority)) {
+            this._byPriority.set(task.priority, new Set());
+        }
+        this._byPriority.get(task.priority).add(task.id);
+        // Add to search index (tokenize and index)
+        const text = `${task.title} ${task.description} ${task.notes}`.toLowerCase();
+        const tokens = text.match(/\b\w+\b/g) || [];
+        for (const token of tokens) {
+            if (!this._searchText.has(token)) {
+                this._searchText.set(token, new Set());
+            }
+            this._searchText.get(token).add(task.id);
+        }
+        // Add to file reference index
+        for (const filePath of task.related_files) {
+            if (!this._files.has(filePath)) {
+                this._files.set(filePath, new Set());
+            }
+            this._files.get(filePath).add(task.id);
+        }
+        // Update root/orphan status
+        this._updateRootOrphanStatus(task.id, graph);
+    }
+    /**
+     * Update root/orphan status for a task
+     * @param taskId - Task ID to check
+     * @param graph - TaskGraphStore for edge information
+     * @private
+     */
+    _updateRootOrphanStatus(taskId, graph) {
+        const incoming = graph.getIncomingEdges(taskId);
+        const outgoing = graph.getOutgoingEdges(taskId);
+        // Root task: no incoming edges
+        if (incoming.length === 0) {
+            this._rootTasks.add(taskId);
+        }
+        else {
+            this._rootTasks.delete(taskId);
+        }
+        // Orphan task: no edges at all
+        if (incoming.length === 0 && outgoing.length === 0) {
+            this._orphanTasks.add(taskId);
+        }
+        else {
+            this._orphanTasks.delete(taskId);
+        }
+    }
+    /**
+     * Rebuild all indexes from scratch
+     * O(n) operation where n is the number of tasks
+     *
+     * @param tasks - Map of all tasks
+     * @param graph - TaskGraphStore for edge information
+     */
+    rebuildIndexes(tasks, graph) {
+        // Clear existing indexes
+        this._byStatus.clear();
+        this._byPriority.clear();
+        this._searchText.clear();
+        this._files.clear();
+        this._rootTasks.clear();
+        this._orphanTasks.clear();
+        // Re-initialize status and priority maps
+        const statuses = ['ready', 'in_progress', 'in_review', 'completed', 'blocked'];
+        for (const status of statuses) {
+            this._byStatus.set(status, new Set());
+        }
+        const priorities = ['top', 'second', 'later'];
+        for (const priority of priorities) {
+            this._byPriority.set(priority, new Set());
+        }
+        // Rebuild from all tasks
+        for (const task of tasks.values()) {
+            this._addTask(task, graph);
+        }
+        // Invalidate cache
+        this._cachedIndexes = null;
+    }
+    /**
+     * Get task IDs by status
+     * @param status - Task status to filter by
+     * @returns Array of task IDs
+     */
+    getByStatus(status) {
+        return Array.from(this._byStatus.get(status) || []);
+    }
+    /**
+     * Get task IDs by priority
+     * @param priority - Task priority to filter by
+     * @returns Array of task IDs
+     */
+    getByPriority(priority) {
+        return Array.from(this._byPriority.get(priority) || []);
+    }
+    /**
+     * Search tasks by text query
+     * @param query - Search query (will be tokenized)
+     * @returns Array of task IDs matching any token
+     */
+    search(query) {
+        const tokens = query.toLowerCase().match(/\b\w+\b/g) || [];
+        const results = new Set();
+        for (const token of tokens) {
+            const matching = this._searchText.get(token);
+            if (matching) {
+                for (const taskId of matching) {
+                    results.add(taskId);
+                }
+            }
+        }
+        return Array.from(results);
+    }
+    /**
+     * Get task IDs by related file
+     * @param filePath - File path to search for
+     * @returns Array of task IDs
+     */
+    getByFile(filePath) {
+        return Array.from(this._files.get(filePath) || []);
+    }
+    /**
+     * Get root tasks (no incoming edges)
+     * @returns Array of task IDs
+     */
+    getRootTasks() {
+        return Array.from(this._rootTasks);
+    }
+    /**
+     * Get orphan tasks (no edges)
+     * @returns Array of task IDs
+     */
+    getOrphanTasks() {
+        return Array.from(this._orphanTasks);
+    }
+    /**
+     * Get all indexes as a ProjectIndexes object
+     * Cached result - only recomputed if indexes changed
+     *
+     * @returns ProjectIndexes interface
+     */
+    getIndexes() {
+        if (this._cachedIndexes) {
+            return this._cachedIndexes;
+        }
+        // Build result object
+        const result = {
+            byStatus: {},
+            byPriority: {},
+            rootTasks: this.getRootTasks(),
+            orphanTasks: this.getOrphanTasks(),
+            searchText: {},
+            files: {},
+        };
+        // Convert status sets to arrays
+        for (const [status, taskIds] of this._byStatus) {
+            result.byStatus[status] = Array.from(taskIds);
+        }
+        // Convert priority sets to arrays
+        for (const [priority, taskIds] of this._byPriority) {
+            result.byPriority[priority] = Array.from(taskIds);
+        }
+        // Convert search index sets to arrays
+        for (const [token, taskIds] of this._searchText) {
+            result.searchText[token] = Array.from(taskIds);
+        }
+        // Convert file index sets to arrays
+        for (const [filePath, taskIds] of this._files) {
+            result.files[filePath] = Array.from(taskIds);
+        }
+        // Cache result
+        this._cachedIndexes = result;
+        return result;
+    }
+    /**
+     * Clear all indexes
+     */
+    clear() {
+        this._byStatus.clear();
+        this._byPriority.clear();
+        this._searchText.clear();
+        this._files.clear();
+        this._rootTasks.clear();
+        this._orphanTasks.clear();
+        this._cachedIndexes = null;
+        // Re-initialize status and priority maps
+        const statuses = ['ready', 'in_progress', 'in_review', 'completed', 'blocked'];
+        for (const status of statuses) {
+            this._byStatus.set(status, new Set());
+        }
+        const priorities = ['top', 'second', 'later'];
+        for (const priority of priorities) {
+            this._byPriority.set(priority, new Set());
+        }
+    }
+    /**
+     * Get index statistics (for debugging)
+     * @returns Statistics about the indexes
+     */
+    getStats() {
+        const statusCounts = {
+            ready: 0,
+            in_progress: 0,
+            in_review: 0,
+            completed: 0,
+            blocked: 0,
+        };
+        for (const [status, taskIds] of this._byStatus) {
+            statusCounts[status] = taskIds.size;
+        }
+        const priorityCounts = {
+            top: 0,
+            second: 0,
+            later: 0,
+        };
+        for (const [priority, taskIds] of this._byPriority) {
+            priorityCounts[priority] = taskIds.size;
+        }
+        return {
+            statusCounts,
+            priorityCounts,
+            searchTermsCount: this._searchText.size,
+            fileRefCount: this._files.size,
+            rootTasksCount: this._rootTasks.size,
+            orphanTasksCount: this._orphanTasks.size,
+        };
+    }
+}
+//# sourceMappingURL=indexer.js.map

package/dist/core/storage/indexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.js","sourceRoot":"","sources":["../../../src/core/storage/indexer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACvB,8BAA8B;IACtB,SAAS,CAA+B;IAEhD,gCAAgC;IACxB,WAAW,CAAiC;IAEpD,gDAAgD;IACxC,WAAW,CAA2B;IAE9C,mDAAmD;IAC3C,MAAM,CAA2B;IAEzC,8CAA8C;IACtC,UAAU,CAAc;IAEhC,uCAAuC;IAC/B,YAAY,CAAc;IAElC,2BAA2B;IACnB,cAAc,CAAwB;IAE9C;;OAEG;IACH;QACE,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAE3B,4BAA4B;QAC5B,MAAM,QAAQ,GAAiB,CAAC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC7F,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,8BAA8B;QAC9B,MAAM,UAAU,GAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU,CAAC,IAAc,EAAE,OAAwB,EAAE,KAAqB;QACxE,yCAAyC;QACzC,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC;QAED,0BAA0B;QAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAE3B,mBAAmB;QACnB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACK,WAAW,CAAC,IAAc;QAChC,2BAA2B;QAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjD,6BAA6B;QAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErD,2BAA2B;QAC3B,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC;QAC7E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7C,+BAA+B;YAC/B,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC5C,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3C,8BAA8B;YAC9B,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,+DAA+D;QAC/D,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAED;;;;;OAKG;IACK,QAAQ,CAAC,IAAc,EAAE,KAAqB;QACpD,sBAAsB;QACtB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE9C,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElD,2CAA2C;QAC3C,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC;QAC7E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACzC,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,8BAA8B;QAC9B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACvC,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,MAAc,EAAE,KAAqB;QACnE,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAEhD,+BAA+B;QAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,+BAA+B;QAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,KAA4B,EAAE,KAAqB;QAChE,yBAAyB;QACzB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAE1B,yCAAyC;QACzC,MAAM,QAAQ,GAAiB,CAAC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC7F,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,UAAU,GAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,yBAAyB;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QAED,mBAAmB;QACnB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,MAAkB;QAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,QAAsB;QAClC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAa;QAClB,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC7C,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,QAAgB;QACxB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACrD,CAAC;IAED;;;OAGG;IACH,YAAY;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,cAAc;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACH,UAAU;QACR,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,CAAC;QAED,sBAAsB;QACtB,MAAM,MAAM,GAAmB;YAC7B,QAAQ,EAAE,EAAgC;YAC1C,UAAU,EAAE,EAAkC;YAC9C,SAAS,EAAE,IAAI,CAAC,YAAY,EAAE;YAC9B,WAAW,EAAE,IAAI,CAAC,cAAc,EAAE;YAClC,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE;SACV,CAAC;QAEF,gCAAgC;QAChC,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChD,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpD,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAChD,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9C,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/C,CAAC;QAED,eAAe;QACf,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAE3B,yCAAyC;QACzC,MAAM,QAAQ,GAAiB,CAAC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC7F,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,UAAU,GAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ;QAQN,MAAM,YAAY,GAA+B;YAC/C,KAAK,EAAE,CAAC;YACR,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;SACX,CAAC;QAEF,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/C,YAAY,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;QACtC,CAAC;QAED,MAAM,cAAc,GAAiC;YACnD,GAAG,EAAE,CAAC;YACN,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,CAAC;SACT,CAAC;QAEF,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnD,cAAc,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;QAC1C,CAAC;QAED,OAAO;YACL,YAAY;YACZ,cAAc;YACd,gBAAgB,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YACvC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YAC9B,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACpC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;SACzC,CAAC;IACJ,CAAC;CACF"}

package/dist/core/utils/status-helpers.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Status Helper Functions
+ *
+ * Utilities for automatic status transitions in the graph-based task system.
+ *
+ * @module core/utils/status-helpers
+ */
+import type { TaskGraphStore } from '../graph/index.js';
+/**
+ * Recalculate status of all tasks that depend on a blocker
+ *
+ * When a blocker task's status changes (e.g., completed), this function
+ * recalculates the status of all tasks that were blocked by it.
+ *
+ * This enables the "all blockers resolved → ready" automatic transition
+ * from the status refactor spec (Rule 5).
+ *
+ * @param blockerId - The ID of the task whose status changed
+ * @param graph - The task graph containing all tasks
+ * @returns Array of task IDs that had their status recalculated
+ */
+export declare function recalculateDependentStatuses(blockerId: string, graph: TaskGraphStore): string[];
+/**
+ * Check if all blockers for a task are resolved
+ *
+ * A blocker is considered resolved if:
+ * - The blocker task has status 'completed', OR
+ * - The blocker task no longer exists in the graph
+ *
+ * @param taskBlockers - Array of blocker task IDs
+ * @param graph - The task graph to check blocker status
+ * @returns True if all blockers are resolved or there are no blockers
+ */
+export declare function areAllBlockersResolved(taskBlockers: string[], graph: TaskGraphStore): boolean;
+/**
+ * Get all tasks that are blocking a given task
+ *
+ * @param taskId - The task to get blockers for
+ * @param graph - The task graph
+ * @returns Array of blocker task nodes
+ */
+export declare function getActiveBlockers(taskId: string, graph: TaskGraphStore): Array<{
+    id: string;
+    title: string;
+    status: string;
+}>;
+/**
+ * Get all tasks that this task is blocking
+ *
+ * @param taskId - The task to find dependents for
+ * @param graph - The task graph
+ * @returns Array of task nodes that are blocked by this task
+ */
+export declare function getTasksBlockedBy(taskId: string, graph: TaskGraphStore): Array<{
+    id: string;
+    title: string;
+    status: string;
+}>;
+//# sourceMappingURL=status-helpers.d.ts.map

package/dist/core/utils/status-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"status-helpers.d.ts","sourceRoot":"","sources":["../../../src/core/utils/status-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAExD;;;;;;;;;;;;GAYG;AACH,wBAAgB,4BAA4B,CAC1C,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,cAAc,GACpB,MAAM,EAAE,CAmCV;AAuCD;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CACpC,YAAY,EAAE,MAAM,EAAE,EACtB,KAAK,EAAE,cAAc,GACpB,OAAO,CAcT;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,cAAc,GACpB,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAoBtD;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,cAAc,GACpB,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CActD"}

package/dist/core/utils/status-helpers.js

@@ -0,0 +1,149 @@
+/**
+ * Status Helper Functions
+ *
+ * Utilities for automatic status transitions in the graph-based task system.
+ *
+ * @module core/utils/status-helpers
+ */
+/**
+ * Recalculate status of all tasks that depend on a blocker
+ *
+ * When a blocker task's status changes (e.g., completed), this function
+ * recalculates the status of all tasks that were blocked by it.
+ *
+ * This enables the "all blockers resolved → ready" automatic transition
+ * from the status refactor spec (Rule 5).
+ *
+ * @param blockerId - The ID of the task whose status changed
+ * @param graph - The task graph containing all tasks
+ * @returns Array of task IDs that had their status recalculated
+ */
+export function recalculateDependentStatuses(blockerId, graph) {
+    const updatedTaskIds = [];
+    // Find all tasks that have this blocker in their blockers array
+    for (const task of graph.getAllTasks()) {
+        if (task.blockers.includes(blockerId)) {
+            const oldStatus = task.status;
+            // Check if ALL blockers are now resolved (completed or deleted)
+            const allBlockersResolved = areAllBlockersResolved(task.blockers, graph);
+            if (allBlockersResolved) {
+                // All blockers are resolved - calculate new status without considering blockers
+                // Use the standard status calculation logic but skip the blockers check
+                const newStatus = calculateStatusIgnoringBlockers(task);
+                if (newStatus !== task.status) {
+                    task.status = newStatus;
+                    // Touch the task to update timestamp
+                    task.recalculateStatus(); // This will update timestamp
+                    // Override the status since recalculateStatus() would set it back to blocked
+                    task.status = newStatus;
+                }
+            }
+            else {
+                // Still has active blockers - just recalculate normally
+                task.recalculateStatus();
+            }
+            if (task.status !== oldStatus) {
+                updatedTaskIds.push(task.id);
+            }
+        }
+    }
+    return updatedTaskIds;
+}
+/**
+ * Calculate task status ignoring blockers
+ *
+ * Used when all blockers are resolved to determine what the status should be.
+ * This is the same logic as TaskNode.calculateStatus() but skips the blockers check.
+ *
+ * @param task - The task to calculate status for
+ * @returns The calculated status (ready, in_progress, or in_review)
+ */
+function calculateStatusIgnoringBlockers(task) {
+    // Check if ready for review (all items complete)
+    const allCriteriaComplete = task.success_criteria.every(c => c.completed);
+    const allDeliverablesComplete = task.deliverables.every(d => d.completed);
+    const allNeedFixComplete = task.need_fix.every(f => f.completed);
+    const allComplete = allCriteriaComplete && allDeliverablesComplete && allNeedFixComplete;
+    if (allComplete) {
+        return 'in_review';
+    }
+    // Check if work has started
+    const anyCriteriaChecked = task.success_criteria.some(c => c.completed);
+    const anyDeliverableChecked = task.deliverables.some(d => d.completed);
+    const hasNeedFix = task.need_fix.length > 0;
+    if (anyCriteriaChecked || anyDeliverableChecked || hasNeedFix) {
+        return 'in_progress';
+    }
+    // Default - ready for work
+    return 'ready';
+}
+/**
+ * Check if all blockers for a task are resolved
+ *
+ * A blocker is considered resolved if:
+ * - The blocker task has status 'completed', OR
+ * - The blocker task no longer exists in the graph
+ *
+ * @param taskBlockers - Array of blocker task IDs
+ * @param graph - The task graph to check blocker status
+ * @returns True if all blockers are resolved or there are no blockers
+ */
+export function areAllBlockersResolved(taskBlockers, graph) {
+    if (taskBlockers.length === 0) {
+        return true;
+    }
+    for (const blockerId of taskBlockers) {
+        const blockerTask = graph.getNode(blockerId);
+        // If blocker doesn't exist or is not completed, task is still blocked
+        if (blockerTask && blockerTask.status !== 'completed') {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Get all tasks that are blocking a given task
+ *
+ * @param taskId - The task to get blockers for
+ * @param graph - The task graph
+ * @returns Array of blocker task nodes
+ */
+export function getActiveBlockers(taskId, graph) {
+    const task = graph.getNode(taskId);
+    if (!task || task.blockers.length === 0) {
+        return [];
+    }
+    const blockers = [];
+    for (const blockerId of task.blockers) {
+        const blockerTask = graph.getNode(blockerId);
+        if (blockerTask && blockerTask.status !== 'completed') {
+            blockers.push({
+                id: blockerId,
+                title: blockerTask.title,
+                status: blockerTask.status,
+            });
+        }
+    }
+    return blockers;
+}
+/**
+ * Get all tasks that this task is blocking
+ *
+ * @param taskId - The task to find dependents for
+ * @param graph - The task graph
+ * @returns Array of task nodes that are blocked by this task
+ */
+export function getTasksBlockedBy(taskId, graph) {
+    const blockedTasks = [];
+    for (const task of graph.getAllTasks()) {
+        if (task.blockers.includes(taskId)) {
+            blockedTasks.push({
+                id: task.id,
+                title: task.title,
+                status: task.status,
+            });
+        }
+    }
+    return blockedTasks;
+}
+//# sourceMappingURL=status-helpers.js.map

package/dist/core/utils/status-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"status-helpers.js","sourceRoot":"","sources":["../../../src/core/utils/status-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,4BAA4B,CAC1C,SAAiB,EACjB,KAAqB;IAErB,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,gEAAgE;IAChE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;YAE9B,gEAAgE;YAChE,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAEzE,IAAI,mBAAmB,EAAE,CAAC;gBACxB,gFAAgF;gBAChF,wEAAwE;gBACxE,MAAM,SAAS,GAAG,+BAA+B,CAAC,IAAI,CAAC,CAAC;gBAExD,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC9B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;oBACxB,qCAAqC;oBACrC,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,6BAA6B;oBACvD,6EAA6E;oBAC7E,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBAC1B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,wDAAwD;gBACxD,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,+BAA+B,CAAC,IAIxC;IACC,iDAAiD;IACjD,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1E,MAAM,uBAAuB,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1E,MAAM,kBAAkB,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACjE,MAAM,WAAW,GAAG,mBAAmB,IAAI,uBAAuB,IAAI,kBAAkB,CAAC;IAEzF,IAAI,WAAW,EAAE,CAAC;QAChB,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,4BAA4B;IAC5B,MAAM,kBAAkB,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACxE,MAAM,qBAAqB,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACvE,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAE5C,IAAI,kBAAkB,IAAI,qBAAqB,IAAI,UAAU,EAAE,CAAC;QAC9D,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,2BAA2B;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CACpC,YAAsB,EACtB,KAAqB;IAErB,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7C,sEAAsE;QACtE,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAc,EACd,KAAqB;IAErB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAyD,EAAE,CAAC;IAE1E,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YACtD,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,SAAS;gBACb,KAAK,EAAE,WAAW,CAAC,KAAK;gBACxB,MAAM,EAAE,WAAW,CAAC,MAAM;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAc,EACd,KAAqB;IAErB,MAAM,YAAY,GAAyD,EAAE,CAAC;IAE9E,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACnC,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Octie - Graph-based task management system
+ *
+ * Main entry point for the library.
+ */
+export { TaskGraphStore } from './core/graph/index.js';
+export { TaskNode } from './core/models/task-node.js';
+export { TaskStorage } from './core/storage/file-store.js';
+export * from './types/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,cAAc,kBAAkB,CAAC"}

package/dist/index.js

@@ -0,0 +1,10 @@
+/**
+ * Octie - Graph-based task management system
+ *
+ * Main entry point for the library.
+ */
+export { TaskGraphStore } from './core/graph/index.js';
+export { TaskNode } from './core/models/task-node.js';
+export { TaskStorage } from './core/storage/file-store.js';
+export * from './types/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,cAAc,kBAAkB,CAAC"}