- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for MID (0.13 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
boolean midLessThanFrom = (array[mid] < array[from]); boolean toLessThanFrom = (array[to] < array[from]); if (toLessThanMid == midLessThanFrom) { // Either array[to] < array[mid] < array[from] or array[from] <= array[mid] <= array[to]. swap(array, mid, from); } else if (toLessThanMid != toLessThanFrom) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)