sqlew 3.7.3 → 3.8.0

package/dist/utils/importer/master-tables.js

@@ -0,0 +1,255 @@
+/**
+ * Master Table Import with Smart Merge
+ *
+ * Handles importing master tables with intelligent ID remapping:
+ * - Project-scoped tables (m_files, m_tags, m_scopes): Smart merge on UNIQUE (project_id, name/path)
+ * - Global tables (m_agents, m_context_keys, etc.): Always create new IDs
+ *
+ * Architectural Decision: Decision #253 - Smart merge for project-scoped master tables
+ */
+/**
+ * Import master tables and build ID mappings
+ *
+ * @param ctx - Import context with target project ID
+ * @returns Updated context with ID mappings populated
+ */
+export async function importMasterTables(ctx) {
+    console.error('  Importing master tables...');
+    // Import order: no dependencies between master tables
+    await importAgents(ctx);
+    await importFiles(ctx);
+    await importContextKeys(ctx);
+    await importTags(ctx);
+    await importScopes(ctx);
+    await importConstraintCategories(ctx);
+    await importLayers(ctx);
+    await importTaskStatuses(ctx);
+    console.error(`  ✓ Master tables imported (${getTotalMappings(ctx)} ID mappings created)`);
+    return ctx;
+}
+/**
+ * Import m_agents (global, create or reuse by name)
+ */
+async function importAgents(ctx) {
+    const agents = ctx.jsonData.master_tables.agents || [];
+    for (const agent of agents) {
+        // Check if agent exists by name (global lookup)
+        const existing = await ctx.knex('m_agents')
+            .where({ name: agent.name })
+            .first();
+        if (existing) {
+            // Reuse existing global agent
+            ctx.mappings.agents.set(agent.id, existing.id);
+        }
+        else {
+            // Create new agent
+            const [newId] = await ctx.knex('m_agents').insert({
+                name: agent.name,
+                last_active_ts: agent.last_active_ts
+            });
+            ctx.mappings.agents.set(agent.id, newId);
+        }
+    }
+    ctx.stats.master_tables.agents_created = agents.length;
+}
+/**
+ * Import m_files (project-scoped, smart merge)
+ */
+async function importFiles(ctx) {
+    const files = ctx.jsonData.master_tables.files || [];
+    let created = 0;
+    let reused = 0;
+    for (const file of files) {
+        // Check if file already exists in target project
+        const existing = await ctx.knex('m_files')
+            .where({
+            project_id: ctx.projectId,
+            path: file.path
+        })
+            .first();
+        if (existing) {
+            // Reuse existing ID
+            ctx.mappings.files.set(file.id, existing.id);
+            reused++;
+        }
+        else {
+            // Create new file entry
+            const [newId] = await ctx.knex('m_files').insert({
+                project_id: ctx.projectId,
+                path: file.path
+            });
+            ctx.mappings.files.set(file.id, newId);
+            created++;
+        }
+    }
+    ctx.stats.master_tables.files_created = created;
+    ctx.stats.master_tables.files_reused = reused;
+}
+/**
+ * Import m_context_keys (global, always create new)
+ *
+ * CRITICAL: context_keys.id IS the decision ID (t_decisions.key_id PRIMARY KEY)
+ * Never reuse context_keys even if key string matches
+ *
+ * Architectural Decision: Decision #251 - Context key isolation
+ */
+async function importContextKeys(ctx) {
+    const keys = ctx.jsonData.master_tables.context_keys || [];
+    for (const key of keys) {
+        // Always create new context key (even if key string matches)
+        const [newId] = await ctx.knex('m_context_keys').insert({
+            key: key.key
+        });
+        ctx.mappings.context_keys.set(key.id, newId);
+    }
+    ctx.stats.master_tables.context_keys_created = keys.length;
+}
+/**
+ * Import m_tags (project-scoped, smart merge)
+ */
+async function importTags(ctx) {
+    const tags = ctx.jsonData.master_tables.tags || [];
+    let created = 0;
+    let reused = 0;
+    for (const tag of tags) {
+        // Check if tag already exists in target project
+        const existing = await ctx.knex('m_tags')
+            .where({
+            project_id: ctx.projectId,
+            name: tag.name
+        })
+            .first();
+        if (existing) {
+            // Reuse existing ID
+            ctx.mappings.tags.set(tag.id, existing.id);
+            reused++;
+        }
+        else {
+            // Create new tag entry
+            const [newId] = await ctx.knex('m_tags').insert({
+                project_id: ctx.projectId,
+                name: tag.name
+            });
+            ctx.mappings.tags.set(tag.id, newId);
+            created++;
+        }
+    }
+    ctx.stats.master_tables.tags_created = created;
+    ctx.stats.master_tables.tags_reused = reused;
+}
+/**
+ * Import m_scopes (project-scoped, smart merge)
+ */
+async function importScopes(ctx) {
+    const scopes = ctx.jsonData.master_tables.scopes || [];
+    let created = 0;
+    let reused = 0;
+    for (const scope of scopes) {
+        // Check if scope already exists in target project
+        const existing = await ctx.knex('m_scopes')
+            .where({
+            project_id: ctx.projectId,
+            name: scope.name
+        })
+            .first();
+        if (existing) {
+            // Reuse existing ID
+            ctx.mappings.scopes.set(scope.id, existing.id);
+            reused++;
+        }
+        else {
+            // Create new scope entry
+            const [newId] = await ctx.knex('m_scopes').insert({
+                project_id: ctx.projectId,
+                name: scope.name
+            });
+            ctx.mappings.scopes.set(scope.id, newId);
+            created++;
+        }
+    }
+    ctx.stats.master_tables.scopes_created = created;
+    ctx.stats.master_tables.scopes_reused = reused;
+}
+/**
+ * Import m_constraint_categories (global, create or reuse by name)
+ */
+async function importConstraintCategories(ctx) {
+    const categories = ctx.jsonData.master_tables.constraint_categories || [];
+    for (const category of categories) {
+        // Check if category exists by name (global lookup)
+        const existing = await ctx.knex('m_constraint_categories')
+            .where({ name: category.name })
+            .first();
+        if (existing) {
+            // Reuse existing global category
+            ctx.mappings.constraint_categories.set(category.id, existing.id);
+        }
+        else {
+            // Create new category
+            const [newId] = await ctx.knex('m_constraint_categories').insert({
+                name: category.name
+            });
+            ctx.mappings.constraint_categories.set(category.id, newId);
+        }
+    }
+}
+/**
+ * Import m_layers (global, create or reuse by name)
+ */
+async function importLayers(ctx) {
+    const layers = ctx.jsonData.master_tables.layers || [];
+    for (const layer of layers) {
+        // Check if layer exists by name (global lookup)
+        const existing = await ctx.knex('m_layers')
+            .where({ name: layer.name })
+            .first();
+        if (existing) {
+            // Reuse existing global layer
+            ctx.mappings.layers.set(layer.id, existing.id);
+        }
+        else {
+            // Create new layer
+            const [newId] = await ctx.knex('m_layers').insert({
+                name: layer.name
+            });
+            ctx.mappings.layers.set(layer.id, newId);
+        }
+    }
+}
+/**
+ * Import m_task_statuses (global, create or reuse by name)
+ */
+async function importTaskStatuses(ctx) {
+    const statuses = ctx.jsonData.master_tables.task_statuses || [];
+    for (const status of statuses) {
+        // Check if status exists by name (global lookup)
+        const existing = await ctx.knex('m_task_statuses')
+            .where({ name: status.name })
+            .first();
+        if (existing) {
+            // Reuse existing global status
+            ctx.mappings.task_statuses.set(status.id, existing.id);
+        }
+        else {
+            // Create new status
+            const [newId] = await ctx.knex('m_task_statuses').insert({
+                name: status.name
+            });
+            ctx.mappings.task_statuses.set(status.id, newId);
+        }
+    }
+}
+/**
+ * Get total number of ID mappings created
+ */
+function getTotalMappings(ctx) {
+    return (ctx.mappings.agents.size +
+        ctx.mappings.files.size +
+        ctx.mappings.context_keys.size +
+        ctx.mappings.tags.size +
+        ctx.mappings.scopes.size +
+        ctx.mappings.constraint_categories.size +
+        ctx.mappings.layers.size +
+        ctx.mappings.task_statuses.size);
+}
+//# sourceMappingURL=master-tables.js.map

package/dist/utils/importer/master-tables.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"master-tables.js","sourceRoot":"","sources":["../../../src/utils/importer/master-tables.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,GAAkB;IACzD,OAAO,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAE9C,sDAAsD;IACtD,MAAM,YAAY,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,WAAW,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,YAAY,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,0BAA0B,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,YAAY,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAE9B,OAAO,CAAC,KAAK,CAAC,+BAA+B,gBAAgB,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;IAC3F,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,YAAY,CAAC,GAAkB;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,IAAI,EAAE,CAAC;IAEvD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,gDAAgD;QAChD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC;aACxC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;aAC3B,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,8BAA8B;YAC9B,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,mBAAmB;YACnB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;gBAChD,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,cAAc,EAAE,KAAK,CAAC,cAAc;aACrC,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,WAAW,CAAC,GAAkB;IAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE,CAAC;IACrD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,iDAAiD;QACjD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;aACvC,KAAK,CAAC;YACL,UAAU,EAAE,GAAG,CAAC,SAAS;YACzB,IAAI,EAAE,IAAI,CAAC,IAAI;SAChB,CAAC;aACD,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,oBAAoB;YACpB,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC7C,MAAM,EAAE,CAAC;QACX,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC;gBAC/C,UAAU,EAAE,GAAG,CAAC,SAAS;gBACzB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACvC,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,aAAa,GAAG,OAAO,CAAC;IAChD,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,YAAY,GAAG,MAAM,CAAC;AAChD,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,iBAAiB,CAAC,GAAkB;IACjD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,IAAI,EAAE,CAAC;IAE3D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,6DAA6D;QAC7D,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC;YACtD,GAAG,EAAE,GAAG,CAAC,GAAG;SACb,CAAC,CAAC;QAEH,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,UAAU,CAAC,GAAkB;IAC1C,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,IAAI,EAAE,CAAC;IACnD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,gDAAgD;QAChD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;aACtC,KAAK,CAAC;YACL,UAAU,EAAE,GAAG,CAAC,SAAS;YACzB,IAAI,EAAE,GAAG,CAAC,IAAI;SACf,CAAC;aACD,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,oBAAoB;YACpB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC3C,MAAM,EAAE,CAAC;QACX,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;gBAC9C,UAAU,EAAE,GAAG,CAAC,SAAS;gBACzB,IAAI,EAAE,GAAG,CAAC,IAAI;aACf,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACrC,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,YAAY,GAAG,OAAO,CAAC;IAC/C,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,WAAW,GAAG,MAAM,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,YAAY,CAAC,GAAkB;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,IAAI,EAAE,CAAC;IACvD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,kDAAkD;QAClD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC;aACxC,KAAK,CAAC;YACL,UAAU,EAAE,GAAG,CAAC,SAAS;YACzB,IAAI,EAAE,KAAK,CAAC,IAAI;SACjB,CAAC;aACD,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,oBAAoB;YACpB,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC/C,MAAM,EAAE,CAAC;QACX,CAAC;aAAM,CAAC;YACN,yBAAyB;YACzB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;gBAChD,UAAU,EAAE,GAAG,CAAC,SAAS;gBACzB,IAAI,EAAE,KAAK,CAAC,IAAI;aACjB,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACzC,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,cAAc,GAAG,OAAO,CAAC;IACjD,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,aAAa,GAAG,MAAM,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,0BAA0B,CAAC,GAAkB;IAC1D,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,qBAAqB,IAAI,EAAE,CAAC;IAE1E,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;QAClC,mDAAmD;QACnD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,yBAAyB,CAAC;aACvD,KAAK,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC;aAC9B,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,iCAAiC;YACjC,GAAG,CAAC,QAAQ,CAAC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC;aAAM,CAAC;YACN,sBAAsB;YACtB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,MAAM,CAAC;gBAC/D,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,YAAY,CAAC,GAAkB;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,IAAI,EAAE,CAAC;IAEvD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,gDAAgD;QAChD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC;aACxC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;aAC3B,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,8BAA8B;YAC9B,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,mBAAmB;YACnB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;gBAChD,IAAI,EAAE,KAAK,CAAC,IAAI;aACjB,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,kBAAkB,CAAC,GAAkB;IAClD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,aAAa,IAAI,EAAE,CAAC;IAEhE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,iDAAiD;QACjD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC;aAC/C,KAAK,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;aAC5B,KAAK,EAAE,CAAC;QAEX,IAAI,QAAQ,EAAE,CAAC;YACb,+BAA+B;YAC/B,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;aAAM,CAAC;YACN,oBAAoB;YACpB,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC;gBACvD,IAAI,EAAE,MAAM,CAAC,IAAI;aAClB,CAAC,CAAC;YAEH,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,GAAkB;IAC1C,OAAO,CACL,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI;QACvB,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI;QAC9B,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI;QACtB,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,QAAQ,CAAC,qBAAqB,CAAC,IAAI;QACvC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAChC,CAAC;AACJ,CAAC"}

package/dist/utils/importer/topological-sort.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Topological Sort for Task Dependencies
+ *
+ * Implements BFS-based topological sorting to determine safe import order for tasks
+ * with dependencies. This ensures blocker tasks are imported before blocked tasks,
+ * satisfying foreign key constraints in t_task_dependencies.
+ */
+import type { TaskDependencyGraph } from '../../types.js';
+/**
+ * Task dependency record from exported JSON
+ */
+export interface TaskDependency {
+    blocker_task_id: number;
+    blocked_task_id: number;
+    created_ts: number;
+}
+/**
+ * Build dependency graph from task dependency records
+ *
+ * @param dependencies - Array of task dependencies from export
+ * @param allTaskIds - Set of all task IDs (some tasks may have no dependencies)
+ * @returns Dependency graph with adjacency lists
+ */
+export declare function buildDependencyGraph(dependencies: TaskDependency[], allTaskIds: Set<number>): TaskDependencyGraph;
+/**
+ * Topological sort using BFS (Kahn's algorithm)
+ *
+ * Ensures tasks are ordered such that all dependencies are satisfied:
+ * - A task appears in the sorted list AFTER all tasks it depends on
+ * - Blocker tasks appear before blocked tasks
+ *
+ * @param graph - Dependency graph from buildDependencyGraph
+ * @returns Array of task IDs in safe import order
+ * @throws Error if circular dependency detected
+ */
+export declare function topologicalSort(graph: TaskDependencyGraph): number[];
+/**
+ * Sort tasks by dependency order for import
+ *
+ * High-level function that combines graph building and topological sorting.
+ *
+ * @param tasks - Array of tasks from export
+ * @param dependencies - Array of task dependencies from export
+ * @returns Array of tasks sorted in safe import order
+ * @throws Error if circular dependency detected
+ */
+export declare function sortTasksByDependencies<T extends {
+    id: number;
+}>(tasks: T[], dependencies: TaskDependency[]): T[];
+/**
+ * Validate task dependencies for circular references
+ *
+ * @param dependencies - Array of task dependencies
+ * @param allTaskIds - Set of all valid task IDs
+ * @returns Validation result with errors if any
+ */
+export declare function validateTaskDependencies(dependencies: TaskDependency[], allTaskIds: Set<number>): {
+    valid: boolean;
+    errors: string[];
+};
+//# sourceMappingURL=topological-sort.d.ts.map

package/dist/utils/importer/topological-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.d.ts","sourceRoot":"","sources":["../../../src/utils/importer/topological-sort.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAE1D;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,YAAY,EAAE,cAAc,EAAE,EAC9B,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GACtB,mBAAmB,CA4BrB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,mBAAmB,GAAG,MAAM,EAAE,CAoCpE;AAED;;;;;;;;;GASG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAC9D,KAAK,EAAE,CAAC,EAAE,EACV,YAAY,EAAE,cAAc,EAAE,GAC7B,CAAC,EAAE,CAiBL;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CACtC,YAAY,EAAE,cAAc,EAAE,EAC9B,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GACtB;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,CAkCtC"}

package/dist/utils/importer/topological-sort.js

@@ -0,0 +1,143 @@
+/**
+ * Topological Sort for Task Dependencies
+ *
+ * Implements BFS-based topological sorting to determine safe import order for tasks
+ * with dependencies. This ensures blocker tasks are imported before blocked tasks,
+ * satisfying foreign key constraints in t_task_dependencies.
+ */
+/**
+ * Build dependency graph from task dependency records
+ *
+ * @param dependencies - Array of task dependencies from export
+ * @param allTaskIds - Set of all task IDs (some tasks may have no dependencies)
+ * @returns Dependency graph with adjacency lists
+ */
+export function buildDependencyGraph(dependencies, allTaskIds) {
+    const children = new Map();
+    const parents = new Map();
+    // Build adjacency lists
+    for (const dep of dependencies) {
+        // Add to children map (blocker -> [blocked])
+        if (!children.has(dep.blocker_task_id)) {
+            children.set(dep.blocker_task_id, []);
+        }
+        children.get(dep.blocker_task_id).push(dep.blocked_task_id);
+        // Add to parents map (blocked -> [blockers])
+        if (!parents.has(dep.blocked_task_id)) {
+            parents.set(dep.blocked_task_id, []);
+        }
+        parents.get(dep.blocked_task_id).push(dep.blocker_task_id);
+    }
+    // Find roots (tasks that are never blocked)
+    const roots = Array.from(allTaskIds).filter(id => !parents.has(id));
+    return {
+        roots,
+        children,
+        parents,
+        allTaskIds
+    };
+}
+/**
+ * Topological sort using BFS (Kahn's algorithm)
+ *
+ * Ensures tasks are ordered such that all dependencies are satisfied:
+ * - A task appears in the sorted list AFTER all tasks it depends on
+ * - Blocker tasks appear before blocked tasks
+ *
+ * @param graph - Dependency graph from buildDependencyGraph
+ * @returns Array of task IDs in safe import order
+ * @throws Error if circular dependency detected
+ */
+export function topologicalSort(graph) {
+    const sorted = [];
+    const visited = new Set();
+    const queue = [...graph.roots];
+    while (queue.length > 0) {
+        const taskId = queue.shift();
+        // Skip if already visited (shouldn't happen in DAG, but safety check)
+        if (visited.has(taskId))
+            continue;
+        visited.add(taskId);
+        sorted.push(taskId);
+        // Add children whose dependencies are all satisfied
+        const childIds = graph.children.get(taskId) || [];
+        for (const childId of childIds) {
+            const parentIds = graph.parents.get(childId) || [];
+            // Check if all parents (blockers) have been visited
+            if (parentIds.every((parentId) => visited.has(parentId))) {
+                queue.push(childId);
+            }
+        }
+    }
+    // Detect circular dependencies
+    if (sorted.length < graph.allTaskIds.size) {
+        const unvisited = Array.from(graph.allTaskIds).filter(id => !visited.has(id));
+        throw new Error(`Circular dependency detected in tasks. ` +
+            `Cannot determine import order. Unvisited task IDs: ${unvisited.join(', ')}`);
+    }
+    return sorted;
+}
+/**
+ * Sort tasks by dependency order for import
+ *
+ * High-level function that combines graph building and topological sorting.
+ *
+ * @param tasks - Array of tasks from export
+ * @param dependencies - Array of task dependencies from export
+ * @returns Array of tasks sorted in safe import order
+ * @throws Error if circular dependency detected
+ */
+export function sortTasksByDependencies(tasks, dependencies) {
+    // Extract all task IDs
+    const allTaskIds = new Set(tasks.map(t => t.id));
+    // Build dependency graph
+    const graph = buildDependencyGraph(dependencies, allTaskIds);
+    // Perform topological sort
+    const sortedIds = topologicalSort(graph);
+    // Map sorted IDs back to task objects
+    const taskMap = new Map(tasks.map(t => [t.id, t]));
+    const sortedTasks = sortedIds
+        .map(id => taskMap.get(id))
+        .filter((t) => t !== undefined);
+    return sortedTasks;
+}
+/**
+ * Validate task dependencies for circular references
+ *
+ * @param dependencies - Array of task dependencies
+ * @param allTaskIds - Set of all valid task IDs
+ * @returns Validation result with errors if any
+ */
+export function validateTaskDependencies(dependencies, allTaskIds) {
+    const errors = [];
+    // Check for self-dependencies
+    for (const dep of dependencies) {
+        if (dep.blocker_task_id === dep.blocked_task_id) {
+            errors.push(`Task ${dep.blocker_task_id} cannot depend on itself`);
+        }
+    }
+    // Check for invalid task IDs
+    for (const dep of dependencies) {
+        if (!allTaskIds.has(dep.blocker_task_id)) {
+            errors.push(`Blocker task ${dep.blocker_task_id} not found in task list`);
+        }
+        if (!allTaskIds.has(dep.blocked_task_id)) {
+            errors.push(`Blocked task ${dep.blocked_task_id} not found in task list`);
+        }
+    }
+    // Try to detect circular dependencies
+    if (errors.length === 0) {
+        try {
+            const graph = buildDependencyGraph(dependencies, allTaskIds);
+            topologicalSort(graph);
+        }
+        catch (error) {
+            errors.push(error instanceof Error ? error.message : String(error));
+        }
+    }
+    return {
+        valid: errors.length === 0,
+        errors
+    };
+}
+//# sourceMappingURL=topological-sort.js.map

package/dist/utils/importer/topological-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.js","sourceRoot":"","sources":["../../../src/utils/importer/topological-sort.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAaH;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,YAA8B,EAC9B,UAAuB;IAEvB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,wBAAwB;IACxB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,6CAA6C;QAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;YACvC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QAE7D,6CAA6C;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC9D,CAAC;IAED,4CAA4C;IAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpE,OAAO;QACL,KAAK;QACL,QAAQ;QACR,OAAO;QACP,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAAC,KAA0B;IACxD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAEzC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE9B,sEAAsE;QACtE,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QAElC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEpB,oDAAoD;QACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAEnD,oDAAoD;YACpD,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,QAAgB,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBACjE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9E,MAAM,IAAI,KAAK,CACb,yCAAyC;YACzC,sDAAsD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC7E,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAU,EACV,YAA8B;IAE9B,uBAAuB;IACvB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjD,yBAAyB;IACzB,MAAM,KAAK,GAAG,oBAAoB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IAE7D,2BAA2B;IAC3B,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEzC,sCAAsC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,SAAS;SAC1B,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAU,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAE1C,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,YAA8B,EAC9B,UAAuB;IAEvB,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,8BAA8B;IAC9B,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,IAAI,GAAG,CAAC,eAAe,KAAK,GAAG,CAAC,eAAe,EAAE,CAAC;YAChD,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,eAAe,0BAA0B,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,gBAAgB,GAAG,CAAC,eAAe,yBAAyB,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,gBAAgB,GAAG,CAAC,eAAe,yBAAyB,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,oBAAoB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAC7D,eAAe,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/utils/levenshtein.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Levenshtein Distance Calculation
+ * Shared utility for typo detection across validation modules
+ *
+ * Used by:
+ * - parameter-validator.ts (parameter typo suggestions)
+ * - batch-validation.ts (enum value typo suggestions)
+ */
+/**
+ * Calculate Levenshtein distance between two strings
+ * Used for typo detection (e.g., "busines" → "business", "context_key" → "key")
+ *
+ * @param a First string
+ * @param b Second string
+ * @returns Edit distance (number of single-character edits needed)
+ */
+export declare function levenshteinDistance(a: string, b: string): number;
+//# sourceMappingURL=levenshtein.d.ts.map

package/dist/utils/levenshtein.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshtein.d.ts","sourceRoot":"","sources":["../../src/utils/levenshtein.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CA+BhE"}

package/dist/utils/levenshtein.js

@@ -0,0 +1,46 @@
+/**
+ * Levenshtein Distance Calculation
+ * Shared utility for typo detection across validation modules
+ *
+ * Used by:
+ * - parameter-validator.ts (parameter typo suggestions)
+ * - batch-validation.ts (enum value typo suggestions)
+ */
+/**
+ * Calculate Levenshtein distance between two strings
+ * Used for typo detection (e.g., "busines" → "business", "context_key" → "key")
+ *
+ * @param a First string
+ * @param b Second string
+ * @returns Edit distance (number of single-character edits needed)
+ */
+export function levenshteinDistance(a, b) {
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    const matrix = [];
+    // Initialize matrix
+    for (let i = 0; i <= b.length; i++) {
+        matrix[i] = [i];
+    }
+    for (let j = 0; j <= a.length; j++) {
+        matrix[0][j] = j;
+    }
+    // Fill matrix
+    for (let i = 1; i <= b.length; i++) {
+        for (let j = 1; j <= a.length; j++) {
+            if (b.charAt(i - 1) === a.charAt(j - 1)) {
+                matrix[i][j] = matrix[i - 1][j - 1];
+            }
+            else {
+                matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, // substitution
+                matrix[i][j - 1] + 1, // insertion
+                matrix[i - 1][j] + 1 // deletion
+                );
+            }
+        }
+    }
+    return matrix[b.length][a.length];
+}
+//# sourceMappingURL=levenshtein.js.map

package/dist/utils/levenshtein.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshtein.js","sourceRoot":"","sources":["../../src/utils/levenshtein.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAEpC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,cAAc;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACrB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,eAAe;gBACzC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAM,YAAY;gBACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAM,WAAW;iBACtC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,CAAC"}

package/dist/utils/parameter-validator.d.ts

@@ -11,7 +11,7 @@
  *   validateActionParams('decision', 'set', params);
  *   // Throws ValidationError with structured details if validation fails
  */
-import type { DecisionAction, TaskAction, FileAction, ConstraintAction, StatsAction, ConfigAction, MessageAction } from '../types.js';
+import type { DecisionAction, TaskAction, FileAction, ConstraintAction, StatsAction } from '../types/actions.js';
 /**
  * Validate action parameters and throw structured error if invalid
  *
@@ -20,10 +20,10 @@ import type { DecisionAction, TaskAction, FileAction, ConstraintAction, StatsAct
  * @param params Parameters provided by user
  * @throws Error with structured ValidationError JSON if validation fails
  */
-export declare function validateActionParams(tool: string, action: DecisionAction | TaskAction | FileAction | ConstraintAction | StatsAction | ConfigAction | MessageAction | string, params: any): void;
+export declare function validateActionParams(tool: string, action: DecisionAction | TaskAction | FileAction | ConstraintAction | StatsAction | string, params: any): void;
 /**
  * Validate batch operation parameters
- * Used by set_batch, record_batch, batch_create actions
+ * Used by set_batch, record_batch, create_batch actions
  *
  * @param tool Tool name
  * @param batchParamName Name of the batch array parameter (e.g., 'decisions', 'tasks', 'file_changes')

package/dist/utils/parameter-validator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parameter-validator.d.ts","sourceRoot":"","sources":["../../src/utils/parameter-validator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAEV,cAAc,EACd,UAAU,EACV,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,YAAY,EACZ,aAAa,EACd,MAAM,aAAa,CAAC;AAgKrB;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,cAAc,GAAG,UAAU,GAAG,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,YAAY,GAAG,aAAa,GAAG,MAAM,EACzH,MAAM,EAAE,GAAG,GACV,IAAI,CA8EN;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,cAAc,EAAE,MAAM,EACtB,KAAK,EAAE,GAAG,EAAE,EACZ,UAAU,EAAE,MAAM,EAClB,QAAQ,GAAE,MAAW,GACpB,IAAI,CAkDN;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAM1D;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,EAAE,CAcpF"}
+{"version":3,"file":"parameter-validator.d.ts","sourceRoot":"","sources":["../../src/utils/parameter-validator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,KAAK,EACV,cAAc,EACd,UAAU,EACV,UAAU,EACV,gBAAgB,EAChB,WAAW,EACZ,MAAM,qBAAqB,CAAC;AAuH7B;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,cAAc,GAAG,UAAU,GAAG,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,EAC1F,MAAM,EAAE,GAAG,GACV,IAAI,CA8EN;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,cAAc,EAAE,MAAM,EACtB,KAAK,EAAE,GAAG,EAAE,EACZ,UAAU,EAAE,MAAM,EAClB,QAAQ,GAAE,MAAW,GACpB,IAAI,CAkDN;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAM1D;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,EAAE,CAcpF"}

package/dist/utils/parameter-validator.js

@@ -11,44 +11,8 @@
  *   validateActionParams('decision', 'set', params);
  *   // Throws ValidationError with structured details if validation fails
  */
-import { getActionSpec, ACTION_SPECS_BY_TOOL } from './action-specs.js';
-/**
- * Calculate Levenshtein distance between two strings
- * Used for typo detection (e.g., "context_key" → "key")
- *
- * @param a First string
- * @param b Second string
- * @returns Edit distance (number of single-character edits needed)
- */
-function levenshteinDistance(a, b) {
-    if (a.length === 0)
-        return b.length;
-    if (b.length === 0)
-        return a.length;
-    const matrix = [];
-    // Initialize matrix
-    for (let i = 0; i <= b.length; i++) {
-        matrix[i] = [i];
-    }
-    for (let j = 0; j <= a.length; j++) {
-        matrix[0][j] = j;
-    }
-    // Fill matrix
-    for (let i = 1; i <= b.length; i++) {
-        for (let j = 1; j <= a.length; j++) {
-            if (b.charAt(i - 1) === a.charAt(j - 1)) {
-                matrix[i][j] = matrix[i - 1][j - 1];
-            }
-            else {
-                matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, // substitution
-                matrix[i][j - 1] + 1, // insertion
-                matrix[i - 1][j] + 1 // deletion
-                );
-            }
-        }
-    }
-    return matrix[b.length][a.length];
-}
+import { getActionSpec, ACTION_SPECS_BY_TOOL } from './action-specs/index.js';
+import { levenshteinDistance } from './levenshtein.js';
 /**
  * Common abbreviation patterns for AI parameter typos
  * Maps abbreviated/shortened names to their full parameter names
@@ -230,7 +194,7 @@ export function validateActionParams(tool, action, params) {
 }
 /**
  * Validate batch operation parameters
- * Used by set_batch, record_batch, batch_create actions
+ * Used by set_batch, record_batch, create_batch actions
  *
  * @param tool Tool name
  * @param batchParamName Name of the batch array parameter (e.g., 'decisions', 'tasks', 'file_changes')