- Sort Score
- Result 10 results
- Languages All
Results 281 - 290 of 346 for Celery (0.05 sec)
-
guava/src/com/google/common/util/concurrent/RateLimiter.java
* spread over each second. When the incoming request rate exceeds {@code permitsPerSecond} the * rate limiter will release one permit every {@code (1.0 / permitsPerSecond)} seconds. When the * rate limiter is unused, bursts of up to {@code permitsPerSecond} permits will be allowed, with
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 21.6K bytes - Viewed (0) -
cmd/erasure-server-pool-rebalance.go
doneCh := make(chan error, 1) defer xioutil.SafeClose(doneCh) // Save rebalance.bin periodically. go func() { // Update rebalance.bin periodically once every 5-10s, chosen randomly // to avoid multiple pool leaders herding to update around the same // time. r := rand.New(rand.NewSource(time.Now().UnixNano())) randSleepFor := func() time.Duration {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 13:20:19 UTC 2024 - 28.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <ul> * <li>A and B have equal {@link #isDirected() directedness}. * <li>A and B have equal {@link #nodes() node sets}. * <li>A and B have equal {@link #edges() edge sets}. * <li>Every edge in A and B connects the same nodes in the same direction (if any). * </ul> * * <p>Network properties besides {@link #isDirected() directedness} do <b>not</b> affect equality.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Converter.java
*/ public abstract class Converter<A, B> implements Function<A, B> { private final boolean handleNullAutomatically; // We lazily cache the reverse view to avoid allocating on every call to reverse(). @LazyInit @RetainedWith @CheckForNull private transient Converter<B, A> reverse; /** Constructor for use by subclasses. */ protected Converter() { this(true); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 23K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* distinct elements, and add the last element over again many times over. We don't want a * situation where we re-sort the entire buffer every time the last element is re-added. * * <p>The solution is to ensure there are O(n) spaces left over in the buffer after
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.1K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/http2/HttpOverHttp2Test.kt
@ParameterizedTest @ArgumentsSource(ProtocolParamProvider::class) fun pingsTransmitted( protocol: Protocol, mockWebServer: MockWebServer, ) { setUp(protocol, mockWebServer) // Ping every 500 ms, starting at 500 ms. client = client.newBuilder() .pingInterval(Duration.ofMillis(500)) .build() // Delay the response to give 1 ping enough time to be sent and replied to.
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Thu Apr 11 22:09:35 UTC 2024 - 75.3K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.17.md
- Kube-apiserver now reloads serving certificates from disk every minute to allow rotation without restarting the server process ([#84200](https://github.com/kubernetes/kubernetes/pull/84200), [@jackkleeman](https://github.com/jackkleeman))
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Thu Jan 28 10:44:33 UTC 2021 - 346.2K bytes - Viewed (1) -
docs/en/docs/alternatives.md
These features are what Marshmallow was built to provide. It is a great library, and I have used it a lot before. But it was created before there existed Python type hints. So, to define every <abbr title="the definition of how data should be formed">schema</abbr> you need to use specific utils and classes provided by Marshmallow. /// check | "Inspired **FastAPI** to"
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 23.2K bytes - Viewed (0) -
tensorflow/c/eager/c_api_experimental.h
#ifdef __cplusplus extern "C" { #endif // Resets `op_to_reset` with `op_or_function_name` and `raw_device_name`. This // is for performance optimization by reusing an exiting unused op rather than // creating a new op every time. If `raw_device_name` is `NULL` or empty, it // does not set the device name. If it's not `NULL`, then it attempts to parse // and set the device name. It's effectively `TFE_OpSetDevice`, but it is faster
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Feb 21 22:37:46 UTC 2024 - 39.5K bytes - Viewed (0) -
docs/en/docs/async.md
So, during that time, the computer can go and do some other work, while "slow-file" 📝 finishes. Then the computer / program 🤖 will come back every time it has a chance because it's waiting again, or whenever it 🤖 finished all the work it had at that point. And it 🤖 will see if any of the tasks it was waiting for have already finished, doing whatever it had to do.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Aug 28 23:33:37 UTC 2024 - 23.5K bytes - Viewed (0)