File: Ieee754SpecialCaseTests.java

package info (click to toggle)
openjdk-21 21.0.8%2B9-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 823,976 kB
  • sloc: java: 5,613,338; xml: 1,643,607; cpp: 1,296,296; ansic: 420,291; asm: 404,850; objc: 20,994; sh: 15,271; javascript: 11,245; python: 6,895; makefile: 2,362; perl: 357; awk: 351; sed: 172; jsp: 24; csh: 3
file content (130 lines) | stat: -rw-r--r-- 4,265 bytes parent folder | download | duplicates (11)
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
/*
 * 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 8240632
 * @summary Test special cases of IEEE 754 recommended ops not otherwise tested
 * @build Tests
 * @build Ieee754SpecialCaseTests
 * @run main Ieee754SpecialCaseTests
 */

public class Ieee754SpecialCaseTests {
    private Ieee754SpecialCaseTests() {throw new AssertionError("No instances for you.");}

    public static void main(String... args) {
        int failures = 0;

        failures += testSpecialCos();
        failures += testSpecialAcos();
        failures += testSpecialAtan();
        failures += testSpecialLog();

        if (failures > 0) {
            System.err.printf("Testing special cases incurred %d failures.%n", failures);
            throw new RuntimeException();
        }
    }
    private static int testSpecialCos() {
        int failures = 0;
        double [][] testCases = {
            {+0.0,    1.0},
            {-0.0,    1.0},
        };

        for(double[] testCase: testCases) {
            failures += testCosCase(testCase[0], testCase[1]);
        }

        return failures;
    }

    private static int testCosCase(double input, double expected) {
        int failures = 0;
        failures += Tests.test("Math.cos",       input, Math::cos,       expected);
        failures += Tests.test("StrictMath.cos", input, StrictMath::cos, expected);
        return failures;
    }

    private static int testSpecialAcos() {
        int failures = 0;
        double [][] testCases = {
            {1.0,    0.0},
        };

        for(double[] testCase: testCases) {
            failures += testAcosCase(testCase[0], testCase[1]);
        }

        return failures;
    }

    private static int testAcosCase(double input, double expected) {
        int failures = 0;
        failures += Tests.test("Math.acos",       input, Math::acos,       expected);
        failures += Tests.test("StrictMath.acos", input, StrictMath::acos, expected);
        return failures;
    }

    private static int testSpecialAtan() {
        int failures = 0;
        double [][] testCases = {
            {Double.POSITIVE_INFINITY,    +Math.PI/2.0},
            {Double.NEGATIVE_INFINITY,    -Math.PI/2.0},
        };

        for(double[] testCase: testCases) {
            failures += testAtanCase(testCase[0], testCase[1]);
        }

        return failures;
    }

    private static int testAtanCase(double input, double expected) {
        int failures = 0;
        failures += Tests.test("Math.atan",       input, Math::atan,       expected);
        failures += Tests.test("StrictMath.atan", input, StrictMath::atan, expected);
        return failures;
    }

    private static int testSpecialLog() {
        int failures = 0;
        double [][] testCases = {
            {1.0,    +0.0},
        };

        for(double[] testCase: testCases) {
            failures += testLogCase(testCase[0], testCase[1]);
        }

        return failures;
    }

    private static int testLogCase(double input, double expected) {
        int failures = 0;
        failures += Tests.test("Math.log",       input, Math::log,       expected);
        failures += Tests.test("StrictMath.log", input, StrictMath::log, expected);
        return failures;
    }
}