1 /*
2 * Copyright (c) 1994, 2017, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
75 * returned. For exact results large in magnitude, one of the
76 * endpoints of the bracket may be infinite. Besides accuracy at
77 * individual arguments, maintaining proper relations between the
78 * method at different arguments is also important. Therefore, most
79 * methods with more than 0.5 ulp errors are required to be
80 * <i>semi-monotonic</i>: whenever the mathematical function is
81 * non-decreasing, so is the floating-point approximation, likewise,
82 * whenever the mathematical function is non-increasing, so is the
83 * floating-point approximation. Not all approximations that have 1
84 * ulp accuracy will automatically meet the monotonicity requirements.
85 *
86 * <p>
87 * The platform uses signed two's complement integer arithmetic with
88 * int and long primitive types. The developer should choose
89 * the primitive type to ensure that arithmetic operations consistently
90 * produce correct results, which in some cases means the operations
91 * will not overflow the range of values of the computation.
92 * The best practice is to choose the primitive type and algorithm to avoid
93 * overflow. In cases where the size is {@code int} or {@code long} and
94 * overflow errors need to be detected, the methods {@code addExact},
95 * {@code subtractExact}, {@code multiplyExact}, and {@code toIntExact}
96 * throw an {@code ArithmeticException} when the results overflow.
97 * For other arithmetic operations such as divide, absolute value,
98 * increment by one, decrement by one, and negation, overflow occurs only with
99 * a specific minimum or maximum value and should be checked against
100 * the minimum or maximum as appropriate.
101 *
102 * @author unascribed
103 * @author Joseph D. Darcy
104 * @since 1.0
105 */
106
107 public final class Math {
108
109 /**
110 * Don't let anyone instantiate this class.
111 */
112 private Math() {}
113
114 /**
115 * The {@code double} value that is closer than any other to
116 * <i>e</i>, the base of the natural logarithms.
117 */
118 public static final double E = 2.7182818284590452354;
119
120 /**
|
1 /*
2 * Copyright (c) 1994, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
75 * returned. For exact results large in magnitude, one of the
76 * endpoints of the bracket may be infinite. Besides accuracy at
77 * individual arguments, maintaining proper relations between the
78 * method at different arguments is also important. Therefore, most
79 * methods with more than 0.5 ulp errors are required to be
80 * <i>semi-monotonic</i>: whenever the mathematical function is
81 * non-decreasing, so is the floating-point approximation, likewise,
82 * whenever the mathematical function is non-increasing, so is the
83 * floating-point approximation. Not all approximations that have 1
84 * ulp accuracy will automatically meet the monotonicity requirements.
85 *
86 * <p>
87 * The platform uses signed two's complement integer arithmetic with
88 * int and long primitive types. The developer should choose
89 * the primitive type to ensure that arithmetic operations consistently
90 * produce correct results, which in some cases means the operations
91 * will not overflow the range of values of the computation.
92 * The best practice is to choose the primitive type and algorithm to avoid
93 * overflow. In cases where the size is {@code int} or {@code long} and
94 * overflow errors need to be detected, the methods {@code addExact},
95 * {@code subtractExact}, {@code multiplyExact}, {@code toIntExact},
96 * {@code incrementExact}, {@code decrementExact} and {@code negateExact}
97 * throw an {@code ArithmeticException} when the results overflow.
98 * For the arithmetic operations divide and absolute value, overflow
99 * occurs only with a specific minimum or maximum value and
100 * should be checked against the minimum or maximum as appropriate.
101 *
102 * @author unascribed
103 * @author Joseph D. Darcy
104 * @since 1.0
105 */
106
107 public final class Math {
108
109 /**
110 * Don't let anyone instantiate this class.
111 */
112 private Math() {}
113
114 /**
115 * The {@code double} value that is closer than any other to
116 * <i>e</i>, the base of the natural logarithms.
117 */
118 public static final double E = 2.7182818284590452354;
119
120 /**
|