Clover Coverage Report
Coverage timestamp: Sat Sep 18 2010 04:09:52 UTC
Overview   Package   File
    FRAMES   NO FRAMES     
47   130   9   6.71
4   67   0.19   7
7     1.29  
1    
 
  EnumeratorTest       Line # 26 47 9 100% 1.0
 
  (5)
 
1    /* This file is part of the project "Hilbert II" - http://www.qedeq.org
2    *
3    * Copyright 2000-2010, 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    * @version $Revision: 1.1 $
24    * @author Michael Meyling
25    */
 
26    public class EnumeratorTest extends QedeqTestCase {
27   
28    /*
29    * @see TestCase#setUp()
30    */
 
31  5 toggle protected void setUp() throws Exception {
32  5 super.setUp();
33    }
34   
35    /*
36    * @see TestCase#tearDown()
37    */
 
38  5 toggle protected void tearDown() throws Exception {
39  5 super.tearDown();
40    }
41   
42    /**
43    * Test constructors.
44    *
45    * @throws Exception Test failure.
46    */
 
47  1 toggle public void testConstructors() throws Exception {
48  1 Enumerator e1 = new Enumerator();
49  1 assertEquals(0, e1.getNumber());
50  1 Enumerator e2 = new Enumerator(0);
51  1 assertEquals(0, e2.getNumber());
52  1 Enumerator e3 = new Enumerator(-1);
53  1 assertEquals(-1, e3.getNumber());
54    }
55   
56    /**
57    * Test {@link Enumerator#increaseNumber()}.
58    *
59    * @throws Exception Test failure.
60    */
 
61  1 toggle public void testIncrease() throws Exception {
62  1 Enumerator e1 = new Enumerator();
63  1 e1.increaseNumber();
64  1 assertEquals(1, e1.getNumber());
65  1 Enumerator e2 = new Enumerator(0);
66  1 e2.increaseNumber();
67  1 assertEquals(1, e2.getNumber());
68  1 assertEquals(e1, e2);
69  1 assertNotSame(e1, e2);
70  1 Enumerator e3 = new Enumerator(-1);
71  1 e3.increaseNumber();
72  1 e3.increaseNumber();
73  1 assertEquals(e1, e3);
74  1 assertEquals(e2, e3);
75  1 assertEquals(1, e3.getNumber());
76  1 Enumerator e4 = new Enumerator(100);
77  1001 for (int i = 0; i < 1000; i++) {
78  1000 e4.increaseNumber();
79    }
80  1 assertEquals(1100, e4.getNumber());
81    }
82   
83    /**
84    * Test {@link Enumerator#increaseNumber()}.
85    *
86    * @throws Exception Test failure.
87    */
 
88  1 toggle public void testToString() throws Exception {
89  1 Enumerator e1 = new Enumerator();
90  1 assertEquals("0", e1.toString());
91  1 Enumerator e2 = new Enumerator(1234);
92  1 assertEquals("1234", e2.toString());
93    }
94   
95    /**
96    * Test {@link Enumerator#equals(Object)}.
97    *
98    * @throws Exception Test failure.
99    */
 
100  1 toggle public void testEquals() throws Exception {
101  1 Enumerator e1 = new Enumerator();
102  1 assertEquals(0, e1.getNumber());
103  1 Enumerator e2 = new Enumerator(0);
104  1 assertEquals(0, e2.getNumber());
105  1 assertEquals(e1, e2);
106  1 assertNotSame(e1, e2);
107  1 Enumerator e3 = new Enumerator(-1);
108  1 assertEquals(-1, e3.getNumber());
109  1 assertFalse(e1.equals(e3));
110  1 assertFalse(e3.equals(e1));
111  1 assertFalse(e2.equals(e3));
112  1 assertFalse(e3.equals(e2));
113  1 assertFalse(e3.equals(null));
114  1 assertFalse(e1.equals(new Integer(0)));
115    }
116   
117    /**
118    * Test {@link Enumerator#hashCode()}.
119    *
120    * @throws Exception Test failure.
121    */
 
122  1 toggle public void testHashcode() throws Exception {
123  111 for (int i = -10; i < 100; i++) {
124    // we assume a default implementation ...
125  110 Enumerator e = new Enumerator(i);
126  110 assertEquals(i, e.hashCode());
127    }
128    }
129   
130    }
 
CloverReport generated by Clover Code Coverage v2.3.1
Sat Sep 18 2010 04:09:52 UTC.		   Clover: Open Source License registered to qedeq.org .