- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 93 for maxInt (0.23 sec)
-
src/math/big/ratmarsh.go
} b := buf[0] if b>>1 != ratGobVersion { return fmt.Errorf("Rat.GobDecode: encoding version %d not supported", b>>1) } const j = 1 + 4 ln := byteorder.BeUint32(buf[j-4 : j]) if uint64(ln) > math.MaxInt-j { return errors.New("Rat.GobDecode: invalid length") } i := j + int(ln) if len(buf) < i { return errors.New("Rat.GobDecode: buffer too small") } z.a.neg = b&1 != 0 z.a.abs = z.a.abs.setBytes(buf[j:i])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 2.2K bytes - Viewed (0) -
src/net/http/routing_index.go
// position. // We could intersect all the possible matches at each position, but we // do something simpler: we find the position with the fewest patterns. var lmin, wmin []*pattern min := math.MaxInt hasLit := false for i, seg := range pat.segments { if seg.multi { break } if !seg.wild { hasLit = true lpats := idx.segments[routingIndexKey{s: seg.s, pos: i}]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 19 18:35:22 UTC 2023 - 4K bytes - Viewed (0) -
cmd/admin-server-info.go
props.PoolNumbers = append(props.PoolNumbers, poolNumber) } sort.Ints(props.PoolNumbers) props.PoolNumber = func() int { if len(props.PoolNumbers) == 1 { return props.PoolNumbers[0] } return math.MaxInt // this indicates that its unset. }() sensitive := map[string]struct{}{ config.EnvAccessKey: {}, config.EnvSecretKey: {}, config.EnvRootUser: {},
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 4.9K bytes - Viewed (0) -
src/encoding/gob/decgen.go
}, { "float64", "Float64", `slice[i] = float64FromBits(state.decodeUint())`, }, { "int", "Int", `x := state.decodeInt() // MinInt and MaxInt if x < ^int64(^uint(0)>>1) || int64(^uint(0)>>1) < x { error_(ovfl) } slice[i] = int(x)`, }, { "int16", "Int16", `x := state.decodeInt() if x < math.MinInt16 || math.MaxInt16 < x {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 14:15:38 UTC 2024 - 5.3K bytes - Viewed (0) -
pkg/apis/extensions/v1beta1/defaults.go
// Set default MaxSurge as 1 by default. maxSurge := intstr.FromInt32(1) strategy.RollingUpdate.MaxSurge = &maxSurge } } // Set extensionsv1beta1.DeploymentSpec.ProgressDeadlineSeconds to MaxInt, // which has the same meaning as unset. if obj.Spec.ProgressDeadlineSeconds == nil { obj.Spec.ProgressDeadlineSeconds = new(int32) *obj.Spec.ProgressDeadlineSeconds = math.MaxInt32 }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 07:16:15 UTC 2023 - 5.3K bytes - Viewed (0) -
pkg/webhooks/webhookpatch.go
controllers.WithRateLimiter(workqueue.NewItemFastSlowRateLimiter(100*time.Millisecond, 1*time.Minute, 5)), // Webhook patching has to be retried forever. But the retries would be rate limited. controllers.WithMaxAttempts(math.MaxInt)) } // Run runs the WebhookCertPatcher func (w *WebhookCertPatcher) Run(stopChan <-chan struct{}) { go w.startCaBundleWatcher(stopChan) w.webhooks.Start(stopChan)
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Sep 28 00:36:38 UTC 2023 - 6.1K bytes - Viewed (0) -
src/slices/slices.go
// overflows. func Repeat[S ~[]E, E any](x S, count int) S { if count < 0 { panic("cannot be negative") } const maxInt = ^uint(0) >> 1 if hi, lo := bits.Mul(uint(len(x)), uint(count)); hi > 0 || lo > maxInt { panic("the result of (len(x) * count) overflows") } newslice := make(S, len(x)*count) n := copy(newslice, x) for n < len(newslice) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/strings/strings.go
case 0: return "" case 1: return elems[0] } var n int if len(sep) > 0 { if len(sep) >= maxInt/(len(elems)-1) { panic("strings: Join output length overflow") } n += len(sep) * (len(elems) - 1) } for _, elem := range elems { if len(elem) > maxInt-n { panic("strings: Join output length overflow") } n += len(elem) } var b Builder b.Grow(n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
src/internal/trace/base.go
} // Find the range of IDs. maxID := EI(0) minID := ^EI(0) for id := range d.sparse { if id > maxID { maxID = id } if id < minID { minID = id } } if maxID >= math.MaxInt { // We can't create a slice big enough to hold maxID elements return } // We're willing to waste at most 2x memory. if int(maxID-minID) > max(len(d.sparse), 2*len(d.sparse)) { return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 6.8K bytes - Viewed (0) -
internal/s3select/sql/value_test.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Mar 06 16:56:10 UTC 2023 - 12.5K bytes - Viewed (0)