- Sort Score
- Num 10 results
- Language All
Results 1 - 6 of 6 for MID (0.19 seconds)
-
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixTrie.java
while (low <= high) { int mid = (low + high) >>> 1; int labelOffset = trieData.charAt(mid * NODE_SIZE); int cmp = compareLabel(label, labelOffset); if (cmp < 0) { high = mid - 1; } else if (cmp > 0) { low = mid + 1; } else { return mid; } } return -1; } /**Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 21:21:59 GMT 2026 - 9.1K bytes - Click Count (0) -
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) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
): Int { // Do the binary searching bit. var low = position var high = limit - 1 while (low <= high) { val mid = (low + high) / 2 val compareResult = compare(mid) when { compareResult < 0 -> high = mid - 1 compareResult > 0 -> low = mid + 1 else -> return mid // Match! } } return -low - 1 // insertionPoint is before the first element.Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 9K bytes - Click Count (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]) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 05:21:26 GMT 2026 - 7.3K bytes - Click Count (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]) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 05:21:26 GMT 2026 - 7.3K bytes - Click Count (0) -
src/main/webapp/js/purify.min.js
ight","href","id","image-rendering","in","in2","intercept","k","k1","k2","k3","k4","kerning","keypoints","keysplines","keytimes","lang","lengthadjust","letter-spacing","kernelmatrix","kernelunitlength","lighting-color","local","marker-end","marker-mid","marker-start","markerheight","markerunits","markerwidth","maskcontentunits","maskunits","max","mask","mask-type","media","method","mode","min","name","numoctaves","offset","operator","opacity","order","orient","orientation","origin","overflow","p...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 06:21:57 GMT 2026 - 22.7K bytes - Click Count (0)