1 | /* |
2 | * Copyright (c) 2001-2009, Jean Tessier |
3 | * All rights reserved. |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
8 | * |
9 | * * Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * |
12 | * * Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
15 | * |
16 | * * Neither the name of Jean Tessier nor the names of his contributors |
17 | * may be used to endorse or promote products derived from this software |
18 | * without specific prior written permission. |
19 | * |
20 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
21 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
22 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
23 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR |
24 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
25 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
26 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
27 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
28 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
29 | * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
30 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
31 | */ |
32 | |
33 | package com.jeantessier.dependency; |
34 | |
35 | import java.util.*; |
36 | |
37 | import junit.framework.*; |
38 | |
39 | public class TestCycleComparator extends TestCase { |
40 | public void testCompareBasedOnLength() { |
41 | Node node = new PackageNode("node", true); |
42 | |
43 | List<Node> shortPath = new ArrayList<Node>(2); |
44 | shortPath.add(node); |
45 | shortPath.add(node); |
46 | |
47 | List<Node> longPath = new ArrayList<Node>(3); |
48 | longPath.add(node); |
49 | longPath.add(node); |
50 | longPath.add(node); |
51 | |
52 | Cycle shortCycle = new Cycle(shortPath); |
53 | Cycle longCycle = new Cycle(longPath); |
54 | |
55 | Comparator<Cycle> comparator = new CycleComparator(); |
56 | |
57 | assertTrue("2 < 3", comparator.compare(shortCycle, longCycle) < 0); |
58 | assertTrue("2 == 2", comparator.compare(shortCycle, shortCycle) == 0); |
59 | assertTrue("3 > 2", comparator.compare(longCycle, shortCycle) > 0); |
60 | } |
61 | |
62 | public void testCompareBasedOnPath() { |
63 | Node node1 = new PackageNode("node1", true); |
64 | Node node2 = new PackageNode("node2", true); |
65 | Node node3 = new PackageNode("node3", true); |
66 | |
67 | List<Node> path1 = new ArrayList<Node>(2); |
68 | path1.add(node1); |
69 | path1.add(node2); |
70 | |
71 | List<Node> path2 = new ArrayList<Node>(3); |
72 | path2.add(node2); |
73 | path2.add(node3); |
74 | |
75 | Cycle cycle1 = new Cycle(path1); |
76 | Cycle cycle2 = new Cycle(path2); |
77 | |
78 | Comparator<Cycle> comparator = new CycleComparator(); |
79 | |
80 | assertTrue("1 < 2", comparator.compare(cycle1, cycle2) < 0); |
81 | assertTrue("1 == 1", comparator.compare(cycle1, cycle1) == 0); |
82 | assertTrue("2 > 1", comparator.compare(cycle2, cycle1) > 0); |
83 | } |
84 | } |