1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19 package org.eclipse.aether.util.graph.visitor;
20
21 import java.util.ArrayList;
22 import java.util.HashMap;
23 import java.util.List;
24 import java.util.function.Consumer;
25
26 import org.eclipse.aether.ConfigurationProperties;
27 import org.eclipse.aether.graph.DependencyFilter;
28 import org.eclipse.aether.graph.DependencyNode;
29
30
31
32
33
34
35
36
37
38
39
40
41 public final class LevelOrderDependencyNodeConsumerVisitor extends AbstractDependencyNodeConsumerVisitor {
42
43 public static final String NAME = ConfigurationProperties.REPOSITORY_SYSTEM_DEPENDENCY_VISITOR_LEVELORDER;
44
45 private final HashMap<Integer, ArrayList<DependencyNode>> nodesPerLevel;
46
47 private final Stack<Boolean> visits;
48
49
50
51
52 public LevelOrderDependencyNodeConsumerVisitor(Consumer<DependencyNode> nodeConsumer) {
53 this(nodeConsumer, null);
54 }
55
56
57
58
59
60
61 public LevelOrderDependencyNodeConsumerVisitor(Consumer<DependencyNode> nodeConsumer, DependencyFilter filter) {
62 super(nodeConsumer, filter);
63 nodesPerLevel = new HashMap<>(16);
64 visits = new Stack<>();
65 }
66
67 @Override
68 protected boolean doVisitEnter(DependencyNode node) {
69 boolean visited = !setVisited(node);
70 visits.push(visited);
71 if (!visited) {
72 List<DependencyNode> nodesOnLevel = nodesPerLevel.computeIfAbsent(visits.size(), k -> new ArrayList<>());
73 if (acceptNode(node)) {
74 nodesOnLevel.add(node);
75 }
76 }
77 return !visited;
78 }
79
80 @Override
81 protected boolean doVisitLeave(DependencyNode node) {
82 Boolean visited = visits.pop();
83 if (visited) {
84 return true;
85 }
86 if (visits.isEmpty()) {
87 for (int l = 1; nodesPerLevel.containsKey(l); l++) {
88 nodesPerLevel.get(l).forEach(this::consumeNode);
89 }
90 }
91 return true;
92 }
93 }