| /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/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/icu/android_icu4j/src/main/java/android/icu/impl/ |
| CalendarCache.java | 77 if (pIndex < primes.length - 1) {
78 arraySize = primes[++pIndex];
111 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in class:CalendarCache
118 private int arraySize = primes[pIndex];
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| CalendarCache.java | 75 if (pIndex < primes.length - 1) {
76 arraySize = primes[++pIndex];
109 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in class:CalendarCache
116 private int arraySize = primes[pIndex];
|
| /external/tpm2/ |
| RSAKeySieve_fp.h | 24 UINT16 primes, // IN: number of primes to test
|
| RSAKeySieve.c | 211 if(bits < 1536) return 5; // for 512 and 1K primes
327 // This function is used to access the next prime number in the sequence of primes. It requires a pre-
343 // Modifies the input parameter to be a valid value for the number of primes. The adjusted value is either the
370 UINT32 primes // IN: the table length
375 iter->final = AdjustNumberOfPrimes(primes);
384 // This macro sets the default number of primes to the indicated value.
457 UINT32 primes // IN: the number of primes to use
476 primes = AdjustNumberOfPrimes(primes);
580 UINT32 primes; local
[all...] |
| RSAKeySieve.h | 12 // the generation of different primes. The smaller tables are used when generating smaller primes.
17 // 13 will allocate the maximum size table which allows generation of the first 6542 primes which is all the
18 // primes less than 2^16.
83 extern const __int16 primes[NUM_PRIMES];
|
| RSAData.c | 71 // Following table contains a byte that is the difference between two successive primes. This reduces the
74 // When the table size is at its max, the table will have all primes less than 2^16. This is 6542 primes in
583 const __int16 primes[NUM_PRIMES]= variable
[all...] |
| /external/testng/src/test/java/test/testng387/ |
| FailedDPTest.java | 20 static final List<Integer> primes = Arrays.asList(2, 3, 5, 7); field in class:FailedDPTest
40 if (primes.contains(i)){
|
| TestNG387.java | 27 assertEqualsNoOrder(failed.toArray(), FailedDPTest.primes.toArray());
|
| /libcore/luni/src/test/java/libcore/java/math/ |
| BigIntegerTest.java | 121 int[] primes = new int[1024]; local
124 for (int rep = 0; rep < primes.length; ++rep) { // Manual flakiness protection for random tests.
128 primes[rep] = b.intValue();
130 for (int i = 0; i < primes.length; ++i) {
131 if (primes[i] == 2) {
133 } else if (primes[i] == 3) {
|
| /external/v8/test/mjsunit/ |
| apply.js | 144 var primes = new Array(0);
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")
[all...] |
| /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/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 contains all the primes that fit into a uint16_t. */
142 static const uint16_t primes[NUMPRIMES] = { variable
499 if (BN_mod_word(a, primes[i]) == 0) {
646 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
656 mods[i] = (uint16_t)BN_mod_word(rnd, (BN_ULONG)primes[i]);
680 * 1) It's greater than primes[i] because we shouldn't reject
685 * primes because there aren't many small primes wher
[all...] |
| /external/valgrind/coregrind/ |
| m_hashtable.c | 57 static const SizeT primes[N_HASH_PRIMES] = { variable
72 SizeT n_chains = primes[0];
99 /* If we've run out of primes, do nothing. */
100 if (old_chains == primes[N_HASH_PRIMES-1])
103 vg_assert(old_chains >= primes[0]
104 && old_chains < primes[N_HASH_PRIMES-1]);
107 if (primes[i] > new_chains) {
108 new_chains = primes[i];
114 vg_assert(new_chains > primes[0]
115 && new_chains <= primes[N_HASH_PRIMES-1])
[all...] |
| /toolchain/binutils/binutils-2.25/bfd/ |
| hash.c | 310 /* These are primes that are near, but slightly smaller than, a
312 static const unsigned long primes[] = local
345 const unsigned long *low = &primes[0];
346 const unsigned long *high = &primes[sizeof (primes) / sizeof (primes[0])];
|
| /prebuilts/tools/common/m2/repository/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 | |
| /external/libgdx/backends/gdx-backend-moe/libs/ |
| intel-moe-core.jar | |
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/53.1/ |
| icu4j-53.1.jar | |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/54.1.1/ |
| icu4j-54.1.1.jar | |
