- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 61 for High (0.02 sec)
-
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
private fun ByteString.binarySearch( labels: Array<ByteString>, labelIndex: Int, ): String? { var low = 0 var high = size var match: String? = null 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.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 8.5K bytes - Viewed (0) -
docs/lambda/README.md
``` Create a file `testobject` with some test data that will be transformed ``` cat > testobject << EOF MinIO is a High Performance Object Storage released under GNU Affero General Public License v3.0. It is API compatible with Amazon S3 cloud storage service. Use MinIO to build high performance infrastructure for machine learning, analytics and application data workloads. EOF ``` Upload this object to the bucket via `mc cp`
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 7.7K bytes - Viewed (0) -
src/test/java/jcifs/pac/PacDataInputStreamTest.java
long low = filetime.longValue(); long high = filetime.shiftRight(32).longValue(); // write little-endian data[0] = (byte) (low); data[1] = (byte) (low >> 8); data[2] = (byte) (low >> 16); data[3] = (byte) (low >> 24); data[4] = (byte) (high); data[5] = (byte) (high >> 8); data[6] = (byte) (high >> 16); data[7] = (byte) (high >> 24);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 9.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/expr_test.go
{"3/0", "division by zero"}, {"(1<<63)/0", "divide of value with high bit set"}, {"3%0", "modulo by zero"}, {"(1<<63)%0", "modulo of value with high bit set"}, {"3<<-4", "negative left shift count"}, {"3<<(1<<63)", "negative left shift count"}, {"3>>-4", "negative right shift count"}, {"3>>(1<<63)", "negative right shift count"}, {"(1<<63)>>2", "right shift of value with high bit set"}, {"(1<<62)>>2", ""},
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Aug 29 07:48:38 UTC 2023 - 3.2K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
position: Int, limit: Int, compare: (Int) -> Int, ): 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! } }
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 9K bytes - Viewed (0) -
guava/src/com/google/common/hash/Fingerprint2011.java
return val ^ (val >>> 47); } /** Implementation of Hash128to64 from util/hash/hash128to64.h */ @VisibleForTesting static long hash128to64(long high, long low) { long a = (low ^ high) * K3; a ^= a >>> 47; long b = (high ^ a) * K3; b ^= b >>> 47; b *= K3; return b; } /** * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
docs/throttle/README.md
## Examples ### Configuring connection limit
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 16 08:43:49 UTC 2024 - 1.5K bytes - Viewed (1) -
PULL_REQUESTS_ETIQUETTE.md
# MinIO Pull Request Guidelines These guidelines ensure high-quality commits in MinIO’s GitHub repositories, maintaining a clear, valuable commit history for our open-source projects. They apply to all contributors, fostering efficient reviews and robust code. ## Why Pull Requests? Pull Requests (PRs) drive quality in MinIO’s codebase by: - Enabling peer review without pair programming. - Documenting changes for future reference.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun May 25 16:32:03 UTC 2025 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
return val ^ (val >>> 47); } /** Implementation of Hash128to64 from util/hash/hash128to64.h */ @VisibleForTesting static long hash128to64(long high, long low) { long a = (low ^ high) * K3; a ^= a >>> 47; long b = (high ^ a) * K3; b ^= b >>> 47; b *= K3; return b; } /** * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
CITATION.cff
- given-names: Sebastián family-names: Ramírez email: ******@****.*** identifiers: repository-code: 'https://github.com/fastapi/fastapi' url: 'https://fastapi.tiangolo.com' abstract: >- FastAPI framework, high performance, easy to learn, fast to code, ready for production keywords: - fastapi - pydantic - starlette
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Jul 29 23:35:07 UTC 2024 - 614 bytes - Viewed (0)