- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 3,861 for Largest (0.26 sec)
-
src/strconv/atoc.go
// and include err.Num = s. // // If s is not syntactically well-formed, ParseComplex returns err.Err = ErrSyntax. // // If s is syntactically well-formed but either component is more than 1/2 ULP // away from the largest floating point number of the given component's size, // ParseComplex returns err.Err = ErrRange and c = ±Inf for the respective component. func ParseComplex(s string, bitSize int) (complex128, error) { size := 64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 05 00:24:26 UTC 2024 - 3.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/normalize.go
// It is not guaranteed to return the largest such n. func (f Form) QuickSpan(b []byte) int { n, _ := formTable[f].quickSpan(inputBytes(b), 0, len(b), true) return n } // Span implements transform.SpanningTransformer. It returns a boundary n such // that b[0:n] == f(b[0:n]). It is not guaranteed to return the largest such n. func (f Form) Span(b []byte, atEOF bool) (n int, err error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/biasedsparsemap.go
if first > last { return &biasedSparseMap{first: math.MaxInt32, s: nil} } return &biasedSparseMap{first: first, s: newSparseMap(1 + last - first)} } // cap returns one more than the largest key valid for s func (s *biasedSparseMap) cap() int { if s == nil || s.s == nil { return 0 } return s.s.cap() + int(s.first) } // size returns the number of entries stored in s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:06 UTC 2022 - 2.7K bytes - Viewed (0) -
build-logic/performance-testing/src/main/groovy/gradlebuild/performance/generator/DependencyGenerator.groovy
* dependencies to projects in lower layers. The sizes of different layers are created so that * the first and last layers are the smallest and the layers in the middle are the largest. * * For example when numberOfProjects = 150, 10 layers will be created with sizes of * [1, 2, 6, 16, 50, 50, 16, 6, 2, 1] *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 5.2K bytes - Viewed (0) -
src/math/trig_reduce.go
return j, z * PI4 } // mPi4 is the binary digits of 4/pi as a uint64 array, // that is, 4/pi = Sum mPi4[i]*2^(-64*i) // 19 64-bit digits and the leading one bit give 1217 bits // of precision to handle the largest possible float64 exponent. var mPi4 = [...]uint64{ 0x0000000000000001, 0x45f306dc9c882a53, 0xf84eafa3ea69bb81, 0xb6c52b3278872083, 0xfca2c757bd778ac3, 0x6e48dc74849ba5c0, 0x0c925dd413a32439,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
pkg/apis/core/v1/helper/helpers.go
return resource.ParseQuantity(pageSize) } // HugePageUnitSizeFromByteSize returns hugepage size has the format. // `size` must be guaranteed to divisible into the largest units that can be expressed. // <size><unit-prefix>B (1024 = "1KB", 1048576 = "1MB", etc). func HugePageUnitSizeFromByteSize(size int64) (string, error) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 30 23:03:54 UTC 2024 - 11.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/admission/plugin/policy/validating/metrics/metrics.go
// the lowest bucket was based around the 180ns/op figure for BenchmarkAccess, // plus some additional leeway to account for the apiserver doing other things // the largest bucket was chosen based on the fact that benchmarks indicate the // same Xeon running a CEL expression close to the estimated cost limit takes // around 760ms, so that bucket should only ever have the slowest CEL expressions
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 12 18:58:24 UTC 2024 - 5.4K bytes - Viewed (0) -
src/image/geom_test.go
got := r.Eq(s) want := in(r, s) == nil && in(s, r) == nil if got != want { t.Errorf("Eq: r=%s, s=%s: got %t, want %t", r, s, got, want) } } } // The intersection should be the largest rectangle a such that every point // in a is both in r and in s. for _, r := range rects { for _, s := range rects { a := r.Intersect(s) if err := in(a, r); err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 05:05:59 UTC 2017 - 3K bytes - Viewed (0) -
docs/erasure/README.md
divides the drives you provide into erasure-coding sets of *2 to 16* drives. Therefore, the number of drives you present must be a multiple of one of these numbers. Each object is written to a single erasure-coding set. Minio uses the largest possible EC set size which divides into the number of drives given. For example, *18 drives* are configured as *2 sets of 9 drives*, and *24 drives* are configured as *2 sets of 12 drives*. This is true for scenarios when running MinIO as a standalone...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding.go
// For example, for deckSize=128 and handSize=4 this function might call pick(14); pick(73); pick(119); pick(26). func (d *Dealer) Deal(hashValue uint64, pick func(int)) { // 15 is the largest possible value of handSize var remainders [15]int for i := 0; i < d.handSize; i++ { hashValueNext := hashValue / uint64(d.deckSize-i) remainders[i] = int(hashValue - uint64(d.deckSize-i)*hashValueNext)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Oct 23 08:38:03 UTC 2019 - 4K bytes - Viewed (0)