Searched refs:primes (Results 1 - 11 of 11) sorted by relevance
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | static21-a.cc | 5 static const unsigned long primes[n_primes + 1]; member in struct:X 12 const unsigned long X<dummy>::primes[n_primes + 1] = member in class:X 16 const unsigned long *f1(void){return &X<0>::primes[0];}
|
H A D | static21.C | 9 static const unsigned long primes[n_primes + 1]; member in struct:X 16 const unsigned long X<dummy>::primes[n_primes + 1] = member in class:X 19 const unsigned long *f(void){return &X<0>::primes[0];}
|
H A D | static15.C | 8 static const unsigned long primes[n_primes + 1]; member in struct:X 15 const unsigned long X<dummy>::primes[n_primes + 1] = member in class:X
|
/haiku-buildtools/gcc/gmp/tests/mpz/ |
H A D | t-perfpow.c | 110 mpz_t n, np, temp, primes[NRP]; local 123 mpz_init (primes[i]); 128 nrprimes = mpz_get_ui (np) % NRP + 1; /* 1-NRP unique primes */ 136 primebits = mpz_get_ui (np) % 100 + 3; /* 3-102 bit primes */ 137 mpz_urandomb (primes[j], rands, primebits); 138 mpz_nextprime (primes[j], primes[j]); 142 if (mpz_cmp (primes[j], primes[k]) == 0) 185 mpz_pow_ui (n, primes[ [all...] |
/haiku-buildtools/gcc/gmp/demos/ |
H A D | primes.c | 1 /* List and count primes. 26 * Do not fill primes[] with real primes when the range [fr,to] is small, 27 when fr,to are relatively large. Fill primes[] with odd numbers instead. 28 [Probably a bad idea, since the primes[] array would become very large.] 29 * Separate small primes and large primes when sieving. Either the Montgomery 31 separate loops for primes <= S and primes > S. The latter primes d 55 struct primes struct 61 struct primes *primes; variable in typeref:struct:primes [all...] |
H A D | Makefile.am | 33 EXTRA_PROGRAMS = factorize isprime pexpr primes qcn
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/ |
H A D | 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] {
|
H A D | 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...] |
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | pprime_p.c | 36 value congruent to r*2^n mod d. Since all the primes being tested are 95 /* Do more dividing. We collect small primes, using umul_ppmm, until we 96 overflow a single limb. We divide our number by the small primes product, 102 unsigned int primes[15]; local 117 if (r % primes[nprimes] == 0) 119 ASSERT_ALWAYS (mpn_mod_1 (PTR(n), (mp_size_t) SIZ(n), (mp_limb_t) primes[nprimes]) == 0); 129 primes[nprimes++] = q;
|
/haiku-buildtools/binutils/bfd/ |
H A D | 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])];
|
/haiku-buildtools/isl/ |
H A D | isl_output.c | 179 int primes; local 196 primes = count_same_name(dim, name == buffer ? isl_dim_div : type, 199 while (primes-- > 0)
|
Completed in 72 milliseconds