1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
package org.apache.maven.repository.legacy.resolver.conflict;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
import java.util.Collections;
import org.apache.maven.artifact.resolver.ResolutionNode;
import org.apache.maven.repository.legacy.resolver.conflict.FarthestConflictResolver;
/**
* Tests <code>FarthestConflictResolver</code>.
*
* @author <a href="mailto:markhobson@gmail.com">Mark Hobson</a>
* @see FarthestConflictResolver
*/
public class FarthestConflictResolverTest
extends AbstractConflictResolverTest
{
// constructors -----------------------------------------------------------
public FarthestConflictResolverTest()
throws Exception
{
super("farthest");
}
// tests ------------------------------------------------------------------
/**
* Tests that <code>a:2.0</code> wins in the scenario:
* <pre>
* a:1.0
* b:1.0 -> a:2.0
* </pre>
*/
public void testDepth()
{
ResolutionNode a1n = new ResolutionNode( a1, Collections.EMPTY_LIST );
ResolutionNode b1n = new ResolutionNode( b1, Collections.EMPTY_LIST );
ResolutionNode a2n = new ResolutionNode( a2, Collections.EMPTY_LIST, b1n );
assertResolveConflict( a2n, a1n, a2n );
}
/**
* Tests that <code>a:2.0</code> wins in the scenario:
* <pre>
* b:1.0 -> a:2.0
* a:1.0
* </pre>
*/
public void testDepthReversed()
{
ResolutionNode b1n = new ResolutionNode( b1, Collections.EMPTY_LIST );
ResolutionNode a2n = new ResolutionNode( a2, Collections.EMPTY_LIST, b1n );
ResolutionNode a1n = new ResolutionNode( a1, Collections.EMPTY_LIST );
assertResolveConflict( a2n, a2n, a1n );
}
/**
* Tests that <code>a:1.0</code> wins in the scenario:
* <pre>
* a:1.0
* a:2.0
* </pre>
*/
public void testEqual()
{
ResolutionNode a1n = new ResolutionNode( a1, Collections.EMPTY_LIST );
ResolutionNode a2n = new ResolutionNode( a2, Collections.EMPTY_LIST );
assertResolveConflict( a1n, a1n, a2n );
}
/**
* Tests that <code>a:2.0</code> wins in the scenario:
* <pre>
* a:2.0
* a:1.0
* </pre>
*/
public void testEqualReversed()
{
ResolutionNode a2n = new ResolutionNode( a2, Collections.EMPTY_LIST );
ResolutionNode a1n = new ResolutionNode( a1, Collections.EMPTY_LIST );
assertResolveConflict( a2n, a2n, a1n );
}
}
|
