- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,648 for computeLO (0.18 sec)
-
internal/etag/etag.go
// when the object is uploaded in multiple parts via the S3 // multipart API. Instead, S3 first computes a MD5 of each part: // // e1 := MD5(part-1) // e2 := MD5(part-2) // ... // eN := MD5(part-N) // // Then, the ETag of the object is computed as MD5 of all individual // part checksums. S3 also encodes the number of parts into the ETag // by appending a -<number-of-parts> at the end: //
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sun Mar 10 21:09:36 UTC 2024 - 13.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/interface.go
sortMethods(ityp.methods) // Compute type set as soon as possible to report any errors. // Subsequent uses of type sets will use this computed type // set and won't need to pass in a *Checker. check.later(func() { computeInterfaceTypeSet(check, iface.Pos(), ityp) }).describef(iface, "compute type set for %s", ityp)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 17:24:42 UTC 2023 - 6.2K bytes - Viewed (0) -
src/runtime/metrics.go
if !info.Opaque { metrics["/godebug/non-default-behavior/"+info.Name+":events"] = metricData{compute: compute0} } } metricsInit = true } func compute0(_ *statAggregate, out *metricValue) { out.kind = metricKindUint64 out.scalar = 0 } type metricReader func() uint64 func (f metricReader) compute(_ *statAggregate, out *metricValue) { out.kind = metricKindUint64 out.scalar = f() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 26K bytes - Viewed (0) -
src/math/exp.go
return 0 case -NearZero < x && x < NearZero: return 1 + x } // reduce; computed as r = hi - lo for extra precision. var k int switch { case x < 0: k = int(Log2e*x - 0.5) case x > 0: k = int(Log2e*x + 0.5) } hi := x - float64(k)*Ln2Hi lo := float64(k) * Ln2Lo // compute return expmulti(hi, lo, k) } // Exp2 returns 2**x, the base-2 exponential of x. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 5.4K bytes - Viewed (0) -
internal/hash/reader.go
"github.com/minio/minio/internal/ioutil" ) // A Reader wraps an io.Reader and computes the MD5 checksum // of the read content as ETag. Optionally, it also computes // the SHA256 checksum of the content. // // If the reference values for the ETag and content SHA26 // are not empty then it will check whether the computed // match the reference values. type Reader struct { src io.Reader bytesRead int64
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Sep 18 17:00:54 UTC 2023 - 10.8K bytes - Viewed (0) -
src/math/big/nat.go
// caller's z. // compute z0 and z2 with the result "in place" in z karatsuba(z, x0, y0) // z0 = x0*y0 karatsuba(z[n:], x1, y1) // z2 = x1*y1 // compute xd (or the negative value if underflow occurs) s := 1 // sign of product xd*yd xd := z[2*n : 2*n+n2] if subVV(xd, x1, x0) != 0 { // x1-x0 s = -s subVV(xd, x0, x1) // x0-x1 } // compute yd (or the negative value if underflow occurs)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/typeparams/normalize.go
return nil, fmt.Errorf("constraint is %T, not *types.Interface", constraint.Underlying()) } return InterfaceTermSet(iface) } // InterfaceTermSet computes the normalized terms for a constraint interface, // returning an error if the term set cannot be computed or is empty. In the // latter case, the error will be ErrEmptyTypeSet. // // See the documentation of StructuralTerms for more information on // normalization.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 6.7K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// // At a high level, this value is computed as the bytes of memory // allocated (cons) per unit of scan work completed (mark) in a GC // cycle, divided by the CPU time spent on each activity. // // Updated at the end of each GC cycle, in endCycle. consMark float64 // lastConsMark is the computed cons/mark value for the previous 4 GC
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// ⎣x / c⎦ = ⎣x * (1/c)⎦. // 1/c is less than 1, so we can't compute it directly in // integer arithmetic. Let's instead compute 2^e/c // for a value of e TBD (^ = exponentiation). Then // ⎣x / c⎦ = ⎣x * (2^e/c) / 2^e⎦. // Dividing by 2^e is easy. 2^e/c isn't an integer, unfortunately. // So we must approximate it. Let's call its approximation m. // We'll then compute // ⎣x * m / 2^e⎦
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ssa // This file contains code to compute the dominator tree // of a control-flow graph. // postorder computes a postorder traversal ordering for the // basic blocks in f. Unreachable blocks will not appear. func postorder(f *Func) []*Block { return postorderWithNumbering(f, nil) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Dec 03 17:08:51 UTC 2022 - 7.4K bytes - Viewed (0)