Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===-------------------------- hash.cpp ----------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | #include "__hash_table" |
| 11 | #include "algorithm" |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 12 | #include "stdexcept" |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 13 | #include "type_traits" |
| 14 | |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 15 | #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare" |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 16 | |
| 17 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 18 | |
| 19 | namespace { |
| 20 | |
| 21 | // handle all next_prime(i) for i in [1, 210), special case 0 |
| 22 | const unsigned small_primes[] = |
| 23 | { |
| 24 | 0, |
| 25 | 2, |
| 26 | 3, |
| 27 | 5, |
| 28 | 7, |
| 29 | 11, |
| 30 | 13, |
| 31 | 17, |
| 32 | 19, |
| 33 | 23, |
| 34 | 29, |
| 35 | 31, |
| 36 | 37, |
| 37 | 41, |
| 38 | 43, |
| 39 | 47, |
| 40 | 53, |
| 41 | 59, |
| 42 | 61, |
| 43 | 67, |
| 44 | 71, |
| 45 | 73, |
| 46 | 79, |
| 47 | 83, |
| 48 | 89, |
| 49 | 97, |
| 50 | 101, |
| 51 | 103, |
| 52 | 107, |
| 53 | 109, |
| 54 | 113, |
| 55 | 127, |
| 56 | 131, |
| 57 | 137, |
| 58 | 139, |
| 59 | 149, |
| 60 | 151, |
| 61 | 157, |
| 62 | 163, |
| 63 | 167, |
| 64 | 173, |
| 65 | 179, |
| 66 | 181, |
| 67 | 191, |
| 68 | 193, |
| 69 | 197, |
| 70 | 199, |
| 71 | 211 |
| 72 | }; |
| 73 | |
| 74 | // potential primes = 210*k + indices[i], k >= 1 |
| 75 | // these numbers are not divisible by 2, 3, 5 or 7 |
| 76 | // (or any integer 2 <= j <= 10 for that matter). |
| 77 | const unsigned indices[] = |
| 78 | { |
| 79 | 1, |
| 80 | 11, |
| 81 | 13, |
| 82 | 17, |
| 83 | 19, |
| 84 | 23, |
| 85 | 29, |
| 86 | 31, |
| 87 | 37, |
| 88 | 41, |
| 89 | 43, |
| 90 | 47, |
| 91 | 53, |
| 92 | 59, |
| 93 | 61, |
| 94 | 67, |
| 95 | 71, |
| 96 | 73, |
| 97 | 79, |
| 98 | 83, |
| 99 | 89, |
| 100 | 97, |
| 101 | 101, |
| 102 | 103, |
| 103 | 107, |
| 104 | 109, |
| 105 | 113, |
| 106 | 121, |
| 107 | 127, |
| 108 | 131, |
| 109 | 137, |
| 110 | 139, |
| 111 | 143, |
| 112 | 149, |
| 113 | 151, |
| 114 | 157, |
| 115 | 163, |
| 116 | 167, |
| 117 | 169, |
| 118 | 173, |
| 119 | 179, |
| 120 | 181, |
| 121 | 187, |
| 122 | 191, |
| 123 | 193, |
| 124 | 197, |
| 125 | 199, |
| 126 | 209 |
| 127 | }; |
| 128 | |
| 129 | } |
| 130 | |
| 131 | // Returns: If n == 0, returns 0. Else returns the lowest prime number that |
| 132 | // is greater than or equal to n. |
Howard Hinnant | 16e6e1d | 2010-08-22 00:03:27 +0000 | [diff] [blame] | 133 | // |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 134 | // The algorithm creates a list of small primes, plus an open-ended list of |
| 135 | // potential primes. All prime numbers are potential prime numbers. However |
| 136 | // some potential prime numbers are not prime. In an ideal world, all potential |
| 137 | // prime numbers would be prime. Candiate prime numbers are chosen as the next |
| 138 | // highest potential prime. Then this number is tested for prime by dividing it |
| 139 | // by all potential prime numbers less than the sqrt of the candidate. |
Howard Hinnant | 16e6e1d | 2010-08-22 00:03:27 +0000 | [diff] [blame] | 140 | // |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 141 | // This implementation defines potential primes as those numbers not divisible |
| 142 | // by 2, 3, 5, and 7. Other (common) implementations define potential primes |
| 143 | // as those not divisible by 2. A few other implementations define potential |
| 144 | // primes as those not divisible by 2 or 3. By raising the number of small |
| 145 | // primes which the potential prime is not divisible by, the set of potential |
| 146 | // primes more closely approximates the set of prime numbers. And thus there |
| 147 | // are fewer potential primes to search, and fewer potential primes to divide |
| 148 | // against. |
| 149 | |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 150 | template <size_t _Sz = sizeof(size_t)> |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 151 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 152 | typename enable_if<_Sz == 4, void>::type |
| 153 | __check_for_overflow(size_t N) |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 154 | { |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 155 | #ifndef _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 156 | if (N > 0xFFFFFFFB) |
| 157 | throw overflow_error("__next_prime overflow"); |
Howard Hinnant | db4d478 | 2013-03-28 18:56:26 +0000 | [diff] [blame] | 158 | #else |
| 159 | (void)N; |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 160 | #endif |
| 161 | } |
| 162 | |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 163 | template <size_t _Sz = sizeof(size_t)> |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 164 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 165 | typename enable_if<_Sz == 8, void>::type |
| 166 | __check_for_overflow(size_t N) |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 167 | { |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 168 | #ifndef _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 169 | if (N > 0xFFFFFFFFFFFFFFC5ull) |
| 170 | throw overflow_error("__next_prime overflow"); |
Howard Hinnant | db4d478 | 2013-03-28 18:56:26 +0000 | [diff] [blame] | 171 | #else |
| 172 | (void)N; |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 173 | #endif |
| 174 | } |
| 175 | |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 176 | size_t |
| 177 | __next_prime(size_t n) |
| 178 | { |
| 179 | const size_t L = 210; |
| 180 | const size_t N = sizeof(small_primes) / sizeof(small_primes[0]); |
| 181 | // If n is small enough, search in small_primes |
| 182 | if (n <= small_primes[N-1]) |
| 183 | return *std::lower_bound(small_primes, small_primes + N, n); |
| 184 | // Else n > largest small_primes |
Howard Hinnant | e87ad17 | 2010-10-29 14:10:30 +0000 | [diff] [blame] | 185 | // Check for overflow |
Howard Hinnant | 0aa900e | 2012-12-27 18:59:05 +0000 | [diff] [blame] | 186 | __check_for_overflow(n); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 187 | // Start searching list of potential primes: L * k0 + indices[in] |
| 188 | const size_t M = sizeof(indices) / sizeof(indices[0]); |
| 189 | // Select first potential prime >= n |
| 190 | // Known a-priori n >= L |
| 191 | size_t k0 = n / L; |
Howard Hinnant | ec3773c | 2011-12-01 20:21:04 +0000 | [diff] [blame] | 192 | size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) |
| 193 | - indices); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 194 | n = L * k0 + indices[in]; |
| 195 | while (true) |
| 196 | { |
| 197 | // Divide n by all primes or potential primes (i) until: |
| 198 | // 1. The division is even, so try next potential prime. |
| 199 | // 2. The i > sqrt(n), in which case n is prime. |
| 200 | // It is known a-priori that n is not divisible by 2, 3, 5 or 7, |
| 201 | // so don't test those (j == 5 -> divide by 11 first). And the |
| 202 | // potential primes start with 211, so don't test against the last |
| 203 | // small prime. |
| 204 | for (size_t j = 5; j < N - 1; ++j) |
| 205 | { |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 206 | const std::size_t p = small_primes[j]; |
| 207 | const std::size_t q = n / p; |
| 208 | if (q < p) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 209 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 210 | if (n == q * p) |
| 211 | goto next; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 212 | } |
| 213 | // n wasn't divisible by small primes, try potential primes |
| 214 | { |
| 215 | size_t i = 211; |
| 216 | while (true) |
| 217 | { |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 218 | std::size_t q = n / i; |
| 219 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 220 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 221 | if (n == q * i) |
| 222 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 223 | |
| 224 | i += 10; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 225 | q = n / i; |
| 226 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 227 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 228 | if (n == q * i) |
| 229 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 230 | |
| 231 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 232 | q = n / i; |
| 233 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 234 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 235 | if (n == q * i) |
| 236 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 237 | |
| 238 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 239 | q = n / i; |
| 240 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 241 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 242 | if (n == q * i) |
| 243 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 244 | |
| 245 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 246 | q = n / i; |
| 247 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 248 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 249 | if (n == q * i) |
| 250 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 251 | |
| 252 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 253 | q = n / i; |
| 254 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 255 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 256 | if (n == q * i) |
| 257 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 258 | |
| 259 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 260 | q = n / i; |
| 261 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 262 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 263 | if (n == q * i) |
| 264 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 265 | |
| 266 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 267 | q = n / i; |
| 268 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 269 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 270 | if (n == q * i) |
| 271 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 272 | |
| 273 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 274 | q = n / i; |
| 275 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 276 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 277 | if (n == q * i) |
| 278 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 279 | |
| 280 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 281 | q = n / i; |
| 282 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 283 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 284 | if (n == q * i) |
| 285 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 286 | |
| 287 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 288 | q = n / i; |
| 289 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 290 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 291 | if (n == q * i) |
| 292 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 293 | |
| 294 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 295 | q = n / i; |
| 296 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 297 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 298 | if (n == q * i) |
| 299 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 300 | |
| 301 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 302 | q = n / i; |
| 303 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 304 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 305 | if (n == q * i) |
| 306 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 307 | |
| 308 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 309 | q = n / i; |
| 310 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 311 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 312 | if (n == q * i) |
| 313 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 314 | |
| 315 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 316 | q = n / i; |
| 317 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 318 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 319 | if (n == q * i) |
| 320 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 321 | |
| 322 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 323 | q = n / i; |
| 324 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 325 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 326 | if (n == q * i) |
| 327 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 328 | |
| 329 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 330 | q = n / i; |
| 331 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 332 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 333 | if (n == q * i) |
| 334 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 335 | |
| 336 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 337 | q = n / i; |
| 338 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 339 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 340 | if (n == q * i) |
| 341 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 342 | |
| 343 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 344 | q = n / i; |
| 345 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 346 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 347 | if (n == q * i) |
| 348 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 349 | |
| 350 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 351 | q = n / i; |
| 352 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 353 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 354 | if (n == q * i) |
| 355 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 356 | |
| 357 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 358 | q = n / i; |
| 359 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 360 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 361 | if (n == q * i) |
| 362 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 363 | |
| 364 | i += 8; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 365 | q = n / i; |
| 366 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 367 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 368 | if (n == q * i) |
| 369 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 370 | |
| 371 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 372 | q = n / i; |
| 373 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 374 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 375 | if (n == q * i) |
| 376 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 377 | |
| 378 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 379 | q = n / i; |
| 380 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 381 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 382 | if (n == q * i) |
| 383 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 384 | |
| 385 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 386 | q = n / i; |
| 387 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 388 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 389 | if (n == q * i) |
| 390 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 391 | |
| 392 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 393 | q = n / i; |
| 394 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 395 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 396 | if (n == q * i) |
| 397 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 398 | |
| 399 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 400 | q = n / i; |
| 401 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 402 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 403 | if (n == q * i) |
| 404 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 405 | |
| 406 | i += 8; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 407 | q = n / i; |
| 408 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 409 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 410 | if (n == q * i) |
| 411 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 412 | |
| 413 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 414 | q = n / i; |
| 415 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 416 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 417 | if (n == q * i) |
| 418 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 419 | |
| 420 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 421 | q = n / i; |
| 422 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 423 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 424 | if (n == q * i) |
| 425 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 426 | |
| 427 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 428 | q = n / i; |
| 429 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 430 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 431 | if (n == q * i) |
| 432 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 433 | |
| 434 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 435 | q = n / i; |
| 436 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 437 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 438 | if (n == q * i) |
| 439 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 440 | |
| 441 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 442 | q = n / i; |
| 443 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 444 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 445 | if (n == q * i) |
| 446 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 447 | |
| 448 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 449 | q = n / i; |
| 450 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 451 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 452 | if (n == q * i) |
| 453 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 454 | |
| 455 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 456 | q = n / i; |
| 457 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 458 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 459 | if (n == q * i) |
| 460 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 461 | |
| 462 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 463 | q = n / i; |
| 464 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 465 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 466 | if (n == q * i) |
| 467 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 468 | |
| 469 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 470 | q = n / i; |
| 471 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 472 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 473 | if (n == q * i) |
| 474 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 475 | |
| 476 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 477 | q = n / i; |
| 478 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 479 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 480 | if (n == q * i) |
| 481 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 482 | |
| 483 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 484 | q = n / i; |
| 485 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 486 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 487 | if (n == q * i) |
| 488 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 489 | |
| 490 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 491 | q = n / i; |
| 492 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 493 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 494 | if (n == q * i) |
| 495 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 496 | |
| 497 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 498 | q = n / i; |
| 499 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 500 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 501 | if (n == q * i) |
| 502 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 503 | |
| 504 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 505 | q = n / i; |
| 506 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 507 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 508 | if (n == q * i) |
| 509 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 510 | |
| 511 | i += 6; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 512 | q = n / i; |
| 513 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 514 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 515 | if (n == q * i) |
| 516 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 517 | |
| 518 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 519 | q = n / i; |
| 520 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 521 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 522 | if (n == q * i) |
| 523 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 524 | |
| 525 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 526 | q = n / i; |
| 527 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 528 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 529 | if (n == q * i) |
| 530 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 531 | |
| 532 | i += 4; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 533 | q = n / i; |
| 534 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 535 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 536 | if (n == q * i) |
| 537 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 538 | |
| 539 | i += 2; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 540 | q = n / i; |
| 541 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 542 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 543 | if (n == q * i) |
| 544 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 545 | |
| 546 | i += 10; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 547 | q = n / i; |
| 548 | if (q < i) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 549 | return n; |
Howard Hinnant | d2a9251 | 2010-09-13 01:43:27 +0000 | [diff] [blame] | 550 | if (n == q * i) |
| 551 | break; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 552 | |
| 553 | // This will loop i to the next "plane" of potential primes |
| 554 | i += 2; |
| 555 | } |
| 556 | } |
| 557 | next: |
| 558 | // n is not prime. Increment n to next potential prime. |
| 559 | if (++in == M) |
| 560 | { |
| 561 | ++k0; |
| 562 | in = 0; |
| 563 | } |
| 564 | n = L * k0 + indices[in]; |
| 565 | } |
| 566 | } |
| 567 | |
| 568 | _LIBCPP_END_NAMESPACE_STD |