Lines Matching full:indices
26 // potential primes = 210*k + indices[i], k >= 1
29 const unsigned indices[] = {
76 // Start searching list of potential primes: L * k0 + indices[in]
77 const size_t M = sizeof(indices) / sizeof(indices[0]);
81 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices);
82 n = L * k0 + indices[in];
448 n = L * k0 + indices[in];