/external/chromium/chrome/browser/debugger/manual_tests/resources/ |
worker-primes.js | 1 importScripts('primes.js'); 3 var primes = new Primes(); 9 postMessage([p, primes.test(p)]);
|
/external/openssl/crypto/bn/ |
bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
bn_prime.pl | 7 push(@primes,2); 9 loop: while ($#primes < $num-1) 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 16 next loop if (($p%$primes[$i]) == 0); 18 push(@primes,$p); 93 for ($i=0; $i <= $#primes; $i++) 95 if ($primes[$i] > 256) 109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t"; 111 for ($i=0; $i <= $#primes; $i++ [all...] |
bn_prime.c | 123 /* The quick sieve algorithm approach to weeding out primes is 266 if (BN_mod_word(a, primes[i]) == 0) 387 mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]); 388 maxdelta=BN_MASK2 - primes[NUMPRIMES-1]; 393 * that gcd(rnd-1,primes) == 1 (except for 2) */ 394 if (((mods[i]+delta)%primes[i]) <= 1) 431 if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1) 480 * gcd(p-1,primes) == 1 (except for 2) */ 481 if ( (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) || 482 (BN_mod_word(q,(BN_ULONG)primes[i]) == 0) [all...] |
bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local [all...] |
/libcore/luni/src/main/java/java/math/ |
Primality.java | 31 private static final int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, field in class:Primality 47 private static final BigInteger BIprimes[] = new BigInteger[primes.length]; 62 // * It encodes how many i-bit primes there are in the table for 71 static {// To initialize the dual table of BigInteger primes 72 for (int i = 0; i < primes.length; i++) { 73 BIprimes[i] = BigInteger.valueOf(primes[i]); 90 int[] modules = new int[primes.length]; 96 if (l < primes[primes.length - 1]) { 97 for (i = 0; l >= primes[i]; i++) { [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]);
|
/libcore/luni/src/test/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/valgrind/main/drd/tests/ |
omp_prime.c | 44 int* primes; local 78 primes = malloc(n * sizeof(primes[0])); 96 primes[total] = i; 106 printf("%d\n", primes[i]); 111 free(primes);
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function 28 primes(isPrime, i);
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function 28 primes(isPrime, i);
|
/external/valgrind/main/coregrind/ |
m_hashtable.c | 55 static SizeT primes[N_HASH_PRIMES] = { variable 70 SizeT n_chains = primes[0]; 97 /* If we've run out of primes, do nothing. */ 98 if (old_chains == primes[N_HASH_PRIMES-1]) 101 vg_assert(old_chains >= primes[0] 102 && old_chains < primes[N_HASH_PRIMES-1]); 105 if (primes[i] > new_chains) { 106 new_chains = primes[i]; 112 vg_assert(new_chains > primes[0] 113 && new_chains <= primes[N_HASH_PRIMES-1]) [all...] |
/external/v8/test/mjsunit/ |
apply.js | 140 var primes = new Array(0); 143 for (var d = 0; d < primes.length; d++) { 144 var p = primes[d]; 155 primes.push(i); 159 assertEquals(1229, primes.length); 161 var same_primes = Array.prototype.constructor.apply(Array, primes); 163 for (var i = 0; i < primes.length; i++) 164 assertEquals(primes[i], same_primes[i], "prime" + primes[i]); 165 assertEquals(primes.length, same_primes.length, "prime-length") [all...] |
/external/dropbear/libtommath/etc/ |
pprime.c | 1 /* Generates provable primes 11 FILE *primes; variable 41 /* write first set of primes */ 152 primes = fopen("pprime.dat", "rb"); 153 if (primes == NULL) { 155 primes = fopen("pprime.dat", "rb"); 157 fseek(primes, 0, SEEK_END); 158 n_prime = ftell(primes) / sizeof(mp_digit); 167 fseek(primes, n * sizeof(mp_digit), SEEK_SET); 168 fread(&d, 1, sizeof(mp_digit), primes); [all...] |
/external/dropbear/libtommath/demo/ |
timing.c | 206 char *primes[] = { local 211 /* 2K moduli mersenne primes */ 242 for (n = 0; primes[n]; n++) { 244 mp_read_radix(&a, primes[n], 10);
|
/external/dropbear/libtommath/ |
bn.tex | [all...] |
/external/openssh/contrib/redhat/ |
openssh.spec | 488 - replace primes with moduli 693 - Add the primes file from the latest snapshot to the main package (#20884).
|
/external/dropbear/libtomcrypt/ |
crypt.tex | [all...] |
/prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
icu4j-2.6.1.jar | |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
com.ibm.icu_4.2.1.v20100412.jar | |