12c8098b5f
leo 兩句定調:
①「要思考 Excel 和 csv 的問題,因為企業用很多」
②「企業的 excel 通常不會是 1 萬行,人工做不出這麼多,但你可以轉結構資料丟進去」
→ 修正我先前「CSV 會變數字牆、先不加」的判斷——那是拿機器產生的百萬列當前提。
實測 60列x6欄 ≈ 2,200 token,對 LLM 完全不是問題。
統一中間格式=Markdown(leo 提 n8n 對照後定調):
n8n 一切轉 JSON 是對的,因為它下游是程式(.欄位 取值);
我們下游是 LLM ⇒ Markdown 表格更好。實測同一份表格
JSON 6,872 字元 vs Markdown 3,341=JSON 多花 2.1 倍 token(每列重複寫欄位名)。
測試 8/8,用 openpyxl 產的真 Excel 檔(非自捏 XML):
⭐ 測試抓到兩個真 bug(讀原始碼看不出來):
① rels 的 Target 是絕對路徑 /xl/... 我卻又補 xl/ 前綴 → 變 xl/xl/...
② r:id 帶 namespace,寫 xml:"id,attr" 抓不到,要用完整 namespace URI
修好後分頁名從 ## sheet1 變成 ## 維修紀錄(企業分頁名本身就是語意)
CSV:去 BOM(Excel 另存必帶)/引號內逗號不拆欄/| 跳脫/欄數不齊不整份失敗
XLSX:多工作表全讀(只取第一頁會漏)/sharedStrings 索引/壞檔報錯
防呆:超過 500 列截斷並明說截斷了(不靜默丟資料);單格超 500 字截斷。
302 lines
9.4 KiB
Go
302 lines
9.4 KiB
Go
// scan.go — 掃描迴圈與差異分類(SDD ingest-hash-trigger design §3)。
|
||
// 事件順序:先把本輪 removed×added 以 content_hash 配對成 renamed(只更新路徑映射),
|
||
// 再分類其餘 added/modified/removed;removed 數 > manifest 條目 × 門檻(預設 40%)
|
||
// → removed 全部不執行、改發警告(R6)。本階段不接網路,事件輸出到 stdout。
|
||
package main
|
||
|
||
import (
|
||
"crypto/sha256"
|
||
"encoding/hex"
|
||
"fmt"
|
||
"io"
|
||
"io/fs"
|
||
"os"
|
||
"path/filepath"
|
||
"sort"
|
||
"strings"
|
||
"time"
|
||
)
|
||
|
||
// 收檔白名單。**注意這只是「收不收」,能不能讀由 convert.go 的 extractors 決定**——
|
||
// 兩者要一起看(2026-07-27 t73:`.pdf` 早就在這裡,但 ingest 端擋著=檔案上了 R2 卻進不了
|
||
// 知識庫,使用者看到的是「丟檔進去沒反應」)。
|
||
//
|
||
// .csv/.xlsx 於 2026-07-27 加入——leo:「要思考 Excel 和 csv 的問題,**因為企業用很多**」。
|
||
var allowedExt = map[string]bool{
|
||
".md": true,
|
||
".markdown": true,
|
||
".txt": true,
|
||
".docx": true,
|
||
".pptx": true,
|
||
".pdf": true,
|
||
".csv": true,
|
||
".xlsx": true,
|
||
}
|
||
|
||
// ---- 輸出 payload(對應 schemas/collector-trigger.v1.schema.json)----
|
||
|
||
type Event struct {
|
||
Type string `json:"type"`
|
||
Path string `json:"path"`
|
||
OldPath string `json:"old_path,omitempty"`
|
||
SourceHash string `json:"source_hash"`
|
||
Size *int64 `json:"size,omitempty"`
|
||
R2Key string `json:"r2_key,omitempty"`
|
||
}
|
||
|
||
type Warning struct {
|
||
Code string `json:"code"`
|
||
Message string `json:"message"`
|
||
RemovedCount int `json:"removed_count,omitempty"`
|
||
ManifestCount int `json:"manifest_count,omitempty"`
|
||
ThresholdRatio float64 `json:"threshold_ratio,omitempty"`
|
||
}
|
||
|
||
type TriggerPayload struct {
|
||
SchemaVersion int `json:"schema_version"`
|
||
FolderID string `json:"folder_id"`
|
||
Root string `json:"root,omitempty"`
|
||
GeneratedAt int64 `json:"generated_at,omitempty"`
|
||
Events []Event `json:"events"`
|
||
Warnings []Warning `json:"warnings,omitempty"`
|
||
}
|
||
|
||
type ScanOptions struct {
|
||
// MaxRemovedRatio:單輪 removed 數 > manifest 條目數 × 本值 → 觸發大量刪除防呆(R6)。
|
||
MaxRemovedRatio float64
|
||
// SkipPaths:絕對路徑黑名單(如 manifest 檔自己住在 root 底下時)。
|
||
SkipPaths map[string]bool
|
||
// SkipDirNames:目錄名黑名單(任一層命中整棵跳過)。daemon-beta task 2:
|
||
// template 代裝後 `system-dev/`(wiki 產物區)不得被當成原稿掃進 ingest。
|
||
SkipDirNames map[string]bool
|
||
}
|
||
|
||
const DefaultMaxRemovedRatio = 0.4
|
||
|
||
type fileState struct {
|
||
hash string // sha256:<hex>
|
||
size int64
|
||
mtime int64
|
||
}
|
||
|
||
func hashFile(path string) (string, error) {
|
||
f, err := os.Open(path)
|
||
if err != nil {
|
||
return "", err
|
||
}
|
||
defer f.Close()
|
||
h := sha256.New()
|
||
if _, err := io.Copy(h, f); err != nil {
|
||
return "", err
|
||
}
|
||
return "sha256:" + hex.EncodeToString(h.Sum(nil)), nil
|
||
}
|
||
|
||
func r2KeyOf(sourceHash string) string {
|
||
return "raw/" + strings.TrimPrefix(sourceHash, "sha256:")
|
||
}
|
||
|
||
// Scan 走訪 root、對照並更新 manifest、產出一輪事件。
|
||
// manifest 更新原則:content_hash/size/mtime 反映現況;ingested_hash/ingested_at
|
||
// 只搬運(renamed)與保留(modified),本函式永不設值——那是上傳成功後的事。
|
||
func Scan(root string, m *Manifest, opts ScanOptions) (*TriggerPayload, error) {
|
||
if opts.MaxRemovedRatio <= 0 {
|
||
opts.MaxRemovedRatio = DefaultMaxRemovedRatio
|
||
}
|
||
orig := m.Entries
|
||
manifestCountBefore := len(orig)
|
||
|
||
// 1) 走訪檔案系統,建立現況(mtime+size fast-path:沒變→沿用 manifest hash,變了才算 sha256)。
|
||
current := map[string]fileState{}
|
||
err := filepath.WalkDir(root, func(p string, d fs.DirEntry, werr error) error {
|
||
if werr != nil {
|
||
return werr
|
||
}
|
||
name := d.Name()
|
||
if d.IsDir() {
|
||
if p != root && strings.HasPrefix(name, ".") {
|
||
return filepath.SkipDir // 隱藏目錄(.git、.obsidian…)整棵跳過
|
||
}
|
||
if p != root && opts.SkipDirNames[name] {
|
||
return filepath.SkipDir // 名單目錄(system-dev…)整棵跳過
|
||
}
|
||
return nil
|
||
}
|
||
if strings.HasPrefix(name, ".") {
|
||
return nil
|
||
}
|
||
if abs, aerr := filepath.Abs(p); aerr == nil && opts.SkipPaths[abs] {
|
||
return nil
|
||
}
|
||
if !allowedExt[strings.ToLower(filepath.Ext(name))] {
|
||
return nil
|
||
}
|
||
info, ierr := d.Info()
|
||
if ierr != nil {
|
||
return ierr
|
||
}
|
||
rel, rerr := filepath.Rel(root, p)
|
||
if rerr != nil {
|
||
return rerr
|
||
}
|
||
rel = filepath.ToSlash(rel)
|
||
st := fileState{size: info.Size(), mtime: info.ModTime().Unix()}
|
||
if e, ok := orig[rel]; ok && e.ContentHash != "" && e.Mtime == st.mtime && e.Size == st.size {
|
||
st.hash = e.ContentHash // fast-path:mtime+size 沒變,跳過重算
|
||
} else {
|
||
h, herr := hashFile(p)
|
||
if herr != nil {
|
||
return herr
|
||
}
|
||
st.hash = h
|
||
}
|
||
current[rel] = st
|
||
return nil
|
||
})
|
||
if err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 2) 初分:added 候選(現況有、manifest 無)與 removed 候選(manifest 有、現況無)。
|
||
var addedPaths, removedPaths []string
|
||
for p := range current {
|
||
if _, ok := orig[p]; !ok {
|
||
addedPaths = append(addedPaths, p)
|
||
}
|
||
}
|
||
for p := range orig {
|
||
if _, ok := current[p]; !ok {
|
||
removedPaths = append(removedPaths, p)
|
||
}
|
||
}
|
||
sort.Strings(addedPaths)
|
||
sort.Strings(removedPaths)
|
||
|
||
// 3) 先配對 renamed(design §3 順序 1):removed×added 以 content_hash 配對,
|
||
// 配上=只更新路徑映射,不 retire、不重萃、不重傳。同 hash 多候選→排序後貪婪配對(確定性)。
|
||
removedByHash := map[string][]string{}
|
||
for _, p := range removedPaths {
|
||
h := orig[p].ContentHash
|
||
removedByHash[h] = append(removedByHash[h], p)
|
||
}
|
||
renamedOldOf := map[string]string{} // newPath -> oldPath
|
||
pairedOld := map[string]bool{}
|
||
var events []Event
|
||
for _, np := range addedPaths {
|
||
h := current[np].hash
|
||
cands := removedByHash[h]
|
||
if len(cands) == 0 {
|
||
continue
|
||
}
|
||
op := cands[0]
|
||
removedByHash[h] = cands[1:]
|
||
pairedOld[op] = true
|
||
renamedOldOf[np] = op
|
||
events = append(events, Event{Type: "renamed", Path: np, OldPath: op, SourceHash: h})
|
||
}
|
||
|
||
// 4) added:真新檔+「曾偵測但從未成功 ingest」的檔(重試語意,design §2)。
|
||
sortedCurrent := make([]string, 0, len(current))
|
||
for p := range current {
|
||
sortedCurrent = append(sortedCurrent, p)
|
||
}
|
||
sort.Strings(sortedCurrent)
|
||
addedEvent := func(p string) Event {
|
||
st := current[p]
|
||
size := st.size
|
||
return Event{Type: "added", Path: p, SourceHash: st.hash, Size: &size, R2Key: r2KeyOf(st.hash)}
|
||
}
|
||
for _, p := range sortedCurrent {
|
||
if op, isRenamed := renamedOldOf[p]; isRenamed {
|
||
if orig[op].IngestedHash == "" { // 改名的檔其實從未 ingest 成功 → 補一發 added
|
||
events = append(events, addedEvent(p))
|
||
}
|
||
continue
|
||
}
|
||
if _, existed := orig[p]; !existed {
|
||
events = append(events, addedEvent(p)) // 真新檔
|
||
} else if orig[p].IngestedHash == "" {
|
||
events = append(events, addedEvent(p)) // 上輪偵測過但 ingest 未成功 → 重試
|
||
}
|
||
}
|
||
|
||
// 5) modified:manifest 有、現況有、content_hash != ingested_hash(design §3 順序 3)。
|
||
for _, p := range sortedCurrent {
|
||
e, existed := orig[p]
|
||
if !existed {
|
||
continue
|
||
}
|
||
if _, isRenamed := renamedOldOf[p]; isRenamed {
|
||
continue
|
||
}
|
||
if e.IngestedHash != "" && current[p].hash != e.IngestedHash {
|
||
st := current[p]
|
||
size := st.size
|
||
events = append(events, Event{Type: "modified", Path: p, SourceHash: st.hash, Size: &size, R2Key: r2KeyOf(st.hash)})
|
||
}
|
||
}
|
||
|
||
// 6) removed(扣掉已配對走的)+大量刪除防呆(R6)。
|
||
var finalRemoved []string
|
||
for _, p := range removedPaths {
|
||
if !pairedOld[p] {
|
||
finalRemoved = append(finalRemoved, p)
|
||
}
|
||
}
|
||
var warnings []Warning
|
||
guardTripped := manifestCountBefore > 0 &&
|
||
float64(len(finalRemoved)) > opts.MaxRemovedRatio*float64(manifestCountBefore)
|
||
if guardTripped {
|
||
warnings = append(warnings, Warning{
|
||
Code: "mass_delete_guard",
|
||
Message: fmt.Sprintf(
|
||
"本輪偵測到 %d/%d 個檔案消失(超過 %.0f%% 門檻)——可能是資料夾未掛載或同步半途。本輪全部「不」下架,請確認資料夾完好後再放行。",
|
||
len(finalRemoved), manifestCountBefore, opts.MaxRemovedRatio*100),
|
||
RemovedCount: len(finalRemoved),
|
||
ManifestCount: manifestCountBefore,
|
||
ThresholdRatio: opts.MaxRemovedRatio,
|
||
})
|
||
} else {
|
||
for _, p := range finalRemoved {
|
||
events = append(events, Event{Type: "removed", Path: p, SourceHash: orig[p].ContentHash})
|
||
}
|
||
}
|
||
|
||
// 7) 更新 manifest(rebuild):現況檔全數收錄;ingested_* 由舊 entry(或 renamed 的舊路徑)搬運。
|
||
// 防呆觸發時 removed 條目保留(下輪重評、警告會再響,直到人確認或檔案回來)。
|
||
newEntries := make(map[string]*ManifestEntry, len(current))
|
||
for p, st := range current {
|
||
ne := &ManifestEntry{ContentHash: st.hash, Size: st.size, Mtime: st.mtime}
|
||
var carry *ManifestEntry
|
||
if op, isRenamed := renamedOldOf[p]; isRenamed {
|
||
carry = orig[op]
|
||
} else if e, ok := orig[p]; ok {
|
||
carry = e
|
||
}
|
||
if carry != nil {
|
||
ne.IngestedHash = carry.IngestedHash
|
||
ne.IngestedAt = carry.IngestedAt
|
||
}
|
||
newEntries[p] = ne
|
||
}
|
||
if guardTripped {
|
||
for _, p := range finalRemoved {
|
||
newEntries[p] = orig[p]
|
||
}
|
||
}
|
||
m.Entries = newEntries
|
||
m.Root = root
|
||
|
||
if events == nil {
|
||
events = []Event{}
|
||
}
|
||
return &TriggerPayload{
|
||
SchemaVersion: 1,
|
||
FolderID: m.FolderID,
|
||
Root: root,
|
||
GeneratedAt: time.Now().Unix(),
|
||
Events: events,
|
||
Warnings: warnings,
|
||
}, nil
|
||
}
|