Lines Matching defs:indices
75 // potential primes = 210*k + indices[i], k >= 1
78 const unsigned indices[] =
180 // Start searching list of potential primes: L * k0 + indices[in]
181 const size_t M = sizeof(indices) / sizeof(indices[0]);
185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L)
186 - indices);
187 n = L * k0 + indices[in];
557 n = L * k0 + indices[in];