Lines Matching refs:n
36 // Returns: If n == 0, returns 0. Else returns the lowest prime number that
37 // is greater than or equal to n.
67 size_t __next_prime(size_t n) {
70 // If n is small enough, search in small_primes
71 if (n <= small_primes[N - 1])
72 return *std::lower_bound(small_primes, small_primes + N, n);
73 // Else n > largest small_primes
75 __check_for_overflow(n);
78 // Select first potential prime >= n
79 // Known a-priori n >= L
80 size_t k0 = n / L;
81 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices);
82 n = L * k0 + indices[in];
84 // Divide n by all primes or potential primes (i) until:
86 // 2. The i > sqrt(n), in which case n is prime.
87 // It is known a-priori that n is not divisible by 2, 3, 5 or 7,
93 const std::size_t q = n / p;
95 return n;
96 if (n == q * p)
99 // n wasn't divisible by small primes, try potential primes
103 std::size_t q = n / i;
105 return n;
106 if (n == q * i)
110 q = n / i;
112 return n;
113 if (n == q * i)
117 q = n / i;
119 return n;
120 if (n == q * i)
124 q = n / i;
126 return n;
127 if (n == q * i)
131 q = n / i;
133 return n;
134 if (n == q * i)
138 q = n / i;
140 return n;
141 if (n == q * i)
145 q = n / i;
147 return n;
148 if (n == q * i)
152 q = n / i;
154 return n;
155 if (n == q * i)
159 q = n / i;
161 return n;
162 if (n == q * i)
166 q = n / i;
168 return n;
169 if (n == q * i)
173 q = n / i;
175 return n;
176 if (n == q * i)
180 q = n / i;
182 return n;
183 if (n == q * i)
187 q = n / i;
189 return n;
190 if (n == q * i)
194 q = n / i;
196 return n;
197 if (n == q * i)
201 q = n / i;
203 return n;
204 if (n == q * i)
208 q = n / i;
210 return n;
211 if (n == q * i)
215 q = n / i;
217 return n;
218 if (n == q * i)
222 q = n / i;
224 return n;
225 if (n == q * i)
229 q = n / i;
231 return n;
232 if (n == q * i)
236 q = n / i;
238 return n;
239 if (n == q * i)
243 q = n / i;
245 return n;
246 if (n == q * i)
250 q = n / i;
252 return n;
253 if (n == q * i)
257 q = n / i;
259 return n;
260 if (n == q * i)
264 q = n / i;
266 return n;
267 if (n == q * i)
271 q = n / i;
273 return n;
274 if (n == q * i)
278 q = n / i;
280 return n;
281 if (n == q * i)
285 q = n / i;
287 return n;
288 if (n == q * i)
292 q = n / i;
294 return n;
295 if (n == q * i)
299 q = n / i;
301 return n;
302 if (n == q * i)
306 q = n / i;
308 return n;
309 if (n == q * i)
313 q = n / i;
315 return n;
316 if (n == q * i)
320 q = n / i;
322 return n;
323 if (n == q * i)
327 q = n / i;
329 return n;
330 if (n == q * i)
334 q = n / i;
336 return n;
337 if (n == q * i)
341 q = n / i;
343 return n;
344 if (n == q * i)
348 q = n / i;
350 return n;
351 if (n == q * i)
355 q = n / i;
357 return n;
358 if (n == q * i)
362 q = n / i;
364 return n;
365 if (n == q * i)
369 q = n / i;
371 return n;
372 if (n == q * i)
376 q = n / i;
378 return n;
379 if (n == q * i)
383 q = n / i;
385 return n;
386 if (n == q * i)
390 q = n / i;
392 return n;
393 if (n == q * i)
397 q = n / i;
399 return n;
400 if (n == q * i)
404 q = n / i;
406 return n;
407 if (n == q * i)
411 q = n / i;
413 return n;
414 if (n == q * i)
418 q = n / i;
420 return n;
421 if (n == q * i)
425 q = n / i;
427 return n;
428 if (n == q * i)
432 q = n / i;
434 return n;
435 if (n == q * i)
443 // n is not prime. Increment n to next potential prime.
448 n = L * k0 + indices[in];