- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 8,419 for capped (0.13 sec)
-
android/guava/src/com/google/common/cache/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (2) -
pkg/kube/multicluster/secretcontroller.go
} type ComponentBuilder interface { registerHandler(h handler) } // BuildMultiClusterComponent constructs a new multicluster component. For each cluster, the constructor will be called. // If the cluster is removed, the T.Close() method will be called. // Constructors MUST not do blocking IO; they will block other operations. // During a cluster update, a new component is constructed before the old one is removed for seamless migration.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Mar 06 02:13:10 UTC 2024 - 12.7K bytes - Viewed (0) -
pkg/registry/core/service/ipallocator/bitmap_test.go
allocated: 256, // this is a counter, we already had 2 allocations and we did 254 more errors: 12, } expectMetrics(t, cidrIPv4, em) em = testMetrics{ free: 65271, // IPv6 clusterIP range is capped to 2^16 and consider the broadcast address as valid used: 264, allocated: 264, errors: 0, } expectMetrics(t, cidrIPv6, em) } func TestClusterIPAllocatedMetrics(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jan 25 20:32:40 UTC 2023 - 21.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/LocalCache.java
this.expireAfterAccess = builder.expireAfterAccessNanos; this.expireAfterWrite = builder.expireAfterWriteNanos; this.statsCounter = builder.getStatsCounterSupplier().get(); /* Implements size-capped LinkedHashMap */ final long maximumSize = builder.maximumSize; this.cachingHashMap = new CapacityEnforcingLinkedHashMap<K, V>( builder.getInitialCapacity(), 0.75f,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 27 19:19:19 UTC 2024 - 21.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
for (int repeats = 0; repeats < 10000; repeats++) { assertTrue(BloomFilter.optimalNumOfBits(random.nextInt(1 << 16), random.nextDouble()) >= 0); } // and some crazy values (this used to be capped to Integer.MAX_VALUE, now it can go bigger assertEquals(3327428144502L, BloomFilter.optimalNumOfBits(Integer.MAX_VALUE, Double.MIN_VALUE)); IllegalArgumentException expected = assertThrows(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 21.2K bytes - Viewed (0) -
src/runtime/select.go
if debugSelect { print("select: cas0=", cas0, "\n") } // NOTE: In order to maintain a lean stack size, the number of scases // is capped at 65536. cas1 := (*[1 << 16]scase)(unsafe.Pointer(cas0)) order1 := (*[1 << 17]uint16)(unsafe.Pointer(order0)) ncases := nsends + nrecvs scases := cas1[:ncases:ncases] pollorder := order1[:ncases:ncases]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 13 21:36:04 UTC 2024 - 15K bytes - Viewed (0) -
pkg/registry/core/service/ipallocator/ipallocator_test.go
allocated: 256, // this is a counter, we already had 2 allocations and we did 254 more errors: 12, } expectMetrics(t, cidrIPv4, em) em = testMetrics{ free: 65271, // IPv6 clusterIP range is capped to 2^16 and consider the broadcast address as valid used: 264, allocated: 264, errors: 0, } expectMetrics(t, cidrIPv6, em) } func TestIPAllocatorClusterIPAllocatedMetrics(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jun 25 13:14:46 UTC 2023 - 24.2K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/quantity.go
number = append(number, suffix...) number = append(number, '"') return result[:1+len(number)], nil } // if CanonicalizeBytes needed more space than our slice provided, we may need to allocate again so use // append result = result[:1] result = append(result, number...) result = append(result, suffix...) result = append(result, '"') return result, nil }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 21:48:10 UTC 2024 - 23.8K bytes - Viewed (0)