light-h5-core-lib 2.8.2 → 2.8.3

package/common/util/PromiseUtil.js

@@ -0,0 +1,74 @@
+"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 = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * 异步处理工具
+ * @author Aonaufly
+ */
+var PromiseUtil = /** @class */ (function () {
+    function PromiseUtil() {
+    }
+    /**
+     * 执行所有异步并返回数据
+     */
+    PromiseUtil.all = function (promiseArr) {
+        return __awaiter(this, void 0, void 0, function () {
+            return __generator(this, function (_a) {
+                return [2 /*return*/, new Promise(function (resolve, reject) {
+                        var promises = Array.from(promiseArr);
+                        var r = [];
+                        var len = promises.length;
+                        var count = 0;
+                        var _loop_1 = function (i) {
+                            Promise.resolve(promises[i]).then(function (o) {
+                                r[i] = o;
+                                if (++count === len) {
+                                    resolve(r);
+                                }
+                            }).catch(function (e) { return reject(e); });
+                        };
+                        for (var i = 0; i < len; i++) {
+                            _loop_1(i);
+                        }
+                    })];
+            });
+        });
+    };
+    return PromiseUtil;
+}());
+exports.default = PromiseUtil;

package/common/util/{RandomNumUtil.ts → RandomNumUtil.js}

@@ -1,81 +1,92 @@
-/**
- * 随机数生成工具
- * @author aonaufly
- */
-export class RandomNumUtil {
-    /**
-     * 获取一定范围的随机整数
-     *
-     * <b>( min ≤ r ≤ max )</b>
-     *
-     * @param min 最小数
-     * @param max 最大数
-     * @param isInt 是否返回整数
-     */
-    public static randomNumBoth(min: number, max: number, isInt: boolean = true): number {
-        const Range: number = max - min;
-        if (Range > 0.0) {
-            const Rand: number = Math.random();
-            let num: number;
-            if (isInt) {
-                num = min + Math.round(Rand * Range); //四舍五入
-            } else {
-                num = min + Rand * Range;
-            }
-            return num;
-        } else {
-            return isInt ? min : Math.round(min);
-        }
-    }
-
-    /**
-     * 打乱数组
-     */
-    public static shuffleSort<T>(arr: T[]): void {
-        let n: number = arr.length;
-        let index: number;
-        let temp: T;
-        while (n--) {
-            index = Math.floor(Math.random() * n);
-            temp = arr[index];
-            arr[index] = arr[n];
-            arr[n] = temp;
-        }
-    }
-
-    /**
-     * 获得偏振系数
-     * @param factor 偏振因子（>0）
-     * @param negativeIntRadio 负数的比率（> 0的整数）
-     * @param positiveIntRadio 正数的比率 (>0的整数)
-     * @return -factor 或者factor
-     */
-    public static getPolarizationFactor(factor: number = 1, negativeIntRadio: number = 1, positiveIntRadio: number = 1): number {
-        const r: number = RandomNumUtil.randomNumWithRadio(0, 1, [negativeIntRadio, positiveIntRadio]);
-        if (r == 0) return -1 * factor;
-        return r * factor;
-    }
-
-    /**
-     * 按照比率获得随机数(对于整数)
-     * @param min 最小数
-     * @param max 最大数
-     * @param radioArr 比率
-     */
-    public static randomNumWithRadio(min: number, max: number, radioArr: number[]): number {
-        let total: number = 0;
-        let i: number;
-        for (i = 0; i < radioArr.length; i++) {
-            total += radioArr[i];
-        }
-        const r: number = RandomNumUtil.randomNumBoth(1, total, true);
-        let target: number = 0;
-        for (i = 0; i < radioArr.length; i++) {
-            target += radioArr[i];
-            if (r <= target) {
-                return i + min;
-            }
-        }
-        return max;
-    }
-}
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RandomNumUtil = void 0;
+/**
+ * 随机数生成工具
+ * @author aonaufly
+ */
+var RandomNumUtil = /** @class */ (function () {
+    function RandomNumUtil() {
+    }
+    /**
+     * 获取一定范围的随机整数
+     *
+     * <b>( min ≤ r ≤ max )</b>
+     *
+     * @param min 最小数
+     * @param max 最大数
+     * @param isInt 是否返回整数
+     */
+    RandomNumUtil.randomNumBoth = function (min, max, isInt) {
+        if (isInt === void 0) { isInt = true; }
+        var Range = max - min;
+        if (Range > 0.0) {
+            var Rand = Math.random();
+            var num = void 0;
+            if (isInt) {
+                num = min + Math.round(Rand * Range); //四舍五入
+            }
+            else {
+                num = min + Rand * Range;
+            }
+            return num;
+        }
+        else {
+            return isInt ? min : Math.round(min);
+        }
+    };
+    /**
+     * 打乱数组
+     */
+    RandomNumUtil.shuffleSort = function (arr) {
+        var n = arr.length;
+        var index;
+        var temp;
+        while (n--) {
+            index = Math.floor(Math.random() * n);
+            temp = arr[index];
+            arr[index] = arr[n];
+            arr[n] = temp;
+        }
+    };
+    /**
+     * 获得偏振系数
+     * @param factor 偏振因子（>0）
+     * @param negativeIntRadio 负数的比率（> 0的整数）
+     * @param positiveIntRadio 正数的比率 (>0的整数)
+     * @return -factor 或者factor
+     */
+    RandomNumUtil.getPolarizationFactor = function (factor, negativeIntRadio, positiveIntRadio) {
+        if (factor === void 0) { factor = 1; }
+        if (negativeIntRadio === void 0) { negativeIntRadio = 1; }
+        if (positiveIntRadio === void 0) { positiveIntRadio = 1; }
+        var r = RandomNumUtil.randomNumWithRadio(0, 1, [negativeIntRadio, positiveIntRadio]);
+        if (r == 0)
+            return -1 * factor;
+        return r * factor;
+    };
+    /**
+     * 按照比率获得随机数(对于整数)
+     * @param min 最小数
+     * @param max 最大数
+     * @param radioArr 比率
+     */
+    RandomNumUtil.randomNumWithRadio = function (min, max, radioArr) {
+        var total = 0;
+        var i;
+        for (i = 0; i < radioArr.length; i++) {
+            total += radioArr[i];
+        }
+        var r = RandomNumUtil.randomNumBoth(1, total, true);
+        var target = 0;
+        for (i = 0; i < radioArr.length; i++) {
+            target += radioArr[i];
+            if (r <= target) {
+                return i + min;
+            }
+        }
+        return max;
+    };
+    return RandomNumUtil;
+}());
+exports.RandomNumUtil = RandomNumUtil;

package/common/util/SelfDecrypt.js

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SelfDecrypt = void 0;
+/**
+ * 解码
+ * @author Aonaufly
+ */
+var SelfDecrypt = /** @class */ (function () {
+    function SelfDecrypt() {
+    }
+    SelfDecrypt.b64Decode = function (b64) {
+        // 浏览器安全解码，自动补 =
+        var s = b64.replace(/[^A-Za-z0-9+/]/g, '');
+        var bin = atob(s);
+        return new Uint8Array(bin.length).map(function (_, i) { return bin.charCodeAt(i); });
+    };
+    SelfDecrypt.b64Encode = function (bytes) {
+        var bin = '';
+        for (var i = 0; i < bytes.length; i++) {
+            bin += String.fromCharCode(bytes[i]);
+        }
+        return btoa(bin);
+    };
+    SelfDecrypt.xorBytes = function (bytes, key) {
+        var k = new TextEncoder().encode(key);
+        return bytes.map(function (b, i) { return b ^ k[i % k.length]; });
+    };
+    /**
+     * 解码
+     */
+    SelfDecrypt.decryptBase64 = function (b64, key) {
+        var cipher = SelfDecrypt.b64Decode(b64);
+        var plain = SelfDecrypt.xorBytes(cipher, key);
+        return new TextDecoder().decode(plain);
+    };
+    return SelfDecrypt;
+}());
+exports.SelfDecrypt = SelfDecrypt;

package/common/util/StringUtil.js

@@ -0,0 +1,88 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.StringUtil = void 0;
+/**
+ * 字符串工具
+ * @author aonaufly
+ */
+var StringUtil = /** @class */ (function () {
+    function StringUtil() {
+    }
+    /**
+     * 字符串的格式化 , 使用 {index = 0}的模式
+     * @param str 源字符串
+     * @param args 填充参数
+     */
+    StringUtil.format = function (str) {
+        var args = [];
+        for (var _i = 1; _i < arguments.length; _i++) {
+            args[_i - 1] = arguments[_i];
+        }
+        if (!args || args.length == 0)
+            return str;
+        for (var i = 0, j = args.length; i < j; i++) {
+            str = str.replace("{".concat(i, "}"), args[i]);
+        }
+        return str;
+    };
+    /**
+     * 将字符串中所有的\/替换成/
+     */
+    StringUtil.replaceBackslash = function (input) {
+        // 使用正则表达式替换所有的 \\/ 为 /
+        return input.replace(/\\\//g, '/');
+    };
+    StringUtil.code2utf8 = function (uni) {
+        var uni2 = uni.toString(2);
+        if (uni < 128) {
+            return uni.toString(16);
+        }
+        else if (uni < 2048) {
+            uni2 = ("00000000000000000" + uni2).slice(-11);
+            var s1 = parseInt("110" + uni2.substring(0, 5), 2);
+            var s2 = parseInt("10" + uni2.substring(5), 2);
+            return s1.toString(16) + "," + s2.toString(16);
+        }
+        else {
+            uni2 = ("00000000000000000" + uni2).slice(-16);
+            var s1 = parseInt("1110" + uni2.substring(0, 4), 2);
+            var s2 = parseInt("10" + uni2.substring(4, 10), 2);
+            var s3 = parseInt("10" + uni2.substring(10), 2);
+            return s1.toString(16) + "," + s2.toString(16) + "," + s3.toString(16);
+        }
+    };
+    /**
+     * 将字符串转化成UTF8的Buffer
+     * @param str 字符串
+     */
+    StringUtil.string2UTF8Buffer = function (str) {
+        var val = "";
+        for (var i = 0; i < str.length; i++) {
+            val += "," + StringUtil.code2utf8(str.charCodeAt(i));
+        }
+        val += ",00";
+        // 将16进制转化为ArrayBuffer
+        return new Uint8Array(val.match(/[\da-f]{2}/gi).map(function (h) {
+            return parseInt(h, 16);
+        })).buffer;
+    };
+    // /**
+    //  * 将buffer转化成UTF8
+    //  * @param buffer
+    //  */
+    // public static buffer2UTF8String(buffer: ArrayBuffer): string {
+    //     const encodedString: string = String.fromCharCode.apply(null, new Uint8Array(buffer));
+    //     // const decodedString: string = decodeURIComponent(escape(atob(encodedString)));
+    //     return encodedString;
+    // }
+    /* 将buffer转化成UTF8
+     * @param buffer
+     */
+    StringUtil.buffer2UTF8String = function (buffer) {
+        var uint8Array = new Uint8Array(buffer);
+        var data = uint8Array.reduce(function (acc, i) { return (acc += String.fromCharCode.apply(null, [i])); }, "");
+        return data;
+    };
+    return StringUtil;
+}());
+exports.StringUtil = StringUtil;

package/common/util/UniqueIDUtil.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UniqueIDUtil = void 0;
+/**
+ * 唯一ID生成器
+ * @author Aonaufly
+ */
+var UniqueIDUtil = /** @class */ (function () {
+    function UniqueIDUtil() {
+    }
+    /**生成唯一ID值*/
+    UniqueIDUtil.getUniqueId = function () {
+        return new Date().getTime() + Math.random().toString(36).substring(2);
+    };
+    /**生成复合的Key值*/
+    UniqueIDUtil.getCompositeKey = function (key, uniqueId) {
+        return "".concat(key, "-id:").concat(uniqueId);
+    };
+    return UniqueIDUtil;
+}());
+exports.UniqueIDUtil = UniqueIDUtil;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "light-h5-core-lib",
-  "version": "2.8.2",
+  "version": "2.8.3",
   "description": "light core lib",
   "main": "./LightCore.js",
   "types": "./type/index.d.ts",

package/pool/PoolObj.js

@@ -0,0 +1,79 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PoolObj = void 0;
+/**
+ * 对象池（泛型）
+ * @author Aonaufly
+ */
+var PoolObj = /** @class */ (function () {
+    /**
+     * @param cap 容量(容积)
+     */
+    function PoolObj(cap) {
+        if (cap === void 0) { cap = 5; }
+        this._cap = cap;
+        this._pool = [];
+    }
+    PoolObj.prototype.put = function (obj) {
+        if (!obj || this._pool.length >= this._cap)
+            return false;
+        this._pool.push(obj);
+        return true;
+    };
+    PoolObj.prototype.one = function () {
+        if (this._pool.length == 0)
+            return null;
+        return this._pool.shift();
+    };
+    Object.defineProperty(PoolObj.prototype, "cap", {
+        /**
+         * 获取容量(容积)
+         */
+        get: function () {
+            return this._cap;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(PoolObj.prototype, "size", {
+        /**
+         * 获取当前数量（已经保存的元素个数）
+         */
+        get: function () {
+            if (!this._pool)
+                return 0;
+            return this._pool.length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * 清理对象池
+     */
+    PoolObj.prototype.clear = function () {
+        if (!this._pool)
+            return;
+        if (this._pool.length == 0)
+            return;
+        var obj;
+        for (var i = 0, j = this._pool.length; i < j; i++) {
+            obj = this._pool[i];
+            if (obj.destroy) {
+                obj.destroy();
+            }
+            else if (obj.onDestroy) {
+                obj.onDestroy();
+            }
+            obj = null;
+        }
+        this._pool.length = 0;
+    };
+    PoolObj.prototype.destroy = function (isCleared) {
+        if (!isCleared) {
+            this.clear();
+        }
+        this._pool && (this._pool = null);
+    };
+    return PoolObj;
+}());
+exports.PoolObj = PoolObj;

package/LightCore.ts

@@ -1,49 +0,0 @@
-import {PoolObj} from "./pool/PoolObj";
-import {BaseSingleton} from "./common/base/BaseSingleton";
-import {BitUtil} from "./common/util/BitUtil";
-import {DateUtil} from "./common/util/DateUtil";
-import {FloatDigitUtil} from "./common/util/FloatDigitUtil";
-import {RandomNumUtil} from "./common/util/RandomNumUtil";
-import {StringUtil} from "./common/util/StringUtil";
-import {UniqueIDUtil} from "./common/util/UniqueIDUtil";
-import {BeizerUtil} from "./common/util/BeizerUtil";
-import {MD5} from "./common/md5/MD5";
-import PromiseUtil from "./common/util/PromiseUtil";
-import Crc32Util from "./common/util/Crc32Util";
-import {BooleanUtil} from "./common/util/BooleanUtil";
-import {NumberUtil} from "./common/util/NumberUtil";
-import {SelfDecrypt} from "./common/util/SelfDecrypt";
-
-module.exports = {
-    PoolObj: PoolObj,
-    BaseSingleton: BaseSingleton,
-    MD5: MD5,
-    BitUtil: BitUtil,
-    DateUtil: DateUtil,
-    FloatDigitUtil: FloatDigitUtil,
-    RandomNumUtil: RandomNumUtil,
-    StringUtil: StringUtil,
-    UniqueIDUtil: UniqueIDUtil,
-    BeizerUtil: BeizerUtil,
-    PromiseUtil: PromiseUtil,
-    Crc32Util: Crc32Util,
-    BooleanUtil: BooleanUtil,
-    NumberUtil: NumberUtil,
-    SelfDecrypt: SelfDecrypt,
-};
-
-export {PoolObj};
-export {BaseSingleton};
-export {MD5};
-export {BitUtil};
-export {DateUtil};
-export {FloatDigitUtil};
-export {RandomNumUtil};
-export {StringUtil};
-export {UniqueIDUtil};
-export {BeizerUtil};
-export {PromiseUtil};
-export {Crc32Util};
-export {BooleanUtil};
-export {NumberUtil};
-export {SelfDecrypt};

package/common/base/BaseSingleton.ts

@@ -1,28 +0,0 @@
-import {IDestroy} from "./IDestroy";
-
-/**
- * 泛型单例基类
- * @author Aonaufly
- */
-export abstract class BaseSingleton<T> implements IDestroy {
-    private static _instance: any = null;
-
-    public static getInstance<T>(c: { new(): T }): T {
-        if (this._instance == null) {
-            this._instance = new c();
-            this._instance.ctor();
-        }
-        return this._instance;
-    }
-
-    /**
-     * 相当于构造函数
-     */
-    protected ctor(): void {
-
-    }
-
-    public destroy(): void {
-        BaseSingleton._instance = null;
-    }
-}

package/common/base/IClear.ts

@@ -1,5 +0,0 @@
-import { IDestroy } from "./IDestroy";
-
-export interface IClear extends IDestroy {
-    clear(): void;
-}

package/common/base/IDestroy.ts

@@ -1,3 +0,0 @@
-export interface IDestroy {
-    destroy(): void;
-}

package/common/util/BeizerUtil.ts

@@ -1,87 +0,0 @@
-/**
- * 贝塞尔曲线运动
- * @author Aonaufly
- */
-export class BeizerUtil {
-    //#region 获得当前坐标
-    /**
-     * 获得当前坐标
-     * @param timer 时间[0,1]
-     * @returns
-     */
-    public static getPosition(
-        points: { x: number; y: number }[],
-        timer: number
-    ): { x: number; y: number } {
-        let x: number = 0,
-            y: number = 0;
-        let bezier: number;
-        for (let i: number = 0, n: number = points.length; i < n; i++) {
-            bezier =
-                Math.min(Math.pow(1 - timer, n - i - 1) * Math.pow(timer, i)) *
-                BeizerUtil.calculationC(i, n);
-            x += points[i].x * bezier;
-            y += points[i].y * bezier;
-        }
-        return { x, y };
-    }
-
-    private static calculationC: (i: number, n: number) => number = (i, n): number => {
-        return (
-            BeizerUtil.factorial(n - 1) /
-            (BeizerUtil.factorial(i) * BeizerUtil.factorial(n - 1 - i))
-        );
-    };
-
-    private static factorial: (num: number) => number = (num): number => {
-        if (num < 0) {
-            return 1;
-        } else if (num === 0 || num === 1) {
-            return 1;
-        } else {
-            return num * BeizerUtil.factorial(num - 1);
-        }
-    };
-    //#endregion
-
-    //region 获得路线的长度
-    private static distance(p1: { x: number; y: number }, p2: { x: number; y: number }): number {
-        const dx: number = p2.x - p1.x;
-        const dy: number = p2.y - p1.y;
-        return Math.sqrt(dx * dx + dy * dy);
-    }
-    /**
-     * 获得整个路线的长度
-     * @param precision 精确度（微积分方案）
-     */
-    public static getLength(points: { x: number; y: number }[], precision: number = 100): number {
-        let length: number = 0;
-        let point1: { x: number; y: number };
-        let point2: { x: number; y: number };
-        for (let t: number = 0; t < 1; t += 1 / precision) {
-            point1 = BeizerUtil.getBezierPoint(points, t);
-            point2 = BeizerUtil.getBezierPoint(points, t + 1 / precision);
-            length += BeizerUtil.distance(point1, point2);
-        }
-        return length;
-    }
-
-    private static getBezierPoint: (
-        points: { x: number; y: number }[],
-        t: number
-    ) => { x: number; y: number } = (points, t) => {
-        if (points.length === 1) {
-            return points[0];
-        }
-        const nextPoints: { x: number; y: number }[] = [];
-        let x: number;
-        let y: number;
-        for (let i: number = 0; i < points.length - 1; i++) {
-            x = (1 - t) * points[i].x + t * points[i + 1].x;
-            y = (1 - t) * points[i].y + t * points[i + 1].y;
-            nextPoints.push({ x, y });
-        }
-        return BeizerUtil.getBezierPoint(nextPoints, t);
-    };
-    //#endregion
-}