rugnux: sixteen-bit Miller indices in the ingest sort key and the post-refine partial
Both arrays are one record per integrated observation - tens of millions on a fine-sliced long axis, gigabytes each - and both carry the raw hkl only to sort and group on. A Miller index needs sixteen bits (|h| <= a / d_min, in the hundreds even on the longest axis at atomic resolution), which takes the ingest sort key from 24 to 20 bytes and the post-refine partial from 32 to 28. Same comparisons, same order; merged output byte-identical. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013nW6FNRP1bBJJ8pfHiByAT
This commit is contained in:
1 parent
9de53ad015
commit
eb6589f647
4 files changed
+14
-6
No files matched your search
@@ -219,7 +219,9 @@ PostRefineObservations GatherPostRefineObservations(std::vector<IntegrationOutco
|
||||
if (!std::isfinite(r.I) || !std::isfinite(r.sigma) || r.sigma <= 0.0f) continue;
|
||||
const float ox = std::isfinite(r.observed_x) ? r.observed_x : NAN;
|
||||
const float oy = std::isfinite(r.observed_y) ? r.observed_y : NAN;
|
||||
pts[fill[r.h - h_lo]++] = Partial{r.h, r.k, r.l, r.image_number, r.I, r.sigma, ox, oy};
|
||||
pts[fill[r.h - h_lo]++] = Partial{static_cast<int16_t>(r.h), static_cast<int16_t>(r.k),
|
||||
static_cast<int16_t>(r.l), r.image_number,
|
||||
r.I, r.sigma, ox, oy};
|
||||
}
|
||||
// The caller said it will never read this image's reflections again, so hand the
|
||||
// vector back the moment it is consumed: the payload shrinks image by image as it
|
||||
|
||||
Reference in new issue
Block a user