@visactor/vutils 0.9.0-alpha.0

package/es/common/pick.d.ts

@@ -0,0 +1 @@
+export default function pick<T, U extends keyof T>(obj: T, keys: Array<U>): Pick<T, U>;

package/es/common/pick.js

@@ -0,0 +1,12 @@
+import isPlainObject from "./isPlainObject";
+
+const hasOwnProperty = Object.prototype.hasOwnProperty;
+
+export default function pick(obj, keys) {
+    if (!obj || !isPlainObject(obj)) return obj;
+    const result = {};
+    return keys.forEach((k => {
+        hasOwnProperty.call(obj, k) && (result[k] = obj[k]);
+    })), result;
+}
+//# sourceMappingURL=pick.js.map

package/es/common/pick.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/pick.ts"],"names":[],"mappings":"AAAA,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAEvD,MAAM,CAAC,OAAO,UAAU,IAAI,CAAuB,GAAM,EAAE,IAAc;IACvE,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;QAC/B,OAAO,GAAG,CAAC;KACZ;IACD,MAAM,MAAM,GAAG,EAAgB,CAAC;IAChC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACf,IAAI,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE;YAC/B,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC","file":"pick.js","sourcesContent":["import isPlainObject from './isPlainObject';\n\nconst hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport default function pick<T, U extends keyof T>(obj: T, keys: Array<U>): Pick<T, U> {\n  if (!obj || !isPlainObject(obj)) {\n    return obj;\n  }\n  const result = {} as Pick<T, U>;\n  keys.forEach(k => {\n    if (hasOwnProperty.call(obj, k)) {\n      result[k] = obj[k];\n    }\n  });\n  return result;\n}\n"]}

package/es/common/pickWithout.d.ts

@@ -0,0 +1 @@
+export default function pickWithout<T extends Record<string, any>>(obj: T, keys: (string | RegExp)[]): Partial<T>;

package/es/common/pickWithout.js

@@ -0,0 +1,16 @@
+import isPlainObject from "./isPlainObject";
+
+import isString from "./isString";
+
+export default function pickWithout(obj, keys) {
+    if (!obj || !isPlainObject(obj)) return obj;
+    const result = {};
+    return Object.keys(obj).forEach((k => {
+        const v = obj[k];
+        let match = !1;
+        keys.forEach((itKey => {
+            (isString(itKey) && itKey === k || itKey instanceof RegExp && k.match(itKey)) && (match = !0);
+        })), match || (result[k] = v);
+    })), result;
+}
+//# sourceMappingURL=pickWithout.js.map

package/es/common/pickWithout.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/pickWithout.ts"],"names":[],"mappings":"AAAA,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAC5C,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,MAAM,CAAC,OAAO,UAAU,WAAW,CAAgC,GAAM,EAAE,IAAyB;IAClG,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;QAC/B,OAAO,GAAG,CAAC;KACZ;IACD,MAAM,MAAM,GAAG,EAAE,CAAC;IAElB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAEjB,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACnB,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBAClC,KAAK,GAAG,IAAI,CAAC;aACd;iBAAM,IAAI,KAAK,YAAY,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;gBACpD,KAAK,GAAG,IAAI,CAAC;aACd;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,EAAE;YACV,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACf;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAoB,CAAC;AAC9B,CAAC","file":"pickWithout.js","sourcesContent":["import isPlainObject from './isPlainObject';\nimport isString from './isString';\n\nexport default function pickWithout<T extends Record<string, any>>(obj: T, keys: (string | RegExp)[]): Partial<T> {\n  if (!obj || !isPlainObject(obj)) {\n    return obj;\n  }\n  const result = {};\n\n  Object.keys(obj).forEach((k: string) => {\n    const v = obj[k];\n\n    let match = false;\n\n    keys.forEach(itKey => {\n      if (isString(itKey) && itKey === k) {\n        match = true;\n      } else if (itKey instanceof RegExp && k.match(itKey)) {\n        match = true;\n      }\n    });\n\n    if (!match) {\n      result[k] = v;\n    }\n  });\n\n  return result as Partial<T>;\n}\n"]}

package/es/common/quantileSorted.d.ts

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

package/es/common/quantileSorted.js

@@ -0,0 +1,11 @@
+import { toNumber } from "./toNumber";
+
+export function quantileSorted(values, percent, valueof = toNumber) {
+    const n = values.length;
+    if (!n) return;
+    if (percent <= 0 || n < 2) return valueof(values[0], 0, values);
+    if (percent >= 1) return valueof(values[n - 1], n - 1, values);
+    const i = (n - 1) * percent, i0 = Math.floor(i), value0 = valueof(values[i0], i0, values);
+    return value0 + (valueof(values[i0 + 1], i0 + 1, values) - value0) * (i - i0);
+}
+//# sourceMappingURL=quantileSorted.js.map

package/es/common/quantileSorted.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/quantileSorted.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,MAAM,UAAU,cAAc,CAC5B,MAAa,EACb,OAAe,EACf,UAA6D,QAAQ;IAErE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,CAAC,EAAE;QACN,OAAO;KACR;IACD,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACzB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;KACtC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE;QAChB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;KAC9C;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACvD,OAAO,MAAM,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC/C,CAAC","file":"quantileSorted.js","sourcesContent":["import { toNumber } from './toNumber';\n\nexport function quantileSorted(\n  values: any[],\n  percent: number,\n  valueof: (entry: any, index: number, arr: any[]) => number = toNumber\n) {\n  const n = values.length;\n  if (!n) {\n    return;\n  }\n  if (percent <= 0 || n < 2) {\n    return valueof(values[0], 0, values);\n  }\n  if (percent >= 1) {\n    return valueof(values[n - 1], n - 1, values);\n  }\n  const i = (n - 1) * percent;\n  const i0 = Math.floor(i);\n  const value0 = valueof(values[i0], i0, values);\n  const value1 = valueof(values[i0 + 1], i0 + 1, values);\n  return value0 + (value1 - value0) * (i - i0);\n}\n"]}

package/es/common/range.d.ts

@@ -0,0 +1 @@
+export declare function range(start: number, stop?: number, step?: number): number[];

package/es/common/range.js

@@ -0,0 +1,10 @@
+import isValid from "./isValid";
+
+export function range(start, stop, step) {
+    isValid(stop) || (stop = start, start = 0), isValid(step) || (step = 1);
+    let i = -1;
+    const n = 0 | Math.max(0, Math.ceil((stop - start) / step)), range = new Array(n);
+    for (;++i < n; ) range[i] = start + i * step;
+    return range;
+}
+//# sourceMappingURL=range.js.map

package/es/common/range.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/range.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,IAAa,EAAE,IAAa;IAC/D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAClB,IAAI,GAAG,KAAK,CAAC;QACb,KAAK,GAAG,CAAC,CAAC;KACX;IACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAClB,IAAI,GAAG,CAAC,CAAC;KACV;IAED,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACX,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IAE3B,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE;QACd,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;KAC7B;IAED,OAAO,KAAK,CAAC;AACf,CAAC","file":"range.js","sourcesContent":["import isValid from './isValid';\n\nexport function range(start: number, stop?: number, step?: number): number[] {\n  if (!isValid(stop)) {\n    stop = start;\n    start = 0;\n  }\n  if (!isValid(step)) {\n    step = 1;\n  }\n\n  let i = -1;\n  const n = Math.max(0, Math.ceil((stop - start) / step)) | 0;\n  const range = new Array(n);\n\n  while (++i < n) {\n    range[i] = start + i * step;\n  }\n\n  return range;\n}\n"]}

package/es/common/throttle.d.ts

@@ -0,0 +1,5 @@
+declare function throttle<T, S>(func: (...args: T[]) => S, wait: number, options?: {
+    leading?: boolean;
+    trailing?: boolean;
+}): (...args: T[]) => S;
+export default throttle;

package/es/common/throttle.js

@@ -0,0 +1,17 @@
+import debounce from "./debounce";
+
+import isObject from "./isObject";
+
+function throttle(func, wait, options) {
+    let leading = !0, trailing = !0;
+    if ("function" != typeof func) throw new TypeError("Expected a function");
+    return isObject(options) && (leading = "leading" in options ? !!options.leading : leading, 
+    trailing = "trailing" in options ? !!options.trailing : trailing), debounce(func, wait, {
+        leading: leading,
+        trailing: trailing,
+        maxWait: wait
+    });
+}
+
+export default throttle;
+//# sourceMappingURL=throttle.js.map

package/es/common/throttle.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/throttle.ts"],"names":[],"mappings":"AAGA,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,SAAS,QAAQ,CACf,IAAyB,EACzB,IAAY,EACZ,OAAmD;IAEnD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;QAC9B,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;KAC5C;IACD,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACrB,OAAO,GAAG,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAC7D,QAAQ,GAAG,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;KAClE;IACD,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE;QAC1B,OAAO;QACP,QAAQ;QACR,OAAO,EAAE,IAAI;KACd,CAAC,CAAC;AACL,CAAC;AAED,eAAe,QAAQ,CAAC","file":"throttle.js","sourcesContent":["/**\n * @see https://github.com/lodash/lodash/blob/master/throttle.js\n */\nimport debounce from './debounce';\nimport isObject from './isObject';\n\nfunction throttle<T, S>(\n  func: (...args: T[]) => S,\n  wait: number,\n  options?: { leading?: boolean; trailing?: boolean }\n): (...args: T[]) => S {\n  let leading = true;\n  let trailing = true;\n\n  if (typeof func !== 'function') {\n    throw new TypeError('Expected a function');\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    leading,\n    trailing,\n    maxWait: wait\n  });\n}\n\nexport default throttle;\n"]}

package/es/common/tickStep.d.ts

@@ -0,0 +1 @@
+export declare function tickStep(start: number, stop: number, count: number): number;

package/es/common/tickStep.js

@@ -0,0 +1,10 @@
+const e10 = Math.sqrt(50), e5 = Math.sqrt(10), e2 = Math.sqrt(2);
+
+export function tickStep(start, stop, count) {
+    const step0 = Math.abs(stop - start) / Math.max(0, count);
+    let step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10));
+    const error = step0 / step1;
+    return error >= e10 ? step1 *= 10 : error >= e5 ? step1 *= 5 : error >= e2 && (step1 *= 2), 
+    stop < start ? -step1 : step1;
+}
+//# sourceMappingURL=tickStep.js.map

package/es/common/tickStep.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/tickStep.ts"],"names":[],"mappings":"AAAA,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACzB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAExB,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,IAAY,EAAE,KAAa;IACjE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1D,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;IAE5B,IAAI,KAAK,IAAI,GAAG,EAAE;QAChB,KAAK,IAAI,EAAE,CAAC;KACb;SAAM,IAAI,KAAK,IAAI,EAAE,EAAE;QACtB,KAAK,IAAI,CAAC,CAAC;KACZ;SAAM,IAAI,KAAK,IAAI,EAAE,EAAE;QACtB,KAAK,IAAI,CAAC,CAAC;KACZ;IACD,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AACvC,CAAC","file":"tickStep.js","sourcesContent":["const e10 = Math.sqrt(50);\nconst e5 = Math.sqrt(10);\nconst e2 = Math.sqrt(2);\n\nexport function tickStep(start: number, stop: number, count: number) {\n  const step0 = Math.abs(stop - start) / Math.max(0, count);\n  let step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10));\n  const error = step0 / step1;\n\n  if (error >= e10) {\n    step1 *= 10;\n  } else if (error >= e5) {\n    step1 *= 5;\n  } else if (error >= e2) {\n    step1 *= 2;\n  }\n  return stop < start ? -step1 : step1;\n}\n"]}

package/es/common/toDate.d.ts

@@ -0,0 +1,2 @@
+export type DateLikeType = number | string | Date;
+export declare function toDate(val: DateLikeType): Date;

package/es/common/toDate.js

@@ -0,0 +1,18 @@
+import isNil from "./isNil";
+
+import isString from "./isString";
+
+const TIME_REG = /^(?:(\d{4})(?:[-\/](\d{1,2})(?:[-\/](\d{1,2})(?:[T ](\d{1,2})(?::(\d{1,2})(?::(\d{1,2})(?:[.,](\d+))?)?)?(Z|[\+\-]\d\d:?\d\d)?)?)?)?)?$/;
+
+export function toDate(val) {
+    if (val instanceof Date) return val;
+    if (isString(val)) {
+        const match = TIME_REG.exec(val);
+        if (!match) return new Date(NaN);
+        if (!match[8]) return new Date(+match[1], +(match[2] || 1) - 1, +match[3] || 1, +match[4] || 0, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0);
+        let hour = +match[4] || 0;
+        return "Z" !== match[8].toUpperCase() && (hour -= +match[8].slice(0, 3)), new Date(Date.UTC(+match[1], +(match[2] || 1) - 1, +match[3] || 1, hour, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0));
+    }
+    return isNil(val) ? new Date(NaN) : new Date(Math.round(val));
+}
+//# sourceMappingURL=toDate.js.map

package/es/common/toDate.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/toDate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAKlC,MAAM,QAAQ,GACZ,yIAAyI,CAAC;AAE5I,MAAM,UAAU,MAAM,CAAC,GAAiB;IACtC,IAAI,GAAG,YAAY,IAAI,EAAE;QACvB,OAAO,GAAG,CAAC;KACZ;SAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE;QAMxB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,KAAK,EAAE;YAEV,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;SACtB;QAGD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAGb,OAAO,IAAI,IAAI,CACb,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CAAC;SACH;QASD,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,GAAG,EAAE;YAClC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC/B;QACD,OAAO,IAAI,IAAI,CACb,IAAI,CAAC,GAAG,CACN,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,IAAI,EACJ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CACF,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;QACrB,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;KACtB;IAED,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAa,CAAC,CAAC,CAAC;AAC7C,CAAC","file":"toDate.js","sourcesContent":["import isNil from './isNil';\nimport isString from './isString';\n\nexport type DateLikeType = number | string | Date;\n\n// eslint-disable-next-line no-useless-escape\nconst TIME_REG =\n  /^(?:(\\d{4})(?:[-\\/](\\d{1,2})(?:[-\\/](\\d{1,2})(?:[T ](\\d{1,2})(?::(\\d{1,2})(?::(\\d{1,2})(?:[.,](\\d+))?)?)?(Z|[\\+\\-]\\d\\d:?\\d\\d)?)?)?)?)?$/; // eslint-disable-line\n\nexport function toDate(val: DateLikeType): Date {\n  if (val instanceof Date) {\n    return val;\n  } else if (isString(val)) {\n    // Different browsers parse date in different way, so we parse it manually.\n    // Some other issues:\n    // new Date('1970-01-01') is UTC,\n    // new Date('1970/01/01') and new Date('1970-1-01') is local.\n    // See issue #3623\n    const match = TIME_REG.exec(val);\n\n    if (!match) {\n      // return Invalid Date.\n      return new Date(NaN);\n    }\n\n    // Use local time when no timezone offset specifed.\n    if (!match[8]) {\n      // match[n] can only be string or undefined.\n      // But take care of '12' + 1 => '121'.\n      return new Date(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        +match[4] || 0,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      );\n    }\n    // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,\n    // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).\n    // For example, system timezone is set as \"Time Zone: America/Toronto\",\n    // then these code will get different result:\n    // `new Date(1478411999999).getTimezoneOffset();  // get 240`\n    // `new Date(1478412000000).getTimezoneOffset();  // get 300`\n    // So we should not use `new Date`, but use `Date.UTC`.\n\n    let hour = +match[4] || 0;\n    if (match[8].toUpperCase() !== 'Z') {\n      hour -= +match[8].slice(0, 3);\n    }\n    return new Date(\n      Date.UTC(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        hour,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      )\n    );\n  } else if (isNil(val)) {\n    return new Date(NaN);\n  }\n\n  return new Date(Math.round(val as number));\n}\n"]}

package/es/common/toNumber.d.ts

@@ -0,0 +1 @@
+export declare function toNumber(a: any): number;

package/es/common/toNumber.js

@@ -0,0 +1,4 @@
+export function toNumber(a) {
+    return Number(a);
+}
+//# sourceMappingURL=toNumber.js.map

package/es/common/toNumber.js.map

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

package/es/common/toValidNumber.d.ts

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

package/es/common/toValidNumber.js

@@ -0,0 +1,8 @@
+import isValidNumber from "./isValidNumber";
+
+export function toValidNumber(v) {
+    if (isValidNumber(v)) return v;
+    const value = +v;
+    return isValidNumber(value) ? value : 0;
+}
+//# sourceMappingURL=toValidNumber.js.map

package/es/common/toValidNumber.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/toValidNumber.ts"],"names":[],"mappings":"AAAA,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,MAAM,UAAU,aAAa,CAAC,CAAM;IAClC,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE;QACpB,OAAO,CAAC,CAAC;KACV;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC","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/es/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/es/common/truncate.js

@@ -0,0 +1,9 @@
+import isNil from "./isNil";
+
+const truncate = (str, length, align = "right", ellipsis) => {
+    const e = isNil(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;
+};
+
+export default truncate;
+//# sourceMappingURL=truncate.js.map

package/es/common/truncate.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/truncate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAE5B,MAAM,QAAQ,GAAG,CACf,GAAoB,EACpB,MAAc,EACd,QAA+C,OAAO,EACtD,QAAiB,EACjB,EAAE;IACF,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,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,eAAe,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/es/common/upperFirst.d.ts

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

package/es/common/upperFirst.js

@@ -0,0 +1,6 @@
+const upperFirst = function(str) {
+    return str.charAt(0).toUpperCase() + str.substring(1);
+};
+
+export default upperFirst;
+//# sourceMappingURL=upperFirst.js.map

package/es/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,eAAe,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/es/common/uuid.d.ts

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

package/es/common/uuid.js

@@ -0,0 +1,13 @@
+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("");
+};
+
+export default uuid;
+//# sourceMappingURL=uuid.js.map

package/es/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,eAAe,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/es/common/variance.d.ts

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

package/es/common/variance.js

@@ -0,0 +1,11 @@
+export 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;
+}
+//# sourceMappingURL=variance.js.map

package/es/common/variance.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/variance.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,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","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/es/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/es/data-structure/bounds.js

@@ -0,0 +1,127 @@
+import { isArray } from "../common";
+
+import { abs, epsilon } from "../math";
+
+export 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);
+}
+
+export function transformBounds(bounds, x, y, scaleX, scaleY, angle, rotateCenter) {
+    if (!(abs(scaleX) <= epsilon || abs(scaleY) <= epsilon)) {
+        if (1 !== scaleX && bounds.scaleX(scaleX), 1 !== scaleY && bounds.scaleY(scaleY), 
+        isFinite(angle) && Math.abs(angle) > epsilon) {
+            let rx = 0, ry = 0;
+            void 0 !== rotateCenter && (rx = rotateCenter[0], ry = rotateCenter[1]), bounds.rotate(angle, rx, ry);
+        }
+        bounds.translate(x, y);
+    }
+}
+
+export 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 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 ];
+    }
+}
+
+export class AABBBounds extends Bounds {}
+
+export class OBBBounds extends Bounds {}
+//# sourceMappingURL=bounds.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/data-structure/bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AA+EvC,MAAM,UAAU,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;AAYD,MAAM,UAAU,eAAe,CAC7B,MAAe,EACf,CAAS,EACT,CAAS,EACT,MAAc,EACd,MAAc,EACd,KAAa,EACb,YAA+B;IAE/B,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,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,OAAO,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;AAiCD,MAAM,OAAO,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,OAAO,CAAC,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;AAED,MAAM,OAAO,UAAW,SAAQ,MAAM;CAAG;AACzC,MAAM,OAAO,SAAU,SAAQ,MAAM;CAEpC","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/es/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;
+}