Home
last modified time | relevance | path

Searched refs:primes (Results 1 – 25 of 2405) sorted by relevance

12345678910>>...97

/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/t/
H A D11-primes.t10 ok(!eval { primes(undef); }, "primes(undef)");
11 ok(!eval { primes("a"); }, "primes(a)");
12 ok(!eval { primes(-4); }, "primes(-4)");
13 ok(!eval { primes(2,undef); }, "primes(2,undef)");
14 ok(!eval { primes(2,'x'); }, "primes(2,x)");
15 ok(!eval { primes(2,-4); }, "primes(2,-4)");
16 ok(!eval { primes(undef,7); }, "primes(undef,7)");
17 ok(!eval { primes('x',7); }, "primes(x,7)");
18 ok(!eval { primes(-10,7); }, "primes(-10,7)");
20 ok(!eval { primes('x','x'); }, "primes(x,x)");
[all …]
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5sec/is_prime/
H A Dis_prime.fzn1 var set of 1..100: primes:: output_var;
77 constraint set_in(2,primes);
78 constraint set_in(3,primes);
79 constraint set_in(5,primes);
80 constraint set_in(7,primes);
81 constraint set_in(11,primes);
82 constraint set_in(13,primes);
83 constraint set_in(17,primes);
84 constraint set_in(19,primes);
85 constraint set_in(23,primes);
[all …]
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/bench/
H A Dbench-primearray.pl26 $s += $primes[$_] for 0..$ilimit;
32 $s += $_ for @primes[0..$ilimit];
53 $s += $primes[$_] for 0..$ilimit;
56 $s += $primes[$_] for 0..$ilimit;
59 $s += $primes[$_] for 0..$ilimit;
62 $s += $primes[$_] for 0..$ilimit;
87 $s += $_ for @primes[0..$ilimit];
94 $s += $primes[$_] for 0..$ilimit;
113 $s += $primes[$_] for 0..$ilimit;
119 $s += $_ for @primes[0..$ilimit];
[all …]
H A Dbench-pp-sieve.pl103 my @primes;
112 @primes;
131 @primes;
151 @primes;
170 @primes;
334 return grep { $primes[$_] } 2 .. $#primes;
371 @primes;
398 @primes;
423 @primes;
451 @primes;
[all …]
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/t/
H A D52-primearray.t66 my @primes; tie @primes, 'Math::Prime::Util::PrimeArray';
71 @got = map { $primes[$_] } @order;
89 my @primes; tie @primes, 'Math::Prime::Util::PrimeArray';
95 my @primes; tie @primes, 'Math::Prime::Util::PrimeArray';
103 my @primes; tie @primes, 'Math::Prime::Util::PrimeArray';
104 is( shift @primes, 2, "shift 2");
105 is( shift @primes, 3, "shift 3");
106 is( shift @primes, 5, "shift 5");
107 is( shift @primes, 7, "shift 7");
110 unshift @primes, 1;
[all …]
H A D11-primes.t17 primes => \&Math::Prime::Util::primes,
24 ok(!eval { primes(undef); }, "primes(undef)");
25 ok(!eval { primes("a"); }, "primes(a)");
26 ok(!eval { primes(-4); }, "primes(-4)");
27 ok(!eval { primes(2,undef); }, "primes(2,undef)");
28 ok(!eval { primes(2,'x'); }, "primes(2,x)");
29 ok(!eval { primes(2,-4); }, "primes(2,-4)");
31 ok(!eval { primes('x',7); }, "primes(x,7)");
32 ok(!eval { primes(-10,7); }, "primes(-10,7)");
34 ok(!eval { primes('x','x'); }, "primes(x,x)");
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/lib/math/
H A Dprime_numbers.c11 struct primes { struct
14 unsigned long primes[]; argument
21 .primes = {
46 .primes = {
65 static const struct primes __rcu *primes = RCU_INITIALIZER(&small_primes); variable
111 const struct primes *p; in expand_to_next_prime()
112 struct primes *new; in expand_to_next_prime()
145 bitmap_copy(new->primes, p->primes, p->sz); in expand_to_next_prime()
163 const struct primes *p; in free_primes()
190 const struct primes *p; in next_prime_number()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/lib/math/
H A Dprime_numbers.c11 struct primes { struct
14 unsigned long primes[]; member
21 .primes = {
46 .primes = {
65 static const struct primes __rcu *primes = RCU_INITIALIZER(&small_primes); variable
111 const struct primes *p; in expand_to_next_prime()
112 struct primes *new; in expand_to_next_prime()
145 bitmap_copy(new->primes, p->primes, p->sz); in expand_to_next_prime()
163 const struct primes *p; in free_primes()
190 const struct primes *p; in next_prime_number()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/lib/math/
H A Dprime_numbers.c11 struct primes { struct
14 unsigned long primes[]; argument
21 .primes = {
46 .primes = {
65 static const struct primes __rcu *primes = RCU_INITIALIZER(&small_primes); variable
111 const struct primes *p; in expand_to_next_prime()
112 struct primes *new; in expand_to_next_prime()
145 bitmap_copy(new->primes, p->primes, p->sz); in expand_to_next_prime()
163 const struct primes *p; in free_primes()
190 const struct primes *p; in next_prime_number()
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/src/Utilities/
H A DPrimeNumberSet.h58 std::vector<UIntType> primes;
71 primes.push_back(3);
80 if (largest % primes[j] == 0)
85 else if (primes[j] * primes[j] > largest)
92 primes.push_back(largest);
116 primes_add.insert(primes_add.end(), primes.begin() + offset, primes.begin() + offset + n);
119 UIntType largest = primes.back();
127 if (largest % primes[j] == 0)
132 else if (primes[j] * primes[j] > largest)
139 primes.push_back(largest);
[all …]
/dports/devel/ftnchek/ftnchek-3.3.1/test/Okay/
H A Dprimes.fcx4 File primes.f:
13 6 integer primes(MAXPRIMES)
19 12 C Get list of primes up to M
22 15 C Print the primes
42 "primes.f", line 13: PRIMES used
43 "primes.f", line 16: PRIMES may be set
48 "primes.f", line 7: MAKEPRIMES defined
49 "primes.f", line 3: MAXPRIMES declared
50 "primes.f", line 2: NUMPRIMES declared
122 52 C return number of primes found
[all …]
/dports/math/primecount/primecount-7.2/lib/primesieve/src/
H A Diterator-c.cpp41 T* primes = (T*) it->vector; in getPrimes() local
42 return *primes; in getPrimes()
72 primes.clear(); in primesieve_skipto()
83 delete primes; in primesieve_free_iterator()
101 primes.resize(256); in primesieve_generate_next_primes()
102 it->primes = &primes[0]; in primesieve_generate_next_primes()
127 primes.resize(1); in primesieve_generate_next_primes()
147 primes.clear(); in primesieve_generate_prev_primes()
150 while (primes.empty()) in primesieve_generate_prev_primes()
165 primes.resize(1); in primesieve_generate_prev_primes()
[all …]
/dports/math/primesieve/primesieve-7.7/src/
H A Diterator-c.cpp41 T* primes = (T*) it->vector; in getPrimes() local
42 return *primes; in getPrimes()
72 primes.clear(); in primesieve_skipto()
83 delete primes; in primesieve_free_iterator()
101 primes.resize(256); in primesieve_generate_next_primes()
102 it->primes = &primes[0]; in primesieve_generate_next_primes()
127 primes.resize(1); in primesieve_generate_next_primes()
147 primes.clear(); in primesieve_generate_prev_primes()
150 while (primes.empty()) in primesieve_generate_prev_primes()
165 primes.resize(1); in primesieve_generate_prev_primes()
[all …]
/dports/mail/ifile/ifile-1.3.8/
H A Dprimes.c46 static unsigned *primes, *next_multiple; in _ifile_nextprime() local
52 if (! primes) in _ifile_nextprime()
55 primes = (unsigned *) ifile_malloc (primes_size * sizeof (*primes)); in _ifile_nextprime()
59 primes[0] = 2; next_multiple[0] = 6; in _ifile_nextprime()
67 if (n <= primes[0]) in _ifile_nextprime()
69 return primes[0]; in _ifile_nextprime()
96 unsigned twice_prime = 2 * primes[i]; in _ifile_nextprime()
112 primes = (unsigned int *) ifile_realloc (primes, in _ifile_nextprime()
118 primes[primes_len] = i; in _ifile_nextprime()
138 if (primes[mid] < n) in _ifile_nextprime()
[all …]
/dports/math/p5-Bit-Vector/Bit-Vector-7.4/t/
H A D30__overloaded.t250 if (! $primes)
254 $primes->Fill();
255 if ($primes)
269 $primes -= 0;
270 $primes -= 1;
407 if (23 < $primes)
410 if (23 <= $primes)
420 if ($primes > 23)
433 $temp = ($primes + $odd) - ($primes * $odd);
460 if (($primes + $even) == ~($odd - $primes))
[all …]
/dports/math/eclib/eclib-20210318/tests/out_ntl/
H A Dtate.out10 Reduction type at bad primes:
22 Reduction type at bad primes:
35 Reduction type at bad primes:
48 Reduction type at bad primes:
60 Reduction type at bad primes:
72 Reduction type at bad primes:
85 Reduction type at bad primes:
98 Reduction type at bad primes:
111 Reduction type at bad primes:
124 Reduction type at bad primes:
[all …]
/dports/math/eclib/eclib-20210318/tests/out_no_ntl/
H A Dtate.out10 Reduction type at bad primes:
22 Reduction type at bad primes:
35 Reduction type at bad primes:
48 Reduction type at bad primes:
60 Reduction type at bad primes:
72 Reduction type at bad primes:
85 Reduction type at bad primes:
98 Reduction type at bad primes:
111 Reduction type at bad primes:
124 Reduction type at bad primes:
[all …]
/dports/math/primecount/primecount-7.2/lib/primesieve/test/
H A Dgenerate_primes1.cpp64 vector<uint64_t> primes; in main()
66 generate_primes(100, &primes);
67 cout << "primes.size() = " << primes.size();
68 check(primes.size() == 25); local
70 for (uint64_t i = 0; i < primes.size(); i++)
73 check(primes[i] == small_primes[i]);
76 primes.clear();
79 cout << "primes.size() = " << primes.size();
80 check(primes.size() == 19);
82 for (uint64_t i = 0; i < primes.size(); i++)
[all …]
H A Dgenerate_n_primes1.cpp64 vector<uint64_t> primes;
66 generate_n_primes(25, &primes);
67 cout << "primes.size() = " << primes.size();
68 check(primes.size() == 25);
70 for (uint64_t i = 0; i < primes.size(); i++)
73 check(primes[i] == small_primes[i]);
76 primes.clear();
79 cout << "primes.size() = " << primes.size();
80 check(primes.size() == 19);
82 for (uint64_t i = 0; i < primes.size(); i++)
[all …]
H A Dprev_prime1.cpp30 vector<uint64_t> primes;
33 uint64_t back = primes.size() - 1;
38 it.skipto(primes[i] + 1);
41 check(prime == primes[i]);
43 it.skipto(primes[i]);
46 check(prime == primes[i - 1]);
72 check(prime == primes[i]);
75 it.skipto(primes.back());
80 uint64_t p1 = primes.size() - (i + 1);
83 check(prime == primes[p2]);
[all …]
/dports/math/primesieve/primesieve-7.7/test/
H A Dgenerate_n_primes1.cpp64 vector<uint64_t> primes; in main() local
66 generate_n_primes(25, &primes); in main()
67 cout << "primes.size() = " << primes.size(); in main()
68 check(primes.size() == 25); in main()
70 for (uint64_t i = 0; i < primes.size(); i++) in main()
73 check(primes[i] == small_primes[i]); in main()
76 primes.clear(); in main()
79 cout << "primes.size() = " << primes.size(); in main()
80 check(primes.size() == 19); in main()
82 for (uint64_t i = 0; i < primes.size(); i++) in main()
[all …]
H A Dgenerate_primes1.cpp64 vector<uint64_t> primes; in main() local
66 generate_primes(100, &primes); in main()
67 cout << "primes.size() = " << primes.size(); in main()
68 check(primes.size() == 25); in main()
70 for (uint64_t i = 0; i < primes.size(); i++) in main()
73 check(primes[i] == small_primes[i]); in main()
76 primes.clear(); in main()
79 cout << "primes.size() = " << primes.size(); in main()
80 check(primes.size() == 19); in main()
82 for (uint64_t i = 0; i < primes.size(); i++) in main()
[all …]
H A Dprev_prime1.cpp30 vector<uint64_t> primes; in main() local
33 uint64_t back = primes.size() - 1; in main()
38 it.skipto(primes[i] + 1); in main()
41 check(prime == primes[i]); in main()
43 it.skipto(primes[i]); in main()
46 check(prime == primes[i - 1]); in main()
72 check(prime == primes[i]); in main()
75 it.skipto(primes.back()); in main()
80 uint64_t p1 = primes.size() - (i + 1); in main()
83 check(prime == primes[p2]); in main()
[all …]
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/base/drawable/
H A DComposite.java45 private Primitive[] primes; field in Composite
51 primes = null; in Composite()
99 primes = in_primes; in Composite()
109 if ( primes != null ) in resolveCategory()
137 if ( primes != null ) in getNumOfPrimitives()
138 return primes.length; in getNumOfPrimitives()
159 if ( primes != null ) in getByteSize()
201 primes[ idx ] = prime; in readObject()
247 primes = in_primes; in setPrimitives()
254 return primes; in getPrimitives()
[all …]
/dports/math/py-chaospy/chaospy-4.3.3/chaospy/distributions/sampler/sequences/
H A Dhalton.py5 from .primes import create_primes
8 def create_halton_samples(order, dim=1, burnin=-1, primes=()): argument
48 primes = list(primes)
49 if not primes:
51 while len(primes) < dim:
52 primes = create_primes(prime_order)
54 primes = primes[:dim]
55 assert len(primes) == dim, "not enough primes"
58 burnin = max(primes)
64 indices, number_base=primes[dim_])

12345678910>>...97