dsh-sidebar-media-player 0.2.0 → 0.2.4

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/lib/qrc.js ADDED
@@ -0,0 +1,409 @@
1
+ // ── 来源声明(本插件唯一改动:仅在本行上方增加本注释块,正文逐字节未动)────────
2
+ // 来自 dsh-music-player v1.0.4(MIT),github.com/kendu76/dsh-music-player
3
+ // 原文件 lib/qrc.js(405 行 / 16037 B / sha256 872b8a1eeaa875ea…)
4
+ // 拷入 D:\...\dsh-sidebar-media-player\lib\ 时间 2026-11-10。上游 MIT,版权归原作者。
5
+ /**
6
+ * lib/qrc.js — QQ 音乐逐字歌词(QRC)解密与解析。
7
+ *
8
+ * QRC 是 QQ 客户端渲染卡拉OK歌词用的私有格式:GetPlayLyricInfo 接口返回的
9
+ * `data.lyric` 是一串 hex 编码的密文,解链路为:
10
+ *
11
+ * hex → 按 8 字节块跑「D(K3) → E(K2) → D(K1)」三重分组加密(ECB)
12
+ * → zlib inflate → 去 UTF-8 BOM → 明文(XML 包裹的 QRC 文本)
13
+ * → 逐行解析出 [{ startMs, durMs, text, words:[{text,startMs,durMs}] }]
14
+ *
15
+ * 密码学要点(从公开互操作实现归纳出的算法规格,实现为本项目自有代码):
16
+ * - 三把固定 8 字节密钥:K1="!@#)(*$%" K2="123ZXC!@" K3="!@#)(NHL";
17
+ * - 分组算法是 DES 家族的变体:轮函数/扩展盒/P 盒/S 盒均为标准 DES 数值,
18
+ * 差异在于①密钥位按「两个小端 32 位字拼接」的非常规顺序读取;②PC-2 压缩
19
+ * 置换的表是 0 基索引、且 D 半段消费时用 pos-27 而非 pos-28;③块置换 IP /
20
+ * FP 使用同一非常规位序下的专用规则表。本文实现严格按上述语义复刻。
21
+ * - 每字节最低位作为奇偶校验位被忽略(标准 DES 约定),实际密钥仅 56 位。
22
+ *
23
+ * ⚠️ 合规:该代码仅为让本地播放器解析用户有权访问的歌词数据(个人试听/学习),
24
+ * 与 lib/qq.js 同属非官方接口对接,失败一律静默回退,不做二次分发服务。
25
+ */
26
+
27
+ import { inflateSync, deflateSync } from 'node:zlib'
28
+
29
+ // ---------------------------------------------------------------------
30
+ // 固定常量(QQ 音乐 QRC 算法的公开事实数据)
31
+ // ---------------------------------------------------------------------
32
+
33
+ const KEY_K1 = Buffer.from('!@#)(*$%', 'utf8')
34
+ const KEY_K2 = Buffer.from('123ZXC!@', 'utf8')
35
+ const KEY_K3 = Buffer.from('!@#)(NHL', 'utf8')
36
+
37
+ // 标准 DES S 盒(行优先展平为 64 项:index = row*16 + col)。
38
+ const SBOXES = [
39
+ [
40
+ 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
41
+ 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
42
+ 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
43
+ 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13,
44
+ ],
45
+ [
46
+ 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
47
+ 3, 13, 4, 7, 15, 2, 8, 15, 12, 0, 1, 10, 6, 9, 11, 5,
48
+ 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
49
+ 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9,
50
+ ],
51
+ [
52
+ 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
53
+ 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
54
+ 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
55
+ 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12,
56
+ ],
57
+ [
58
+ 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
59
+ 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
60
+ 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
61
+ 3, 15, 0, 6, 10, 10, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14,
62
+ ], [
63
+ 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
64
+ 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
65
+ 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
66
+ 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3,
67
+ ],
68
+ [
69
+ 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
70
+ 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
71
+ 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
72
+ 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13,
73
+ ],
74
+ [
75
+ 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
76
+ 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
77
+ 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
78
+ 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12,
79
+ ],
80
+ [
81
+ 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
82
+ 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
83
+ 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
84
+ 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11,
85
+ ],
86
+ ]
87
+
88
+ // 标准 DES 扩展盒 E(1 基位号)与 P 盒。
89
+ const E_TABLE = [
90
+ 32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9,
91
+ 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17,
92
+ 16, 17, 18, 19, 20, 21, 20, 21, 22, 23, 24, 25,
93
+ 24, 25, 26, 27, 28, 29, 28, 29, 30, 31, 32, 1,
94
+ ]
95
+ const P_TABLE = [
96
+ 16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10,
97
+ 2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25,
98
+ ]
99
+
100
+ // PC-1 两半(1 基,针对该算法自己的 64 位虚拟位空间)。
101
+ const PC1_C = [56, 48, 40, 32, 24, 16, 8, 0, 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18, 10, 2, 59, 51, 43, 35]
102
+ const PC1_D = [62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 60, 52, 44, 36, 28, 20, 12, 4, 27, 19, 11, 3]
103
+ // 轮内循环左移量(标准 DES 节奏)。
104
+ const SHIFT_SCHEDULE = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1]
105
+ // PC-2(0 基!consumption: pos<28 读 C 半段第 31-pos 位;pos≥28 读 D 半段第 31-(pos-27) 位)。
106
+ const PC2_ZERO_BASED = [
107
+ 13, 16, 10, 23, 0, 4, 2, 27, 14, 5, 20, 9, 22, 18, 11, 3, 25, 7, 15, 6, 26,
108
+ 19, 12, 1, 40, 51, 30, 36, 46, 54, 29, 39, 50, 44, 32, 47, 43, 48, 38, 55, 33,
109
+ 52, 45, 41, 49, 35, 28, 31,
110
+ ]
111
+ // 块初始/逆初始置换规则(1 基,作用于按大端拼装的 64 位块位空间)。
112
+ const BLOCK_IP = [
113
+ 34, 42, 50, 58, 2, 10, 18, 26, 36, 44, 52, 60, 4, 12, 20, 28,
114
+ 38, 46, 54, 62, 6, 14, 22, 30, 40, 48, 56, 64, 8, 16, 24, 32,
115
+ 33, 41, 49, 57, 1, 9, 17, 25, 35, 43, 51, 59, 3, 11, 19, 27,
116
+ 37, 45, 53, 61, 5, 13, 21, 29, 39, 47, 55, 63, 7, 15, 23, 31,
117
+ ]
118
+ const BLOCK_INV_IP = [
119
+ 37, 5, 45, 13, 53, 21, 61, 29, 38, 6, 46, 14, 54, 22, 62, 30,
120
+ 39, 7, 47, 15, 55, 23, 63, 31, 40, 8, 48, 16, 56, 24, 64, 32,
121
+ 33, 1, 41, 9, 49, 17, 57, 25, 34, 2, 42, 10, 50, 18, 58, 26,
122
+ 35, 3, 43, 11, 51, 19, 59, 27, 36, 4, 44, 12, 52, 20, 60, 28,
123
+ ]
124
+
125
+ // ---------------------------------------------------------------------
126
+ // S×P 合并查表:SP[g][sixBits] = P(SBOX[g][sixBits] 左移到半字位置) —— 一次查出省两步。
127
+ // 构建方式与语义:S 输出 4bit 放到该盒对应的 32 位半字槽位(slot g 从高位起),
128
+ // 再按 P 表做位重排。注意本项目实现直接生成组合表,而非分步应用。
129
+ // ---------------------------------------------------------------------
130
+
131
+ // 对 32 位值做 P 盒:输出第 i 位 = 输入第 P_TABLE[i] 位(均以 MSB 为第 1 位计)。
132
+ function applyP(input) {
133
+ let out = 0
134
+ for (let i = 0; i < 32; i++) {
135
+ const srcMask = 1 << (32 - P_TABLE[i])
136
+ if ((input & srcMask) !== 0) out |= 1 << (31 - i)
137
+ }
138
+ return out >>> 0
139
+ }
140
+
141
+ const SP = (() => {
142
+ const tbl = []
143
+ for (let g = 0; g < 8; g++) {
144
+ const per = new Int32Array(64)
145
+ for (let six = 0; six < 64; six++) {
146
+ // 行列抽取约定:bit5 与 bit0 组成 2 位行号,中间 4 位为列号。
147
+ const row = ((six & 0x20) >>> 4) | (six & 1)
148
+ const col = (six >>> 1) & 0xf
149
+ const four = SBOXES[g][row * 16 + col]
150
+ per[six] = applyP(four << (28 - g * 4))
151
+ }
152
+ tbl.push(per)
153
+ }
154
+ return tbl
155
+ })()
156
+
157
+ // ---------------------------------------------------------------------
158
+ // 轮密钥。每轮 48 位子密钥拆成 { hi, lo } 两个 24 位整数(分别异或到扩展后的
159
+ // 高/低 24 位上)。mode='e' 子密钥按轮次正序存放;mode='d' 反序存放——这正是
160
+ /// 「加密方向 / 解密方向」两种密钥编排的全部差异。
161
+ // ---------------------------------------------------------------------
162
+
163
+ // 该算法把 8 字节密钥视作两个独立的小端 32 位字拼接成的虚拟位串:
164
+ // 虚拟位 pos → 字 index=pos>>5;字内 bitInWord=pos&31 →
165
+ // 字节 index = word*4 + 3 - (bitInWord>>3),位 = 7 - (bitInWord&7)。
166
+ function keyVirtualBit(key, pos) {
167
+ const wordIndex = pos >>> 5
168
+ const bitInWord = pos & 31
169
+ const byteInWord = bitInWord >>> 3
170
+ const bitInByte = bitInWord & 7
171
+ return (key[wordIndex * 4 + 3 - byteInWord] >>> (7 - bitInByte)) & 1
172
+ }
173
+
174
+ // 28 位寄存器存放在 32 位整数的 31..4 位(低 4 位恒 0),循环左移在此基础上进行。
175
+ function rot28(v, sh) {
176
+ const m = v & 0xfffffff0
177
+ return (((m << sh) | (m >>> (28 - sh))) & 0xfffffff0) >>> 0
178
+ }
179
+
180
+ // 取寄存器中「逻辑位 idx」:idx=0 对应 31 位(最高有效位)。
181
+ function regBit(reg, idx) {
182
+ return (reg >>> (31 - idx)) & 1
183
+ }
184
+
185
+ export function makeRoundKeys(key8, mode) {
186
+ if (!(key8 instanceof Uint8Array) || key8.length !== 8) throw new Error('qrc: key must be 8 bytes')
187
+ const dir = mode === 'd' ? 'd' : 'e'
188
+ // PC-1 两半 → 虚拟位空间的取法与上面的 keyVirtualBit 相同(pos 即表值)。
189
+ let c = 0
190
+ let d = 0
191
+ let cmask = 1 << (PC1_C.length - 1)
192
+ let dmask = 1 << (PC1_D.length - 1)
193
+ for (let i = 0; i < PC1_C.length; i++) {
194
+ if (keyVirtualBit(key8, PC1_C[i])) c |= cmask
195
+ if (keyVirtualBit(key8, PC1_D[i])) d |= dmask
196
+ cmask >>>= 1
197
+ dmask >>>= 1
198
+ }
199
+ // 把 28 位结果挪到 31..4 的高对齐位置(rot28 的输入要求)。
200
+ c = (c << 4) >>> 0
201
+ d = (d << 4) >>> 0
202
+ const keys = new Array(16)
203
+ for (let round = 0; round < 16; round++) {
204
+ c = rot28(c, SHIFT_SCHEDULE[round])
205
+ d = rot28(d, SHIFT_SCHEDULE[round])
206
+ const slot = dir === 'd' ? 15 - round : round
207
+ let hi = 0
208
+ let lo = 0
209
+ for (let k = 0; k < 48; k++) {
210
+ const p = PC2_ZERO_BASED[k]
211
+ // 双怪癖之二:0 基压缩表,且表值直接作为「寄存器逻辑位号」消费——
212
+ // C 半段读第 31-p 位;D 半段跳过间隔读第 31-(p-27) 位(不是标准的 p-28)。
213
+ const bit = p < 28
214
+ ? ((c >>> (31 - p)) & 1)
215
+ : ((d >>> (31 - (p - 27))) & 1)
216
+ if (bit) {
217
+ if (k < 24) hi |= 1 << (23 - k)
218
+ else lo |= 1 << (47 - k)
219
+ }
220
+ }
221
+ keys[slot] = { hi: hi >>> 0, lo: lo >>> 0 }
222
+ }
223
+ return keys
224
+ }
225
+
226
+ // ---------------------------------------------------------------------
227
+ // 单块加/解密(ECB 一个 8 字节块)。in/out 均为长度 ≥8 的视图。
228
+ // ---------------------------------------------------------------------
229
+
230
+ function blockBitOf64(hi, lo, oneBasedIdx) {
231
+ // 1 基位号:1..32 在 hi,33..64 在 lo(MSB-first)。
232
+ return oneBasedIdx <= 32 ? ((hi >>> (32 - oneBasedIdx)) & 1) : ((lo >>> (64 - oneBasedIdx)) & 1)
233
+ }
234
+
235
+ // 轮函数:E 扩展 → 与子密钥异或 → 8×S 合并查表(P 已并入)。
236
+ function fF(r32, sk) {
237
+ // E 扩展(1 基表值 → 32 位寄存器位)。
238
+ let exHi = 0
239
+ let exLo = 0
240
+ let hmask = 1 << 23
241
+ let lmask = 1 << 23
242
+ for (let i = 0; i < 24; i++) {
243
+ if ((r32 >>> (32 - E_TABLE[i])) & 1) exHi |= hmask
244
+ if ((r32 >>> (32 - E_TABLE[i + 24])) & 1) exLo |= lmask
245
+ hmask >>>= 1
246
+ lmask >>>= 1
247
+ }
248
+ exHi = (exHi ^ sk.hi) >>> 0
249
+ exLo = (exLo ^ sk.lo) >>> 0
250
+ return (
251
+ SP[0][(exHi >>> 18) & 0x3f] |
252
+ SP[1][(exHi >>> 12) & 0x3f] |
253
+ SP[2][(exHi >>> 6) & 0x3f] |
254
+ SP[3][exHi & 0x3f] |
255
+ SP[4][(exLo >>> 18) & 0x3f] |
256
+ SP[5][(exLo >>> 12) & 0x3f] |
257
+ SP[6][(exLo >>> 6) & 0x3f] |
258
+ SP[7][exLo & 0x3f]
259
+ ) >>> 0
260
+ }
261
+
262
+ export function cryptBlock(input, out, keys) {
263
+ // 组装大端 64 位块的两个 32 位半字。
264
+ let hi = 0
265
+ let lo = 0
266
+ for (let i = 0; i < 4; i++) hi = ((hi << 8) | input[i]) >>> 0
267
+ for (let i = 4; i < 8; i++) lo = ((lo << 8) | input[i]) >>> 0
268
+
269
+ // 初始置换。
270
+ let L = 0
271
+ let R = 0
272
+ let lmask = 1 << 31
273
+ let rmask = 1 << 31
274
+ for (let i = 0; i < 64; i++) {
275
+ if (blockBitOf64(hi, lo, BLOCK_IP[i])) {
276
+ if (i < 32) L |= lmask
277
+ else R |= rmask
278
+ }
279
+ if (i === 31) lmask = rmask = 1 << 31
280
+ else {
281
+ lmask >>>= 1
282
+ rmask >>>= 1
283
+ }
284
+ }
285
+
286
+ // 16 轮 Feistel:前 15 轮显式交换,第 16 轮只异或不交换。
287
+ for (let r = 0; r < 15; r++) {
288
+ const tmp = R
289
+ R = (L ^ fF(R, keys[r])) >>> 0
290
+ L = tmp
291
+ }
292
+ L = (L ^ fF(R, keys[15])) >>> 0
293
+
294
+ // 逆初始置换后按 (L, R) 大端写出。
295
+ let oh = 0
296
+ let ol = 0
297
+ lmask = 1 << 31
298
+ rmask = 1 << 31
299
+ for (let i = 0; i < 64; i++) {
300
+ const src = blockBitOf64(L, R, BLOCK_INV_IP[i])
301
+ if (src) {
302
+ if (i < 32) oh |= lmask
303
+ else ol |= rmask
304
+ }
305
+ if (i === 31) lmask = rmask = 1 << 31
306
+ else {
307
+ lmask >>>= 1
308
+ rmask >>>= 1
309
+ }
310
+ }
311
+ out[0] = (oh >>> 24) & 0xff
312
+ out[1] = (oh >>> 16) & 0xff
313
+ out[2] = (oh >>> 8) & 0xff
314
+ out[3] = oh & 0xff
315
+ out[4] = (ol >>> 24) & 0xff
316
+ out[5] = (ol >>> 16) & 0xff
317
+ out[6] = (ol >>> 8) & 0xff
318
+ out[7] = ol & 0xff
319
+ }
320
+
321
+ /** 解密一组 hex 密文(QQ音乐 GetPlayLyricInfo data.lyric 原样字符串)→ QRC 明文。 */
322
+ export function decryptHex(hexStr) {
323
+ if (typeof hexStr !== 'string' || hexStr.trim() === '') throw new Error('qrc: empty cipher')
324
+ const enc = Buffer.from(hexStr, 'hex')
325
+ if (enc.length === 0 || enc.length % 8 !== 0) throw new Error(`qrc: cipher length ${enc.length} not multiple of 8`)
326
+ // 解密方向固定:D(K3) → E(K2) → D(K1)。
327
+ const ks3 = makeRoundKeys(KEY_K3, 'd')
328
+ const ks2 = makeRoundKeys(KEY_K2, 'e')
329
+ const ks1 = makeRoundKeys(KEY_K1, 'd')
330
+ const dec = Buffer.alloc(enc.length)
331
+ const t1 = Buffer.alloc(8)
332
+ const t2 = Buffer.alloc(8)
333
+ for (let off = 0; off < enc.length; off += 8) {
334
+ cryptBlock(enc.subarray(off, off + 8), t1, ks3)
335
+ cryptBlock(t1, t2, ks2)
336
+ cryptBlock(t2, dec.subarray(off, off + 8), ks1)
337
+ }
338
+ let plain = inflateSync(dec)
339
+ if (plain.length >= 3 && plain[0] === 0xef && plain[1] === 0xbb && plain[2] === 0xbf) plain = plain.subarray(3)
340
+ return plain.toString('utf8')
341
+ }
342
+
343
+ /**
344
+ * 加密(decryptHex 的逆过程):明文 UTF-8 → zlib deflate → 零填充到 8 字节倍数
345
+ * → 每块跑 E(K1) → D(K2) → E(K3)。仅用于自测回环与协议理解,线上只消费密文。
346
+ * @returns {string} hex 密文
347
+ */
348
+ export function encryptHex(text) {
349
+ const raw = Buffer.from(String(text ?? ''), 'utf8')
350
+ const compressed = deflateSync(raw)
351
+ const paddedLen = Math.ceil(compressed.length / 8) * 8
352
+ const padded = Buffer.alloc(paddedLen) // 零填充
353
+ compressed.copy(padded)
354
+ const ek1 = makeRoundKeys(KEY_K1, 'e')
355
+ const dk2 = makeRoundKeys(KEY_K2, 'd')
356
+ const ek3 = makeRoundKeys(KEY_K3, 'e')
357
+ const out = Buffer.alloc(paddedLen)
358
+ const t1 = Buffer.alloc(8)
359
+ const t2 = Buffer.alloc(8)
360
+ for (let off = 0; off < paddedLen; off += 8) {
361
+ cryptBlock(padded.subarray(off, off + 8), t1, ek1)
362
+ cryptBlock(t1, t2, dk2)
363
+ cryptBlock(t2, out.subarray(off, off + 8), ek3)
364
+ }
365
+ return out.toString('hex')
366
+ }
367
+
368
+ // ---------------------------------------------------------------------
369
+ // QRC 明文解析:每行形如 [起始ms,时长ms]词(词起始ms,词时长ms)词(...)
370
+ // 元数据行([ar:] 等)与 XML 包裹行跳过。空文本/无逐词标记的行忽略。
371
+ // ---------------------------------------------------------------------
372
+
373
+ const LINE_RE = /^\[(\d+),(\d+)\](.*)$/
374
+ const WORD_RE = /\((\d+),(\d+)\)/g
375
+
376
+ /**
377
+ * 解析 QRC 明文 → 行数组 [{ startMs, durMs, text, words:[{ text, startMs, durMs }] }]。
378
+ * text 已去掉逐词时间标记;words 为空数组时表示该行无可用的逐字时间轴(调用方可回退整行扫色)。
379
+ */
380
+ export function parseQrc(text) {
381
+ const out = []
382
+ for (const rawLine of String(text || '').split(/\r?\n/)) {
383
+ const line = rawLine.trim()
384
+ if (line === '') continue
385
+ const m = LINE_RE.exec(line)
386
+ if (!m) continue // XML 头/[ar:] 元数据/其它包裹行
387
+ const startMs = Number(m[1])
388
+ const durMs = Number(m[2])
389
+ if (!Number.isFinite(startMs) || !Number.isFinite(durMs)) continue
390
+ const content = m[3]
391
+ const words = []
392
+ let plainText = ''
393
+ let cursor = 0
394
+ WORD_RE.lastIndex = 0
395
+ let w
396
+ while ((w = WORD_RE.exec(content)) !== null) {
397
+ // QRC 词序约定:时间标记跟在它所标注的文本段之后。
398
+ const textBefore = content.slice(cursor, w.index)
399
+ plainText += textBefore
400
+ words.push({ text: textBefore, startMs: Number(w[1]), durMs: Number(w[2]) })
401
+ cursor = w.index + w[0].length
402
+ }
403
+ plainText += content.slice(cursor)
404
+ const t = plainText.replace(/\u0000/g, '').trim()
405
+ if (t === '') continue
406
+ out.push({ startMs, durMs: Math.max(0, durMs), text: t, words })
407
+ }
408
+ return out
409
+ }
package/package.json CHANGED
@@ -1,61 +1,65 @@
1
- {
2
- "name": "dsh-sidebar-media-player",
3
- "version": "0.2.0",
4
- "description": "Unified audio + video player for dsh-better-sidebar: one file viewer for mp4/webm/mov/m4v/ogv and mp3/wav/flac/ogg/opus/m4a/aac, with a draggable whole-track scrubber, live spectrum bars and pitch (Hz + note name), streamed from a Range(206) host route so seeking really works.",
5
- "type": "module",
6
- "main": "lib/index.js",
7
- "files": [
8
- "lib/**",
9
- "cordis.patch.yml",
10
- "README.md",
11
- "CHANGELOG.md",
12
- "screenshots.json",
13
- "docs/screenshots/**"
14
- ],
15
- "exports": {
16
- ".": "./lib/index.js",
17
- "./client": {
18
- "default": "./lib/client.js"
19
- },
20
- "./package.json": "./package.json"
21
- },
22
- "keywords": [
23
- "dsh",
24
- "dsh-plugin",
25
- "deepseek-harness",
26
- "better-sidebar",
27
- "media",
28
- "audio",
29
- "video",
30
- "player",
31
- "spectrum",
32
- "pitch",
33
- "file-viewer",
34
- "range-request"
35
- ],
36
- "license": "MIT",
37
- "author": "loyalchiiina",
38
- "repository": {
39
- "type": "git",
40
- "url": "git+https://github.com/loyalchiiina/dsh-sidebar-media-player.git"
41
- },
42
- "engines": {
43
- "node": "^22.19.0 || >=24.0.0",
44
- "dsh": ">=0.2.2-rc.1"
45
- },
46
- "peerDependencies": {
47
- "@deepseek-ai/cordis": "^4.0.2",
48
- "@deepseek-ai/dsh": ">=0.2.2-rc.1"
49
- },
50
- "dsh": {
51
- "bundle": {
52
- "patch": "./cordis.patch.yml"
53
- },
54
- "client": {
55
- "inject": [
56
- "@deepseek-ai/dsh-client-runtime"
57
- ],
58
- "platform": "web"
59
- }
60
- }
61
- }
1
+ {
2
+ "name": "dsh-sidebar-media-player",
3
+ "version": "0.2.4",
4
+ "description": "Unified audio + video player for dsh-better-sidebar: one file viewer for mp4/webm/mov/m4v/ogv and mp3/wav/flac/ogg/opus/m4a/aac, with a draggable whole-track scrubber, live spectrum bars and pitch (Hz + note name), streamed from a Range(206) host route so seeking really works.",
5
+ "type": "module",
6
+ "main": "lib/index.js",
7
+ "files": [
8
+ "lib/**",
9
+ "cordis.patch.yml",
10
+ "README.md",
11
+ "CHANGELOG.md",
12
+ "screenshots.json",
13
+ "docs/screenshots/**",
14
+ "!lib/*.bak*",
15
+ "!lib/**/*.bak*",
16
+ "!lib/*.BROKEN*"
17
+ ],
18
+ "exports": {
19
+ ".": "./lib/index.js",
20
+ "./client": {
21
+ "default": "./lib/client.js"
22
+ },
23
+ "./package.json": "./package.json"
24
+ },
25
+ "keywords": [
26
+ "dsh",
27
+ "dsh-plugin",
28
+ "deepseek-harness",
29
+ "better-sidebar",
30
+ "media",
31
+ "audio",
32
+ "video",
33
+ "player",
34
+ "spectrum",
35
+ "pitch",
36
+ "file-viewer",
37
+ "range-request"
38
+ ],
39
+ "license": "MIT",
40
+ "author": "loyalchiiina",
41
+ "repository": {
42
+ "type": "git",
43
+ "url": "git+https://github.com/loyalchiiina/dsh-sidebar-media-player.git"
44
+ },
45
+ "engines": {
46
+ "node": "^22.19.0 || >=24.0.0",
47
+ "dsh": ">=0.2.2-rc.1"
48
+ },
49
+ "peerDependencies": {
50
+ "@deepseek-ai/cordis": "^4.0.2",
51
+ "@deepseek-ai/dsh": ">=0.2.2-rc.1"
52
+ },
53
+ "dsh": {
54
+ "bundle": {
55
+ "patch": "./cordis.patch.yml"
56
+ },
57
+ "client": {
58
+ "inject": [
59
+ "@deepseek-ai/dsh-client-runtime",
60
+ "@deepseek-ai/dsh-client-ui-slots"
61
+ ],
62
+ "platform": "web"
63
+ }
64
+ }
65
+ }