@zwa73/utils 1.0.205 → 1.0.207

package/dist/test/dist/ip.js

@@ -0,0 +1,107 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try {
+            step(generator.next(value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function rejected(value) { try {
+            step(generator["throw"](value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function () { if (t[0] & 1)
+            throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function () { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f)
+            throw new TypeError("Generator is already executing.");
+        while (_)
+            try {
+                if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
+                    return t;
+                if (y = 0, t)
+                    op = [op[0] & 2, t.value];
+                switch (op[0]) {
+                    case 0:
+                    case 1:
+                        t = op;
+                        break;
+                    case 4:
+                        _.label++;
+                        return { value: op[1], done: false };
+                    case 5:
+                        _.label++;
+                        y = op[1];
+                        op = [0];
+                        continue;
+                    case 7:
+                        op = _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                    default:
+                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                            _ = 0;
+                            continue;
+                        }
+                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) {
+                            _.label = op[1];
+                            break;
+                        }
+                        if (op[0] === 6 && _.label < t[1]) {
+                            _.label = t[1];
+                            t = op;
+                            break;
+                        }
+                        if (t && _.label < t[2]) {
+                            _.label = t[2];
+                            _.ops.push(op);
+                            break;
+                        }
+                        if (t[2])
+                            _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                }
+                op = body.call(thisArg, _);
+            }
+            catch (e) {
+                op = [6, e];
+                y = 0;
+            }
+            finally {
+                f = t = 0;
+            }
+        if (op[0] & 5)
+            throw op[1];
+        return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+exports.__esModule = true;
+var __1 = require("..");
+function main() {
+    return __awaiter(this, void 0, void 0, function () {
+        var _a, _b;
+        return __generator(this, function (_c) {
+            switch (_c.label) {
+                case 0:
+                    _b = (_a = console).log;
+                    return [4 /*yield*/, __1.UtilFunc.getPublicIpv4()];
+                case 1:
+                    _b.apply(_a, [_c.sent()]);
+                    return [2 /*return*/];
+            }
+        });
+    });
+}
+main();

package/dist/test/dist/llonebot.js

@@ -0,0 +1 @@
+"use strict";

package/dist/test/dist/log.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/log.js

@@ -0,0 +1,9 @@
+"use strict";
+exports.__esModule = true;
+JSON.stringify({
+    "code": 0,
+    "message": "操作成功",
+    "data": {
+        "url": "wss://nws.kaiheila.cn/gateway?compress=0&token=M2tKMndvcTVzUU1GeEtYM3E5V2hZUSsrdHhycVVVcWhwcDRLSUxOWVFwL3N3dGVEblh1UTBjL0tVVVYzekhqeGZ1NlNyRUpLME11azFDR3RIdk5kL0pkZHhrMHUxNHZqMUZzOUxyc2ozTjcxR3lkRENuR2dTdHBJQjlkakhiUUxldm13MW5uT3hJdjJ6eUsyRjFPZ2N3PT0="
+    }
+}, null, 2); //?

package/dist/test/dist/match.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/match.js

@@ -0,0 +1,19 @@
+"use strict";
+var _a;
+exports.__esModule = true;
+var QuickExport_1 = require("../QuickExport");
+var UtilFunctions_1 = require("../UtilFunctions");
+var UtilSymbol_1 = require("../UtilSymbol");
+function test() {
+    return 1;
+}
+var etest = UtilFunctions_1.UtilFunc.eitherize(test);
+var res = etest();
+QuickExport_1.matchProc(res, (_a = {},
+    _a[UtilSymbol_1.Success] = function (status, res) {
+        console.log(res);
+    },
+    _a[UtilSymbol_1.Failed] = function (status, res) {
+        console.error(res);
+    },
+    _a));

package/dist/test/dist/pathe.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/pathe.js

@@ -0,0 +1,7 @@
+"use strict";
+exports.__esModule = true;
+var pathe_1 = require("pathe");
+var path_1 = require("path");
+pathe_1["default"].join(process.cwd(), '/1/2/3'); //?
+pathe_1["default"].relative(process.cwd(), "F:/"); //?
+path_1["default"].relative(process.cwd(), "F:/"); //?

package/dist/test/dist/queuetest.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/queuetest.js

@@ -0,0 +1,139 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try {
+            step(generator.next(value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function rejected(value) { try {
+            step(generator["throw"](value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function () { if (t[0] & 1)
+            throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function () { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f)
+            throw new TypeError("Generator is already executing.");
+        while (_)
+            try {
+                if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
+                    return t;
+                if (y = 0, t)
+                    op = [op[0] & 2, t.value];
+                switch (op[0]) {
+                    case 0:
+                    case 1:
+                        t = op;
+                        break;
+                    case 4:
+                        _.label++;
+                        return { value: op[1], done: false };
+                    case 5:
+                        _.label++;
+                        y = op[1];
+                        op = [0];
+                        continue;
+                    case 7:
+                        op = _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                    default:
+                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                            _ = 0;
+                            continue;
+                        }
+                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) {
+                            _.label = op[1];
+                            break;
+                        }
+                        if (op[0] === 6 && _.label < t[1]) {
+                            _.label = t[1];
+                            t = op;
+                            break;
+                        }
+                        if (t && _.label < t[2]) {
+                            _.label = t[2];
+                            _.ops.push(op);
+                            break;
+                        }
+                        if (t[2])
+                            _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                }
+                op = body.call(thisArg, _);
+            }
+            catch (e) {
+                op = [6, e];
+                y = 0;
+            }
+            finally {
+                f = t = 0;
+            }
+        if (op[0] & 5)
+            throw op[1];
+        return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+exports.__esModule = true;
+var __1 = require("..");
+var QueueProcessor = /** @class */ (function () {
+    function QueueProcessor() {
+    }
+    QueueProcessor.queueProc = function (flag, task) {
+        var _this = this;
+        if (!this.pendingMap[flag])
+            this.pendingMap[flag] = [];
+        var resolveFunc;
+        var promise = new Promise(function (resolve) {
+            resolveFunc = resolve;
+        });
+        var processTask = function () {
+            return __awaiter(_this, void 0, void 0, function () {
+                var result, error_1;
+                return __generator(this, function (_a) {
+                    switch (_a.label) {
+                        case 0:
+                            _a.trys.push([0, 2, 3, 4]);
+                            return [4 /*yield*/, task()];
+                        case 1:
+                            result = _a.sent();
+                            resolveFunc(result);
+                            return [3 /*break*/, 4];
+                        case 2:
+                            error_1 = _a.sent();
+                            __1.SLogger.warn("queueProc \u9519\u8BEF: ", error_1, "flag: " + String(flag));
+                            return [3 /*break*/, 4];
+                        case 3:
+                            this.pendingMap[flag].shift();
+                            if (this.pendingMap[flag].length > 0) {
+                                this.pendingMap[flag][0]();
+                            }
+                            else
+                                delete this.pendingMap[flag];
+                            return [7 /*endfinally*/];
+                        case 4: return [2 /*return*/];
+                    }
+                });
+            });
+        };
+        this.pendingMap[flag].push(processTask);
+        if (this.pendingMap[flag].length === 1)
+            processTask();
+        return promise;
+    };
+    QueueProcessor.pendingMap = {};
+    return QueueProcessor;
+}());

package/dist/test/dist/regtest.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/regtest.js

@@ -0,0 +1,8 @@
+"use strict";
+exports.__esModule = true;
+var __1 = require("..");
+var list = ["ext\\abc\\asd.png"];
+var newPath = list[0].replace(/ext\\([^\\]+?)\\([^\\]+?)\.png/, "map/$2.png"); //?
+__1.UtilFT.fileSearchRegex(__dirname, '.*'); //?
+12; //?
+console.log(__1.UtilFunc.getFuncLoc());

package/dist/test/dist/repeatTest.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/repeatTest.js

@@ -0,0 +1,120 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try {
+            step(generator.next(value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function rejected(value) { try {
+            step(generator["throw"](value));
+        }
+        catch (e) {
+            reject(e);
+        } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function () { if (t[0] & 1)
+            throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function () { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f)
+            throw new TypeError("Generator is already executing.");
+        while (_)
+            try {
+                if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
+                    return t;
+                if (y = 0, t)
+                    op = [op[0] & 2, t.value];
+                switch (op[0]) {
+                    case 0:
+                    case 1:
+                        t = op;
+                        break;
+                    case 4:
+                        _.label++;
+                        return { value: op[1], done: false };
+                    case 5:
+                        _.label++;
+                        y = op[1];
+                        op = [0];
+                        continue;
+                    case 7:
+                        op = _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                    default:
+                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                            _ = 0;
+                            continue;
+                        }
+                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) {
+                            _.label = op[1];
+                            break;
+                        }
+                        if (op[0] === 6 && _.label < t[1]) {
+                            _.label = t[1];
+                            t = op;
+                            break;
+                        }
+                        if (t && _.label < t[2]) {
+                            _.label = t[2];
+                            _.ops.push(op);
+                            break;
+                        }
+                        if (t[2])
+                            _.ops.pop();
+                        _.trys.pop();
+                        continue;
+                }
+                op = body.call(thisArg, _);
+            }
+            catch (e) {
+                op = [6, e];
+                y = 0;
+            }
+            finally {
+                f = t = 0;
+            }
+        if (op[0] & 5)
+            throw op[1];
+        return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+exports.__esModule = true;
+var __1 = require("..");
+// 模拟的异步函数，有一定几率失败
+function mockAsyncFunction() {
+    return __awaiter(this, void 0, Promise, function () {
+        return __generator(this, function (_a) {
+            return [2 /*return*/, new Promise(function (resolve, reject) {
+                    setTimeout(function () {
+                        Math.random() > 0.5 ? resolve("Success") : reject("Failure");
+                    }, Math.random() % 2000);
+                })];
+        });
+    });
+}
+// 验证函数，只有当结果为 "Success" 时才认为成功
+function mockVerifyFunction(result) {
+    return result === "Success" ? __1.Success : __1.Failed;
+}
+// 测试 retryPromise 函数
+__1.UtilFunc.retryPromise(mockAsyncFunction, mockVerifyFunction)
+    .then(function (result) {
+    console.log("then");
+    if (result === null) {
+        console.log("全部超时");
+    }
+    else {
+        console.log("成功:", result);
+    }
+})["catch"](function (err) {
+    console.error("出现错误", err);
+});

package/dist/test/dist/stringifytest.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/stringifytest.js

@@ -0,0 +1,8 @@
+"use strict";
+exports.__esModule = true;
+var __1 = require("..");
+var json = {
+    a: { b: 123 }
+};
+console.log(__1.UtilFunc.stringifyJToken(json, { compress: true }));
+console.log(__1.UtilFunc.stringifyJToken(json));

package/dist/test/dist/test2.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;

package/dist/test/dist/test2.js

@@ -0,0 +1,35 @@
+"use strict";
+exports.__esModule = true;
+var pathe_1 = require("pathe");
+var UtilFileTools_1 = require("../../UtilFileTools");
+// 将字符串转换为十六进制
+function stringToHex(str) {
+    var buf = Buffer.from(str, 'utf8');
+    return buf.toString('hex');
+}
+// 将十六进制转换为字符串
+function hexToString(hex) {
+    var buf = Buffer.from(hex, 'hex');
+    return buf.toString('utf8');
+}
+// 示例
+var str = "Hello World";
+var hex = "0B0000002D";
+console.log(stringToHex(str)); // 输出字符串对应的十六进制
+console.log(hexToString(hex)); // 输出十六进制对应的字符串
+hexToString("556E6974794653"); //?
+/**
+首先我有一个文件夹./in
+我在里面存放了一些整合加密的二进制文件，文件名符合正则/.*\.bk/
+我需要你帮我写解密程序，将其解密并分离为单独的文件，接下来我告诉你解密方式:
+读取文件后，我们先用split(hexToString(hex))对文本进行分割成多块，然后在每一块找到第二个"UnityFS"，
+再从第二个UnityFS的开头截取到每一块的末尾
+我举一个例子，假设我们有一段分割完成的文本块 "112233 UnityFS sasasd UnityFS我需要的内容"
+那么它截取完成之后应该是"UnityFS我需要的内容"
+最后，我们在将所有截取完成的文本块作为文件输出到./out/{filename}
+文件名就是 {原文件名+块编号.bs}
+开始写吧
+**/
+pathe_1["default"].parse("123.bs").name; //?
+var filepath = "F:\\Sosarciel\\SosarcielCore\\NodeJs\\utils\\src";
+UtilFileTools_1.UtilFT.fileSearchGlob(filepath + "/**/*.ts", "**/test/**/*.ts"); //?

package/dist/test/dist/testStream.d.ts

@@ -0,0 +1 @@
+export const __esModule: true;