Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
S
schbrain-parent
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Metrics
Incidents
Environments
Packages & Registries
Packages & Registries
Package Registry
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
framework
schbrain-parent
Commits
c34912ac
Commit
c34912ac
authored
Jul 29, 2023
by
panwangnan
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
添加通过树节点构建一个树状结构的方法
parent
e16f35a0
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
65 additions
and
0 deletions
+65
-0
commons/common-util/src/main/java/com/schbrain/common/util/TreeUtil.java
...util/src/main/java/com/schbrain/common/util/TreeUtil.java
+65
-0
No files found.
commons/common-util/src/main/java/com/schbrain/common/util/TreeUtil.java
0 → 100644
View file @
c34912ac
package
com.schbrain.common.util
;
import
org.apache.commons.collections4.CollectionUtils
;
import
java.util.*
;
import
java.util.function.BiConsumer
;
import
java.util.function.Function
;
/**
* 树工具类
*/
public
class
TreeUtil
{
/**
* 通过列表构建一个树状结构
*
* @param nodes 节点列表
* @param idGetMethod 获取当前节点ID的方法
* @param parentIdGetMethod 获取父节点ID的方法
* @param setParentMethod 设置子节点列表的方法
* @param parentId 父节点ID,可以为null
*/
public
static
<
T
,
K
>
List
<
T
>
buildTree
(
List
<
T
>
nodes
,
Function
<
T
,
K
>
idGetMethod
,
Function
<
T
,
K
>
parentIdGetMethod
,
BiConsumer
<
T
,
List
<
T
>>
setParentMethod
,
K
parentId
)
{
if
(
CollectionUtils
.
isEmpty
(
nodes
))
{
return
nodes
;
}
Map
<
K
,
List
<
T
>>
parentGroupMap
=
new
HashMap
<>();
for
(
T
node
:
nodes
)
{
K
key
=
parentIdGetMethod
.
apply
(
node
);
List
<
T
>
subNodes
=
parentGroupMap
.
getOrDefault
(
key
,
new
ArrayList
<>());
subNodes
.
add
(
node
);
parentGroupMap
.
put
(
key
,
subNodes
);
}
return
buildTree
(
idGetMethod
,
setParentMethod
,
parentId
,
parentGroupMap
);
}
/**
* 递归通过列表构建一个树状结构
*
* @param idGetMethod 获取当前节点ID的方法
* @param setParentMethod 设置子节点列表的方法
* @param parentId 父节点ID,可以为null
* @param parentGroupMap 存放节点下层节点列表的map
*/
private
static
<
T
,
K
>
List
<
T
>
buildTree
(
Function
<
T
,
K
>
idGetMethod
,
BiConsumer
<
T
,
List
<
T
>>
setParentMethod
,
K
parentId
,
Map
<
K
,
List
<
T
>>
parentGroupMap
)
{
List
<
T
>
nodes
=
parentGroupMap
.
get
(
parentId
);
if
(
CollectionUtils
.
isEmpty
(
nodes
))
{
return
Collections
.
emptyList
();
}
nodes
.
forEach
(
item
->
setParentMethod
.
accept
(
item
,
buildTree
(
idGetMethod
,
setParentMethod
,
idGetMethod
.
apply
(
item
),
parentGroupMap
)));
return
nodes
;
}
}
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