数组结构数组和扁平结构数组处理

//#region ******************************数组结构数组和扁平结构数组处理******************************

/**
 * 将扁平结构数组数据转树状结构数组
 * @param {array} listArr List结构数组数据
 * @param {string} idField id字段名称
 * @param {string} pidField parent id字段名称
 * @param {string} childrenField 子节点字段名称
 * @param {string} sortField -排序字段名称
 * @param {string} sortMode -排序方式asc/desc,默认asc
 * @returns {array} 返回树状结构数组
 */
function getTreeData(listArr, idField, pidField, childrenField, sortField, sortMode = 'asc') {
    var data = JSON.parse(JSON.stringify(listArr));
    for (var i = 0; i < data.length; i++) {
        //是否叶子节点，从叶子节点开始到跟节点逐步构建TreeData格式数据
        var isLeaf = true;
        for (var k = 0; k < data.length; k++) {
            //节点id是其它节点pid，不是叶子节点
            if (data[i][idField] == data[k][pidField]) isLeaf = false;
        }
        //如果是叶子节点，将叶子节点加到父节点的children数组内
        if (isLeaf) {
            for (var j = 0; j < data.length; j++) {
                if (data[j][idField] == data[i][pidField]) {
                    //若children属性不存在或不是数组，则默认设置为空数组
                    if (!childrenField in data[j] || !Array.isArray(data[j][childrenField])) data[j][childrenField] = [];
                    //删除其pid属性
                    if (pidField in data[i]) delete data[i][pidField];
                    data[j][childrenField].push(data[i]);
                    //添加到父项后删除原数组该项，并重新遍历数组
                    data.splice(i, 1);
                    i = 0;
                    break;
                }
            }
        }
    }
    //删除数组各项的pid属性
    // for (var i = 0; i < data.length; i++) {
    // if (pidField in data[i]) delete data[i][pidField];
    // }
    //将数组先排序在返回数组
    this.sortTreeData(data, childrenField, sortField, sortMode);
    return data;
}

/**
 * 将树状数组数据转扁平数组数据
 * @param {any} treeArr 树状结构数组
 * @param {string} idField id字段名称
 * @param {string} pidField parent id字段名称
 * @param {string} childrenField 子节点字段名称
 * @param {object} rootPidVal 根节点id值,默认空字符串
 * @param {string} sortField 排序字段名称
 * @param {string} sortMode 排序方式asc/desc,默认asc
 * @returns {array} 返回扁平结构数组
 */
function getListData(treeArr, idField, pidField, childrenField, rootPidVal, sortField, sortMode = 'asc') {
    var data = JSON.parse(JSON.stringify(treeArr));
    var arr = [];
    function fn(data, arr, pid) {
        for (var i = 0; i < data.length; i++) {
            //赋值对象值并进行修改而不影响被复制对象的值
            var obj = JSON.parse(JSON.stringify(data[i]));
            obj[pidField] = pidField in data[i] ? data[i][pidField] : pid;
            //删除子节点数组属性
            if (childrenField in obj) delete obj[childrenField];
            arr.push(obj);
            //对有子节点数组属性的节点递归
            if (childrenField in data[i]) fn(data[i][childrenField], arr, data[i][idField]);
        }
    }
    //默认根目录ID为""字符串
    fn(data, arr, rootPidVal);
    return sortArr(arr, sortMode, sortField);
}

/**
 * 对树状对象数组进行排序
 * @param {array} treeData -树状对象数组
 * @param {string} childrenField -子节点数组名称
 * @param {string} sortField -排序字段名称
 * @param {string} sortMode -排序方式asc/desc,默认asc
 * @returns {array} 返回排序后数组，改变原素组
 */
function sortTreeData(treeData, childrenField, sortField, sortMode = 'asc') {
    if (!sortField) return treeData;
    var n = 1;
    if (sortMode && sortMode.toLowerCase() == "desc") n = -1;
    for (var i = 0; i < treeData.length; i++) {
        if (treeData[i][childrenField])
            this.sortTreeData(treeData[i][childrenField], childrenField, sortField, sortMode)
    }
    sortArr(treeData, sortMode, sortField);
    return treeData;
}

/**
 * 数组排序
 * @param {array} arr 目标数组
 * @param {string} sortMode 排序方式,asc升序,desc降序
 * @param {string} sortField 排序字段，没有则为空
 * @returns {array} 返回排序后数组，改变原素组
 */
function sortArr(arr, sortMode, sortField = "") {
    var n = 1;
    if (sortMode && sortMode.toLowerCase() == "desc") n = -1;
    arr.sort(function (a, b) {
        var a1, b1;
        a1 = sortField ? a[sortField] : a;
        b1 = sortField ? b[sortField] : b;
        if (a1 > b1) {
            return 1 * n;
        }
        else if (a1 < b1) {
            return -1 * n;
        } else {
            return 0 * n;
        }
    })
    return arr;
}

//#endregion