@nokecy/designer-shared 0.0.0-stage → 2.0.0-beta.6

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Alibaba
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/LICENSE.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Alibaba
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/PROVENANCE.json

@@ -0,0 +1,35 @@
+{
+  "ownedName": "@nokecy/designer-shared",
+  "ownedPath": "packages/designer/shared",
+  "version": "2.0.0-beta.6",
+  "previousPath": "vendor/nokecy-designable/packages/shared",
+  "upstream": {
+    "repository": "https://github.com/pindjs/designable.git",
+    "commit": "5edb2236bdfd8309da7677414180923966246d85",
+    "package": "@nokecy/designable-shared",
+    "path": "packages/shared",
+    "record": "docs/maintenance/origins/designable-fork-import.json",
+    "sourceChecksumField": "packages[name=@nokecy/designable-shared].sourceSha256"
+  },
+  "license": "MIT",
+  "licenseFile": "LICENSE",
+  "migrationDate": "2026-10-17",
+  "moduleRenameSourceFiles": [],
+  "changes": [
+    "Moved preserved package source, tests and documentation into the maintained packages tree.",
+    "Renamed internal imports, exports, require paths and declarations to owned workspace package names.",
+    "Pinned dependencies on other owned workspaces to their exact unchanged local versions.",
+    "Preserved previous Ant Design 6 adaptations and historical upstream provenance.",
+    "React and ReactDOM peer ranges target major 19; React runtime compatibility is tracked separately from the namespace/layout migration.",
+    "Removed obsolete standalone Rollup/Dumi/npmignore configuration; historical bytes and exclusion reasons are recorded in source-closure.json. Root scripts are the only supported build contract."
+  ],
+  "previousBuildScripts": {},
+  "react19AdaptedSourceFiles": [
+    "clone.ts",
+    "event.ts"
+  ],
+  "sourceClosure": "docs/maintenance/source-closure.json",
+  "upgradeGuide": "docs/maintenance/upstream-upgrades.md",
+  "patchCategories": "docs/maintenance/patch-classification.json",
+  "maintenancePolicy": "Source may evolve with tests and an adaptation entry; baseline hashes are provenance evidence, not equality assertions on maintained implementations."
+}

package/README.md

@@ -1,3 +1,10 @@
-# Temporary Holding Version
+# @nokecy/designer-shared
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+## QC_UI owned workspace
+
+- Active package: `@nokecy/designer-shared@2.0.0-beta.6` at `packages/designer/shared`.
+- Historical package: `@nokecy/designable-shared`. The original repository, commit, license and source-checksum references are recorded in [PROVENANCE.json](./PROVENANCE.json).
+- Use the QC_UI root workspace installation and build. `npm run build --workspace @nokecy/designer-shared` delegates to the root builder; `npm run typecheck --workspace @nokecy/designer-shared` checks this package and its local dependency closure.
+- All source, tests and package documentation were retained. Generated `esm/`, `lib/`, `dist/` and `node_modules/` content is not maintained source.
+- React-facing workspaces target React 19. Runtime dependencies on the owned Formily/designer family use exact local versions.
+- Any retained upstream documentation-site or Rollup configuration is historical context and is not part of the root workspace build. Documentation examples for non-active Vue/Next adapters describe upstream packages, not QC_UI workspaces.

package/esm/animation.d.ts

@@ -0,0 +1,2 @@
+export declare const createUniformSpeedAnimation: (speed: number, callback: (delta: number) => void) => () => void;
+export declare const calcSpeedFactor: (delta?: number, threshold?: number) => number;

package/esm/animation.js

@@ -0,0 +1,34 @@
+export const createUniformSpeedAnimation = (speed = 10, callback) => {
+    let request = null;
+    let startTime = null;
+    const start = () => {
+        if (request)
+            return;
+        request = requestAnimationFrame((timestamp) => {
+            if (startTime === null) {
+                startTime = timestamp;
+            }
+            const deltaTime = timestamp - startTime;
+            const delta = (deltaTime / 1000) * speed;
+            callback(delta);
+            request = null;
+            start();
+        });
+    };
+    start();
+    return () => {
+        if (request) {
+            cancelAnimationFrame(request);
+            request = null;
+        }
+        startTime = null;
+    };
+};
+//越接近阈值，速度越小，越远离阈值，速度越大
+export const calcSpeedFactor = (delta = 0, threshold = Infinity) => {
+    if (threshold >= delta) {
+        return (threshold - delta) / threshold;
+    }
+    return 0;
+};
+//# sourceMappingURL=animation.js.map

package/esm/animation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"animation.js","sourceRoot":"","sources":["../src/animation.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,2BAA2B,GAAG,CACzC,KAAK,GAAG,EAAE,EACV,QAAiC,EACjC,EAAE;IACF,IAAI,OAAO,GAAkB,IAAI,CAAA;IACjC,IAAI,SAAS,GAAkB,IAAI,CAAA;IACnC,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,IAAI,OAAO;YAAE,OAAM;QACnB,OAAO,GAAG,qBAAqB,CAAC,CAAC,SAAS,EAAE,EAAE;YAC5C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,SAAS,GAAG,SAAS,CAAA;YACvB,CAAC;YACD,MAAM,SAAS,GAAG,SAAS,GAAG,SAAS,CAAA;YACvC,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;YACxC,QAAQ,CAAC,KAAK,CAAC,CAAA;YACf,OAAO,GAAG,IAAI,CAAA;YACd,KAAK,EAAE,CAAA;QACT,CAAC,CAAC,CAAA;IACJ,CAAC,CAAA;IAED,KAAK,EAAE,CAAA;IAEP,OAAO,GAAG,EAAE;QACV,IAAI,OAAO,EAAE,CAAC;YACZ,oBAAoB,CAAC,OAAO,CAAC,CAAA;YAC7B,OAAO,GAAG,IAAI,CAAA;QAChB,CAAC;QACD,SAAS,GAAG,IAAI,CAAA;IAClB,CAAC,CAAA;AACH,CAAC,CAAA;AAED,uBAAuB;AACvB,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,GAAG,QAAQ,EAAE,EAAE;IACjE,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;QACvB,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,SAAS,CAAA;IACxC,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC,CAAA","sourcesContent":["export const createUniformSpeedAnimation = (\n  speed = 10,\n  callback: (delta: number) => void\n) => {\n  let request: number | null = null\n  let startTime: number | null = null\n  const start = () => {\n    if (request) return\n    request = requestAnimationFrame((timestamp) => {\n      if (startTime === null) {\n        startTime = timestamp\n      }\n      const deltaTime = timestamp - startTime\n      const delta = (deltaTime / 1000) * speed\n      callback(delta)\n      request = null\n      start()\n    })\n  }\n\n  start()\n\n  return () => {\n    if (request) {\n      cancelAnimationFrame(request)\n      request = null\n    }\n    startTime = null\n  }\n}\n\n//越接近阈值，速度越小，越远离阈值，速度越大\nexport const calcSpeedFactor = (delta = 0, threshold = Infinity) => {\n  if (threshold >= delta) {\n    return (threshold - delta) / threshold\n  }\n  return 0\n}\n"]}

package/esm/array.d.ts

@@ -0,0 +1,37 @@
+type EachArrayIterator<T> = (currentValue: T, key: number) => void | boolean;
+type EachStringIterator = (currentValue: string, key: number) => void | boolean;
+type EachObjectIterator<T = any> = (currentValue: T, key: string) => void | boolean;
+type MapArrayIterator<TItem, TResult> = (currentValue: TItem, key: number) => TResult;
+type MapStringIterator<TResult> = (currentValue: string, key: number) => TResult;
+type MapObjectIterator<TItem, TResult> = (currentValue: TItem, key: string) => TResult;
+type MemoArrayIterator<T, U> = (previousValue: U, currentValue: T, key: number) => U;
+type MemoStringIterator<T> = (previousValue: T, currentValue: string, key: number) => T;
+type MemoObjectIterator<TValue, TResult> = (previousValue: TResult, currentValue: TValue, key: string) => TResult;
+export declare const toArr: (val: any) => any[];
+export declare function each(val: string, iterator: EachStringIterator, revert?: boolean): void;
+export declare function each<T>(val: T[], iterator: EachArrayIterator<T>, revert?: boolean): void;
+export declare function each<T extends {}, TValue = T[keyof T]>(val: T, iterator: EachObjectIterator<TValue>, revert?: boolean): void;
+export declare function map<T>(val: string, iterator: MapStringIterator<T>, revert?: boolean): any;
+export declare function map<TItem, TResult>(val: TItem[], iterator: MapArrayIterator<TItem, TResult>, revert?: boolean): any;
+export declare function map<T extends {}, TResult>(val: T, iterator: MapObjectIterator<T[keyof T], TResult>, revert?: boolean): any;
+export declare function reduce<T, U>(val: T[], iterator: MemoArrayIterator<T, U>, accumulator?: U, revert?: boolean): U;
+export declare function reduce<T>(val: string, iterator: MemoStringIterator<T>, accumulator?: T, revert?: boolean): T;
+export declare function reduce<T extends {}, TValue = T[keyof T], TResult = any>(val: T, iterator: MemoObjectIterator<TValue, TResult>, accumulator?: TResult, revert?: boolean): TResult;
+export declare function every<T extends string>(val: T, iterator: EachStringIterator, revert?: boolean): boolean;
+export declare function every<T>(val: T[], iterator: EachArrayIterator<T>, revert?: boolean): boolean;
+export declare function every<T extends {}, TValue = T[keyof T]>(val: T, iterator: EachObjectIterator, revert?: boolean): boolean;
+export declare function some<T extends string>(val: T, iterator: EachStringIterator, revert?: boolean): boolean;
+export declare function some<T>(val: T[], iterator: EachArrayIterator<T>, revert?: boolean): boolean;
+export declare function some<T extends {}, TValue = T[keyof T]>(val: T, iterator: EachObjectIterator, revert?: boolean): boolean;
+export declare function findIndex<T extends string>(val: T, iterator: EachStringIterator, revert?: boolean): number;
+export declare function findIndex<T>(val: T[], iterator: EachArrayIterator<T>, revert?: boolean): number;
+export declare function findIndex<T extends {}, TValue = T[keyof T]>(val: T, iterator: EachObjectIterator, revert?: boolean): keyof T;
+export declare function find<T extends string>(val: T, iterator: EachStringIterator, revert?: boolean): any;
+export declare function find<T>(val: T[], iterator: EachArrayIterator<T>, revert?: boolean): T;
+export declare function find<T extends {}, TValue = T[keyof T]>(val: T, iterator: EachObjectIterator, revert?: boolean): T[keyof T];
+export declare function includes<T extends string>(val: T, searchElement: string, revert?: boolean): boolean;
+export declare function includes<T>(val: T[], searchElement: T, revert?: boolean): boolean;
+export declare function includesWith<T extends string>(val: T, search: (item: string) => boolean): boolean;
+export declare function includesWith<T>(val: T[], search: (item: T) => boolean): boolean;
+export declare const flat: <T>(array: Array<T | T[]>) => T[];
+export {};

package/esm/array.js

@@ -0,0 +1,112 @@
+import { isArr, isObj, isStr } from './types';
+export const toArr = (val) => (isArr(val) ? val : val ? [val] : []);
+export function each(val, iterator, revert) {
+    if (isArr(val) || isStr(val)) {
+        if (revert) {
+            for (let i = val.length - 1; i >= 0; i--) {
+                if (iterator(val[i], i) === false) {
+                    return;
+                }
+            }
+        }
+        else {
+            for (let i = 0; i < val.length; i++) {
+                if (iterator(val[i], i) === false) {
+                    return;
+                }
+            }
+        }
+    }
+    else if (isObj(val)) {
+        let key;
+        for (key in val) {
+            if (Object.hasOwnProperty.call(val, key)) {
+                if (iterator(val[key], key) === false) {
+                    return;
+                }
+            }
+        }
+    }
+}
+export function map(val, iterator, revert) {
+    const res = isArr(val) || isStr(val) ? [] : {};
+    each(val, (item, key) => {
+        const value = iterator(item, key);
+        if (isArr(res)) {
+            ;
+            res.push(value);
+        }
+        else {
+            res[key] = value;
+        }
+    }, revert);
+    return res;
+}
+export function reduce(val, iterator, accumulator, revert) {
+    let result = accumulator;
+    each(val, (item, key) => {
+        result = iterator(result, item, key);
+    }, revert);
+    return result;
+}
+export function every(val, iterator, revert) {
+    let res = true;
+    each(val, (item, key) => {
+        if (!iterator(item, key)) {
+            res = false;
+            return false;
+        }
+    }, revert);
+    return res;
+}
+export function some(val, iterator, revert) {
+    let res = false;
+    each(val, (item, key) => {
+        if (iterator(item, key)) {
+            res = true;
+            return false;
+        }
+    }, revert);
+    return res;
+}
+export function findIndex(val, iterator, revert) {
+    let res = -1;
+    each(val, (item, key) => {
+        if (iterator(item, key)) {
+            res = key;
+            return false;
+        }
+    }, revert);
+    return res;
+}
+export function find(val, iterator, revert) {
+    let res;
+    each(val, (item, key) => {
+        if (iterator(item, key)) {
+            res = item;
+            return false;
+        }
+    }, revert);
+    return res;
+}
+export function includes(val, searchElement, revert) {
+    if (isStr(val))
+        return val.includes(searchElement);
+    return some(val, (item) => item === searchElement, revert);
+}
+export function includesWith(val, search) {
+    if (isArr(val)) {
+        return val.some((item) => search(item));
+    }
+    else {
+        return false;
+    }
+}
+export const flat = (array) => {
+    return toArr(array).reduce((buf, item) => {
+        if (isArr(item))
+            return buf.concat(flat(item));
+        return buf.concat(item);
+    }, []);
+};
+//# sourceMappingURL=array.js.map

package/esm/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../src/array.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAiC7C,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,GAAQ,EAAS,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAgB/E,MAAM,UAAU,IAAI,CAAC,GAAQ,EAAE,QAAa,EAAE,MAAgB;IAC5D,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,IAAI,CAAC,GAAW,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;oBAClC,OAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;oBAClC,OAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,GAAW,CAAA;QACf,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;YAChB,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACzC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;oBACtC,OAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAiBD,MAAM,UAAU,GAAG,CAAC,GAAQ,EAAE,QAAa,EAAE,MAAgB;IAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;IAC9C,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACjC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACf,CAAC;YAAC,GAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC3B,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;QAClB,CAAC;IACH,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAoBD,MAAM,UAAU,MAAM,CACpB,GAAQ,EACR,QAAa,EACb,WAAiB,EACjB,MAAgB;IAEhB,IAAI,MAAM,GAAG,WAAW,CAAA;IACxB,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IACtC,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAiBD,MAAM,UAAU,KAAK,CAAC,GAAQ,EAAE,QAAa,EAAE,MAAgB;IAC7D,IAAI,GAAG,GAAG,IAAI,CAAA;IACd,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACzB,GAAG,GAAG,KAAK,CAAA;YACX,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAiBD,MAAM,UAAU,IAAI,CAAC,GAAQ,EAAE,QAAa,EAAE,MAAgB;IAC5D,IAAI,GAAG,GAAG,KAAK,CAAA;IACf,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,IAAI,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACxB,GAAG,GAAG,IAAI,CAAA;YACV,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAiBD,MAAM,UAAU,SAAS,CACvB,GAAQ,EACR,QAAa,EACb,MAAgB;IAEhB,IAAI,GAAG,GAAoB,CAAC,CAAC,CAAA;IAC7B,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,IAAI,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACxB,GAAG,GAAG,GAAG,CAAA;YACT,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAiBD,MAAM,UAAU,IAAI,CAAC,GAAQ,EAAE,QAAa,EAAE,MAAgB;IAC5D,IAAI,GAAQ,CAAA;IACZ,IAAI,CACF,GAAG,EACH,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,IAAI,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACxB,GAAG,GAAG,IAAI,CAAA;YACV,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC,EACD,MAAM,CACP,CAAA;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAYD,MAAM,UAAU,QAAQ,CAAC,GAAQ,EAAE,aAAkB,EAAE,MAAgB;IACrE,IAAI,KAAK,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAA;IAClD,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,aAAa,EAAE,MAAM,CAAC,CAAA;AAC5D,CAAC;AAOD,MAAM,UAAU,YAAY,CAAC,GAAQ,EAAE,MAAW;IAChD,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACf,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;IACzC,CAAC;SAAM,CAAC;QACN,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,CAAI,KAAqB,EAAO,EAAE;IACpD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACvC,IAAI,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QAC9C,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACzB,CAAC,EAAE,EAAE,CAAC,CAAA;AACR,CAAC,CAAA","sourcesContent":["import { isArr, isObj, isStr } from './types'\n\ntype EachArrayIterator<T> = (currentValue: T, key: number) => void | boolean\ntype EachStringIterator = (currentValue: string, key: number) => void | boolean\ntype EachObjectIterator<T = any> = (\n  currentValue: T,\n  key: string\n) => void | boolean\ntype MapArrayIterator<TItem, TResult> = (\n  currentValue: TItem,\n  key: number\n) => TResult\ntype MapStringIterator<TResult> = (currentValue: string, key: number) => TResult\ntype MapObjectIterator<TItem, TResult> = (\n  currentValue: TItem,\n  key: string\n) => TResult\ntype MemoArrayIterator<T, U> = (\n  previousValue: U,\n  currentValue: T,\n  key: number\n) => U\ntype MemoStringIterator<T> = (\n  previousValue: T,\n  currentValue: string,\n  key: number\n) => T\ntype MemoObjectIterator<TValue, TResult> = (\n  previousValue: TResult,\n  currentValue: TValue,\n  key: string\n) => TResult\n\nexport const toArr = (val: any): any[] => (isArr(val) ? val : val ? [val] : [])\nexport function each(\n  val: string,\n  iterator: EachStringIterator,\n  revert?: boolean\n): void\nexport function each<T>(\n  val: T[],\n  iterator: EachArrayIterator<T>,\n  revert?: boolean\n): void\nexport function each<T extends {}, TValue = T[keyof T]>(\n  val: T,\n  iterator: EachObjectIterator<TValue>,\n  revert?: boolean\n): void\nexport function each(val: any, iterator: any, revert?: boolean): void {\n  if (isArr(val) || isStr(val)) {\n    if (revert) {\n      for (let i: number = val.length - 1; i >= 0; i--) {\n        if (iterator(val[i], i) === false) {\n          return\n        }\n      }\n    } else {\n      for (let i = 0; i < val.length; i++) {\n        if (iterator(val[i], i) === false) {\n          return\n        }\n      }\n    }\n  } else if (isObj(val)) {\n    let key: string\n    for (key in val) {\n      if (Object.hasOwnProperty.call(val, key)) {\n        if (iterator(val[key], key) === false) {\n          return\n        }\n      }\n    }\n  }\n}\n\nexport function map<T>(\n  val: string,\n  iterator: MapStringIterator<T>,\n  revert?: boolean\n): any\nexport function map<TItem, TResult>(\n  val: TItem[],\n  iterator: MapArrayIterator<TItem, TResult>,\n  revert?: boolean\n): any\nexport function map<T extends {}, TResult>(\n  val: T,\n  iterator: MapObjectIterator<T[keyof T], TResult>,\n  revert?: boolean\n): any\nexport function map(val: any, iterator: any, revert?: boolean): any {\n  const res = isArr(val) || isStr(val) ? [] : {}\n  each(\n    val,\n    (item, key) => {\n      const value = iterator(item, key)\n      if (isArr(res)) {\n        ;(res as any).push(value)\n      } else {\n        res[key] = value\n      }\n    },\n    revert\n  )\n  return res\n}\n\nexport function reduce<T, U>(\n  val: T[],\n  iterator: MemoArrayIterator<T, U>,\n  accumulator?: U,\n  revert?: boolean\n): U\nexport function reduce<T>(\n  val: string,\n  iterator: MemoStringIterator<T>,\n  accumulator?: T,\n  revert?: boolean\n): T\nexport function reduce<T extends {}, TValue = T[keyof T], TResult = any>(\n  val: T,\n  iterator: MemoObjectIterator<TValue, TResult>,\n  accumulator?: TResult,\n  revert?: boolean\n): TResult\nexport function reduce(\n  val: any,\n  iterator: any,\n  accumulator?: any,\n  revert?: boolean\n): any {\n  let result = accumulator\n  each(\n    val,\n    (item, key) => {\n      result = iterator(result, item, key)\n    },\n    revert\n  )\n  return result\n}\n\nexport function every<T extends string>(\n  val: T,\n  iterator: EachStringIterator,\n  revert?: boolean\n): boolean\nexport function every<T>(\n  val: T[],\n  iterator: EachArrayIterator<T>,\n  revert?: boolean\n): boolean\nexport function every<T extends {}, TValue = T[keyof T]>(\n  val: T,\n  iterator: EachObjectIterator,\n  revert?: boolean\n): boolean\nexport function every(val: any, iterator: any, revert?: boolean): boolean {\n  let res = true\n  each(\n    val,\n    (item, key) => {\n      if (!iterator(item, key)) {\n        res = false\n        return false\n      }\n    },\n    revert\n  )\n  return res\n}\n\nexport function some<T extends string>(\n  val: T,\n  iterator: EachStringIterator,\n  revert?: boolean\n): boolean\nexport function some<T>(\n  val: T[],\n  iterator: EachArrayIterator<T>,\n  revert?: boolean\n): boolean\nexport function some<T extends {}, TValue = T[keyof T]>(\n  val: T,\n  iterator: EachObjectIterator,\n  revert?: boolean\n): boolean\nexport function some(val: any, iterator: any, revert?: boolean): boolean {\n  let res = false\n  each(\n    val,\n    (item, key) => {\n      if (iterator(item, key)) {\n        res = true\n        return false\n      }\n    },\n    revert\n  )\n  return res\n}\n\nexport function findIndex<T extends string>(\n  val: T,\n  iterator: EachStringIterator,\n  revert?: boolean\n): number\nexport function findIndex<T>(\n  val: T[],\n  iterator: EachArrayIterator<T>,\n  revert?: boolean\n): number\nexport function findIndex<T extends {}, TValue = T[keyof T]>(\n  val: T,\n  iterator: EachObjectIterator,\n  revert?: boolean\n): keyof T\nexport function findIndex(\n  val: any,\n  iterator: any,\n  revert?: boolean\n): string | number {\n  let res: number | string = -1\n  each(\n    val,\n    (item, key) => {\n      if (iterator(item, key)) {\n        res = key\n        return false\n      }\n    },\n    revert\n  )\n  return res\n}\n\nexport function find<T extends string>(\n  val: T,\n  iterator: EachStringIterator,\n  revert?: boolean\n): any\nexport function find<T>(\n  val: T[],\n  iterator: EachArrayIterator<T>,\n  revert?: boolean\n): T\nexport function find<T extends {}, TValue = T[keyof T]>(\n  val: T,\n  iterator: EachObjectIterator,\n  revert?: boolean\n): T[keyof T]\nexport function find(val: any, iterator: any, revert?: boolean): any {\n  let res: any\n  each(\n    val,\n    (item, key) => {\n      if (iterator(item, key)) {\n        res = item\n        return false\n      }\n    },\n    revert\n  )\n  return res\n}\n\nexport function includes<T extends string>(\n  val: T,\n  searchElement: string,\n  revert?: boolean\n): boolean\nexport function includes<T>(\n  val: T[],\n  searchElement: T,\n  revert?: boolean\n): boolean\nexport function includes(val: any, searchElement: any, revert?: boolean) {\n  if (isStr(val)) return val.includes(searchElement)\n  return some(val, (item) => item === searchElement, revert)\n}\n\nexport function includesWith<T extends string>(\n  val: T,\n  search: (item: string) => boolean\n): boolean\nexport function includesWith<T>(val: T[], search: (item: T) => boolean): boolean\nexport function includesWith(val: any, search: any) {\n  if (isArr(val)) {\n    return val.some((item) => search(item))\n  } else {\n    return false\n  }\n}\n\nexport const flat = <T>(array: Array<T | T[]>): T[] => {\n  return toArr(array).reduce((buf, item) => {\n    if (isArr(item)) return buf.concat(flat(item))\n    return buf.concat(item)\n  }, [])\n}\n"]}

package/esm/clone.d.ts

@@ -0,0 +1,4 @@
+type Filter = (value: any, key: string) => boolean;
+export declare const shallowClone: (values: any) => any;
+export declare const clone: (values: any, filter?: Filter) => any;
+export {};

package/esm/clone.js

@@ -0,0 +1,106 @@
+import { isFn } from './types';
+import { instOf } from './instanceof';
+const NATIVE_KEYS = [
+    ['Map', (map) => new Map(map)],
+    ['WeakMap', (map) => new WeakMap(map)],
+    ['WeakSet', (set) => new WeakSet(set)],
+    ['Set', (set) => new Set(set)],
+    ['Date', (date) => new Date(date)],
+    'FileList',
+    'File',
+    'URL',
+    'RegExp',
+    [
+        'Promise',
+        (promise) => new Promise((resolve, reject) => promise.then(resolve, reject)),
+    ],
+];
+const isNativeObject = (values) => {
+    for (let i = 0; i < NATIVE_KEYS.length; i++) {
+        const item = NATIVE_KEYS[i];
+        if (Array.isArray(item) && item[0]) {
+            if (instOf(values, item[0])) {
+                return item[1] ? item[1] : item[0];
+            }
+        }
+        else {
+            if (instOf(values, item)) {
+                return item;
+            }
+        }
+    }
+};
+// Shared designer primitives must not add a React runtime dependency.
+const isReactElement = (value) => value &&
+    typeof value === 'object' &&
+    (value.$$typeof === Symbol.for('react.element') ||
+        value.$$typeof === Symbol.for('react.transitional.element') ||
+        ('$$typeof' in value && '_owner' in value));
+export const shallowClone = (values) => {
+    if (isReactElement(values))
+        return values;
+    let nativeClone;
+    if (Array.isArray(values)) {
+        return values.slice(0);
+    }
+    else if (isNativeObject(values)) {
+        nativeClone = isNativeObject(values);
+        return isFn(nativeClone) ? nativeClone(values) : values;
+    }
+    else if (typeof values === 'object' && !!values) {
+        return {
+            ...values,
+        };
+    }
+};
+export const clone = (values, filter) => {
+    let nativeClone;
+    if (Array.isArray(values)) {
+        return values.map((item) => clone(item, filter));
+    }
+    else if (isNativeObject(values)) {
+        nativeClone = isNativeObject(values);
+        return isFn(nativeClone) ? nativeClone(values) : values;
+    }
+    else if (typeof values === 'object' && !!values) {
+        if (isReactElement(values)) {
+            return values;
+        }
+        if (values._isAMomentObject) {
+            return values;
+        }
+        if (values._isJSONSchemaObject) {
+            return values;
+        }
+        if (isFn(values.toJS)) {
+            return values;
+        }
+        if (isFn(values.toJSON)) {
+            return values;
+        }
+        if (Object.getOwnPropertySymbols(values || {}).length) {
+            return values;
+        }
+        const res = {};
+        for (const key in values) {
+            if (Object.hasOwnProperty.call(values, key)) {
+                if (isFn(filter)) {
+                    if (filter(values[key], key)) {
+                        res[key] = clone(values[key], filter);
+                    }
+                    else {
+                        res[key] = values[key];
+                    }
+                }
+                else {
+                    res[key] = clone(values[key], filter);
+                }
+            }
+        }
+        return res;
+    }
+    else {
+        return values;
+    }
+};
+//# sourceMappingURL=clone.js.map

package/esm/clone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.js","sourceRoot":"","sources":["../src/clone.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAA;AAC9B,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAA;AAGrC,MAAM,WAAW,GAAG;IAClB,CAAC,KAAK,EAAE,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,SAAS,EAAE,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,SAAS,EAAE,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,KAAK,EAAE,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,MAAM,EAAE,CAAC,IAAS,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,UAAU;IACV,MAAM;IACN,KAAK;IACL,QAAQ;IACR;QACE,SAAS;QACT,CAAC,OAAqB,EAAE,EAAE,CACxB,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;KAClE;CACF,CAAA;AAED,MAAM,cAAc,GAAG,CAAC,MAAW,EAAO,EAAE;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACpC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC,CAAA;AAED,sEAAsE;AACtE,MAAM,cAAc,GAAG,CAAC,KAAU,EAAE,EAAE,CACpC,KAAK;IACL,OAAO,KAAK,KAAK,QAAQ;IACzB,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC;QAC7C,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC;QAC3D,CAAC,UAAU,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAA;AAE/C,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAW,EAAE,EAAE;IAC1C,IAAI,cAAc,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAA;IACzC,IAAI,WAAiC,CAAA;IACrC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IACxB,CAAC;SAAM,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;QAClC,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAA;QACpC,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IACzD,CAAC;SAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAClD,OAAO;YACL,GAAG,MAAM;SACV,CAAA;IACH,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAW,EAAE,MAAe,EAAE,EAAE;IACpD,IAAI,WAAiC,CAAA;IACrC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAA;IAClD,CAAC;SAAM,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;QAClC,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAA;QACpC,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IACzD,CAAC;SAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAClD,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,OAAO,MAAM,CAAA;QACf,CAAC;QACD,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,OAAO,MAAM,CAAA;QACf,CAAC;QACD,IAAI,MAAM,CAAC,mBAAmB,EAAE,CAAC;YAC/B,OAAO,MAAM,CAAA;QACf,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,MAAM,CAAA;QACf,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO,MAAM,CAAA;QACf,CAAC;QACD,IAAI,MAAM,CAAC,qBAAqB,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;YACtD,OAAO,MAAM,CAAA;QACf,CAAC;QACD,MAAM,GAAG,GAAG,EAAE,CAAA;QACd,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC5C,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACjB,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;oBACvC,CAAC;yBAAM,CAAC;wBACN,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;oBACxB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;SAAM,CAAC;QACN,OAAO,MAAM,CAAA;IACf,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { isFn } from './types'\nimport { instOf } from './instanceof'\ntype Filter = (value: any, key: string) => boolean\n\nconst NATIVE_KEYS = [\n  ['Map', (map: any) => new Map(map)],\n  ['WeakMap', (map: any) => new WeakMap(map)],\n  ['WeakSet', (set: any) => new WeakSet(set)],\n  ['Set', (set: any) => new Set(set)],\n  ['Date', (date: any) => new Date(date)],\n  'FileList',\n  'File',\n  'URL',\n  'RegExp',\n  [\n    'Promise',\n    (promise: Promise<any>) =>\n      new Promise((resolve, reject) => promise.then(resolve, reject)),\n  ],\n]\n\nconst isNativeObject = (values: any): any => {\n  for (let i = 0; i < NATIVE_KEYS.length; i++) {\n    const item = NATIVE_KEYS[i]\n    if (Array.isArray(item) && item[0]) {\n      if (instOf(values, item[0])) {\n        return item[1] ? item[1] : item[0]\n      }\n    } else {\n      if (instOf(values, item)) {\n        return item\n      }\n    }\n  }\n}\n\n// Shared designer primitives must not add a React runtime dependency.\nconst isReactElement = (value: any) =>\n  value &&\n  typeof value === 'object' &&\n  (value.$$typeof === Symbol.for('react.element') ||\n    value.$$typeof === Symbol.for('react.transitional.element') ||\n    ('$$typeof' in value && '_owner' in value))\n\nexport const shallowClone = (values: any) => {\n  if (isReactElement(values)) return values\n  let nativeClone: (values: any) => any\n  if (Array.isArray(values)) {\n    return values.slice(0)\n  } else if (isNativeObject(values)) {\n    nativeClone = isNativeObject(values)\n    return isFn(nativeClone) ? nativeClone(values) : values\n  } else if (typeof values === 'object' && !!values) {\n    return {\n      ...values,\n    }\n  }\n}\n\nexport const clone = (values: any, filter?: Filter) => {\n  let nativeClone: (values: any) => any\n  if (Array.isArray(values)) {\n    return values.map((item) => clone(item, filter))\n  } else if (isNativeObject(values)) {\n    nativeClone = isNativeObject(values)\n    return isFn(nativeClone) ? nativeClone(values) : values\n  } else if (typeof values === 'object' && !!values) {\n    if (isReactElement(values)) {\n      return values\n    }\n    if (values._isAMomentObject) {\n      return values\n    }\n    if (values._isJSONSchemaObject) {\n      return values\n    }\n\n    if (isFn(values.toJS)) {\n      return values\n    }\n    if (isFn(values.toJSON)) {\n      return values\n    }\n    if (Object.getOwnPropertySymbols(values || {}).length) {\n      return values\n    }\n    const res = {}\n    for (const key in values) {\n      if (Object.hasOwnProperty.call(values, key)) {\n        if (isFn(filter)) {\n          if (filter(values[key], key)) {\n            res[key] = clone(values[key], filter)\n          } else {\n            res[key] = values[key]\n          }\n        } else {\n          res[key] = clone(values[key], filter)\n        }\n      }\n    }\n    return res\n  } else {\n    return values\n  }\n}\n"]}

package/esm/compose.d.ts

@@ -0,0 +1 @@
+export declare const compose: (...fns: ((payload: any) => any)[]) => (payload: any) => any;

package/esm/compose.js

@@ -0,0 +1,8 @@
+export const compose = (...fns) => {
+    return (payload) => {
+        return fns.reduce((buf, fn) => {
+            return fn(buf);
+        }, payload);
+    };
+};
+//# sourceMappingURL=compose.js.map

package/esm/compose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compose.js","sourceRoot":"","sources":["../src/compose.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,GAAG,GAA8B,EAAE,EAAE;IAC3D,OAAO,CAAC,OAAY,EAAE,EAAE;QACtB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE;YAC5B,OAAO,EAAE,CAAC,GAAG,CAAC,CAAA;QAChB,CAAC,EAAE,OAAO,CAAC,CAAA;IACb,CAAC,CAAA;AACH,CAAC,CAAA","sourcesContent":["export const compose = (...fns: ((payload: any) => any)[]) => {\n  return (payload: any) => {\n    return fns.reduce((buf, fn) => {\n      return fn(buf)\n    }, payload)\n  }\n}\n"]}

package/esm/coordinate.d.ts

@@ -0,0 +1,106 @@
+export interface IPoint {
+    x: number;
+    y: number;
+}
+export interface ISize {
+    width: number;
+    height: number;
+}
+export interface ILineSegment {
+    start: IPoint;
+    end: IPoint;
+}
+export interface IRectEdgeLines {
+    v: ILineSegment[];
+    h: ILineSegment[];
+}
+export declare function isRect(rect: any): rect is IRect;
+export declare function isPoint(val: any): val is IPoint;
+export declare function isLineSegment(val: any): val is ILineSegment;
+export declare class Point implements IPoint {
+    x: number;
+    y: number;
+    constructor(x?: number, y?: number);
+}
+export declare class Rect implements IRect {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+    constructor(x: number, y: number, width?: number, height?: number);
+    get left(): number;
+    get right(): number;
+    get top(): number;
+    get bottom(): number;
+}
+export declare class LineSegment {
+    start: IPoint;
+    end: IPoint;
+    constructor(start: IPoint, end: IPoint);
+}
+export interface IRect {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}
+export declare enum RectQuadrant {
+    Inner1 = "I1",//内部第一象限
+    Inner2 = "I2",//内部第二象限
+    Inner3 = "I3",//内部第三象限
+    Inner4 = "I4",//内部第四象限
+    Outer1 = "O1",//内部第五象限
+    Outer2 = "O2",//内部第六象限
+    Outer3 = "O3",//内部第七象限
+    Outer4 = "O4"
+}
+export interface IPointToRectRelative {
+    quadrant: RectQuadrant;
+    distance: number;
+}
+export declare function isPointInRect(point: IPoint, rect: IRect, sensitive?: boolean): boolean;
+export declare function isEqualRect(target?: IRect, source?: IRect): boolean;
+export declare function getRectPoints(source: IRect): Point[];
+export declare function isRectInRect(target: IRect, source: IRect): boolean;
+export declare function isCrossRectInRect(target: IRect, source: IRect): boolean;
+/**
+ * 计算点在矩形的哪个象限
+ * @param point
+ * @param rect
+ */
+export declare function calcQuadrantOfPointToRect(point: IPoint, rect: IRect): RectQuadrant;
+export declare function calcDistanceOfPointToRect(point: IPoint, rect: IRect): number;
+export declare function calcDistancePointToEdge(point: IPoint, rect: IRect): number;
+export declare function isNearAfter(point: IPoint, rect: IRect, inline?: boolean): boolean;
+/**
+ * 计算点鱼矩形的相对位置信息
+ * @param point
+ * @param rect
+ */
+export declare function calcRelativeOfPointToRect(point: IPoint, rect: IRect): IPointToRectRelative;
+export declare function calcBoundingRect(rects: IRect[]): Rect;
+export declare function calcRectByStartEndPoint(startPoint: IPoint, endPoint: IPoint, scrollX?: number, scrollY?: number): Rect;
+export declare function calcEdgeLinesOfRect(rect?: IRect): IRectEdgeLines | undefined;
+export declare function calcRectOfAxisLineSegment(line?: ILineSegment): Rect;
+export declare function calcSpaceBlockOfRect(target: IRect, source: IRect, type?: string): {
+    type: string;
+    distance: number;
+    rect: Rect;
+};
+export declare function calcExtendsLineSegmentOfRect(targetRect: Rect, referRect: Rect): {
+    start: {
+        x: number;
+        y: number;
+    };
+    end: {
+        x: number;
+        y: number;
+    };
+};
+export declare function calcOffsetOfSnapLineSegmentToEdge(line: ILineSegment, current: IRect): {
+    x: number;
+    y: number;
+};
+export declare function calcDistanceOfSnapLineToEdges(line: ILineSegment, edges?: IRectEdgeLines): number;
+export declare function calcCombineSnapLineSegment(target: ILineSegment, source: ILineSegment): ILineSegment;
+export declare function calcClosestEdges(line: ILineSegment, edges: IRectEdgeLines): [number, ILineSegment];