后端:
1.阶段 6 CP4/CP5 目录收口与共享边界纯化
- 将 backend 根目录收口为 services、client、gateway、cmd、shared 五个一级目录
- 收拢 bootstrap、inits、infra/kafka、infra/outbox、conv、respond、pkg、middleware,移除根目录旧实现与空目录
- 将 utils 下沉到 services/userauth/internal/auth,将 logic 下沉到 services/schedule/core/planning
- 将迁移期 runtime 桥接实现统一收拢到 services/runtime/{conv,dao,eventsvc,model},删除 shared/legacy 与未再被 import 的旧 service 实现
- 将 gateway/shared/respond 收口为 HTTP/Gin 错误写回适配,shared/respond 仅保留共享错误语义与状态映射
- 将 HTTP IdempotencyMiddleware 与 RateLimitMiddleware 收口到 gateway/middleware
- 将 GormCachePlugin 下沉到 shared/infra/gormcache,将共享 RateLimiter 下沉到 shared/infra/ratelimit,将 agent token budget 下沉到 services/agent/shared
- 删除 InitEino 兼容壳,收缩 cmd/internal/coreinit 仅保留旧组合壳残留域初始化语义
- 更新微服务迁移计划与桌面 checklist,补齐 CP4/CP5 当前切流点、目录终态与验证结果
- 完成 go test ./...、git diff --check 与最终真实 smoke;health、register/login、task/create+get、schedule/today、task-class/list、memory/items、agent chat/meta/timeline/context-stats 全部 200,SSE 合并结果为 CP5_OK 且 [DONE] 只有 1 个
74 lines
1.8 KiB
Go
74 lines
1.8 KiB
Go
package cleanup
|
||
|
||
import (
|
||
"sort"
|
||
"time"
|
||
|
||
"github.com/LoveLosita/smartflow/backend/services/runtime/model"
|
||
)
|
||
|
||
const dedupRecentTieWindow = 24 * time.Hour
|
||
|
||
// DedupDecision 描述单个重复组的治理结论。
|
||
type DedupDecision struct {
|
||
Keep model.MemoryItem
|
||
Archive []model.MemoryItem
|
||
}
|
||
|
||
// DecideDedupGroup 决定一组重复 active 记忆中“保留谁、归档谁”。
|
||
//
|
||
// 步骤化说明:
|
||
// 1. 先按“最近更新时间”判断谁更值得保留,符合治理计划里的“优先保留最近更新”;
|
||
// 2. 若更新时间非常接近,再比较 confidence/importance,避免刚好相差几秒就误保留低质量版本;
|
||
// 3. 最后用主键逆序兜底,保证同组治理结果稳定可复现。
|
||
func DecideDedupGroup(items []model.MemoryItem) DedupDecision {
|
||
if len(items) == 0 {
|
||
return DedupDecision{}
|
||
}
|
||
|
||
ordered := make([]model.MemoryItem, len(items))
|
||
copy(ordered, items)
|
||
sort.SliceStable(ordered, func(i, j int) bool {
|
||
return preferDedupKeep(ordered[i], ordered[j])
|
||
})
|
||
|
||
return DedupDecision{
|
||
Keep: ordered[0],
|
||
Archive: ordered[1:],
|
||
}
|
||
}
|
||
|
||
func preferDedupKeep(left model.MemoryItem, right model.MemoryItem) bool {
|
||
leftTime := dedupBaseTime(left)
|
||
rightTime := dedupBaseTime(right)
|
||
|
||
diff := leftTime.Sub(rightTime)
|
||
if diff < 0 {
|
||
diff = -diff
|
||
}
|
||
if diff > dedupRecentTieWindow {
|
||
return leftTime.After(rightTime)
|
||
}
|
||
|
||
if left.Confidence != right.Confidence {
|
||
return left.Confidence > right.Confidence
|
||
}
|
||
if left.Importance != right.Importance {
|
||
return left.Importance > right.Importance
|
||
}
|
||
if !leftTime.Equal(rightTime) {
|
||
return leftTime.After(rightTime)
|
||
}
|
||
return left.ID > right.ID
|
||
}
|
||
|
||
func dedupBaseTime(item model.MemoryItem) time.Time {
|
||
if item.UpdatedAt != nil {
|
||
return *item.UpdatedAt
|
||
}
|
||
if item.CreatedAt != nil {
|
||
return *item.CreatedAt
|
||
}
|
||
return time.Time{}
|
||
}
|