- 拆分:tools/split.js 重切新版(1347 模块 / 126 代码模块),主文件 main.7cfa4058.js,语法验证通过 - 修复 split.js 内自动刷新拦截的 \\n 转义:它在模板字符串里,必须写 \\\\n,否则生成的主文件字符串断行、语法报错 - 符号映射:map_symbols.js 对齐旧→新(qyr→ryz、w187→c18o、z4t→jtn、vgt→rkt、Bmt→Ezt、Qjt→Fjt、txt→Gjt、k15b→s15n、azi_1→vzr_1…) - 移植 7 处针对性修改:炮塔摆头不回弹(vSt.ryz)、摆头不过冲(case 0)、精准跟手(case 1/2)、悬浮底盘 raw 两级(Ezt.n36 + Zmt 实际速度)、电磁炮蓄力时长(jtn.c18o) - 重新打包 unpacked.pack.json(127 文件 / 版本 96833eb2b0cf8909)
189 lines
6.0 KiB
JavaScript
189 lines
6.0 KiB
JavaScript
// ============================================================
|
|
// Module ID: 84441
|
|
// ============================================================
|
|
;(window.__modules__ = window.__modules__ || {})[84441] = (t, n, i) => {
|
|
const r = i(44794),
|
|
e = i(21973),
|
|
u = i(38335),
|
|
s = i(64280),
|
|
o = i(51233),
|
|
_ = i(42920),
|
|
h = i(77672),
|
|
a = i(70298),
|
|
c = i(55520),
|
|
l = i(51887),
|
|
f = i(90225),
|
|
v = i(31620),
|
|
p = i(75453);
|
|
function w(t, n, i) {
|
|
const r = t.size,
|
|
e = f.getEncodedBits(n, i);
|
|
let u, s;
|
|
for (u = 0; u < 15; u++)
|
|
((s = 1 == ((e >> u) & 1)),
|
|
u < 6 ? t.set(u, 8, s, !0) : u < 8 ? t.set(u + 1, 8, s, !0) : t.set(r - 15 + u, 8, s, !0),
|
|
u < 8
|
|
? t.set(8, r - u - 1, s, !0)
|
|
: u < 9
|
|
? t.set(8, 15 - u - 1 + 1, s, !0)
|
|
: t.set(8, 15 - u - 1, s, !0));
|
|
t.set(r - 8, 8, 1, !0);
|
|
}
|
|
function d(t, n, i, e) {
|
|
let f;
|
|
if (Array.isArray(t)) f = p.fromArray(t);
|
|
else {
|
|
if ("string" != typeof t) throw new Error("Invalid data");
|
|
{
|
|
let r = n;
|
|
if (!r) {
|
|
const n = p.rawSplit(t);
|
|
r = l.getBestVersionForData(n, i);
|
|
}
|
|
f = p.fromString(t, r || 40);
|
|
}
|
|
}
|
|
const d = l.getBestVersionForData(f, i);
|
|
if (!d) throw new Error("The amount of data is too big to be stored in a QR Code");
|
|
if (n) {
|
|
if (n < d)
|
|
throw new Error(
|
|
"\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " +
|
|
d +
|
|
".\n",
|
|
);
|
|
} else n = d;
|
|
const g = (function (t, n, i) {
|
|
const e = new u();
|
|
i.forEach(function (n) {
|
|
(e.put(n.mode.bit, 4), e.put(n.getLength(), v.getCharCountIndicator(n.mode, t)), n.write(e));
|
|
});
|
|
const s = 8 * (r.getSymbolTotalCodewords(t) - a.getTotalCodewordsCount(t, n));
|
|
for (e.getLengthInBits() + 4 <= s && e.put(0, 4); e.getLengthInBits() % 8 != 0;) e.putBit(0);
|
|
const o = (s - e.getLengthInBits()) / 8;
|
|
for (let t = 0; t < o; t++) e.put(t % 2 ? 17 : 236, 8);
|
|
return (function (t, n, i) {
|
|
const e = r.getSymbolTotalCodewords(n),
|
|
u = e - a.getTotalCodewordsCount(n, i),
|
|
s = a.getBlocksCount(n, i),
|
|
o = s - (e % s),
|
|
_ = Math.floor(e / s),
|
|
h = Math.floor(u / s),
|
|
l = h + 1,
|
|
f = _ - h,
|
|
v = new c(f);
|
|
let p = 0;
|
|
const w = new Array(s),
|
|
d = new Array(s);
|
|
let g = 0;
|
|
const m = new Uint8Array(t.buffer);
|
|
for (let t = 0; t < s; t++) {
|
|
const n = t < o ? h : l;
|
|
((w[t] = m.slice(p, p + n)), (d[t] = v.encode(w[t])), (p += n), (g = Math.max(g, n)));
|
|
}
|
|
const k = new Uint8Array(e);
|
|
let z,
|
|
b,
|
|
q = 0;
|
|
for (z = 0; z < g; z++) for (b = 0; b < s; b++) z < w[b].length && (k[q++] = w[b][z]);
|
|
for (z = 0; z < f; z++) for (b = 0; b < s; b++) k[q++] = d[b][z];
|
|
return k;
|
|
})(e, t, n);
|
|
})(n, i, f),
|
|
m = r.getSymbolSize(n),
|
|
k = new s(m);
|
|
return (
|
|
(function (t, n) {
|
|
const i = t.size,
|
|
r = _.getPositions(n);
|
|
for (let n = 0; n < r.length; n++) {
|
|
const e = r[n][0],
|
|
u = r[n][1];
|
|
for (let n = -1; n <= 7; n++)
|
|
if (!(e + n <= -1 || i <= e + n))
|
|
for (let r = -1; r <= 7; r++)
|
|
u + r <= -1 ||
|
|
i <= u + r ||
|
|
((n >= 0 && n <= 6 && (0 === r || 6 === r)) ||
|
|
(r >= 0 && r <= 6 && (0 === n || 6 === n)) ||
|
|
(n >= 2 && n <= 4 && r >= 2 && r <= 4)
|
|
? t.set(e + n, u + r, !0, !0)
|
|
: t.set(e + n, u + r, !1, !0));
|
|
}
|
|
})(k, n),
|
|
(function (t) {
|
|
const n = t.size;
|
|
for (let i = 8; i < n - 8; i++) {
|
|
const n = i % 2 == 0;
|
|
(t.set(i, 6, n, !0), t.set(6, i, n, !0));
|
|
}
|
|
})(k),
|
|
(function (t, n) {
|
|
const i = o.getPositions(n);
|
|
for (let n = 0; n < i.length; n++) {
|
|
const r = i[n][0],
|
|
e = i[n][1];
|
|
for (let n = -2; n <= 2; n++)
|
|
for (let i = -2; i <= 2; i++)
|
|
-2 === n || 2 === n || -2 === i || 2 === i || (0 === n && 0 === i)
|
|
? t.set(r + n, e + i, !0, !0)
|
|
: t.set(r + n, e + i, !1, !0);
|
|
}
|
|
})(k, n),
|
|
w(k, i, 0),
|
|
n >= 7 &&
|
|
(function (t, n) {
|
|
const i = t.size,
|
|
r = l.getEncodedBits(n);
|
|
let e, u, s;
|
|
for (let n = 0; n < 18; n++)
|
|
((e = Math.floor(n / 3)),
|
|
(u = (n % 3) + i - 8 - 3),
|
|
(s = 1 == ((r >> n) & 1)),
|
|
t.set(e, u, s, !0),
|
|
t.set(u, e, s, !0));
|
|
})(k, n),
|
|
(function (t, n) {
|
|
const i = t.size;
|
|
let r = -1,
|
|
e = i - 1,
|
|
u = 7,
|
|
s = 0;
|
|
for (let o = i - 1; o > 0; o -= 2)
|
|
for (6 === o && o--; ;) {
|
|
for (let i = 0; i < 2; i++)
|
|
if (!t.isReserved(e, o - i)) {
|
|
let r = !1;
|
|
(s < n.length && (r = 1 == ((n[s] >>> u) & 1)),
|
|
t.set(e, o - i, r),
|
|
u--,
|
|
-1 === u && (s++, (u = 7)));
|
|
}
|
|
if (((e += r), e < 0 || i <= e)) {
|
|
((e -= r), (r = -r));
|
|
break;
|
|
}
|
|
}
|
|
})(k, g),
|
|
isNaN(e) && (e = h.getBestMask(k, w.bind(null, k, i))),
|
|
h.applyMask(e, k),
|
|
w(k, i, e),
|
|
{ modules: k, version: n, errorCorrectionLevel: i, maskPattern: e, segments: f }
|
|
);
|
|
}
|
|
n.create = function (t, n) {
|
|
if (void 0 === t || "" === t) throw new Error("No input text");
|
|
let i,
|
|
u,
|
|
s = e.M;
|
|
return (
|
|
void 0 !== n &&
|
|
((s = e.from(n.errorCorrectionLevel, e.M)),
|
|
(i = l.from(n.version)),
|
|
(u = h.from(n.maskPattern)),
|
|
n.toSJISFunc && r.setToSJISFunction(n.toSJISFunc)),
|
|
d(t, i, s, u)
|
|
);
|
|
};
|
|
};
|