| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/openssl/crypto/bn/ |
| bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
[all...] |
| /external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| DHGenParameterSpecTest.java | 43 int[] primes = { Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE }; local
45 for (int i = 0; i < primes.length; i++) {
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i],
50 ps.getPrimeSize(), primes[i]);
|
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| prime.c | 134 /* The quick sieve algorithm approach to weeding out primes is Philip
138 /* NUMPRIMES is the number of primes that fit into a uint16_t. */
141 /* primes is defined at the bottom of the file and contains all the primes that
143 static const uint16_t primes[NUMPRIMES]; variable
312 if (BN_mod_word(a, primes[i]) == 0) {
460 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
470 mods[i] = (uint16_t)BN_mod_word(rnd, (BN_ULONG)primes[i]);
488 * 1) It's greater than primes[i] because we shouldn't reject
493 * primes because there aren't many small primes wher
653 static const uint16_t primes[NUMPRIMES] = { variable
[all...] |
| bn_test.c | 1202 unsigned primes[8] = {2, 3, 5, 7, 11, 13, 17, 19}; local
1204 if (!BN_set_word(p, primes[i]))
|
| /external/ltrace/ |
| dict.c | 320 static const size_t primes[] = { variable
329 return primes[0];
331 if (current < primes[sizeof(primes)/sizeof(*primes) - 2]) {
333 for (i = 0; primes[i] != 0; ++i)
334 if (primes[i] > current)
335 return primes[i];
339 /* We ran out of primes, so invent a new one. The following
340 * gives primes until about 17M elements (and then some mor
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
