/* * Copyright (c) 2011, 2022, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * 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 4900206 * @summary Test worst case behavior of exp, log, sin, cos, etc. * @build Tests * @build WorstCaseTests * @run main WorstCaseTests * @run main/othervm -Xcomp WorstCaseTests /** * Use "Table Maker's Dilemma" results from Jean-Michel Muller and * Vincent Lefèvre, to test the math library. See * http://perso.ens-lyon.fr/jean-michel.muller/TMD.html for original * test vectors from 2000 and see * http://perso.ens-lyon.fr/jean-michel.muller/TMDworstcases.pdf with * additional test vectors from 2003. The latter link also contains * some information about the methodology used to produce the test * vectors. * * Most of the Java math library methods tested here have a 1-ulp * error bound from their specifications. This implies the returned * value must be one of the two representable floating-point numbers * bracketing the exact result. The expected value in the test * vectors below is the truncation of the exact value. Therefore, the * computed result must either be that value or the value next larger * in magnitude. The hyperbolic transcendental functions sinh and cosh * have a larger 2.5 ulp error bound in their specification, but the * JDK implementation complies with a 1 ulp bound on the worst-case * values. Therefore, no addition leeway is afforded when testing * sinh and cosh. public class WorstCaseTests {private WorstCaseTests() {throw new AssertionError("No instances for you." );}public static void main(String... args) {int failures = 0;if (failures > 0) {"Testing worst cases incurred %d failures.%n" , failures);throw new RuntimeException();private static int testWorstExp() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testExpCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.exp" , input, Math::exp, expected, out);"StrictMath.exp" , input, StrictMath::exp, expected, out);return failures;private static int testWorstLog() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testLogCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.log" , input, Math::log, expected, out);"StrictMath.log" , input, StrictMath::log, expected, out);return failures;private static int testWorstSin() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testSinCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.sin" , input, Math::sin, expected, out);"StrictMath.sin" , input, StrictMath::sin, expected, out);return failures;private static int testWorstAsin() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testAsinCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.asin" , input, Math::asin, expected, out);"StrictMath.asin" , input, StrictMath::asin, expected, out);return failures;private static int testWorstCos() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testCosCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.cos" , input, Math::cos, expected, out);"StrictMath.cos" , input, StrictMath::cos, expected, out);return failures;private static int testWorstAcos() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testAcosCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.acos" , input, Math::acos, expected, out);"StrictMath.acos" , input, StrictMath::acos, expected, out);return failures;private static int testWorstTan() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testTanCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.tan" , input, Math::tan, expected, out);"StrictMath.tan" , input, StrictMath::tan, expected, out);return failures;private static int testWorstAtan() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testAtanCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.atan" , input, Math::atan, expected, out);"StrictMath.atan" , input, StrictMath::atan, expected, out);return failures;private static int testWorstPow2() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testPow2Case(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.pow2" , input, d -> Math.pow(2, d), expected, out);"StrictMath.pow2" , input, d -> StrictMath.pow(2, d), expected, out);return failures;// 2.5 ulp error bound in the specification; the implementation // does better on the tested values. private static int testWorstSinh() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testSinhCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.sinh" , input, Math::sinh, expected, out);"StrictMath.sinh" , input, StrictMath::sinh, expected, out);return failures;// 2.5 ulp error bound in the specification; the implementation // does better on the tested values. private static int testWorstCosh() {int failures = 0;double [][] testCases = {for (double [] testCase: testCases) {return failures;private static int testCoshCase(double input, double expected) {int failures = 0;double out = Tests.nextOut(expected);"Math.cosh" , input, Math::cosh, expected, out);"StrictMath.cosh" , input, StrictMath::cosh, expected, out);return failures;quality 88%
¤ Dauer der Verarbeitung: 0.3 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
