Lines Matching full:i
20 // handle all next_prime(i) for i in [1, 210), special case 0
26 // potential primes = 210*k + indices[i], k >= 1
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()
101 size_t i = 211; in __next_prime() local
103 std::size_t q = n / i; in __next_prime()
104 if (q < i) in __next_prime()
106 if (n == q * i) in __next_prime()
109 i += 10; in __next_prime()
110 q = n / i; in __next_prime()
111 if (q < i) in __next_prime()
113 if (n == q * i) in __next_prime()
116 i += 2; in __next_prime()
117 q = n / i; in __next_prime()
118 if (q < i) in __next_prime()
120 if (n == q * i) in __next_prime()
123 i += 4; in __next_prime()
124 q = n / i; in __next_prime()
125 if (q < i) in __next_prime()
127 if (n == q * i) in __next_prime()
130 i += 2; in __next_prime()
131 q = n / i; in __next_prime()
132 if (q < i) in __next_prime()
134 if (n == q * i) in __next_prime()
137 i += 4; in __next_prime()
138 q = n / i; in __next_prime()
139 if (q < i) in __next_prime()
141 if (n == q * i) in __next_prime()
144 i += 6; in __next_prime()
145 q = n / i; in __next_prime()
146 if (q < i) in __next_prime()
148 if (n == q * i) in __next_prime()
151 i += 2; in __next_prime()
152 q = n / i; in __next_prime()
153 if (q < i) in __next_prime()
155 if (n == q * i) in __next_prime()
158 i += 6; in __next_prime()
159 q = n / i; in __next_prime()
160 if (q < i) in __next_prime()
162 if (n == q * i) in __next_prime()
165 i += 4; in __next_prime()
166 q = n / i; in __next_prime()
167 if (q < i) in __next_prime()
169 if (n == q * i) in __next_prime()
172 i += 2; in __next_prime()
173 q = n / i; in __next_prime()
174 if (q < i) in __next_prime()
176 if (n == q * i) in __next_prime()
179 i += 4; in __next_prime()
180 q = n / i; in __next_prime()
181 if (q < i) in __next_prime()
183 if (n == q * i) in __next_prime()
186 i += 6; in __next_prime()
187 q = n / i; in __next_prime()
188 if (q < i) in __next_prime()
190 if (n == q * i) in __next_prime()
193 i += 6; in __next_prime()
194 q = n / i; in __next_prime()
195 if (q < i) in __next_prime()
197 if (n == q * i) in __next_prime()
200 i += 2; in __next_prime()
201 q = n / i; in __next_prime()
202 if (q < i) in __next_prime()
204 if (n == q * i) in __next_prime()
207 i += 6; in __next_prime()
208 q = n / i; in __next_prime()
209 if (q < i) in __next_prime()
211 if (n == q * i) in __next_prime()
214 i += 4; in __next_prime()
215 q = n / i; in __next_prime()
216 if (q < i) in __next_prime()
218 if (n == q * i) in __next_prime()
221 i += 2; in __next_prime()
222 q = n / i; in __next_prime()
223 if (q < i) in __next_prime()
225 if (n == q * i) in __next_prime()
228 i += 6; in __next_prime()
229 q = n / i; in __next_prime()
230 if (q < i) in __next_prime()
232 if (n == q * i) in __next_prime()
235 i += 4; in __next_prime()
236 q = n / i; in __next_prime()
237 if (q < i) in __next_prime()
239 if (n == q * i) in __next_prime()
242 i += 6; in __next_prime()
243 q = n / i; in __next_prime()
244 if (q < i) in __next_prime()
246 if (n == q * i) in __next_prime()
249 i += 8; in __next_prime()
250 q = n / i; in __next_prime()
251 if (q < i) in __next_prime()
253 if (n == q * i) in __next_prime()
256 i += 4; in __next_prime()
257 q = n / i; in __next_prime()
258 if (q < i) in __next_prime()
260 if (n == q * i) in __next_prime()
263 i += 2; in __next_prime()
264 q = n / i; in __next_prime()
265 if (q < i) in __next_prime()
267 if (n == q * i) in __next_prime()
270 i += 4; in __next_prime()
271 q = n / i; in __next_prime()
272 if (q < i) in __next_prime()
274 if (n == q * i) in __next_prime()
277 i += 2; in __next_prime()
278 q = n / i; in __next_prime()
279 if (q < i) in __next_prime()
281 if (n == q * i) in __next_prime()
284 i += 4; in __next_prime()
285 q = n / i; in __next_prime()
286 if (q < i) in __next_prime()
288 if (n == q * i) in __next_prime()
291 i += 8; in __next_prime()
292 q = n / i; in __next_prime()
293 if (q < i) in __next_prime()
295 if (n == q * i) in __next_prime()
298 i += 6; in __next_prime()
299 q = n / i; in __next_prime()
300 if (q < i) in __next_prime()
302 if (n == q * i) in __next_prime()
305 i += 4; in __next_prime()
306 q = n / i; in __next_prime()
307 if (q < i) in __next_prime()
309 if (n == q * i) in __next_prime()
312 i += 6; in __next_prime()
313 q = n / i; in __next_prime()
314 if (q < i) in __next_prime()
316 if (n == q * i) in __next_prime()
319 i += 2; in __next_prime()
320 q = n / i; in __next_prime()
321 if (q < i) in __next_prime()
323 if (n == q * i) in __next_prime()
326 i += 4; in __next_prime()
327 q = n / i; in __next_prime()
328 if (q < i) in __next_prime()
330 if (n == q * i) in __next_prime()
333 i += 6; in __next_prime()
334 q = n / i; in __next_prime()
335 if (q < i) in __next_prime()
337 if (n == q * i) in __next_prime()
340 i += 2; in __next_prime()
341 q = n / i; in __next_prime()
342 if (q < i) in __next_prime()
344 if (n == q * i) in __next_prime()
347 i += 6; in __next_prime()
348 q = n / i; in __next_prime()
349 if (q < i) in __next_prime()
351 if (n == q * i) in __next_prime()
354 i += 6; in __next_prime()
355 q = n / i; in __next_prime()
356 if (q < i) in __next_prime()
358 if (n == q * i) in __next_prime()
361 i += 4; in __next_prime()
362 q = n / i; in __next_prime()
363 if (q < i) in __next_prime()
365 if (n == q * i) in __next_prime()
368 i += 2; in __next_prime()
369 q = n / i; in __next_prime()
370 if (q < i) in __next_prime()
372 if (n == q * i) in __next_prime()
375 i += 4; in __next_prime()
376 q = n / i; in __next_prime()
377 if (q < i) in __next_prime()
379 if (n == q * i) in __next_prime()
382 i += 6; in __next_prime()
383 q = n / i; in __next_prime()
384 if (q < i) in __next_prime()
386 if (n == q * i) in __next_prime()
389 i += 2; in __next_prime()
390 q = n / i; in __next_prime()
391 if (q < i) in __next_prime()
393 if (n == q * i) in __next_prime()
396 i += 6; in __next_prime()
397 q = n / i; in __next_prime()
398 if (q < i) in __next_prime()
400 if (n == q * i) in __next_prime()
403 i += 4; in __next_prime()
404 q = n / i; in __next_prime()
405 if (q < i) in __next_prime()
407 if (n == q * i) in __next_prime()
410 i += 2; in __next_prime()
411 q = n / i; in __next_prime()
412 if (q < i) in __next_prime()
414 if (n == q * i) in __next_prime()
417 i += 4; in __next_prime()
418 q = n / i; in __next_prime()
419 if (q < i) in __next_prime()
421 if (n == q * i) in __next_prime()
424 i += 2; in __next_prime()
425 q = n / i; in __next_prime()
426 if (q < i) in __next_prime()
428 if (n == q * i) in __next_prime()
431 i += 10; in __next_prime()
432 q = n / i; in __next_prime()
433 if (q < i) in __next_prime()
435 if (n == q * i) in __next_prime()
438 // This will loop i to the next "plane" of potential primes in __next_prime()
439 i += 2; in __next_prime()