- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 43 for MID (0.18 sec)
-
src/main/java/jcifs/smb1/smb1/SmbException.java
while( max >= min ) { int mid = (min + max) / 2; if( errcode > NT_STATUS_CODES[mid] ) { min = mid + 1; } else if( errcode < NT_STATUS_CODES[mid] ) { max = mid - 1; } else { return NT_STATUS_MESSAGES[mid]; } } } else { int min = 0;
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 5.5K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
while (low < high) { var mid = (low + high) / 2 // Search for a '\n' that marks the start of a value. Don't go back past the start of the // array. while (mid > -1 && this[mid] != '\n'.code.toByte()) { mid-- } mid++ // Now look for the ending '\n'. var end = 1 while (this[mid + end] != '\n'.code.toByte()) { end++
Plain Text - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.7K bytes - Viewed (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) {
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) -
src/main/java/jcifs/dcerpc/DcerpcException.java
while ( max >= min ) { int mid = ( min + max ) / 2; if ( errcode > DCERPC_FAULT_CODES[ mid ] ) { min = mid + 1; } else if ( errcode < DCERPC_FAULT_CODES[ mid ] ) { max = mid - 1; } else { return DCERPC_FAULT_MESSAGES[ mid ]; } }
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun May 17 09:02:44 GMT 2020 - 2.4K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/DcerpcException.java
while (max >= min) { int mid = (min + max) / 2; if (errcode > DCERPC_FAULT_CODES[mid]) { min = mid + 1; } else if (errcode < DCERPC_FAULT_CODES[mid]) { max = mid - 1; } else { return DCERPC_FAULT_MESSAGES[mid]; } } return "0x" + Hexdump.toHexString(errcode, 8);
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 2.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
/* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0) -
okhttp/src/main/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.
Plain Text - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Tue Apr 02 11:39:58 GMT 2024 - 9K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/ServerMessageBlock2.java
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun Sep 30 10:47:31 GMT 2018 - 19.9K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/Smb2CancelRequest.java
/** * @param config * @param mid * @param asyncId */ public Smb2CancelRequest ( Configuration config, long mid, long asyncId ) { super(config, SMB2_CANCEL); setMid(mid); setAsyncId(asyncId); if ( asyncId != 0 ) { addFlags(SMB2_FLAGS_ASYNC_COMMAND); } }
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 4.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
/* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0)