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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/* ===========================================================
* JFreeChart : a free chart library for the Java(tm) platform
* ===========================================================
*
* (C) Copyright 2000-2013, by Object Refinery Limited and Contributors.
*
* Project Info: http://www.jfree.org/jfreechart/index.html
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 of the License, or
* (at your option) any later version.
*
* This library is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*
* [Oracle and Java are registered trademarks of Oracle and/or its affiliates.
* Other names may be trademarks of their respective owners.]
*
* ------------------------------
* PolynomialFunction2DTests.java
* ------------------------------
* (C) Copyright 2009, by Object Refinery Limited and Contributors.
*
* Original Author: David Gilbert (for Object Refinery Limited);
* Contributor(s): -;
*
* Changes
* -------
* 28-May-2009 : Version 1 (DG);
*
*/
package org.jfree.data.function;
import java.util.Arrays;
import org.jfree.chart.TestUtilities;
import org.junit.Test;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
/**
* Tests for the {@link PolynomialFunction2D} class.
*/
public class PolynomialFunction2DTest {
/**
* Some tests for the constructor.
*/
@Test
public void testConstructor() {
PolynomialFunction2D f = new PolynomialFunction2D(new double[] {1.0,
2.0});
assertTrue(Arrays.equals(new double[] {1.0, 2.0}, f.getCoefficients()));
boolean pass = false;
try {
f = new PolynomialFunction2D(null);
}
catch (IllegalArgumentException e) {
pass = true;
}
assertTrue(pass);
}
/**
* Some checks for the getCoefficients() method.
*/
@Test
public void testGetCoefficients() {
PolynomialFunction2D f = new PolynomialFunction2D(new double[] {1.0,
2.0});
double[] c = f.getCoefficients();
assertTrue(Arrays.equals(new double[] {1.0, 2.0}, c));
// make sure that modifying the returned array doesn't change the
// function
c[0] = 99.9;
assertTrue(Arrays.equals(new double[] {1.0, 2.0}, f.getCoefficients()));
}
/**
* Some checks for the getOrder() method.
*/
@Test
public void testGetOrder() {
PolynomialFunction2D f = new PolynomialFunction2D(new double[] {1.0,
2.0});
assertEquals(1, f.getOrder());
}
/**
* For datasets, the equals() method just checks keys and values.
*/
@Test
public void testEquals() {
PolynomialFunction2D f1 = new PolynomialFunction2D(new double[] {1.0,
2.0});
PolynomialFunction2D f2 = new PolynomialFunction2D(new double[] {1.0,
2.0});
assertTrue(f1.equals(f2));
f1 = new PolynomialFunction2D(new double[] {2.0, 3.0});
assertFalse(f1.equals(f2));
f2 = new PolynomialFunction2D(new double[] {2.0, 3.0});
assertTrue(f1.equals(f2));
}
/**
* Serialize an instance, restore it, and check for equality.
*/
@Test
public void testSerialization() {
PolynomialFunction2D f1 = new PolynomialFunction2D(new double[] {1.0,
2.0});
PolynomialFunction2D f2 = (PolynomialFunction2D)
TestUtilities.serialised(f1);
assertEquals(f1, f2);
}
/**
* Objects that are equal should have the same hash code otherwise FindBugs
* will tell on us...
*/
@Test
public void testHashCode() {
PolynomialFunction2D f1 = new PolynomialFunction2D(new double[] {1.0,
2.0});
PolynomialFunction2D f2 = new PolynomialFunction2D(new double[] {1.0,
2.0});
assertEquals(f1.hashCode(), f2.hashCode());
}
}
|
