Modified:
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/NumberUtils.java.html
==============================================================================
---
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/NumberUtils.java.html
(original)
+++
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/NumberUtils.java.html
Thu Aug 29 19:59:17 2024
@@ -784,16 +784,14 @@ public class NumberUtils {
public static byte max(final byte... array) {
// Validates input
<span class="fc" id="L786"> validateArray(array);</span>
-
// Finds and returns max
-<span class="fc" id="L789"> byte max = array[0];</span>
-<span class="fc bfc" id="L790" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L791" title="All 2 branches covered."> if
(array[i] > max) {</span>
-<span class="fc" id="L792"> max = array[i];</span>
+<span class="fc" id="L788"> byte max = array[0];</span>
+<span class="fc bfc" id="L789" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L790" title="All 2 branches covered."> if
(array[i] > max) {</span>
+<span class="fc" id="L791"> max = array[i];</span>
}
}
-
-<span class="fc" id="L796"> return max;</span>
+<span class="fc" id="L794"> return max;</span>
}
/**
@@ -805,13 +803,13 @@ public class NumberUtils {
* @return the largest of the values
*/
public static byte max(byte a, final byte b, final byte c) {
-<span class="fc bfc" id="L808" title="All 2 branches covered."> if (b
> a) {</span>
-<span class="fc" id="L809"> a = b;</span>
+<span class="fc bfc" id="L806" title="All 2 branches covered."> if (b
> a) {</span>
+<span class="fc" id="L807"> a = b;</span>
}
-<span class="fc bfc" id="L811" title="All 2 branches covered."> if (c
> a) {</span>
-<span class="fc" id="L812"> a = c;</span>
+<span class="fc bfc" id="L809" title="All 2 branches covered."> if (c
> a) {</span>
+<span class="fc" id="L810"> a = c;</span>
}
-<span class="fc" id="L814"> return a;</span>
+<span class="fc" id="L812"> return a;</span>
}
/**
@@ -826,20 +824,18 @@ public class NumberUtils {
*/
public static double max(final double... array) {
// Validates input
-<span class="fc" id="L829"> validateArray(array);</span>
-
+<span class="fc" id="L827"> validateArray(array);</span>
// Finds and returns max
-<span class="fc" id="L832"> double max = array[0];</span>
-<span class="pc bpc" id="L833" title="1 of 2 branches missed."> for
(int j = 1; j < array.length; j++) {</span>
-<span class="fc bfc" id="L834" title="All 2 branches covered."> if
(Double.isNaN(array[j])) {</span>
-<span class="fc" id="L835"> return Double.NaN;</span>
+<span class="fc" id="L829"> double max = array[0];</span>
+<span class="pc bpc" id="L830" title="1 of 2 branches missed."> for
(int j = 1; j < array.length; j++) {</span>
+<span class="fc bfc" id="L831" title="All 2 branches covered."> if
(Double.isNaN(array[j])) {</span>
+<span class="fc" id="L832"> return Double.NaN;</span>
}
-<span class="pc bpc" id="L837" title="1 of 2 branches missed."> if
(array[j] > max) {</span>
-<span class="nc" id="L838"> max = array[j];</span>
+<span class="pc bpc" id="L834" title="1 of 2 branches missed."> if
(array[j] > max) {</span>
+<span class="nc" id="L835"> max = array[j];</span>
}
}
-
-<span class="nc" id="L842"> return max;</span>
+<span class="nc" id="L838"> return max;</span>
}
/**
@@ -855,7 +851,7 @@ public class NumberUtils {
* @see IEEE754rUtils#max(double, double, double) for a version of this
method that handles NaN differently
*/
public static double max(final double a, final double b, final double c) {
-<span class="fc" id="L858"> return Math.max(Math.max(a, b), c);</span>
+<span class="fc" id="L854"> return Math.max(Math.max(a, b), c);</span>
}
/**
@@ -870,20 +866,18 @@ public class NumberUtils {
*/
public static float max(final float... array) {
// Validates input
-<span class="fc" id="L873"> validateArray(array);</span>
-
+<span class="fc" id="L869"> validateArray(array);</span>
// Finds and returns max
-<span class="fc" id="L876"> float max = array[0];</span>
-<span class="fc bfc" id="L877" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
-<span class="fc bfc" id="L878" title="All 2 branches covered."> if
(Float.isNaN(array[j])) {</span>
-<span class="fc" id="L879"> return Float.NaN;</span>
+<span class="fc" id="L871"> float max = array[0];</span>
+<span class="fc bfc" id="L872" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
+<span class="fc bfc" id="L873" title="All 2 branches covered."> if
(Float.isNaN(array[j])) {</span>
+<span class="fc" id="L874"> return Float.NaN;</span>
}
-<span class="fc bfc" id="L881" title="All 2 branches covered."> if
(array[j] > max) {</span>
-<span class="fc" id="L882"> max = array[j];</span>
+<span class="fc bfc" id="L876" title="All 2 branches covered."> if
(array[j] > max) {</span>
+<span class="fc" id="L877"> max = array[j];</span>
}
}
-
-<span class="fc" id="L886"> return max;</span>
+<span class="fc" id="L880"> return max;</span>
}
// must handle Long, Float, Integer, Float, Short,
@@ -934,7 +928,7 @@ public class NumberUtils {
* @see IEEE754rUtils#max(float, float, float) for a version of this
method that handles NaN differently
*/
public static float max(final float a, final float b, final float c) {
-<span class="fc" id="L937"> return Math.max(Math.max(a, b), c);</span>
+<span class="fc" id="L931"> return Math.max(Math.max(a, b), c);</span>
}
/**
@@ -948,17 +942,15 @@ public class NumberUtils {
*/
public static int max(final int... array) {
// Validates input
-<span class="fc" id="L951"> validateArray(array);</span>
-
+<span class="fc" id="L945"> validateArray(array);</span>
// Finds and returns max
-<span class="fc" id="L954"> int max = array[0];</span>
-<span class="fc bfc" id="L955" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
-<span class="fc bfc" id="L956" title="All 2 branches covered."> if
(array[j] > max) {</span>
-<span class="fc" id="L957"> max = array[j];</span>
+<span class="fc" id="L947"> int max = array[0];</span>
+<span class="fc bfc" id="L948" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
+<span class="fc bfc" id="L949" title="All 2 branches covered."> if
(array[j] > max) {</span>
+<span class="fc" id="L950"> max = array[j];</span>
}
}
-
-<span class="fc" id="L961"> return max;</span>
+<span class="fc" id="L953"> return max;</span>
}
/**
@@ -970,13 +962,13 @@ public class NumberUtils {
* @return the largest of the values
*/
public static int max(int a, final int b, final int c) {
-<span class="fc bfc" id="L973" title="All 2 branches covered."> if (b
> a) {</span>
-<span class="fc" id="L974"> a = b;</span>
+<span class="fc bfc" id="L965" title="All 2 branches covered."> if (b
> a) {</span>
+<span class="fc" id="L966"> a = b;</span>
}
-<span class="fc bfc" id="L976" title="All 2 branches covered."> if (c
> a) {</span>
-<span class="fc" id="L977"> a = c;</span>
+<span class="fc bfc" id="L968" title="All 2 branches covered."> if (c
> a) {</span>
+<span class="fc" id="L969"> a = c;</span>
}
-<span class="fc" id="L979"> return a;</span>
+<span class="fc" id="L971"> return a;</span>
}
/**
@@ -990,17 +982,15 @@ public class NumberUtils {
*/
public static long max(final long... array) {
// Validates input
-<span class="fc" id="L993"> validateArray(array);</span>
-
+<span class="fc" id="L985"> validateArray(array);</span>
// Finds and returns max
-<span class="fc" id="L996"> long max = array[0];</span>
-<span class="fc bfc" id="L997" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
-<span class="fc bfc" id="L998" title="All 2 branches covered."> if
(array[j] > max) {</span>
-<span class="fc" id="L999"> max = array[j];</span>
+<span class="fc" id="L987"> long max = array[0];</span>
+<span class="fc bfc" id="L988" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
+<span class="fc bfc" id="L989" title="All 2 branches covered."> if
(array[j] > max) {</span>
+<span class="fc" id="L990"> max = array[j];</span>
}
}
-
-<span class="fc" id="L1003"> return max;</span>
+<span class="fc" id="L993"> return max;</span>
}
// 3 param max
@@ -1013,13 +1003,13 @@ public class NumberUtils {
* @return the largest of the values
*/
public static long max(long a, final long b, final long c) {
-<span class="fc bfc" id="L1016" title="All 2 branches covered."> if (b
> a) {</span>
-<span class="fc" id="L1017"> a = b;</span>
+<span class="fc bfc" id="L1006" title="All 2 branches covered."> if (b
> a) {</span>
+<span class="fc" id="L1007"> a = b;</span>
}
-<span class="fc bfc" id="L1019" title="All 2 branches covered."> if (c
> a) {</span>
-<span class="fc" id="L1020"> a = c;</span>
+<span class="fc bfc" id="L1009" title="All 2 branches covered."> if (c
> a) {</span>
+<span class="fc" id="L1010"> a = c;</span>
}
-<span class="fc" id="L1022"> return a;</span>
+<span class="fc" id="L1012"> return a;</span>
}
/**
@@ -1033,17 +1023,16 @@ public class NumberUtils {
*/
public static short max(final short... array) {
// Validates input
-<span class="fc" id="L1036"> validateArray(array);</span>
+<span class="fc" id="L1026"> validateArray(array);</span>
// Finds and returns max
-<span class="fc" id="L1039"> short max = array[0];</span>
-<span class="fc bfc" id="L1040" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1041" title="All 2 branches covered."> if
(array[i] > max) {</span>
-<span class="fc" id="L1042"> max = array[i];</span>
+<span class="fc" id="L1029"> short max = array[0];</span>
+<span class="fc bfc" id="L1030" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1031" title="All 2 branches covered."> if
(array[i] > max) {</span>
+<span class="fc" id="L1032"> max = array[i];</span>
}
}
-
-<span class="fc" id="L1046"> return max;</span>
+<span class="fc" id="L1035"> return max;</span>
}
/**
@@ -1055,13 +1044,13 @@ public class NumberUtils {
* @return the largest of the values
*/
public static short max(short a, final short b, final short c) {
-<span class="fc bfc" id="L1058" title="All 2 branches covered."> if (b
> a) {</span>
-<span class="fc" id="L1059"> a = b;</span>
+<span class="fc bfc" id="L1047" title="All 2 branches covered."> if (b
> a) {</span>
+<span class="fc" id="L1048"> a = b;</span>
}
-<span class="fc bfc" id="L1061" title="All 2 branches covered."> if (c
> a) {</span>
-<span class="fc" id="L1062"> a = c;</span>
+<span class="fc bfc" id="L1050" title="All 2 branches covered."> if (c
> a) {</span>
+<span class="fc" id="L1051"> a = c;</span>
}
-<span class="fc" id="L1064"> return a;</span>
+<span class="fc" id="L1053"> return a;</span>
}
/**
@@ -1075,17 +1064,15 @@ public class NumberUtils {
*/
public static byte min(final byte... array) {
// Validates input
-<span class="fc" id="L1078"> validateArray(array);</span>
-
+<span class="fc" id="L1067"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1081"> byte min = array[0];</span>
-<span class="fc bfc" id="L1082" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1083" title="All 2 branches covered."> if
(array[i] < min) {</span>
-<span class="fc" id="L1084"> min = array[i];</span>
+<span class="fc" id="L1069"> byte min = array[0];</span>
+<span class="fc bfc" id="L1070" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1071" title="All 2 branches covered."> if
(array[i] < min) {</span>
+<span class="fc" id="L1072"> min = array[i];</span>
}
}
-
-<span class="fc" id="L1088"> return min;</span>
+<span class="fc" id="L1075"> return min;</span>
}
/**
@@ -1097,13 +1084,13 @@ public class NumberUtils {
* @return the smallest of the values
*/
public static byte min(byte a, final byte b, final byte c) {
-<span class="fc bfc" id="L1100" title="All 2 branches covered."> if (b
< a) {</span>
-<span class="fc" id="L1101"> a = b;</span>
+<span class="fc bfc" id="L1087" title="All 2 branches covered."> if (b
< a) {</span>
+<span class="fc" id="L1088"> a = b;</span>
}
-<span class="fc bfc" id="L1103" title="All 2 branches covered."> if (c
< a) {</span>
-<span class="fc" id="L1104"> a = c;</span>
+<span class="fc bfc" id="L1090" title="All 2 branches covered."> if (c
< a) {</span>
+<span class="fc" id="L1091"> a = c;</span>
}
-<span class="fc" id="L1106"> return a;</span>
+<span class="fc" id="L1093"> return a;</span>
}
/**
@@ -1118,20 +1105,19 @@ public class NumberUtils {
*/
public static double min(final double... array) {
// Validates input
-<span class="fc" id="L1121"> validateArray(array);</span>
+<span class="fc" id="L1108"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1124"> double min = array[0];</span>
-<span class="fc bfc" id="L1125" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1126" title="All 2 branches covered."> if
(Double.isNaN(array[i])) {</span>
-<span class="fc" id="L1127"> return Double.NaN;</span>
+<span class="fc" id="L1111"> double min = array[0];</span>
+<span class="fc bfc" id="L1112" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1113" title="All 2 branches covered."> if
(Double.isNaN(array[i])) {</span>
+<span class="fc" id="L1114"> return Double.NaN;</span>
}
-<span class="fc bfc" id="L1129" title="All 2 branches covered."> if
(array[i] < min) {</span>
-<span class="fc" id="L1130"> min = array[i];</span>
+<span class="fc bfc" id="L1116" title="All 2 branches covered."> if
(array[i] < min) {</span>
+<span class="fc" id="L1117"> min = array[i];</span>
}
}
-
-<span class="fc" id="L1134"> return min;</span>
+<span class="fc" id="L1120"> return min;</span>
}
/**
@@ -1147,7 +1133,7 @@ public class NumberUtils {
* @see IEEE754rUtils#min(double, double, double) for a version of this
method that handles NaN differently
*/
public static double min(final double a, final double b, final double c) {
-<span class="fc" id="L1150"> return Math.min(Math.min(a, b), c);</span>
+<span class="fc" id="L1136"> return Math.min(Math.min(a, b), c);</span>
}
/**
@@ -1162,20 +1148,19 @@ public class NumberUtils {
*/
public static float min(final float... array) {
// Validates input
-<span class="fc" id="L1165"> validateArray(array);</span>
+<span class="fc" id="L1151"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1168"> float min = array[0];</span>
-<span class="fc bfc" id="L1169" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1170" title="All 2 branches covered."> if
(Float.isNaN(array[i])) {</span>
-<span class="fc" id="L1171"> return Float.NaN;</span>
+<span class="fc" id="L1154"> float min = array[0];</span>
+<span class="fc bfc" id="L1155" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1156" title="All 2 branches covered."> if
(Float.isNaN(array[i])) {</span>
+<span class="fc" id="L1157"> return Float.NaN;</span>
}
-<span class="fc bfc" id="L1173" title="All 2 branches covered."> if
(array[i] < min) {</span>
-<span class="fc" id="L1174"> min = array[i];</span>
+<span class="fc bfc" id="L1159" title="All 2 branches covered."> if
(array[i] < min) {</span>
+<span class="fc" id="L1160"> min = array[i];</span>
}
}
-
-<span class="fc" id="L1178"> return min;</span>
+<span class="fc" id="L1163"> return min;</span>
}
/**
@@ -1191,7 +1176,7 @@ public class NumberUtils {
* @see IEEE754rUtils#min(float, float, float) for a version of this
method that handles NaN differently
*/
public static float min(final float a, final float b, final float c) {
-<span class="fc" id="L1194"> return Math.min(Math.min(a, b), c);</span>
+<span class="fc" id="L1179"> return Math.min(Math.min(a, b), c);</span>
}
/**
@@ -1205,17 +1190,15 @@ public class NumberUtils {
*/
public static int min(final int... array) {
// Validates input
-<span class="fc" id="L1208"> validateArray(array);</span>
-
+<span class="fc" id="L1193"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1211"> int min = array[0];</span>
-<span class="fc bfc" id="L1212" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
-<span class="fc bfc" id="L1213" title="All 2 branches covered."> if
(array[j] < min) {</span>
-<span class="fc" id="L1214"> min = array[j];</span>
+<span class="fc" id="L1195"> int min = array[0];</span>
+<span class="fc bfc" id="L1196" title="All 2 branches covered."> for
(int j = 1; j < array.length; j++) {</span>
+<span class="fc bfc" id="L1197" title="All 2 branches covered."> if
(array[j] < min) {</span>
+<span class="fc" id="L1198"> min = array[j];</span>
}
}
-
-<span class="fc" id="L1218"> return min;</span>
+<span class="fc" id="L1201"> return min;</span>
}
/**
@@ -1227,13 +1210,13 @@ public class NumberUtils {
* @return the smallest of the values
*/
public static int min(int a, final int b, final int c) {
-<span class="fc bfc" id="L1230" title="All 2 branches covered."> if (b
< a) {</span>
-<span class="fc" id="L1231"> a = b;</span>
+<span class="fc bfc" id="L1213" title="All 2 branches covered."> if (b
< a) {</span>
+<span class="fc" id="L1214"> a = b;</span>
}
-<span class="fc bfc" id="L1233" title="All 2 branches covered."> if (c
< a) {</span>
-<span class="fc" id="L1234"> a = c;</span>
+<span class="fc bfc" id="L1216" title="All 2 branches covered."> if (c
< a) {</span>
+<span class="fc" id="L1217"> a = c;</span>
}
-<span class="fc" id="L1236"> return a;</span>
+<span class="fc" id="L1219"> return a;</span>
}
/**
@@ -1247,17 +1230,15 @@ public class NumberUtils {
*/
public static long min(final long... array) {
// Validates input
-<span class="fc" id="L1250"> validateArray(array);</span>
-
+<span class="fc" id="L1233"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1253"> long min = array[0];</span>
-<span class="fc bfc" id="L1254" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1255" title="All 2 branches covered."> if
(array[i] < min) {</span>
-<span class="fc" id="L1256"> min = array[i];</span>
+<span class="fc" id="L1235"> long min = array[0];</span>
+<span class="fc bfc" id="L1236" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1237" title="All 2 branches covered."> if
(array[i] < min) {</span>
+<span class="fc" id="L1238"> min = array[i];</span>
}
}
-
-<span class="fc" id="L1260"> return min;</span>
+<span class="fc" id="L1241"> return min;</span>
}
// 3 param min
@@ -1270,13 +1251,13 @@ public class NumberUtils {
* @return the smallest of the values
*/
public static long min(long a, final long b, final long c) {
-<span class="fc bfc" id="L1273" title="All 2 branches covered."> if (b
< a) {</span>
-<span class="fc" id="L1274"> a = b;</span>
+<span class="fc bfc" id="L1254" title="All 2 branches covered."> if (b
< a) {</span>
+<span class="fc" id="L1255"> a = b;</span>
}
-<span class="fc bfc" id="L1276" title="All 2 branches covered."> if (c
< a) {</span>
-<span class="fc" id="L1277"> a = c;</span>
+<span class="fc bfc" id="L1257" title="All 2 branches covered."> if (c
< a) {</span>
+<span class="fc" id="L1258"> a = c;</span>
}
-<span class="fc" id="L1279"> return a;</span>
+<span class="fc" id="L1260"> return a;</span>
}
/**
@@ -1290,17 +1271,16 @@ public class NumberUtils {
*/
public static short min(final short... array) {
// Validates input
-<span class="fc" id="L1293"> validateArray(array);</span>
-
+<span class="fc" id="L1274"> validateArray(array);</span>
// Finds and returns min
-<span class="fc" id="L1296"> short min = array[0];</span>
-<span class="fc bfc" id="L1297" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
-<span class="fc bfc" id="L1298" title="All 2 branches covered."> if
(array[i] < min) {</span>
-<span class="fc" id="L1299"> min = array[i];</span>
+<span class="fc" id="L1276"> short min = array[0];</span>
+<span class="fc bfc" id="L1277" title="All 2 branches covered."> for
(int i = 1; i < array.length; i++) {</span>
+<span class="fc bfc" id="L1278" title="All 2 branches covered."> if
(array[i] < min) {</span>
+<span class="fc" id="L1279"> min = array[i];</span>
}
}
-<span class="fc" id="L1303"> return min;</span>
+<span class="fc" id="L1283"> return min;</span>
}
/**
@@ -1312,17 +1292,17 @@ public class NumberUtils {
* @return the smallest of the values
*/
public static short min(short a, final short b, final short c) {
-<span class="fc bfc" id="L1315" title="All 2 branches covered."> if (b
< a) {</span>
-<span class="fc" id="L1316"> a = b;</span>
+<span class="fc bfc" id="L1295" title="All 2 branches covered."> if (b
< a) {</span>
+<span class="fc" id="L1296"> a = b;</span>
}
-<span class="fc bfc" id="L1318" title="All 2 branches covered."> if (c
< a) {</span>
-<span class="fc" id="L1319"> a = c;</span>
+<span class="fc bfc" id="L1298" title="All 2 branches covered."> if (c
< a) {</span>
+<span class="fc" id="L1299"> a = c;</span>
}
-<span class="fc" id="L1321"> return a;</span>
+<span class="fc" id="L1301"> return a;</span>
}
/**
- * Convert a {@link String} to a {@code byte}, returning
+ * Converts a {@link String} to a {@code byte}, returning
* {@code zero} if the conversion fails.
*
* <p>If the string is {@code null}, {@code zero} is
returned.</p>
@@ -1339,11 +1319,11 @@ public class NumberUtils {
* @since 2.5
*/
public static byte toByte(final String str) {
-<span class="fc" id="L1342"> return toByte(str, (byte) 0);</span>
+<span class="fc" id="L1322"> return toByte(str, (byte) 0);</span>
}
/**
- * Convert a {@link String} to a {@code byte}, returning a
+ * Converts a {@link String} to a {@code byte}, returning a
* default value if the conversion fails.
*
* <p>If the string is {@code null}, the default value is
returned.</p>
@@ -1360,18 +1340,15 @@ public class NumberUtils {
* @since 2.5
*/
public static byte toByte(final String str, final byte defaultValue) {
-<span class="fc bfc" id="L1363" title="All 2 branches covered."> if
(str == null) {</span>
-<span class="fc" id="L1364"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1367"> return Byte.parseByte(str);</span>
-<span class="fc" id="L1368"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1369"> return defaultValue;</span>
+<span class="fc" id="L1344"> return Byte.parseByte(str);</span>
+<span class="fc" id="L1345"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1346"> return defaultValue;</span>
}
}
/**
- * Convert a {@link BigDecimal} to a {@code double}.
+ * Converts a {@link BigDecimal} to a {@code double}.
*
* <p>If the {@link BigDecimal} {@code value} is
* {@code null}, then the specified default value is returned.</p>
@@ -1387,11 +1364,11 @@ public class NumberUtils {
* @since 3.8
*/
public static double toDouble(final BigDecimal value) {
-<span class="fc" id="L1390"> return toDouble(value, 0.0d);</span>
+<span class="fc" id="L1367"> return toDouble(value, 0.0d);</span>
}
/**
- * Convert a {@link BigDecimal} to a {@code double}.
+ * Converts a {@link BigDecimal} to a {@code double}.
*
* <p>If the {@link BigDecimal} {@code value} is
* {@code null}, then the specified default value is returned.</p>
@@ -1408,11 +1385,11 @@ public class NumberUtils {
* @since 3.8
*/
public static double toDouble(final BigDecimal value, final double
defaultValue) {
-<span class="fc bfc" id="L1411" title="All 2 branches covered."> return
value == null ? defaultValue : value.doubleValue();</span>
+<span class="fc bfc" id="L1388" title="All 2 branches covered."> return
value == null ? defaultValue : value.doubleValue();</span>
}
/**
- * Convert a {@link String} to a {@code double}, returning
+ * Converts a {@link String} to a {@code double}, returning
* {@code 0.0d} if the conversion fails.
*
* <p>If the string {@code str} is {@code null},
@@ -1430,11 +1407,11 @@ public class NumberUtils {
* @since 2.1
*/
public static double toDouble(final String str) {
-<span class="fc" id="L1433"> return toDouble(str, 0.0d);</span>
+<span class="fc" id="L1410"> return toDouble(str, 0.0d);</span>
}
/**
- * Convert a {@link String} to a {@code double}, returning a
+ * Converts a {@link String} to a {@code double}, returning a
* default value if the conversion fails.
*
* <p>If the string {@code str} is {@code null}, the default
@@ -1453,18 +1430,15 @@ public class NumberUtils {
* @since 2.1
*/
public static double toDouble(final String str, final double defaultValue)
{
-<span class="fc bfc" id="L1456" title="All 2 branches covered."> if (str
== null) {</span>
-<span class="fc" id="L1457"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1460"> return Double.parseDouble(str);</span>
-<span class="fc" id="L1461"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1462"> return defaultValue;</span>
+<span class="fc" id="L1434"> return Double.parseDouble(str);</span>
+<span class="fc" id="L1435"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1436"> return defaultValue;</span>
}
}
/**
- * Convert a {@link String} to a {@code float}, returning
+ * Converts a {@link String} to a {@code float}, returning
* {@code 0.0f} if the conversion fails.
*
* <p>If the string {@code str} is {@code null},
@@ -1482,11 +1456,11 @@ public class NumberUtils {
* @since 2.1
*/
public static float toFloat(final String str) {
-<span class="fc" id="L1485"> return toFloat(str, 0.0f);</span>
+<span class="fc" id="L1459"> return toFloat(str, 0.0f);</span>
}
/**
- * Convert a {@link String} to a {@code float}, returning a
+ * Converts a {@link String} to a {@code float}, returning a
* default value if the conversion fails.
*
* <p>If the string {@code str} is {@code null}, the default
@@ -1505,18 +1479,15 @@ public class NumberUtils {
* @since 2.1
*/
public static float toFloat(final String str, final float defaultValue) {
-<span class="fc bfc" id="L1508" title="All 2 branches covered."> if (str
== null) {</span>
-<span class="fc" id="L1509"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1512"> return Float.parseFloat(str);</span>
-<span class="fc" id="L1513"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1514"> return defaultValue;</span>
+<span class="fc" id="L1483"> return Float.parseFloat(str);</span>
+<span class="fc" id="L1484"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1485"> return defaultValue;</span>
}
}
/**
- * Convert a {@link String} to an {@code int}, returning
+ * Converts a {@link String} to an {@code int}, returning
* {@code zero} if the conversion fails.
*
* <p>If the string is {@code null}, {@code zero} is
returned.</p>
@@ -1533,11 +1504,11 @@ public class NumberUtils {
* @since 2.1
*/
public static int toInt(final String str) {
-<span class="fc" id="L1536"> return toInt(str, 0);</span>
+<span class="fc" id="L1507"> return toInt(str, 0);</span>
}
/**
- * Convert a {@link String} to an {@code int}, returning a
+ * Converts a {@link String} to an {@code int}, returning a
* default value if the conversion fails.
*
* <p>If the string is {@code null}, the default value is
returned.</p>
@@ -1554,18 +1525,15 @@ public class NumberUtils {
* @since 2.1
*/
public static int toInt(final String str, final int defaultValue) {
-<span class="fc bfc" id="L1557" title="All 2 branches covered."> if
(str == null) {</span>
-<span class="fc" id="L1558"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1561"> return Integer.parseInt(str);</span>
-<span class="fc" id="L1562"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1563"> return defaultValue;</span>
+<span class="fc" id="L1529"> return Integer.parseInt(str);</span>
+<span class="fc" id="L1530"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1531"> return defaultValue;</span>
}
}
/**
- * Convert a {@link String} to a {@code long}, returning
+ * Converts a {@link String} to a {@code long}, returning
* {@code zero} if the conversion fails.
*
* <p>If the string is {@code null}, {@code zero} is
returned.</p>
@@ -1582,11 +1550,11 @@ public class NumberUtils {
* @since 2.1
*/
public static long toLong(final String str) {
-<span class="fc" id="L1585"> return toLong(str, 0L);</span>
+<span class="fc" id="L1553"> return toLong(str, 0L);</span>
}
/**
- * Convert a {@link String} to a {@code long}, returning a
+ * Converts a {@link String} to a {@code long}, returning a
* default value if the conversion fails.
*
* <p>If the string is {@code null}, the default value is
returned.</p>
@@ -1603,18 +1571,15 @@ public class NumberUtils {
* @since 2.1
*/
public static long toLong(final String str, final long defaultValue) {
-<span class="fc bfc" id="L1606" title="All 2 branches covered."> if
(str == null) {</span>
-<span class="fc" id="L1607"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1610"> return Long.parseLong(str);</span>
-<span class="fc" id="L1611"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1612"> return defaultValue;</span>
+<span class="fc" id="L1575"> return Long.parseLong(str);</span>
+<span class="fc" id="L1576"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1577"> return defaultValue;</span>
}
}
/**
- * Convert a {@link BigDecimal} to a {@link BigDecimal} with a scale of
+ * Converts a {@link BigDecimal} to a {@link BigDecimal} with a scale of
* two that has been rounded using {@code RoundingMode.HALF_EVEN}. If the
supplied
* {@code value} is null, then {@code BigDecimal.ZERO} is returned.
*
@@ -1626,11 +1591,11 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final BigDecimal value) {
-<span class="fc" id="L1629"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
+<span class="fc" id="L1594"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
}
/**
- * Convert a {@link BigDecimal} to a {@link BigDecimal} whose scale is the
+ * Converts a {@link BigDecimal} to a {@link BigDecimal} whose scale is the
* specified value with a {@link RoundingMode} applied. If the input
{@code value}
* is {@code null}, we simply return {@code BigDecimal.ZERO}.
*
@@ -1642,17 +1607,17 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final BigDecimal value, final
int scale, final RoundingMode roundingMode) {
-<span class="fc bfc" id="L1645" title="All 2 branches covered."> if
(value == null) {</span>
-<span class="fc" id="L1646"> return BigDecimal.ZERO;</span>
+<span class="fc bfc" id="L1610" title="All 2 branches covered."> if
(value == null) {</span>
+<span class="fc" id="L1611"> return BigDecimal.ZERO;</span>
}
-<span class="fc" id="L1648"> return value.setScale(</span>
+<span class="fc" id="L1613"> return value.setScale(</span>
scale,
-<span class="pc bpc" id="L1650" title="1 of 2 branches missed.">
roundingMode == null ? RoundingMode.HALF_EVEN : roundingMode</span>
+<span class="pc bpc" id="L1615" title="1 of 2 branches missed.">
roundingMode == null ? RoundingMode.HALF_EVEN : roundingMode</span>
);
}
/**
- * Convert a {@link Double} to a {@link BigDecimal} with a scale of
+ * Converts a {@link Double} to a {@link BigDecimal} with a scale of
* two that has been rounded using {@code RoundingMode.HALF_EVEN}. If the
supplied
* {@code value} is null, then {@code BigDecimal.ZERO} is returned.
*
@@ -1664,11 +1629,11 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final Double value) {
-<span class="fc" id="L1667"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
+<span class="fc" id="L1632"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
}
/**
- * Convert a {@link Double} to a {@link BigDecimal} whose scale is the
+ * Converts a {@link Double} to a {@link BigDecimal} whose scale is the
* specified value with a {@link RoundingMode} applied. If the input
{@code value}
* is {@code null}, we simply return {@code BigDecimal.ZERO}.
*
@@ -1680,18 +1645,18 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final Double value, final int
scale, final RoundingMode roundingMode) {
-<span class="fc bfc" id="L1683" title="All 2 branches covered."> if
(value == null) {</span>
-<span class="fc" id="L1684"> return BigDecimal.ZERO;</span>
+<span class="fc bfc" id="L1648" title="All 2 branches covered."> if
(value == null) {</span>
+<span class="fc" id="L1649"> return BigDecimal.ZERO;</span>
}
-<span class="fc" id="L1686"> return toScaledBigDecimal(</span>
-<span class="fc" id="L1687"> BigDecimal.valueOf(value),</span>
+<span class="fc" id="L1651"> return toScaledBigDecimal(</span>
+<span class="fc" id="L1652"> BigDecimal.valueOf(value),</span>
scale,
roundingMode
);
}
/**
- * Convert a {@link Float} to a {@link BigDecimal} with a scale of
+ * Converts a {@link Float} to a {@link BigDecimal} with a scale of
* two that has been rounded using {@code RoundingMode.HALF_EVEN}. If the
supplied
* {@code value} is null, then {@code BigDecimal.ZERO} is returned.
*
@@ -1703,11 +1668,11 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final Float value) {
-<span class="fc" id="L1706"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
+<span class="fc" id="L1671"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
}
/**
- * Convert a {@link Float} to a {@link BigDecimal} whose scale is the
+ * Converts a {@link Float} to a {@link BigDecimal} whose scale is the
* specified value with a {@link RoundingMode} applied. If the input
{@code value}
* is {@code null}, we simply return {@code BigDecimal.ZERO}.
*
@@ -1719,18 +1684,18 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final Float value, final int
scale, final RoundingMode roundingMode) {
-<span class="fc bfc" id="L1722" title="All 2 branches covered."> if
(value == null) {</span>
-<span class="fc" id="L1723"> return BigDecimal.ZERO;</span>
+<span class="fc bfc" id="L1687" title="All 2 branches covered."> if
(value == null) {</span>
+<span class="fc" id="L1688"> return BigDecimal.ZERO;</span>
}
-<span class="fc" id="L1725"> return toScaledBigDecimal(</span>
-<span class="fc" id="L1726"> BigDecimal.valueOf(value),</span>
+<span class="fc" id="L1690"> return toScaledBigDecimal(</span>
+<span class="fc" id="L1691"> BigDecimal.valueOf(value),</span>
scale,
roundingMode
);
}
/**
- * Convert a {@link String} to a {@link BigDecimal} with a scale of
+ * Converts a {@link String} to a {@link BigDecimal} with a scale of
* two that has been rounded using {@code RoundingMode.HALF_EVEN}. If the
supplied
* {@code value} is null, then {@code BigDecimal.ZERO} is returned.
*
@@ -1742,11 +1707,11 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final String value) {
-<span class="fc" id="L1745"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
+<span class="fc" id="L1710"> return toScaledBigDecimal(value,
INTEGER_TWO, RoundingMode.HALF_EVEN);</span>
}
/**
- * Convert a {@link String} to a {@link BigDecimal} whose scale is the
+ * Converts a {@link String} to a {@link BigDecimal} whose scale is the
* specified value with a {@link RoundingMode} applied. If the input
{@code value}
* is {@code null}, we simply return {@code BigDecimal.ZERO}.
*
@@ -1758,18 +1723,18 @@ public class NumberUtils {
* @since 3.8
*/
public static BigDecimal toScaledBigDecimal(final String value, final int
scale, final RoundingMode roundingMode) {
-<span class="fc bfc" id="L1761" title="All 2 branches covered."> if
(value == null) {</span>
-<span class="fc" id="L1762"> return BigDecimal.ZERO;</span>
+<span class="fc bfc" id="L1726" title="All 2 branches covered."> if
(value == null) {</span>
+<span class="fc" id="L1727"> return BigDecimal.ZERO;</span>
}
-<span class="fc" id="L1764"> return toScaledBigDecimal(</span>
-<span class="fc" id="L1765"> createBigDecimal(value),</span>
+<span class="fc" id="L1729"> return toScaledBigDecimal(</span>
+<span class="fc" id="L1730"> createBigDecimal(value),</span>
scale,
roundingMode
);
}
/**
- * Convert a {@link String} to a {@code short}, returning
+ * Converts a {@link String} to a {@code short}, returning
* {@code zero} if the conversion fails.
*
* <p>If the string is {@code null}, {@code zero} is
returned.</p>
@@ -1786,11 +1751,11 @@ public class NumberUtils {
* @since 2.5
*/
public static short toShort(final String str) {
-<span class="fc" id="L1789"> return toShort(str, (short) 0);</span>
+<span class="fc" id="L1754"> return toShort(str, (short) 0);</span>
}
/**
- * Convert a {@link String} to an {@code short}, returning a
+ * Converts a {@link String} to an {@code short}, returning a
* default value if the conversion fails.
*
* <p>If the string is {@code null}, the default value is
returned.</p>
@@ -1807,13 +1772,10 @@ public class NumberUtils {
* @since 2.5
*/
public static short toShort(final String str, final short defaultValue) {
-<span class="fc bfc" id="L1810" title="All 2 branches covered."> if
(str == null) {</span>
-<span class="fc" id="L1811"> return defaultValue;</span>
- }
try {
-<span class="fc" id="L1814"> return Short.parseShort(str);</span>
-<span class="fc" id="L1815"> } catch (final NumberFormatException nfe)
{</span>
-<span class="fc" id="L1816"> return defaultValue;</span>
+<span class="fc" id="L1776"> return Short.parseShort(str);</span>
+<span class="fc" id="L1777"> } catch (final RuntimeException e) {</span>
+<span class="fc" id="L1778"> return defaultValue;</span>
}
}
@@ -1825,26 +1787,26 @@ public class NumberUtils {
* @throws NullPointerException if {@code array} is {@code null}
*/
private static void validateArray(final Object array) {
-<span class="fc" id="L1828"> Objects.requireNonNull(array,
"array");</span>
-<span class="fc bfc" id="L1829" title="All 2 branches covered.">
Validate.isTrue(Array.getLength(array) != 0, "Array cannot be
empty.");</span>
-<span class="fc" id="L1830"> }</span>
+<span class="fc" id="L1790"> Objects.requireNonNull(array,
"array");</span>
+<span class="fc bfc" id="L1791" title="All 2 branches covered.">
Validate.isTrue(Array.getLength(array) != 0, "Array cannot be
empty.");</span>
+<span class="fc" id="L1792"> }</span>
private static boolean withDecimalsParsing(final String str, final int
beginIdx) {
-<span class="fc" id="L1833"> int decimalPoints = 0;</span>
-<span class="fc bfc" id="L1834" title="All 2 branches covered."> for
(int i = beginIdx; i < str.length(); i++) {</span>
-<span class="fc" id="L1835"> final char ch = str.charAt(i);</span>
-<span class="fc bfc" id="L1836" title="All 2 branches covered.">
final boolean isDecimalPoint = ch == '.';</span>
-<span class="fc bfc" id="L1837" title="All 2 branches covered."> if
(isDecimalPoint) {</span>
-<span class="fc" id="L1838"> decimalPoints++;</span>
+<span class="fc" id="L1795"> int decimalPoints = 0;</span>
+<span class="fc bfc" id="L1796" title="All 2 branches covered."> for
(int i = beginIdx; i < str.length(); i++) {</span>
+<span class="fc" id="L1797"> final char ch = str.charAt(i);</span>
+<span class="fc bfc" id="L1798" title="All 2 branches covered.">
final boolean isDecimalPoint = ch == '.';</span>
+<span class="fc bfc" id="L1799" title="All 2 branches covered."> if
(isDecimalPoint) {</span>
+<span class="fc" id="L1800"> decimalPoints++;</span>
}
-<span class="fc bfc" id="L1840" title="All 2 branches covered."> if
(decimalPoints > 1) {</span>
-<span class="fc" id="L1841"> return false;</span>
+<span class="fc bfc" id="L1802" title="All 2 branches covered."> if
(decimalPoints > 1) {</span>
+<span class="fc" id="L1803"> return false;</span>
}
-<span class="fc bfc" id="L1843" title="All 4 branches covered."> if
(!isDecimalPoint && !Character.isDigit(ch)) {</span>
-<span class="fc" id="L1844"> return false;</span>
+<span class="fc bfc" id="L1805" title="All 4 branches covered."> if
(!isDecimalPoint && !Character.isDigit(ch)) {</span>
+<span class="fc" id="L1806"> return false;</span>
}
}
-<span class="fc" id="L1847"> return true;</span>
+<span class="fc" id="L1809"> return true;</span>
}
/**
@@ -1857,8 +1819,8 @@ public class NumberUtils {
* @deprecated TODO Make private in 4.0.
*/
@Deprecated
-<span class="fc" id="L1860"> public NumberUtils() {</span>
+<span class="fc" id="L1822"> public NumberUtils() {</span>
// empty
-<span class="fc" id="L1862"> }</span>
+<span class="fc" id="L1824"> }</span>
}
</pre><div class="footer"><span class="right">Created with <a
href="http://www.jacoco.org/jacoco";>JaCoCo</a>
0.8.12.202403310830</span></div></body></html>
\ No newline at end of file
Modified:
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.html
==============================================================================
---
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.html
(original)
+++
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.html
Thu Aug 29 19:59:17 2024
@@ -1 +1 @@
-<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML
1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd";><html
xmlns="http://www.w3.org/1999/xhtml"; lang="en"><head><meta
http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link
rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link
rel="shortcut icon" href="../jacoco-resources/report.gif"
type="image/gif"/><title>org.apache.commons.lang3.math</title><script
type="text/javascript" src="../jacoco-resources/sort.js"></script></head><body
onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb"
id="breadcrumb"><span class="info"><a href="index.source.html"
class="el_source">Source Files</a><a href="../jacoco-sessions.html"
class="el_session">Sessions</a></span><a href="../index.html"
class="el_report">Apache Commons Lang</a> > <span
class="el_package">org.apache.commons.lang3.math</span></div><h1>org.apache.commons.lang3.math</h1><table
cla
ss="coverage" cellspacing="0" id="coveragetable"><thead><tr><td
class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down
sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td
class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td
class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td
class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td
class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td
class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td
class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td
class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="m" onclick="toggleSort(this)">Classes</t
d></tr></thead><tfoot><tr><td>Total</td><td class="bar">61 of 3,300</td><td
class="ctr2">98%</td><td class="bar">44 of 636</td><td class="ctr2">93%</td><td
class="ctr1">39</td><td class="ctr2">435</td><td class="ctr1">12</td><td
class="ctr2">750</td><td class="ctr1">0</td><td class="ctr2">116</td><td
class="ctr1">0</td><td class="ctr2">3</td></tr></tfoot><tbody><tr><td
id="a0"><a href="Fraction.html" class="el_class">Fraction</a></td><td
class="bar" id="b0"><img src="../jacoco-resources/redbar.gif" width="2"
height="10" title="32" alt="32"/><img src="../jacoco-resources/greenbar.gif"
width="81" height="10" title="1,230" alt="1,230"/></td><td class="ctr2"
id="c2">97%</td><td class="bar" id="d1"><img
src="../jacoco-resources/redbar.gif" width="4" height="10" title="16"
alt="16"/><img src="../jacoco-resources/greenbar.gif" width="48" height="10"
title="168" alt="168"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1"
id="f1">14</td><td class="ctr2" id="g1">127</td><td class="ctr1"
id="h0">6</td><td class="ctr2" id="i1">253</td><td class="ctr1"
id="j0">0</td><td class="ctr2" id="k1">35</td><td class="ctr1"
id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a2"><a
href="NumberUtils.html" class="el_class">NumberUtils</a></td><td class="bar"
id="b1"><img src="../jacoco-resources/redbar.gif" width="1" height="10"
title="27" alt="27"/><img src="../jacoco-resources/greenbar.gif" width="118"
height="10" title="1,792" alt="1,792"/></td><td class="ctr2"
id="c1">98%</td><td class="bar" id="d0"><img
src="../jacoco-resources/redbar.gif" width="7" height="10" title="26"
alt="26"/><img src="../jacoco-resources/greenbar.gif" width="112" height="10"
title="394" alt="394"/></td><td class="ctr2" id="e0">93%</td><td class="ctr1"
id="f0">23</td><td class="ctr2" id="g0">279</td><td class="ctr1"
id="h1">6</td><td class="ctr2" id="i0">447</td><td class="ctr1"
id="j1">0</td><td class="ctr2" id="k0">68</td><td class="ctr1"
id="l1">0</td><td class="ctr2" id="m1">1</td></tr>
<tr><td id="a1"><a href="IEEE754rUtils.html"
class="el_class">IEEE754rUtils</a></td><td class="bar" id="b2"><img
src="../jacoco-resources/greenbar.gif" width="14" height="10" title="217"
alt="217"/></td><td class="ctr2" id="c0">99%</td><td class="bar" id="d2"><img
src="../jacoco-resources/greenbar.gif" width="8" height="10" title="30"
alt="30"/></td><td class="ctr2" id="e1">93%</td><td class="ctr1"
id="f2">2</td><td class="ctr2" id="g2">29</td><td class="ctr1"
id="h2">0</td><td class="ctr2" id="i2">50</td><td class="ctr1"
id="j2">0</td><td class="ctr2" id="k2">13</td><td class="ctr1"
id="l2">0</td><td class="ctr2" id="m2">1</td></tr></tbody></table><div
class="footer"><span class="right">Created with <a
href="http://www.jacoco.org/jacoco";>JaCoCo</a>
0.8.12.202403310830</span></div></body></html>
\ No newline at end of file
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML
1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd";><html
xmlns="http://www.w3.org/1999/xhtml"; lang="en"><head><meta
http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link
rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link
rel="shortcut icon" href="../jacoco-resources/report.gif"
type="image/gif"/><title>org.apache.commons.lang3.math</title><script
type="text/javascript" src="../jacoco-resources/sort.js"></script></head><body
onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb"
id="breadcrumb"><span class="info"><a href="index.source.html"
class="el_source">Source Files</a><a href="../jacoco-sessions.html"
class="el_session">Sessions</a></span><a href="../index.html"
class="el_report">Apache Commons Lang</a> > <span
class="el_package">org.apache.commons.lang3.math</span></div><h1>org.apache.commons.lang3.math</h1><table
cla
ss="coverage" cellspacing="0" id="coveragetable"><thead><tr><td
class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down
sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td
class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td
class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td
class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td
class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td
class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td
class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td
class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td
class="sortable ctr2" id="m" onclick="toggleSort(this)">Classes</t
d></tr></thead><tfoot><tr><td>Total</td><td class="bar">61 of 3,276</td><td
class="ctr2">98%</td><td class="bar">44 of 624</td><td class="ctr2">92%</td><td
class="ctr1">39</td><td class="ctr2">429</td><td class="ctr1">12</td><td
class="ctr2">738</td><td class="ctr1">0</td><td class="ctr2">116</td><td
class="ctr1">0</td><td class="ctr2">3</td></tr></tfoot><tbody><tr><td
id="a0"><a href="Fraction.html" class="el_class">Fraction</a></td><td
class="bar" id="b0"><img src="../jacoco-resources/redbar.gif" width="2"
height="10" title="32" alt="32"/><img src="../jacoco-resources/greenbar.gif"
width="82" height="10" title="1,230" alt="1,230"/></td><td class="ctr2"
id="c2">97%</td><td class="bar" id="d1"><img
src="../jacoco-resources/redbar.gif" width="4" height="10" title="16"
alt="16"/><img src="../jacoco-resources/greenbar.gif" width="49" height="10"
title="168" alt="168"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1"
id="f1">14</td><td class="ctr2" id="g1">127</td><td class="ctr1"
id="h0">6</td><td class="ctr2" id="i1">253</td><td class="ctr1"
id="j0">0</td><td class="ctr2" id="k1">35</td><td class="ctr1"
id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a2"><a
href="NumberUtils.html" class="el_class">NumberUtils</a></td><td class="bar"
id="b1"><img src="../jacoco-resources/redbar.gif" width="1" height="10"
title="27" alt="27"/><img src="../jacoco-resources/greenbar.gif" width="118"
height="10" title="1,768" alt="1,768"/></td><td class="ctr2"
id="c1">98%</td><td class="bar" id="d0"><img
src="../jacoco-resources/redbar.gif" width="7" height="10" title="26"
alt="26"/><img src="../jacoco-resources/greenbar.gif" width="112" height="10"
title="382" alt="382"/></td><td class="ctr2" id="e1">93%</td><td class="ctr1"
id="f0">23</td><td class="ctr2" id="g0">273</td><td class="ctr1"
id="h1">6</td><td class="ctr2" id="i0">435</td><td class="ctr1"
id="j1">0</td><td class="ctr2" id="k0">68</td><td class="ctr1"
id="l1">0</td><td class="ctr2" id="m1">1</td></tr>
<tr><td id="a1"><a href="IEEE754rUtils.html"
class="el_class">IEEE754rUtils</a></td><td class="bar" id="b2"><img
src="../jacoco-resources/greenbar.gif" width="14" height="10" title="217"
alt="217"/></td><td class="ctr2" id="c0">99%</td><td class="bar" id="d2"><img
src="../jacoco-resources/greenbar.gif" width="8" height="10" title="30"
alt="30"/></td><td class="ctr2" id="e0">93%</td><td class="ctr1"
id="f2">2</td><td class="ctr2" id="g2">29</td><td class="ctr1"
id="h2">0</td><td class="ctr2" id="i2">50</td><td class="ctr1"
id="j2">0</td><td class="ctr2" id="k2">13</td><td class="ctr1"
id="l2">0</td><td class="ctr2" id="m2">1</td></tr></tbody></table><div
class="footer"><span class="right">Created with <a
href="http://www.jacoco.org/jacoco";>JaCoCo</a>
0.8.12.202403310830</span></div></body></html>
\ No newline at end of file
Modified:
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.source.html
==============================================================================
---
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.source.html
(original)
+++
websites/production/commons/content/proper/commons-lang/jacoco/org.apache.commons.lang3.math/index.source.html
Thu Aug 29 19:59:17 2024
@@ -1 +1 @@
-<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML
1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd";><html
xmlns="http://www.w3.org/1999/xhtml"; lang="en"><head><meta
http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link
rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link
rel="shortcut icon" href="../jacoco-resources/report.gif"
type="image/gif"/><title>org.apache.commons.lang3.math</title><script
type="text/javascript" src="../jacoco-resources/sort.js"></script></head><body
onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb"
id="breadcrumb"><span class="info"><a href="index.html"
class="el_class">Classes</a><a href="../jacoco-sessions.html"
class="el_session">Sessions</a></span><a href="../index.html"
class="el_report">Apache Commons Lang</a> > <span
class="el_package">org.apache.commons.lang3.math</span></div><h1>org.apache.commons.lang3.math</h1><table
class="coverage"
cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a"
onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b"
onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2"
id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d"
onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e"
onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g"
onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i"
onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k"
onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m"
onclick="toggleSort(this)">Classes</td></tr></thea
d><tfoot><tr><td>Total</td><td class="bar">61 of 3,300</td><td
class="ctr2">98%</td><td class="bar">44 of 636</td><td class="ctr2">93%</td><td
class="ctr1">39</td><td class="ctr2">435</td><td class="ctr1">12</td><td
class="ctr2">750</td><td class="ctr1">0</td><td class="ctr2">116</td><td
class="ctr1">0</td><td class="ctr2">3</td></tr></tfoot><tbody><tr><td
id="a0"><a href="Fraction.java.html"
class="el_source">Fraction.java</a></td><td class="bar" id="b0"><img
src="../jacoco-resources/redbar.gif" width="2" height="10" title="32"
alt="32"/><img src="../jacoco-resources/greenbar.gif" width="81" height="10"
title="1,230" alt="1,230"/></td><td class="ctr2" id="c2">97%</td><td
class="bar" id="d1"><img src="../jacoco-resources/redbar.gif" width="4"
height="10" title="16" alt="16"/><img src="../jacoco-resources/greenbar.gif"
width="48" height="10" title="168" alt="168"/></td><td class="ctr2"
id="e2">91%</td><td class="ctr1" id="f1">14</td><td class="ctr2"
id="g1">127</td><td class="ctr1" i
d="h0">6</td><td class="ctr2" id="i1">253</td><td class="ctr1"
id="j0">0</td><td class="ctr2" id="k1">35</td><td class="ctr1"
id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a2"><a
href="NumberUtils.java.html" class="el_source">NumberUtils.java</a></td><td
class="bar" id="b1"><img src="../jacoco-resources/redbar.gif" width="1"
height="10" title="27" alt="27"/><img src="../jacoco-resources/greenbar.gif"
width="118" height="10" title="1,792" alt="1,792"/></td><td class="ctr2"
id="c1">98%</td><td class="bar" id="d0"><img
src="../jacoco-resources/redbar.gif" width="7" height="10" title="26"
alt="26"/><img src="../jacoco-resources/greenbar.gif" width="112" height="10"
title="394" alt="394"/></td><td class="ctr2" id="e0">93%</td><td class="ctr1"
id="f0">23</td><td class="ctr2" id="g0">279</td><td class="ctr1"
id="h1">6</td><td class="ctr2" id="i0">447</td><td class="ctr1"
id="j1">0</td><td class="ctr2" id="k0">68</td><td class="ctr1"
id="l1">0</td><td class="ctr2" id="m1">1<
/td></tr><tr><td id="a1"><a href="IEEE754rUtils.java.html"
class="el_source">IEEE754rUtils.java</a></td><td class="bar" id="b2"><img
src="../jacoco-resources/greenbar.gif" width="14" height="10" title="217"
alt="217"/></td><td class="ctr2" id="c0">99%</td><td class="bar" id="d2"><img
src="../jacoco-resources/greenbar.gif" width="8" height="10" title="30"
alt="30"/></td><td class="ctr2" id="e1">93%</td><td class="ctr1"
id="f2">2</td><td class="ctr2" id="g2">29</td><td class="ctr1"
id="h2">0</td><td class="ctr2" id="i2">50</td><td class="ctr1"
id="j2">0</td><td class="ctr2" id="k2">13</td><td class="ctr1"
id="l2">0</td><td class="ctr2" id="m2">1</td></tr></tbody></table><div
class="footer"><span class="right">Created with <a
href="http://www.jacoco.org/jacoco";>JaCoCo</a>
0.8.12.202403310830</span></div></body></html>
\ No newline at end of file
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML
1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd";><html
xmlns="http://www.w3.org/1999/xhtml"; lang="en"><head><meta
http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link
rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link
rel="shortcut icon" href="../jacoco-resources/report.gif"
type="image/gif"/><title>org.apache.commons.lang3.math</title><script
type="text/javascript" src="../jacoco-resources/sort.js"></script></head><body
onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb"
id="breadcrumb"><span class="info"><a href="index.html"
class="el_class">Classes</a><a href="../jacoco-sessions.html"
class="el_session">Sessions</a></span><a href="../index.html"
class="el_report">Apache Commons Lang</a> > <span
class="el_package">org.apache.commons.lang3.math</span></div><h1>org.apache.commons.lang3.math</h1><table
class="coverage"
cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a"
onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b"
onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2"
id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d"
onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e"
onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g"
onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i"
onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k"
onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l"
onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m"
onclick="toggleSort(this)">Classes</td></tr></thea
d><tfoot><tr><td>Total</td><td class="bar">61 of 3,276</td><td
class="ctr2">98%</td><td class="bar">44 of 624</td><td class="ctr2">92%</td><td
class="ctr1">39</td><td class="ctr2">429</td><td class="ctr1">12</td><td
class="ctr2">738</td><td class="ctr1">0</td><td class="ctr2">116</td><td
class="ctr1">0</td><td class="ctr2">3</td></tr></tfoot><tbody><tr><td
id="a0"><a href="Fraction.java.html"
class="el_source">Fraction.java</a></td><td class="bar" id="b0"><img
src="../jacoco-resources/redbar.gif" width="2" height="10" title="32"
alt="32"/><img src="../jacoco-resources/greenbar.gif" width="82" height="10"
title="1,230" alt="1,230"/></td><td class="ctr2" id="c2">97%</td><td
class="bar" id="d1"><img src="../jacoco-resources/redbar.gif" width="4"
height="10" title="16" alt="16"/><img src="../jacoco-resources/greenbar.gif"
width="49" height="10" title="168" alt="168"/></td><td class="ctr2"
id="e2">91%</td><td class="ctr1" id="f1">14</td><td class="ctr2"
id="g1">127</td><td class="ctr1" i
d="h0">6</td><td class="ctr2" id="i1">253</td><td class="ctr1"
id="j0">0</td><td class="ctr2" id="k1">35</td><td class="ctr1"
id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a2"><a
href="NumberUtils.java.html" class="el_source">NumberUtils.java</a></td><td
class="bar" id="b1"><img src="../jacoco-resources/redbar.gif" width="1"
height="10" title="27" alt="27"/><img src="../jacoco-resources/greenbar.gif"
width="118" height="10" title="1,768" alt="1,768"/></td><td class="ctr2"
id="c1">98%</td><td class="bar" id="d0"><img
src="../jacoco-resources/redbar.gif" width="7" height="10" title="26"
alt="26"/><img src="../jacoco-resources/greenbar.gif" width="112" height="10"
title="382" alt="382"/></td><td class="ctr2" id="e1">93%</td><td class="ctr1"
id="f0">23</td><td class="ctr2" id="g0">273</td><td class="ctr1"
id="h1">6</td><td class="ctr2" id="i0">435</td><td class="ctr1"
id="j1">0</td><td class="ctr2" id="k0">68</td><td class="ctr1"
id="l1">0</td><td class="ctr2" id="m1">1<
/td></tr><tr><td id="a1"><a href="IEEE754rUtils.java.html"
class="el_source">IEEE754rUtils.java</a></td><td class="bar" id="b2"><img
src="../jacoco-resources/greenbar.gif" width="14" height="10" title="217"
alt="217"/></td><td class="ctr2" id="c0">99%</td><td class="bar" id="d2"><img
src="../jacoco-resources/greenbar.gif" width="8" height="10" title="30"
alt="30"/></td><td class="ctr2" id="e0">93%</td><td class="ctr1"
id="f2">2</td><td class="ctr2" id="g2">29</td><td class="ctr1"
id="h2">0</td><td class="ctr2" id="i2">50</td><td class="ctr1"
id="j2">0</td><td class="ctr2" id="k2">13</td><td class="ctr1"
id="l2">0</td><td class="ctr2" id="m2">1</td></tr></tbody></table><div
class="footer"><span class="right">Created with <a
href="http://www.jacoco.org/jacoco";>JaCoCo</a>
0.8.12.202403310830</span></div></body></html>
\ No newline at end of file
