| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ |
| Frequency.java | 580 final int prime = 31; local
582 result = prime * result +
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| HTMLEntities.properties | 192 prime=8242
193 Prime=8243
|
| /external/libgdx/backends/gdx-backend-lwjgl3/src/com/badlogic/gdx/backends/lwjgl3/ |
| Lwjgl3Window.java | 299 final int prime = 31; local
301 result = prime * result + (int) (windowHandle ^ (windowHandle >>> 32));
|
| /packages/apps/TV/usbtuner/src/com/google/android/exoplayer/ |
| MediaSoftwareCodecUtil.java | 261 final int prime = 31; local
263 result = prime * result + ((mimeType == null) ? 0 : mimeType.hashCode());
|
| /frameworks/base/core/java/android/nfc/ |
| NdefRecord.java | 1015 final int prime = 31; local
[all...] |
| /external/boringssl/src/crypto/rsa/ |
| rsa_asn1.c | 191 !parse_integer(&child, &ret->prime) ||
235 /* Multi-prime RSA requires a newer version. */
271 ap->prime, ctx)) {
338 !marshal_integer(&other_prime_info, ap->prime) ||
|
| internal.h | 140 /* RSA_additional_prime contains information about the third, forth etc prime
141 * in a multi-prime RSA key. */
143 BIGNUM *prime; member in struct:RSA_additional_prime_st
144 /* exp is d^{prime-1} mod prime */
146 /* coeff is such that r×coeff ? 1 mod prime. */
153 /* mont is a |BN_MONT_CTX| modulo |prime|. */
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Vector2.java | 415 final int prime = 31;
local
417 result = prime * result + NumberUtils.floatToIntBits(x);
418 result = prime * result + NumberUtils.floatToIntBits(y);
|
| Quaternion.java | 682 final int prime = 31;
local
684 result = prime * result + NumberUtils.floatToRawIntBits(w);
685 result = prime * result + NumberUtils.floatToRawIntBits(x);
686 result = prime * result + NumberUtils.floatToRawIntBits(y);
687 result = prime * result + NumberUtils.floatToRawIntBits(z);
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| SparseFieldVector.java | 596 final int prime = 31; local
598 result = prime * result + ((field == null) ? 0 : field.hashCode());
599 result = prime * result + virtualSize;
604 result = prime * result + temp;
|
| /external/ipsec-tools/src/racoon/ |
| oakley.h | 158 vchar_t *prime; member in struct:dhgroup
|
| /frameworks/base/core/java/android/widget/ |
| ActivityChooserModel.java | 826 final int prime = 31; local
828 result = prime * result + ((activity == null) ? 0 : activity.hashCode());
829 result = prime * result + (int) (time ^ (time >>> 32));
830 result = prime * result + Float.floatToIntBits(weight);
[all...] |
| /frameworks/support/v7/appcompat/src/android/support/v7/widget/ |
| ActivityChooserModel.java | 802 final int prime = 31; local
804 result = prime * result + ((activity == null) ? 0 : activity.hashCode());
805 result = prime * result + (int) (time ^ (time >>> 32));
806 result = prime * result + Float.floatToIntBits(weight);
[all...] |
| /external/jetty/src/java/org/eclipse/jetty/servlets/ |
| BalancerServlet.java | 84 final int prime = 31; local
86 result = prime * result + ((_name == null)?0:_name.hashCode());
|
| /external/tpm2/ |
| MathFunctions.c | 500 // Check if an 32-bit integer is a prime.
504 // TRUE if the integer is probably a prime
505 // FALSE if the integer is definitely not a prime
509 const UINT32 prime
518 if(!BN_set_word(p, prime))
|
| RSAKeySieve.c | 180 // Include the outer counter (the one that changes on each prime
181 // prime candidate generation
203 // security strength of the prime. These values are from FIPS 186-3.
207 UINT32 bits // IN: Number of bits in the RSA prime
219 // likelihood, if the number is not prime, the first test fails.
225 // TRUE probably prime
317 // 5. Return PROBABLY PRIME
327 // This function is used to access the next prime number in the sequence of primes. It requires a pre-
362 // This function is used to initialize the prime sequence generator iterator. The iterator is initialized and
363 // returns the first prime that is equal to the requested starting value. If the starting value is no a prime, the
437 UINT16 prime; member in struct:__anon23308
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-create-exception.js | 43 // garbage collector. 93 is chosen to be a prime number to avoid the
|
| /packages/apps/Calendar/src/com/android/calendar/agenda/ |
| AgendaWindowAdapter.java | 252 final int prime = 31; local
254 result = prime * result + end;
255 result = prime * result + (int) (queryStartMillis ^ (queryStartMillis >>> 32));
256 result = prime * result + queryType;
257 result = prime * result + start;
259 result = prime * result + searchQuery.hashCode();
263 result = prime * result + (int) (goToTimeMillis ^ (goToTimeMillis >>> 32));
265 result = prime * result + (int)id;
[all...] |
| /prebuilts/tools/common/api-generator/ |
| api-generator-22.9.4.jar | |
| api-generator-25.0.0.jar | |
| /external/v8/test/mjsunit/ |
| apply.js | 168 assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
169 assertEquals(primes.length, same_primes.length, "prime-length");
194 "moreseper-prime");
|
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_eke_common.c | 175 if (os_memcmp(ret_priv, dh->prime, dh->prime_len) > 0) {
176 /* Make sure private value is smaller than prime */
191 dh->prime, dh->prime_len, ret_pub, &pub_len) < 0)
425 dh->prime, dh->prime_len, modexp, &len) < 0)
|
| /libcore/luni/src/main/java/java/math/ |
| BigInteger.java | 31 * cryptography, such as the generation of large prime numbers and computation
149 * pow(2, bitLength)-1]} which is probably prime. The probability that the
150 * returned {@code BigInteger} is prime is greater than
174 candidate |= 1; // Any prime longer than 2 bits must have the bottom bit set.
177 BigInt prime = new BigInt(); local
178 prime.putULongInt(candidate, false);
179 setBigInt(prime);
[all...] |
| /packages/apps/Calendar/src/com/android/calendar/widget/ |
| CalendarAppWidgetService.java | 351 long prime = 31;
353 result = prime * result + (int) (eventInfo.id ^ (eventInfo.id >>> 32));
354 result = prime * result + (int) (eventInfo.start ^ (eventInfo.start >>> 32));
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/ |
| key.py | 31 import rsa.prime namespace
433 def find_p_q(nbits, getprime_func=rsa.prime.getprime, accurate=True):
441 :py:func:`rsa.prime.getprime`.
524 raise ValueError("e (%d) and phi_n (%d) are not relatively prime" %
540 :param getprime_func: either :py:func:`rsa.prime.getprime` or a function
560 :param poolsize: the number of processes to use to generate the prime
583 else: getprime_func = rsa.prime.getprime
|
