HomeSort by relevance Sort by last modified time
    Searched refs:prime (Results 101 - 125 of 1085) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/v8/src/inspector/
v8-debugger-script.cc 30 static uint64_t prime[] = {0x3FB75161, 0xAB1F4E4F, 0x82675BC5, 0xCD924D35, local
49 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
50 zi[current] = (zi[current] * random[current]) % prime[current];
60 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
61 zi[current] = (zi[current] * random[current]) % prime[current];
66 hashes[i] = (hashes[i] + zi[i] * (prime[i] - 1)) % prime[i];
  /frameworks/base/core/java/android/print/
PrinterCapabilitiesInfo.java 262 final int prime = 31; local
264 result = prime * result + ((mMinMargins == null) ? 0 : mMinMargins.hashCode());
265 result = prime * result + ((mMediaSizes == null) ? 0 : mMediaSizes.hashCode());
266 result = prime * result + ((mResolutions == null) ? 0 : mResolutions.hashCode());
267 result = prime * result + mColorModes;
268 result = prime * result + mDuplexModes;
269 result = prime * result + Arrays.hashCode(mDefaults);
  /prebuilts/go/darwin-x86/src/crypto/rsa/
rsa.go 83 Primes []*big.Int // prime factors of N, has >= 2 elements.
152 Exp *big.Int // D mod (prime-1).
153 Coeff *big.Int // R·Coeff ? 1 mod Prime.
166 for _, prime := range priv.Primes {
168 if prime.Cmp(bigOne) <= 0 {
169 return errors.New("crypto/rsa: invalid prime value")
171 modulus.Mul(modulus, prime)
177 // Check that de ? 1 mod p-1, for each prime.
185 for _, prime := range priv.Primes {
186 pminus1 := new(big.Int).Sub(prime, bigOne
    [all...]
  /prebuilts/go/linux-x86/src/crypto/rsa/
rsa.go 83 Primes []*big.Int // prime factors of N, has >= 2 elements.
152 Exp *big.Int // D mod (prime-1).
153 Coeff *big.Int // R·Coeff ? 1 mod Prime.
166 for _, prime := range priv.Primes {
168 if prime.Cmp(bigOne) <= 0 {
169 return errors.New("crypto/rsa: invalid prime value")
171 modulus.Mul(modulus, prime)
177 // Check that de ? 1 mod p-1, for each prime.
185 for _, prime := range priv.Primes {
186 pminus1 := new(big.Int).Sub(prime, bigOne
    [all...]
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-directory/1.11.18/
aws-java-sdk-directory-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-autoscaling/1.11.18/
aws-java-sdk-autoscaling-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-events/1.11.18/
aws-java-sdk-events-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-datapipeline/1.11.18/
aws-java-sdk-datapipeline-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-config/1.11.18/
aws-java-sdk-config-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-glacier/1.11.18/
aws-java-sdk-glacier-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-machinelearning/1.11.18/
aws-java-sdk-machinelearning-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-discovery/1.11.18/
aws-java-sdk-discovery-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-ssm/1.11.18/
aws-java-sdk-ssm-1.11.18.jar 
  /prebuilts/go/darwin-x86/src/math/big/
prime.go 9 // ProbablyPrime reports whether x is probably prime,
13 // If x is prime, ProbablyPrime returns true.
14 // If x is chosen randomly and not prime, ProbablyPrime probably returns false.
15 // The probability of returning true for a randomly chosen non-prime is at most ¼?.
126 // probablyPrimeLucas reports whether n passes the "almost extra strong" Lucas probable prime test,
148 // Crandall and Pomerance, Prime Numbers: A Computational Perspective, 2nd ed.
155 // Two is the only even prime.
186 // If (d/n) == 0 then d shares a prime factor with n.
188 // the shared prime factor must be p+2.
189 // If p+2 == n, then n is prime; otherwise p+2 is a proper factor of n
    [all...]
  /prebuilts/go/linux-x86/src/math/big/
prime.go 9 // ProbablyPrime reports whether x is probably prime,
13 // If x is prime, ProbablyPrime returns true.
14 // If x is chosen randomly and not prime, ProbablyPrime probably returns false.
15 // The probability of returning true for a randomly chosen non-prime is at most ¼?.
126 // probablyPrimeLucas reports whether n passes the "almost extra strong" Lucas probable prime test,
148 // Crandall and Pomerance, Prime Numbers: A Computational Perspective, 2nd ed.
155 // Two is the only even prime.
186 // If (d/n) == 0 then d shares a prime factor with n.
188 // the shared prime factor must be p+2.
189 // If p+2 == n, then n is prime; otherwise p+2 is a proper factor of n
    [all...]
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-ses/1.11.18/
aws-java-sdk-ses-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-waf/1.11.18/
aws-java-sdk-waf-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-elasticbeanstalk/1.11.18/
aws-java-sdk-elasticbeanstalk-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-iot/1.11.18/
aws-java-sdk-iot-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-devicefarm/1.11.18/
aws-java-sdk-devicefarm-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-efs/1.11.18/
aws-java-sdk-efs-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-cloudformation/1.11.18/
aws-java-sdk-cloudformation-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-simpleworkflow/1.11.18/
aws-java-sdk-simpleworkflow-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-iam/1.11.18/
aws-java-sdk-iam-1.11.18.jar 
  /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-logs/1.11.18/
aws-java-sdk-logs-1.11.18.jar 

Completed in 175 milliseconds

1 2 3 45 6 7 8 91011>>