- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 130 for multiplication (0.16 sec)
-
src/vendor/golang.org/x/crypto/chacha20poly1305/chacha20poly1305_amd64.s
// Store counters MOVO D0, ctr0Store; MOVO D1, ctr1Store; MOVO D2, ctr2Store; MOVO D3, ctr3Store XORQ itr2, itr2 openSSETail256Loop: // This loop inteleaves 8 ChaCha quarter rounds with 1 poly multiplication polyAdd(0(inp)(itr2*1)) MOVO C3, tmpStore chachaQR(A0, B0, C0, D0, C3); chachaQR(A1, B1, C1, D1, C3); chachaQR(A2, B2, C2, D2, C3) MOVO tmpStore, C3 MOVO C1, tmpStore
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 29 21:28:33 UTC 2023 - 105.6K bytes - Viewed (0) -
src/internal/bytealg/bytealg.go
// If MaxLen is not 0, make sure MaxLen >= 4. var MaxLen int // PrimeRK is the prime base used in Rabin-Karp algorithm. const PrimeRK = 16777619 // HashStr returns the hash and the appropriate multiplicative // factor for use in Rabin-Karp algorithm. func HashStr[T string | []byte](sep T) (uint32, uint32) { hash := uint32(0) for i := 0; i < len(sep); i++ { hash = hash*PrimeRK + uint32(sep[i]) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 19:51:15 UTC 2024 - 3.1K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p256_invert.go
// // If x == 0, Invert returns e = 0. func (e *P256Element) Invert(x *P256Element) *P256Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 12 multiplications and 255 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:03 UTC 2022 - 1.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Hashing.java
* @author Austin Appleby */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Hashing { private Hashing() {} /* * These should be ints, but we need to use longs to force GWT to do the multiplications with * enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Aug 05 00:40:25 UTC 2021 - 2.5K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p521_invert.go
// // If x == 0, Invert returns e = 0. func (e *P521Element) Invert(x *P521Element) *P521Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 13 multiplications and 520 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _1100 = _11 << 2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 1.8K bytes - Viewed (0) -
src/runtime/testdata/testprogcgo/raceprof.go
// We want a bunch of different profile stacks that collide in the // hash table maintained in runtime/cpuprof.go. This code knows the // size of the hash table (1 << 10) and knows that the hash function // is simply multiplicative. void raceprofTraceback(void* parg) { struct cgoTracebackArg* arg = (struct cgoTracebackArg*)(parg); raceprofCount++; arg->buf[0] = raceprofCount * (1 << 10); arg->buf[1] = 0; }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 18:13:14 UTC 2023 - 1.7K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p384_invert.go
// // If x == 0, Invert returns e = 0. func (e *P384Element) Invert(x *P384Element) *P384Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 15 multiplications and 383 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 2.1K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p224_invert.go
// // If x == 0, Invert returns e = 0. func (e *P224Element) Invert(x *P224Element) *P224Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 11 multiplications and 223 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 1.8K bytes - Viewed (0) -
src/runtime/complex.go
f = (imag(n)*ratio - real(n)) / denom } if isNaN(e) && isNaN(f) { // Correct final result to infinities and zeros if applicable. // Matches C99: ISO/IEC 9899:1999 - G.5.1 Multiplicative operators. a, b := real(n), imag(n) c, d := real(m), imag(m) switch { case m == 0 && (!isNaN(a) || !isNaN(b)): e = copysign(inf, c) * a f = copysign(inf, c) * b
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 15 22:45:17 UTC 2017 - 1.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Hashing.java
* @author Austin Appleby */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Hashing { private Hashing() {} /* * These should be ints, but we need to use longs to force GWT to do the multiplications with * enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Aug 05 00:40:25 UTC 2021 - 2.5K bytes - Viewed (0)