| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A mutex (in a shared memory segment) is the correct synchronisation
primitive here. I had confused myself...
|
|
Nice side-effect: indexamajig -j and --int-diag can now be used together
|
|
|
|
Reflections appearing and disappearing are problematic when trying to do a
least-squares refinement. Therefore, assume that reflections stay on
panel and keep them under consideration even if their partialities go to
zero (i.e. they drift off Bragg). This should stabilise both
refinements, and simplifies quite a lot of code.
Collateral "damage": the old "select_intersection()" is now gone.
|
|
|
|
Thanks again to Takanori Nakane for spotting this
|
|
|
|
|
|
integration
|
|
|
|
This is significantly faster than predicting to the edge then applying the resolution cutoff.
With the "new" way of estimating the resolution limit, there's no need to integrate first.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
... because everything except BM_BH is used for centering.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
