Lines Matching defs:in
23 // handle all next_prime(i) for i in [1, 210), special case 0
138 // some potential prime numbers are not prime. In an ideal world, all potential
183 // If n is small enough, search in small_primes
189 // Start searching list of potential primes: L * k0 + indices[in]
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L)
196 n = L * k0 + indices[in];
201 // 2. The i > sqrt(n), in which case n is prime.
561 if (++in == M)
564 in = 0;
566 n = L * k0 + indices[in];
