v1.0.0-rc.173 (#83)

* jfjoch_broker: Optional per-dataset authentication - statistics, images and plots can require a bearer token, which jfjoch_viewer supports.
* jfjoch_viewer: Dark mode and a theme-matched colour scheme, a magnifier panel, and simpler contrast and background controls.
* Rugnux: Multiple performance improvements on GPU and CPU (CPU-only processing up to 40% faster, faster image decoding on ARM), with unchanged results.
* Rugnux: `--model` rigid-body refinement runs on the GPU, and the model-validation check is faster and more reliable.
* Rugnux: Improved scaling and merging - error model, outlier rejection, absorption correction and French-Wilson amplitudes now agree more closely with XDS and ctruncate.
* Rugnux: Improved integration - radial background on powder and ice rings, crowded rotation data keep their reflections, and CPU-only builds integrate large unit cells as GPU builds do.
* Rugnux: More robust detector geometry - measured beam centre, X-ray bandwidth and goniometer rate, and geometry refinement accepted only on significant evidence.
* Rugnux: Merged files are written in the standard setting, or in the setting of a reference MTZ, structure-factor mmCIF or model, with its free-R flags.
* Rugnux: Richer report - ice and powder rings, further lattices, superstructure candidates and mosaicity, with warnings worded as prompts to check.
* Rugnux: Clear error messages when a data set needs more GPU or host memory than is available.

Reviewed-on: #83
Co-authored-by: Filip Leonarski <filip.leonarski@psi.ch>

reader/SweepLayout.cpp

@@ -4,10 +4,13 @@
 #include "SweepLayout.h"
 
 #include <algorithm>
+#include <atomic>
 #include <cmath>
 #include <cctype>
 #include <filesystem>
+#include <future>
 #include <optional>
+#include <thread>
 
 #include "../common/JFJochException.h"
 #include "../common/Logger.h"
@@ -281,4 +284,17 @@ Layout Place(const std::vector<Frame> &frames, const std::string &logger_name) {
     return out;
 }
 
+void ForEachInOrder(size_t n, const std::function<void(size_t)> &fn) {
+    const size_t nthreads = std::min<size_t>(std::max(1u, std::thread::hardware_concurrency()), 8);
+    std::atomic<size_t> next{0};
+    std::vector<std::future<void>> futures;
+    for (size_t t = 0; t < nthreads; t++)
+        futures.push_back(std::async(std::launch::async, [&] {
+            for (size_t i = next++; i < n; i = next++)
+                fn(i);
+        }));
+    for (auto &f : futures)
+        f.get();
+}
+
 }  // namespace sweep