1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19 package org.apache.maven.repository.metadata;
20
21 import java.util.ArrayList;
22 import java.util.Arrays;
23 import java.util.Comparator;
24 import java.util.List;
25
26 import org.apache.maven.artifact.ArtifactScopeEnum;
27 import org.codehaus.plexus.component.annotations.Component;
28 import org.codehaus.plexus.component.annotations.Requirement;
29
30
31
32
33
34
35
36 @Component(role = ClasspathTransformation.class)
37 public class DefaultClasspathTransformation implements ClasspathTransformation {
38 @Requirement
39 GraphConflictResolver conflictResolver;
40
41
42 public ClasspathContainer transform(MetadataGraph dirtyGraph, ArtifactScopeEnum scope, boolean resolve)
43 throws MetadataGraphTransformationException {
44 try {
45 if (dirtyGraph == null || dirtyGraph.isEmpty()) {
46 return null;
47 }
48
49 MetadataGraph cleanGraph = conflictResolver.resolveConflicts(dirtyGraph, scope);
50
51 if (cleanGraph == null || cleanGraph.isEmpty()) {
52 return null;
53 }
54
55 ClasspathContainer cpc = new ClasspathContainer(scope);
56 if (cleanGraph.isEmptyEdges()) {
57
58 ArtifactMetadata amd = cleanGraph.getEntry().getMd();
59 cpc.add(amd);
60 } else {
61 ClasspathGraphVisitor v = new ClasspathGraphVisitor(cleanGraph, cpc);
62 MetadataGraphVertex entry = cleanGraph.getEntry();
63
64 v.visit(entry);
65 }
66
67 return cpc;
68 } catch (GraphConflictResolutionException e) {
69 throw new MetadataGraphTransformationException(e);
70 }
71 }
72
73
74
75
76
77
78 private class ClasspathGraphVisitor {
79 MetadataGraph graph;
80
81 ClasspathContainer cpc;
82
83 List<MetadataGraphVertex> visited;
84
85
86 protected ClasspathGraphVisitor(MetadataGraph cleanGraph, ClasspathContainer cpc) {
87 this.cpc = cpc;
88 this.graph = cleanGraph;
89
90 visited = new ArrayList<>(cleanGraph.getVertices().size());
91 }
92
93
94 protected void visit(MetadataGraphVertex node)
95 {
96 ArtifactMetadata md = node.getMd();
97 if (visited.contains(node)) {
98 return;
99 }
100
101 cpc.add(md);
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124 List<MetadataGraphEdge> exits = graph.getExcidentEdges(node);
125
126 if (exits != null && exits.size() > 0) {
127 MetadataGraphEdge[] sortedExits = exits.toArray(new MetadataGraphEdge[0]);
128 Arrays.sort(sortedExits, new Comparator<MetadataGraphEdge>() {
129 public int compare(MetadataGraphEdge e1, MetadataGraphEdge e2) {
130 if (e1.getDepth() == e2.getDepth()) {
131 if (e2.getPomOrder() == e1.getPomOrder()) {
132 return e1.getTarget()
133 .toString()
134 .compareTo(e2.getTarget().toString());
135 }
136 return e2.getPomOrder() - e1.getPomOrder();
137 }
138
139 return e2.getDepth() - e1.getDepth();
140 }
141 });
142
143 for (MetadataGraphEdge e : sortedExits) {
144 MetadataGraphVertex targetNode = e.getTarget();
145 targetNode.getMd().setArtifactScope(e.getScope());
146 targetNode.getMd().setWhy(e.getSource().getMd().toString());
147 visit(targetNode);
148 }
149 }
150 }
151
152
153 }
154
155
156 }