| /external/wpa_supplicant_8/src/eap_common/ |
| eap_pwd_common.h | 18 * TODO: support one based on a prime field
25 BIGNUM *prime; member in struct:group_definition_
|
| /frameworks/av/include/media/stagefright/ |
| VideoFrameScheduler.h | 81 void prime(size_t numSamples);
|
| /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);
|
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 36 const int32_t prime=1301; // Less than 2k. member in struct:BMPBitHash
65 hash=(hash+prime)&0x7ff;
|
| /libcore/luni/src/main/java/libcore/util/ |
| ZoneInfo.java | 626 final int prime = 31; local
628 result = prime * result + getID().hashCode();
629 result = prime * result + Arrays.hashCode(mOffsets);
630 result = prime * result + Arrays.hashCode(mIsDsts);
631 result = prime * result + mRawOffset;
632 result = prime * result + Arrays.hashCode(mTransitions);
633 result = prime * result + Arrays.hashCode(mTypes);
634 result = prime * result + (mUseDst ? 1231 : 1237);
[all...] |
| /external/wpa_supplicant_8/src/common/ |
| sae.h | 37 const struct crypto_bignum *prime; member in struct:sae_temporary_data
|
| /external/jcommander/src/main/java/com/beust/jcommander/ |
| Parameterized.java | 147 final int prime = 31; local
149 result = prime * result + ((m_field == null) ? 0 : m_field.hashCode());
150 result = prime * result + ((m_method == null) ? 0 : m_method.hashCode());
|
| /external/oauth/core/src/main/java/net/oauth/ |
| OAuth.java | 242 final int prime = 31; local
244 result = prime * result + ((key == null) ? 0 : key.hashCode());
245 result = prime * result + ((value == null) ? 0 : value.hashCode());
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_openssl.c | 1248 BIGNUM *prime; member in struct:crypto_ec
1306 e->prime = BN_new();
1310 if (e->group == NULL || e->bnctx == NULL || e->prime == NULL ||
1312 !EC_GROUP_get_curve_GFp(e->group, e->prime, e->a, e->b, e->bnctx) ||
1329 BN_clear_free(e->prime);
1348 return BN_num_bytes(e->prime);
1354 return BN_num_bits(e->prime);
1360 return (const struct crypto_bignum *) e->prime;
1384 int len = BN_num_bytes(e->prime);
1417 int len = BN_num_bytes(e->prime);
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ |
| Primes.java | 75 private BigInteger prime; field in class:Primes.STOutput
79 private STOutput(BigInteger prime, byte[] primeSeed, int primeGenCounter)
81 this.prime = prime;
88 return prime;
105 * Construct a provable prime number using a hash function.
110 * the length (in bits) of the prime to be generated. Must be at least 2.
112 * the seed to be used for the generation of the requested prime. Cannot be null or
114 * @return an {@link STOutput} instance containing the requested prime.
272 * (so <code>candidate</code> is definitely NOT prime), or else <code>true</code
[all...] |
| /toolchain/binutils/binutils-2.25/libiberty/ |
| hashtab.c | 129 hashval_t prime; member in struct:prime_ent
131 hashval_t inv_m2; /* inverse of prime-2 */
170 nearest prime number which is greater than N, and near a power of two. */
181 if (n > prime_tab[mid].prime)
188 if (n > prime_tab[low].prime)
190 fprintf (stderr, "Cannot find prime bigger than %lu\n", n);
265 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
274 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
303 size = prime_tab[size_prime_index].prime;
356 size = prime_tab[size_prime_index].prime;
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunction.java | 331 final int prime = 31; local
333 result = prime * result + Arrays.hashCode(coefficients);
|
| /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
|
| /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/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))
|
| /external/v8/test/mjsunit/regress/ |
| regress-create-exception.js | 43 // garbage collector. 93 is chosen to be a prime number to avoid the
|
