Lines Matching +defs:L +defs:M

68   const size_t L = 210;
76   // Start searching list of potential primes: L * k0 + indices[in]
77   const size_t M = sizeof(indices) / sizeof(indices[0]);
79   //   Known a-priori n >= L
80   size_t k0 = n / L;
81   size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices);
82   n         = L * k0 + indices[in];
444     if (++in == M) {
448     n = L * k0 + indices[in];