@visactor/vutils 0.9.0-alpha.0

package/cjs/common/toNumber.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/toNumber.ts"],"names":[],"mappings":";;;AAAA,SAAgB,QAAQ,CAAC,CAAM;IAC7B,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAFD,4BAEC","file":"toNumber.js","sourcesContent":["export function toNumber(a: any) {\n  return Number(a);\n}\n"]}

package/cjs/common/toValidNumber.d.ts

@@ -0,0 +1 @@
+export declare function toValidNumber(v: any): number;

package/cjs/common/toValidNumber.js

@@ -0,0 +1,22 @@
+"use strict";
+
+var __importDefault = this && this.__importDefault || function(mod) {
+    return mod && mod.__esModule ? mod : {
+        default: mod
+    };
+};
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.toValidNumber = void 0;
+
+const isValidNumber_1 = __importDefault(require("./isValidNumber"));
+
+function toValidNumber(v) {
+    if ((0, isValidNumber_1.default)(v)) return v;
+    const value = +v;
+    return (0, isValidNumber_1.default)(value) ? value : 0;
+}
+
+exports.toValidNumber = toValidNumber;
+//# sourceMappingURL=toValidNumber.js.map

package/cjs/common/toValidNumber.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/toValidNumber.ts"],"names":[],"mappings":";;;;;;AAAA,oEAA4C;AAE5C,SAAgB,aAAa,CAAC,CAAM;IAClC,IAAI,IAAA,uBAAa,EAAC,CAAC,CAAC,EAAE;QACpB,OAAO,CAAC,CAAC;KACV;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC;IACjB,OAAO,IAAA,uBAAa,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAND,sCAMC","file":"toValidNumber.js","sourcesContent":["import isValidNumber from './isValidNumber';\n\nexport function toValidNumber(v: any) {\n  if (isValidNumber(v)) {\n    return v;\n  }\n  const value = +v;\n  return isValidNumber(value) ? value : 0;\n}\n"]}

package/cjs/common/truncate.d.ts

@@ -0,0 +1,2 @@
+declare const truncate: (str: string | number, length: number, align?: 'left' | 'center' | 'right' | unknown, ellipsis?: string) => string;
+export default truncate;

package/cjs/common/truncate.js

@@ -0,0 +1,19 @@
+"use strict";
+
+var __importDefault = this && this.__importDefault || function(mod) {
+    return mod && mod.__esModule ? mod : {
+        default: mod
+    };
+};
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+});
+
+const isNil_1 = __importDefault(require("./isNil")), truncate = (str, length, align = "right", ellipsis) => {
+    const e = (0, isNil_1.default)(ellipsis) ? "…" : ellipsis, s = str + "", n = s.length, l = Math.max(0, length - e.length);
+    return n <= length ? s : "left" === align ? e + s.slice(n - l) : "center" === align ? s.slice(0, Math.ceil(l / 2)) + e + s.slice(n - Math.floor(l / 2)) : s.slice(0, l) + e;
+};
+
+exports.default = truncate;
+//# sourceMappingURL=truncate.js.map

package/cjs/common/truncate.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/truncate.ts"],"names":[],"mappings":";;;;;AAAA,oDAA4B;AAE5B,MAAM,QAAQ,GAAG,CACf,GAAoB,EACpB,MAAc,EACd,QAA+C,OAAO,EACtD,QAAiB,EACjB,EAAE;IACF,MAAM,CAAC,GAAG,CAAC,IAAA,eAAK,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IACjD,MAAM,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAEzC,IAAI,CAAC,IAAI,MAAM,EAAE;QACf,OAAO,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,MAAM,EAAE;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KAC3B;IAED,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AACpH,CAAC,CAAC;AAEF,kBAAe,QAAQ,CAAC","file":"truncate.js","sourcesContent":["import isNil from './isNil';\n\nconst truncate = (\n  str: string | number,\n  length: number,\n  align: 'left' | 'center' | 'right' | unknown = 'right',\n  ellipsis?: string\n) => {\n  const e = !isNil(ellipsis) ? ellipsis : '\\u2026';\n  const s = str + '';\n  const n = s.length;\n  const l = Math.max(0, length - e.length);\n\n  if (n <= length) {\n    return s;\n  }\n\n  if (align === 'left') {\n    return e + s.slice(n - l);\n  }\n\n  return align === 'center' ? s.slice(0, Math.ceil(l / 2)) + e + s.slice(n - Math.floor(l / 2)) : s.slice(0, l) + e;\n};\n\nexport default truncate;\n"]}

package/cjs/common/upperFirst.d.ts

@@ -0,0 +1,2 @@
+declare const upperFirst: (str: string) => string;
+export default upperFirst;

package/cjs/common/upperFirst.js

@@ -0,0 +1,12 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+});
+
+const upperFirst = function(str) {
+    return str.charAt(0).toUpperCase() + str.substring(1);
+};
+
+exports.default = upperFirst;
+//# sourceMappingURL=upperFirst.js.map

package/cjs/common/upperFirst.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/upperFirst.ts"],"names":[],"mappings":";;AAAA,MAAM,UAAU,GAAG,UAAU,GAAW;IACtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC,CAAC;AAEF,kBAAe,UAAU,CAAC","file":"upperFirst.js","sourcesContent":["const upperFirst = function (str: string): string {\n  return str.charAt(0).toUpperCase() + str.substring(1);\n};\n\nexport default upperFirst;\n"]}

package/cjs/common/uuid.d.ts

@@ -0,0 +1,2 @@
+declare const uuid: (len: number, radix: number) => string;
+export default uuid;

package/cjs/common/uuid.js

@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+});
+
+const uuid = (len, radix) => {
+    const chars = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz".split(""), uuid = [];
+    let i;
+    if (radix = radix || chars.length, len) for (i = 0; i < len; i++) uuid[i] = chars[0 | Math.random() * radix]; else {
+        let r;
+        for (uuid[8] = uuid[13] = uuid[18] = uuid[23] = "-", uuid[14] = "4", i = 0; i < 36; i++) uuid[i] || (r = 0 | 16 * Math.random(), 
+        uuid[i] = chars[19 === i ? 3 & r | 8 : r]);
+    }
+    return uuid.join("");
+};
+
+exports.default = uuid;
+//# sourceMappingURL=uuid.js.map

package/cjs/common/uuid.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/uuid.ts"],"names":[],"mappings":";;AAQA,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,KAAa,EAAU,EAAE;IAClD,MAAM,KAAK,GAAG,gEAAgE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACzF,MAAM,IAAI,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,CAAC;IACN,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IAE9B,IAAI,GAAG,EAAE;QAEP,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YACxB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;SAC9C;KACF;SAAM;QAEL,IAAI,CAAC,CAAC;QAGN,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAC/C,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAIf,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACZ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC7B,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACF;KACF;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC,CAAC;AAEF,kBAAe,IAAI,CAAC","file":"uuid.js","sourcesContent":["// TODO: 性能不是很好，需要优化，后续升级到最新版本的 canvas 之后就可以删除了\n/**\n * 生成uuid字符串.\n * 参考https://github.com/yangjunning/issues/issues/56\n * @param len\n * @param radix\n * @returns\n */\nconst uuid = (len: number, radix: number): string => {\n  const chars = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'.split('');\n  const uuid = [];\n  let i;\n  radix = radix || chars.length;\n\n  if (len) {\n    // Compact form\n    for (i = 0; i < len; i++) {\n      uuid[i] = chars[0 | (Math.random() * radix)];\n    }\n  } else {\n    // rfc4122, version 4 form\n    let r;\n\n    // rfc4122 requires these characters\n    uuid[8] = uuid[13] = uuid[18] = uuid[23] = '-';\n    uuid[14] = '4';\n\n    // Fill in random data.  At i==19 set the high bits of clock sequence as\n    // per rfc4122, sec. 4.1.5\n    for (i = 0; i < 36; i++) {\n      if (!uuid[i]) {\n        r = 0 | (Math.random() * 16);\n        uuid[i] = chars[i === 19 ? (r & 0x3) | 0x8 : r];\n      }\n    }\n  }\n\n  return uuid.join('');\n};\n\nexport default uuid;\n"]}

package/cjs/common/variance.d.ts

@@ -0,0 +1 @@
+export declare function variance(values: any[], valueof?: (entry: any, index?: number, arr?: any[]) => number): number;

package/cjs/common/variance.js

@@ -0,0 +1,17 @@
+"use strict";
+
+function variance(values, valueof) {
+    let delta, count = 0, mean = 0, sum = 0;
+    if (void 0 === valueof) for (let value of values) null != value && (value = +value) >= value && (delta = value - mean, 
+    mean += delta / ++count, sum += delta * (value - mean)); else {
+        let index = -1;
+        for (let value of values) null != (value = valueof(value, ++index, values)) && (value = +value) >= value && (delta = value - mean, 
+        mean += delta / ++count, sum += delta * (value - mean));
+    }
+    return count > 1 ? sum / (count - 1) : 0;
+}
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.variance = void 0, exports.variance = variance;
+//# sourceMappingURL=variance.js.map

package/cjs/common/variance.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/variance.ts"],"names":[],"mappings":";;;AAAA,SAAgB,QAAQ,CAAC,MAAa,EAAE,OAA6D;IACnG,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,CAAC;IACV,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,OAAO,KAAK,SAAS,EAAE;QACzB,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,EAAE;gBAC9C,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;gBACrB,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,CAAC;gBACxB,GAAG,IAAI,KAAK,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;aAC/B;SACF;KACF;SAAM;QACL,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,EAAE;gBAClF,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;gBACrB,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,CAAC;gBACxB,GAAG,IAAI,KAAK,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;aAC/B;SACF;KACF;IACD,IAAI,KAAK,GAAG,CAAC,EAAE;QACb,OAAO,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;KAC1B;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AA5BD,4BA4BC","file":"variance.js","sourcesContent":["export function variance(values: any[], valueof?: (entry: any, index?: number, arr?: any[]) => number) {\n  let count = 0;\n  let delta;\n  let mean = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  }\n  if (count > 1) {\n    return sum / (count - 1);\n  }\n\n  return 0;\n}\n"]}

package/cjs/data-structure/bounds.d.ts

@@ -0,0 +1,81 @@
+import type { IMatrix } from './matrix';
+import type { IPointLike } from './point';
+export type IBoundsLike = Pick<IBounds, 'x1' | 'y1' | 'x2' | 'y2'>;
+export type IAABBBoundsLike = IBoundsLike;
+export type IOBBBoundsLike = Pick<IOBBBounds, 'x1' | 'y1' | 'x2' | 'y2' | 'angle'>;
+export interface IBounds {
+    x1: number;
+    y1: number;
+    x2: number;
+    y2: number;
+    clone: () => IBounds;
+    clear: () => IBounds;
+    empty: () => boolean;
+    equals: (b: IBounds) => boolean;
+    set: (x1: number, y1: number, x2: number, y2: number) => IBounds;
+    setValue: (x1: number, y1: number, x2: number, y2: number) => IBounds;
+    add: (x: number, y: number) => IBounds;
+    expand: (d: number) => IBounds;
+    round: () => IBounds;
+    translate: (dx: number, dy: number) => IBounds;
+    rotate: (angle: number, x: number, y: number) => IBounds;
+    scale: (sx: number, sy: number, x: number, y: number) => IBounds;
+    union: (b: IBoundsLike) => IBounds;
+    intersect: (b: IBoundsLike) => IBounds;
+    encloses: (b: IBoundsLike) => boolean;
+    alignsWith: (b: IBoundsLike) => boolean;
+    intersects: (b: IBoundsLike) => boolean;
+    contains: (x: number, y: number) => boolean;
+    containsPoint: (p: IPointLike) => boolean;
+    width: () => number;
+    height: () => number;
+    scaleX: (s: number) => IBounds;
+    scaleY: (s: number) => IBounds;
+    copy: (b: IBoundsLike) => IBounds;
+    transformWithMatrix: (matrix: IMatrix) => IBounds;
+}
+export type IAABBBounds = IBounds;
+export interface IOBBBounds extends IBounds {
+    angle: number;
+}
+export declare function transformBoundsWithMatrix(out: IBounds, bounds: IBounds, matrix: IMatrix): IBounds;
+export declare function transformBounds(bounds: IBounds, x: number, y: number, scaleX: number, scaleY: number, angle: number, rotateCenter?: [number, number]): void;
+export declare class Bounds implements IBounds {
+    x1: number;
+    y1: number;
+    x2: number;
+    y2: number;
+    constructor(bounds?: Bounds);
+    clone(): Bounds;
+    clear(): Bounds;
+    empty(): boolean;
+    equals(b: IBoundsLike): boolean;
+    setValue(x1?: number, y1?: number, x2?: number, y2?: number): Bounds;
+    set(x1?: number, y1?: number, x2?: number, y2?: number): Bounds;
+    add(x?: number, y?: number): Bounds;
+    expand(d?: number | [number, number, number, number]): Bounds;
+    round(): Bounds;
+    translate(dx?: number, dy?: number): Bounds;
+    rotate(angle?: number, x?: number, y?: number): Bounds;
+    scale(sx?: number, sy?: number, x?: number, y?: number): Bounds;
+    union(b: IBoundsLike): Bounds;
+    intersect(b: IBoundsLike): Bounds;
+    encloses(b: IBoundsLike): boolean;
+    alignsWith(b: IBoundsLike): boolean;
+    intersects(b: IBoundsLike): boolean;
+    contains(x?: number, y?: number): boolean;
+    containsPoint(p: IPointLike): boolean;
+    width(): number;
+    height(): number;
+    scaleX(s?: number): Bounds;
+    scaleY(s?: number): Bounds;
+    transformWithMatrix(matrix: IMatrix): Bounds;
+    copy(b: IBoundsLike): this;
+    private rotatedPoints;
+    private scalePoints;
+}
+export declare class AABBBounds extends Bounds {
+}
+export declare class OBBBounds extends Bounds {
+    angle: number;
+}

package/cjs/data-structure/bounds.js

@@ -0,0 +1,139 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.OBBBounds = exports.AABBBounds = exports.Bounds = exports.transformBounds = exports.transformBoundsWithMatrix = void 0;
+
+const common_1 = require("../common"), math_1 = require("../math");
+
+function transformBoundsWithMatrix(out, bounds, matrix) {
+    const {x1: x1, y1: y1, x2: x2, y2: y2} = bounds;
+    return matrix.onlyTranslate() ? (out !== bounds && out.setValue(bounds.x1, bounds.y1, bounds.x2, bounds.y2), 
+    out.translate(matrix.e, matrix.f), bounds) : (out.clear(), out.add(matrix.a * x1 + matrix.c * y1 + matrix.e, matrix.b * x1 + matrix.d * y1 + matrix.f), 
+    out.add(matrix.a * x2 + matrix.c * y1 + matrix.e, matrix.b * x2 + matrix.d * y1 + matrix.f), 
+    out.add(matrix.a * x2 + matrix.c * y2 + matrix.e, matrix.b * x2 + matrix.d * y2 + matrix.f), 
+    out.add(matrix.a * x1 + matrix.c * y2 + matrix.e, matrix.b * x1 + matrix.d * y2 + matrix.f), 
+    bounds);
+}
+
+function transformBounds(bounds, x, y, scaleX, scaleY, angle, rotateCenter) {
+    if (!((0, math_1.abs)(scaleX) <= math_1.epsilon || (0, math_1.abs)(scaleY) <= math_1.epsilon)) {
+        if (1 !== scaleX && bounds.scaleX(scaleX), 1 !== scaleY && bounds.scaleY(scaleY), 
+        isFinite(angle) && Math.abs(angle) > math_1.epsilon) {
+            let rx = 0, ry = 0;
+            void 0 !== rotateCenter && (rx = rotateCenter[0], ry = rotateCenter[1]), bounds.rotate(angle, rx, ry);
+        }
+        bounds.translate(x, y);
+    }
+}
+
+exports.transformBoundsWithMatrix = transformBoundsWithMatrix, exports.transformBounds = transformBounds;
+
+class Bounds {
+    constructor(bounds) {
+        bounds ? this.setValue(bounds.x1, bounds.y1, bounds.x2, bounds.y2) : this.clear();
+    }
+    clone() {
+        return new Bounds(this);
+    }
+    clear() {
+        return this.x1 = +Number.MAX_VALUE, this.y1 = +Number.MAX_VALUE, this.x2 = -Number.MAX_VALUE, 
+        this.y2 = -Number.MAX_VALUE, this;
+    }
+    empty() {
+        return this.x1 === +Number.MAX_VALUE && this.y1 === +Number.MAX_VALUE && this.x2 === -Number.MAX_VALUE && this.y2 === -Number.MAX_VALUE;
+    }
+    equals(b) {
+        return this.x1 === b.x1 && this.y1 === b.y1 && this.x2 === b.x2 && this.y2 === b.y2;
+    }
+    setValue(x1 = 0, y1 = 0, x2 = 0, y2 = 0) {
+        return this.x1 = x1, this.y1 = y1, this.x2 = x2, this.y2 = y2, this;
+    }
+    set(x1 = 0, y1 = 0, x2 = 0, y2 = 0) {
+        return x2 < x1 ? (this.x2 = x1, this.x1 = x2) : (this.x1 = x1, this.x2 = x2), y2 < y1 ? (this.y2 = y1, 
+        this.y1 = y2) : (this.y1 = y1, this.y2 = y2), this;
+    }
+    add(x = 0, y = 0) {
+        return x < this.x1 && (this.x1 = x), y < this.y1 && (this.y1 = y), x > this.x2 && (this.x2 = x), 
+        y > this.y2 && (this.y2 = y), this;
+    }
+    expand(d = 0) {
+        return (0, common_1.isArray)(d) ? (this.y1 -= d[0], this.x2 += d[1], this.y2 += d[2], 
+        this.x1 -= d[3]) : (this.x1 -= d, this.y1 -= d, this.x2 += d, this.y2 += d), this;
+    }
+    round() {
+        return this.x1 = Math.floor(this.x1), this.y1 = Math.floor(this.y1), this.x2 = Math.ceil(this.x2), 
+        this.y2 = Math.ceil(this.y2), this;
+    }
+    translate(dx = 0, dy = 0) {
+        return this.x1 += dx, this.x2 += dx, this.y1 += dy, this.y2 += dy, this;
+    }
+    rotate(angle = 0, x = 0, y = 0) {
+        const p = this.rotatedPoints(angle, x, y);
+        return this.clear().add(p[0], p[1]).add(p[2], p[3]).add(p[4], p[5]).add(p[6], p[7]);
+    }
+    scale(sx = 0, sy = 0, x = 0, y = 0) {
+        const p = this.scalePoints(sx, sy, x, y);
+        return this.clear().add(p[0], p[1]).add(p[2], p[3]);
+    }
+    union(b) {
+        return b.x1 < this.x1 && (this.x1 = b.x1), b.y1 < this.y1 && (this.y1 = b.y1), b.x2 > this.x2 && (this.x2 = b.x2), 
+        b.y2 > this.y2 && (this.y2 = b.y2), this;
+    }
+    intersect(b) {
+        return b.x1 > this.x1 && (this.x1 = b.x1), b.y1 > this.y1 && (this.y1 = b.y1), b.x2 < this.x2 && (this.x2 = b.x2), 
+        b.y2 < this.y2 && (this.y2 = b.y2), this;
+    }
+    encloses(b) {
+        return b && this.x1 <= b.x1 && this.x2 >= b.x2 && this.y1 <= b.y1 && this.y2 >= b.y2;
+    }
+    alignsWith(b) {
+        return b && (this.x1 === b.x1 || this.x2 === b.x2 || this.y1 === b.y1 || this.y2 === b.y2);
+    }
+    intersects(b) {
+        return b && !(this.x2 < b.x1 || this.x1 > b.x2 || this.y2 < b.y1 || this.y1 > b.y2);
+    }
+    contains(x = 0, y = 0) {
+        return !(x < this.x1 || x > this.x2 || y < this.y1 || y > this.y2);
+    }
+    containsPoint(p) {
+        return !(p.x < this.x1 || p.x > this.x2 || p.y < this.y1 || p.y > this.y2);
+    }
+    width() {
+        return this.empty() ? 0 : this.x2 - this.x1;
+    }
+    height() {
+        return this.empty() ? 0 : this.y2 - this.y1;
+    }
+    scaleX(s = 0) {
+        return this.x1 *= s, this.x2 *= s, this;
+    }
+    scaleY(s = 0) {
+        return this.y1 *= s, this.y2 *= s, this;
+    }
+    transformWithMatrix(matrix) {
+        return transformBoundsWithMatrix(this, this, matrix), this;
+    }
+    copy(b) {
+        return this.x1 = b.x1, this.y1 = b.y1, this.x2 = b.x2, this.y2 = b.y2, this;
+    }
+    rotatedPoints(angle, x, y) {
+        const {x1: x1, y1: y1, x2: x2, y2: y2} = this, cos = Math.cos(angle), sin = Math.sin(angle), cx = x - x * cos + y * sin, cy = y - x * sin - y * cos;
+        return [ cos * x1 - sin * y1 + cx, sin * x1 + cos * y1 + cy, cos * x1 - sin * y2 + cx, sin * x1 + cos * y2 + cy, cos * x2 - sin * y1 + cx, sin * x2 + cos * y1 + cy, cos * x2 - sin * y2 + cx, sin * x2 + cos * y2 + cy ];
+    }
+    scalePoints(sx, sy, x, y) {
+        const {x1: x1, y1: y1, x2: x2, y2: y2} = this;
+        return [ sx * x1 + (1 - sx) * x, sy * y1 + (1 - sy) * y, sx * x2 + (1 - sx) * x, sy * y2 + (1 - sy) * y ];
+    }
+}
+
+exports.Bounds = Bounds;
+
+class AABBBounds extends Bounds {}
+
+exports.AABBBounds = AABBBounds;
+
+class OBBBounds extends Bounds {}
+
+exports.OBBBounds = OBBBounds;
+//# sourceMappingURL=bounds.js.map

package/cjs/data-structure/bounds.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/data-structure/bounds.ts"],"names":[],"mappings":";;;AAAA,sCAAoC;AAEpC,kCAAuC;AA+EvC,SAAgB,yBAAyB,CAAC,GAAY,EAAE,MAAe,EAAE,MAAe;IACtF,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC;IAElC,IAAI,MAAM,CAAC,aAAa,EAAE,EAAE;QAC1B,IAAI,GAAG,KAAK,MAAM,EAAE;YAClB,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;SAC1D;QACD,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO,MAAM,CAAC;KACf;IACD,GAAG,CAAC,KAAK,EAAE,CAAC;IACZ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5F,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5F,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5F,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5F,OAAO,MAAM,CAAC;AAChB,CAAC;AAhBD,8DAgBC;AAYD,SAAgB,eAAe,CAC7B,MAAe,EACf,CAAS,EACT,CAAS,EACT,MAAc,EACd,MAAc,EACd,KAAa,EACb,YAA+B;IAE/B,IAAI,IAAA,UAAG,EAAC,MAAM,CAAC,IAAI,cAAO,IAAI,IAAA,UAAG,EAAC,MAAM,CAAC,IAAI,cAAO,EAAE;QACpD,OAAO;KACR;IAED,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAEtC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,cAAO,EAAE;QAChD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,YAAY,KAAK,SAAS,EAAE;YAC9B,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACrB,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;SACtB;QACD,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAC9B;IAED,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC;AA3BD,0CA2BC;AAiCD,MAAa,MAAM;IAOjB,YAAY,MAAe;QACzB,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;SAC3D;aAAM;YACL,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;IACH,CAAC;IAED,KAAK;QACH,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK;QACH,OAAO,CACL,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS;YAC7B,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS;YAC7B,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS;YAC7B,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS,CAC9B,CAAC;IACJ,CAAC;IACD,MAAM,CAAC,CAAc;QACnB,OAAO,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;IACtF,CAAC;IACD,QAAQ,CAAC,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC;QACrE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IACD,GAAG,CAAC,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC;QAChE,IAAI,EAAE,GAAG,EAAE,EAAE;YACX,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;SACd;aAAM;YACL,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;SACd;QACD,IAAI,EAAE,GAAG,EAAE,EAAE;YACX,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;SACd;aAAM;YACL,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,GAAG,CAAC,IAAY,CAAC,EAAE,IAAY,CAAC;QAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE;YACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACb;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE;YACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACb;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE;YACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACb;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE;YACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,CAAC,IAA+C,CAAC;QACrD,IAAI,IAAA,gBAAO,EAAC,CAAC,CAAC,EAAE;YACd,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SACjB;aAAM;YACL,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK;QACH,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,SAAS,CAAC,KAAa,CAAC,EAAE,KAAa,CAAC;QACtC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACd,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACd,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACd,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,CAAC,QAAgB,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC;QACpD,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IACD,KAAK,CAAC,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC;QAChE,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAMD,KAAK,CAAC,CAAc;QAClB,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAMD,SAAS,CAAC,CAAc;QACtB,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAMD,QAAQ,CAAC,CAAc;QACrB,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;IACvF,CAAC;IAMD,UAAU,CAAC,CAAc;QACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IAMD,UAAU,CAAC,CAAc;QACvB,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACtF,CAAC;IAOD,QAAQ,CAAC,IAAY,CAAC,EAAE,IAAY,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IACD,aAAa,CAAC,CAAa;QACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,KAAK;QACH,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;YAChB,OAAO,CAAC,CAAC;SACV;QACD,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC3B,CAAC;IACD,MAAM;QACJ,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;YAChB,OAAO,CAAC,CAAC;SACV;QACD,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC3B,CAAC;IACD,MAAM,CAAC,IAAY,CAAC;QAClB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,IAAY,CAAC;QAClB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mBAAmB,CAAC,MAAe;QACjC,yBAAyB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,CAAc;QACjB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACO,aAAa,CAAC,KAAa,EAAE,CAAS,EAAE,CAAS;QACvD,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACjC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAEjC,OAAO;YACL,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;YACxB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE;SACzB,CAAC;IACJ,CAAC;IACO,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,CAAS;QAC9D,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAEhC,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1G,CAAC;CACF;AAvPD,wBAuPC;AAED,MAAa,UAAW,SAAQ,MAAM;CAAG;AAAzC,gCAAyC;AACzC,MAAa,SAAU,SAAQ,MAAM;CAEpC;AAFD,8BAEC","file":"bounds.js","sourcesContent":["import { isArray } from '../common';\nimport type { vec4, vec8 } from '../math';\nimport { abs, epsilon } from '../math';\nimport type { IMatrix } from './matrix';\nimport type { IPointLike } from './point';\n\nexport type IBoundsLike = Pick<IBounds, 'x1' | 'y1' | 'x2' | 'y2'>;\nexport type IAABBBoundsLike = IBoundsLike;\nexport type IOBBBoundsLike = Pick<IOBBBounds, 'x1' | 'y1' | 'x2' | 'y2' | 'angle'>;\n\nexport interface IBounds {\n  x1: number;\n  y1: number;\n  x2: number;\n  y2: number;\n  clone: () => IBounds;\n  clear: () => IBounds;\n  empty: () => boolean;\n  equals: (b: IBounds) => boolean;\n  set: (x1: number, y1: number, x2: number, y2: number) => IBounds;\n  setValue: (x1: number, y1: number, x2: number, y2: number) => IBounds;\n  add: (x: number, y: number) => IBounds;\n  expand: (d: number) => IBounds;\n  round: () => IBounds;\n  translate: (dx: number, dy: number) => IBounds;\n  rotate: (angle: number, x: number, y: number) => IBounds;\n  scale: (sx: number, sy: number, x: number, y: number) => IBounds;\n  /**\n   * 并集\n   * @param b\n   * @returns\n   */\n  union: (b: IBoundsLike) => IBounds;\n  /**\n   * 交集\n   * @param b\n   * @returns\n   */\n  intersect: (b: IBoundsLike) => IBounds;\n  /**\n   * 是否包含b\n   * @param b\n   * @returns\n   */\n  encloses: (b: IBoundsLike) => boolean;\n  /**\n   * 是否共边\n   * @param b\n   * @returns\n   */\n  alignsWith: (b: IBoundsLike) => boolean;\n  /**\n   * 是否相交\n   * @param b\n   * @returns\n   */\n  intersects: (b: IBoundsLike) => boolean;\n  /**\n   * 是否包含\n   * @param x\n   * @param y\n   * @returns\n   */\n  contains: (x: number, y: number) => boolean;\n  containsPoint: (p: IPointLike) => boolean;\n  width: () => number;\n  height: () => number;\n  scaleX: (s: number) => IBounds;\n  scaleY: (s: number) => IBounds;\n\n  copy: (b: IBoundsLike) => IBounds;\n\n  transformWithMatrix: (matrix: IMatrix) => IBounds;\n}\n\nexport type IAABBBounds = IBounds;\n\nexport interface IOBBBounds extends IBounds {\n  angle: number;\n}\n\nexport function transformBoundsWithMatrix(out: IBounds, bounds: IBounds, matrix: IMatrix): IBounds {\n  const { x1, y1, x2, y2 } = bounds;\n  // 如果没有旋转和缩放，那就直接translate\n  if (matrix.onlyTranslate()) {\n    if (out !== bounds) {\n      out.setValue(bounds.x1, bounds.y1, bounds.x2, bounds.y2);\n    }\n    out.translate(matrix.e, matrix.f);\n    return bounds;\n  }\n  out.clear();\n  out.add(matrix.a * x1 + matrix.c * y1 + matrix.e, matrix.b * x1 + matrix.d * y1 + matrix.f);\n  out.add(matrix.a * x2 + matrix.c * y1 + matrix.e, matrix.b * x2 + matrix.d * y1 + matrix.f);\n  out.add(matrix.a * x2 + matrix.c * y2 + matrix.e, matrix.b * x2 + matrix.d * y2 + matrix.f);\n  out.add(matrix.a * x1 + matrix.c * y2 + matrix.e, matrix.b * x1 + matrix.d * y2 + matrix.f);\n  return bounds;\n}\n\n/**\n * 依据graphic的属性对bounds进行变换\n * @param bounds\n * @param x\n * @param y\n * @param scaleX\n * @param scaleY\n * @param angle\n * @param rotateCenter\n */\nexport function transformBounds(\n  bounds: IBounds,\n  x: number,\n  y: number,\n  scaleX: number,\n  scaleY: number,\n  angle: number,\n  rotateCenter?: [number, number]\n) {\n  if (abs(scaleX) <= epsilon || abs(scaleY) <= epsilon) {\n    return;\n  }\n\n  scaleX !== 1 && bounds.scaleX(scaleX);\n  scaleY !== 1 && bounds.scaleY(scaleY);\n\n  if (isFinite(angle) && Math.abs(angle) > epsilon) {\n    let rx = 0;\n    let ry = 0;\n    if (rotateCenter !== undefined) {\n      rx = rotateCenter[0];\n      ry = rotateCenter[1];\n    }\n    bounds.rotate(angle, rx, ry);\n  }\n\n  bounds.translate(x, y);\n}\n\n/**\nCopyright (c) 2015-2021, University of Washington Interactive Data Lab\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and/or other materials provided with the distribution.\n\n3. Neither the name of the copyright holder nor the names of its contributors\n  may be used to endorse or promote products derived from this software\n  without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n// 基于Vega的Bounds重构\n// https://github.com/vega/vega/blob/825bfaba6ccfe3306183df22b8c955a07bb30714/packages/vega-scenegraph/src/Bounds.js\nexport class Bounds implements IBounds {\n  // 默认初始值是Number.MAX_VALUE\n  x1: number;\n  y1: number;\n  x2: number;\n  y2: number;\n\n  constructor(bounds?: Bounds) {\n    if (bounds) {\n      this.setValue(bounds.x1, bounds.y1, bounds.x2, bounds.y2);\n    } else {\n      this.clear();\n    }\n  }\n\n  clone() {\n    return new Bounds(this);\n  }\n\n  clear(): Bounds {\n    this.x1 = +Number.MAX_VALUE;\n    this.y1 = +Number.MAX_VALUE;\n    this.x2 = -Number.MAX_VALUE;\n    this.y2 = -Number.MAX_VALUE;\n    return this;\n  }\n  empty(): boolean {\n    return (\n      this.x1 === +Number.MAX_VALUE &&\n      this.y1 === +Number.MAX_VALUE &&\n      this.x2 === -Number.MAX_VALUE &&\n      this.y2 === -Number.MAX_VALUE\n    );\n  }\n  equals(b: IBoundsLike): boolean {\n    return this.x1 === b.x1 && this.y1 === b.y1 && this.x2 === b.x2 && this.y2 === b.y2;\n  }\n  setValue(x1: number = 0, y1: number = 0, x2: number = 0, y2: number = 0): Bounds {\n    this.x1 = x1;\n    this.y1 = y1;\n    this.x2 = x2;\n    this.y2 = y2;\n    return this;\n  }\n  set(x1: number = 0, y1: number = 0, x2: number = 0, y2: number = 0): Bounds {\n    if (x2 < x1) {\n      this.x2 = x1;\n      this.x1 = x2;\n    } else {\n      this.x1 = x1;\n      this.x2 = x2;\n    }\n    if (y2 < y1) {\n      this.y2 = y1;\n      this.y1 = y2;\n    } else {\n      this.y1 = y1;\n      this.y2 = y2;\n    }\n    return this;\n  }\n  add(x: number = 0, y: number = 0): Bounds {\n    if (x < this.x1) {\n      this.x1 = x;\n    }\n    if (y < this.y1) {\n      this.y1 = y;\n    }\n    if (x > this.x2) {\n      this.x2 = x;\n    }\n    if (y > this.y2) {\n      this.y2 = y;\n    }\n    return this;\n  }\n  expand(d: number | [number, number, number, number] = 0): Bounds {\n    if (isArray(d)) {\n      this.y1 -= d[0];\n      this.x2 += d[1];\n      this.y2 += d[2];\n      this.x1 -= d[3];\n    } else {\n      this.x1 -= d;\n      this.y1 -= d;\n      this.x2 += d;\n      this.y2 += d;\n    }\n    return this;\n  }\n  round(): Bounds {\n    this.x1 = Math.floor(this.x1);\n    this.y1 = Math.floor(this.y1);\n    this.x2 = Math.ceil(this.x2);\n    this.y2 = Math.ceil(this.y2);\n    return this;\n  }\n  translate(dx: number = 0, dy: number = 0): Bounds {\n    this.x1 += dx;\n    this.x2 += dx;\n    this.y1 += dy;\n    this.y2 += dy;\n    return this;\n  }\n  rotate(angle: number = 0, x: number = 0, y: number = 0) {\n    const p = this.rotatedPoints(angle, x, y);\n    return this.clear().add(p[0], p[1]).add(p[2], p[3]).add(p[4], p[5]).add(p[6], p[7]);\n  }\n  scale(sx: number = 0, sy: number = 0, x: number = 0, y: number = 0) {\n    const p = this.scalePoints(sx, sy, x, y);\n    return this.clear().add(p[0], p[1]).add(p[2], p[3]);\n  }\n  /**\n   * 并集\n   * @param b\n   * @returns\n   */\n  union(b: IBoundsLike): Bounds {\n    if (b.x1 < this.x1) {\n      this.x1 = b.x1;\n    }\n    if (b.y1 < this.y1) {\n      this.y1 = b.y1;\n    }\n    if (b.x2 > this.x2) {\n      this.x2 = b.x2;\n    }\n    if (b.y2 > this.y2) {\n      this.y2 = b.y2;\n    }\n    return this;\n  }\n  /**\n   * 交集\n   * @param b\n   * @returns\n   */\n  intersect(b: IBoundsLike): Bounds {\n    if (b.x1 > this.x1) {\n      this.x1 = b.x1;\n    }\n    if (b.y1 > this.y1) {\n      this.y1 = b.y1;\n    }\n    if (b.x2 < this.x2) {\n      this.x2 = b.x2;\n    }\n    if (b.y2 < this.y2) {\n      this.y2 = b.y2;\n    }\n    return this;\n  }\n  /**\n   * 是否包含b\n   * @param b\n   * @returns\n   */\n  encloses(b: IBoundsLike): boolean {\n    return b && this.x1 <= b.x1 && this.x2 >= b.x2 && this.y1 <= b.y1 && this.y2 >= b.y2;\n  }\n  /**\n   * 是否共边\n   * @param b\n   * @returns\n   */\n  alignsWith(b: IBoundsLike): boolean {\n    return b && (this.x1 === b.x1 || this.x2 === b.x2 || this.y1 === b.y1 || this.y2 === b.y2);\n  }\n  /**\n   * 是否相交\n   * @param b\n   * @returns\n   */\n  intersects(b: IBoundsLike): boolean {\n    return b && !(this.x2 < b.x1 || this.x1 > b.x2 || this.y2 < b.y1 || this.y1 > b.y2);\n  }\n  /**\n   * 是否包含\n   * @param x\n   * @param y\n   * @returns\n   */\n  contains(x: number = 0, y: number = 0): boolean {\n    return !(x < this.x1 || x > this.x2 || y < this.y1 || y > this.y2);\n  }\n  containsPoint(p: IPointLike): boolean {\n    return !(p.x < this.x1 || p.x > this.x2 || p.y < this.y1 || p.y > this.y2);\n  }\n  width(): number {\n    if (this.empty()) {\n      return 0;\n    }\n    return this.x2 - this.x1;\n  }\n  height(): number {\n    if (this.empty()) {\n      return 0;\n    }\n    return this.y2 - this.y1;\n  }\n  scaleX(s: number = 0): Bounds {\n    this.x1 *= s;\n    this.x2 *= s;\n    return this;\n  }\n\n  scaleY(s: number = 0): Bounds {\n    this.y1 *= s;\n    this.y2 *= s;\n    return this;\n  }\n\n  transformWithMatrix(matrix: IMatrix): Bounds {\n    transformBoundsWithMatrix(this, this, matrix);\n    return this;\n  }\n\n  copy(b: IBoundsLike) {\n    this.x1 = b.x1;\n    this.y1 = b.y1;\n    this.x2 = b.x2;\n    this.y2 = b.y2;\n    return this;\n  }\n  private rotatedPoints(angle: number, x: number, y: number): vec8 {\n    const { x1, y1, x2, y2 } = this;\n    const cos = Math.cos(angle);\n    const sin = Math.sin(angle);\n    const cx = x - x * cos + y * sin;\n    const cy = y - x * sin - y * cos;\n\n    return [\n      cos * x1 - sin * y1 + cx,\n      sin * x1 + cos * y1 + cy,\n      cos * x1 - sin * y2 + cx,\n      sin * x1 + cos * y2 + cy,\n      cos * x2 - sin * y1 + cx,\n      sin * x2 + cos * y1 + cy,\n      cos * x2 - sin * y2 + cx,\n      sin * x2 + cos * y2 + cy\n    ];\n  }\n  private scalePoints(sx: number, sy: number, x: number, y: number): vec4 {\n    const { x1, y1, x2, y2 } = this;\n\n    return [sx * x1 + (1 - sx) * x, sy * y1 + (1 - sy) * y, sx * x2 + (1 - sx) * x, sy * y2 + (1 - sy) * y];\n  }\n}\n\nexport class AABBBounds extends Bounds {}\nexport class OBBBounds extends Bounds {\n  angle: number;\n}\n"]}

package/cjs/data-structure/hashTable.d.ts

@@ -0,0 +1,35 @@
+import type { LooseFunction } from '../type';
+export declare class HashValue<T> {
+    index: number;
+    key: string;
+    value: T;
+}
+export declare class HashTable<T> {
+    private items;
+    private itemList;
+    constructor();
+    get type(): string;
+    set(key: string, value: T): HashValue<T>;
+    clear(): void;
+    del(key: string): void;
+    delFrom(index: number): void;
+    resetIndex(): void;
+    has(key: string): boolean;
+    get(key: string): T | null;
+    count(): number;
+    all(): Array<T>;
+    first(): T;
+    last(): T;
+    getByIndex(index: number): T;
+    getKeyByIndex(index: number): string;
+    foreach(callback: (key: string, value: T) => boolean | void): boolean;
+    private foreachHashv;
+    hasValue(value: any): boolean;
+    indexOf(key: any): number;
+    insertAt(index: number, value: T, key: string): void;
+    sort(callback: LooseFunction): HashValue<T>[];
+    toArray(): Array<T>;
+    push(lists: HashTable<any>): void;
+    mapKey(): string[];
+    toImmutableMap(): void;
+}

package/cjs/data-structure/hashTable.js

@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.HashTable = exports.HashValue = void 0;
+
+class HashValue {}
+
+exports.HashValue = HashValue;
+
+class HashTable {
+    constructor() {
+        this.items = {}, this.itemList = [];
+    }
+    get type() {
+        return "xhHashTable";
+    }
+    set(key, value) {
+        const vl = new HashValue;
+        vl.key = key, vl.value = value;
+        let index = this.itemList.length;
+        return this.has(key) && (index = this.items[key].index), vl.index = index, this.itemList[index] = vl, 
+        this.items[key] = vl, vl;
+    }
+    clear() {
+        this.items = {}, this.itemList = [];
+    }
+    del(key) {
+        if (this.has(key)) {
+            const index = this.items[key].index;
+            index > -1 && this.itemList.splice(index, 1), delete this.items[key], this.resetIndex();
+        }
+    }
+    delFrom(index) {
+        for (let i = index + 1; i < this.count(); i++) {
+            const key = this.itemList[i].key;
+            delete this.items[key];
+        }
+        this.itemList.splice(index + 1, this.count() - index), this.resetIndex();
+    }
+    resetIndex() {
+        this.foreachHashv(((k, v) => {
+            const index = this.itemList.indexOf(v);
+            this.items[k].index = index;
+        }));
+    }
+    has(key) {
+        return key in this.items;
+    }
+    get(key) {
+        return this.has(key) ? this.items[key].value : null;
+    }
+    count() {
+        return this.itemList.length;
+    }
+    all() {
+        return this.itemList.map((vl => vl.value));
+    }
+    first() {
+        return this.itemList[0].value;
+    }
+    last() {
+        return this.itemList[this.itemList.length - 1].value;
+    }
+    getByIndex(index) {
+        return this.itemList[index].value;
+    }
+    getKeyByIndex(index) {
+        return this.itemList[index].key;
+    }
+    foreach(callback) {
+        for (const key in this.items) {
+            if (!1 === callback(key, this.items[key].value)) return !1;
+        }
+        return !0;
+    }
+    foreachHashv(callback) {
+        for (const key in this.items) {
+            if (!1 === callback(key, this.items[key])) return !1;
+        }
+        return !0;
+    }
+    hasValue(value) {
+        for (const key in this.items) if (this.items[key].value === value) return !0;
+        return !1;
+    }
+    indexOf(key) {
+        return this.has(key) ? this.items[key].index : -1;
+    }
+    insertAt(index, value, key) {
+        const hashV = new HashValue;
+        hashV.index = index, hashV.key = key, hashV.value = value, this.itemList.splice(index, 0, hashV), 
+        this.items[key] = hashV, this.resetIndex();
+    }
+    sort(callback) {
+        return this.itemList.sort(((a, b) => callback(a.value, b.value)));
+    }
+    toArray() {
+        return this.itemList.slice(0, this.itemList.length).map((vl => vl.value));
+    }
+    push(lists) {
+        lists.foreach(((key, value) => {
+            this.set(key, value);
+        }));
+    }
+    mapKey() {
+        const returnArr = [];
+        for (const key in this.items) returnArr.push(key);
+        return returnArr;
+    }
+    toImmutableMap() {}
+}
+
+exports.HashTable = HashTable;

package/cjs/data-structure/hashTable.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/data-structure/hashTable.ts"],"names":[],"mappings":";;;AAEA,MAAa,SAAS;CAIrB;AAJD,8BAIC;AAGD,MAAa,SAAS;IAGpB;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,IAAI,IAAI;QACN,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,GAAG,CAAC,GAAW,EAAE,KAAQ;QACvB,MAAM,EAAE,GAAG,IAAI,SAAS,EAAK,CAAC;QAC9B,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC;QACb,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC;QACjB,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;SAC/B;QACD,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,GAAG,CAAC,GAAW;QACb,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACpC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;gBACd,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;aAChC;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,EAAE,CAAC;SACnB;IACH,CAAC;IAMD,OAAO,CAAC,KAAa;QACnB,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACjC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACxB;QACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;QACtD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED,UAAU;QACR,IAAI,CAAC,YAAY,CAAC,CAAC,CAAM,EAAE,CAAe,EAAE,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;SAC9B;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,OAAO,EAAE,CAAC,KAAK,CAAC;QAClB,CAAC,CAAC,CAAC;IACL,CAAC;IACD,KAAK;QACH,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAChC,CAAC;IACD,IAAI;QACF,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;IACvD,CAAC;IACD,UAAU,CAAC,KAAa;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,aAAa,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;IAClC,CAAC;IAGD,OAAO,CAAC,QAAmD;QACzD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE;YAC5B,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACO,YAAY,CAAC,QAA8D;QACjF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE;YAC5B,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,QAAQ,CAAC,KAAU;QACjB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE;YAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE;gBACnC,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,GAAQ;QACd,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;SAC9B;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAGD,QAAQ,CAAC,KAAa,EAAE,KAAQ,EAAE,GAAW;QAC3C,MAAM,KAAK,GAAG,IAAI,SAAS,EAAK,CAAC;QAEjC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;QAChB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED,IAAI,CAAC,QAAuB;QAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE;YAC7D,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC3D,OAAO,EAAE,CAAC,KAAK,CAAC;QAClB,CAAC,CAAC,CAAC;IACL,CAAC;IACD,IAAI,CAAC,KAAqB;QACxB,KAAK,CAAC,OAAO,CAAC,CAAC,GAAW,EAAE,KAAQ,EAAE,EAAE;YACtC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;IACD,MAAM;QACJ,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE;YAC5B,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACrB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,cAAc;IAEd,CAAC;CACF;AAtKD,8BAsKC","file":"hashTable.js","sourcesContent":["import type { LooseFunction } from '../type';\n\nexport class HashValue<T> {\n  index: number;\n  key: string;\n  value: T;\n}\n\n// 基于 array 和 object的 HashTable\nexport class HashTable<T> {\n  private items: { [key: string]: HashValue<T> };\n  private itemList: Array<HashValue<T>>;\n  constructor() {\n    this.items = {};\n    this.itemList = [];\n  }\n  get type() {\n    return 'xhHashTable';\n  }\n  set(key: string, value: T): HashValue<T> {\n    const vl = new HashValue<T>();\n    vl.key = key;\n    vl.value = value;\n    let index = this.itemList.length;\n    if (this.has(key)) {\n      index = this.items[key].index;\n    }\n    vl.index = index;\n    this.itemList[index] = vl;\n    this.items[key] = vl;\n    return vl;\n  }\n\n  clear() {\n    this.items = {};\n    this.itemList = [];\n  }\n  del(key: string): void {\n    if (this.has(key)) {\n      const index = this.items[key].index;\n      if (index > -1) {\n        this.itemList.splice(index, 1);\n      }\n      delete this.items[key];\n      this.resetIndex();\n    }\n  }\n\n  /**\n   * 不包含当前index\n   * @param index\n   */\n  delFrom(index: number) {\n    for (let i = index + 1; i < this.count(); i++) {\n      const key = this.itemList[i].key;\n      delete this.items[key];\n    }\n    this.itemList.splice(index + 1, this.count() - index);\n    this.resetIndex();\n  }\n\n  resetIndex(): void {\n    this.foreachHashv((k: any, v: HashValue<T>) => {\n      const index = this.itemList.indexOf(v);\n      this.items[k].index = index;\n    });\n  }\n\n  has(key: string): boolean {\n    return key in this.items;\n  }\n\n  get(key: string): T | null {\n    if (this.has(key)) {\n      return this.items[key].value;\n    }\n    return null;\n  }\n\n  count(): number {\n    return this.itemList.length;\n  }\n\n  all(): Array<T> {\n    return this.itemList.map(vl => {\n      return vl.value;\n    });\n  }\n  first(): T {\n    return this.itemList[0].value;\n  }\n  last(): T {\n    return this.itemList[this.itemList.length - 1].value;\n  }\n  getByIndex(index: number): T {\n    return this.itemList[index].value;\n  }\n\n  getKeyByIndex(index: number): string {\n    return this.itemList[index].key;\n  }\n\n  //遍历 扩展\n  foreach(callback: (key: string, value: T) => boolean | void) {\n    for (const key in this.items) {\n      const returnVal = callback(key, this.items[key].value);\n      if (returnVal === false) {\n        return false;\n      }\n    }\n    return true;\n  }\n  private foreachHashv(callback: (key: string, value: HashValue<T>) => boolean | void) {\n    for (const key in this.items) {\n      const returnVal = callback(key, this.items[key]);\n      if (returnVal === false) {\n        return false;\n      }\n    }\n    return true;\n  }\n  hasValue(value: any): boolean {\n    for (const key in this.items) {\n      if (this.items[key].value === value) {\n        return true;\n      }\n    }\n    return false;\n  }\n  //获取index\n  indexOf(key: any): number {\n    if (this.has(key)) {\n      return this.items[key].index;\n    }\n    return -1;\n  }\n\n  //插入\n  insertAt(index: number, value: T, key: string) {\n    const hashV = new HashValue<T>();\n\n    hashV.index = index;\n    hashV.key = key;\n    hashV.value = value;\n    this.itemList.splice(index, 0, hashV);\n    this.items[key] = hashV;\n    this.resetIndex();\n  }\n\n  sort(callback: LooseFunction) {\n    return this.itemList.sort((a: HashValue<T>, b: HashValue<T>) => {\n      return callback(a.value, b.value);\n    });\n  }\n  toArray(): Array<T> {\n    return this.itemList.slice(0, this.itemList.length).map(vl => {\n      return vl.value;\n    });\n  }\n  push(lists: HashTable<any>) {\n    lists.foreach((key: string, value: T) => {\n      this.set(key, value);\n    });\n  }\n  mapKey(): string[] {\n    const returnArr: string[] = [];\n    for (const key in this.items) {\n      returnArr.push(key);\n    }\n    return returnArr;\n  }\n\n  toImmutableMap() {\n    // do nothing\n  }\n}\n"]}

package/cjs/data-structure/index.d.ts

@@ -0,0 +1,4 @@
+export * from './hashTable';
+export * from './point';
+export * from './bounds';
+export * from './matrix';

package/cjs/data-structure/index.js

@@ -0,0 +1,22 @@
+"use strict";
+
+var __createBinding = this && this.__createBinding || (Object.create ? function(o, m, k, k2) {
+    void 0 === k2 && (k2 = k);
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    desc && !("get" in desc ? !m.__esModule : desc.writable || desc.configurable) || (desc = {
+        enumerable: !0,
+        get: function() {
+            return m[k];
+        }
+    }), Object.defineProperty(o, k2, desc);
+} : function(o, m, k, k2) {
+    void 0 === k2 && (k2 = k), o[k2] = m[k];
+}), __exportStar = this && this.__exportStar || function(m, exports) {
+    for (var p in m) "default" === p || Object.prototype.hasOwnProperty.call(exports, p) || __createBinding(exports, m, p);
+};
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), __exportStar(require("./hashTable"), exports), __exportStar(require("./point"), exports), 
+__exportStar(require("./bounds"), exports), __exportStar(require("./matrix"), exports);
+//# sourceMappingURL=index.js.map

package/cjs/data-structure/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/data-structure/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AACA,8CAA4B;AAE5B,0CAAwB;AACxB,2CAAyB;AACzB,2CAAyB","file":"index.js","sourcesContent":["// 基于 array 和 object 的 HashTable\nexport * from './hashTable';\n// Point\nexport * from './point';\nexport * from './bounds';\nexport * from './matrix';\n"]}