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
e11df56d
Commit
e11df56d
authored
Jul 29, 2023
by
liaozan
🏀
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Polish
parent
c8a0d6e1
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
26 additions
and
11 deletions
+26
-11
commons/common-util/src/main/java/com/schbrain/common/util/TreeUtils.java
...til/src/main/java/com/schbrain/common/util/TreeUtils.java
+26
-11
No files found.
commons/common-util/src/main/java/com/schbrain/common/util/TreeUtils.java
View file @
e11df56d
...
@@ -4,6 +4,7 @@ import org.apache.commons.collections4.CollectionUtils;
...
@@ -4,6 +4,7 @@ import org.apache.commons.collections4.CollectionUtils;
import
javax.annotation.Nullable
;
import
javax.annotation.Nullable
;
import
java.util.ArrayList
;
import
java.util.ArrayList
;
import
java.util.Comparator
;
import
java.util.List
;
import
java.util.List
;
import
java.util.Map
;
import
java.util.Map
;
import
java.util.function.BiConsumer
;
import
java.util.function.BiConsumer
;
...
@@ -31,6 +32,16 @@ public class TreeUtils {
...
@@ -31,6 +32,16 @@ public class TreeUtils {
Function
<
T
,
E
>
childMapper
,
Function
<
T
,
E
>
childMapper
,
BiConsumer
<
E
,
List
<
E
>>
childrenSetter
,
BiConsumer
<
E
,
List
<
E
>>
childrenSetter
,
@Nullable
K
parentId
)
{
@Nullable
K
parentId
)
{
return
buildTree
(
nodes
,
keyExtractor
,
parentKeyExtractor
,
childMapper
,
childrenSetter
,
null
,
parentId
);
}
public
static
<
T
,
K
,
E
>
List
<
E
>
buildTree
(
List
<
T
>
nodes
,
Function
<
T
,
K
>
keyExtractor
,
Function
<
T
,
K
>
parentKeyExtractor
,
Function
<
T
,
E
>
childMapper
,
BiConsumer
<
E
,
List
<
E
>>
childrenSetter
,
Comparator
<
E
>
childrenComparator
,
@Nullable
K
parentId
)
{
if
(
CollectionUtils
.
isEmpty
(
nodes
))
{
if
(
CollectionUtils
.
isEmpty
(
nodes
))
{
return
new
ArrayList
<>();
return
new
ArrayList
<>();
}
}
...
@@ -40,20 +51,24 @@ public class TreeUtils {
...
@@ -40,20 +51,24 @@ public class TreeUtils {
List
<
T
>
subNodes
=
StreamUtils
.
filterToList
(
nodes
,
node
->
parentKeyExtractor
.
apply
(
node
)
==
null
);
List
<
T
>
subNodes
=
StreamUtils
.
filterToList
(
nodes
,
node
->
parentKeyExtractor
.
apply
(
node
)
==
null
);
parentWithSubNodes
.
put
(
null
,
subNodes
);
parentWithSubNodes
.
put
(
null
,
subNodes
);
}
}
return
buildTree
(
keyExtractor
,
childrenSetter
,
childMapper
,
parentWithSubNodes
,
parentId
);
return
doBuildTree
(
keyExtractor
,
childrenSetter
,
childMapper
,
parentWithSubNodes
,
childrenComparator
,
parentId
);
}
}
private
static
<
E
,
K
,
T
>
List
<
E
>
buildTree
(
Function
<
T
,
K
>
keyExtractor
,
private
static
<
E
,
K
,
T
>
List
<
E
>
doBuildTree
(
Function
<
T
,
K
>
keyExtractor
,
BiConsumer
<
E
,
List
<
E
>>
childrenSetter
,
BiConsumer
<
E
,
List
<
E
>>
childrenSetter
,
Function
<
T
,
E
>
childMapper
,
Function
<
T
,
E
>
childMapper
,
Map
<
K
,
List
<
T
>>
parentWithSubNodes
,
Map
<
K
,
List
<
T
>>
parentWithSubNodes
,
K
parentId
)
{
Comparator
<
E
>
childrenComparator
,
List
<
T
>
subNodes
=
parentWithSubNodes
.
get
(
parentId
);
K
parentId
)
{
List
<
T
>
subNodes
=
parentWithSubNodes
.
remove
(
parentId
);
return
StreamUtils
.
toList
(
subNodes
,
subNode
->
{
return
StreamUtils
.
toList
(
subNodes
,
subNode
->
{
E
convertedSubNode
=
childMapper
.
apply
(
subNode
);
E
child
=
childMapper
.
apply
(
subNode
);
List
<
E
>
children
=
buildTree
(
keyExtractor
,
childrenSetter
,
childMapper
,
parentWithSubNodes
,
keyExtractor
.
apply
(
subNode
));
List
<
E
>
children
=
doBuildTree
(
keyExtractor
,
childrenSetter
,
childMapper
,
parentWithSubNodes
,
childrenComparator
,
keyExtractor
.
apply
(
subNode
));
childrenSetter
.
accept
(
convertedSubNode
,
children
);
if
(
CollectionUtils
.
isNotEmpty
(
children
)
&&
childrenComparator
!=
null
)
{
return
convertedSubNode
;
children
.
sort
(
Comparator
.
nullsLast
(
childrenComparator
));
}
childrenSetter
.
accept
(
child
,
children
);
return
child
;
});
});
}
}
...
...
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