@kimposoft/plugin-sdk 0.0.0-stage → 1.1.0-tp.22

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.
Files changed (46) hide show
  1. package/LICENSE +202 -0
  2. package/NOTICE +9 -0
  3. package/README.md +48 -2
  4. package/package.json +145 -4
  5. package/src/action-designer.ts +267 -0
  6. package/src/attachment-open.ts +574 -0
  7. package/src/attachment-url.ts +235 -0
  8. package/src/auth/index.ts +6 -0
  9. package/src/auth/qrcode.ts +519 -0
  10. package/src/auth/types.ts +261 -0
  11. package/src/display-style.ts +532 -0
  12. package/src/editor-frame.ts +625 -0
  13. package/src/editor-session.ts +1214 -0
  14. package/src/editor-testing.ts +838 -0
  15. package/src/editor.ts +1720 -0
  16. package/src/frame-transport.ts +516 -0
  17. package/src/frontend-routes.ts +99 -0
  18. package/src/hooks.ts +48 -0
  19. package/src/host-caps.ts +93 -0
  20. package/src/i18n.ts +238 -0
  21. package/src/im-panel.ts +132 -0
  22. package/src/image-tools.ts +91 -0
  23. package/src/index.ts +125 -0
  24. package/src/interactive-session.ts +94 -0
  25. package/src/nahida-im.ts +391 -0
  26. package/src/nahida-ws.ts +23 -0
  27. package/src/org-directory.ts +78 -0
  28. package/src/oz-realtime.ts +144 -0
  29. package/src/page.ts +591 -0
  30. package/src/print.ts +393 -0
  31. package/src/surface.ts +310 -0
  32. package/src/theme-mocks.ts +140 -0
  33. package/src/theme.ts +125 -0
  34. package/src/ui-fixtures/attachment.ts +24 -0
  35. package/src/ui-fixtures/confirm.ts +16 -0
  36. package/src/ui-fixtures/entity-picker.ts +24 -0
  37. package/src/ui-fixtures/expression-editor.ts +52 -0
  38. package/src/ui-fixtures/image-cropper.ts +23 -0
  39. package/src/ui-fixtures/index.ts +17 -0
  40. package/src/ui-fixtures/org-tri-picker.ts +19 -0
  41. package/src/ui-fixtures/prompt.ts +19 -0
  42. package/src/ui-fixtures/record-picker.ts +17 -0
  43. package/src/ui-fixtures/template-picker.ts +13 -0
  44. package/src/ui-mocks.ts +264 -0
  45. package/src/ui.ts +491 -0
  46. package/src/workflow-designer.ts +475 -0
@@ -0,0 +1,519 @@
1
+ // QrCodeRenderer —— 登录页插件 qr kind 自渲染工具("SDK 另提供 QrCodeRenderer(content, size?) → svg
2
+ // 工具(qr_content 自渲染用),不要自带 qrcode 库")。
3
+ //
4
+ // 零依赖、纯 TS 手写 QR Code Model 2 编码器:字节模式(byte mode)+ 纠错级别 M + 固定掩码 0。
5
+ // 范围收窄说明(工程取舍,见交接报告):支持 version 1~10(ECC-M 字节模式容量上限 213 字节),
6
+ // 覆盖登录二维码常见内容(会话 ID / 短 URL / token);version 按内容长度自适应选择最小可容纳版本,
7
+ // 超出上限直接抛错,不做静默截断(截断会生成一个"能画出来但扫不出正确内容"的二维码,比抛错更危险)。
8
+ // 掩码固定用 pattern 0((row+col)%2===0 时反转),不做 8 掩码惩罚分最优选择——这是 QR 规范允许的合法
9
+ // 掩码之一(结果对扫码器而言是完整可解码的合规二维码,只是不保证像素级"最美观"),换取实现体量可控。
10
+
11
+ /** GF(256) 对数/反对数表,QR 规范固定本原多项式 x^8+x^4+x^3+x^2+1 (0x11D),本原根 2。 */
12
+ const GF_EXP = new Uint8Array(512);
13
+ const GF_LOG = new Uint8Array(256);
14
+ (function initGaloisField(): void {
15
+ let x = 1;
16
+ for (let i = 0; i < 255; i++) {
17
+ GF_EXP[i] = x;
18
+ GF_LOG[x] = i;
19
+ x <<= 1;
20
+ if (x & 0x100) x ^= 0x11d;
21
+ }
22
+ for (let i = 255; i < 512; i++) GF_EXP[i] = GF_EXP[i - 255];
23
+ })();
24
+
25
+ function gfMul(a: number, b: number): number {
26
+ if (a === 0 || b === 0) return 0;
27
+ return GF_EXP[GF_LOG[a] + GF_LOG[b]];
28
+ }
29
+
30
+ /** 生成 Reed-Solomon 生成多项式(度数 = ecCount),系数从高到低排列,[0] 恒为 1。 */
31
+ function rsGeneratorPolynomial(ecCount: number): number[] {
32
+ let poly = [1];
33
+ for (let i = 0; i < ecCount; i++) {
34
+ // poly *= (x - GF_EXP[i]),GF(256) 中减法即异或。
35
+ const next = new Array(poly.length + 1).fill(0);
36
+ for (let j = 0; j < poly.length; j++) {
37
+ next[j] ^= poly[j];
38
+ next[j + 1] ^= gfMul(poly[j], GF_EXP[i]);
39
+ }
40
+ poly = next;
41
+ }
42
+ return poly;
43
+ }
44
+
45
+ /** 对一组数据码字做 RS 编码,返回 ecCount 个纠错码字。 */
46
+ function rsEncode(dataCodewords: number[], ecCount: number): number[] {
47
+ const generator = rsGeneratorPolynomial(ecCount);
48
+ const remainder = new Array(dataCodewords.length + ecCount).fill(0);
49
+ for (let i = 0; i < dataCodewords.length; i++) remainder[i] = dataCodewords[i];
50
+ for (let i = 0; i < dataCodewords.length; i++) {
51
+ const coef = remainder[i];
52
+ if (coef === 0) continue;
53
+ for (let j = 0; j < generator.length; j++) {
54
+ remainder[i + j] ^= gfMul(generator[j], coef);
55
+ }
56
+ }
57
+ return remainder.slice(dataCodewords.length, dataCodewords.length + ecCount);
58
+ }
59
+
60
+ /**
61
+ * 版本参数表(ECC level M,version 1~10)。
62
+ * totalCodewords/ecPerBlock/group1/group2 取自 ISO/IEC 18004 标准表(与业界通用 QR 编码器
63
+ * 如 kazuhikoarase/qrcode-generator 的 RS_BLOCK_TABLE 一致),group1/group2 表示两组不同长度的分块。
64
+ */
65
+ interface VersionSpec {
66
+ version: number;
67
+ totalCodewords: number;
68
+ ecPerBlock: number;
69
+ group1: { blocks: number; dataPerBlock: number };
70
+ group2: { blocks: number; dataPerBlock: number };
71
+ /** 该版本末尾额外补的 remainder bits 数(模块矩阵不是 8 的整数倍时的填充)。 */
72
+ remainderBits: number;
73
+ /** 对齐图案中心坐标候选表(不含与定位图案重叠的组合);version 1 为空。 */
74
+ alignmentCoords: number[];
75
+ }
76
+
77
+ const VERSION_SPECS: VersionSpec[] = [
78
+ { version: 1, totalCodewords: 26, ecPerBlock: 10, group1: { blocks: 1, dataPerBlock: 16 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 0, alignmentCoords: [] },
79
+ { version: 2, totalCodewords: 44, ecPerBlock: 16, group1: { blocks: 1, dataPerBlock: 28 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 7, alignmentCoords: [6, 18] },
80
+ { version: 3, totalCodewords: 70, ecPerBlock: 26, group1: { blocks: 1, dataPerBlock: 44 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 7, alignmentCoords: [6, 22] },
81
+ { version: 4, totalCodewords: 100, ecPerBlock: 18, group1: { blocks: 2, dataPerBlock: 32 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 7, alignmentCoords: [6, 26] },
82
+ { version: 5, totalCodewords: 134, ecPerBlock: 24, group1: { blocks: 2, dataPerBlock: 43 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 7, alignmentCoords: [6, 30] },
83
+ { version: 6, totalCodewords: 172, ecPerBlock: 16, group1: { blocks: 4, dataPerBlock: 27 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 7, alignmentCoords: [6, 34] },
84
+ { version: 7, totalCodewords: 196, ecPerBlock: 18, group1: { blocks: 4, dataPerBlock: 31 }, group2: { blocks: 0, dataPerBlock: 0 }, remainderBits: 0, alignmentCoords: [6, 22, 38] },
85
+ { version: 8, totalCodewords: 242, ecPerBlock: 22, group1: { blocks: 2, dataPerBlock: 38 }, group2: { blocks: 2, dataPerBlock: 39 }, remainderBits: 0, alignmentCoords: [6, 24, 42] },
86
+ { version: 9, totalCodewords: 292, ecPerBlock: 22, group1: { blocks: 3, dataPerBlock: 36 }, group2: { blocks: 2, dataPerBlock: 37 }, remainderBits: 0, alignmentCoords: [6, 26, 46] },
87
+ { version: 10, totalCodewords: 346, ecPerBlock: 26, group1: { blocks: 4, dataPerBlock: 43 }, group2: { blocks: 1, dataPerBlock: 44 }, remainderBits: 0, alignmentCoords: [6, 28, 50] }
88
+ ];
89
+
90
+ function totalDataCodewords(spec: VersionSpec): number {
91
+ return spec.group1.blocks * spec.group1.dataPerBlock + spec.group2.blocks * spec.group2.dataPerBlock;
92
+ }
93
+
94
+ /** 字节模式字符计数指示符位数:version 1~9 为 8 位,10~40 为 16 位(本模块只到 10)。 */
95
+ function charCountBits(version: number): number {
96
+ return version <= 9 ? 8 : 16;
97
+ }
98
+
99
+ /** 字节模式最大可容纳字节数(含 mode+计数指示符开销后的剩余容量)。 */
100
+ function byteModeCapacity(spec: VersionSpec): number {
101
+ const totalBits = totalDataCodewords(spec) * 8;
102
+ const usableBits = totalBits - 4 - charCountBits(spec.version);
103
+ return Math.floor(usableBits / 8);
104
+ }
105
+
106
+ /** 按内容字节长度挑最小可容纳的 version(1~10);超出全部版本容量则抛错,不做截断。 */
107
+ function pickVersion(byteLength: number): VersionSpec {
108
+ for (const spec of VERSION_SPECS) {
109
+ if (byteModeCapacity(spec) >= byteLength) return spec;
110
+ }
111
+ const maxCap = byteModeCapacity(VERSION_SPECS[VERSION_SPECS.length - 1]);
112
+ throw new Error(
113
+ `QrCodeRenderer: content too long (${byteLength} bytes), exceeds max supported capacity ` +
114
+ `(version 10 / ECC-M byte mode = ${maxCap} bytes). Shorten qrContent.`
115
+ );
116
+ }
117
+
118
+ /** 简单位缓冲区:push 若干位(MSB 优先),最终导出为 0/1 数组。 */
119
+ class BitBuffer {
120
+ private bits: number[] = [];
121
+
122
+ pushBits(value: number, length: number): void {
123
+ for (let i = length - 1; i >= 0; i--) {
124
+ this.bits.push((value >>> i) & 1);
125
+ }
126
+ }
127
+
128
+ get length(): number {
129
+ return this.bits.length;
130
+ }
131
+
132
+ toBytes(): number[] {
133
+ const bytes: number[] = [];
134
+ for (let i = 0; i < this.bits.length; i += 8) {
135
+ let byte = 0;
136
+ for (let j = 0; j < 8; j++) {
137
+ byte = (byte << 1) | (this.bits[i + j] ?? 0);
138
+ }
139
+ bytes.push(byte);
140
+ }
141
+ return bytes;
142
+ }
143
+ }
144
+
145
+ /** UTF-8 编码字符串为字节数组(不依赖 Buffer/TextEncoder,兼容任意运行时)。 */
146
+ function utf8Bytes(text: string): number[] {
147
+ const bytes: number[] = [];
148
+ for (let i = 0; i < text.length; i++) {
149
+ let code = text.codePointAt(i)!;
150
+ if (code > 0xffff) i++; // 代理对占两个 UTF-16 code unit,多跳一位
151
+ if (code < 0x80) {
152
+ bytes.push(code);
153
+ } else if (code < 0x800) {
154
+ bytes.push(0xc0 | (code >> 6), 0x80 | (code & 0x3f));
155
+ } else if (code < 0x10000) {
156
+ bytes.push(0xe0 | (code >> 12), 0x80 | ((code >> 6) & 0x3f), 0x80 | (code & 0x3f));
157
+ } else {
158
+ bytes.push(
159
+ 0xf0 | (code >> 18),
160
+ 0x80 | ((code >> 12) & 0x3f),
161
+ 0x80 | ((code >> 6) & 0x3f),
162
+ 0x80 | (code & 0x3f)
163
+ );
164
+ }
165
+ }
166
+ return bytes;
167
+ }
168
+
169
+ /** 构造最终交织码字序列(数据区按分组交织 + 纠错区交织 + remainder bits)。 */
170
+ function buildFinalCodewords(spec: VersionSpec, dataBytes: number[]): number[] {
171
+ const dataCapacity = totalDataCodewords(spec);
172
+
173
+ const buf = new BitBuffer();
174
+ buf.pushBits(0b0100, 4); // mode indicator: byte mode
175
+ buf.pushBits(dataBytes.length, charCountBits(spec.version));
176
+ for (const b of dataBytes) buf.pushBits(b, 8);
177
+
178
+ // terminator:最多补 4 个 0(不超过剩余容量)
179
+ const capacityBits = dataCapacity * 8;
180
+ const terminatorLen = Math.min(4, Math.max(0, capacityBits - buf.length));
181
+ buf.pushBits(0, terminatorLen);
182
+ // 补齐到字节边界
183
+ const padToByte = (8 - (buf.length % 8)) % 8;
184
+ buf.pushBits(0, padToByte);
185
+
186
+ const dataCodewords = buf.toBytes();
187
+ // pad codewords:0xEC/0x11 交替补满
188
+ const padBytes = [0xec, 0x11];
189
+ let padIdx = 0;
190
+ while (dataCodewords.length < dataCapacity) {
191
+ dataCodewords.push(padBytes[padIdx % 2]);
192
+ padIdx++;
193
+ }
194
+
195
+ // 分组切块
196
+ const blocks: number[][] = [];
197
+ let offset = 0;
198
+ for (let i = 0; i < spec.group1.blocks; i++) {
199
+ blocks.push(dataCodewords.slice(offset, offset + spec.group1.dataPerBlock));
200
+ offset += spec.group1.dataPerBlock;
201
+ }
202
+ for (let i = 0; i < spec.group2.blocks; i++) {
203
+ blocks.push(dataCodewords.slice(offset, offset + spec.group2.dataPerBlock));
204
+ offset += spec.group2.dataPerBlock;
205
+ }
206
+
207
+ const ecBlocks = blocks.map(block => rsEncode(block, spec.ecPerBlock));
208
+
209
+ // 数据区交织:按列取各块同下标字节,短块提前结束时跳过
210
+ const maxDataLen = Math.max(...blocks.map(b => b.length));
211
+ const interleavedData: number[] = [];
212
+ for (let col = 0; col < maxDataLen; col++) {
213
+ for (const block of blocks) {
214
+ if (col < block.length) interleavedData.push(block[col]);
215
+ }
216
+ }
217
+ // 纠错区交织(各块 ec 长度固定相同 = spec.ecPerBlock)
218
+ const interleavedEc: number[] = [];
219
+ for (let col = 0; col < spec.ecPerBlock; col++) {
220
+ for (const ec of ecBlocks) interleavedEc.push(ec[col]);
221
+ }
222
+
223
+ return interleavedData.concat(interleavedEc);
224
+ }
225
+
226
+ type Modules = Uint8Array; // 0/1,按 row-major 存储,size*size
227
+
228
+ interface Matrix {
229
+ size: number;
230
+ modules: Modules;
231
+ isFunction: Uint8Array; // 1 = 功能图案/保留区域,不参与掩码与数据填充
232
+ }
233
+
234
+ function createMatrix(size: number): Matrix {
235
+ return { size, modules: new Uint8Array(size * size), isFunction: new Uint8Array(size * size) };
236
+ }
237
+
238
+ function setModule(m: Matrix, row: number, col: number, dark: boolean, isFunc = true): void {
239
+ if (row < 0 || row >= m.size || col < 0 || col >= m.size) return;
240
+ const idx = row * m.size + col;
241
+ m.modules[idx] = dark ? 1 : 0;
242
+ if (isFunc) m.isFunction[idx] = 1;
243
+ }
244
+
245
+ function getModule(m: Matrix, row: number, col: number): number {
246
+ return m.modules[row * m.size + col];
247
+ }
248
+
249
+ function isFunctionModule(m: Matrix, row: number, col: number): boolean {
250
+ return m.isFunction[row * m.size + col] === 1;
251
+ }
252
+
253
+ /** 画 7x7 定位图案:中心 3x3 深色 + 一圈浅色分隔环 + 最外圈 7x7 深色边框(超界部分自动裁剪)。 */
254
+ function drawFinderPattern(m: Matrix, centerRow: number, centerCol: number): void {
255
+ for (let dr = -4; dr <= 4; dr++) {
256
+ for (let dc = -4; dc <= 4; dc++) {
257
+ const r = centerRow + dr;
258
+ const c = centerCol + dc;
259
+ if (r < 0 || r >= m.size || c < 0 || c >= m.size) continue;
260
+ const dist = Math.max(Math.abs(dr), Math.abs(dc)); // Chebyshev 距离
261
+ let dark: boolean;
262
+ if (dist <= 1) dark = true; // 中心 3x3
263
+ else if (dist === 2) dark = false; // 浅色分隔环
264
+ else dark = true; // 最外圈 7x7 深色边框
265
+ setModule(m, r, c, dark, true);
266
+ }
267
+ }
268
+ }
269
+
270
+ /** 画三个定位图案 + 分隔带(分隔带 = 8x8 定位区块内非定位图案本体的部分,恒浅色)。 */
271
+ function drawFinderPatternsAndSeparators(m: Matrix): void {
272
+ const positions: Array<[number, number]> = [
273
+ [3, 3],
274
+ [3, m.size - 4],
275
+ [m.size - 4, 3]
276
+ ];
277
+ for (const [r, c] of positions) {
278
+ drawFinderPattern(m, r, c);
279
+ }
280
+ // 分隔带:以每个 8x8 定位区块(含 1 模块白边)为范围,超出 7x7 主体的部分标记浅色 function
281
+ const blocks: Array<[number, number]> = [
282
+ [0, 0],
283
+ [0, m.size - 8],
284
+ [m.size - 8, 0]
285
+ ];
286
+ for (const [top, left] of blocks) {
287
+ for (let r = top; r < top + 8; r++) {
288
+ for (let c = left; c < left + 8; c++) {
289
+ if (r < 0 || r >= m.size || c < 0 || c >= m.size) continue;
290
+ const idx = r * m.size + c;
291
+ if (m.isFunction[idx] === 1) continue; // 定位图案本体已画
292
+ m.isFunction[idx] = 1;
293
+ m.modules[idx] = 0; // 分隔带恒浅色
294
+ }
295
+ }
296
+ }
297
+ }
298
+
299
+ /** 画定位图案角上的 dark module(固定深色,坐标 (4*version+9, 8))。 */
300
+ function drawDarkModule(m: Matrix, version: number): void {
301
+ setModule(m, 4 * version + 9, 8, true, true);
302
+ }
303
+
304
+ /** 画时序图案(行 6、列 6,交替深浅,从索引 8 到 size-9)。 */
305
+ function drawTimingPatterns(m: Matrix): void {
306
+ for (let i = 8; i < m.size - 8; i++) {
307
+ const dark = i % 2 === 0;
308
+ setModule(m, 6, i, dark, true);
309
+ setModule(m, i, 6, dark, true);
310
+ }
311
+ }
312
+
313
+ /** 画对齐图案(5x5,中心深色,次外圈浅色,最外圈深色),跳过与定位图案重叠的候选中心。 */
314
+ function drawAlignmentPatterns(m: Matrix, spec: VersionSpec): void {
315
+ const coords = spec.alignmentCoords;
316
+ if (coords.length === 0) return;
317
+ for (const row of coords) {
318
+ for (const col of coords) {
319
+ // 与三个定位图案重叠的候选位置跳过(左上/右上/左下角)
320
+ const nearTopLeft = row <= 7 && col <= 7;
321
+ const nearTopRight = row <= 7 && col >= m.size - 8;
322
+ const nearBottomLeft = row >= m.size - 8 && col <= 7;
323
+ if (nearTopLeft || nearTopRight || nearBottomLeft) continue;
324
+ for (let dr = -2; dr <= 2; dr++) {
325
+ for (let dc = -2; dc <= 2; dc++) {
326
+ const dist = Math.max(Math.abs(dr), Math.abs(dc));
327
+ const dark = dist !== 1;
328
+ setModule(m, row + dr, col + dc, dark, true);
329
+ }
330
+ }
331
+ }
332
+ }
333
+ }
334
+
335
+ /** BCH(15,5) 格式信息编码:5 位数据(2 位纠错级 + 3 位掩码号)→ 15 位,异或掩码 0x5412。 */
336
+ function encodeFormatInfo(maskPattern: number): number {
337
+ // ECC level 2-bit 指示:L=01 M=00 Q=11 H=10(QR 规范固定映射);本实现固定 ECC-M → 00。
338
+ const eccBits = 0b00;
339
+ const data = (eccBits << 3) | maskPattern; // 5 位
340
+ let rem = data << 10;
341
+ const generator = 0b10100110111; // g(x) = x^10+x^8+x^5+x^4+x^2+x+1 (0x537)
342
+ for (let i = 4; i >= 0; i--) {
343
+ if ((rem >> (i + 10)) & 1) {
344
+ rem ^= generator << i;
345
+ }
346
+ }
347
+ const combined = ((data << 10) | rem) ^ 0b101010000010010; // mask 0x5412
348
+ return combined & 0x7fff;
349
+ }
350
+
351
+ /** BCH(18,6) 版本信息编码(仅 version>=7 需要):6 位版本号 → 18 位,无掩码异或。 */
352
+ function encodeVersionInfo(version: number): number {
353
+ let rem = version << 12;
354
+ const generator = 0b1111100100101; // g(x) = 0x1F25,13 位
355
+ for (let i = 5; i >= 0; i--) {
356
+ if ((rem >> (i + 12)) & 1) {
357
+ rem ^= generator << i;
358
+ }
359
+ }
360
+ return (version << 12) | rem;
361
+ }
362
+
363
+ /** 画格式信息两处副本(固定坐标,围绕左上定位图案 + 右上/左下)。 */
364
+ function drawFormatInfo(m: Matrix, maskPattern: number): void {
365
+ const bits = encodeFormatInfo(maskPattern);
366
+ const size = m.size;
367
+ const get = (i: number): boolean => ((bits >> i) & 1) === 1;
368
+
369
+ // 副本 1:左上角周边(跳过时序图案交叉点 col=6/row=6)
370
+ const copy1Col = [0, 1, 2, 3, 4, 5, 7, 8];
371
+ for (let i = 0; i < 8; i++) setModule(m, 8, copy1Col[i], get(i), true);
372
+ const copy1Row = [8, 7, 5, 4, 3, 2, 1, 0];
373
+ for (let i = 0; i < 8; i++) setModule(m, copy1Row[i], 8, get(i + 7), true);
374
+
375
+ // 副本 2:右上角一行(列 size-1..size-8)+ 左下角一列(行 size-1..size-7)
376
+ for (let i = 0; i < 8; i++) setModule(m, 8, size - 1 - i, get(i), true);
377
+ for (let i = 0; i < 7; i++) setModule(m, size - 1 - i, 8, get(i + 8), true);
378
+ // dark module 一直为深色(固定功能模块,格式信息副本之外单独处理,此处 setModule 顺序已覆盖 (size-8,8) 由 drawDarkModule 兜底)
379
+ }
380
+
381
+ /** 画版本信息两处 6x3 副本(仅 version >= 7)。 */
382
+ function drawVersionInfo(m: Matrix, version: number): void {
383
+ if (version < 7) return;
384
+ const bits = encodeVersionInfo(version);
385
+ const size = m.size;
386
+ const get = (i: number): boolean => ((bits >> i) & 1) === 1;
387
+ // 副本 1:右上角,6 行 x 3 列(size-11..size-9 列,0..5 行)
388
+ for (let i = 0; i < 18; i++) {
389
+ const row = Math.floor(i / 3);
390
+ const col = i % 3;
391
+ setModule(m, row, size - 11 + col, get(i), true);
392
+ }
393
+ // 副本 2:左下角,3 行 x 6 列(转置)
394
+ for (let i = 0; i < 18; i++) {
395
+ const row = Math.floor(i / 3);
396
+ const col = i % 3;
397
+ setModule(m, size - 11 + col, row, get(i), true);
398
+ }
399
+ }
400
+
401
+ /** 掩码 pattern 0:(row+col) % 2 === 0 时反转对应模块(仅作用于非功能模块)。 */
402
+ function applyMask0(m: Matrix): void {
403
+ for (let r = 0; r < m.size; r++) {
404
+ for (let c = 0; c < m.size; c++) {
405
+ if (isFunctionModule(m, r, c)) continue;
406
+ if ((r + c) % 2 === 0) {
407
+ const idx = r * m.size + c;
408
+ m.modules[idx] ^= 1;
409
+ }
410
+ }
411
+ }
412
+ }
413
+
414
+ /**
415
+ * 按 QR 规范 zigzag 顺序把码字位填入非功能模块:从右下角开始,每两列一组向上/向下之字形扫描,
416
+ * 列指针本身在遇到 col===6(时序列)时坍缩为 5(即与标准参考实现一致地"就地改写循环变量",
417
+ * 而非另开一个局部变量映射——否则下一次 -=2 会从错误的起点继续,导致列 0 漏画、列 4 重复写入)。
418
+ */
419
+ function placeData(m: Matrix, codewords: number[]): void {
420
+ const bits: number[] = [];
421
+ for (const byte of codewords) {
422
+ for (let i = 7; i >= 0; i--) bits.push((byte >> i) & 1);
423
+ }
424
+ let bitIndex = 0;
425
+ let upward = true;
426
+ let right = m.size - 1;
427
+ while (right >= 1) {
428
+ if (right === 6) right = 5; // 时序列本身不参与数据填充,坍缩后继续正常步进
429
+ for (let i = 0; i < m.size; i++) {
430
+ const row = upward ? m.size - 1 - i : i;
431
+ for (let j = 0; j < 2; j++) {
432
+ const col = right - j;
433
+ if (isFunctionModule(m, row, col)) continue;
434
+ const bit = bitIndex < bits.length ? bits[bitIndex] : 0;
435
+ bitIndex++;
436
+ setModule(m, row, col, bit === 1, false);
437
+ }
438
+ }
439
+ upward = !upward;
440
+ right -= 2;
441
+ }
442
+ }
443
+
444
+ /** 构造完整 QR 模块矩阵(含掩码),供 SVG 渲染与自测使用。 */
445
+ function buildMatrix(spec: VersionSpec, finalCodewords: number[]): Matrix {
446
+ const size = 17 + 4 * spec.version;
447
+ const m = createMatrix(size);
448
+
449
+ drawFinderPatternsAndSeparators(m);
450
+ drawTimingPatterns(m);
451
+ drawAlignmentPatterns(m, spec);
452
+ drawDarkModule(m, spec.version);
453
+ drawFormatInfo(m, 0); // 掩码固定 0
454
+ drawVersionInfo(m, spec.version);
455
+
456
+ // remainder bits 不需要显式模块(它们只是数据流末尾的占位,模块矩阵中体现为剩余未使用的功能区豁免格),
457
+ // placeData 已按"跳过 isFunction 格子"的规则自然处理,无需单独画。
458
+ placeData(m, finalCodewords);
459
+ applyMask0(m);
460
+
461
+ return m;
462
+ }
463
+
464
+ /** 把模块矩阵渲染为 SVG 字符串(含 4 模块静区,QR 规范推荐最小静区)。 */
465
+ function matrixToSvg(m: Matrix, sizePx: number): string {
466
+ const quiet = 4;
467
+ const dim = m.size + quiet * 2;
468
+ const scale = sizePx / dim;
469
+ let path = '';
470
+ for (let r = 0; r < m.size; r++) {
471
+ for (let c = 0; c < m.size; c++) {
472
+ if (getModule(m, r, c) === 1) {
473
+ const x = (c + quiet) * scale;
474
+ const y = (r + quiet) * scale;
475
+ path += `M${x},${y}h${scale}v${scale}h${-scale}z`;
476
+ }
477
+ }
478
+ }
479
+ return (
480
+ `<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 ${sizePx} ${sizePx}" ` +
481
+ `width="${sizePx}" height="${sizePx}" shape-rendering="crispEdges">` +
482
+ `<rect width="${sizePx}" height="${sizePx}" fill="#ffffff"/>` +
483
+ `<path d="${path}" fill="#000000"/>` +
484
+ `</svg>`
485
+ );
486
+ }
487
+
488
+ /**
489
+ * QrCodeRenderer —— 把任意文本内容渲染为可扫描的 QR Code SVG 字符串。
490
+ * 字节模式 + 纠错级别 M + 固定掩码 0,version 1~10 自适应(容量上限见文件头注释)。
491
+ *
492
+ * @param content 待编码内容(UTF-8),登录页场景通常是 createQr() 返回的 qrContent。
493
+ * @param size 输出 SVG 边长(像素,正方形),默认 200。
494
+ * @returns 完整可内联使用的 `<svg>...</svg>` 字符串。
495
+ */
496
+ export function QrCodeRenderer(content: string, size = 200): string {
497
+ const bytes = utf8Bytes(content);
498
+ const spec = pickVersion(bytes.length);
499
+ const finalCodewords = buildFinalCodewords(spec, bytes);
500
+ const matrix = buildMatrix(spec, finalCodewords);
501
+ return matrixToSvg(matrix, size);
502
+ }
503
+
504
+ // 以下内部函数仅供本文件内自测(qrcode.selftest.ts)按需 import 校验内部结构,
505
+ // 不在包对外 API(index.ts)中导出,避免污染插件作者可见的公共类型面。
506
+ export const __internal = {
507
+ VERSION_SPECS,
508
+ pickVersion,
509
+ buildFinalCodewords,
510
+ buildMatrix,
511
+ encodeFormatInfo,
512
+ encodeVersionInfo,
513
+ rsEncode,
514
+ utf8Bytes,
515
+ byteModeCapacity,
516
+ gfMul,
517
+ GF_EXP,
518
+ GF_LOG
519
+ };