<html>#2035: NaNChecker should not use integer division
<table style='border-spacing: 1ex 0pt; '>
<tr><td style='text-align:right'> Reporter:</td><td>Erik Schnetter</td></tr>
<tr><td style='text-align:right'> Status:</td><td>new</td></tr>
<tr><td style='text-align:right'>Milestone:</td><td></td></tr>
<tr><td style='text-align:right'> Version:</td><td>development version</td></tr>
<tr><td style='text-align:right'> Type:</td><td>enhancement</td></tr>
<tr><td style='text-align:right'> Priority:</td><td>minor</td></tr>
<tr><td style='text-align:right'>Component:</td><td>Other</td></tr>
</table>
<p>Comment (by Roland Haas):</p>
<p>This pull request <a data-is-external-link="true" href="https://bitbucket.org/cactuscode/cactusutils/pull-requests/22/nanchecker-reduce-cost-of-integer-division/diff" rel="nofollow">https://bitbucket.org/cactuscode/cactusutils/pull-requests/22/nanchecker-reduce-cost-of-integer-division/diff</a> improves on the current situation in that it only computes the divisions if a NaN is found (which should be seldom). </p>
<p>Note that b/c of the omp parallel (and the fact that the dimensionality of the grid array is unknown) one cannot keep a running ijk[] array to trade divisions for a couple of if statements.</p>
<p>Please review.</p>
<p>--<br/>
Ticket URL: <a href='https://bitbucket.org/einsteintoolkit/tickets/issues/2035/nanchecker-should-not-use-integer-division'>https://bitbucket.org/einsteintoolkit/tickets/issues/2035/nanchecker-should-not-use-integer-division</a></p>
</html>