Lines Matching refs:n
179 __next_prime(size_t n) in __next_prime() argument
184 if (n <= small_primes[N-1]) in __next_prime()
185 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime()
188 __check_for_overflow(n); in __next_prime()
193 size_t k0 = n / L; in __next_prime()
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
196 n = L * k0 + indices[in]; in __next_prime()
209 const std::size_t q = n / p; in __next_prime()
211 return n; in __next_prime()
212 if (n == q * p) in __next_prime()
220 std::size_t q = n / i; in __next_prime()
222 return n; in __next_prime()
223 if (n == q * i) in __next_prime()
227 q = n / i; in __next_prime()
229 return n; in __next_prime()
230 if (n == q * i) in __next_prime()
234 q = n / i; in __next_prime()
236 return n; in __next_prime()
237 if (n == q * i) in __next_prime()
241 q = n / i; in __next_prime()
243 return n; in __next_prime()
244 if (n == q * i) in __next_prime()
248 q = n / i; in __next_prime()
250 return n; in __next_prime()
251 if (n == q * i) in __next_prime()
255 q = n / i; in __next_prime()
257 return n; in __next_prime()
258 if (n == q * i) in __next_prime()
262 q = n / i; in __next_prime()
264 return n; in __next_prime()
265 if (n == q * i) in __next_prime()
269 q = n / i; in __next_prime()
271 return n; in __next_prime()
272 if (n == q * i) in __next_prime()
276 q = n / i; in __next_prime()
278 return n; in __next_prime()
279 if (n == q * i) in __next_prime()
283 q = n / i; in __next_prime()
285 return n; in __next_prime()
286 if (n == q * i) in __next_prime()
290 q = n / i; in __next_prime()
292 return n; in __next_prime()
293 if (n == q * i) in __next_prime()
297 q = n / i; in __next_prime()
299 return n; in __next_prime()
300 if (n == q * i) in __next_prime()
304 q = n / i; in __next_prime()
306 return n; in __next_prime()
307 if (n == q * i) in __next_prime()
311 q = n / i; in __next_prime()
313 return n; in __next_prime()
314 if (n == q * i) in __next_prime()
318 q = n / i; in __next_prime()
320 return n; in __next_prime()
321 if (n == q * i) in __next_prime()
325 q = n / i; in __next_prime()
327 return n; in __next_prime()
328 if (n == q * i) in __next_prime()
332 q = n / i; in __next_prime()
334 return n; in __next_prime()
335 if (n == q * i) in __next_prime()
339 q = n / i; in __next_prime()
341 return n; in __next_prime()
342 if (n == q * i) in __next_prime()
346 q = n / i; in __next_prime()
348 return n; in __next_prime()
349 if (n == q * i) in __next_prime()
353 q = n / i; in __next_prime()
355 return n; in __next_prime()
356 if (n == q * i) in __next_prime()
360 q = n / i; in __next_prime()
362 return n; in __next_prime()
363 if (n == q * i) in __next_prime()
367 q = n / i; in __next_prime()
369 return n; in __next_prime()
370 if (n == q * i) in __next_prime()
374 q = n / i; in __next_prime()
376 return n; in __next_prime()
377 if (n == q * i) in __next_prime()
381 q = n / i; in __next_prime()
383 return n; in __next_prime()
384 if (n == q * i) in __next_prime()
388 q = n / i; in __next_prime()
390 return n; in __next_prime()
391 if (n == q * i) in __next_prime()
395 q = n / i; in __next_prime()
397 return n; in __next_prime()
398 if (n == q * i) in __next_prime()
402 q = n / i; in __next_prime()
404 return n; in __next_prime()
405 if (n == q * i) in __next_prime()
409 q = n / i; in __next_prime()
411 return n; in __next_prime()
412 if (n == q * i) in __next_prime()
416 q = n / i; in __next_prime()
418 return n; in __next_prime()
419 if (n == q * i) in __next_prime()
423 q = n / i; in __next_prime()
425 return n; in __next_prime()
426 if (n == q * i) in __next_prime()
430 q = n / i; in __next_prime()
432 return n; in __next_prime()
433 if (n == q * i) in __next_prime()
437 q = n / i; in __next_prime()
439 return n; in __next_prime()
440 if (n == q * i) in __next_prime()
444 q = n / i; in __next_prime()
446 return n; in __next_prime()
447 if (n == q * i) in __next_prime()
451 q = n / i; in __next_prime()
453 return n; in __next_prime()
454 if (n == q * i) in __next_prime()
458 q = n / i; in __next_prime()
460 return n; in __next_prime()
461 if (n == q * i) in __next_prime()
465 q = n / i; in __next_prime()
467 return n; in __next_prime()
468 if (n == q * i) in __next_prime()
472 q = n / i; in __next_prime()
474 return n; in __next_prime()
475 if (n == q * i) in __next_prime()
479 q = n / i; in __next_prime()
481 return n; in __next_prime()
482 if (n == q * i) in __next_prime()
486 q = n / i; in __next_prime()
488 return n; in __next_prime()
489 if (n == q * i) in __next_prime()
493 q = n / i; in __next_prime()
495 return n; in __next_prime()
496 if (n == q * i) in __next_prime()
500 q = n / i; in __next_prime()
502 return n; in __next_prime()
503 if (n == q * i) in __next_prime()
507 q = n / i; in __next_prime()
509 return n; in __next_prime()
510 if (n == q * i) in __next_prime()
514 q = n / i; in __next_prime()
516 return n; in __next_prime()
517 if (n == q * i) in __next_prime()
521 q = n / i; in __next_prime()
523 return n; in __next_prime()
524 if (n == q * i) in __next_prime()
528 q = n / i; in __next_prime()
530 return n; in __next_prime()
531 if (n == q * i) in __next_prime()
535 q = n / i; in __next_prime()
537 return n; in __next_prime()
538 if (n == q * i) in __next_prime()
542 q = n / i; in __next_prime()
544 return n; in __next_prime()
545 if (n == q * i) in __next_prime()
549 q = n / i; in __next_prime()
551 return n; in __next_prime()
552 if (n == q * i) in __next_prime()
566 n = L * k0 + indices[in]; in __next_prime()