Perform creation and registration
| 269 | public: |
| 270 | /// Perform creation and registration |
| 271 | Create(void) { |
| 272 | bool a = false; |
| 273 | do { |
| 274 | bool n = false; |
| 275 | do { |
| 276 | for (unsigned int t = 1; t<=4; t++) { |
| 277 | (void) new NoGoods<Queens,IntValBranch>(INT_VAL_MIN(),t,a,n); |
| 278 | (void) new NoGoods<Queens,IntValBranch>(INT_VAL_MAX(),t,a,n); |
| 279 | (void) new NoGoods<Queens,IntValBranch>(INT_VAL_SPLIT_MIN(),t,a,n); |
| 280 | (void) new NoGoods<Queens,IntValBranch>(INT_VAL_SPLIT_MAX(),t,a,n); |
| 281 | (void) new NoGoods<Queens,IntValBranch>(INT_VALUES_MIN(),t,a,n); |
| 282 | (void) new NoGoods<Queens,IntValBranch>(INT_VALUES_MAX(),t,a,n); |
| 283 | #ifdef GECODE_HAS_SET_VARS |
| 284 | (void) new NoGoods<Hamming,SetValBranch>(SET_VAL_MIN_INC(),t,a,n); |
| 285 | (void) new NoGoods<Hamming,SetValBranch>(SET_VAL_MIN_EXC(),t,a,n); |
| 286 | (void) new NoGoods<Hamming,SetValBranch>(SET_VAL_MAX_INC(),t,a,n); |
| 287 | (void) new NoGoods<Hamming,SetValBranch>(SET_VAL_MAX_EXC(),t,a,n); |
| 288 | #endif |
| 289 | } |
| 290 | n = !n; |
| 291 | } while (n); |
| 292 | a = !a; |
| 293 | } while (a); |
| 294 | } |
| 295 | }; |
| 296 | |
| 297 | Create c; |
nothing calls this directly
no test coverage detected