| /external/v8/test/mjsunit/ |
| D | apply.js | 144 var primes = new Array(0); variable
147 for (var d = 0; d < primes.length; d++) {
148 var p = primes[d];
159 primes.push(i);
163 assertEquals(1229, primes.length);
165 var same_primes = Array.prototype.constructor.apply(Array, primes);
167 for (var i = 0; i < primes.length; i++)
168 assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
169 assertEquals(primes.length, same_primes.length, "prime-length");
189 primes[0] = "";
[all …]
|
| /external/valgrind/drd/tests/ |
| D | omp_prime.c | 44 int* primes; in main() local
78 primes = malloc(n * sizeof(primes[0])); in main()
96 primes[total] = i; in main()
106 printf("%d\n", primes[i]); in main()
111 free(primes); in main()
|
| /external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| D | DHGenParameterSpecTest.java | 43 int[] primes = { Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE }; in testDHGenParameterSpec() local
45 for (int i = 0; i < primes.length; i++) { in testDHGenParameterSpec()
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i], in testDHGenParameterSpec()
50 ps.getPrimeSize(), primes[i]); in testDHGenParameterSpec()
|
| /external/ltrace/ |
| D | dict.c | 320 static const size_t primes[] = { variable
329 return primes[0]; in larger_size()
331 if (current < primes[sizeof(primes)/sizeof(*primes) - 2]) { in larger_size()
333 for (i = 0; primes[i] != 0; ++i) in larger_size()
334 if (primes[i] > current) in larger_size()
335 return primes[i]; in larger_size()
348 if (current <= primes[0]) in smaller_size()
349 return primes[0]; in smaller_size()
351 if (current <= primes[sizeof(primes)/sizeof(*primes) - 2]) { in smaller_size()
354 for (i = 0; primes[i] != 0; ++i) { in smaller_size()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 75 if (pIndex < primes.length - 1) { in rehash()
76 arraySize = primes[++pIndex]; in rehash()
109 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
116 private int arraySize = primes[pIndex];
|
| /external/boringssl/src/crypto/bn/ |
| D | prime.c | 142 static const uint16_t primes[NUMPRIMES] = { variable
499 if (BN_mod_word(a, primes[i]) == 0) { in BN_is_prime_fasttest_ex()
647 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
657 mods[i] = (uint16_t)BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime()
688 for (i = 1; i < NUMPRIMES && primes[i] < rnd_word; i++) { in probable_prime()
689 if ((mods[i] + delta) % primes[i] == 0) { in probable_prime()
701 if (((mods[i] + delta) % primes[i]) <= 1) { in probable_prime()
757 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) { in probable_prime_dh()
829 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) || in probable_prime_dh_safe()
830 (BN_mod_word(q, (BN_ULONG)primes[i]) == 0)) { in probable_prime_dh_safe()
|
| /external/valgrind/coregrind/ |
| D | m_hashtable.c | 57 static const SizeT primes[N_HASH_PRIMES] = { variable
72 SizeT n_chains = primes[0]; in VG_()
100 if (old_chains == primes[N_HASH_PRIMES-1]) in resize()
103 vg_assert(old_chains >= primes[0] in resize()
104 && old_chains < primes[N_HASH_PRIMES-1]); in resize()
107 if (primes[i] > new_chains) { in resize()
108 new_chains = primes[i]; in resize()
114 vg_assert(new_chains > primes[0] in resize()
115 && new_chains <= primes[N_HASH_PRIMES-1]); in resize()
|
| /external/openssh/ |
| D | Makefile.in | 351 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
352 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
|
| D | ssh-keygen.0 | 148 Generate candidate primes for DH-GEX. These primes must be
318 Test DH group exchange candidate primes (generated using the -G
372 process: first, candidate primes are generated using a fast, but memory
373 intensive process. These candidate primes are then tested for
376 Generation of primes is performed using the -G option. The desired
377 length of the primes may be specified by the -b option. For example:
381 By default, the search for primes begins at a random point in the desired
|
| D | moduli.0 | 31 are Sophie Germain primes (type 4). Further primality
|
| /external/valgrind/auxprogs/ |
| D | Makefile.am | 22 primes.c
|
| /external/libvorbis/doc/ |
| D | vorbis-clip.txt | 104 a) The first packet only primes the overlap/add buffer. No data is
|
| /external/openssh/contrib/redhat/ |
| D | openssh.spec | 487 - replace primes with moduli
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/fr-FR/ |
| D | fr-FR_klex.pkb | 588 primauté3primezprimes.primo%C2<@!Bprinces4
|
| /external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/data/tokenization/ |
| D | namedEntities.test | 34079 "input": "&primes",
34080 "description": "Bad named entity: primes without a semi-colon",
34085 "&primes"
34090 "input": "ℙ",
34091 "description": "Named entity: primes; with a semi-colon",
|
| /external/bouncycastle/patches/ |
| D | bcprov.patch | 874 + logger.info("Generating safe primes. This may take a long time.");
897 + logger.info("Generated safe primes: " + tries + " tries took " + duration + "ms");
|
| /external/libcxx/include/ |
| D | memory | 3130 // Some primes between 2^63 and 2^64.
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/fr-FR/ |
| D | fr-FR_lexpos.utf | 1947 N_ADJ_F_PL "primes" :G2P
|