Clover Coverage Report
Coverage timestamp: Fri May 24 2013 13:47:27 UTC
52   126   10   6.5
4   74   0.19   8
8     1.25  
1    
 
  EnumeratorTest       Line # 25 52 10 100% 1.0
 
  (6)
 
1    /* This file is part of the project "Hilbert II" - http://www.qedeq.org
2    *
3    * Copyright 2000-2013, Michael Meyling <mime@qedeq.org>.
4    *
5    * "Hilbert II" is free software; you can redistribute
6    * it and/or modify it under the terms of the GNU General Public
7    * License as published by the Free Software Foundation; either
8    * version 2 of the License, or (at your option) any later version.
9    *
10    * This program is distributed in the hope that it will be useful,
11    * but WITHOUT ANY WARRANTY; without even the implied warranty of
12    * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13    * GNU General Public License for more details.
14    */
15   
16    package org.qedeq.base.utility;
17   
18    import org.qedeq.base.test.QedeqTestCase;
19   
20    /**
21    * Test {@link Enumerator}.
22    *
23    * @author Michael Meyling
24    */
 
25    public class EnumeratorTest extends QedeqTestCase {
26   
27    /*
28    * @see TestCase#setUp()
29    */
 
30  6 toggle protected void setUp() throws Exception {
31  6 super.setUp();
32    }
33   
34    /*
35    * @see TestCase#tearDown()
36    */
 
37  6 toggle protected void tearDown() throws Exception {
38  6 super.tearDown();
39    }
40   
41    /**
42    * Test constructors.
43    */
 
44  1 toggle public void testConstructors() {
45  1 Enumerator e1 = new Enumerator();
46  1 assertEquals(0, e1.getNumber());
47  1 Enumerator e2 = new Enumerator(0);
48  1 assertEquals(0, e2.getNumber());
49  1 Enumerator e3 = new Enumerator(-1);
50  1 assertEquals(-1, e3.getNumber());
51    }
52   
53    /**
54    * Test {@link Enumerator#increaseNumber()}.
55    */
 
56  1 toggle public void testIncrease() {
57  1 Enumerator e1 = new Enumerator();
58  1 e1.increaseNumber();
59  1 assertEquals(1, e1.getNumber());
60  1 Enumerator e2 = new Enumerator(0);
61  1 e2.increaseNumber();
62  1 assertEquals(1, e2.getNumber());
63  1 assertEquals(e1, e2);
64  1 assertNotSame(e1, e2);
65  1 Enumerator e3 = new Enumerator(-1);
66  1 e3.increaseNumber();
67  1 e3.increaseNumber();
68  1 assertEquals(e1, e3);
69  1 assertEquals(e2, e3);
70  1 assertEquals(1, e3.getNumber());
71  1 Enumerator e4 = new Enumerator(100);
72  1001 for (int i = 0; i < 1000; i++) {
73  1000 e4.increaseNumber();
74    }
75  1 assertEquals(1100, e4.getNumber());
76    }
77   
78    /**
79    * Test {@link Enumerator#increaseNumber()}.
80    */
 
81  1 toggle public void testToString() {
82  1 Enumerator e1 = new Enumerator();
83  1 assertEquals("0", e1.toString());
84  1 Enumerator e2 = new Enumerator(1234);
85  1 assertEquals("1234", e2.toString());
86    }
87   
88    /**
89    * Test {@link Enumerator#equals(Object)}.
90    */
 
91  1 toggle public void testEquals() {
92  1 Enumerator e1 = new Enumerator();
93  1 assertEquals(0, e1.getNumber());
94  1 Enumerator e2 = new Enumerator(0);
95  1 assertEquals(0, e2.getNumber());
96  1 assertEquals(e1, e2);
97  1 assertNotSame(e1, e2);
98  1 Enumerator e3 = new Enumerator(-1);
99  1 assertEquals(-1, e3.getNumber());
100  1 assertFalse(e1.equals(e3));
101  1 assertFalse(e3.equals(e1));
102  1 assertFalse(e2.equals(e3));
103  1 assertFalse(e3.equals(e2));
104  1 assertFalse(e3.equals(null));
105  1 assertFalse(e1.equals(new Integer(0)));
106    }
107   
108    /**
109    * Test {@link Enumerator#hashCode()}.
110    */
 
111  1 toggle public void testHashcode() {
112  111 for (int i = -10; i < 100; i++) {
113    // we assume a default implementation ...
114  110 Enumerator e = new Enumerator(i);
115  110 assertEquals(i, e.hashCode());
116    }
117    }
118   
 
119  1 toggle public void testReset() {
120  1 Enumerator e1 = new Enumerator();
121  1 e1.increaseNumber();
122  1 assertEquals(1, e1.getNumber());
123  1 e1.reset();
124  1 assertEquals(0, e1.getNumber());
125    }
126    }