Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
F
finance-manage
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
finance-oa
finance-manage
Commits
876ecf21
Commit
876ecf21
authored
Aug 04, 2020
by
fungleo
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
优化构建树形数据JS方法
parent
10767241
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
8 deletions
+4
-8
ruoyi-ui/src/utils/ruoyi.js
ruoyi-ui/src/utils/ruoyi.js
+4
-8
No files found.
ruoyi-ui/src/utils/ruoyi.js
View file @
876ecf21
...
@@ -126,23 +126,19 @@ export function praseStrEmpty(str) {
...
@@ -126,23 +126,19 @@ export function praseStrEmpty(str) {
* @param {*} children 孩子节点字段 默认 'children'
* @param {*} children 孩子节点字段 默认 'children'
* @param {*} rootId 根Id 默认 0
* @param {*} rootId 根Id 默认 0
*/
*/
export
function
handleTree
(
data
,
id
,
parentId
,
children
,
rootId
)
{
export
function
handleTree
(
data
=
[],
id
=
'
id
'
,
parentId
=
'
parentId
'
,
children
=
'
children
'
,
rootId
=
0
)
{
id
=
id
||
'
id
'
parentId
=
parentId
||
'
parentId
'
children
=
children
||
'
children
'
rootId
=
rootId
||
0
//对源数据深度克隆
//对源数据深度克隆
const
cloneData
=
JSON
.
parse
(
JSON
.
stringify
(
data
))
const
cloneData
=
JSON
.
parse
(
JSON
.
stringify
(
data
))
//循环所有项
//循环所有项
const
treeData
=
cloneData
.
filter
(
father
=>
{
const
treeData
=
cloneData
.
filter
(
father
=>
{
le
t
branchArr
=
cloneData
.
filter
(
child
=>
{
cons
t
branchArr
=
cloneData
.
filter
(
child
=>
{
//返回每一项的子级数组
//返回每一项的子级数组
return
father
[
id
]
===
child
[
parentId
]
return
father
[
id
]
===
child
[
parentId
]
});
});
branchArr
.
length
>
0
?
father
.
children
=
branchArr
:
''
;
branchArr
.
length
&&
(
father
.
children
=
branchArr
)
;
//返回第一层
//返回第一层
return
father
[
parentId
]
===
rootId
;
return
father
[
parentId
]
===
rootId
;
});
});
return
treeData
!=
''
?
treeData
:
data
;
return
treeData
!=
=
''
?
treeData
:
data
;
}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment