| 289 | a[i] = 1.0; |
| 290 | } |
| 291 | forceinline void |
| 292 | Action::Storage::update(int i) { |
| 293 | /* |
| 294 | * The trick to inverse decay is from: An Extensible SAT-solver, |
| 295 | * Niklas Eén, Niklas Sörensson, SAT 2003. |
| 296 | */ |
| 297 | assert((i >= 0) && (i < n)); |
| 298 | a[i] = invd * (a[i] + 1.0); |
| 299 | if (a[i] > Kernel::Config::rescale_limit) |
| 300 | for (int j=0; j<n; j++) |
| 301 | a[j] *= Kernel::Config::rescale; |
| 302 | } |
| 303 | |
| 304 | |
| 305 | /* |
no outgoing calls
no test coverage detected