Lines Matching +full:- +full:i
1 //===-------------------------- hash.cpp ----------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
15 #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
22 // handle all next_prime(i) for i in [1, 210), special case 0
75 // potential primes = 210*k + indices[i], k >= 1
135 // The algorithm creates a list of small primes, plus an open-ended list of
175 if (n <= small_primes[N-1]) in __next_prime()
183 // Known a-priori n >= L in __next_prime()
185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
186 - indices); in __next_prime()
190 // Divide n by all primes or potential primes (i) until: in __next_prime()
192 // 2. The i > sqrt(n), in which case n is prime. in __next_prime()
193 // It is known a-priori that n is not divisible by 2, 3, 5 or 7, in __next_prime()
194 // so don't test those (j == 5 -> divide by 11 first). And the in __next_prime()
197 for (size_t j = 5; j < N - 1; ++j) in __next_prime()
208 size_t i = 211; in __next_prime() local
211 std::size_t q = n / i; in __next_prime()
212 if (q < i) in __next_prime()
214 if (n == q * i) in __next_prime()
217 i += 10; in __next_prime()
218 q = n / i; in __next_prime()
219 if (q < i) in __next_prime()
221 if (n == q * i) in __next_prime()
224 i += 2; in __next_prime()
225 q = n / i; in __next_prime()
226 if (q < i) in __next_prime()
228 if (n == q * i) in __next_prime()
231 i += 4; in __next_prime()
232 q = n / i; in __next_prime()
233 if (q < i) in __next_prime()
235 if (n == q * i) in __next_prime()
238 i += 2; in __next_prime()
239 q = n / i; in __next_prime()
240 if (q < i) in __next_prime()
242 if (n == q * i) in __next_prime()
245 i += 4; in __next_prime()
246 q = n / i; in __next_prime()
247 if (q < i) in __next_prime()
249 if (n == q * i) in __next_prime()
252 i += 6; in __next_prime()
253 q = n / i; in __next_prime()
254 if (q < i) in __next_prime()
256 if (n == q * i) in __next_prime()
259 i += 2; in __next_prime()
260 q = n / i; in __next_prime()
261 if (q < i) in __next_prime()
263 if (n == q * i) in __next_prime()
266 i += 6; in __next_prime()
267 q = n / i; in __next_prime()
268 if (q < i) in __next_prime()
270 if (n == q * i) in __next_prime()
273 i += 4; in __next_prime()
274 q = n / i; in __next_prime()
275 if (q < i) in __next_prime()
277 if (n == q * i) in __next_prime()
280 i += 2; in __next_prime()
281 q = n / i; in __next_prime()
282 if (q < i) in __next_prime()
284 if (n == q * i) in __next_prime()
287 i += 4; in __next_prime()
288 q = n / i; in __next_prime()
289 if (q < i) in __next_prime()
291 if (n == q * i) in __next_prime()
294 i += 6; in __next_prime()
295 q = n / i; in __next_prime()
296 if (q < i) in __next_prime()
298 if (n == q * i) in __next_prime()
301 i += 6; in __next_prime()
302 q = n / i; in __next_prime()
303 if (q < i) in __next_prime()
305 if (n == q * i) in __next_prime()
308 i += 2; in __next_prime()
309 q = n / i; in __next_prime()
310 if (q < i) in __next_prime()
312 if (n == q * i) in __next_prime()
315 i += 6; in __next_prime()
316 q = n / i; in __next_prime()
317 if (q < i) in __next_prime()
319 if (n == q * i) in __next_prime()
322 i += 4; in __next_prime()
323 q = n / i; in __next_prime()
324 if (q < i) in __next_prime()
326 if (n == q * i) in __next_prime()
329 i += 2; in __next_prime()
330 q = n / i; in __next_prime()
331 if (q < i) in __next_prime()
333 if (n == q * i) in __next_prime()
336 i += 6; in __next_prime()
337 q = n / i; in __next_prime()
338 if (q < i) in __next_prime()
340 if (n == q * i) in __next_prime()
343 i += 4; in __next_prime()
344 q = n / i; in __next_prime()
345 if (q < i) in __next_prime()
347 if (n == q * i) in __next_prime()
350 i += 6; in __next_prime()
351 q = n / i; in __next_prime()
352 if (q < i) in __next_prime()
354 if (n == q * i) in __next_prime()
357 i += 8; in __next_prime()
358 q = n / i; in __next_prime()
359 if (q < i) in __next_prime()
361 if (n == q * i) in __next_prime()
364 i += 4; in __next_prime()
365 q = n / i; in __next_prime()
366 if (q < i) in __next_prime()
368 if (n == q * i) in __next_prime()
371 i += 2; in __next_prime()
372 q = n / i; in __next_prime()
373 if (q < i) in __next_prime()
375 if (n == q * i) in __next_prime()
378 i += 4; in __next_prime()
379 q = n / i; in __next_prime()
380 if (q < i) in __next_prime()
382 if (n == q * i) in __next_prime()
385 i += 2; in __next_prime()
386 q = n / i; in __next_prime()
387 if (q < i) in __next_prime()
389 if (n == q * i) in __next_prime()
392 i += 4; in __next_prime()
393 q = n / i; in __next_prime()
394 if (q < i) in __next_prime()
396 if (n == q * i) in __next_prime()
399 i += 8; in __next_prime()
400 q = n / i; in __next_prime()
401 if (q < i) in __next_prime()
403 if (n == q * i) in __next_prime()
406 i += 6; in __next_prime()
407 q = n / i; in __next_prime()
408 if (q < i) in __next_prime()
410 if (n == q * i) in __next_prime()
413 i += 4; in __next_prime()
414 q = n / i; in __next_prime()
415 if (q < i) in __next_prime()
417 if (n == q * i) in __next_prime()
420 i += 6; in __next_prime()
421 q = n / i; in __next_prime()
422 if (q < i) in __next_prime()
424 if (n == q * i) in __next_prime()
427 i += 2; in __next_prime()
428 q = n / i; in __next_prime()
429 if (q < i) in __next_prime()
431 if (n == q * i) in __next_prime()
434 i += 4; in __next_prime()
435 q = n / i; in __next_prime()
436 if (q < i) in __next_prime()
438 if (n == q * i) in __next_prime()
441 i += 6; in __next_prime()
442 q = n / i; in __next_prime()
443 if (q < i) in __next_prime()
445 if (n == q * i) in __next_prime()
448 i += 2; in __next_prime()
449 q = n / i; in __next_prime()
450 if (q < i) in __next_prime()
452 if (n == q * i) in __next_prime()
455 i += 6; in __next_prime()
456 q = n / i; in __next_prime()
457 if (q < i) in __next_prime()
459 if (n == q * i) in __next_prime()
462 i += 6; in __next_prime()
463 q = n / i; in __next_prime()
464 if (q < i) in __next_prime()
466 if (n == q * i) in __next_prime()
469 i += 4; in __next_prime()
470 q = n / i; in __next_prime()
471 if (q < i) in __next_prime()
473 if (n == q * i) in __next_prime()
476 i += 2; in __next_prime()
477 q = n / i; in __next_prime()
478 if (q < i) in __next_prime()
480 if (n == q * i) in __next_prime()
483 i += 4; in __next_prime()
484 q = n / i; in __next_prime()
485 if (q < i) in __next_prime()
487 if (n == q * i) in __next_prime()
490 i += 6; in __next_prime()
491 q = n / i; in __next_prime()
492 if (q < i) in __next_prime()
494 if (n == q * i) in __next_prime()
497 i += 2; in __next_prime()
498 q = n / i; in __next_prime()
499 if (q < i) in __next_prime()
501 if (n == q * i) in __next_prime()
504 i += 6; in __next_prime()
505 q = n / i; in __next_prime()
506 if (q < i) in __next_prime()
508 if (n == q * i) in __next_prime()
511 i += 4; in __next_prime()
512 q = n / i; in __next_prime()
513 if (q < i) in __next_prime()
515 if (n == q * i) in __next_prime()
518 i += 2; in __next_prime()
519 q = n / i; in __next_prime()
520 if (q < i) in __next_prime()
522 if (n == q * i) in __next_prime()
525 i += 4; in __next_prime()
526 q = n / i; in __next_prime()
527 if (q < i) in __next_prime()
529 if (n == q * i) in __next_prime()
532 i += 2; in __next_prime()
533 q = n / i; in __next_prime()
534 if (q < i) in __next_prime()
536 if (n == q * i) in __next_prime()
539 i += 10; in __next_prime()
540 q = n / i; in __next_prime()
541 if (q < i) in __next_prime()
543 if (n == q * i) in __next_prime()
546 // This will loop i to the next "plane" of potential primes in __next_prime()
547 i += 2; in __next_prime()