- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 1,648 for computeLO (0.13 sec)
-
src/math/big/sqrt.go
// // If z's precision is 0, it is changed to x's precision before the // operation. Rounding is performed according to z's precision and // rounding mode, but z's accuracy is not computed. Specifically, the // result of z.Acc() is undefined. // // The function panics if z < 0. The value of z is undefined in that // case. func (z *Float) Sqrt(x *Float) *Float { if debugFloat { x.validate() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 2.8K bytes - Viewed (0) -
src/math/big/arith.go
t1, _ = bits.Add(t1, uint(x1), c) // The quotient is either t1, t1+1, or t1+2. // We'll try t1 and adjust if needed. qq := t1 // compute remainder r=x-d*q. dq1, dq0 := bits.Mul(d, qq) r0, b := bits.Sub(uint(x0), dq0, 0) r1, _ := bits.Sub(uint(x1), dq1, b) // The remainder we just computed is bounded above by B+d: // r = x1*B + x0 - d*q. // = x1*B + x0 - d*⎣(x1*m+x1*B+x0)/B⎦
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 28 20:09:27 UTC 2022 - 8.3K bytes - Viewed (0) -
analysis/analysis-api-standalone/analysis-api-standalone-base/src/org/jetbrains/kotlin/analysis/api/standalone/base/project/structure/KtStaticModuleDependentsProvider.kt
class KtStaticModuleDependentsProvider(private val modules: List<KtModule>) : KotlinModuleDependentsProviderBase() { private val directDependentsByKtModule: Map<KtModule, Set<KtModule>> by lazy { // Direct dependencies should be computed lazily, because the built-ins module will be reachable via module dependencies. Getting // the built-ins module relies on the built-ins session, which may depend on services that are registered after
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Mon Mar 18 21:14:36 UTC 2024 - 2.6K bytes - Viewed (0) -
platforms/core-execution/persistent-cache/src/main/java/org/gradle/cache/internal/FileContentCacheFactory.java
import org.gradle.internal.serialize.Serializer; import java.io.File; /** * A factory for caches that contain some calculated value for a particular file. Maintains a cross-build in-memory and persistent cache of computed values. The value for a given file is updated when the content of the file changes. */ public interface FileContentCacheFactory { /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:08:47 UTC 2023 - 1.8K bytes - Viewed (0) -
src/math/exp_arm64.s
MOVD $NearZero, R0 FMOVD R0, F2 FABSD F0, F3 FMOVD $1.0, F1 // F1 = 1.0 FCMPD F2, F3 BLT nearzero // fabs(x) < NearZero, return 1 + x // argument reduction, x = k*ln2 + r, |r| <= 0.5*ln2 // computed as r = hi - lo for extra precision. FMOVD $Log2e, F2 FMOVD $0.5, F3 FNMSUBD F0, F3, F2, F4 // Log2e*x - 0.5 FMADDD F0, F3, F2, F3 // Log2e*x + 0.5 FCMPD $0.0, F0 FCSELD LT, F4, F3, F3 // F3 = k
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 15 15:48:19 UTC 2021 - 5.4K bytes - Viewed (0) -
src/hash/crc32/crc32_amd64.go
// = CRC(CRC(CRC(I, A), O) xor CRC(0, B), O) xor CRC(0, C) // // The castagnoliSSE42Triple function can compute CRC(I, A), CRC(0, B), // and CRC(0, C) efficiently. We just need to find a way to quickly compute // CRC(uvwx, O) given a 4-byte initial value uvwx. We can precompute these // values; since we can't have a 32-bit table, we break it up into four // 8-bit tables: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:54:15 UTC 2022 - 6.8K bytes - Viewed (0) -
releasenotes/notes/update-grafana-memory-compute.yaml
Brian Avery <******@****.***> 1598371881 -0400
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Aug 25 16:11:21 UTC 2020 - 474 bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
xLimbs := x.limbs[:size] dLimbs := d.limbs[:size] mLimbs := m.nat.limbs[:size] // Each iteration of this loop computes x = 2x + b mod m, where b is a bit // from y. Effectively, it left-shifts x and adds y one bit at a time, // reducing it every time. // // To do the reduction, each iteration computes both 2x + b and 2x + b - m. // The next iteration (and finally the return line) will use either result
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
src/go/ast/scope.go
// NewObj creates a new object of a given kind and name. func NewObj(kind ObjKind, name string) *Object { return &Object{Kind: kind, Name: name} } // Pos computes the source position of the declaration of an object name. // The result may be an invalid position if it cannot be computed // (obj.Decl may be nil or not correct). func (obj *Object) Pos() token.Pos { name := obj.Name switch d := obj.Decl.(type) { case *Field:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 21:32:41 UTC 2024 - 4.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/unfuse_batch_norm_pass.cc
return failure(); } // result = (x - mean) * scale / sqrt(variance + epsilon) + offset // Let multiplier = scale / sqrt(variance + epsilon), to compute // (x - mean) * scale / sqrt(variance + epsilon) + offset, // is then to compute (x * multiplier) + (offset - mean * multiplier). auto epsilon = materializeEpsilon( bn_op.getOperation(), bn_op.getEpsilonAttr(), fp_type,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 11.2K bytes - Viewed (0)