@stoneforge/quarry 0.1.0

package/dist/services/priority-service.js

@@ -0,0 +1,272 @@
+/**
+ * Priority Service - Dependency-based priority calculation and complexity inheritance
+ *
+ * Provides:
+ * - Effective Priority: Computes a task's priority based on what depends on it
+ *   (tasks blocking high-priority work inherit that urgency)
+ * - Aggregate Complexity: Computes total effort including dependent task complexity
+ */
+import { Priority as PriorityEnum, Complexity as ComplexityEnum, DependencyType as DT } from '@stoneforge/core';
+/**
+ * Default priority calculation configuration
+ */
+export const DEFAULT_PRIORITY_CONFIG = {
+    maxDepth: 10,
+    includeComplexity: false,
+};
+// ============================================================================
+// PriorityService Class
+// ============================================================================
+/**
+ * Service for computing dependency-based priority and complexity
+ */
+export class PriorityService {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    // --------------------------------------------------------------------------
+    // Effective Priority Calculation
+    // --------------------------------------------------------------------------
+    /**
+     * Calculate the effective priority of a task based on its dependents.
+     *
+     * A task that blocks high-priority tasks should inherit that urgency.
+     * The effective priority is the minimum (highest urgency) of:
+     * - The task's own priority
+     * - The priorities of all tasks that directly or transitively depend on it
+     *
+     * @param taskId - The task to calculate effective priority for
+     * @param config - Optional configuration
+     * @returns EffectivePriorityResult with calculation details
+     */
+    calculateEffectivePriority(taskId, config = DEFAULT_PRIORITY_CONFIG) {
+        // Get the task's base priority
+        const task = this.getTaskPriority(taskId);
+        if (!task) {
+            return {
+                basePriority: PriorityEnum.MEDIUM,
+                effectivePriority: PriorityEnum.MEDIUM,
+                dependentInfluencers: [],
+                isInfluenced: false,
+            };
+        }
+        const basePriority = task.priority;
+        // Find all tasks that depend on this task (direct and transitive)
+        const dependentPriorities = this.collectDependentPriorities(taskId, config.maxDepth);
+        // Find the highest priority (lowest number) among dependents
+        let effectivePriority = basePriority;
+        const influencers = [];
+        for (const { id, priority } of dependentPriorities) {
+            if (priority < effectivePriority) {
+                effectivePriority = priority;
+                influencers.length = 0; // Reset - new highest priority found
+                influencers.push(id);
+            }
+            else if (priority === effectivePriority && priority < basePriority) {
+                influencers.push(id);
+            }
+        }
+        return {
+            basePriority,
+            effectivePriority,
+            dependentInfluencers: influencers,
+            isInfluenced: effectivePriority !== basePriority,
+        };
+    }
+    /**
+     * Calculate effective priorities for multiple tasks efficiently
+     *
+     * @param taskIds - Array of task IDs to calculate priorities for
+     * @param config - Optional configuration
+     * @returns Map of taskId to EffectivePriorityResult
+     */
+    calculateEffectivePriorities(taskIds, config = DEFAULT_PRIORITY_CONFIG) {
+        const results = new Map();
+        for (const taskId of taskIds) {
+            results.set(taskId, this.calculateEffectivePriority(taskId, config));
+        }
+        return results;
+    }
+    // --------------------------------------------------------------------------
+    // Aggregate Complexity Calculation
+    // --------------------------------------------------------------------------
+    /**
+     * Calculate the aggregate complexity of a task including its blockers.
+     *
+     * This represents the total effort needed before this task can be considered
+     * truly "done" - including all tasks it's waiting on.
+     *
+     * Note: This calculates complexity of tasks that THIS task depends on (blockers),
+     * not tasks that depend on it.
+     *
+     * @param taskId - The task to calculate aggregate complexity for
+     * @param config - Optional configuration
+     * @returns AggregateComplexityResult with calculation details
+     */
+    calculateAggregateComplexity(taskId, config = DEFAULT_PRIORITY_CONFIG) {
+        // Get the task's base complexity
+        const task = this.getTaskPriority(taskId);
+        if (!task) {
+            return {
+                baseComplexity: ComplexityEnum.MEDIUM,
+                aggregateComplexity: ComplexityEnum.MEDIUM,
+                dependentCount: 0,
+                dependentComplexities: [],
+            };
+        }
+        const baseComplexity = task.complexity;
+        // Find all tasks that this task depends on (blockers, direct and transitive)
+        const blockerComplexities = this.collectBlockerComplexities(taskId, config.maxDepth);
+        // Sum up complexities
+        let totalComplexity = baseComplexity;
+        const dependentComplexities = [];
+        for (const { id, complexity } of blockerComplexities) {
+            totalComplexity += complexity;
+            dependentComplexities.push({ id, complexity: complexity });
+        }
+        return {
+            baseComplexity,
+            aggregateComplexity: totalComplexity,
+            dependentCount: dependentComplexities.length,
+            dependentComplexities,
+        };
+    }
+    // --------------------------------------------------------------------------
+    // Bulk Operations for ready() query optimization
+    // --------------------------------------------------------------------------
+    /**
+     * Enhance an array of tasks with effective priority (for sorting)
+     *
+     * @param tasks - Array of tasks to enhance
+     * @param config - Optional configuration
+     * @returns Array of tasks with effectivePriority field
+     */
+    enhanceTasksWithEffectivePriority(tasks, config = DEFAULT_PRIORITY_CONFIG) {
+        if (tasks.length === 0) {
+            return [];
+        }
+        // Get task IDs
+        const taskIds = tasks.map((t) => t.id);
+        // Calculate effective priorities for all tasks
+        const priorityResults = this.calculateEffectivePriorities(taskIds, config);
+        // Enhance tasks
+        return tasks.map((task) => {
+            const result = priorityResults.get(task.id);
+            return {
+                ...task,
+                effectivePriority: result?.effectivePriority ?? task.priority,
+                priorityInfluenced: result?.isInfluenced ?? false,
+            };
+        });
+    }
+    /**
+     * Sort tasks by effective priority (highest priority first)
+     *
+     * @param tasks - Array of tasks with effective priority
+     * @returns Sorted array (mutates in place and returns reference)
+     */
+    sortByEffectivePriority(tasks) {
+        return tasks.sort((a, b) => {
+            // Primary sort: effective priority (lower number = higher priority)
+            if (a.effectivePriority !== b.effectivePriority) {
+                return a.effectivePriority - b.effectivePriority;
+            }
+            // Secondary sort: base priority (for ties in effective priority)
+            return a.priority - b.priority;
+        });
+    }
+    // --------------------------------------------------------------------------
+    // Private Helpers
+    // --------------------------------------------------------------------------
+    /**
+     * Get a task's priority and complexity from the database
+     */
+    getTaskPriority(taskId) {
+        const sql = `
+      SELECT e.id, json_extract(e.data, '$.priority') as priority,
+             json_extract(e.data, '$.complexity') as complexity
+      FROM elements e
+      WHERE e.id = ? AND e.type = 'task'
+    `;
+        return this.db.queryOne(sql, [taskId]);
+    }
+    /**
+     * Collect priorities of all tasks that depend on a given task (transitively).
+     *
+     * blockedId = the element waiting, blockerId = the element doing the blocking.
+     * To find tasks blocked by current.id, query WHERE blocker_id = current.id,
+     * then read blocked_id to get the dependent tasks.
+     */
+    collectDependentPriorities(taskId, maxDepth) {
+        const result = [];
+        const visited = new Set();
+        const queue = [{ id: taskId, depth: 0 }];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.depth >= maxDepth || visited.has(current.id)) {
+                continue;
+            }
+            visited.add(current.id);
+            // Find tasks that are blocked by this task (current.id is the blocker)
+            const dependents = this.db.query(`SELECT d.blocked_id, d.blocker_id, d.type
+         FROM dependencies d
+         WHERE d.blocker_id = ? AND d.type = ?`, [current.id, DT.BLOCKS]);
+            for (const dep of dependents) {
+                const blockedId = dep.blocked_id;
+                if (!visited.has(blockedId)) {
+                    const task = this.getTaskPriority(blockedId);
+                    if (task) {
+                        result.push({ id: blockedId, priority: task.priority });
+                        queue.push({ id: blockedId, depth: current.depth + 1 });
+                    }
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Collect complexities of all tasks that this task depends on (blockers, transitively).
+     *
+     * blockedId = the element waiting, blockerId = the element doing the blocking.
+     * To find tasks that block current.id, query WHERE blocked_id = current.id,
+     * then read blocker_id to get the blocking tasks.
+     */
+    collectBlockerComplexities(taskId, maxDepth) {
+        const result = [];
+        const visited = new Set();
+        const queue = [{ id: taskId, depth: 0 }];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.depth >= maxDepth || visited.has(current.id)) {
+                continue;
+            }
+            visited.add(current.id);
+            // Find tasks that block this task (current.id is the blocked element)
+            const blockers = this.db.query(`SELECT d.blocked_id, d.blocker_id, d.type
+         FROM dependencies d
+         WHERE d.blocked_id = ? AND d.type = ?`, [current.id, DT.BLOCKS]);
+            for (const dep of blockers) {
+                const blockerId = dep.blocker_id;
+                if (!visited.has(blockerId)) {
+                    const task = this.getTaskPriority(blockerId);
+                    if (task) {
+                        result.push({ id: blockerId, complexity: task.complexity });
+                        queue.push({ id: blockerId, depth: current.depth + 1 });
+                    }
+                }
+            }
+        }
+        return result;
+    }
+}
+// ============================================================================
+// Factory Function
+// ============================================================================
+/**
+ * Create a new PriorityService instance
+ */
+export function createPriorityService(db) {
+    return new PriorityService(db);
+}
+//# sourceMappingURL=priority-service.js.map

package/dist/services/priority-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-service.js","sourceRoot":"","sources":["../../src/services/priority-service.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,QAAQ,IAAI,YAAY,EAAE,UAAU,IAAI,cAAc,EAAE,cAAc,IAAI,EAAE,EAAE,MAAM,kBAAkB,CAAC;AA4EhH;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAA8B;IAChE,QAAQ,EAAE,EAAE;IACZ,iBAAiB,EAAE,KAAK;CACzB,CAAC;AAEF,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,eAAe;IACG;IAA7B,YAA6B,EAAkB;QAAlB,OAAE,GAAF,EAAE,CAAgB;IAAG,CAAC;IAEnD,6EAA6E;IAC7E,iCAAiC;IACjC,6EAA6E;IAE7E;;;;;;;;;;;OAWG;IACH,0BAA0B,CACxB,MAAiB,EACjB,SAAoC,uBAAuB;QAE3D,+BAA+B;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;gBACL,YAAY,EAAE,YAAY,CAAC,MAAM;gBACjC,iBAAiB,EAAE,YAAY,CAAC,MAAM;gBACtC,oBAAoB,EAAE,EAAE;gBACxB,YAAY,EAAE,KAAK;aACpB,CAAC;QACJ,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,QAAoB,CAAC;QAE/C,kEAAkE;QAClE,MAAM,mBAAmB,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAErF,6DAA6D;QAC7D,IAAI,iBAAiB,GAAG,YAAY,CAAC;QACrC,MAAM,WAAW,GAAgB,EAAE,CAAC;QAEpC,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,mBAAmB,EAAE,CAAC;YACnD,IAAI,QAAQ,GAAG,iBAAiB,EAAE,CAAC;gBACjC,iBAAiB,GAAG,QAAoB,CAAC;gBACzC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,qCAAqC;gBAC7D,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;iBAAM,IAAI,QAAQ,KAAK,iBAAiB,IAAI,QAAQ,GAAG,YAAY,EAAE,CAAC;gBACrE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,iBAAiB;YACjB,oBAAoB,EAAE,WAAW;YACjC,YAAY,EAAE,iBAAiB,KAAK,YAAY;SACjD,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,4BAA4B,CAC1B,OAAoB,EACpB,SAAoC,uBAAuB;QAE3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsC,CAAC;QAE9D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,6EAA6E;IAC7E,mCAAmC;IACnC,6EAA6E;IAE7E;;;;;;;;;;;;OAYG;IACH,4BAA4B,CAC1B,MAAiB,EACjB,SAAoC,uBAAuB;QAE3D,iCAAiC;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;gBACL,cAAc,EAAE,cAAc,CAAC,MAAM;gBACrC,mBAAmB,EAAE,cAAc,CAAC,MAAM;gBAC1C,cAAc,EAAE,CAAC;gBACjB,qBAAqB,EAAE,EAAE;aAC1B,CAAC;QACJ,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,UAAwB,CAAC;QAErD,6EAA6E;QAC7E,MAAM,mBAAmB,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAErF,sBAAsB;QACtB,IAAI,eAAe,GAAG,cAAc,CAAC;QACrC,MAAM,qBAAqB,GAAqD,EAAE,CAAC;QAEnF,KAAK,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,mBAAmB,EAAE,CAAC;YACrD,eAAe,IAAI,UAAU,CAAC;YAC9B,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,UAAwB,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,OAAO;YACL,cAAc;YACd,mBAAmB,EAAE,eAAe;YACpC,cAAc,EAAE,qBAAqB,CAAC,MAAM;YAC5C,qBAAqB;SACtB,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,iDAAiD;IACjD,6EAA6E;IAE7E;;;;;;OAMG;IACH,iCAAiC,CAC/B,KAAa,EACb,SAAoC,uBAAuB;QAE3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,eAAe;QACf,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEvC,+CAA+C;QAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAE3E,gBAAgB;QAChB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACxB,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,OAAO;gBACL,GAAG,IAAI;gBACP,iBAAiB,EAAE,MAAM,EAAE,iBAAiB,IAAI,IAAI,CAAC,QAAQ;gBAC7D,kBAAkB,EAAE,MAAM,EAAE,YAAY,IAAI,KAAK;aAClD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,uBAAuB,CAAC,KAAkC;QACxD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,oEAAoE;YACpE,IAAI,CAAC,CAAC,iBAAiB,KAAK,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBAChD,OAAO,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC;YACnD,CAAC;YACD,iEAAiE;YACjE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;OAEG;IACK,eAAe,CAAC,MAAiB;QACvC,MAAM,GAAG,GAAG;;;;;KAKX,CAAC;QACF,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAkB,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACK,0BAA0B,CAChC,MAAiB,EACjB,QAAgB;QAEhB,MAAM,MAAM,GAA+C,EAAE,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA4C,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAElF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAExB,uEAAuE;YACvE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAC9B;;+CAEuC,EACvC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CACxB,CAAC;YAEF,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,MAAM,SAAS,GAAG,GAAG,CAAC,UAAuB,CAAC;gBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;oBAC7C,IAAI,IAAI,EAAE,CAAC;wBACT,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACxD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC1D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,0BAA0B,CAChC,MAAiB,EACjB,QAAgB;QAEhB,MAAM,MAAM,GAAiD,EAAE,CAAC;QAChE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA4C,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAElF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAExB,sEAAsE;YACtE,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAC5B;;+CAEuC,EACvC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CACxB,CAAC;YAEF,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,UAAuB,CAAC;gBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;oBAC7C,IAAI,IAAI,EAAE,CAAC;wBACT,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;wBAC5D,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC1D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,EAAkB;IACtD,OAAO,IAAI,eAAe,CAAC,EAAE,CAAC,CAAC;AACjC,CAAC"}

package/dist/services/search-utils.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Search Utilities
+ *
+ * Provides adaptive top-K result filtering and FTS5 query sanitization
+ * for the document full-text search system.
+ */
+export interface ScoredResult<T> {
+    item: T;
+    score: number;
+}
+export interface AdaptiveTopKConfig {
+    /** Sensitivity for elbow detection (higher = more aggressive cutoff). Default: 1.5 */
+    sensitivity?: number;
+    /** Minimum number of results to return regardless of elbow. Default: 1 */
+    minResults?: number;
+    /** Hard cap on maximum results. Default: 50 */
+    maxResults?: number;
+}
+/**
+ * Apply adaptive top-K filtering using elbow detection on score distribution.
+ *
+ * Analyzes gaps between consecutive BM25 scores to find a natural cutoff point
+ * where result quality drops significantly. Returns results up to that cutoff.
+ *
+ * Algorithm:
+ * 1. Compute gaps between consecutive scores (already sorted descending by BM25)
+ * 2. Calculate mean and stddev of gaps
+ * 3. Find first gap exceeding mean + (sensitivity * stddev)
+ * 4. Return results up to that cutoff
+ *
+ * @param results - Scored results sorted by score descending
+ * @param config - Configuration for elbow detection
+ * @returns Filtered results with natural cutoff applied
+ */
+export declare function applyAdaptiveTopK<T>(results: ScoredResult<T>[], config?: AdaptiveTopKConfig): ScoredResult<T>[];
+/**
+ * Escape user input for safe use in FTS5 MATCH queries.
+ *
+ * FTS5 has special syntax characters that can cause query parse errors.
+ * This function wraps each token in quotes to prevent interpretation
+ * as FTS5 operators.
+ *
+ * @param input - Raw user search query
+ * @returns Sanitized query safe for FTS5 MATCH
+ */
+export declare function escapeFts5Query(input: string): string;
+//# sourceMappingURL=search-utils.d.ts.map

package/dist/services/search-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-utils.d.ts","sourceRoot":"","sources":["../../src/services/search-utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,kBAAkB;IACjC,sFAAsF;IACtF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,0EAA0E;IAC1E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,EAC1B,MAAM,GAAE,kBAAuB,GAC9B,YAAY,CAAC,CAAC,CAAC,EAAE,CAyCnB;AAMD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAYrD"}

package/dist/services/search-utils.js

@@ -0,0 +1,83 @@
+/**
+ * Search Utilities
+ *
+ * Provides adaptive top-K result filtering and FTS5 query sanitization
+ * for the document full-text search system.
+ */
+// ============================================================================
+// Adaptive Top-K
+// ============================================================================
+/**
+ * Apply adaptive top-K filtering using elbow detection on score distribution.
+ *
+ * Analyzes gaps between consecutive BM25 scores to find a natural cutoff point
+ * where result quality drops significantly. Returns results up to that cutoff.
+ *
+ * Algorithm:
+ * 1. Compute gaps between consecutive scores (already sorted descending by BM25)
+ * 2. Calculate mean and stddev of gaps
+ * 3. Find first gap exceeding mean + (sensitivity * stddev)
+ * 4. Return results up to that cutoff
+ *
+ * @param results - Scored results sorted by score descending
+ * @param config - Configuration for elbow detection
+ * @returns Filtered results with natural cutoff applied
+ */
+export function applyAdaptiveTopK(results, config = {}) {
+    const { sensitivity = 1.5, minResults = 1, maxResults = 50, } = config;
+    if (results.length === 0)
+        return [];
+    // Apply hard cap first
+    const capped = results.slice(0, maxResults);
+    // Need at least 3 results to detect an elbow
+    if (capped.length <= 2)
+        return capped;
+    // Compute gaps between consecutive scores
+    const gaps = [];
+    for (let i = 0; i < capped.length - 1; i++) {
+        gaps.push(capped[i].score - capped[i + 1].score);
+    }
+    // Calculate mean and standard deviation of gaps
+    const mean = gaps.reduce((sum, g) => sum + g, 0) / gaps.length;
+    const variance = gaps.reduce((sum, g) => sum + (g - mean) ** 2, 0) / gaps.length;
+    const stddev = Math.sqrt(variance);
+    // Find the elbow: first gap exceeding mean + sensitivity * stddev
+    const threshold = mean + sensitivity * stddev;
+    let cutoffIndex = capped.length; // Default: keep all
+    for (let i = 0; i < gaps.length; i++) {
+        if (gaps[i] > threshold) {
+            cutoffIndex = i + 1; // Include the result before the gap
+            break;
+        }
+    }
+    // Ensure minimum results
+    cutoffIndex = Math.max(cutoffIndex, Math.min(minResults, capped.length));
+    return capped.slice(0, cutoffIndex);
+}
+// ============================================================================
+// FTS5 Query Sanitization
+// ============================================================================
+/**
+ * Escape user input for safe use in FTS5 MATCH queries.
+ *
+ * FTS5 has special syntax characters that can cause query parse errors.
+ * This function wraps each token in quotes to prevent interpretation
+ * as FTS5 operators.
+ *
+ * @param input - Raw user search query
+ * @returns Sanitized query safe for FTS5 MATCH
+ */
+export function escapeFts5Query(input) {
+    const trimmed = input.trim();
+    if (trimmed.length === 0)
+        return '';
+    // Split into tokens and wrap each in double quotes to escape operators
+    // Remove any existing quotes from user input to prevent injection
+    const sanitized = trimmed.replace(/"/g, '');
+    if (sanitized.length === 0)
+        return '';
+    // Wrap each word in quotes to prevent FTS5 operator interpretation
+    const tokens = sanitized.split(/\s+/).filter(Boolean);
+    return tokens.map((token) => `"${token}"`).join(' ');
+}
+//# sourceMappingURL=search-utils.js.map

package/dist/services/search-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-utils.js","sourceRoot":"","sources":["../../src/services/search-utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAoBH,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAA0B,EAC1B,SAA6B,EAAE;IAE/B,MAAM,EACJ,WAAW,GAAG,GAAG,EACjB,UAAU,GAAG,CAAC,EACd,UAAU,GAAG,EAAE,GAChB,GAAG,MAAM,CAAC;IAEX,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,uBAAuB;IACvB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAE5C,6CAA6C;IAC7C,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAEtC,0CAA0C;IAC1C,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,gDAAgD;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEnC,kEAAkE;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,WAAW,GAAG,MAAM,CAAC;IAC9C,IAAI,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,oBAAoB;IAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;YACxB,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,oCAAoC;YACzD,MAAM;QACR,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACtC,CAAC;AAED,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,uEAAuE;IACvE,kEAAkE;IAClE,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,mEAAmE;IACnE,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACvD,CAAC"}

package/dist/sync/hash.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Content Hashing - SHA256 hashing for conflict detection
+ *
+ * Computes content hashes for elements to detect actual content changes
+ * during merge operations. Excludes identity and attribution fields.
+ */
+import type { Element } from '@stoneforge/core';
+import type { ContentHashResult } from './types.js';
+/**
+ * Compute content hash for an element
+ *
+ * Hash computation:
+ * 1. Collect content fields (exclude identity/attribution)
+ * 2. Sort object keys for determinism
+ * 3. JSON stringify
+ * 4. Prepend type for type-specific hashing
+ * 5. SHA256 hash
+ *
+ * @param element - Element to hash
+ * @returns Hash result with hex-encoded SHA256 hash
+ */
+export declare function computeContentHash(element: Element): Promise<ContentHashResult>;
+/**
+ * Compute content hash synchronously using Node.js crypto
+ *
+ * Works in both Bun and Node.js runtimes.
+ *
+ * @param element - Element to hash
+ * @returns Hash result with hex-encoded SHA256 hash
+ */
+export declare function computeContentHashSync(element: Element): ContentHashResult;
+/**
+ * Check if two elements have the same content hash
+ *
+ * @param a - First element
+ * @param b - Second element
+ * @returns True if content hashes match
+ */
+export declare function hasSameContentHash(a: Element, b: Element): boolean;
+/**
+ * Compare pre-computed hash with element
+ *
+ * @param element - Element to check
+ * @param expectedHash - Expected hash value
+ * @returns True if hash matches
+ */
+export declare function matchesContentHash(element: Element, expectedHash: string): boolean;
+//# sourceMappingURL=hash.d.ts.map

package/dist/sync/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/sync/hash.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAOpD;;;;;;;;;;;;GAYG;AACH,wBAAsB,kBAAkB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CA6BrF;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,OAAO,GAAG,iBAAiB,CA6B1E;AAMD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAIlE;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAGlF"}

package/dist/sync/hash.js

@@ -0,0 +1,136 @@
+/**
+ * Content Hashing - SHA256 hashing for conflict detection
+ *
+ * Computes content hashes for elements to detect actual content changes
+ * during merge operations. Excludes identity and attribution fields.
+ */
+import { createHash } from 'crypto';
+import { HASH_EXCLUDED_FIELDS } from './types.js';
+// ============================================================================
+// Content Hash Computation
+// ============================================================================
+/**
+ * Compute content hash for an element
+ *
+ * Hash computation:
+ * 1. Collect content fields (exclude identity/attribution)
+ * 2. Sort object keys for determinism
+ * 3. JSON stringify
+ * 4. Prepend type for type-specific hashing
+ * 5. SHA256 hash
+ *
+ * @param element - Element to hash
+ * @returns Hash result with hex-encoded SHA256 hash
+ */
+export async function computeContentHash(element) {
+    // Collect content fields
+    const contentFields = {};
+    const includedFields = [];
+    for (const [key, value] of Object.entries(element)) {
+        if (!HASH_EXCLUDED_FIELDS.includes(key)) {
+            contentFields[key] = value;
+            includedFields.push(key);
+        }
+    }
+    // Sort keys for determinism
+    const sortedFields = {};
+    const sortedKeys = Object.keys(contentFields).sort();
+    for (const key of sortedKeys) {
+        sortedFields[key] = contentFields[key];
+    }
+    // Create hash input: type prefix + JSON content
+    const hashInput = `${element.type}:${JSON.stringify(sortedFields, sortKeyReplacer)}`;
+    // Compute SHA256 hash
+    const hash = await sha256Hex(hashInput);
+    return {
+        hash,
+        fields: includedFields.sort(),
+    };
+}
+/**
+ * Compute content hash synchronously using Node.js crypto
+ *
+ * Works in both Bun and Node.js runtimes.
+ *
+ * @param element - Element to hash
+ * @returns Hash result with hex-encoded SHA256 hash
+ */
+export function computeContentHashSync(element) {
+    // Collect content fields
+    const contentFields = {};
+    const includedFields = [];
+    for (const [key, value] of Object.entries(element)) {
+        if (!HASH_EXCLUDED_FIELDS.includes(key)) {
+            contentFields[key] = value;
+            includedFields.push(key);
+        }
+    }
+    // Sort keys for determinism
+    const sortedFields = {};
+    const sortedKeys = Object.keys(contentFields).sort();
+    for (const key of sortedKeys) {
+        sortedFields[key] = contentFields[key];
+    }
+    // Create hash input: type prefix + JSON content
+    const hashInput = `${element.type}:${JSON.stringify(sortedFields, sortKeyReplacer)}`;
+    // Compute SHA256 hash using Node.js crypto (works in both Bun and Node.js)
+    const hash = createHash('sha256').update(hashInput).digest('hex');
+    return {
+        hash,
+        fields: includedFields.sort(),
+    };
+}
+// ============================================================================
+// Hash Comparison
+// ============================================================================
+/**
+ * Check if two elements have the same content hash
+ *
+ * @param a - First element
+ * @param b - Second element
+ * @returns True if content hashes match
+ */
+export function hasSameContentHash(a, b) {
+    const hashA = computeContentHashSync(a);
+    const hashB = computeContentHashSync(b);
+    return hashA.hash === hashB.hash;
+}
+/**
+ * Compare pre-computed hash with element
+ *
+ * @param element - Element to check
+ * @param expectedHash - Expected hash value
+ * @returns True if hash matches
+ */
+export function matchesContentHash(element, expectedHash) {
+    const result = computeContentHashSync(element);
+    return result.hash === expectedHash;
+}
+// ============================================================================
+// Helpers
+// ============================================================================
+/**
+ * JSON replacer that sorts object keys for deterministic stringification
+ */
+function sortKeyReplacer(_key, value) {
+    if (value !== null && typeof value === 'object' && !Array.isArray(value)) {
+        const sorted = {};
+        for (const k of Object.keys(value).sort()) {
+            sorted[k] = value[k];
+        }
+        return sorted;
+    }
+    return value;
+}
+/**
+ * Compute SHA256 hash of a string, returning hex-encoded result
+ * Uses Web Crypto API for async operation
+ */
+async function sha256Hex(input) {
+    const encoder = new TextEncoder();
+    const data = encoder.encode(input);
+    const hashBuffer = await crypto.subtle.digest('SHA-256', data);
+    const hashArray = Array.from(new Uint8Array(hashBuffer));
+    return hashArray.map((b) => b.toString(16).padStart(2, '0')).join('');
+}
+//# sourceMappingURL=hash.js.map

package/dist/sync/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/sync/hash.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAGpC,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAElD,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,OAAgB;IACvD,yBAAyB;IACzB,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACnD,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAA4C,CAAC,EAAE,CAAC;YACjF,aAAa,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YAC3B,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,YAAY,GAA4B,EAAE,CAAC;IACjD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,YAAY,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,gDAAgD;IAChD,MAAM,SAAS,GAAG,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,CAAC,EAAE,CAAC;IAErF,sBAAsB;IACtB,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,SAAS,CAAC,CAAC;IAExC,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE;KAC9B,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAgB;IACrD,yBAAyB;IACzB,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACnD,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAA4C,CAAC,EAAE,CAAC;YACjF,aAAa,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YAC3B,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,YAAY,GAA4B,EAAE,CAAC;IACjD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,YAAY,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,gDAAgD;IAChD,MAAM,SAAS,GAAG,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,CAAC,EAAE,CAAC;IAErF,2EAA2E;IAC3E,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAElE,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE;KAC9B,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAU,EAAE,CAAU;IACvD,MAAM,KAAK,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAgB,EAAE,YAAoB;IACvE,MAAM,MAAM,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAC/C,OAAO,MAAM,CAAC,IAAI,KAAK,YAAY,CAAC;AACtC,CAAC;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;GAEG;AACH,SAAS,eAAe,CAAC,IAAY,EAAE,KAAc;IACnD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzE,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACrE,MAAM,CAAC,CAAC,CAAC,GAAI,KAAiC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,SAAS,CAAC,KAAa;IACpC,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;IACzD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxE,CAAC"}

package/dist/sync/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Sync System - JSONL-based synchronization
+ *
+ * Provides bidirectional sync between SQLite and git-friendly JSONL format.
+ */
+export * from './types.js';
+export { serializeElement, serializeDependency, parseElement, parseDependency, tryParseElement, tryParseDependency, serializeElements, serializeDependencies, parseElements, parseDependencies, sortElementsForExport, sortDependenciesForExport, isSerializedElement, isSerializedDependency, type ParseError, } from './serialization.js';
+export { computeContentHash, computeContentHashSync, hasSameContentHash, matchesContentHash, } from './hash.js';
+export { mergeElements, mergeTags, mergeDependencies, getTombstoneStatus, type ElementMergeResult, type DependencyMergeResult, } from './merge.js';
+export { SyncService, createSyncService } from './service.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/sync/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/sync/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,cAAc,YAAY,CAAC;AAG3B,OAAO,EACL,gBAAgB,EAChB,mBAAmB,EACnB,YAAY,EACZ,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,qBAAqB,EACrB,yBAAyB,EACzB,mBAAmB,EACnB,sBAAsB,EACtB,KAAK,UAAU,GAChB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,WAAW,CAAC;AAGnB,OAAO,EACL,aAAa,EACb,SAAS,EACT,iBAAiB,EACjB,kBAAkB,EAClB,KAAK,kBAAkB,EACvB,KAAK,qBAAqB,GAC3B,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC"}

package/dist/sync/index.js

@@ -0,0 +1,16 @@
+/**
+ * Sync System - JSONL-based synchronization
+ *
+ * Provides bidirectional sync between SQLite and git-friendly JSONL format.
+ */
+// Types
+export * from './types.js';
+// Serialization
+export { serializeElement, serializeDependency, parseElement, parseDependency, tryParseElement, tryParseDependency, serializeElements, serializeDependencies, parseElements, parseDependencies, sortElementsForExport, sortDependenciesForExport, isSerializedElement, isSerializedDependency, } from './serialization.js';
+// Content Hashing
+export { computeContentHash, computeContentHashSync, hasSameContentHash, matchesContentHash, } from './hash.js';
+// Merge Strategy
+export { mergeElements, mergeTags, mergeDependencies, getTombstoneStatus, } from './merge.js';
+// Sync Service
+export { SyncService, createSyncService } from './service.js';
+//# sourceMappingURL=index.js.map

package/dist/sync/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/sync/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,QAAQ;AACR,cAAc,YAAY,CAAC;AAE3B,gBAAgB;AAChB,OAAO,EACL,gBAAgB,EAChB,mBAAmB,EACnB,YAAY,EACZ,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,qBAAqB,EACrB,yBAAyB,EACzB,mBAAmB,EACnB,sBAAsB,GAEvB,MAAM,oBAAoB,CAAC;AAE5B,kBAAkB;AAClB,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,WAAW,CAAC;AAEnB,iBAAiB;AACjB,OAAO,EACL,aAAa,EACb,SAAS,EACT,iBAAiB,EACjB,kBAAkB,GAGnB,MAAM,YAAY,CAAC;AAEpB,eAAe;AACf,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC"}