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:
leonarski_fandClaude Opus 5 committed 2026-09-20 18:45:17 +02:00
1 parent 9de53ad015
commit eb6589f647
4 files changed
+14 -6

No files matched your search

@@ -432,7 +432,8 @@ void RotationScaleMerge::Ingest() {
for (int o = lo; o < hi; ++o) {
int32_t at = src_start[o];
for (const auto &r : partials_out[o].reflections) {
keys[fill[r.h - h_min]++] = SortKey{r.h, r.k, r.l, r.image_number, at, r.d};
keys[fill[r.h - h_min]++] = SortKey{static_cast<int16_t>(r.h), static_cast<int16_t>(r.k),
static_cast<int16_t>(r.l), r.image_number, at, r.d};
++at;
}
}