| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/ |
| primes.py | 5 def primes(min, max):
function
8 primes = [2]
11 for p in primes:
15 primes.append(i)
27 primes(min, max)
|
| /external/python/cpython2/Demo/scripts/ |
| primes.py | 5 def primes(min, max): function
8 primes = [2]
11 for p in primes:
15 primes.append(i)
27 primes(min, max)
|
| /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...] |
| /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 | 79 if (pIndex < primes.length - 1) {
80 arraySize = primes[++pIndex];
113 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in class:CalendarCache
120 private int arraySize = primes[pIndex];
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/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/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];
|
| /prebuilts/go/darwin-x86/test/chan/ |
| sieve1.go | 9 // Generate primes up to 100 using channels, checking the results.
11 // equivalent to trial-dividing each n by all primes p ? n.
33 func Sieve(primes chan<- int) {
39 primes <- prime
47 primes := make(chan int)
48 go Sieve(primes)
51 if x := <-primes; x != a[i] {
|
| sieve2.go | 9 // Generate primes up to 100 using channels, checking the results.
111 // Return a chan int of primes.
122 primes := make(chan int, 10)
123 primes <- 3
125 // Merge channels of multiples of 'primes' into 'composites'.
130 m := multiples(<-primes)
153 // primes ? sqrt(nth prime). Thus, the merging goroutine will
154 // receive from 'primes' much slower than this goroutine
158 primes := sendproxy(primes)
[all...] |
| /prebuilts/go/linux-x86/test/chan/ |
| sieve1.go | 9 // Generate primes up to 100 using channels, checking the results.
11 // equivalent to trial-dividing each n by all primes p ? n.
33 func Sieve(primes chan<- int) {
39 primes <- prime
47 primes := make(chan int)
48 go Sieve(primes)
51 if x := <-primes; x != a[i] {
|
| sieve2.go | 9 // Generate primes up to 100 using channels, checking the results.
111 // Return a chan int of primes.
122 primes := make(chan int, 10)
123 primes <- 3
125 // Merge channels of multiples of 'primes' into 'composites'.
130 m := multiples(<-primes)
153 // primes ? sqrt(nth prime). Thus, the merging goroutine will
154 // receive from 'primes' much slower than this goroutine
158 primes := sendproxy(primes)
[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/boringssl/src/crypto/fipsmodule/bn/ |
| prime.c | 116 /* The quick sieve algorithm approach to weeding out primes is Philip
122 /* primes contains all the primes that fit into a uint16_t. */
123 static const uint16_t primes[NUMPRIMES] = { variable
503 BN_ULONG mod = BN_mod_word(a, primes[i]);
508 return BN_is_word(a, primes[i]);
683 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
693 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
721 * 1) It's greater than primes[i] because we shouldn't reject
726 * primes because there aren't many small primes wher
[all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| prime_test.go | 14 var primes = []string{ var
32 // http://primes.utm.edu/lists/small/small3.html
38 // ECC primes: http://tools.ietf.org/html/draft-ladd-safecurves-02
130 for i, s := range primes {
|
| /prebuilts/go/linux-x86/src/math/big/ |
| prime_test.go | 14 var primes = []string{ var
32 // http://primes.utm.edu/lists/small/small3.html
38 // ECC primes: http://tools.ietf.org/html/draft-ladd-safecurves-02
130 for i, s := range primes {
|
| /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])];
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
| st.c | 72 static const long primes[] = {
variable
119 i < (int )(sizeof(primes)/sizeof(primes[0]));
122 if (newsize > size) return primes[i];
|
| /prebuilts/go/darwin-x86/src/crypto/rsa/ |
| rsa.go | 83 Primes []*big.Int // prime factors of N, has >= 2 elements.
143 // CRTValues is used for the 3rd and subsequent primes. Due to a
144 // historical accident, the CRT for the first two primes is handled
154 R *big.Int // product of primes prior to this (inc p and q).
164 // Check that ?primes == n.
166 for _, prime := range priv.Primes {
167 // Any primes ? 1 will cause divide-by-zero panics later.
185 for _, prime := range priv.Primes {
208 // Table 1 in [2] suggests maximum numbers of primes for a given size.
222 // pi approximates the number of primes less than primeLimi
[all...] |
| /prebuilts/go/linux-x86/src/crypto/rsa/ |
| rsa.go | 83 Primes []*big.Int // prime factors of N, has >= 2 elements.
143 // CRTValues is used for the 3rd and subsequent primes. Due to a
144 // historical accident, the CRT for the first two primes is handled
154 R *big.Int // product of primes prior to this (inc p and q).
164 // Check that ?primes == n.
166 for _, prime := range priv.Primes {
167 // Any primes ? 1 will cause divide-by-zero panics later.
185 for _, prime := range priv.Primes {
208 // Table 1 in [2] suggests maximum numbers of primes for a given size.
222 // pi approximates the number of primes less than primeLimi
[all...] |
