- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 703 for faster (0.06 sec)
-
guava/src/com/google/common/primitives/Chars.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(char[] array, int distance) {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0) -
docs/en/docs/alternatives.md
It was one of the first extremely fast Python frameworks based on `asyncio`. It was made to be very similar to Flask. /// note | Technical Details It used <a href="https://github.com/MagicStack/uvloop" class="external-link" target="_blank">`uvloop`</a> instead of the default Python `asyncio` loop. That's what made it so fast. It clearly inspired Uvicorn and Starlette, that are currently faster than Sanic in open benchmarks. ///
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Oct 11 17:48:49 UTC 2025 - 23.6K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbTreeConnectionTest.java
return new SmbTreeConnection(ctx) { }; } @BeforeEach void setup() { when(ctx.getConfig()).thenReturn(config); // keep retries small for faster and deterministic tests when(config.getMaxRequestRetries()).thenReturn(2); when(config.isTraceResourceUsage()).thenReturn(false); // Mock credentials to avoid NullPointerException
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 13K bytes - Viewed (0) -
ci/official/utilities/code_check_full.bats
EOF find . | tr '[A-Z]' '[a-z]' | sort | uniq -d | tee $BATS_FILE_TMPDIR/repeats [[ ! -s $BATS_FILE_TMPDIR/repeats ]] } # It's unclear why, but running this on //tensorflow/... is faster than running # only on affected targets, usually. There are targets in //tensorflow/lite that # don't pass --nobuild, so they're on their own. # # Although buildifier checks for formatting as well, "bazel build nobuild"Registered: Tue Dec 30 12:39:10 UTC 2025 - Last Modified: Fri Dec 19 18:47:57 UTC 2025 - 13.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* data into it using methods like {@link Hasher#putBytes(byte[])}, and finally ask for the {@code * HashCode} when finished using {@link Hasher#hash}. (See an {@linkplain #newHasher example} of * this.) * * <p>If all you want to hash is a single byte array, string or {@code long} value, there are * convenient shortcut methods defined directly on {@link HashFunction} to make this easier. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* data into it using methods like {@link Hasher#putBytes(byte[])}, and finally ask for the {@code * HashCode} when finished using {@link Hasher#hash}. (See an {@linkplain #newHasher example} of * this.) * * <p>If all you want to hash is a single byte array, string or {@code long} value, there are * convenient shortcut methods defined directly on {@link HashFunction} to make this easier. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(int[] array, int distance) {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 31.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Longs.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(long[] array, int distance) {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 29K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/HeldCertificate.kt
this.maxIntermediateCas = maxIntermediateCas } /** * Configure the certificate to generate a 256-bit ECDSA key, which provides about 128 bits of * security. ECDSA keys are noticeably faster than RSA keys. * * This is the default configuration and has been since this API was introduced in OkHttp * 3.11.0. Note that the default may change in future releases. */ fun ecdsa256() =Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 21.6K bytes - Viewed (0) -
misc/go_android_exec/main.go
// still broken on our builders in 2023. Instead, append the exitcode to // the output and parse it from there. filter, exitStr := newExitCodeFilter(os.Stdout) args += "; echo -n " + exitStr + "$?" cmd := adbCmd("exec-out", args) cmd.Stdout = filter // If the adb subprocess somehow hangs, go test will kill this wrapper // and wait for our os.Stderr (and os.Stdout) to close as a result.
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Aug 21 17:46:57 UTC 2023 - 15.3K bytes - Viewed (0)