- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 219 for enough (0.12 sec)
-
common-protos/k8s.io/api/resource/v1alpha2/generated.proto
// +optional optional string selectedNode = 1; // PotentialNodes lists nodes where the Pod might be able to run. // // The size of this field is limited to 128. This is large enough for // many clusters. Larger clusters may need more attempts to find a node // that suits all pending resources. This may get increased in the // future, but not reduced. // // +listType=set // +optional
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 14.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Queues.java
added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e = q.poll(deadline - System.nanoTime(), NANOSECONDS); if (e == null) { break; // we already waited enough, and there are no more elements in sight } buffer.add(e); added++; } }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 26 14:11:14 UTC 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* during which the {@code RateLimiter} smoothly ramps up its rate, until it reaches its maximum * rate at the end of the period (as long as there are enough requests to saturate it). Similarly, * if the {@code RateLimiter} is left <i>unused</i> for a duration of {@code warmupPeriod}, it * will gradually return to its "cold" state, i.e. it will go through the same warming up process
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 21.9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskRunner.kt
var multipleReadyTasks = false // Decide what to run. This loop's goal wants to: // * Find out what this thread should do (either run a task or sleep) // * Find out if there's enough work to start another thread. eachQueue@ for (queue in readyQueues) { val candidate = queue.futureTasks[0] val candidateDelay = maxOf(0L, candidate.nextExecuteNanoTime - now) when {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Apr 29 00:33:04 UTC 2024 - 10.6K bytes - Viewed (0) -
cmd/erasure-healing-common.go
if metadata.VersionID == "" { vid = nullVersionID } vidMap[vid]++ etags[index] = metadata.Metadata["etag"] } for _, count := range vidMap { // do we have enough common versions // that have enough quorum to satisfy // the etag. if count >= quorum { return etags } } return make([]string, len(partsMetadata)) }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Oct 31 22:10:24 UTC 2024 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e = q.poll(deadline - System.nanoTime(), NANOSECONDS); if (e == null) { break; // we already waited enough, and there are no more elements in sight } buffer.add(e); added++; } }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 26 14:11:14 UTC 2024 - 18.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
addressStates[address]?.scheduleOpener() } fun scheduleCloser() { cleanupQueue.schedule(cleanupTask) } /** * Ensure enough connections open to [address] to satisfy its [ConnectionPool.AddressPolicy]. * If there are already enough connections, we're done. * If not, we create one and then schedule the task to run again immediately. */ private fun openConnections(state: AddressState): Long {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sat Apr 20 17:03:43 UTC 2024 - 16.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
} /** * Creates a {@code ObjectCountHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code ObjectCountHashMap} with enough capacity to hold {@code * expectedSize} elements without resizing
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jun 01 22:07:10 UTC 2021 - 15K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/RateLimiter.java
* during which the {@code RateLimiter} smoothly ramps up its rate, until it reaches its maximum * rate at the end of the period (as long as there are enough requests to saturate it). Similarly, * if the {@code RateLimiter} is left <i>unused</i> for a duration of {@code warmupPeriod}, it * will gradually return to its "cold" state, i.e. it will go through the same warming up process
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 21.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} /** * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code * expectedSize} elements without resizing
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0)