befly-shared 1.2.7 → 1.3.0

package/package.json

@@ -1,40 +1,23 @@
 {
     "name": "befly-shared",
-    "version": "1.2.7",
-    "type": "module",
-    "exports": {
-        ".": {
-            "bun": "./src/index.ts",
-            "import": "./dist/index.js",
-            "types": "./types/index.d.ts"
-        },
-        "./*": {
-            "bun": "./src/*.ts",
-            "import": "./dist/*.js",
-            "types": "./types/*.d.ts"
-        }
-    },
+    "version": "1.3.0",
+    "private": false,
+    "description": "Befly 纯函数与纯常量共享包（不包含 Node/浏览器特定实现）",
+    "license": "Apache-2.0",
+    "author": "chensuiyi <bimostyle@qq.com>",
     "files": [
-        "dist",
-        "src",
-        "types",
-        "tests",
         "package.json",
-        "README.md"
+        "utils"
     ],
+    "type": "module",
+    "exports": {
+        "./utils/*": "./utils/*.ts"
+    },
     "scripts": {
-        "build": "rimraf dist && tsc",
         "test": "bun test"
     },
-    "devDependencies": {
-        "@types/bun": "latest",
-        "rimraf": "^6.1.2",
-        "typescript": "^5.7.2"
-    },
-    "dependencies": {
-        "es-toolkit": "^1.42.0",
-        "merge-anything": "^6.0.6",
-        "pathe": "^2.0.3"
+    "engines": {
+        "bun": ">=1.3.0"
     },
-    "gitHead": "8725d04017ae530017c1d400d0fc7b4e2b3ffdb0"
+    "gitHead": "123125b9d7a6c26879a5b5c9d3ac05e2082141c6"
 }

package/utils/arrayToTree.ts

@@ -0,0 +1,135 @@
+export type ArrayToTreeResult<T extends Record<string, any>> = {
+    flat: Array<T>;
+    tree: Array<T>;
+    map: Map<string, T>;
+};
+
+/**
+ * 将一维数组按 { id, pid } 组装为树形结构（纯函数 / 无副作用）。
+ *
+ * - 默认字段：id / pid / children / sort
+ * - pid 为空字符串或父节点不存在时，视为根节点
+ * - 内部会 clone 一份节点对象，并写入 children: []
+ * - 默认自带递归排序：按 sort 升序；sort 缺省/非法或 < 1 视为 999999；sort 相同按 id 自然序1
+ */
+export function arrayToTree<T extends Record<string, any>>(items: T[], id: string = "id", pid: string = "pid", children: string = "children", sort: string = "sort"): ArrayToTreeResult<T> {
+    const idKey = typeof id === "string" && id.length > 0 ? id : "id";
+    const pidKey = typeof pid === "string" && pid.length > 0 ? pid : "pid";
+    const childrenKey = typeof children === "string" && children.length > 0 ? children : "children";
+    const sortKey = typeof sort === "string" && sort.length > 0 ? sort : "sort";
+
+    const map = new Map<string, T>();
+    const flat: T[] = [];
+
+    const safeItems = Array.isArray(items) ? items : [];
+
+    const normalizeKey = (value: unknown): string => {
+        if (typeof value === "string") {
+            return value;
+        }
+        if (typeof value === "number" && Number.isFinite(value)) {
+            return String(value);
+        }
+        return "";
+    };
+
+    for (const item of safeItems) {
+        const rawId = item ? (item as any)[idKey] : undefined;
+        const rawPid = item ? (item as any)[pidKey] : undefined;
+
+        const normalizedId = normalizeKey(rawId);
+        const normalizedPid = normalizeKey(rawPid);
+
+        const nextNode = Object.assign({}, item) as T;
+        (nextNode as any)[idKey] = normalizedId;
+        (nextNode as any)[pidKey] = normalizedPid;
+        (nextNode as any)[childrenKey] = [];
+
+        flat.push(nextNode);
+
+        if (normalizedId.length > 0) {
+            map.set(normalizedId, nextNode);
+        }
+    }
+
+    const tree: T[] = [];
+
+    for (const node of flat) {
+        const selfId = normalizeKey(node ? (node as any)[idKey] : undefined);
+        const parentId = normalizeKey(node ? (node as any)[pidKey] : undefined);
+
+        if (parentId.length > 0 && parentId !== selfId) {
+            const parent = map.get(parentId);
+            if (parent && Array.isArray((parent as any)[childrenKey])) {
+                (parent as any)[childrenKey].push(node);
+                continue;
+            }
+        }
+
+        tree.push(node);
+    }
+
+    const collator = new Intl.Collator(undefined, { numeric: true, sensitivity: "base" });
+
+    const getSortValue = (node: T): number => {
+        const raw = node ? (node as any)[sortKey] : undefined;
+        if (typeof raw !== "number") {
+            return 999999;
+        }
+        if (!Number.isFinite(raw)) {
+            return 999999;
+        }
+        if (raw < 1) {
+            return 999999;
+        }
+        return raw;
+    };
+
+    const compareNode = (a: T, b: T): number => {
+        const aSort = getSortValue(a);
+        const bSort = getSortValue(b);
+
+        if (aSort !== bSort) {
+            return aSort - bSort;
+        }
+
+        const aId = a ? (a as any)[idKey] : "";
+        const bId = b ? (b as any)[idKey] : "";
+
+        return collator.compare(typeof aId === "string" ? aId : "", typeof bId === "string" ? bId : "");
+    };
+
+    const sortTreeInPlace = (nodes: Array<T>, seen: WeakSet<object>): void => {
+        if (!Array.isArray(nodes)) {
+            return;
+        }
+
+        if (nodes.length > 1) {
+            nodes.sort(compareNode);
+        }
+
+        for (const node of nodes) {
+            if (typeof node !== "object" || node === null) {
+                continue;
+            }
+
+            if (seen.has(node)) {
+                continue;
+            }
+            seen.add(node);
+
+            const childNodes = (node as any)[childrenKey];
+            if (Array.isArray(childNodes) && childNodes.length > 0) {
+                sortTreeInPlace(childNodes, seen);
+            }
+        }
+    };
+
+    sortTreeInPlace(tree, new WeakSet<object>());
+
+    return {
+        flat: flat,
+        tree: tree,
+        map: map
+    };
+}

package/utils/buildTreeByParentPath.ts

@@ -0,0 +1,127 @@
+export type BuildTreeByParentPathOptions = {
+    pathKey?: string;
+    parentPathKey?: string;
+    childrenKey?: string;
+    normalize?: (value: unknown) => string;
+};
+
+export type BuildTreeByParentPathResult<T extends Record<string, any>> = {
+    flat: Array<T>;
+    tree: Array<T>;
+    map: Map<string, T>;
+};
+
+/**
+ * 将一维数组按 { path, parentPath } 组装为树形结构（纯函数 / 无副作用）。
+ *
+ * - 默认字段：path / parentPath / children
+ * - parentPath 为空字符串或父节点不存在时，视为根节点
+ * - 内部会 clone 一份节点对象，并写入 children: []
+ * - 默认自带递归排序：按 sort 升序；sort 缺省/非法或 < 1 视为 999999；sort 相同按 path 自然序
+ */
+export function buildTreeByParentPath<T extends Record<string, any>>(items: T[], options?: BuildTreeByParentPathOptions): BuildTreeByParentPathResult<T> {
+    const pathKey = typeof options?.pathKey === "string" && options.pathKey.length > 0 ? options.pathKey : "path";
+    const parentPathKey = typeof options?.parentPathKey === "string" && options.parentPathKey.length > 0 ? options.parentPathKey : "parentPath";
+    const childrenKey = typeof options?.childrenKey === "string" && options.childrenKey.length > 0 ? options.childrenKey : "children";
+
+    const normalize =
+        typeof options?.normalize === "function"
+            ? options.normalize
+            : (value: unknown) => {
+                  return typeof value === "string" ? value : "";
+              };
+
+    const map = new Map<string, T>();
+    const flat: T[] = [];
+
+    const safeItems = Array.isArray(items) ? items : [];
+
+    for (const item of safeItems) {
+        const rawPath = item ? item[pathKey] : undefined;
+        const rawParentPath = item ? item[parentPathKey] : undefined;
+
+        const normalizedPath = normalize(rawPath);
+        const normalizedParentPath = normalize(rawParentPath);
+
+        const nextNode = Object.assign({}, item) as T;
+        (nextNode as any)[pathKey] = normalizedPath;
+        (nextNode as any)[parentPathKey] = normalizedParentPath;
+        (nextNode as any)[childrenKey] = [];
+
+        flat.push(nextNode);
+
+        if (typeof normalizedPath === "string" && normalizedPath.length > 0) {
+            map.set(normalizedPath, nextNode);
+        }
+    }
+
+    const tree: T[] = [];
+    for (const node of flat) {
+        const parentPath = (node as any)[parentPathKey];
+
+        if (typeof parentPath === "string" && parentPath.length > 0) {
+            const parent = map.get(parentPath);
+            if (parent && Array.isArray((parent as any)[childrenKey])) {
+                (parent as any)[childrenKey].push(node);
+                continue;
+            }
+        }
+
+        tree.push(node);
+    }
+
+    const collator = new Intl.Collator(undefined, { numeric: true, sensitivity: "base" });
+
+    const getSortValue = (node: T): number => {
+        const raw = node ? (node as any).sort : undefined;
+        if (typeof raw !== "number") {
+            return 999999;
+        }
+
+        if (!Number.isFinite(raw)) {
+            return 999999;
+        }
+
+        if (raw < 1) {
+            return 999999;
+        }
+
+        return raw;
+    };
+
+    const compareNode = (a: T, b: T): number => {
+        const aSort = getSortValue(a);
+        const bSort = getSortValue(b);
+
+        if (aSort !== bSort) {
+            return aSort - bSort;
+        }
+
+        const aPath = a ? (a as any)[pathKey] : "";
+        const bPath = b ? (b as any)[pathKey] : "";
+        return collator.compare(typeof aPath === "string" ? aPath : "", typeof bPath === "string" ? bPath : "");
+    };
+
+    const sortTreeInPlace = (nodes: Array<T>): void => {
+        if (!Array.isArray(nodes) || nodes.length <= 1) {
+            return;
+        }
+
+        nodes.sort(compareNode);
+
+        for (const node of nodes) {
+            const children = node ? (node as any)[childrenKey] : undefined;
+            if (Array.isArray(children) && children.length > 0) {
+                sortTreeInPlace(children);
+            }
+        }
+    };
+
+    sortTreeInPlace(tree);
+
+    return {
+        flat: flat,
+        tree: tree,
+        map: map
+    };
+}

package/utils/scanViewsDir.ts

@@ -0,0 +1,148 @@
+export type ViewDirMeta = {
+    title: string;
+    order?: number;
+};
+
+type MenuNodeLike<T> = {
+    name?: string;
+    path?: string;
+    sort?: number;
+    children?: T[];
+};
+
+/**
+ * 清理目录名中的数字后缀
+ * 如：login_1 → login, index_2 → index
+ */
+export function cleanDirName(name: string): string {
+    return name.replace(/_\d+$/, "");
+}
+
+/**
+ * 约束：统一 path 形态，避免隐藏菜单匹配、DB 同步出现重复
+ * - 必须以 / 开头
+ * - 折叠多个 /
+ * - 去掉尾随 /（根 / 除外）
+ */
+export function normalizeMenuPath(path: string): string {
+    let result = path;
+
+    if (!result) {
+        return "/";
+    }
+
+    if (!result.startsWith("/")) {
+        result = `/${result}`;
+    }
+
+    result = result.replace(/\/+/g, "/");
+
+    if (result.length > 1) {
+        result = result.replace(/\/+$/, "");
+    }
+
+    return result;
+}
+
+/**
+ * 递归规范化并按 path 去重（同 path 的 children 合并）
+ *
+ * 说明：该函数是纯函数，不依赖任何运行时环境；会返回新数组，但会在内部对克隆对象做合并赋值。
+ */
+export function normalizeMenuTree<T extends MenuNodeLike<T>>(menus: T[]): T[] {
+    const map = new Map<string, T>();
+
+    for (const menu of menus) {
+        const rawPath = menu.path;
+        const menuPath = rawPath ? normalizeMenuPath(rawPath) : "";
+
+        if (!menuPath) {
+            continue;
+        }
+
+        // 不使用 structuredClone：
+        // - 结构中可能出现函数/类实例等不可 clone 的值
+        // - 这里我们只需要“保留额外字段 + 递归 children 生成新数组”
+        // 用浅拷贝即可满足需求
+        const cloned = Object.assign({}, menu) as T;
+        (cloned as any).path = menuPath;
+
+        const rawChildren = menu.children;
+        if (rawChildren && rawChildren.length > 0) {
+            (cloned as any).children = normalizeMenuTree(rawChildren);
+        }
+
+        const existing = map.get(menuPath);
+        if (existing) {
+            const clonedChildren = (cloned as any).children as T[] | undefined;
+            if (clonedChildren && clonedChildren.length > 0) {
+                let existingChildren = (existing as any).children as T[] | undefined;
+                if (!existingChildren) {
+                    existingChildren = [];
+                    (existing as any).children = existingChildren;
+                }
+
+                for (const child of clonedChildren) {
+                    existingChildren.push(child);
+                }
+
+                (existing as any).children = normalizeMenuTree(existingChildren);
+            }
+
+            if (typeof cloned.sort === "number") {
+                (existing as any).sort = cloned.sort;
+            }
+
+            if (typeof cloned.name === "string" && cloned.name) {
+                (existing as any).name = cloned.name;
+            }
+        } else {
+            map.set(menuPath, cloned);
+        }
+    }
+
+    const result = Array.from(map.values());
+    result.sort((a, b) => ((a as any).sort ?? 999999) - ((b as any).sort ?? 999999));
+    return result;
+}
+
+/**
+ * 只取第一个 <script ... setup ...> 块
+ */
+export function extractScriptSetupBlock(vueContent: string): string | null {
+    const openTag = /<script\b[^>]*\bsetup\b[^>]*>/i.exec(vueContent);
+    if (!openTag) {
+        return null;
+    }
+
+    const start = openTag.index + openTag[0].length;
+    const closeIndex = vueContent.indexOf("</script>", start);
+    if (closeIndex < 0) {
+        return null;
+    }
+
+    return vueContent.slice(start, closeIndex);
+}
+
+/**
+ * 从 <script setup> 中提取 definePage({ meta })
+ *
+ * 简化约束：
+ * - 每个页面只有一个 definePage
+ * - title 是纯字符串字面量
+ * - order 是数字字面量（可选）
+ * - 不考虑变量/表达式/多段 meta 组合
+ */
+export function extractDefinePageMetaFromScriptSetup(scriptSetup: string): ViewDirMeta | null {
+    const titleMatch = scriptSetup.match(/definePage\s*\([\s\S]*?meta\s*:\s*\{[\s\S]*?title\s*:\s*(["'`])([^"'`]+)\1/);
+    if (!titleMatch) {
+        return null;
+    }
+
+    const orderMatch = scriptSetup.match(/definePage\s*\([\s\S]*?meta\s*:\s*\{[\s\S]*?order\s*:\s*(\d+)/);
+
+    return {
+        title: titleMatch[2],
+        order: orderMatch ? Number(orderMatch[1]) : undefined
+    };
+}