- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 945 for picked (0.25 sec)
-
src/runtime/mpallocbits_test.go
for name, v := range tests { v := v t.Run(name, func(t *testing.T) { b := makePallocBits(v.before) for iter, i := range v.hits { a, _ := b.Find(v.npages, 0) if i != a { t.Fatalf("find #%d picked wrong index: want %d, got %d", iter+1, i, a) } if i != ^uint(0) { b.AllocRange(a, uint(v.npages)) } } want := makePallocBits(v.after) checkPallocBits(t, b, want) }) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 17 22:00:17 UTC 2020 - 13.7K bytes - Viewed (0) -
hack/cherry_pick_pull.sh
prtext=$(cat <<EOF Cherry pick of ${PULLSUBJ} on ${rel}. ${numandtitle} For details on the cherry pick process, see the [cherry pick requests](https://git.k8s.io/community/contributors/devel/sig-release/cherry-picks.md) page. \`\`\`release-note \`\`\` EOF )
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jun 26 03:51:05 UTC 2022 - 8.9K bytes - Viewed (0) -
src/internal/fuzz/mutators_byteslice.go
// TODO(rolandshoemaker,katiehockman): 4096 was mainly picked // randomly. We may want to either pick a much larger value // (AFL uses 32768, paired with a similar impl to chooseLen // which biases towards smaller lengths that grow over time), // or set the max based on characteristics of the corpus // (libFuzzer sets a min/max based on the min/max size of // entries in the corpus and then picks uniformly from // that range).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 19 18:23:43 UTC 2021 - 7.7K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/queueset_test.go
), }, }, attempts: 1, minQueueIndexExpected: []int{1}, robinIndexExpected: []int{1}, }, { name: "width1=1, all seats are occupied, no queue is picked", concurrencyLimit: 1, totSeatsInUse: 1, robinIndex: -1, queues: []*queue{ { nextDispatchR: fcrequest.SeatsTimesDuration(1, 200*time.Second), requestsWaiting: newFIFO(
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Sep 26 12:55:23 UTC 2023 - 58.4K bytes - Viewed (0) -
pilot/pkg/networking/core/networkfilter.go
} return out } // buildRedisFilter builds an outbound Envoy RedisProxy filter. // Currently, if multiple clusters are defined, one of them will be picked for // configuring the Redis proxy. func buildRedisFilter(statPrefix, clusterName string) *listener.Filter { redisProxy := &redis.RedisProxy{
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Apr 17 22:20:44 UTC 2024 - 13.7K bytes - Viewed (0) -
pkg/controller/cronjob/utils.go
// by decades or more), that it would eat up all the CPU and memory // of this controller. In that case, we want to not try to list // all the missed start times. // // I've somewhat arbitrarily picked 100, as more than 80, // but less than "lots". switch { case numberOfMissedSchedules > 100: missedSchedules = manyMissed // inform about few missed, still case numberOfMissedSchedules > 0:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 09 03:34:25 UTC 2024 - 10.7K bytes - Viewed (0) -
cmd/storage-rest-server.go
} else { write([]byte{0}) } xioutil.SafeClose(doneCh) return } defer xioutil.SafeClose(doneCh) // Initiate ticker after body has been read. ticker := time.NewTicker(time.Second * 10) defer ticker.Stop() for { select { case <-ticker.C: // The done() might have been called // concurrently, check for it before we // write the filler byte. select {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 44.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Crc32cHashFunction.java
0xf4335f23, 0x063f52dd, 0x5a26b1e2, 0xa82abc1c, 0xbbd2dcef, 0x49ded111, 0x9c221d09, 0x6e2e10f7, 0x7dd67004, 0x8fda7dfa, }, }; // Value x picked so computeForWord(x) == ~0, found by exhaustive search. static final int INVERSE_COMPUTE_FOR_WORD_OF_ALL_1S = 0xeee3ddcd; static int computeForWord(int word) { return STRIDE_TABLE[3][word & 0xFF]
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
0xf4335f23, 0x063f52dd, 0x5a26b1e2, 0xa82abc1c, 0xbbd2dcef, 0x49ded111, 0x9c221d09, 0x6e2e10f7, 0x7dd67004, 0x8fda7dfa, }, }; // Value x picked so computeForWord(x) == ~0, found by exhaustive search. static final int INVERSE_COMPUTE_FOR_WORD_OF_ALL_1S = 0xeee3ddcd; static int computeForWord(int word) { return STRIDE_TABLE[3][word & 0xFF]
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
pkg/kubelet/metrics/metrics.go
// ref: https://github.com/kubernetes/community/blob/master/sig-scalability/slos/pod_startup_latency.md // // The histogram bucket boundaries for pod startup latency metrics, measured in seconds. These are hand-picked // so as to be roughly exponential but still round numbers in everyday units. This is to minimise the number // of buckets while allowing accurate measurement of thresholds which might be used in SLOs
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 22 15:13:25 UTC 2024 - 45.6K bytes - Viewed (0)