/* * @Author: wanglj 471442253@qq.com * @Date: 2023-07-11 14:13:56 * @LastEditors: wanglj * @LastEditTime: 2023-07-20 16:22:10 * @Description: file content * @FilePath: \labsop_meno\frontend\packages\vue-next-admin\src\utils\arrayOperation.ts */ /** * 判断两数组字符串是否相同(用于按钮权限验证),数组字符串中存在相同时会自动去重(按钮权限标识不会重复) * @param news 新数据 * @param old 源数据 * @returns 两数组相同返回 `true`,反之则反 */ export function judementSameArr(newArr: unknown[] | string[], oldArr: string[]): boolean { const news = removeDuplicate(newArr); const olds = removeDuplicate(oldArr); let count = 0; const leng = news.length; for (let i in olds) { for (let j in news) { if (olds[i] === news[j]) count++; } } return count === leng ? true : false; } /** * 判断两个对象是否相同 * @param a 要比较的对象一 * @param b 要比较的对象二 * @returns 相同返回 true,反之则反 */ export function isObjectValueEqual(a: T, b: T): boolean { if (!a || !b) return false; let aProps = Object.getOwnPropertyNames(a); let bProps = Object.getOwnPropertyNames(b); if (aProps.length != bProps.length) return false; for (let i = 0; i < aProps.length; i++) { let propName = aProps[i]; let propA = a[propName]; let propB = b[propName]; if (!b.hasOwnProperty(propName)) return false; if (propA instanceof Object) { if (!isObjectValueEqual(propA, propB)) return false; } else if (propA !== propB) { return false; } } return true; } /** * 数组、数组对象去重 * @param arr 数组内容 * @param attr 需要去重的键值(数组对象) * @returns */ export function removeDuplicate(arr: EmptyArrayType, attr?: string) { if (!Object.keys(arr).length) { return arr; } else { if (attr) { const obj: EmptyObjectType = {}; return arr.reduce((cur: EmptyArrayType[], item: EmptyArrayType) => { obj[item[attr]] ? '' : (obj[item[attr]] = true && item[attr] && cur.push(item)); return cur; }, []); } else { return [...new Set(arr)]; } } } export function handleTree(data:[], id = 'id', parentId = 'parentId', children = 'children', rootId = 0) { //对源数据深度克隆 const cloneData = JSON.parse(JSON.stringify(data)) //循环所有项 const treeData = cloneData.filter(father => { let branchArr = cloneData.filter(child => { //返回每一项的子级数组 return father[id] === child[parentId] }); branchArr.length > 0 ? father[children] = branchArr : ''; //返回第一层 return father[parentId] == rootId; }); return treeData != '' ? treeData : data; }