1 package org.apache.maven.repository.metadata;
2
3 /*
4 * Licensed to the Apache Software Foundation (ASF) under one
5 * or more contributor license agreements. See the NOTICE file
6 * distributed with this work for additional information
7 * regarding copyright ownership. The ASF licenses this file
8 * to you under the Apache License, Version 2.0 (the
9 * "License"); you may not use this file except in compliance
10 * with the License. You may obtain a copy of the License at
11 *
12 * http://www.apache.org/licenses/LICENSE-2.0
13 *
14 * Unless required by applicable law or agreed to in writing,
15 * software distributed under the License is distributed on an
16 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
17 * KIND, either express or implied. See the License for the
18 * specific language governing permissions and limitations
19 * under the License.
20 */
21
22 import org.apache.maven.artifact.versioning.ArtifactVersion;
23 import org.apache.maven.artifact.versioning.DefaultArtifactVersion;
24 import org.codehaus.plexus.component.annotations.Component;
25 import org.codehaus.plexus.component.annotations.Configuration;
26
27 /**
28 * @author <a href="mailto:oleg@codehaus.org">Oleg Gusakov</a>
29 *
30 */
31 @Component( role = GraphConflictResolutionPolicy.class )
32 public class DefaultGraphConflictResolutionPolicy
33 implements GraphConflictResolutionPolicy
34 {
35 /**
36 * artifact, closer to the entry point, is selected
37 */
38 @Configuration( name = "closer-first", value = "true" )
39 private boolean closerFirst = true;
40
41 /**
42 * newer artifact is selected
43 */
44 @Configuration( name = "newer-first", value = "true" )
45 private boolean newerFirst = true;
46
47 public MetadataGraphEdge apply( MetadataGraphEdge e1, MetadataGraphEdge e2 )
48 {
49 int depth1 = e1.getDepth();
50 int depth2 = e2.getDepth();
51
52 if ( depth1 == depth2 )
53 {
54 ArtifactVersion v1 = new DefaultArtifactVersion( e1.getVersion() );
55 ArtifactVersion v2 = new DefaultArtifactVersion( e2.getVersion() );
56
57 if ( newerFirst )
58 {
59 return v1.compareTo( v2 ) > 0 ? e1 : e2;
60 }
61
62 return v1.compareTo( v2 ) > 0 ? e2 : e1;
63 }
64
65 if ( closerFirst )
66 {
67 return depth1 < depth2 ? e1 : e2;
68 }
69
70 return depth1 < depth2 ? e2 : e1;
71 }
72
73 }