6
6
import org .jfrog .build .api .util .Log ;
7
7
8
8
import javax .swing .tree .DefaultMutableTreeNode ;
9
- import javax .swing .tree .TreeNode ;
10
-
11
9
import java .util .*;
12
10
import java .util .stream .Collectors ;
13
11
@@ -112,7 +110,7 @@ public void setMetadata(boolean metadata) {
112
110
113
111
public void setPrefix (String prefix ) {
114
112
packagePrefix = prefix .toLowerCase () + "://" ;
115
- getChildren ().forEach (node -> (( DependencyTree ) node ) .setPrefix (prefix ));
113
+ getChildren ().forEach (node -> node .setPrefix (prefix ));
116
114
}
117
115
118
116
/**
@@ -127,13 +125,13 @@ public int getIssueCount() {
127
125
* @return Node's children
128
126
*/
129
127
@ SuppressWarnings ({"WeakerAccess" , "unchecked" })
130
- public Vector <TreeNode > getChildren () {
128
+ public Vector <DependencyTree > getChildren () {
131
129
return children != null ? children : new Vector <>();
132
130
}
133
131
134
132
@ JsonProperty (value = "nodes" )
135
133
@ SuppressWarnings ({"unchecked" , "unused" })
136
- public List <TreeNode > getNodes () {
134
+ public List <DependencyTree > getNodes () {
137
135
return children ;
138
136
}
139
137
@@ -148,7 +146,7 @@ public List<TreeNode> getNodes() {
148
146
@ SuppressWarnings ({"WeakerAccess" , "unused" })
149
147
public Set <Issue > processTreeIssues () {
150
148
setIssuesComponent ();
151
- getChildren ().forEach (child -> issues .addAll ((( DependencyTree ) child ) .processTreeIssues ()));
149
+ getChildren ().forEach (child -> issues .addAll (child .processTreeIssues ()));
152
150
setTopIssue ();
153
151
sortChildren ();
154
152
return issues ;
@@ -162,10 +160,7 @@ private void setIssuesComponent() {
162
160
}
163
161
164
162
private void sortChildren () {
165
- Vector children = getChildren ();
166
- Vector <DependencyTree > dependencyTrees = (Vector <DependencyTree >) children ;
167
-
168
- dependencyTrees .sort (Comparator
163
+ getChildren ().sort (Comparator
169
164
.comparing (DependencyTree ::getTopIssue , Comparator .comparing (Issue ::getSeverity ))
170
165
.thenComparing (DependencyTree ::getIssueCount )
171
166
.thenComparing (DependencyTree ::getChildCount )
@@ -193,7 +188,7 @@ private void setTopIssue() {
193
188
public Set <License > processTreeViolatedLicenses () {
194
189
setViolatedLicensesComponent ();
195
190
violatedLicenses .addAll (licenses .stream ().filter (License ::isViolate ).collect (Collectors .toSet ()));
196
- getChildren ().forEach (child -> violatedLicenses .addAll ((( DependencyTree ) child ) .processTreeViolatedLicenses ()));
191
+ getChildren ().forEach (child -> violatedLicenses .addAll (child .processTreeViolatedLicenses ()));
197
192
return violatedLicenses ;
198
193
}
199
194
@@ -231,7 +226,7 @@ public DependencyTree find(String componentId) {
231
226
return this ;
232
227
}
233
228
return getChildren ().stream ()
234
- .map (child -> (( DependencyTree ) child ) .find (componentId ))
229
+ .map (child -> child .find (componentId ))
235
230
.filter (Objects ::nonNull )
236
231
.findAny ()
237
232
.orElse (null );
0 commit comments