- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for significantly (0.54 sec)
-
okhttp/src/main/kotlin/okhttp3/internal/http/ExchangeCodec.kt
*/ fun cancel() /** * Carries an exchange. This is usually a connection, but it could also be a connect plan for * CONNECT tunnels. Note that CONNECT tunnels are significantly less capable than connections. */ interface Carrier { val route: Route fun trackFailure( call: RealCall, e: IOException?, ) fun noNewExchanges()
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 3K bytes - Viewed (0) -
doc/next/5-toolchain.md
## Compiler {#compiler} The build time overhead to building with [Profile Guided Optimization](/doc/pgo) has been reduced significantly. Previously, large builds could see 100%+ build time increase from enabling PGO. In Go 1.23, overhead should be in the single digit percentages. ## Assembler {#assembler}
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu Apr 18 15:39:17 GMT 2024 - 332 bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* * <p>Ideally, this number should be close to the {@code fpp} parameter passed in {@linkplain * #create(Funnel, int, double)}, or smaller. If it is significantly higher, it is usually the * case that too many elements (more than expected) have been put in the {@code BloomFilter}, * degenerating it. * * @since 14.0 (since 11.0 as expectedFalsePositiveProbability())
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
common-protos/k8s.io/api/apidiscovery/v2beta1/generated.proto
// "Current" indicates the discovery document was recently // refreshed. "Stale" indicates the discovery document could not // be retrieved and the returned discovery document may be // significantly out of date. Clients that require the latest // version of the discovery information be retrieved before // performing an operation should not use the aggregated document optional string freshness = 3;
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 7.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* * <ul> * <li>If you only access one end of the queue, and do use a maximum size, this class will perform * significantly worse than a {@code PriorityQueue} with manual eviction above the maximum * size. In many cases {@link Ordering#leastOf} may work for your use case with significantly * improved (and asymptotically superior) performance.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta2/generated.proto
// of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand. // `handSize` must be no larger than `queues`, and should be // significantly smaller (so that a few heavy flows do not // saturate most of the queues). See the user-facing // documentation for more extensive guidance on setting this // field. This field has a default value of 8.
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 19.4K bytes - Viewed (0)