- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 236 for bigN (0.12 sec)
-
android/guava-tests/test/com/google/common/primitives/UnsignedLongTest.java
.add(doubleConversionTest + i); BigInteger bigI = BigInteger.valueOf(i); testBigIntegersBuilder .add(bigI) .add(BigInteger.valueOf(Long.MAX_VALUE).add(bigI)) .add(BigInteger.valueOf(Long.MIN_VALUE).add(bigI)) .add(BigInteger.valueOf(Integer.MAX_VALUE).add(bigI)) .add(BigInteger.valueOf(Integer.MIN_VALUE).add(bigI)) .add(BigInteger.ONE.shiftLeft(63).add(bigI))
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 06 16:10:08 UTC 2024 - 10.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
* arithmetic. */ private static int computeMeanSafely(int x, int y) { BigInteger bigX = BigInteger.valueOf(x); BigInteger bigY = BigInteger.valueOf(y); BigDecimal bigMean = new BigDecimal(bigX.add(bigY)).divide(BigDecimal.valueOf(2), BigDecimal.ROUND_FLOOR); // parseInt blows up on overflow as opposed to intValue() which does not.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 24.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
private static boolean fitsInLong(BigInteger big) { return big.bitLength() <= 63; } private static final BigInteger MAX_LONG = BigInteger.valueOf(Long.MAX_VALUE); private static final BigInteger MIN_LONG = BigInteger.valueOf(Long.MIN_VALUE); private static long saturatedCast(BigInteger big) { if (big.compareTo(MAX_LONG) > 0) { return Long.MAX_VALUE; } if (big.compareTo(MIN_LONG) < 0) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 04 20:15:57 UTC 2024 - 32.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
private static boolean fitsInLong(BigInteger big) { return big.bitLength() <= 63; } private static final BigInteger MAX_LONG = BigInteger.valueOf(Long.MAX_VALUE); private static final BigInteger MIN_LONG = BigInteger.valueOf(Long.MIN_VALUE); private static long saturatedCast(BigInteger big) { if (big.compareTo(MAX_LONG) > 0) { return Long.MAX_VALUE; } if (big.compareTo(MIN_LONG) < 0) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 04 20:15:57 UTC 2024 - 32.5K bytes - Viewed (0) -
src/time/zoneinfo_read.go
} p := d.p[0:n] d.p = d.p[n:] return p } func (d *dataIO) big4() (n uint32, ok bool) { p := d.read(4) if len(p) < 4 { d.error = true return 0, false } return uint32(p[3]) | uint32(p[2])<<8 | uint32(p[1])<<16 | uint32(p[0])<<24, true } func (d *dataIO) big8() (n uint64, ok bool) { n1, ok1 := d.big4() n2, ok2 := d.big4() if !ok1 || !ok2 { d.error = true return 0, false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 14.4K bytes - Viewed (0) -
src/crypto/elliptic/elliptic_test.go
xx.Add(x, p) checkIsOnCurveFalse("x+P, y", xx, y) yy.Add(y, p) checkIsOnCurveFalse("x, y+P", x, yy) // Check if the overflow is dropped. xx.Add(x, new(big.Int).Lsh(big.NewInt(1), 535)) checkIsOnCurveFalse("x+2⁵³⁵, y", xx, y) yy.Add(y, new(big.Int).Lsh(big.NewInt(1), 535)) checkIsOnCurveFalse("x, y+2⁵³⁵", x, yy) // Check if P is treated like zero (if possible). // y^2 = x^3 - 3x + B // y = mod_sqrt(x^3 - 3x + B)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 27 02:00:03 UTC 2023 - 11.6K bytes - Viewed (0) -
src/math/big/arith_s390x.s
VPDI $0x4, V18, V18, V18 // flip the doublewords to big-endian order VPDI $0x4, V19, V19, V19 // flip the doublewords to big-endian order VPDI $0x4, V20, V20, V20 // flip the doublewords to big-endian order VPDI $0x4, V21, V21, V21 // flip the doublewords to big-endian order VPDI $0x4, V22, V22, V22 // flip the doublewords to big-endian order VPDI $0x4, V23, V23, V23 // flip the doublewords to big-endian order
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 20.3K bytes - Viewed (0) -
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) -
src/crypto/internal/bigmod/nat_test.go
for i := 0; i < b.N; i++ { x.Mul(y, m) } } func BenchmarkExpBig(b *testing.B) { out := new(big.Int) exponentBytes := makeBenchmarkExponent() x := new(big.Int).SetBytes(exponentBytes) e := new(big.Int).SetBytes(exponentBytes) n := new(big.Int).SetBytes(exponentBytes) one := new(big.Int).SetUint64(1) n.Add(n, one) b.ResetTimer() for i := 0; i < b.N; i++ { out.Exp(x, e, n) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 12 00:56:20 UTC 2024 - 11.6K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
func TestZetas(t *testing.T) { ζ := big.NewInt(17) q := big.NewInt(q) for k, zeta := range zetas { // ζ^BitRev7(k) mod q exp := new(big.Int).Exp(ζ, big.NewInt(int64(BitRev7(uint8(k)))), q) if big.NewInt(int64(zeta)).Cmp(exp) != 0 { t.Errorf("zetas[%d] = %v, expected %v", k, zeta, exp) } } } func TestGammas(t *testing.T) { ζ := big.NewInt(17) q := big.NewInt(q) for k, gamma := range gammas {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0)