libero-mcp 0.2.18 → 0.2.20

package/data/migrations/014_task_difficulty_priority.sql

@@ -0,0 +1,6 @@
+-- S46 (2026-08-07): task difficulty/priority 持久化
+-- 用于"快速启动 + 峰终"智能排程
+-- 难度（easy/medium/hard，默认 medium）
+ALTER TABLE tasks ADD COLUMN difficulty TEXT DEFAULT 'medium';
+-- 优先级（high/medium/low，默认 medium）
+ALTER TABLE tasks ADD COLUMN priority TEXT DEFAULT 'medium';

package/dist/data/migrations/014_task_difficulty_priority.sql

@@ -0,0 +1,6 @@
+-- S46 (2026-08-07): task difficulty/priority 持久化
+-- 用于"快速启动 + 峰终"智能排程
+-- 难度（easy/medium/hard，默认 medium）
+ALTER TABLE tasks ADD COLUMN difficulty TEXT DEFAULT 'medium';
+-- 优先级（high/medium/low，默认 medium）
+ALTER TABLE tasks ADD COLUMN priority TEXT DEFAULT 'medium';

package/dist/mcp/server-core.js

@@ -824,7 +824,7 @@ function buildToolRegistry(ctx) {
     // ============================================================
     tools.push({
         name: "task.create",
-        description: "建单个独立任务（不挂任何 timeblock）。⚠️ 拆解请用 decompose.split，本工具一次只能建一个任务、不能建子任务。",
+        description: "建单个独立任务（不挂任何 timeblock）。⚠️ 拆解请用 decompose.split，本工具一次只能建一个任务、不能建子任务。S46 支持 difficulty（easy/medium/hard，默认 medium）+ priority（high/medium/low，默认 medium），用于'快速启动+峰终'智能排程。",
         // S33 v3: 用 z.object().strict() 显式拒 parent_id（zod 默认 strip 不报错，
         // 严格模式让多余键触发 safeParse 失败 → MCP 返回 isError）。
         // 底层 createTask 仍保留 parent_id 能力（task.test.ts 单测不破）。
@@ -834,6 +834,8 @@ function buildToolRegistry(ctx) {
             target_user_id: z.string().min(1).optional(),
             title: z.string().min(1),
             est_minutes: z.number().optional(),
+            difficulty: z.enum(["easy", "medium", "hard"]).optional(),
+            priority: z.enum(["high", "medium", "low"]).optional(),
         })
             .strict(),
         needsUserIdInjection: true,
@@ -868,12 +870,14 @@ function buildToolRegistry(ctx) {
     });
     tools.push({
         name: "task.update",
-        description: "更新任务（title/est_minutes/status；状态机校验非法流转）",
+        description: "更新任务（title/est_minutes/status/difficulty/priority；状态机校验非法流转）",
         inputSchema: {
             id: z.string().min(1),
             title: z.string().optional(),
             est_minutes: z.number().optional(),
             status: z.string().optional(),
+            difficulty: z.enum(["easy", "medium", "hard"]).optional(),
+            priority: z.enum(["high", "medium", "low"]).optional(),
         },
         handler: async ({ id, ...rest }) => asContent(await task.updateTask(id, rest)),
     });
@@ -886,6 +890,16 @@ function buildToolRegistry(ctx) {
         },
         handler: async ({ task_id, block_id }) => asContent(await task.linkTimeblock(task_id, block_id)),
     });
+    tools.push({
+        name: "task.updateDifficulty",
+        description: "S46: 仅更新 task 的 difficulty（easy/medium/hard）或 priority（high/medium/low）。用户主动调整时用，默认 medium。用于'快速启动+峰终'智能排程。",
+        inputSchema: {
+            task_id: z.string().min(1),
+            difficulty: z.enum(["easy", "medium", "hard"]).optional(),
+            priority: z.enum(["high", "medium", "low"]).optional(),
+        },
+        handler: async ({ task_id, difficulty, priority }) => asContent(await task.updateDifficulty(task_id, { difficulty, priority })),
+    });
     tools.push({
         name: "task.findPlan",
         description: "按事件名 exact-match 查拆解计划：返回根任务 + 第一块未完成子任务（record 开工时链 task_id，驱动闭环正反馈）",

package/dist/mcp/src/task/index.js

@@ -19,6 +19,13 @@ function nowStr() {
     return (new Date().toISOString().replace("T", " ").replace("Z", "") +
         String(Math.floor(performance.now() * 100000) % 100000).padStart(5, "0"));
 }
+// S46: difficulty/priority 归一化（不合法值 → medium）
+function normalizeDiff(v) {
+    return v === "easy" || v === "medium" || v === "hard" ? v : "medium";
+}
+function normalizePrio(v) {
+    return v === "high" || v === "medium" || v === "low" ? v : "medium";
+}
 function rowToTask(row) {
     return {
         id: row.id,
@@ -30,6 +37,9 @@ function rowToTask(row) {
         category_id: row.category_id ?? null,
         linked_timeblock_id: row.linked_timeblock_id ?? null,
         order_index: row.order_index ?? 0,
+        // S46: difficulty/priority（migration 014 加的列；旧库未 migrate 时回退 medium）
+        difficulty: row.difficulty ?? "medium",
+        priority: row.priority ?? "medium",
         created_at: row.created_at,
         updated_at: row.updated_at,
         deleted_at: row.deleted_at ?? null,
@@ -81,8 +91,18 @@ export function createTaskTools(db) {
             }
             const id = crypto.randomUUID();
             const now = nowStr();
-            db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, created_at, updated_at, deleted_at)
-         VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, 0, ?, ?, NULL)`).run(id, userId, input.parent_id ?? null, input.title, input.est_minutes ?? null, now, now);
+            // S46: difficulty/priority 默认 medium，校验入参合法值
+            const difficulty = normalizeDiff(input.difficulty);
+            const priority = normalizePrio(input.priority);
+            // S46 fix: 同 parent 下 order_index 单调递增（避免 created_at 精度问题导致排序 flaky）
+            const parentFilter = input.parent_id ? "AND parent_id = ?" : "AND parent_id IS NULL";
+            const parentParams = input.parent_id ? [input.parent_id] : [];
+            const maxOrderRow = db
+                .prepare(`SELECT COALESCE(MAX(order_index), -1) as max_idx FROM tasks WHERE user_id = ? ${parentFilter} AND deleted_at IS NULL`)
+                .get(userId, ...parentParams);
+            const orderIndex = maxOrderRow.max_idx + 1;
+            db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+         VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, ?, ?, NULL)`).run(id, userId, input.parent_id ?? null, input.title, input.est_minutes ?? null, orderIndex, difficulty, priority, now, now);
             const row = getTaskRow(id);
             return {
                 ...rowToTask(row),
@@ -142,6 +162,15 @@ export function createTaskTools(db) {
                 sets.push("status = ?");
                 params.push(patch.status);
             }
+            // S46: difficulty/priority 可独立更新
+            if (patch.difficulty !== undefined) {
+                sets.push("difficulty = ?");
+                params.push(normalizeDiff(patch.difficulty));
+            }
+            if (patch.priority !== undefined) {
+                sets.push("priority = ?");
+                params.push(normalizePrio(patch.priority));
+            }
             // Always refresh updated_at
             sets.push("updated_at = ?");
             params.push(nowStr());
@@ -168,6 +197,32 @@ export function createTaskTools(db) {
             const row = getTaskRow(taskId);
             return rowToTask(row);
         },
+        /** S46: 仅更新 difficulty/priority（用户主动调整） */
+        async updateDifficulty(taskId, patch) {
+            const existing = getTaskRow(taskId);
+            if (!existing) {
+                throw new Error("任务不存在");
+            }
+            if (patch.difficulty === undefined && patch.priority === undefined) {
+                throw new Error("至少传一个字段 difficulty 或 priority");
+            }
+            const sets = [];
+            const params = [];
+            if (patch.difficulty !== undefined) {
+                sets.push("difficulty = ?");
+                params.push(normalizeDiff(patch.difficulty));
+            }
+            if (patch.priority !== undefined) {
+                sets.push("priority = ?");
+                params.push(normalizePrio(patch.priority));
+            }
+            sets.push("updated_at = ?");
+            params.push(nowStr());
+            params.push(taskId);
+            db.prepare(`UPDATE tasks SET ${sets.join(", ")} WHERE id = ?`).run(...params);
+            const row = getTaskRow(taskId);
+            return rowToTask(row);
+        },
         async findPlan(input) {
             // exact-match a startable root task (aligned/executing) by title
             const rootRow = db
@@ -241,13 +296,13 @@ export function createTaskTools(db) {
             const result = db.transaction(() => {
                 const rootId = crypto.randomUUID();
                 const now = nowStr();
-                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, created_at, updated_at, deleted_at)
-           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, NULL, 0, ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, now, now);
+                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, NULL, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, now, now);
                 const children = plan.children.map((c, i) => {
                     const childId = crypto.randomUUID();
                     const cnow = nowStr();
-                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, created_at, updated_at, deleted_at)
-             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
+                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
                     return rowToTask(getTaskRow(childId));
                 });
                 return { root: rowToTask(getTaskRow(rootId)), children };
@@ -334,13 +389,13 @@ export function createTaskTools(db) {
             const result = db.transaction(() => {
                 const rootId = crypto.randomUUID();
                 const now = nowStr();
-                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, created_at, updated_at, deleted_at)
-           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, ?, 0, ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, plan.timeblock_id, now, now);
+                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, ?, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, plan.timeblock_id, now, now);
                 const children = plan.children.map((c, i) => {
                     const childId = crypto.randomUUID();
                     const cnow = nowStr();
-                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, created_at, updated_at, deleted_at)
-             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
+                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
                     return {
                         id: childId,
                         title: c.title,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "libero-mcp",
-  "version": "0.2.18",
+  "version": "0.2.20",
   "description": "AI 时间管理教练 MCP 工具集——时间块记录、统计、矩阵诊断、计时、分类、profile",
   "license": "MIT",
   "author": "amosyuan",