- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for Koss (0.12 sec)
-
android/guava/src/com/google/common/math/DoubleMath.java
// The upper bound on the length of an array and the bounds on the int values mean that, in // this case only, we can compute the sum as a long without risking overflow or loss of // precision. So we do that, as it's slightly quicker than the Knuth algorithm. long sum = 0; for (int index = 0; index < values.length; ++index) { sum += values[index]; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0)