@lambo-design/shared 1.0.0-beta.361 → 1.0.0-beta.362

package/nstyles/components/table.less

@@ -78,6 +78,9 @@
       display: none !important;
       background-color: unset !important;
     }
+    .cell-span {
+      z-index: 2 !important;
+    }
     .ag-row.replicate-selected-row {
       // 当 .ag-row 包含 .replicate-selected-row 子元素时，为 .ag-row 添加 ::before
       &::after {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lambo-design/shared",
-  "version": "1.0.0-beta.361",
+  "version": "1.0.0-beta.362",
   "description": "",
   "main": "index.js",
   "author": "lambo",

package/utils/base64.js

@@ -1,126 +1,126 @@
-let Base64 = {
-  Base64Chars:
-    "abcdefghijklmnopqrstuv" +
-    "wxyzABCDEFGHIJKLMNOP" +
-    "QRSTUVWXYZ0123456789@*-",
-  /**
-   * Encode a string to a Base64 string follow Bse64 regular.
-   * @param s, a normal string
-   * @return a Base64 string
-   */
-  encode: function (s) {
-    if (!s || s.length == 0) return s;
-
-    var d = "";
-    var b = this.ucs2_utf8(s);
-    var b0, b1, b2, b3;
-    var len = b.length;
-    var i = 0;
-    while (i < len) {
-      var tmp = b[i++];
-      b0 = (tmp & 0xfc) >> 2;
-      b1 = (tmp & 0x03) << 4;
-      if (i < len) {
-        tmp = b[i++];
-        b1 |= (tmp & 0xf0) >> 4;
-        b2 = (tmp & 0x0f) << 2;
-        if (i < len) {
-          tmp = b[i++];
-          b2 |= (tmp & 0xc0) >> 6;
-          b3 = tmp & 0x3f;
-        } else {
-          b3 = 64; // 1 byte "-" is supplement
-
-        }
-      } else {
-        b2 = b3 = 64; // 2 bytes "-" are supplement
-
-      }
-
-      d += this.Base64Chars.charAt(b0);
-      d += this.Base64Chars.charAt(b1);
-      d += this.Base64Chars.charAt(b2);
-      d += this.Base64Chars.charAt(b3);
-    }
-
-    return d;
-
-  },
-
-  /**
-   * Encodes a ucs2 string to a utf8 integer array.
-   * @param s, a string
-   * @return an integer array
-   */
-  ucs2_utf8: function (s) {
-    if (!s) return null;
-    var d = new Array();
-    if (s == "") return d;
-
-    var c = 0, i = 0, j = 0;
-    var len = s.length;
-    while (i < len) {
-      c = s.charCodeAt(i++);
-      if (c <= 0x7f) {
-        // 1 byte
-
-        d[j++] = c;
-      } else if ((c >= 0x80) && (c <= 0x7ff)) {
-        // 2 bytes
-
-        d[j++] = ((c >> 6) & 0x1f) | 0xc0;
-        d[j++] = (c & 0x3f) | 0x80;
-      } else {
-        // 3 bytes
-
-        d[j++] = (c >> 12) | 0xe0;
-        d[j++] = ((c >> 6) & 0x3f) | 0x80;
-        d[j++] = (c & 0x3f) | 0x80;
-      }
-    }
-
-    return d;
-  },
-  /**
-   * Encodes a utf8 integer array to a ucs2 string.
-   * @param s, an integer array
-   * @return a string
-   */
-  utf8_ucs2: function (s) {
-    if (!s) return null;
-    var len = s.length;
-    if (len == 0) return "";
-
-    var d = "";
-    var c = 0, i = 0, tmp = 0;
-    while (i < len) {
-      c = s[i++];
-      if ((c & 0xe0) == 0xe0) {
-        // 3 bytes
-
-        tmp = (c & 0x0f) << 12;
-        c = s[i++];
-        tmp |= ((c & 0x3f) << 6);
-        c = s[i++];
-        tmp |= (c & 0x3f);
-      } else if ((c & 0xc0) == 0xc0) {
-        // 2 bytes
-
-        tmp = (c & 0x1f) << 6;
-        c = s[i++];
-        tmp |= (c & 0x3f);
-      } else {
-        // 1 byte
-
-        tmp = c;
-      }
-
-      d += String.fromCharCode(tmp);
-    }
-
-    return d;
-  }
-};
-export {
-  Base64
-}
+let Base64 = {
+  Base64Chars:
+    "abcdefghijklmnopqrstuv" +
+    "wxyzABCDEFGHIJKLMNOP" +
+    "QRSTUVWXYZ0123456789@*-",
+  /**
+   * Encode a string to a Base64 string follow Bse64 regular.
+   * @param s, a normal string
+   * @return a Base64 string
+   */
+  encode: function (s) {
+    if (!s || s.length == 0) return s;
+
+    var d = "";
+    var b = this.ucs2_utf8(s);
+    var b0, b1, b2, b3;
+    var len = b.length;
+    var i = 0;
+    while (i < len) {
+      var tmp = b[i++];
+      b0 = (tmp & 0xfc) >> 2;
+      b1 = (tmp & 0x03) << 4;
+      if (i < len) {
+        tmp = b[i++];
+        b1 |= (tmp & 0xf0) >> 4;
+        b2 = (tmp & 0x0f) << 2;
+        if (i < len) {
+          tmp = b[i++];
+          b2 |= (tmp & 0xc0) >> 6;
+          b3 = tmp & 0x3f;
+        } else {
+          b3 = 64; // 1 byte "-" is supplement
+
+        }
+      } else {
+        b2 = b3 = 64; // 2 bytes "-" are supplement
+
+      }
+
+      d += this.Base64Chars.charAt(b0);
+      d += this.Base64Chars.charAt(b1);
+      d += this.Base64Chars.charAt(b2);
+      d += this.Base64Chars.charAt(b3);
+    }
+
+    return d;
+
+  },
+
+  /**
+   * Encodes a ucs2 string to a utf8 integer array.
+   * @param s, a string
+   * @return an integer array
+   */
+  ucs2_utf8: function (s) {
+    if (!s) return null;
+    var d = new Array();
+    if (s == "") return d;
+
+    var c = 0, i = 0, j = 0;
+    var len = s.length;
+    while (i < len) {
+      c = s.charCodeAt(i++);
+      if (c <= 0x7f) {
+        // 1 byte
+
+        d[j++] = c;
+      } else if ((c >= 0x80) && (c <= 0x7ff)) {
+        // 2 bytes
+
+        d[j++] = ((c >> 6) & 0x1f) | 0xc0;
+        d[j++] = (c & 0x3f) | 0x80;
+      } else {
+        // 3 bytes
+
+        d[j++] = (c >> 12) | 0xe0;
+        d[j++] = ((c >> 6) & 0x3f) | 0x80;
+        d[j++] = (c & 0x3f) | 0x80;
+      }
+    }
+
+    return d;
+  },
+  /**
+   * Encodes a utf8 integer array to a ucs2 string.
+   * @param s, an integer array
+   * @return a string
+   */
+  utf8_ucs2: function (s) {
+    if (!s) return null;
+    var len = s.length;
+    if (len == 0) return "";
+
+    var d = "";
+    var c = 0, i = 0, tmp = 0;
+    while (i < len) {
+      c = s[i++];
+      if ((c & 0xe0) == 0xe0) {
+        // 3 bytes
+
+        tmp = (c & 0x0f) << 12;
+        c = s[i++];
+        tmp |= ((c & 0x3f) << 6);
+        c = s[i++];
+        tmp |= (c & 0x3f);
+      } else if ((c & 0xc0) == 0xc0) {
+        // 2 bytes
+
+        tmp = (c & 0x1f) << 6;
+        c = s[i++];
+        tmp |= (c & 0x3f);
+      } else {
+        // 1 byte
+
+        tmp = c;
+      }
+
+      d += String.fromCharCode(tmp);
+    }
+
+    return d;
+  }
+};
+export {
+  Base64
+}

package/utils/getChild.js

@@ -1,87 +1,87 @@
-/**
- * 获取所有子菜单 - 优化版
- * 使用 Map 缓存 + 迭代，复杂度从 O(n²×depth) 降到 O(n×depth)
- * @param {Array} permissionList 权限列表
- * @param {string|number} pid 父级ID
- * @param {Object} appInfo 应用信息
- * @returns {Array} 所有子节点
- */
-export const getChildPermissions = (permissionList, pid, appInfo) => {
-  if (!permissionList || !pid) return [];
-
-  // 建立 id -> permission 的 Map，O(n)
-  const permissionMap = new Map();
-  for (const permission of permissionList) {
-    if (permission && permission.hasOwnProperty('permissionId')) {
-      permissionMap.set(permission.permissionId, permission);
-    }
-  }
-
-  // 使用迭代检查是否为子节点，避免递归栈溢出
-  const isChildOf = (permission) => {
-    let current = permission;
-    const visited = new Set(); // 防止循环引用
-
-    while (current && current.pid) {
-      // 循环引用检测
-      if (visited.has(current.permissionId)) return false;
-      visited.add(current.permissionId);
-
-      if (current.pid == pid) return true;
-      current = permissionMap.get(current.pid); // O(1) 查找
-    }
-    return false;
-  };
-
-  const res = [];
-  for (const permission of permissionList) {
-    if (isChildOf(permission)) {
-      const per2 = deepCopy(permission);
-      per2.appId = pid;
-      if (per2.pid == pid) {
-        per2.pid = "0";
-      }
-      per2.appInfo = deepCopy(appInfo);
-      res.push(per2);
-    }
-  }
-
-  return res;
-}
-
-
-export const getRootPermission = (permissionList, permission) => {
-  if (!permissionList || !permission) return permission;
-
-  // 构建 Map，O(n)
-  const permissionMap = new Map();
-  for (const item of permissionList) {
-    if (item && item.permissionId != null) {
-      const key = `${item.permissionId}|${item.appId || ''}`;
-      permissionMap.set(key, item);
-    }
-  }
-
-  // 迭代向上查找根节点
-  let current = permission;
-  const visited = new Set();
-
-  while (current) {
-    if (!current.pid || current.pid === '0') {
-      return current;
-    }
-
-    // 循环引用检测
-    const key = `${current.permissionId}|${current.appId || ''}`;
-    if (visited.has(key)) return permission;
-    visited.add(key);
-
-    // O(1) 查找父节点
-    const parentKey = `${current.pid}|${current.appId || ''}`;
-    current = permissionMap.get(parentKey);
-
-    if (!current) return permission;
-  }
-
-  return permission;
-}
+/**
+ * 获取所有子菜单 - 优化版
+ * 使用 Map 缓存 + 迭代，复杂度从 O(n²×depth) 降到 O(n×depth)
+ * @param {Array} permissionList 权限列表
+ * @param {string|number} pid 父级ID
+ * @param {Object} appInfo 应用信息
+ * @returns {Array} 所有子节点
+ */
+export const getChildPermissions = (permissionList, pid, appInfo) => {
+  if (!permissionList || !pid) return [];
+
+  // 建立 id -> permission 的 Map，O(n)
+  const permissionMap = new Map();
+  for (const permission of permissionList) {
+    if (permission && permission.hasOwnProperty('permissionId')) {
+      permissionMap.set(permission.permissionId, permission);
+    }
+  }
+
+  // 使用迭代检查是否为子节点，避免递归栈溢出
+  const isChildOf = (permission) => {
+    let current = permission;
+    const visited = new Set(); // 防止循环引用
+
+    while (current && current.pid) {
+      // 循环引用检测
+      if (visited.has(current.permissionId)) return false;
+      visited.add(current.permissionId);
+
+      if (current.pid == pid) return true;
+      current = permissionMap.get(current.pid); // O(1) 查找
+    }
+    return false;
+  };
+
+  const res = [];
+  for (const permission of permissionList) {
+    if (isChildOf(permission)) {
+      const per2 = deepCopy(permission);
+      per2.appId = pid;
+      if (per2.pid == pid) {
+        per2.pid = "0";
+      }
+      per2.appInfo = deepCopy(appInfo);
+      res.push(per2);
+    }
+  }
+
+  return res;
+}
+
+
+export const getRootPermission = (permissionList, permission) => {
+  if (!permissionList || !permission) return permission;
+
+  // 构建 Map，O(n)
+  const permissionMap = new Map();
+  for (const item of permissionList) {
+    if (item && item.permissionId != null) {
+      const key = `${item.permissionId}|${item.appId || ''}`;
+      permissionMap.set(key, item);
+    }
+  }
+
+  // 迭代向上查找根节点
+  let current = permission;
+  const visited = new Set();
+
+  while (current) {
+    if (!current.pid || current.pid === '0') {
+      return current;
+    }
+
+    // 循环引用检测
+    const key = `${current.permissionId}|${current.appId || ''}`;
+    if (visited.has(key)) return permission;
+    visited.add(key);
+
+    // O(1) 查找父节点
+    const parentKey = `${current.pid}|${current.appId || ''}`;
+    current = permissionMap.get(parentKey);
+
+    if (!current) return permission;
+  }
+
+  return permission;
+}