|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+// 一次性脚本:修复 42792 的 MiaoguoTask 重复记录/DayNumber,并只读扫描最近一个月相似问题用户。
|
|
|
2
|
+// 仅对 42792 做写操作;其余用户只做只读统计。
|
|
|
3
|
+import Miaoguo from '../src/model/miaoguo.js';
|
|
|
4
|
+import constantClass from '../src/util/constant/index.js';
|
|
|
5
|
+import { stringUtils } from '../src/util/stringClass.js';
|
|
|
6
|
+
|
|
|
7
|
+async function fixUser(userID) {
|
|
|
8
|
+ const tasks = await Miaoguo.RunSql([userID],
|
|
|
9
|
+ "SELECT * FROM MiaoguoTask where CardTask>0 and UserID=? order by CreateTime, ID desc;");
|
|
|
10
|
+ if (!tasks || tasks.length === 0) {
|
|
|
11
|
+ console.log(`User ${userID}: 无记录`);
|
|
|
12
|
+ return;
|
|
|
13
|
+ }
|
|
|
14
|
+
|
|
|
15
|
+ // 每天只保留“最完整”的一条:优先 IsShare>0 / 有里程碑 / 有格言,其次最新 ID
|
|
|
16
|
+ const dayBest = new Map();
|
|
|
17
|
+ const score = (x) => (x.IsShare > 0 ? 4 : 0) + (x.MilestoneDayNumber > 0 ? 2 : 0) + (x.AphorismID > 0 ? 1 : 0);
|
|
|
18
|
+ for (const t of tasks) {
|
|
|
19
|
+ const best = dayBest.get(t.CreateTime);
|
|
|
20
|
+ if (!best) dayBest.set(t.CreateTime, t);
|
|
|
21
|
+ else if (score(t) > score(best) || (score(t) === score(best) && t.ID > best.ID))
|
|
|
22
|
+ dayBest.set(t.CreateTime, t);
|
|
|
23
|
+ }
|
|
|
24
|
+
|
|
|
25
|
+ let deleted = 0;
|
|
|
26
|
+ for (const t of tasks) {
|
|
|
27
|
+ if (dayBest.get(t.CreateTime).ID !== t.ID) {
|
|
|
28
|
+ await Miaoguo.RunSql([t.ID], "delete from MiaoguoTask where ID=?;");
|
|
|
29
|
+ deleted++;
|
|
|
30
|
+ }
|
|
|
31
|
+ }
|
|
|
32
|
+
|
|
|
33
|
+ const dayTasks = [...dayBest.values()].sort((a, b) =>
|
|
|
34
|
+ a.CreateTime < b.CreateTime ? -1 : a.CreateTime > b.CreateTime ? 1 : a.ID - b.ID);
|
|
|
35
|
+
|
|
|
36
|
+ const milestone = constantClass.GetMilestone();
|
|
|
37
|
+ let milestoneIDs = [];
|
|
|
38
|
+ for (let i = 0; i < 40; i++) milestoneIDs.push(i + 1);
|
|
|
39
|
+ milestoneIDs = stringUtils.RandomArray(milestoneIDs);
|
|
|
40
|
+ let milestoneIndex = 0, hardworkingIndex = 0;
|
|
|
41
|
+ for (let i = 0; i < dayTasks.length; i++) {
|
|
|
42
|
+ const t = dayTasks[i];
|
|
|
43
|
+ const update = { ID: t.ID, DayNumber: i + 1 };
|
|
|
44
|
+ const milestoneItem = milestone.find(item => item.DayNumber == i + 1);
|
|
|
45
|
+ if (milestoneItem) {
|
|
|
46
|
+ update.MilestoneDayNumber = milestoneItem.DayNumber;
|
|
|
47
|
+ update.MilestoneID = milestoneIDs[milestoneIndex++];
|
|
|
48
|
+ }
|
|
|
49
|
+ if (t.IsShare > 0 || update.MilestoneDayNumber > 0 || t.AphorismID > 0)
|
|
|
50
|
+ update.HardworkingNumber = ++hardworkingIndex;
|
|
|
51
|
+ await Miaoguo.UpdateMiaoguoTask(update);
|
|
|
52
|
+ }
|
|
|
53
|
+ console.log(`User ${userID}: 删除重复行 ${deleted} 条,重编号 ${dayTasks.length} 天(DayNumber 1..${dayTasks.length})`);
|
|
|
54
|
+}
|
|
|
55
|
+
|
|
|
56
|
+async function scanRecent() {
|
|
|
57
|
+ // 信号1:最近一个月存在“同一天多条(MiaoguoTask)记录”的用户(根因)
|
|
|
58
|
+ const dupDays = await Miaoguo.RunSql([], `
|
|
|
59
|
+ SELECT UserID, DATE(CreateTime) as d, COUNT(*) as cnt
|
|
|
60
|
+ FROM MiaoguoTask
|
|
|
61
|
+ WHERE CardTask>0 AND CreateTime >= DATE_SUB(CURDATE(), INTERVAL 30 DAY)
|
|
|
62
|
+ GROUP BY UserID, DATE(CreateTime)
|
|
|
63
|
+ HAVING cnt > 1
|
|
|
64
|
+ ORDER BY UserID, d;`);
|
|
|
65
|
+
|
|
|
66
|
+ const byUser = {};
|
|
|
67
|
+ for (const r of dupDays) byUser[r.UserID] = (byUser[r.UserID] || 0) + 1;
|
|
|
68
|
+
|
|
|
69
|
+ // 信号2:最近一个月 DayNumber 最大值 > 实际不同天数(说明历史上按行编号被撑大,存在断号风险)
|
|
|
70
|
+ const inflated = await Miaoguo.RunSql([], `
|
|
|
71
|
+ SELECT UserID,
|
|
|
72
|
+ COUNT(DISTINCT DATE(CreateTime)) as distinctDays,
|
|
|
73
|
+ MAX(DayNumber) as maxDayNumber
|
|
|
74
|
+ FROM MiaoguoTask
|
|
|
75
|
+ WHERE CardTask>0 AND CreateTime >= DATE_SUB(CURDATE(), INTERVAL 30 DAY)
|
|
|
76
|
+ GROUP BY UserID
|
|
|
77
|
+ HAVING maxDayNumber > distinctDays;`);
|
|
|
78
|
+
|
|
|
79
|
+ const inflatedUsers = inflated.map(r => r.UserID);
|
|
|
80
|
+
|
|
|
81
|
+ console.log('\n===== 扫描结果(最近一个月)=====');
|
|
|
82
|
+ console.log('信号1 - 有“同一天多条记录”的用户数:', Object.keys(byUser).length);
|
|
|
83
|
+ console.log('信号1 - 明细(用户ID: 重复天数):', byUser);
|
|
|
84
|
+ console.log('\n信号2 - DayNumber>实际天数(历史膨胀)的用户数:', inflatedUsers.length);
|
|
|
85
|
+ console.log('信号2 - 用户列表:', inflatedUsers);
|
|
|
86
|
+
|
|
|
87
|
+ const allAffected = new Set([...Object.keys(byUser), ...inflatedUsers]);
|
|
|
88
|
+ console.log('\n合计受影响用户数(任一信号):', allAffected.size);
|
|
|
89
|
+ console.log('合计用户ID:', [...allAffected].map(Number).sort((a, b) => a - b));
|
|
|
90
|
+}
|
|
|
91
|
+
|
|
|
92
|
+await fixUser(42792);
|
|
|
93
|
+await scanRecent();
|
|
|
94
|
+process.exit(0);
|