AncTe/HumanBreak
1
1 Fork 0
mirror of https://github.com/unanmed/HumanBreak.git synced 2026-11-03 10:14:34 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

init

Browse Source
This commit is contained in:
AncTe committed 2022-11-13 18:02:05 +08:00
commit f3c96f7a07
337 files changed
+84881
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

script/compress.ts
+94
View File
@@ -0,0 +1,94 @@
import fs from 'fs/promises';
import fss from 'fs';
import fse from 'fs-extra';
import Fontmin from 'fontmin';
(async function () {
// 1. 去除未使用的文件
const data = (() => {
const data = fss.readFileSync('./public/project/data.js', 'utf-8');
const json = JSON.parse(
data
.split(/(\n|\r\n)/)
.slice(1)
.join('\n')
);
return json;
})() as { main: Record<string, string[]> };
const main = data.main;
try {
const data = [
['./dist/project/floors', '.js', 'floorIds'],
['./dist/project/bgms', '', 'bgms'],
['./dist/project/sounds', '', 'sounds'],
['./dist/project/images', '', 'images'],
['./dist/project/animates', '.animate', 'animates'],
['./dist/project/tilesets', '', 'tilesets'],
['./dist/project/fonts', '.ttf', 'fonts']
];
await Promise.all(
data.map(async v => {
const all = await fs.readdir(`${v[0]}`);
const data = main[v[2]].map(vv => vv + v[1]);
all.forEach(async vv => {
if (!data.includes(vv)) {
await fs.rm(`${v[0]}/${vv}`);
}
});
})
);
} catch {}
// 2. 压缩字体
try {
// 获取要压缩的文字列表，libs & projects下的所有js文件
let texts = ``;
const exclude = `\n \t`;
const libs = await fs.readdir('./public/libs');
const project = await fs.readdir('./public/project');
const floors = await fs.readdir('./public/project/floors');
const assets = await fs.readdir('./dist/assets/');
const all = [
...libs.map(v => `./public/libs/${v}`),
...project.map(v => `./public/project/${v}`),
...floors.map(v => `./public/project/floors/${v}`),
...assets.map(v => `./dist/assets/${v}`)
];
for await (const dir of all) {
const stat = await fs.stat(dir);
if (!stat.isFile()) continue;
const file = await fs.readFile(dir, 'utf-8');
for (let i = 0; i < file.length; i++) {
const char = file[i];
if (!texts.includes(char) && !exclude.includes(char))
texts += char;
}
}
// 获取所有字体（直接压缩字体会报错
const fonts = main.fonts;
await Promise.all([
...fonts.map(v =>
(async () => {
const fontmin = new Fontmin();
fontmin
.src<string>(`./public/project/fonts/${v}.ttf`)
.dest('./dist/project/fonts')
.use(
Fontmin.glyph({
text: texts
})
);
await new Promise(res => {
fontmin.run(err => {
if (err) throw err;
res('');
});
});
})()
)
]);
} catch (e) {
await fse.copy('./public/project/fonts', './dist/project/fonts');
}
})();
script/md_5.ts
+215
View File
@@ -0,0 +1,215 @@
const hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
const chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
// ---------- md5码
/*
* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
* * Digest Algorithm, as defined in RFC 1321.
* * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
* * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* * Distributed under the BSD License
* * See http://pajhome.org.uk/crypt/md5 for more info.
* */
/*
* * Configurable letiables. You may need to tweak these to be compatible with
* * the server-side, but the defaults work in most cases.
* */
/*
* * These are the functions you'll usually want to call
* * They take string arguments and return either hex or base-64 encoded strings
* */
export function hex_md5(s: string) {
return binl2hex(core_md5(str2binl(s), s.length * chrsz));
}
/*
* * Calculate the MD5 of an array of little-endian words, and a bit length
* */
function core_md5(x: any[], len: number) {
/* append padding */
x[len >> 5] |= 0x80 << len % 32;
x[(((len + 64) >>> 9) << 4) + 14] = len;
let a = 1732584193;
let b = -271733879;
let c = -1732584194;
let d = 271733878;
for (let i = 0; i < x.length; i += 16) {
const olda = a;
const oldb = b;
const oldc = c;
const oldd = d;
a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);
d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);
c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);
b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);
a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);
d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);
c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);
b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);
a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);
d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);
c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);
b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);
a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);
d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);
c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);
b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);
a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);
d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);
c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);
b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);
a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);
d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);
c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);
b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);
a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);
d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);
c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);
b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);
a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);
d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);
c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);
b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);
a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);
d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);
c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);
b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);
a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);
d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);
c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);
b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);
a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);
d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);
c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);
b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);
a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);
d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);
c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);
b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);
a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);
d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);
c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);
b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);
a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);
d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);
c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);
b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);
a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);
d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);
c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);
b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);
a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);
d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);
c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);
b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
}
return Array(a, b, c, d);
}
/*
* * These functions implement the four basic operations the algorithm uses.
* */
function md5_cmn(q: number, a: any, b: any, x: any, s: any, t: any) {
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);
}
function md5_ff(
a: number,
b: number,
c: number,
d: number,
x: any,
s: number,
t: number
) {
return md5_cmn((b & c) | (~b & d), a, b, x, s, t);
}
function md5_gg(
a: number,
b: number,
c: number,
d: number,
x: any,
s: number,
t: number
) {
return md5_cmn((b & d) | (c & ~d), a, b, x, s, t);
}
function md5_hh(
a: number,
b: number,
c: number,
d: number,
x: any,
s: number,
t: number
) {
return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(
a: number,
b: number,
c: number,
d: number,
x: any,
s: number,
t: number
) {
return md5_cmn(c ^ (b | ~d), a, b, x, s, t);
}
/*
* * Add integers, wrapping at 2^32. This uses 16-bit operations internally
* * to work around bugs in some JS interpreters.
* */
function safe_add(x: number, y: number) {
const lsw = (x & 0xffff) + (y & 0xffff);
const msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xffff);
}
/*
* * Bitwise rotate a 32-bit number to the left.
* */
function bit_rol(num: number, cnt: number) {
return (num << cnt) | (num >>> (32 - cnt));
}
/*
* * Convert a string to an array of little-endian words
* * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
* */
function str2binl(str: string) {
let bin = Array();
let mask = (1 << chrsz) - 1;
for (let i = 0; i < str.length * chrsz; i += chrsz)
bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << i % 32;
return bin;
}
/*
* * Convert an array of little-endian words to a hex string.
* */
function binl2hex(binarray: string | any[]) {
let hex_tab = hexcase ? '0123456789ABCDEF' : '0123456789abcdef';
let str = '';
for (let i = 0; i < binarray.length * 4; i++) {
str +=
hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xf) +
hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xf);
}
return str;
}
script/update.ts
+91
View File
@@ -0,0 +1,91 @@
import axios from 'axios';
import fs from 'fs/promises';
import fss from 'fs';
import FormData from 'form-data';
import compressing from 'compressing';
import { hex_md5 } from './md_5.js';
const id = 1000; // 用户id
const password = 'password'; // 密码
(async function () {
// 压缩
await compressing.zip.compressDir('./dist', './dist.zip');
const name = (
(() => {
const data = fss.readFileSync('./public/project/data.js', 'utf-8');
const json = JSON.parse(
data
.split(/(\n|\r\n)/)
.slice(1)
.join('\n')
);
return json;
})() as { firstData: Record<string, string> }
).firstData.name;
const pass = hex_md5(password);
// 登录
const res = await axios.postForm(
'https://h5mota.com/backend/user/login.php',
{
nid: id,
npass: pass
}
);
if (res.data.code === 0) console.log('登录成功');
else return console.log('登录失败');
const data = await axios.post(
'https://h5mota.com/up2cos/getData.php',
void 0,
{
headers: {
'Access-Control-Allow-Origin': '*',
Cookie: `id=${id}; password=${pass}`
}
}
);
if (data.data.code !== 1) return console.log('获取自助更新信息失败');
const tower = data.data.list.find((v: { name: string }) => v.name === name);
if (!tower) return console.log('你还没有发过这个塔');
const stat = await fs.stat('./dist.zip');
let size = '';
size = `${stat.size}B`;
if (stat.size > 1024) size = `${(stat.size / 1024).toFixed(2)}KB`;
if (stat.size > 1024 ** 2) size = `${(stat.size / 1024 ** 2).toFixed(2)}MB`;
if (stat.size > 1024 ** 3) size = `${(stat.size / 1024 ** 3).toFixed(2)}GB`;
const stream = fss.createReadStream('./dist.zip');
const form = new FormData();
form.append('type', 'upload');
form.append('name', name);
form.append('comment', tower.text);
form.append('file', stream);
const headers = form.getHeaders(); // 获取headers
const [err, length] = await new Promise(
(res: (v: [Error | null, number]) => void) =>
form.getLength((e, l) => res([e, l]))
);
if (err) return console.log('获取content-length失败');
headers['content-length'] = length;
headers['cookie'] = `id=${id}; password=${pass}`;
console.log(`开始上传, 文件大小: ${size}`);
const ans = await axios.post(
'https://h5mota.com/up2cos/setData.php',
form,
{
headers
}
);
if (ans.data.error === 0 && ans.data.upload === true && ans.data.code === 1)
console.log('上传成功');
else throw new Error(`上传失败, 失败信息: ${ans.data}`);
})();