@pawover/kit 0.0.0-alpha.3 → 0.0.0-alpha.31

package/dist/utils/string.js

@@ -1,70 +0,0 @@
-import { isString } from "./typeof";
-/**
- * 转义特殊字符
- *
- * @link https://github.com/sindresorhus/escape-string-regexp
- * @param value 字符串
- */
-export function escapeStringRegexp(value) {
-    return value.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
-}
-/**
- * 首字母大小写
- */
-export function stringInitialCase(value, type) {
-    if (!isString(value) || value.length === 0) {
-        return value;
-    }
-    const m1 = /\S+/g;
-    const m2 = /[^a-zA-Z\u00C0-\u017F]/;
-    return value.replace(m1, (word) => {
-        // 单词含非字母字符（如.,'-等）→ 原样保留
-        if (m2.test(word)) {
-            return word;
-        }
-        // 纯字母且全大写 → 保留
-        if (word === word.toLocaleUpperCase()) {
-            return word;
-        }
-        // 纯字母且非全大写 → 首字母小写，其余保留
-        if (type === "lower" && word[0]) {
-            return word[0].toLocaleLowerCase() + word.slice(1);
-        }
-        // 纯字母且非全大写 → 首字母大写写，其余保留
-        if (type === "upper" && word[0]) {
-            return word[0].toLocaleUpperCase() + word.slice(1);
-        }
-        return word;
-    });
-}
-export function stringToJson(data, safeValue) {
-    if (isString(data) && data) {
-        try {
-            const value = JSON.parse(data);
-            return value;
-        }
-        catch (error) {
-            return safeValue;
-        }
-    }
-    else {
-        return safeValue;
-    }
-}
-export function stringToValues(data, valueType = "number") {
-    if (isString(data) && data) {
-        try {
-            const values = data.split(",");
-            if (valueType === "number") {
-                return values.map((d) => Number(d));
-            }
-            return values;
-        }
-        catch (error) {
-            return [];
-        }
-    }
-    else {
-        return [];
-    }
-}

package/dist/utils/to.js

@@ -1,16 +0,0 @@
-/**
- * @param promise
- * @param errorExt - 可以传递给err对象的其他信息
- */
-export function to(promise, errorExt) {
-    return promise
-        .then((data) => [null, data])
-        .catch((err) => {
-        if (errorExt) {
-            const parsedError = { ...err, ...errorExt };
-            return [parsedError, undefined];
-        }
-        const defaultError = err ? err : new Error("defaultError");
-        return [defaultError, undefined];
-    });
-}

package/dist/utils/tree/index.js

@@ -1,6 +0,0 @@
-export { treeFilter } from "./treeFilter";
-export { treeFind } from "./treeFind";
-export { treeForEach } from "./treeForEach";
-export { treeMap } from "./treeMap";
-export { rowsToTree } from "./rowsToTree";
-export { treeToRows } from "./treeToRows";

package/dist/utils/tree/rowsToTree.js

@@ -1,35 +0,0 @@
-import { isNull, isUndefined } from "../typeof";
-/**
- * 行结构 转 树结构
- */
-export function rowsToTree(rows, options) {
-    const { parentIdKey = "parentId", rowKey = "id", childrenKey = "children" } = options || {};
-    const result = [];
-    const map = new Map();
-    for (const row of rows) {
-        const id = row[rowKey];
-        if (!map.get(id)) {
-            map.set(id, row);
-        }
-    }
-    for (const row of rows) {
-        const parentId = row[parentIdKey];
-        const parent = map.get(parentId);
-        if (!parent || !parentId) {
-            result.push(row);
-            continue;
-        }
-        const siblings = parent[childrenKey];
-        if (isNull(siblings) || isUndefined(siblings)) {
-            parent[childrenKey] = [row];
-        }
-        else if (Array.isArray(siblings)) {
-            siblings.push(row);
-        }
-        else {
-            const message = `The key "${childrenKey.toString()}" in parent item is not an array.`;
-            throw new Error(message);
-        }
-    }
-    return result;
-}

package/dist/utils/tree/treeFilter.js

@@ -1,92 +0,0 @@
-import { arrayLast } from "../array";
-import { isArray } from "../typeof";
-import { getFinalChildrenKey } from "./types";
-// 前置遍历
-function preImpl(row, callback, options) {
-    const result = callback(row, options);
-    if (!result) {
-        return undefined;
-    }
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    let newChildren;
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        newChildren = children.map((c) => preImpl(c, callback, nextLevelOptions)).filter((c) => !!c);
-    }
-    return { ...row, [finalChildrenKey]: newChildren };
-}
-// 子节点优先遍历
-function postImpl(row, callback, options) {
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    let newChildren;
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        newChildren = children.map((c) => preImpl(c, callback, nextLevelOptions)).filter((c) => !!c);
-    }
-    const result = callback(row, options);
-    if (!result) {
-        return undefined;
-    }
-    return { ...row, [finalChildrenKey]: newChildren };
-}
-// 广度优先遍历
-function breadthImpl(row, callback, options) {
-    const queue = [{ queueRow: row, queueOptions: options }];
-    const resultCache = new WeakMap();
-    const newNodeCache = new WeakMap();
-    const childrenKeyCache = new WeakMap();
-    let result;
-    const runQueue = () => {
-        if (queue.length === 0) {
-            return result;
-        }
-        const { queueRow, queueOptions } = queue.shift();
-        const finalChildrenKey = getFinalChildrenKey(queueRow, queueOptions, queueOptions);
-        const children = queueRow[finalChildrenKey];
-        if (isArray(children)) {
-            const nextLevelOptions = { ...queueOptions, parents: [...queueOptions.parents, queueRow], depth: queueOptions.depth + 1 };
-            const subQueueItems = children.map((queueRow) => ({ queueRow, queueOptions: nextLevelOptions }));
-            queue.push(...subQueueItems);
-        }
-        const parent = arrayLast(queueOptions.parents);
-        const isTopNode = queueOptions.depth === 0;
-        const parentResult = parent && resultCache.get(parent);
-        if (!isTopNode && !parentResult) {
-            return runQueue();
-        }
-        const callbackResult = callback(queueRow, queueOptions);
-        if (isTopNode && !callbackResult) {
-            return undefined;
-        }
-        const newNode = { ...queueRow, [finalChildrenKey]: undefined };
-        if (isTopNode) {
-            result = newNode;
-        }
-        resultCache.set(queueRow, callbackResult);
-        newNodeCache.set(queueRow, newNode);
-        childrenKeyCache.set(queueRow, finalChildrenKey);
-        if (callbackResult && parent) {
-            const parentNewNode = newNodeCache.get(parent);
-            const parentChildrenKey = childrenKeyCache.get(parent);
-            if (parentNewNode && parentChildrenKey) {
-                if (!parentNewNode[parentChildrenKey]) {
-                    parentNewNode[parentChildrenKey] = [];
-                }
-                parentNewNode[parentChildrenKey].push(newNode);
-            }
-        }
-        return runQueue();
-    };
-    return runQueue();
-}
-const strategies = { pre: preImpl, post: postImpl, breadth: breadthImpl };
-export function treeFilter(tree, callback, options = {}) {
-    const { childrenKey = "children", strategy = "pre", getChildrenKey } = options;
-    const traversalMethod = strategies[strategy];
-    const innerOptions = { childrenKey: childrenKey, depth: 0, parents: [], getChildrenKey };
-    return isArray(tree)
-        ? tree.map((row) => traversalMethod(row, callback, innerOptions)).filter((t) => !!t)
-        : traversalMethod(tree, callback, innerOptions) || [];
-}

package/dist/utils/tree/treeFind.js

@@ -1,82 +0,0 @@
-import { isArray } from "../typeof";
-import { getFinalChildrenKey } from "./types";
-const strategies = { pre: preImpl, post: postImpl, breadth: breadthImpl };
-// 前置深度优先遍历
-function preImpl(row, callback, options) {
-    const callbackResult = callback(row, options);
-    if (callbackResult) {
-        return row;
-    }
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    if (isArray(children)) {
-        for (const child of children) {
-            const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-            const result = preImpl(child, callback, nextLevelOptions);
-            if (result) {
-                return result;
-            }
-        }
-    }
-    return undefined;
-}
-// 后置深度优先遍历
-function postImpl(row, callback, options) {
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    if (isArray(children)) {
-        for (const child of children) {
-            const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-            const result = postImpl(child, callback, nextLevelOptions);
-            if (result) {
-                return result;
-            }
-        }
-    }
-    const callbackResult = callback(row, options);
-    if (callbackResult) {
-        return row;
-    }
-    return undefined;
-}
-// 广度优先遍历
-function breadthImpl(row, callback, options) {
-    const queue = [{ queueRow: row, queueOptions: options }];
-    const runQueue = () => {
-        if (queue.length === 0) {
-            return undefined;
-        }
-        const { queueRow, queueOptions } = queue.shift();
-        const finalChildrenKey = getFinalChildrenKey(queueRow, queueOptions, queueOptions);
-        const children = queueRow[finalChildrenKey];
-        if (isArray(children)) {
-            const nextLevelOptions = { ...queueOptions, parents: [...queueOptions.parents, queueRow], depth: queueOptions.depth + 1 };
-            const subQueueItems = children.map((queueRow) => ({ queueRow, queueOptions: nextLevelOptions }));
-            queue.push(...subQueueItems);
-        }
-        const callbackResult = callback(queueRow, queueOptions);
-        if (callbackResult) {
-            return queueRow;
-        }
-        return runQueue();
-    };
-    return runQueue();
-}
-/**
- * 查找树节点，找到第一个返回非空值的节点
- */
-export function treeFind(tree, callback, options = {}) {
-    const { childrenKey = "children", strategy = "pre", getChildrenKey } = options;
-    const traversalMethod = strategies[strategy];
-    const innerOptions = { childrenKey: childrenKey, depth: 0, parents: [], getChildrenKey };
-    if (isArray(tree)) {
-        for (const row of tree) {
-            const result = traversalMethod(row, callback, innerOptions);
-            if (result) {
-                return result;
-            }
-        }
-        return undefined;
-    }
-    return traversalMethod(tree, callback, innerOptions);
-}

package/dist/utils/tree/treeForEach.js

@@ -1,60 +0,0 @@
-import { isArray } from "../typeof";
-import { getFinalChildrenKey } from "./types";
-const strategies = { pre: preImpl, post: postImpl, breadth: breadthImpl };
-// 前置遍历
-function preImpl(row, callback, options) {
-    callback(row, options);
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        for (const child of children) {
-            preImpl(child, callback, nextLevelOptions);
-        }
-    }
-}
-// 后置遍历
-function postImpl(row, callback, options) {
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        for (const child of children) {
-            postImpl(child, callback, nextLevelOptions);
-        }
-    }
-    callback(row, options);
-}
-// 广度优先遍历
-function breadthImpl(row, callback, options) {
-    const queue = [{ queueRow: row, queueOptions: options }];
-    const runQueue = () => {
-        if (queue.length === 0) {
-            return;
-        }
-        const { queueRow, queueOptions } = queue.shift();
-        const finalChildrenKey = getFinalChildrenKey(queueRow, queueOptions, queueOptions);
-        const children = queueRow[finalChildrenKey];
-        if (isArray(children)) {
-            const nextLevelOptions = { ...queueOptions, parents: [...queueOptions.parents, queueRow], depth: queueOptions.depth + 1 };
-            const subQueueItems = children.map((queueRow) => ({ queueRow, queueOptions: nextLevelOptions }));
-            queue.push(...subQueueItems);
-        }
-        callback(queueRow, queueOptions);
-        runQueue();
-    };
-    runQueue();
-}
-export function treeForEach(tree, callback, options = {}) {
-    const { childrenKey = "children", strategy = "pre", getChildrenKey } = options;
-    const traversalMethod = strategies[strategy];
-    const innerOptions = { childrenKey: childrenKey, depth: 0, parents: [], getChildrenKey };
-    if (isArray(tree)) {
-        for (const row of tree) {
-            traversalMethod(row, callback, innerOptions);
-        }
-    }
-    else {
-        traversalMethod(tree, callback, innerOptions);
-    }
-}

package/dist/utils/tree/treeMap.js

@@ -1,79 +0,0 @@
-import { arrayLast } from "../array";
-import { isArray } from "../typeof";
-import { getFinalChildrenKey } from "./types";
-const strategies = { pre: preImpl, post: postImpl, breadth: breadthImpl };
-// 前置遍历
-function preImpl(row, callback, options) {
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const result = callback(row, options);
-    const children = row[finalChildrenKey];
-    let newChildren;
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        newChildren = children.map((c) => preImpl(c, callback, nextLevelOptions));
-    }
-    return { ...result, [finalChildrenKey]: newChildren };
-}
-// 子节点优先遍历
-function postImpl(row, callback, options) {
-    const finalChildrenKey = getFinalChildrenKey(row, options, options);
-    const children = row[finalChildrenKey];
-    let newChildren;
-    if (isArray(children)) {
-        const nextLevelOptions = { ...options, parents: [...options.parents, row], depth: options.depth + 1 };
-        newChildren = children.map((c) => postImpl(c, callback, nextLevelOptions));
-    }
-    const result = callback(row, options);
-    return { ...result, [finalChildrenKey]: newChildren };
-}
-// 广度优先遍历
-function breadthImpl(row, callback, options) {
-    const queue = [{ queueRow: row, queueOptions: options }];
-    const cache = new WeakMap();
-    const childrenKeyCache = new WeakMap();
-    let result;
-    const runQueue = () => {
-        if (queue.length === 0) {
-            return result;
-        }
-        const { queueRow, queueOptions } = queue.shift();
-        const finalChildrenKey = getFinalChildrenKey(queueRow, queueOptions, queueOptions);
-        const children = queueRow[finalChildrenKey];
-        if (isArray(children)) {
-            const nextLevelOptions = { ...queueOptions, parents: [...queueOptions.parents, queueRow], depth: queueOptions.depth + 1 };
-            const subQueueItems = children.map((queueRow) => ({ queueRow, queueOptions: nextLevelOptions }));
-            queue.push(...subQueueItems);
-        }
-        const res = callback(queueRow, queueOptions);
-        cache.set(queueRow, res);
-        childrenKeyCache.set(queueRow, finalChildrenKey);
-        // breadth 模式的子节点一定晚于父节点执行，所以可以在cache中找到父节点的生成物
-        const parent = arrayLast(queueOptions.parents);
-        if (parent) {
-            const newParent = cache.get(parent);
-            const parentChildrenKey = childrenKeyCache.get(parent);
-            if (newParent && parentChildrenKey) {
-                if (newParent[parentChildrenKey]) {
-                    newParent[parentChildrenKey].push(res);
-                }
-                else {
-                    newParent[parentChildrenKey] = [res];
-                }
-            }
-        }
-        // 这棵树的顶点
-        if (queueOptions.depth === 0) {
-            result = res;
-        }
-        return runQueue();
-    };
-    return runQueue();
-}
-export function treeMap(tree, callback, options = {}) {
-    const { childrenKey = "children", strategy = "pre", getChildrenKey } = options;
-    const traversalMethod = strategies[strategy];
-    const innerOptions = { childrenKey: childrenKey, depth: 0, parents: [], getChildrenKey };
-    return isArray(tree)
-        ? tree.map((row) => traversalMethod(row, callback, innerOptions))
-        : traversalMethod(tree, callback, innerOptions);
-}

package/dist/utils/tree/treeToRows.js

@@ -1,13 +0,0 @@
-import { treeForEach } from "./treeForEach";
-/**
- * 树结构 转 行结构
- */
-export function treeToRows(tree, options = {}) {
-    const { childrenKey = "children" } = options;
-    const result = [];
-    if (!tree) {
-        return result;
-    }
-    treeForEach(tree, (t) => result.push({ ...t, [childrenKey]: undefined }), options);
-    return result;
-}

package/dist/utils/tree/types.js

@@ -1,10 +0,0 @@
-import { isFunction } from "../typeof";
-export function getFinalChildrenKey(tree, meta, options) {
-    if (isFunction(options.getChildrenKey)) {
-        const dynamicChildrenKey = options.getChildrenKey(tree, meta);
-        if (dynamicChildrenKey && dynamicChildrenKey !== null) {
-            return dynamicChildrenKey;
-        }
-    }
-    return options.childrenKey;
-}

package/dist/utils/typeof.js

@@ -1,114 +0,0 @@
-const prototypes = {
-    string: "[object String]",
-    number: "[object Number]",
-    boolean: "[object Boolean]",
-    object: "[object Object]",
-    array: "[object Array]",
-    bigInt: "[object BigInt]",
-    symbol: "[object Symbol]",
-    function: "[object Function]",
-    generatorFunction: "[object GeneratorFunction]",
-    asyncFunction: "[object AsyncFunction]",
-    promise: "[object Promise]",
-    null: "[object Null]",
-    undefined: "[object Undefined]",
-    date: "[object Date]",
-    regExp: "[object RegExp]",
-    error: "[object Error]",
-    file: "[object File]",
-    map: "[object Map]",
-    weakMap: "[object WeakMap]",
-    set: "[object Set]",
-    weakSet: "[object WeakSet]",
-    window: "[object Window]",
-    webSocket: "[object WebSocket]",
-    URLSearchParams: "[object URLSearchParams]",
-};
-function resolvePrototypeString(value) {
-    return Object.prototype.toString.call(value);
-}
-export function isString(value) {
-    return resolvePrototypeString(value) === prototypes.string;
-}
-export function isNumber(value) {
-    return resolvePrototypeString(value) === prototypes.number;
-}
-export function isBoolean(value) {
-    return resolvePrototypeString(value) === prototypes.boolean;
-}
-export function isObject(value) {
-    return resolvePrototypeString(value) === prototypes.object;
-}
-export function isArray(value) {
-    return resolvePrototypeString(value) === prototypes.array;
-}
-export function isBigInt(value) {
-    return resolvePrototypeString(value) === prototypes.bigInt;
-}
-export function isSymbol(value) {
-    return resolvePrototypeString(value) === prototypes.symbol;
-}
-export function isFunction(value) {
-    const prototypeList = [prototypes.function, prototypes.generatorFunction, prototypes.asyncFunction];
-    return prototypeList.includes(resolvePrototypeString(value));
-}
-export function isGeneratorFunction(value) {
-    return resolvePrototypeString(value) === prototypes.generatorFunction;
-}
-export function isAsyncFunction(value) {
-    return resolvePrototypeString(value) === prototypes.asyncFunction;
-}
-export function isPromise(value) {
-    return resolvePrototypeString(value) === prototypes.promise;
-}
-export function isPromiseLike(value) {
-    return isPromise(value) || (isObject(value) && isFunction(value["then"]));
-}
-export function isNull(value) {
-    return resolvePrototypeString(value) === prototypes.null;
-}
-export function isUndefined(value) {
-    return resolvePrototypeString(value) === prototypes.undefined;
-}
-export function isDate(value) {
-    return resolvePrototypeString(value) === prototypes.date;
-}
-export function isRegExp(value) {
-    return resolvePrototypeString(value) === prototypes.regExp;
-}
-export function isError(value) {
-    return resolvePrototypeString(value) === prototypes.error;
-}
-export function isFile(value) {
-    return resolvePrototypeString(value) === prototypes.file;
-}
-export function isMap(value) {
-    return resolvePrototypeString(value) === prototypes.map;
-}
-export function isWeakMap(value) {
-    return resolvePrototypeString(value) === prototypes.weakMap;
-}
-export function isSet(value) {
-    return resolvePrototypeString(value) === prototypes.set;
-}
-export function isWeakSet(value) {
-    return resolvePrototypeString(value) === prototypes.weakSet;
-}
-export function isWindow(value) {
-    return resolvePrototypeString(value) === prototypes.window;
-}
-export function isWebSocket(value) {
-    return resolvePrototypeString(value) === prototypes.webSocket;
-}
-export function isURLSearchParams(value) {
-    return resolvePrototypeString(value) === prototypes.URLSearchParams;
-}
-export function isClass(value) {
-    return resolvePrototypeString(value).startsWith("class ");
-}
-export function isInteger(value) {
-    return Number.isInteger(value);
-}
-export function isIterable(value) {
-    return isObject(value) && Symbol.iterator in value;
-}