@@ -101,72 +101,6 @@ void ArrayTest::testConstruction() {
101101 << " \n copy: " << a6[i]);
102102 }
103103
104- #ifdef QL_USE_DISPOSABLE
105-
106- // creation of disposable array
107- Array temp1 (size, value);
108- Disposable<Array> temp2 (temp1);
109- if (temp2.size () != size || !temp1.empty ())
110- BOOST_ERROR (" array not correctly moved into disposable array"
111- << " \n original size of source: " << size
112- << " \n current size of source: " << temp1.size ()
113- << " \n current size of target: " << temp2.size ());
114- for (i=0 ; i<size; i++) {
115- if (temp2[i] != value)
116- BOOST_ERROR (io::ordinal (i+1 ) << " element of disposable "
117- " not moved correctly"
118- << " \n required: " << value
119- << " \n resulting: " << temp2[i]);
120- }
121-
122- // copy constructor from disposable
123- Array a7 (temp2);
124- if (a7.size () != size || !temp2.empty ())
125- BOOST_ERROR (" disposable array not correctly moved into array"
126- << " \n original size of source: " << size
127- << " \n current size of source: " << temp2.size ()
128- << " \n current size of target: " << a7.size ());
129- for (i=0 ; i<size; i++) {
130- if (a7[i] != value)
131- BOOST_ERROR (io::ordinal (i+1 ) << " element not moved correctly"
132- << " \n required: " << value
133- << " \n resulting: " << a7[i]);
134- }
135-
136- // assignment
137- Array a8;
138- a8 = a7;
139- if (a8.size () != a7.size ())
140- BOOST_ERROR (" copy not of the same size as original"
141- << " \n original: " << a7.size ()
142- << " \n copy: " << a8.size ());
143- for (i=0 ; i<a7.size (); i++) {
144- if (a8[i] != a7[i])
145- BOOST_ERROR (io::ordinal (i+1 ) << " element of copy "
146- " not with same value as original"
147- << " \n original: " << a7[i]
148- << " \n copy: " << a8[i]);
149- }
150-
151- // assignment from disposable
152- Array temp3 (size, value);
153- Disposable<Array> temp4 (temp3);
154- Array a9;
155- a9 = temp4;
156- if (a9.size () != size || !temp4.empty ())
157- BOOST_ERROR (" disposable array not correctly moved into array"
158- << " \n original size of source: " << size
159- << " \n current size of source: " << temp4.size ()
160- << " \n current size of target: " << a9.size ());
161- for (i=0 ; i<size; i++) {
162- if (a9[i] != value)
163- BOOST_ERROR (io::ordinal (i+1 ) << " element not moved correctly"
164- << " \n required: " << value
165- << " \n resulting: " << a9[i]);
166- }
167-
168- #endif
169-
170104 // transform
171105 Array a10 (5 );
172106 for (i=0 ; i < a10.size (); i++) {
@@ -192,13 +126,13 @@ void ArrayTest::testArrayFunctions() {
192126 a[i] = std::sin (Real (i))+1.1 ;
193127 }
194128
195- QL_CONSTEXPR Real exponential = -2.3 ;
129+ constexpr double exponential = -2.3 ;
196130 const Array p = Pow (a, exponential);
197131 const Array e = Exp (a);
198132 const Array l = Log (a);
199133 const Array s = Sqrt (a);
200134
201- QL_CONSTEXPR Real tol = 10 *QL_EPSILON;
135+ constexpr double tol = 10 *QL_EPSILON;
202136 for (Size i=0 ; i < a.size (); ++i) {
203137 if (std::fabs (p[i]-std::pow (a[i], exponential)) > tol) {
204138 BOOST_FAIL (" Array function test Pow failed" );
@@ -221,19 +155,19 @@ void ArrayTest::testArrayResize() {
221155 Array a (10 ,1.0 ,1.0 );
222156
223157 for (Size i=0 ; i < 10 ; ++i)
224- BOOST_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
158+ QL_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
225159
226160 a.resize (5 );
227161 BOOST_CHECK (a.size () == 5 );
228162
229163 for (Size i=0 ; i < 5 ; ++i)
230- BOOST_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
164+ QL_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
231165
232166 a.resize (15 );
233167 BOOST_CHECK (a.size () == 15 );
234168
235169 for (Size i=0 ; i < 5 ; ++i)
236- BOOST_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
170+ QL_CHECK_CLOSE (a[i], Real (1 +i), 10 *QL_EPSILON);
237171
238172 const Array::const_iterator iter = a.begin ();
239173 a.resize (a.size ());
0 commit comments