xiaoxue_admin
/
RSSHub
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

style: auto format

This commit is contained in:
github-actions[bot] 2025-06-23 15:10:57 +00:00
parent 380e0bf103
commit ffb2314dc5
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/routes/linkedin/cn/renderer.ts
View File

@ -75,7 +75,7 @@ class Ucs2Text {
? this.codePoints
.map((a) => {
let b = '';
return 65535 < a && ((b += String.fromCharCode((((a -= 65536) >>> 10) & 1023) | 55296)), (a = 1023 & (56320 | a))), b + String.fromCharCode(a);
return (65535 < a && ((b += String.fromCharCode((((a -= 65536) >>> 10) & 1023) | 55296)), (a = 1023 & (56320 | a))), b + String.fromCharCode(a));
})
.join('')
: this.string;

10
lib/routes/zhihu/execlib/x-zse-96-v3.ts
View File

@ -5,7 +5,7 @@
/* eslint-disable @typescript-eslint/no-unused-expressions */
function i(e, t, n) {
(t[n] = 255 & (e >>> 24)), (t[n + 1] = 255 & (e >>> 16)), (t[n + 2] = 255 & (e >>> 8)), (t[n + 3] = 255 & e);
((t[n] = 255 & (e >>> 24)), (t[n + 1] = 255 & (e >>> 16)), (t[n + 2] = 255 & (e >>> 8)), (t[n + 3] = 255 & e));
}
function B(e, t) {
return ((255 & e[t]) << 24) | ((255 & e[t + 1]) << 16) | ((255 & e[t + 2]) << 8) | (255 & e[t + 3]);
@ -16,7 +16,7 @@ function Q(e, t) {
function G(e) {
const t = Array.from({ length: 4 });
const n = Array.from({ length: 4 });
i(e, t, 0), (n[0] = h.zb[255 & t[0]]), (n[1] = h.zb[255 & t[1]]), (n[2] = h.zb[255 & t[2]]), (n[3] = h.zb[255 & t[3]]);
(i(e, t, 0), (n[0] = h.zb[255 & t[0]]), (n[1] = h.zb[255 & t[1]]), (n[2] = h.zb[255 & t[2]]), (n[3] = h.zb[255 & t[3]]));
const r = B(n, 0);
return r ^ Q(r, 2) ^ Q(r, 10) ^ Q(r, 18) ^ Q(r, 24);
}
@ -29,19 +29,19 @@ const __g = {
a[c] = o[c] ^ t[c];
}
// eslint-disable-next-line unicorn/prefer-spread
(t = __g.r(a)), (n = n.concat(t)), i++;
((t = __g.r(a)), (n = n.concat(t)), i++);
}
return n;
},
r(e) {
const t = Array.from({ length: 16 });
const n = Array.from({ length: 36 });
(n[0] = B(e, 0)), (n[1] = B(e, 4)), (n[2] = B(e, 8)), (n[3] = B(e, 12));
((n[0] = B(e, 0)), (n[1] = B(e, 4)), (n[2] = B(e, 8)), (n[3] = B(e, 12)));
for (let r = 0; r < 32; r++) {
const o = G(n[r + 1] ^ n[r + 2] ^ n[r + 3] ^ h.zk[r]);
n[r + 4] = n[r] ^ o;
}
return i(n[35], t, 0), i(n[34], t, 4), i(n[33], t, 8), i(n[32], t, 12), t;
return (i(n[35], t, 0), i(n[34], t, 4), i(n[33], t, 8), i(n[32], t, 12), t);
},
};
const h = {