@wufengteam/inputs/lib/SettingDepart/tool.js

平台提供的右侧属性编辑器，需要在主工程中注册

"use strict";

Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.addDisabledToHierarchy = addDisabledToHierarchy;
exports.recursionOrgIds = exports.getFirstChar = exports.formateTreeData = exports.arraysEqualIgnoreOrder = void 0;
function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
/**
 * 设置Tree组件treeData是否可选
 * @param b  原数据
 * @param a 可点击的节点 空为全部
 * @returns
 */
function addDisabledToHierarchy(b, a) {
  // 递归函数，用于遍历和修改children数组
  function traverseAndModify(items) {
    if (!Array.isArray(items)) return; // 如果不是数组，直接返回
    items.forEach(function (item) {
      // 检查是否需要添加disabled属性
      if ((a === null || a === void 0 ? void 0 : a.length) === 0 || (a === null || a === void 0 ? void 0 : a.includes(Number((item === null || item === void 0 ? void 0 : item.orgLevel) - 1)))) {
        // 索引从1开始，所以+1
        item.disableCheckbox = false; // 可点击
      } else {
        item.disableCheckbox = true; // 不可点击
      }
      // 递归处理children
      if (item.children) {
        traverseAndModify(item.children);
      }
    });
  }
  // 复制b数组，避免直接修改原始数据
  var modifiedB = JSON.parse(JSON.stringify(b));
  // 遍历并修改modifiedB的children
  traverseAndModify(modifiedB);
  return modifiedB;
}
var formateTreeData = exports.formateTreeData = function formateTreeData() {
  var srcData = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
  var keyField = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'orgId';
  var titleField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'orgName';
  var keyPops = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'key';
  if (srcData && Array.isArray(srcData) && srcData.length) {
    var orgData = srcData === null || srcData === void 0 ? void 0 : srcData.map(function (item) {
      var _item$children = item.children,
        children = _item$children === void 0 ? [] : _item$children;
      var obj = item;
      if (children === null || children === void 0 ? void 0 : children.length) {
        obj.children = formateTreeData(children, keyField, titleField, keyPops);
      }
      return Object.assign(Object.assign({}, item), _defineProperty(_defineProperty({}, keyPops, item[keyField]), "title", item[titleField]));
    });
    return orgData;
  }
  return [];
};
/**
 * 对比数组，不考虑顺序
 * @param a
 * @param b
 * @returns
 */
var arraysEqualIgnoreOrder = exports.arraysEqualIgnoreOrder = function arraysEqualIgnoreOrder(a, b) {
  if (a === undefined || b === undefined) return false;
  if ((a === null || a === void 0 ? void 0 : a.length) !== (b === null || b === void 0 ? void 0 : b.length)) return false;
  // 使用 Set 来去除重复元素，并比较两个 Set 的大小
  // 如果两个 Set 的大小相同，那么数组包含相同的元素
  var setA = new Set(a);
  var setB = new Set(b);
  return setA.size === setB.size && _toConsumableArray(setA).every(function (value) {
    return setB.has(value);
  });
};
/**
 * 获取第一个字
 * @param name
 * @returns
 */
var getFirstChar = exports.getFirstChar = function getFirstChar() {
  var name = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : '';
  var retStr = '';
  if (name) {
    retStr = name.trim().substring(0, 1);
  }
  return retStr || '-';
};
/**
 * 递归返回部门ID
 * @param children
 * @returns
 */
var recursionOrgIds = exports.recursionOrgIds = function recursionOrgIds(children, checkedAll) {
  if (children && Array.isArray(children) && checkedAll) {
    var allOrgIds = [];
    children.forEach(function (item) {
      var orgId = item.orgId,
        _item$children2 = item.children,
        hasChildren = _item$children2 === void 0 ? [] : _item$children2;
      if (hasChildren && Array.isArray(hasChildren) && hasChildren.length) {
        allOrgIds = [].concat(_toConsumableArray(recursionOrgIds(hasChildren)), _toConsumableArray(allOrgIds));
      }
      allOrgIds.push(orgId);
    });
    return allOrgIds;
  }
  return [];
};