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