- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 85 for Precompute (0.17 sec)
-
src/crypto/rsa/rsa.go
// Fill in the backwards-compatibility *big.Int values. if priv.Precomputed.Dp != nil { return } priv.Precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne) priv.Precomputed.Dp.Mod(priv.D, priv.Precomputed.Dp) priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne) priv.Precomputed.Dq.Mod(priv.D, priv.Precomputed.Dq) priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 23.4K bytes - Viewed (0) -
pilot/pkg/xds/filters/filters.go
}}, }), }, } ) // Router is used a bunch, so its worth precomputing even though we have a few options. // Since there are only 4 possible options, just precompute them all var routers = func() map[RouterFilterContext]*hcm.HttpFilter { res := map[RouterFilterContext]*hcm.HttpFilter{} for _, startSpan := range []bool{true, false} {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Feb 09 09:24:25 UTC 2024 - 15.5K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalar.go
// // Instead of writing a reduction function that operates on wider inputs, we // can interpret x as the sum of three shorter values a, b, and c. // // x = a + b * 2^168 + c * 2^336 mod l // // We then precompute 2^168 and 2^336 modulo l, and perform the reduction // with two multiplications and two additions. s.setShortBytes(x[:21]) t := new(Scalar).setShortBytes(x[21:42]) s.Add(s, t.Multiply(t, scalarTwo168))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 10.8K bytes - Viewed (0) -
src/crypto/cipher/gcm.go
} var key [gcmBlockSize]byte cipher.Encrypt(key[:], key[:]) g := &gcm{cipher: cipher, nonceSize: nonceSize, tagSize: tagSize} // We precompute 16 multiples of |key|. However, when we do lookups // into this table we'll be using bits from a field element and // therefore the bits will be in the reverse order. So normally one
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 13.7K bytes - Viewed (0) -
src/crypto/rsa/pkcs1v15.go
// // DigestInfo ::= SEQUENCE { // digestAlgorithm AlgorithmIdentifier, // digest OCTET STRING // } // // For performance, we don't use the generic ASN1 encoder. Rather, we // precompute a prefix of the digest value that makes a valid ASN1 DER string // with the correct contents. var hashPrefixes = map[crypto.Hash][]byte{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:21 UTC 2024 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
default: throw new AssertionError(); } } /* * The maximum number of bits in a square root for which we'll precompute an explicit half power * of two. This can be any value, but higher values incur more class load time and linearly * increasing memory consumption. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
default: throw new AssertionError(); } } /* * The maximum number of bits in a square root for which we'll precompute an explicit half power * of two. This can be any value, but higher values incur more class load time and linearly * increasing memory consumption. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
pilot/pkg/xds/ads.go
proxy.SetServiceTargets(s.Env.ServiceDiscovery) // only recompute workload labels when // 1. stream established and proxy first time initialization // 2. proxy update recomputeLabels := request == nil || request.IsProxyUpdate() if recomputeLabels { proxy.SetWorkloadLabels(s.Env) setTopologyLabels(proxy) } // Precompute the sidecar scope and merged gateways associated with this proxy.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Jun 03 08:29:05 UTC 2024 - 23.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// cases are easy to handle in different ways). // Technique from https://gmplib.org/~tege/divcnst-pldi94.pdf // First consider unsigned division. // Our strategy is to precompute 1/c then do // ⎣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
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/vendor/golang.org/x/text/cases/map.go
// We keep the following lists separate, instead of having a single per- // language struct, to give the compiler a chance to remove unused code. // Some uppercase mappers are stateless, so we can precompute the // Transformers and save a bit on runtime allocations. upperFunc = []struct { upper mapFunc span spanFunc }{ {nil, nil}, // und {nil, nil}, // af
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 22.7K bytes - Viewed (0)