- Sort Score
- Result 10 results
- Languages All
Results 291 - 300 of 507 for await (0.02 sec)
-
mockwebserver/src/main/kotlin/mockwebserver3/Dispatcher.kt
import java.io.Closeable /** Handler for mock server requests. */ public abstract class Dispatcher : Closeable { /** * Returns a response to satisfy `request`. This method may block (for instance, to wait on * a CountdownLatch). */ @Throws(InterruptedException::class) public abstract fun dispatch(request: RecordedRequest): MockResponse /**
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Jun 20 11:46:46 UTC 2025 - 1.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
"R0.20, R0.10, R0.10, R0.10"); // #7 (cont.), note, this matches #5 } public void testBurstyAndUpdate() { RateLimiter rateLimiter = RateLimiter.create(1.0, stopwatch); rateLimiter.acquire(1); // no wait rateLimiter.acquire(1); // R1.00, to repay previous rateLimiter.setRate(2.0); // update the rate! rateLimiter.acquire(1); // R1.00, to repay previous (the previous was under the old rate!)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 21.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
"R0.20, R0.10, R0.10, R0.10"); // #7 (cont.), note, this matches #5 } public void testBurstyAndUpdate() { RateLimiter rateLimiter = RateLimiter.create(1.0, stopwatch); rateLimiter.acquire(1); // no wait rateLimiter.acquire(1); // R1.00, to repay previous rateLimiter.setRate(2.0); // update the rate! rateLimiter.acquire(1); // R1.00, to repay previous (the previous was under the old rate!)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 21.9K bytes - Viewed (0) -
cmd/erasure-object.go
if err != nil { return err } diskVersions[index] = resp.Sign dataDirs[index] = resp.OldDataDir return nil }, index) } // Wait for all renames to finish. errs := g.Wait() err := reduceWriteQuorumErrs(ctx, errs, objectOpIgnoredErrs, writeQuorum) if err != nil { dg := errgroup.WithNErrs(len(disks)) for index, nerr := range errs {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Sep 07 16:13:09 UTC 2025 - 80.4K bytes - Viewed (0) -
docs/fr/docs/alternatives.md
Il avait les meilleures performances d'après les benchmarks de l'époque (seulement surpassé par Starlette). Au départ, il ne disposait pas d'une interface web de documentation automatique de l'API, mais je savais que je pouvais lui ajouter une interface Swagger.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Nov 09 16:39:20 UTC 2024 - 27.5K bytes - Viewed (0) -
docs/throttle/README.md
MinIO server allows to throttle incoming requests: - limit the number of active requests allowed across the cluster - limit the wait duration for each request in the queue These values are enabled using server's configuration or environment variables. ## 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) -
cmd/bitrot-streaming.go
b.closeWithErr(err) } return n, err } func (b *streamingBitrotWriter) Close() error { // Close the underlying writer. // This will also flush the ring buffer if used. err := b.iow.Close() // Wait for all data to be written before returning else it causes race conditions. // Race condition is because of io.PipeWriter implementation. i.e consider the following // sequent of operations: // 1) pipe.Write()
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Jan 17 19:19:30 UTC 2025 - 6.2K bytes - Viewed (0) -
docs/smb3-features/02-persistent-handles-design.md
new IOException("Failed to reconnect after " + maxRetries + " attempts")); } return CompletableFuture.supplyAsync(() -> { try { // Wait before retry (except first attempt) if (attempt > 0) { Thread.sleep(retryDelay * attempt); } // Create reconnect context
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 31.6K bytes - Viewed (0) -
cmd/erasure-server-pool.go
g.Go(func() error { // Get the set where it would be placed. storageInfos[index] = getDiskInfos(ctx, pool.getHashedSet(object).getDisks()...) return nil }, index) } // Wait for the go routines. g.Wait() for i, zinfo := range storageInfos { if zinfo == nil { serverPools[i] = poolAvailableSpace{Index: i} continue } var available uint64 if !isMinioMetaBucketName(bucket) {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 89.1K bytes - Viewed (0) -
docs/fr/docs/history-design-future.md
création d'un nouveau framework pendant plusieurs années. J'ai d'abord essayé de résoudre toutes les fonctionnalités couvertes par **FastAPI** en utilisant de nombreux frameworks, plug-ins et outils différents. Mais à un moment donné, il n'y avait pas d'autre option que de créer quelque chose qui offre toutes ces fonctionnalités, en prenant les meilleures idées des outils précédents, et en les combinant de la meilleure façon possible, en utilisant des fonctionnalités du langage qui n'étaient...
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Jul 29 23:35:07 UTC 2024 - 4.9K bytes - Viewed (0)