فهرست منبع

fix: align docs and make status reporter data-driven

lingfengQAQ 4 ماه پیش
والد
کامیت
5a4ba761a0
7فایلهای تغییر یافته به همراه1253 افزوده شده و 136 حذف شده
  1. 162 0
      .claude/scripts/data_modules/tests/test_status_reporter.py
  2. 1 1
      .claude/scripts/requirements.txt
  3. 330 114
      .claude/scripts/status_reporter.py
  4. 22 1
      .gitignore
  5. 13 1
      CLAUDE.md
  6. 674 0
      LICENSE
  7. 51 19
      README.md

+ 162 - 0
.claude/scripts/data_modules/tests/test_status_reporter.py

@@ -0,0 +1,162 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+import json
+import tempfile
+
+from data_modules.config import DataModulesConfig
+from data_modules.index_manager import IndexManager, ChapterReadingPowerMeta
+from status_reporter import StatusReporter
+
+
+def _write_state(project_root, state: dict):
+    webnovel_dir = project_root / ".webnovel"
+    webnovel_dir.mkdir(parents=True, exist_ok=True)
+    (webnovel_dir / "state.json").write_text(
+        json.dumps(state, ensure_ascii=False, indent=2),
+        encoding="utf-8",
+    )
+
+
+def test_foreshadowing_analysis_uses_real_chapters_and_handles_missing_data():
+    with tempfile.TemporaryDirectory() as tmpdir:
+        project_root = DataModulesConfig.from_project_root(tmpdir).project_root
+
+        state = {
+            "progress": {"current_chapter": 120, "total_words": 360000},
+            "plot_threads": {
+                "foreshadowing": [
+                    {
+                        "content": "林家宝库铭文的秘密",
+                        "status": "未回收",
+                        "tier": "核心",
+                        "planted_chapter": 20,
+                        "target_chapter": 100,
+                    },
+                    {
+                        "content": "神秘玉佩来历",
+                        "status": "待回收",
+                        "tier": "支线",
+                        "added_chapter": 50,
+                        "target": 150,
+                    },
+                    {
+                        "content": "旧日誓言",
+                        "status": "未回收",
+                        "tier": "装饰",
+                    },
+                    {
+                        "content": "已完成伏笔",
+                        "status": "已回收",
+                        "planted_chapter": 10,
+                        "target_chapter": 20,
+                    },
+                ]
+            },
+        }
+        _write_state(project_root, state)
+
+        reporter = StatusReporter(str(project_root))
+        assert reporter.load_state() is True
+
+        foreshadowing = reporter.analyze_foreshadowing()
+        assert len(foreshadowing) == 3
+
+        records = {item["content"]: item for item in foreshadowing}
+        assert records["林家宝库铭文的秘密"]["planted_chapter"] == 20
+        assert records["林家宝库铭文的秘密"]["elapsed"] == 100
+        assert records["林家宝库铭文的秘密"]["status"] == "🔴 已超期"
+
+        assert records["神秘玉佩来历"]["planted_chapter"] == 50
+        assert records["神秘玉佩来历"]["target_chapter"] == 150
+        assert records["神秘玉佩来历"]["status"] in {"🟡 轻度超时", "🟢 正常"}
+
+        assert records["旧日誓言"]["planted_chapter"] is None
+        assert records["旧日誓言"]["status"] == "⚪ 数据不足"
+
+        urgency = reporter.analyze_foreshadowing_urgency()
+        urgency_by_content = {item["content"]: item for item in urgency}
+
+        assert urgency_by_content["林家宝库铭文的秘密"]["urgency"] is not None
+        assert urgency_by_content["林家宝库铭文的秘密"]["status"] == "🔴 已超期"
+        assert urgency_by_content["旧日誓言"]["urgency"] is None
+        assert urgency_by_content["旧日誓言"]["status"] == "⚪ 数据不足"
+
+
+def test_pacing_analysis_prefers_real_coolpoint_metadata_over_estimation():
+    with tempfile.TemporaryDirectory() as tmpdir:
+        config = DataModulesConfig.from_project_root(tmpdir)
+        config.ensure_dirs()
+        project_root = config.project_root
+
+        state = {
+            "progress": {"current_chapter": 3, "total_words": 12000},
+            "chapter_meta": {
+                "0003": {
+                    "hook": "下章有变",
+                    "coolpoint_patterns": ["身份掉马", "反派翻车"],
+                }
+            },
+        }
+        _write_state(project_root, state)
+
+        idx = IndexManager(config)
+        idx.save_chapter_reading_power(
+            ChapterReadingPowerMeta(
+                chapter=1,
+                hook_type="渴望钩",
+                hook_strength="strong",
+                coolpoint_patterns=["打脸权威", "身份掉马"],
+            )
+        )
+        idx.save_chapter_reading_power(
+            ChapterReadingPowerMeta(
+                chapter=2,
+                hook_type="悬念钩",
+                hook_strength="medium",
+                coolpoint_patterns=["身份掉马"],
+            )
+        )
+
+        reporter = StatusReporter(str(project_root))
+        assert reporter.load_state() is True
+        reporter.chapters_data = [
+            {"chapter": 1, "word_count": 4000, "cool_point": "", "dominant": "", "characters": []},
+            {"chapter": 2, "word_count": 3000, "cool_point": "", "dominant": "", "characters": []},
+            {"chapter": 3, "word_count": 5000, "cool_point": "", "dominant": "", "characters": []},
+        ]
+
+        segments = reporter.analyze_pacing()
+        assert len(segments) == 1
+
+        seg = segments[0]
+        assert seg["cool_points"] == 5
+        assert round(seg["words_per_point"], 2) == 2400.00
+        assert seg["missing_chapters"] == 0
+        assert seg["dominant_source"] == "chapter_reading_power"
+
+
+def test_pacing_analysis_marks_missing_data_instead_of_assuming_one_point_per_chapter():
+    with tempfile.TemporaryDirectory() as tmpdir:
+        config = DataModulesConfig.from_project_root(tmpdir)
+        config.ensure_dirs()
+        project_root = config.project_root
+
+        state = {
+            "progress": {"current_chapter": 1, "total_words": 2000},
+            "chapter_meta": {},
+        }
+        _write_state(project_root, state)
+
+        reporter = StatusReporter(str(project_root))
+        assert reporter.load_state() is True
+        reporter.chapters_data = [
+            {"chapter": 1, "word_count": 2000, "cool_point": "", "dominant": "", "characters": []}
+        ]
+
+        seg = reporter.analyze_pacing()[0]
+        assert seg["cool_points"] == 0
+        assert seg["words_per_point"] is None
+        assert seg["rating"] == "数据不足"
+        assert seg["missing_chapters"] == 1
+

+ 1 - 1
.claude/scripts/requirements.txt

@@ -1,5 +1,5 @@
 # Webnovel Writer - Python Dependencies
-# Python >= 3.8 required
+# Python >= 3.10 required
 
 # 核心依赖
 aiohttp>=3.8.0          # 异步 HTTP 客户端(API 调用)

+ 330 - 114
.claude/scripts/status_reporter.py

@@ -83,7 +83,7 @@ import os
 import re
 import sys
 from pathlib import Path
-from typing import Dict, List, Any, Tuple
+from typing import Dict, List, Any, Tuple, Optional
 from datetime import datetime
 from collections import defaultdict
 from project_locator import resolve_project_root
@@ -115,11 +115,25 @@ def _is_resolved_foreshadowing_status(raw_status: Any) -> bool:
         return True
     return False
 
-# Windows 编码兼容性修复
-if sys.platform == 'win32':
-    import io
-    sys.stdout = io.TextIOWrapper(sys.stdout.buffer, encoding='utf-8')
-    sys.stderr = io.TextIOWrapper(sys.stderr.buffer, encoding='utf-8')
+def _enable_windows_utf8_stdio() -> None:
+    """在 Windows 下启用 UTF-8 输出;pytest 环境跳过以避免捕获冲突。"""
+    if sys.platform != "win32":
+        return
+    if os.environ.get("PYTEST_CURRENT_TEST"):
+        return
+
+    try:
+        import io
+
+        stdout_buffer = getattr(sys.stdout, "buffer", None)
+        stderr_buffer = getattr(sys.stderr, "buffer", None)
+        if stdout_buffer is not None:
+            sys.stdout = io.TextIOWrapper(stdout_buffer, encoding="utf-8")
+        if stderr_buffer is not None:
+            sys.stderr = io.TextIOWrapper(stderr_buffer, encoding="utf-8")
+    except Exception:
+        pass
+
 
 class StatusReporter:
     """状态报告生成器"""
@@ -132,6 +146,7 @@ class StatusReporter:
 
         self.state = None
         self.chapters_data = []
+        self._reading_power_cache: Dict[int, Optional[Dict[str, Any]]] = {}
 
         # v5.1 引入: 使用 IndexManager 读取实体
         self._index_manager = IndexManager(self.config)
@@ -159,6 +174,206 @@ class StatusReporter:
 
         return True
 
+    def _to_positive_int(self, value: Any) -> Optional[int]:
+        """将输入解析为正整数;解析失败返回 None。"""
+        if value is None or isinstance(value, bool):
+            return None
+
+        try:
+            number = int(value)
+            return number if number > 0 else None
+        except (TypeError, ValueError):
+            if isinstance(value, str):
+                match = re.search(r"\d+", value)
+                if match:
+                    number = int(match.group(0))
+                    return number if number > 0 else None
+        return None
+
+    def _normalize_foreshadowing_tier(self, raw_tier: Any) -> Tuple[str, float]:
+        """标准化伏笔层级并返回对应权重。"""
+        text = str(raw_tier or "").strip()
+        lower = text.lower()
+
+        if text in {"核心", "主线"} or lower in {"core", "main"}:
+            return "核心", self.config.foreshadowing_tier_weight_core
+        if text in {"装饰", "次要"} or lower in {"decor", "decoration"}:
+            return "装饰", self.config.foreshadowing_tier_weight_decor
+        return "支线", self.config.foreshadowing_tier_weight_sub
+
+    def _resolve_chapter_field(self, item: Dict[str, Any], keys: List[str]) -> Optional[int]:
+        """按候选键顺序读取章节号。"""
+        for key in keys:
+            if key in item:
+                chapter = self._to_positive_int(item.get(key))
+                if chapter is not None:
+                    return chapter
+        return None
+
+    def _collect_foreshadowing_records(self) -> List[Dict[str, Any]]:
+        """收集未回收伏笔,并基于真实字段构建分析记录。"""
+        if not self.state:
+            return []
+
+        current_chapter = self.state.get("progress", {}).get("current_chapter", 0)
+        plot_threads = self.state.get("plot_threads", {}) if isinstance(self.state.get("plot_threads"), dict) else {}
+        foreshadowing = plot_threads.get("foreshadowing", [])
+        if not isinstance(foreshadowing, list):
+            return []
+
+        records: List[Dict[str, Any]] = []
+        for item in foreshadowing:
+            if not isinstance(item, dict):
+                continue
+            if _is_resolved_foreshadowing_status(item.get("status")):
+                continue
+
+            content = str(item.get("content") or "").strip() or "[未命名伏笔]"
+            tier, weight = self._normalize_foreshadowing_tier(item.get("tier"))
+
+            planted_chapter = self._resolve_chapter_field(
+                item,
+                [
+                    "planted_chapter",
+                    "added_chapter",
+                    "source_chapter",
+                    "start_chapter",
+                    "chapter",
+                ],
+            )
+            target_chapter = self._resolve_chapter_field(
+                item,
+                [
+                    "target_chapter",
+                    "due_chapter",
+                    "deadline_chapter",
+                    "resolve_by_chapter",
+                    "target",
+                ],
+            )
+
+            elapsed = None
+            if planted_chapter is not None:
+                elapsed = max(0, current_chapter - planted_chapter)
+
+            remaining = None
+            if target_chapter is not None:
+                remaining = target_chapter - current_chapter
+
+            if remaining is not None and remaining < 0:
+                overtime_status = "🔴 已超期"
+            elif elapsed is None:
+                overtime_status = "⚪ 数据不足"
+            else:
+                overtime_status = self._get_foreshadowing_status(elapsed)
+
+            urgency: Optional[float] = None
+            if (
+                planted_chapter is not None
+                and target_chapter is not None
+                and target_chapter > planted_chapter
+                and elapsed is not None
+            ):
+                urgency = round((elapsed / (target_chapter - planted_chapter)) * weight, 2)
+            elif (
+                planted_chapter is not None
+                and target_chapter is not None
+                and target_chapter <= planted_chapter
+                and elapsed is not None
+            ):
+                urgency = round(weight * 2.0, 2)
+
+            if remaining is not None and remaining < 0:
+                urgency_status = "🔴 已超期"
+            elif urgency is None:
+                urgency_status = "⚪ 数据不足"
+            else:
+                urgency_status = self._get_urgency_status(urgency, remaining if remaining is not None else 0)
+
+            records.append(
+                {
+                    "content": content,
+                    "tier": tier,
+                    "weight": weight,
+                    "planted_chapter": planted_chapter,
+                    "target_chapter": target_chapter,
+                    "elapsed": elapsed,
+                    "remaining": remaining,
+                    "status": overtime_status,
+                    "urgency": urgency,
+                    "urgency_status": urgency_status,
+                }
+            )
+
+        return records
+
+    def _get_chapter_meta(self, chapter: int) -> Dict[str, Any]:
+        """读取指定章节的 chapter_meta(支持 0001/1 两种键)。"""
+        if not self.state:
+            return {}
+        chapter_meta = self.state.get("chapter_meta", {})
+        if not isinstance(chapter_meta, dict):
+            return {}
+
+        for key in (f"{chapter:04d}", str(chapter)):
+            value = chapter_meta.get(key)
+            if isinstance(value, dict):
+                return value
+        return {}
+
+    def _parse_pattern_count(self, raw_value: Any) -> Optional[int]:
+        """解析爽点模式数量,解析失败返回 None。"""
+        if raw_value is None:
+            return None
+
+        if isinstance(raw_value, list):
+            patterns = [str(x).strip() for x in raw_value if str(x).strip()]
+            return len(set(patterns))
+
+        if isinstance(raw_value, str):
+            text = raw_value.strip()
+            if not text:
+                return None
+            parts = [p.strip() for p in re.split(r"[、,,/|+;;]+", text) if p.strip()]
+            if parts:
+                return len(set(parts))
+            return 1
+
+        return None
+
+    def _get_chapter_reading_power_cached(self, chapter: int) -> Optional[Dict[str, Any]]:
+        """读取并缓存 chapter_reading_power。"""
+        if chapter in self._reading_power_cache:
+            return self._reading_power_cache[chapter]
+
+        try:
+            record = self._index_manager.get_chapter_reading_power(chapter)
+        except Exception:
+            record = None
+
+        self._reading_power_cache[chapter] = record
+        return record
+
+    def _get_chapter_cool_points(self, chapter: int, chapter_data: Dict[str, Any]) -> Tuple[Optional[int], str]:
+        """获取单章爽点数量(真实元数据优先)。"""
+        reading_power = self._get_chapter_reading_power_cached(chapter)
+        if isinstance(reading_power, dict):
+            count = self._parse_pattern_count(reading_power.get("coolpoint_patterns"))
+            if count is not None:
+                return count, "chapter_reading_power"
+
+        chapter_meta = self._get_chapter_meta(chapter)
+        for key in ("coolpoint_patterns", "coolpoint_pattern", "cool_point_patterns", "cool_point_pattern", "patterns", "pattern"):
+            count = self._parse_pattern_count(chapter_meta.get(key))
+            if count is not None:
+                return count, "chapter_meta"
+
+        count = self._parse_pattern_count(chapter_data.get("cool_point"))
+        if count is not None:
+            return count, "chapter_stats"
+
+        return None, "none"
+
     def scan_chapters(self):
         """扫描所有章节文件"""
         if not self.chapters_dir.exists():
@@ -302,42 +517,18 @@ class StatusReporter:
 
     def analyze_foreshadowing(self) -> List[Dict]:
         """分析伏笔深度"""
-        if not self.state:
-            return []
-
-        current_chapter = self.state.get("progress", {}).get("current_chapter", 0)
-        plot_threads = self.state.get("plot_threads", {})
-        foreshadowing = plot_threads.get("foreshadowing", [])
-
-        overdue = []
-
-        for item in foreshadowing:
-            status = item.get("status")
-            if _is_resolved_foreshadowing_status(status):
-                continue
-
-            # 假设每个伏笔记录了"added_chapter"(埋设章节)
-            # 如果没有,使用 added_at 日期估算(粗略)
-            # 这里简化:假设第 1 章开始,平均每天写 1 章
-
-            # 简化:假设伏笔按添加顺序,第 N 个伏笔大约在第 N*10 章埋下
-            # 实际项目应该在伏笔记录中加入 "埋设章节号" 字段
-
-            # 这里使用 content 中的关键词匹配(极度简化)
-            content = item.get("content", "")
-
-            # 假设伏笔平均埋设时间 = 当前章节的一半(极度粗糙估算)
-            estimated_chapter = current_chapter // 2
-            elapsed = current_chapter - estimated_chapter
-
-            overdue.append({
-                "content": content,
-                "estimated_chapter": estimated_chapter,
-                "elapsed": elapsed,
-                "status": self._get_foreshadowing_status(elapsed)
-            })
-
-        return overdue
+        records = self._collect_foreshadowing_records()
+        return [
+            {
+                "content": item["content"],
+                "planted_chapter": item["planted_chapter"],
+                "estimated_chapter": item["planted_chapter"],
+                "target_chapter": item["target_chapter"],
+                "elapsed": item["elapsed"],
+                "status": item["status"],
+            }
+            for item in records
+        ]
 
     def _get_foreshadowing_status(self, elapsed: int) -> str:
         """判断伏笔超时状态"""
@@ -360,58 +551,27 @@ class StatusReporter:
         紧急度计算公式:
         urgency = (已过章节 / 目标回收章节) × 层级权重
         """
-        if not self.state:
-            return []
-
-        current_chapter = self.state.get("progress", {}).get("current_chapter", 0)
-        plot_threads = self.state.get("plot_threads", {})
-        foreshadowing = plot_threads.get("foreshadowing", [])
-
-        # 层级权重映射
-        tier_weights = {
-            "核心": self.config.foreshadowing_tier_weight_core,
-            "core": self.config.foreshadowing_tier_weight_core,
-            "支线": self.config.foreshadowing_tier_weight_sub,
-            "sub": self.config.foreshadowing_tier_weight_sub,
-            "装饰": self.config.foreshadowing_tier_weight_decor,
-            "decor": self.config.foreshadowing_tier_weight_decor
-        }
-
-        urgency_list = []
-
-        for item in foreshadowing:
-            if _is_resolved_foreshadowing_status(item.get("status")):
-                continue
-
-            content = item.get("content", "")
-            tier = item.get("tier", "支线")  # 默认支线
-            planted_chapter = item.get("planted_chapter", 1)
-            target_chapter = item.get("target_chapter", planted_chapter + 100)
-
-            weight = tier_weights.get(tier.lower(), self.config.foreshadowing_tier_weight_sub)
-            elapsed = current_chapter - planted_chapter
-            remaining = target_chapter - current_chapter
-
-            # 紧急度计算
-            if target_chapter > planted_chapter:
-                urgency = (elapsed / (target_chapter - planted_chapter)) * weight
-            else:
-                urgency = weight * 2  # 已超期
-
-            urgency_list.append({
-                "content": content,
-                "tier": tier,
-                "weight": weight,
-                "planted_chapter": planted_chapter,
-                "target_chapter": target_chapter,
-                "elapsed": elapsed,
-                "remaining": remaining,
-                "urgency": round(urgency, 2),
-                "status": self._get_urgency_status(urgency, remaining)
-            })
+        records = self._collect_foreshadowing_records()
+        urgency_list = [
+            {
+                "content": item["content"],
+                "tier": item["tier"],
+                "weight": item["weight"],
+                "planted_chapter": item["planted_chapter"],
+                "target_chapter": item["target_chapter"],
+                "elapsed": item["elapsed"],
+                "remaining": item["remaining"],
+                "urgency": item["urgency"],
+                "status": item["urgency_status"],
+            }
+            for item in records
+        ]
 
-        # 按紧急度排序(降序)
-        return sorted(urgency_list, key=lambda x: x["urgency"], reverse=True)
+        # 先按“是否可计算”,再按紧急度降序
+        return sorted(
+            urgency_list,
+            key=lambda x: (x["urgency"] is None, -(x["urgency"] if x["urgency"] is not None else -1)),
+        )
 
     def _get_urgency_status(self, urgency: float, remaining: int) -> str:
         """判断紧急度状态"""
@@ -562,25 +722,47 @@ class StatusReporter:
             end_ch = segment_chapters[-1]["chapter"]
             total_words = sum(ch["word_count"] for ch in segment_chapters)
 
-            # 假设爽点数量 = 章节数(简化:每章至少 1 个爽点)
-            # 实际项目应该在审查报告中记录爽点数量
-            assumed_cool_points = len(segment_chapters)
-
-            words_per_point = total_words / assumed_cool_points if assumed_cool_points > 0 else 0
+            cool_points = 0
+            chapters_with_data = 0
+            source_counter: Dict[str, int] = {}
+
+            for chapter_data in segment_chapters:
+                chapter = chapter_data["chapter"]
+                count, source = self._get_chapter_cool_points(chapter, chapter_data)
+                source_counter[source] = source_counter.get(source, 0) + 1
+                if count is None:
+                    continue
+                chapters_with_data += 1
+                cool_points += count
+
+            words_per_point = None
+            if cool_points > 0:
+                words_per_point = total_words / cool_points
+
+            rating = self._get_pacing_rating(words_per_point)
+            missing_chapters = len(segment_chapters) - chapters_with_data
+            dominant_source = "none"
+            if source_counter:
+                dominant_source = max(source_counter.items(), key=lambda x: x[1])[0]
 
             segments.append({
                 "start": start_ch,
                 "end": end_ch,
                 "total_words": total_words,
-                "cool_points": assumed_cool_points,
+                "cool_points": cool_points,
                 "words_per_point": words_per_point,
-                "rating": self._get_pacing_rating(words_per_point)
+                "rating": rating,
+                "missing_chapters": missing_chapters,
+                "data_coverage": (chapters_with_data / len(segment_chapters)) if segment_chapters else 0.0,
+                "dominant_source": dominant_source,
             })
 
         return segments
 
-    def _get_pacing_rating(self, words_per_point: float) -> str:
+    def _get_pacing_rating(self, words_per_point: Optional[float]) -> str:
         """判断节奏评级"""
+        if words_per_point is None:
+            return "数据不足"
         if words_per_point < self.config.pacing_words_per_point_excellent:
             return "优秀"
         elif words_per_point < self.config.pacing_words_per_point_good:
@@ -745,7 +927,10 @@ class StatusReporter:
         overdue = self.analyze_foreshadowing()
 
         # 筛选超时伏笔
-        overdue_items = [item for item in overdue if "超时" in item["status"]]
+        overdue_items = [
+            item for item in overdue if "超时" in item["status"] or "超期" in item["status"]
+        ]
+        unknown_items = [item for item in overdue if item["status"] == "⚪ 数据不足"]
 
         lines = [
             f"## ⚠️ 伏笔超时({len(overdue_items)}条)",
@@ -754,18 +939,24 @@ class StatusReporter:
 
         if overdue_items:
             lines.extend([
-                "| 伏笔内容 | 估计埋设 | 已过章节 | 状态 |",
+                "| 伏笔内容 | 埋设章节 | 已过章节 | 状态 |",
                 "|---------|---------|---------|------|"
             ])
 
-            for item in sorted(overdue_items, key=lambda x: x["elapsed"], reverse=True):
+            for item in sorted(overdue_items, key=lambda x: (x["elapsed"] if x["elapsed"] is not None else -1), reverse=True):
+                planted = item["planted_chapter"] if item["planted_chapter"] is not None else "未知"
+                elapsed = item["elapsed"] if item["elapsed"] is not None else "未知"
                 lines.append(
-                    f"| {item['content'][:30]}... | 第 {item['estimated_chapter']} 章 | "
-                    f"{item['elapsed']} 章 | {item['status']} |"
+                    f"| {item['content'][:30]}... | 第 {planted} 章 | "
+                    f"{elapsed} 章 | {item['status']} |"
                 )
         else:
             lines.append("✅ 所有伏笔进度正常")
 
+        if unknown_items:
+            lines.append("")
+            lines.append(f"⚪ 另有 {len(unknown_items)} 条伏笔缺少章节信息,无法判断是否超时")
+
         lines.extend(["", "---", ""])
 
         return lines
@@ -775,16 +966,25 @@ class StatusReporter:
         urgency_list = self.analyze_foreshadowing_urgency()
 
         # 筛选紧急伏笔
-        urgent_items = [item for item in urgency_list if item["urgency"] >= 1.0]
+        urgent_items = [
+            item
+            for item in urgency_list
+            if (item["urgency"] is not None and item["urgency"] >= 1.0) or item["status"] == "🔴 已超期"
+        ]
 
         lines = [
             f"## 🚨 伏笔紧急度排序({len(urgent_items)}条需关注)",
             "",
             "> 基于三层级系统:核心(×3) / 支线(×2) / 装饰(×1)",
-            "> 紧急度 = (已过章节 / 目标回收章节) × 层级权重",
+            "> 紧急度 = (已过章节 / (目标章节-埋设章节)) × 层级权重",
             ""
         ]
 
+        unknown_items = [item for item in urgency_list if item["urgency"] is None]
+        if unknown_items:
+            lines.append(f"> {len(unknown_items)} 条伏笔缺少埋设/目标章节,紧急度记为 N/A")
+            lines.append("")
+
         if urgency_list:
             lines.extend([
                 "| 伏笔内容 | 层级 | 埋设 | 目标 | 紧急度 | 状态 |",
@@ -792,10 +992,13 @@ class StatusReporter:
             ])
 
             for item in urgency_list[:10]:  # 只显示前10条
+                planted = f"第{item['planted_chapter']}章" if item["planted_chapter"] is not None else "未知"
+                target = f"第{item['target_chapter']}章" if item["target_chapter"] is not None else "未知"
+                urgency_text = f"{item['urgency']:.2f}" if item["urgency"] is not None else "N/A"
                 lines.append(
                     f"| {item['content'][:20]}... | {item['tier']} | "
-                    f"第{item['planted_chapter']}章 | 第{item['target_chapter']}章 | "
-                    f"{item['urgency']:.2f} | {item['status']} |"
+                    f"{planted} | {target} | "
+                    f"{urgency_text} | {item['status']} |"
                 )
         else:
             lines.append("✅ 暂无伏笔数据")
@@ -877,14 +1080,25 @@ class StatusReporter:
         ]
 
         for seg in segments:
-            bar_length = int(12 - (seg["words_per_point"] / 2000 * 12))
-            bar_length = max(1, min(12, bar_length))
+            words_per_point = seg["words_per_point"]
+            if words_per_point is None:
+                lines.append(
+                    f"第 {seg['start']}-{seg['end']}章   ░ 数据不足"
+                    f"(缺少爽点数据 {seg['missing_chapters']} 章)"
+                )
+                continue
 
+            bar_length = int(12 - (words_per_point / 2000 * 12))
+            bar_length = max(1, min(12, bar_length))
             bar = "█" * bar_length
 
+            suffix = ""
+            if seg["missing_chapters"] > 0:
+                suffix = f",缺少爽点数据 {seg['missing_chapters']} 章"
+
             lines.append(
-                f"第 {seg['start']}-{seg['end']}章   {bar} "
-                f"{seg['rating']}({seg['words_per_point']:.0f}字/爽点)"
+                f"第 {seg['start']}-{seg['end']}章   {bar} {seg['rating']}"
+                f"({words_per_point:.0f}字/爽点,记录 {seg['cool_points']} 个爽点{suffix})"
             )
 
         lines.extend(["```", "", "---", ""])
@@ -909,6 +1123,8 @@ class StatusReporter:
 def main():
     import argparse
 
+    _enable_windows_utf8_stdio()
+
     parser = argparse.ArgumentParser(
         description="可视化状态报告生成器",
         formatter_class=argparse.RawDescriptionHelpFormatter,

+ 22 - 1
.gitignore

@@ -1,2 +1,23 @@
 .claude/settings.local.json
-.claude/settings.local.json
+
+# Python caches & virtualenv
+__pycache__/
+*.py[cod]
+.pytest_cache/
+.coverage
+htmlcov/
+.venv/
+venv/
+
+# Local runtime data
+.webnovel/
+
+# OS / editor
+.DS_Store
+Thumbs.db
+.vscode/
+.idea/
+
+# Workspace artifacts
+node_modules/
+nul

+ 13 - 1
CLAUDE.md

@@ -72,7 +72,7 @@
 - **复合题材** - 支持“题材A+题材B”组合加载模板(1主1辅)
 
 ### 2. 工作流更新
-- **webnovel-init Phase 6.5** - 创意约束生成(Standard+模式)
+- **webnovel-init Phase 6.5** - 创意约束生成(Deep 模式)
 - **webnovel-plan Phase 2.5** - 加载创意约束
 - **webnovel-plan Phase 7** - 约束继承检查
 
@@ -100,6 +100,17 @@ Step 6: Git 备份
 
 ## 常用 Python 命令
 
+在项目根目录运行 `python -m data_modules.*` 前,请先确保模块路径可见:
+
+```bash
+# 方式1:先切到脚本目录
+cd .claude/scripts
+
+# 方式2:或在根目录设置 PYTHONPATH
+# Windows PowerShell: $env:PYTHONPATH = ".claude/scripts"
+# macOS/Linux: export PYTHONPATH=".claude/scripts"
+```
+
 ```bash
 # 查询统计
 python -m data_modules.index_manager stats --project-root "."
@@ -135,3 +146,4 @@ python -m data_modules.index_manager get-pattern-usage-stats --last-n 20 --proje
 3. **债务利息默认关闭** - 仅在明确开启时计算
 4. **题材 Profile 可覆盖** - 在 state.json 中设置 genre_overrides
 5. **创意约束需继承** - 大纲规划时检查约束触发频率
+6. **status_reporter 真实数据优先** - 伏笔/爽点分析优先读取 `state.json` 与 `index.db`,缺数据时标记“数据不足”,避免估算误导

+ 674 - 0
LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

+ 51 - 19
README.md

@@ -1,7 +1,7 @@
 # Webnovel Writer
 
 [![License](https://img.shields.io/badge/License-GPL%20v3-blue.svg)](LICENSE)
-[![Python](https://img.shields.io/badge/Python-3.8+-blue.svg)](https://www.python.org/)
+[![Python](https://img.shields.io/badge/Python-3.10+-blue.svg)](https://www.python.org/)
 [![Claude Code](https://img.shields.io/badge/Claude%20Code-Compatible-purple.svg)](https://claude.ai/claude-code)
 
 基于 Claude Code 的长篇网文辅助创作系统,解决 AI 写作中的「遗忘」和「幻觉」问题,支持 **200 万字量级** 连载创作。
@@ -120,7 +120,7 @@
 
 | 依赖 | 版本要求 | 说明 |
 |------|---------|------|
-| Python | >= 3.8 | 数据处理脚本运行环境 |
+| Python | >= 3.10 | 数据处理脚本运行环境 |
 | Claude Code | 最新版 | Anthropic 官方 CLI 工具 |
 | Git | 任意版本 | 版本控制和章节备份 |
 
@@ -137,6 +137,18 @@ git clone https://github.com/lingfengQAQ/webnovel-writer.git .claude
 pip install -r .claude/scripts/requirements.txt
 ```
 
+可选(推荐):设置 `data_modules` 模块路径,便于在项目根目录直接执行 `python -m data_modules.*`。
+
+```powershell
+# Windows PowerShell
+$env:PYTHONPATH = ".claude/scripts"
+```
+
+```bash
+# macOS / Linux
+export PYTHONPATH=".claude/scripts"
+```
+
 **Python 依赖说明**:
 
 | 包名 | 用途 |
@@ -155,7 +167,7 @@ pip install -r .claude/scripts/requirements.txt
 ```
 
 系统会引导你完成:
-- 选择初始化模式(Quick/Standard/Deep)
+- Deep 初始化信息采集(完整建模
 - 选择题材类型
 - 设计金手指/核心卖点
 - 生成项目结构和设定模板
@@ -191,11 +203,7 @@ pip install -r .claude/scripts/requirements.txt
 
 **初始化模式**:
 
-| 模式 | 时间 | 内容 |
-|------|------|------|
-| ⚡ Quick | 5分钟 | 基础结构 + 核心卖点 |
-| 📝 Standard | 15-20分钟 | + 金手指设计 + 题材模板 |
-| 🎯 Deep | 30-45分钟 | + 深度世界观 + 创意验证 |
+当前默认执行 **Deep 模式**(完整初始化流程,约 30-45 分钟)。
 
 **产出文件**:
 - `.webnovel/state.json` - 项目状态
@@ -251,8 +259,8 @@ Step 6: Git 自动提交备份
 
 **写作模式**:
 - **标准模式**: 完整执行 Step 1-6
-- **快速模式** (`--mode fast`): 跳过 Step 2B
-- **极简模式** (`--mode minimal`): 跳过 Step 2B + 仅 3 个核心审查(无追读力数据)
+- **快速模式** (`--fast`): 跳过 Step 2B
+- **极简模式** (`--minimal`): 跳过 Step 2B + 仅 3 个核心审查(无追读力数据)
 
 **产出**:
 - `正文/第N章-标题.md`
@@ -528,9 +536,9 @@ RERANK_API_KEY=jina_xxx
 
 ```python
 # API 设置
-embed_concurrency = 50          # 嵌入并发数
-cold_start_timeout = 120        # 冷启动超时(秒)
-normal_timeout = 30             # 正常超时(秒)
+embed_concurrency = 64          # 嵌入并发数
+cold_start_timeout = 300        # 冷启动超时(秒)
+normal_timeout = 180            # 正常超时(秒)
 api_max_retries = 3             # 最大重试次数
 api_retry_delay = 1.0           # 重试延迟(秒)
 
@@ -539,14 +547,16 @@ strand_quest_max_consecutive = 5   # Quest 最大连续章数
 strand_fire_max_gap = 10           # Fire 最大断档章数
 
 # 爽点密度
-pacing_words_per_point = (1000, 2000)  # 每个爽点字数范围
+pacing_words_per_point_excellent = 1000  # 优秀阈值
+pacing_words_per_point_good = 1500       # 良好阈值
+pacing_words_per_point_acceptable = 2000 # 及格阈值
 
 # 实体置信度
 extraction_confidence_high = 0.8   # 高置信度阈值(自动采用)
-extraction_confidence_low = 0.5    # 低置信度阈值(待确认)
+extraction_confidence_medium = 0.5 # 中置信度阈值(待确认)
 
 # 上下文窗口
-context_recent_summaries_window = 5   # 最近摘要数量
+context_recent_summaries_window = 3   # 最近摘要数量
 context_max_appearing_characters = 10 # 最大出场角色数
 context_max_urgent_foreshadowing = 5  # 最大紧急伏笔数
 ```
@@ -627,6 +637,10 @@ your-novel-project/
 
 当 `index.db` 损坏或与实际数据不一致时:
 
+先确保当前 shell 能找到 `data_modules`(二选一):
+- 设置环境变量:`PYTHONPATH=.claude/scripts`
+- 或先执行:`cd .claude/scripts`
+
 ```bash
 # 重新处理单章
 python -m data_modules.index_manager process-chapter --chapter 1 --project-root "."
@@ -672,6 +686,24 @@ python -m data_modules.index_manager get-recent-review-metrics --limit 5 --proje
 python -m data_modules.index_manager get-review-trend-stats --last-n 5 --project-root "."
 ```
 
+### 健康报告(status_reporter)
+
+```bash
+# 全量健康报告
+python .claude/scripts/status_reporter.py --focus all --project-root "."
+
+# 仅看伏笔紧急度
+python .claude/scripts/status_reporter.py --focus urgency --project-root "."
+
+# 仅看爽点节奏
+python .claude/scripts/status_reporter.py --focus pacing --project-root "."
+```
+
+说明:
+- 伏笔分析优先使用 `plot_threads.foreshadowing` 的真实章节字段(如 `planted_chapter` / `target_chapter`)。
+- 爽点节奏优先使用 `chapter_reading_power.coolpoint_patterns`,其次回退 `chapter_meta`。
+- 若章节数据缺失,报告会标记“数据不足”,不会再用固定假设值估算。
+
 ### 向量重建
 
 当 `vectors.db` 损坏或嵌入模型更换时:
@@ -690,7 +722,7 @@ python -m data_modules.rag_adapter stats --project-root "."
 
 ```bash
 # 查看章节标签
-git tag | grep "ch"
+git tag --list "ch*"
 
 # 回滚到第45章
 git checkout ch0045
@@ -716,7 +748,7 @@ git checkout ch0045
 - **Checker分层**:审查Agent输出结构化报告
 - **Context精简**:创作任务书优化
 
-### v5.4 (当前)
+### v5.4
 - **审查指标追踪**:review_metrics 表记录每次审查的评分/维度/问题数
 - **审查趋势统计**:get-review-trend-stats 查询近期审查均值和短板
 - **故事骨架采样**:context_manager 每 N 章采样历史摘要,构建长篇感知
@@ -746,7 +778,7 @@ git checkout ch0045
 - 风格适配器:Step 2A/2B 拆分,先写剧情后网文化
 - 摘要分离:章节摘要存入 `.webnovel/summaries/ch{NNNN}.md`
 - chapter_meta:记录钩子/模式/结束状态到 state.json
-- 轻量模式:支持 `--mode fast/minimal` 加速写作
+- 轻量模式:支持 `--fast` / `--minimal` 加速写作
 - 输出模板:7 个标准模板文件(state/index schema、设定集、大纲)
 
 ### v5.1