Lines Matching full:n
36 // Returns: If n == 0, returns 0. Else returns the lowest prime number that
37 // is greater than or equal to n.
56 inline _LIBCPP_HIDE_FROM_ABI typename enable_if<_Sz == 4, void>::type __check_for_overflow(size_t N… in __check_for_overflow() argument
57 if (N > 0xFFFFFFFB) in __check_for_overflow()
62 inline _LIBCPP_HIDE_FROM_ABI typename enable_if<_Sz == 8, void>::type __check_for_overflow(size_t N… in __check_for_overflow() argument
63 if (N > 0xFFFFFFFFFFFFFFC5ull) in __check_for_overflow()
67 size_t __next_prime(size_t n) { in __next_prime() argument
69 const size_t N = sizeof(small_primes) / sizeof(small_primes[0]); in __next_prime() local
70 // If n is small enough, search in small_primes in __next_prime()
71 if (n <= small_primes[N - 1]) in __next_prime()
72 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime()
73 // Else n > largest small_primes in __next_prime()
75 __check_for_overflow(n); in __next_prime()
78 // Select first potential prime >= n in __next_prime()
79 // Known a-priori n >= L in __next_prime()
80 size_t k0 = n / L; in __next_prime()
81 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices); in __next_prime()
82 n = L * k0 + indices[in]; in __next_prime()
84 // Divide n by all primes or potential primes (i) until: in __next_prime()
86 // 2. The i > sqrt(n), in which case n is prime. in __next_prime()
87 // It is known a-priori that n is not divisible by 2, 3, 5 or 7, in __next_prime()
91 for (size_t j = 5; j < N - 1; ++j) { in __next_prime()
93 const std::size_t q = n / p; in __next_prime()
95 return n; in __next_prime()
96 if (n == q * p) in __next_prime()
99 // n wasn't divisible by small primes, try potential primes in __next_prime()
103 std::size_t q = n / i; in __next_prime()
105 return n; in __next_prime()
106 if (n == q * i) in __next_prime()
110 q = n / i; in __next_prime()
112 return n; in __next_prime()
113 if (n == q * i) in __next_prime()
117 q = n / i; in __next_prime()
119 return n; in __next_prime()
120 if (n == q * i) in __next_prime()
124 q = n / i; in __next_prime()
126 return n; in __next_prime()
127 if (n == q * i) in __next_prime()
131 q = n / i; in __next_prime()
133 return n; in __next_prime()
134 if (n == q * i) in __next_prime()
138 q = n / i; in __next_prime()
140 return n; in __next_prime()
141 if (n == q * i) in __next_prime()
145 q = n / i; in __next_prime()
147 return n; in __next_prime()
148 if (n == q * i) in __next_prime()
152 q = n / i; in __next_prime()
154 return n; in __next_prime()
155 if (n == q * i) in __next_prime()
159 q = n / i; in __next_prime()
161 return n; in __next_prime()
162 if (n == q * i) in __next_prime()
166 q = n / i; in __next_prime()
168 return n; in __next_prime()
169 if (n == q * i) in __next_prime()
173 q = n / i; in __next_prime()
175 return n; in __next_prime()
176 if (n == q * i) in __next_prime()
180 q = n / i; in __next_prime()
182 return n; in __next_prime()
183 if (n == q * i) in __next_prime()
187 q = n / i; in __next_prime()
189 return n; in __next_prime()
190 if (n == q * i) in __next_prime()
194 q = n / i; in __next_prime()
196 return n; in __next_prime()
197 if (n == q * i) in __next_prime()
201 q = n / i; in __next_prime()
203 return n; in __next_prime()
204 if (n == q * i) in __next_prime()
208 q = n / i; in __next_prime()
210 return n; in __next_prime()
211 if (n == q * i) in __next_prime()
215 q = n / i; in __next_prime()
217 return n; in __next_prime()
218 if (n == q * i) in __next_prime()
222 q = n / i; in __next_prime()
224 return n; in __next_prime()
225 if (n == q * i) in __next_prime()
229 q = n / i; in __next_prime()
231 return n; in __next_prime()
232 if (n == q * i) in __next_prime()
236 q = n / i; in __next_prime()
238 return n; in __next_prime()
239 if (n == q * i) in __next_prime()
243 q = n / i; in __next_prime()
245 return n; in __next_prime()
246 if (n == q * i) in __next_prime()
250 q = n / i; in __next_prime()
252 return n; in __next_prime()
253 if (n == q * i) in __next_prime()
257 q = n / i; in __next_prime()
259 return n; in __next_prime()
260 if (n == q * i) in __next_prime()
264 q = n / i; in __next_prime()
266 return n; in __next_prime()
267 if (n == q * i) in __next_prime()
271 q = n / i; in __next_prime()
273 return n; in __next_prime()
274 if (n == q * i) in __next_prime()
278 q = n / i; in __next_prime()
280 return n; in __next_prime()
281 if (n == q * i) in __next_prime()
285 q = n / i; in __next_prime()
287 return n; in __next_prime()
288 if (n == q * i) in __next_prime()
292 q = n / i; in __next_prime()
294 return n; in __next_prime()
295 if (n == q * i) in __next_prime()
299 q = n / i; in __next_prime()
301 return n; in __next_prime()
302 if (n == q * i) in __next_prime()
306 q = n / i; in __next_prime()
308 return n; in __next_prime()
309 if (n == q * i) in __next_prime()
313 q = n / i; in __next_prime()
315 return n; in __next_prime()
316 if (n == q * i) in __next_prime()
320 q = n / i; in __next_prime()
322 return n; in __next_prime()
323 if (n == q * i) in __next_prime()
327 q = n / i; in __next_prime()
329 return n; in __next_prime()
330 if (n == q * i) in __next_prime()
334 q = n / i; in __next_prime()
336 return n; in __next_prime()
337 if (n == q * i) in __next_prime()
341 q = n / i; in __next_prime()
343 return n; in __next_prime()
344 if (n == q * i) in __next_prime()
348 q = n / i; in __next_prime()
350 return n; in __next_prime()
351 if (n == q * i) in __next_prime()
355 q = n / i; in __next_prime()
357 return n; in __next_prime()
358 if (n == q * i) in __next_prime()
362 q = n / i; in __next_prime()
364 return n; in __next_prime()
365 if (n == q * i) in __next_prime()
369 q = n / i; in __next_prime()
371 return n; in __next_prime()
372 if (n == q * i) in __next_prime()
376 q = n / i; in __next_prime()
378 return n; in __next_prime()
379 if (n == q * i) in __next_prime()
383 q = n / i; in __next_prime()
385 return n; in __next_prime()
386 if (n == q * i) in __next_prime()
390 q = n / i; in __next_prime()
392 return n; in __next_prime()
393 if (n == q * i) in __next_prime()
397 q = n / i; in __next_prime()
399 return n; in __next_prime()
400 if (n == q * i) in __next_prime()
404 q = n / i; in __next_prime()
406 return n; in __next_prime()
407 if (n == q * i) in __next_prime()
411 q = n / i; in __next_prime()
413 return n; in __next_prime()
414 if (n == q * i) in __next_prime()
418 q = n / i; in __next_prime()
420 return n; in __next_prime()
421 if (n == q * i) in __next_prime()
425 q = n / i; in __next_prime()
427 return n; in __next_prime()
428 if (n == q * i) in __next_prime()
432 q = n / i; in __next_prime()
434 return n; in __next_prime()
435 if (n == q * i) in __next_prime()
443 // n is not prime. Increment n to next potential prime. in __next_prime()
448 n = L * k0 + indices[in]; in __next_prime()