leonarski_f
672840dfb8
The beam-centre hypothesis ladder runs up to 48 full first-pass indexing attempts, a pixel at a time, and adopts the first rung that indexes half the validation frames. When it adopts nothing the centre is restored and the run is bit-identical to one that never searched, so on those datasets the whole walk is pure cost - measured at 347 s of the 429 s the loop spends over a 100-dataset corpus. Two exits, both measured against the six corpus datasets that enter the walk. The walk is skipped outright when the background already measures a centre that is significant at three sigma and further away than the ladder can reach: it cannot get there, so it only spends the time finding that out. And it stops after the second ring when the running maximum, the starting centre included, is below a third of the adoption bar, which separates cleanly on this corpus - the three walks that adopt nothing peak at 0, 2 and 4 frames, the two that succeed sit at 17 and 26 by that point. Every dataset that adopted a centre before still adopts the same one, with the same cell and the same reflection count; the two that fail still fail with the same message. The measured saving is 226 s of the 429.
Jungfraujoch
Application to receive data from the PSI JUNGFRAU and EIGER detectors.
All documentation is now placed in docs/ subdirectory and for the current version hosted on Jungfraujoch Read The Docs page.