dsh-mobile-ios 0.2.16 → 0.2.18

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/src/ring.mjs CHANGED
@@ -1,148 +1,148 @@
1
- // ring.mjs — 每任务独立 seq + 环缓冲(GW-6)
2
- // 契约要点:
3
- // 1. seq 是"每条任务各自单调递增",不是全局序号;
4
- // 2. 断线续传靠 since/游标,缺口不能"猜",要么补帧要么明说下界;
5
- // 3. 网关不持业务状态,这里只存"已发生的事实",任务真相仍在宿主。
6
-
7
- const DEFAULT_CAPACITY = 2000;
8
- const DEFAULT_TOTAL_CAPACITY = 20000;
9
-
10
- export class EventLog {
11
- constructor({ capacity = DEFAULT_CAPACITY, totalCapacity = DEFAULT_TOTAL_CAPACITY } = {}) {
12
- this.capacity = capacity;
13
- this.totalCapacity = totalCapacity;
14
- this.tasks = new Map(); // taskId -> { seq, frames: [], dropped: 0 }
15
- this.total = 0;
16
- this.listeners = new Set();
17
- }
18
-
19
- #bucket(taskId) {
20
- let b = this.tasks.get(taskId);
21
- if (!b) {
22
- b = { seq: 0, frames: [], dropped: 0 };
23
- this.tasks.set(taskId, b);
24
- }
25
- return b;
26
- }
27
-
28
- /** 追加一条事件并分配 seq;返回最终封套(不做任何内容改写) */
29
- append({ taskId, kind, data, at }) {
30
- if (!taskId) throw new Error('append 需要 taskId');
31
- const b = this.#bucket(taskId);
32
- b.seq += 1;
33
- const frame = {
34
- t: 'ev',
35
- seq: b.seq,
36
- taskId,
37
- kind,
38
- at: at || new Date().toISOString(),
39
- data: data ?? {},
40
- };
41
- b.frames.push(frame);
42
- this.total += 1;
43
- if (b.frames.length > this.capacity) {
44
- b.frames.shift();
45
- b.dropped += 1;
46
- this.total -= 1;
47
- }
48
- // 全局兜底:任务数异常增长时不至于吃满内存
49
- while (this.total > this.totalCapacity) {
50
- const oldest = this.#oldestTask();
51
- if (!oldest) break;
52
- this.tasks.get(oldest).frames.shift();
53
- this.tasks.get(oldest).dropped += 1;
54
- this.total -= 1;
55
- }
56
- for (const fn of this.listeners) fn(frame);
57
- return frame;
58
- }
59
-
60
- #oldestTask() {
61
- let target = null;
62
- let minSeq = Infinity;
63
- for (const [taskId, b] of this.tasks) {
64
- if (!b.frames.length) continue;
65
- if (b.frames[0].seq < minSeq) {
66
- minSeq = b.frames[0].seq;
67
- target = taskId;
68
- }
69
- }
70
- return target;
71
- }
72
-
73
- maxSeq(taskId) {
74
- return this.tasks.get(taskId)?.seq ?? 0;
75
- }
76
-
77
- lowerBound(taskId) {
78
- const b = this.tasks.get(taskId);
79
- if (!b || !b.frames.length) return this.maxSeq(taskId) + 1;
80
- return b.frames[0].seq;
81
- }
82
-
83
- /**
84
- * 计算续传结果。
85
- * @param {{lastSeq?:number, cursors?:Record<string,number>}} req
86
- * @returns {{frames:Array, resumeFrom:number, gap:boolean}}
87
- * gap=true 表示某任务请求的游标早于环缓冲下界,客户端应改用 GET /tasks/{id} 全量重建。
88
- */
89
- replay({ lastSeq = 0, cursors } = {}) {
90
- const out = [];
91
- let gap = false;
92
- let firstDelivered = null;
93
-
94
- for (const [taskId, b] of this.tasks) {
95
- const cursor = Number.isFinite(cursors?.[taskId]) ? cursors[taskId] : lastSeq;
96
- const picked = b.frames.filter((f) => f.seq > cursor);
97
- if (picked.length && b.dropped > 0 && cursor < b.frames[0].seq - 1) gap = true;
98
- for (const f of picked) {
99
- out.push(f);
100
- if (firstDelivered === null || f.seq < firstDelivered) firstDelivered = f.seq;
101
- }
102
- }
103
-
104
- out.sort((a, b) => (a.at === b.at ? a.seq - b.seq : a.at < b.at ? -1 : 1));
105
- const resumeFrom = firstDelivered ?? (lastSeq > 0 ? lastSeq : 1);
106
- return { frames: out, resumeFrom, gap };
107
- }
108
-
109
- onFrame(fn) {
110
- this.listeners.add(fn);
111
- return () => this.listeners.delete(fn);
112
- }
113
-
114
- /**
115
- * 裁掉某任务最早的若干帧,模拟环缓冲淘汰。
116
- * 只用于故障注入与测试:生产里淘汰发生在 append 时,这里是为了在「刚跑起来」
117
- * 的短会话中也能构造出「客户端游标早于下界」的真实场景。
118
- */
119
- trim(taskId, keep = 0) {
120
- const b = this.tasks.get(taskId);
121
- if (!b) return 0;
122
- const drop = Math.max(0, b.frames.length - keep);
123
- if (drop > 0) {
124
- b.frames.splice(0, drop);
125
- b.dropped += drop;
126
- this.total -= drop;
127
- }
128
- return drop;
129
- }
130
-
131
- stats() {
132
- let lowest = null;
133
- for (const b of this.tasks.values()) {
134
- if (b.frames.length && (lowest === null || b.frames[0].seq < lowest)) lowest = b.frames[0].seq;
135
- }
136
- return {
137
- tasks: this.tasks.size,
138
- frames: this.total,
139
- capacityPerTask: this.capacity,
140
- lowestSeq: lowest,
141
- };
142
- }
143
-
144
- clear() {
145
- this.tasks.clear();
146
- this.total = 0;
147
- }
148
- }
1
+ // ring.mjs — 每任务独立 seq + 环缓冲(GW-6)
2
+ // 契约要点:
3
+ // 1. seq 是"每条任务各自单调递增",不是全局序号;
4
+ // 2. 断线续传靠 since/游标,缺口不能"猜",要么补帧要么明说下界;
5
+ // 3. 网关不持业务状态,这里只存"已发生的事实",任务真相仍在宿主。
6
+
7
+ const DEFAULT_CAPACITY = 2000;
8
+ const DEFAULT_TOTAL_CAPACITY = 20000;
9
+
10
+ export class EventLog {
11
+ constructor({ capacity = DEFAULT_CAPACITY, totalCapacity = DEFAULT_TOTAL_CAPACITY } = {}) {
12
+ this.capacity = capacity;
13
+ this.totalCapacity = totalCapacity;
14
+ this.tasks = new Map(); // taskId -> { seq, frames: [], dropped: 0 }
15
+ this.total = 0;
16
+ this.listeners = new Set();
17
+ }
18
+
19
+ #bucket(taskId) {
20
+ let b = this.tasks.get(taskId);
21
+ if (!b) {
22
+ b = { seq: 0, frames: [], dropped: 0 };
23
+ this.tasks.set(taskId, b);
24
+ }
25
+ return b;
26
+ }
27
+
28
+ /** 追加一条事件并分配 seq;返回最终封套(不做任何内容改写) */
29
+ append({ taskId, kind, data, at }) {
30
+ if (!taskId) throw new Error('append 需要 taskId');
31
+ const b = this.#bucket(taskId);
32
+ b.seq += 1;
33
+ const frame = {
34
+ t: 'ev',
35
+ seq: b.seq,
36
+ taskId,
37
+ kind,
38
+ at: at || new Date().toISOString(),
39
+ data: data ?? {},
40
+ };
41
+ b.frames.push(frame);
42
+ this.total += 1;
43
+ if (b.frames.length > this.capacity) {
44
+ b.frames.shift();
45
+ b.dropped += 1;
46
+ this.total -= 1;
47
+ }
48
+ // 全局兜底:任务数异常增长时不至于吃满内存
49
+ while (this.total > this.totalCapacity) {
50
+ const oldest = this.#oldestTask();
51
+ if (!oldest) break;
52
+ this.tasks.get(oldest).frames.shift();
53
+ this.tasks.get(oldest).dropped += 1;
54
+ this.total -= 1;
55
+ }
56
+ for (const fn of this.listeners) fn(frame);
57
+ return frame;
58
+ }
59
+
60
+ #oldestTask() {
61
+ let target = null;
62
+ let minSeq = Infinity;
63
+ for (const [taskId, b] of this.tasks) {
64
+ if (!b.frames.length) continue;
65
+ if (b.frames[0].seq < minSeq) {
66
+ minSeq = b.frames[0].seq;
67
+ target = taskId;
68
+ }
69
+ }
70
+ return target;
71
+ }
72
+
73
+ maxSeq(taskId) {
74
+ return this.tasks.get(taskId)?.seq ?? 0;
75
+ }
76
+
77
+ lowerBound(taskId) {
78
+ const b = this.tasks.get(taskId);
79
+ if (!b || !b.frames.length) return this.maxSeq(taskId) + 1;
80
+ return b.frames[0].seq;
81
+ }
82
+
83
+ /**
84
+ * 计算续传结果。
85
+ * @param {{lastSeq?:number, cursors?:Record<string,number>}} req
86
+ * @returns {{frames:Array, resumeFrom:number, gap:boolean}}
87
+ * gap=true 表示某任务请求的游标早于环缓冲下界,客户端应改用 GET /tasks/{id} 全量重建。
88
+ */
89
+ replay({ lastSeq = 0, cursors } = {}) {
90
+ const out = [];
91
+ let gap = false;
92
+ let firstDelivered = null;
93
+
94
+ for (const [taskId, b] of this.tasks) {
95
+ const cursor = Number.isFinite(cursors?.[taskId]) ? cursors[taskId] : lastSeq;
96
+ const picked = b.frames.filter((f) => f.seq > cursor);
97
+ if (picked.length && b.dropped > 0 && cursor < b.frames[0].seq - 1) gap = true;
98
+ for (const f of picked) {
99
+ out.push(f);
100
+ if (firstDelivered === null || f.seq < firstDelivered) firstDelivered = f.seq;
101
+ }
102
+ }
103
+
104
+ out.sort((a, b) => (a.at === b.at ? a.seq - b.seq : a.at < b.at ? -1 : 1));
105
+ const resumeFrom = firstDelivered ?? (lastSeq > 0 ? lastSeq : 1);
106
+ return { frames: out, resumeFrom, gap };
107
+ }
108
+
109
+ onFrame(fn) {
110
+ this.listeners.add(fn);
111
+ return () => this.listeners.delete(fn);
112
+ }
113
+
114
+ /**
115
+ * 裁掉某任务最早的若干帧,模拟环缓冲淘汰。
116
+ * 只用于故障注入与测试:生产里淘汰发生在 append 时,这里是为了在「刚跑起来」
117
+ * 的短会话中也能构造出「客户端游标早于下界」的真实场景。
118
+ */
119
+ trim(taskId, keep = 0) {
120
+ const b = this.tasks.get(taskId);
121
+ if (!b) return 0;
122
+ const drop = Math.max(0, b.frames.length - keep);
123
+ if (drop > 0) {
124
+ b.frames.splice(0, drop);
125
+ b.dropped += drop;
126
+ this.total -= drop;
127
+ }
128
+ return drop;
129
+ }
130
+
131
+ stats() {
132
+ let lowest = null;
133
+ for (const b of this.tasks.values()) {
134
+ if (b.frames.length && (lowest === null || b.frames[0].seq < lowest)) lowest = b.frames[0].seq;
135
+ }
136
+ return {
137
+ tasks: this.tasks.size,
138
+ frames: this.total,
139
+ capacityPerTask: this.capacity,
140
+ lowestSeq: lowest,
141
+ };
142
+ }
143
+
144
+ clear() {
145
+ this.tasks.clear();
146
+ this.total = 0;
147
+ }
148
+ }