/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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 General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 4074599 4939441
* @summary Tests for {Math, StrictMath}.log10
* @author Joseph D. Darcy
*/
public class Log10Tests {
private Log10Tests(){}
// Initialize shared random number generator
int failures=0;
return failures;
}
static int testLog10() {
int failures = 0;
double [][] testCases = {
{-8.0, NaNd},
{-1.0, NaNd},
{-0.0, -infinityD},
{+0.0, -infinityD},
{+1.0, 0.0},
};
// Test special cases
testCases[i][1]);
}
// Test log10(10^n) == n for integer n; 10^n, n < 0 is not
// exactly representable as a floating-point value -- up to
// 10^22 can be represented exactly
double testCase = 1.0;
for(int i = 0; i < 23; i++) {
testCase *= 10.0;
}
// Test for gross inaccuracy by comparing to log; should be
// within a few ulps of log(x)/log(10)
for(int i = 0; i < 10000; i++) {
continue; // avoid testing NaN and infinite values
else {
continue; // if log(input) overflowed, try again
else {
double result;
failures++;
", Math.log10 was more than 3 ulps different from " +
"log(input)/log(10): log10(input) = " + result +
"\tlog(input)/log(10) = " + expected);
}
failures++;
", StrictMath.log10 was more than 3 ulps different from " +
"log(input)/log(10): log10(input) = " + result +
"\tlog(input)/log(10) = " + expected);
}
}
}
}
// Test for accuracy and monotonicity near log10(1.0). From
// the Taylor expansion of log,
// log10(1+z) ~= (z -(z^2)/2)/LN_10;
{
double neighbors[] = new double[40];
double neighborsStrict[] = new double[40];
// Test inputs greater than 1.0.
double input[] = new double[40];
// Initialize input to the 40 consecutive double values
// "centered" at 1.0.
for(int i = 0; i < half; i++) {
if (i == 0) {
} else {
}
}
// Test accuracy.
z = input[i] - 1.0;
failures++;
", Math.log10(1+z) was more than 3 ulps different from " +
"(z-(z^2)/2)/ln(10): log10(input) = " + neighbors[i] +
"\texpected about = " + expected);
}
failures++;
", StrictMath.log10(1+z) was more than 3 ulps different from " +
"(z-(z^2)/2)/ln(10): log10(input) = " + neighborsStrict[i] +
"\texpected about = " + expected);
}
// Test monotonicity
if( i > 0) {
failures++;
" and prior value.");
}
failures++;
" and prior value.");
}
}
}
}
return failures;
}
int failures = 0;
if (failures > 0) {
+ failures + " failures.");
throw new RuntimeException();
}
}
}