thincoder 0.12.45 → 0.12.47

package/CHANGELOG.md

@@ -2,6 +2,19 @@
 
 本文件记录 ThinCoder CLI 的发布历史。格式基于 [Keep a Changelog](https://keepachangelog.com/zh-CN/1.0.0/)，版本遵循[语义化版本](https://semver.org/lang/zh-CN/)。
 
+## [0.12.47] — 2026-08-28
+
+### Added
+
+- **GLM-5.3-Flash 模型支持**：智谱 2026-08-26 发布的原生多模态 Flash 档位模型——1M 上下文 + 128K 输出 + 文本/图片输入，`/model glm:glm-5.3-flash` 即可选用（不改默认预设）
+
+## [0.12.46] — 2026-08-27
+
+### Fixed
+
+- **checklist 工具坐标系断裂**：`add` 返回任务 ID、`mark` 却只收列表位置 index，agent 拿 ID 定位不到条目、只能猜 index——误标无关条目（线上事故）。修复：`mark` 加 `id` 参数（优先于 index）；auto-ID 按「最大根号+1」分配（含 `checklist-done.md` 双文件扫描，归档 ID 恒占位不复用）；历史重复 `T[\d.]+:` 前缀读入即归一；标记父任务 done 时子任务非全 done 则拒绝（防静默丢弃子树），全 done 则递归归档整棵子树
+- **子 agent/advisor 模型显示补录**（TUI.md 文档欠账，功能此前已实现）
+
 ## [0.12.45] — 2026-08-26
 
 ### Fixed

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "thincoder",
-  "version": "0.12.45",
+  "version": "0.12.47",
   "description": "Thin coding agent - zero dependencies, no build step, Node.js native. Sharp code, zero bloat.",
   "keywords": [
     "ai",
@@ -32,7 +32,7 @@
   },
   "scripts": {
     "test": "node --test \"test/*.mjs\"",
-    "prepublishOnly": "node --test \"test/*.mjs\"",
+    "prepublishOnly": "npm run lint && node --test \"test/*.mjs\"",
     "lint": "eslint src"
   },
   "author": "liwei <liwei@51marine.com> (上海新舶)",

package/src/config.mjs

@@ -108,6 +108,7 @@ const MODEL_SPECS = [
   // GLM-5.3: thinking always-on (no "disabled"); effort converges to low/high/max — NOT the
   //          7-level glm-5.2 enum (verified vs docs.bigmodel.cn GLM-5.3 page, 2026-08)
   ["glm-5.3",           { context: 1_000_000, maxOutput: 128_000, thinking: true,  cacheMode: "auto", thinkApi: "type", reasoningEcho: "optional", reasoningEffortEnum: ["low", "high", "max"], tempRange: [0, 1], noUsageStream: true }],
+  ["glm-5.3-flash",     { context: 1_000_000, maxOutput: 128_000, thinking: true, multimodal: true, cacheMode: "auto", thinkApi: "type", reasoningEcho: "optional", reasoningEffortEnum: ["low", "high", "max"], tempRange: [0, 1], noUsageStream: true }],
   ["glm-5.2",           { context: 1_000_000, maxOutput: 128_000, thinking: true,  cacheMode: "auto", thinkApi: "type", reasoningEcho: "optional", reasoningEffortEnum: ["max", "xhigh", "high", "medium", "low", "minimal", "none"], tempRange: [0, 1], noUsageStream: true }],
   ["glm-5",             { context: 1_000_000, maxOutput: 128_000, thinking: true,  cacheMode: "auto", thinkApi: "type", reasoningEcho: "optional", reasoningEffortEnum: ["max", "xhigh", "high", "medium", "low", "minimal", "none"], tempRange: [0, 1], noUsageStream: true }],
   ["glm-4",             { context: 128_000,   maxOutput: 32_000,  thinking: true,  cacheMode: "auto", thinkApi: "type", reasoningEcho: "optional", tempRange: [0, 1], noUsageStream: true }],

package/src/tools/checklist.md

@@ -4,7 +4,10 @@ Items support tree hierarchy via indentation (2 spaces per level) and auto-assig
 
 Parameters:
 - action: "add" | "mark" | "list"
+- id: task ID to mark, e.g. "T3" (with "mark"; preferred — use the ID returned by `add`, or from `list`)
 - item: text for new item (with "add")
-- index: 1-based index (with "mark")  
+- index: 1-based index (with "mark"; fallback — use only when you have no ID)
 - status: "pending" | "in_progress" | "done" (with "mark")
 - parent: parent task ID for hierarchical tasks, e.g. "T1" (with "add")
+
+Note: marking a parent "done" requires all its child tasks already done — otherwise it is rejected (complete the children before marking the parent done).

package/src/tools/checklist.mjs

@@ -31,42 +31,79 @@ function parse(filePath) {
     const status = raw === "x" ? "done" : raw === "~" ? "in_progress" : "pending"
     const text = m[3].trim()
 
-    // Extract explicit ID if present (e.g. "T1:", "T1.1:") — strip it from the text
-    // so write() doesn't re-prepend it (round-trip would otherwise accumulate "T1: T1: ...")
-    const idMatch = text.match(/^(T[\d.]+):\s*/)
-    const node = {
-      id: idMatch ? idMatch[1] : null,
-      index: flatIdx,
-      depth,
-      status,
-      text: idMatch ? text.slice(idMatch[0].length) : text,
-      children: [],
+    // Strip ALL leading "T[\d.]+:" tokens (historical dirty data can accumulate
+    // "T15: T15: T15:"); keep the first token as the ID and the rest as text.
+    let id = null
+    let bareText = text
+    let idTok
+    while ((idTok = bareText.match(/^(T[\d.]+):\s*/))) {
+      if (id == null) id = idTok[1]
+      bareText = bareText.slice(idTok[0].length)
     }
+    const node = { id, index: flatIdx, depth, status, text: bareText, children: [] }
 
     // Find parent by popping stack until we find a node at depth-1
     while (stack.length > 1 && stack.at(-1).depth >= depth) stack.pop()
     const parent = stack.at(-1)
     parent.children.push(node)
-    // Auto-assign ID if not explicit
-    if (!node.id) {
-      const siblingCount = parent.children.length
-      const base = parent.id ? `${parent.id}` : "T"
-      if (parent.id) {
-        node.id = `${base}.${siblingCount}`
-      } else {
-        // Root level: T1, T2, T3...
-        let rootIdx = 0
-        for (const c of items) {
-          if (c.id?.match(/^T\d+$/)) rootIdx = Math.max(rootIdx, parseInt(c.id.slice(1)))
-        }
-        node.id = `T${rootIdx + 1}`
+    stack.push({ children: node.children, depth, id: node.id })
+  }
+
+  // Assign stable IDs to lines that lacked an explicit one, exactly once.
+  // IDs are "max existing number + 1" (not position-based) so gaps left by
+  // archived items never collide, and persisted IDs never drift on re-read.
+  let assigned = false
+  function assignIds(nodes, parentId) {
+    for (const n of nodes) {
+      if (!n.id) {
+        n.id = parentId ? nextChildId(parentId, nodes) : nextRootId(nodes, doneRoots)
+        assigned = true
       }
+      if (n.children?.length) assignIds(n.children, n.id)
     }
-    stack.push({ children: node.children, depth, id: node.id })
   }
+  // Root IDs archived to the done file also reserve numbers (mirrors the `add`
+  // path's double-file scan), so auto-assigned IDs never collide with them.
+  const doneRoots = readDoneRoots(join(dirname(filePath), DONE))
+  assignIds(items, null)
+  if (assigned) write(filePath, items)
+
   return items
 }
 
+function readDoneRoots(doneFile) {
+  if (!existsSync(doneFile)) return []
+  const roots = []
+  for (const line of readFileSync(doneFile, "utf-8").split("\n")) {
+    const m = line.match(/^- \[.\] (T\d+): /)
+    if (m) roots.push({ id: m[1] })
+  }
+  return roots
+}
+
+function nextRootId(items, doneItems) {
+  let max = 0
+  for (const list of [items, doneItems]) {
+    for (const c of list ?? []) {
+      const m = c.id?.match(/^T(\d+)$/)
+      if (m) max = Math.max(max, parseInt(m[1]))
+    }
+  }
+  return `T${max + 1}`
+}
+
+function nextChildId(parentId, children) {
+  let max = 0
+  const prefix = `${parentId}.`
+  for (const c of children) {
+    if (c.id?.startsWith(prefix)) {
+      const suffix = c.id.slice(prefix.length)
+      if (/^\d+$/.test(suffix)) max = Math.max(max, parseInt(suffix))
+    }
+  }
+  return `${prefix}${max + 1}`
+}
+
 /** Write items back to file, preserving tree structure */
 function write(filePath, items, _depth = 0) {
   if (_depth === 0) mkdirSync(dirname(filePath), { recursive: true })
@@ -108,6 +145,26 @@ function flatten(items, out = []) {
   return out
 }
 
+/** True if every descendant (children, grandchildren, …) is done. */
+function allChildrenDone(node) {
+  for (const c of node.children ?? []) {
+    if (c.status !== "done" || !allChildrenDone(c)) return false
+  }
+  return true
+}
+
+/** Recursively clone a subtree for archiving, forcing every status to done. */
+function archiveSubtree(node) {
+  return {
+    id: node.id,
+    index: 0,
+    depth: 0,
+    status: "done",
+    text: node.text,
+    children: (node.children ?? []).map(archiveSubtree),
+  }
+}
+
 /** Parse pending items only (for context injection) */
 export function pendingItems(cwd) {
   const flat = flatten(parse(checklistPath(cwd)))
@@ -125,13 +182,17 @@ export const checklistTool = {
         enum: ["add", "mark", "list"],
         description: "add a new item / mark item status / list all items"
       },
+      id: {
+        type: "string",
+        description: "Task ID to mark (preferred — use the ID returned by add, e.g. 'T3')"
+      },
       item: {
         type: "string",
         description: "Item text (required for add)"
       },
       index: {
         type: "number",
-        description: "1-based item index (required for mark)"
+        description: "1-based item index (fallback for mark, only when id is absent)"
       },
       status: {
         type: "string",
@@ -161,48 +222,46 @@ export const checklistTool = {
           parentId = found.item.id
         }
 
-        // Auto-assign ID
-        let id
-        if (parentId) {
-          id = `${parentId}.${target.length + 1}`
-        } else {
-          let maxIdx = 0
-          for (const c of items) {
-            const m = c.id?.match(/^T(\d+)$/)
-            if (m) maxIdx = Math.max(maxIdx, parseInt(m[1]))
-          }
-          id = `T${maxIdx + 1}`
-        }
-
+        const id = parentId ? nextChildId(parentId, target) : nextRootId(items, parse(donePath(ctx.cwd)))
         const node = { id, index: 0, depth: parentId ? 1 : 0, status: "pending", text: args.item, children: [] }
         target.push(node)
         write(checklistPath(ctx.cwd), items)
         return `Added: [ ] ${id}: ${args.item}${parentId ? ` (under ${parentId})` : ""}`
       }
       case "mark": {
-        if (args.index == null) return "Error: 'index' is required for mark"
+        if (args.id == null && args.index == null) return "Error: 'id' or 'index' is required for mark"
         const status = args.status
         if (!status || !["pending", "in_progress", "done"].includes(status)) return "Error: 'status' is required (pending|in_progress|done)"
         const cp = checklistPath(ctx.cwd)
         const items = parse(cp)
-        const flat = flatten(items)
-        if (args.index < 1 || args.index > flat.length) return `Error: index ${args.index} out of range (1-${flat.length})`
-        const item = flat[args.index - 1]
+        let item
+        if (args.id != null) {
+          const found = findById(items, args.id)
+          if (!found) return `Error: id '${args.id}' not found. Use 'list' to see all task IDs.`
+          item = found.item
+        } else {
+          const flat = flatten(items)
+          if (args.index < 1 || args.index > flat.length) return `Error: index ${args.index} out of range (1-${flat.length})`
+          item = flat[args.index - 1]
+        }
         const old = item.status
         if (old === status) return `Already ${status}: ${item.text}`
+        if (status === "done" && item.children?.length && !allChildrenDone(item)) {
+          return "Error: 父任务仍有未完成的子任务，先处理子任务再标父 done"
+        }
         item.status = status
         if (status === "done") {
-          // Move to done file
+          // Move the whole subtree to the done file (hierarchy preserved).
           const dp = donePath(ctx.cwd)
           const doneItems = parse(dp)
-          doneItems.push({ id: item.id, index: 0, depth: 0, status: "done", text: item.text, children: [] })
+          doneItems.push(archiveSubtree(item))
           write(dp, doneItems)
-          // Remove from tree
+          // Remove the subtree from the tree.
           const found = findById(items, item.id)
           if (found) found.parent.splice(found.idx, 1)
         }
         write(cp, items)
-        return `Marked #${args.index} ${old} → ${status}: ${item.id}: ${item.text}`
+        return `Marked ${item.id} ${old} → ${status}`
       }
       case "list": {
         const items = parse(checklistPath(ctx.cwd))

package/src/tools/read_image.md

@@ -1,8 +1,8 @@
-Read an image file and return it as multimodal content visible to the model. Use this to view screenshots, UI mockups, diagrams, or any visual content. The model only sees images through this tool — it cannot "see" files directly. Supports png, jpg, gif, webp. The image is base64-encoded and included in the response. Large images (>20MB) are rejected.
+Read an image file and return it as multimodal content visible to the model. Use this to view screenshots, UI mockups, diagrams, or any visual content. The model only sees images through this tool — it cannot "see" files directly. Supports png, jpg, gif, webp. The image is base64-encoded and included in the response. Large images (>15MB) are rejected.
 
 Parameters:
 - path (required): Path to image file (relative to cwd or absolute). Supports png, jpg, gif, webp; svg is returned as text source.
 
 Notes:
 - Raster formats only (png/jpg/gif/webp): no mainstream vision API (Kimi, Anthropic, OpenAI, Gemini) accepts svg or bmp, and an unsupported image part in history makes every subsequent request fail with 400. svg files are returned as text source instead (readable by any model); bmp is rejected — convert to PNG first.
-- This tool only works with models that support vision/image input (Kimi K3, Qwen3.7, MiniMax M3). Pure text models (DeepSeek V4, GLM-5) will receive an error — except svg, which needs no vision support since it is read as text.
+- This tool only works with models that support vision/image input (Kimi K3, Qwen3.8, MiniMax M3, GLM-5.3-Flash). Pure text models (DeepSeek V4, GLM-5) will receive an error — except svg, which needs no vision support since it is read as text.