libero-mcp 0.2.18 → 0.2.19

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,6 @@
1
+ -- S46 (2026-08-07): task difficulty/priority 持久化
2
+ -- 用于"快速启动 + 峰终"智能排程
3
+ -- 难度(easy/medium/hard,默认 medium)
4
+ ALTER TABLE tasks ADD COLUMN difficulty TEXT DEFAULT 'medium';
5
+ -- 优先级(high/medium/low,默认 medium)
6
+ ALTER TABLE tasks ADD COLUMN priority TEXT DEFAULT 'medium';
@@ -0,0 +1,6 @@
1
+ -- S46 (2026-08-07): task difficulty/priority 持久化
2
+ -- 用于"快速启动 + 峰终"智能排程
3
+ -- 难度(easy/medium/hard,默认 medium)
4
+ ALTER TABLE tasks ADD COLUMN difficulty TEXT DEFAULT 'medium';
5
+ -- 优先级(high/medium/low,默认 medium)
6
+ ALTER TABLE tasks ADD COLUMN priority TEXT DEFAULT 'medium';
@@ -824,7 +824,7 @@ function buildToolRegistry(ctx) {
824
824
  // ============================================================
825
825
  tools.push({
826
826
  name: "task.create",
827
- description: "建单个独立任务(不挂任何 timeblock)。⚠️ 拆解请用 decompose.split,本工具一次只能建一个任务、不能建子任务。",
827
+ description: "建单个独立任务(不挂任何 timeblock)。⚠️ 拆解请用 decompose.split,本工具一次只能建一个任务、不能建子任务。S46 支持 difficulty(easy/medium/hard,默认 medium)+ priority(high/medium/low,默认 medium),用于'快速启动+峰终'智能排程。",
828
828
  // S33 v3: 用 z.object().strict() 显式拒 parent_id(zod 默认 strip 不报错,
829
829
  // 严格模式让多余键触发 safeParse 失败 → MCP 返回 isError)。
830
830
  // 底层 createTask 仍保留 parent_id 能力(task.test.ts 单测不破)。
@@ -834,6 +834,8 @@ function buildToolRegistry(ctx) {
834
834
  target_user_id: z.string().min(1).optional(),
835
835
  title: z.string().min(1),
836
836
  est_minutes: z.number().optional(),
837
+ difficulty: z.enum(["easy", "medium", "hard"]).optional(),
838
+ priority: z.enum(["high", "medium", "low"]).optional(),
837
839
  })
838
840
  .strict(),
839
841
  needsUserIdInjection: true,
@@ -868,12 +870,14 @@ function buildToolRegistry(ctx) {
868
870
  });
869
871
  tools.push({
870
872
  name: "task.update",
871
- description: "更新任务(title/est_minutes/status;状态机校验非法流转)",
873
+ description: "更新任务(title/est_minutes/status/difficulty/priority;状态机校验非法流转)",
872
874
  inputSchema: {
873
875
  id: z.string().min(1),
874
876
  title: z.string().optional(),
875
877
  est_minutes: z.number().optional(),
876
878
  status: z.string().optional(),
879
+ difficulty: z.enum(["easy", "medium", "hard"]).optional(),
880
+ priority: z.enum(["high", "medium", "low"]).optional(),
877
881
  },
878
882
  handler: async ({ id, ...rest }) => asContent(await task.updateTask(id, rest)),
879
883
  });
@@ -886,6 +890,16 @@ function buildToolRegistry(ctx) {
886
890
  },
887
891
  handler: async ({ task_id, block_id }) => asContent(await task.linkTimeblock(task_id, block_id)),
888
892
  });
893
+ tools.push({
894
+ name: "task.updateDifficulty",
895
+ description: "S46: 仅更新 task 的 difficulty(easy/medium/hard)或 priority(high/medium/low)。用户主动调整时用,默认 medium。用于'快速启动+峰终'智能排程。",
896
+ inputSchema: {
897
+ task_id: z.string().min(1),
898
+ difficulty: z.enum(["easy", "medium", "hard"]).optional(),
899
+ priority: z.enum(["high", "medium", "low"]).optional(),
900
+ },
901
+ handler: async ({ task_id, difficulty, priority }) => asContent(await task.updateDifficulty(task_id, { difficulty, priority })),
902
+ });
889
903
  tools.push({
890
904
  name: "task.findPlan",
891
905
  description: "按事件名 exact-match 查拆解计划:返回根任务 + 第一块未完成子任务(record 开工时链 task_id,驱动闭环正反馈)",
@@ -19,6 +19,13 @@ function nowStr() {
19
19
  return (new Date().toISOString().replace("T", " ").replace("Z", "") +
20
20
  String(Math.floor(performance.now() * 100000) % 100000).padStart(5, "0"));
21
21
  }
22
+ // S46: difficulty/priority 归一化(不合法值 → medium)
23
+ function normalizeDiff(v) {
24
+ return v === "easy" || v === "medium" || v === "hard" ? v : "medium";
25
+ }
26
+ function normalizePrio(v) {
27
+ return v === "high" || v === "medium" || v === "low" ? v : "medium";
28
+ }
22
29
  function rowToTask(row) {
23
30
  return {
24
31
  id: row.id,
@@ -30,6 +37,9 @@ function rowToTask(row) {
30
37
  category_id: row.category_id ?? null,
31
38
  linked_timeblock_id: row.linked_timeblock_id ?? null,
32
39
  order_index: row.order_index ?? 0,
40
+ // S46: difficulty/priority(migration 014 加的列;旧库未 migrate 时回退 medium)
41
+ difficulty: row.difficulty ?? "medium",
42
+ priority: row.priority ?? "medium",
33
43
  created_at: row.created_at,
34
44
  updated_at: row.updated_at,
35
45
  deleted_at: row.deleted_at ?? null,
@@ -81,8 +91,11 @@ export function createTaskTools(db) {
81
91
  }
82
92
  const id = crypto.randomUUID();
83
93
  const now = nowStr();
84
- 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)
85
- VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, 0, ?, ?, NULL)`).run(id, userId, input.parent_id ?? null, input.title, input.est_minutes ?? null, now, now);
94
+ // S46: difficulty/priority 默认 medium,校验入参合法值
95
+ const difficulty = normalizeDiff(input.difficulty);
96
+ const priority = normalizePrio(input.priority);
97
+ 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)
98
+ VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, 0, ?, ?, ?, ?, NULL)`).run(id, userId, input.parent_id ?? null, input.title, input.est_minutes ?? null, difficulty, priority, now, now);
86
99
  const row = getTaskRow(id);
87
100
  return {
88
101
  ...rowToTask(row),
@@ -142,6 +155,15 @@ export function createTaskTools(db) {
142
155
  sets.push("status = ?");
143
156
  params.push(patch.status);
144
157
  }
158
+ // S46: difficulty/priority 可独立更新
159
+ if (patch.difficulty !== undefined) {
160
+ sets.push("difficulty = ?");
161
+ params.push(normalizeDiff(patch.difficulty));
162
+ }
163
+ if (patch.priority !== undefined) {
164
+ sets.push("priority = ?");
165
+ params.push(normalizePrio(patch.priority));
166
+ }
145
167
  // Always refresh updated_at
146
168
  sets.push("updated_at = ?");
147
169
  params.push(nowStr());
@@ -168,6 +190,32 @@ export function createTaskTools(db) {
168
190
  const row = getTaskRow(taskId);
169
191
  return rowToTask(row);
170
192
  },
193
+ /** S46: 仅更新 difficulty/priority(用户主动调整) */
194
+ async updateDifficulty(taskId, patch) {
195
+ const existing = getTaskRow(taskId);
196
+ if (!existing) {
197
+ throw new Error("任务不存在");
198
+ }
199
+ if (patch.difficulty === undefined && patch.priority === undefined) {
200
+ throw new Error("至少传一个字段 difficulty 或 priority");
201
+ }
202
+ const sets = [];
203
+ const params = [];
204
+ if (patch.difficulty !== undefined) {
205
+ sets.push("difficulty = ?");
206
+ params.push(normalizeDiff(patch.difficulty));
207
+ }
208
+ if (patch.priority !== undefined) {
209
+ sets.push("priority = ?");
210
+ params.push(normalizePrio(patch.priority));
211
+ }
212
+ sets.push("updated_at = ?");
213
+ params.push(nowStr());
214
+ params.push(taskId);
215
+ db.prepare(`UPDATE tasks SET ${sets.join(", ")} WHERE id = ?`).run(...params);
216
+ const row = getTaskRow(taskId);
217
+ return rowToTask(row);
218
+ },
171
219
  async findPlan(input) {
172
220
  // exact-match a startable root task (aligned/executing) by title
173
221
  const rootRow = db
@@ -241,13 +289,13 @@ export function createTaskTools(db) {
241
289
  const result = db.transaction(() => {
242
290
  const rootId = crypto.randomUUID();
243
291
  const now = nowStr();
244
- 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)
245
- VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, NULL, 0, ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, now, now);
292
+ 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)
293
+ VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, NULL, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, now, now);
246
294
  const children = plan.children.map((c, i) => {
247
295
  const childId = crypto.randomUUID();
248
296
  const cnow = nowStr();
249
- 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)
250
- VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
297
+ 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)
298
+ VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
251
299
  return rowToTask(getTaskRow(childId));
252
300
  });
253
301
  return { root: rowToTask(getTaskRow(rootId)), children };
@@ -334,13 +382,13 @@ export function createTaskTools(db) {
334
382
  const result = db.transaction(() => {
335
383
  const rootId = crypto.randomUUID();
336
384
  const now = nowStr();
337
- 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)
338
- VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, ?, 0, ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, plan.timeblock_id, now, now);
385
+ 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)
386
+ VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, ?, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, plan.timeblock_id, now, now);
339
387
  const children = plan.children.map((c, i) => {
340
388
  const childId = crypto.randomUUID();
341
389
  const cnow = nowStr();
342
- 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)
343
- VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
390
+ 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)
391
+ VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
344
392
  return {
345
393
  id: childId,
346
394
  title: c.title,
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "libero-mcp",
3
- "version": "0.2.18",
3
+ "version": "0.2.19",
4
4
  "description": "AI 时间管理教练 MCP 工具集——时间块记录、统计、矩阵诊断、计时、分类、profile",
5
5
  "license": "MIT",
6
6
  "author": "amosyuan",