From ce923dffbcd4db05de99085fd360f42ace1603b6 Mon Sep 17 00:00:00 2001 From: ALICE Action Bot Date: Wed, 27 May 2026 07:05:13 +0000 Subject: [PATCH] Please consider the following formatting changes --- Framework/Core/include/Framework/StepTHn.h | 20 ++++++++++---------- 1 file changed, 10 insertions(+), 10 deletions(-) diff --git a/Framework/Core/include/Framework/StepTHn.h b/Framework/Core/include/Framework/StepTHn.h index 9efddc51cb6ae..a1daaf50ef800 100644 --- a/Framework/Core/include/Framework/StepTHn.h +++ b/Framework/Core/include/Framework/StepTHn.h @@ -77,19 +77,19 @@ class StepTHn : public TNamed THnBase** mTarget; //! target histogram - TAxis** mAxisCache; //! cache axis pointers (about 50% of the time in Fill is spent in GetAxis otherwise) - Int_t* mNbinsCache; //! cache Nbins per axis - Double_t* mLastVars; //! caching of last used bins (in many loops some vars are the same for a while) - Int_t* mLastBins; //! caching of last used bins (in many loops some vars are the same for a while) + TAxis** mAxisCache; //! cache axis pointers (about 50% of the time in Fill is spent in GetAxis otherwise) + Int_t* mNbinsCache; //! cache Nbins per axis + Double_t* mLastVars; //! caching of last used bins (in many loops some vars are the same for a while) + Int_t* mLastBins; //! caching of last used bins (in many loops some vars are the same for a while) // Fast bin lookup table: for each axis, maps a quantized position to an approximate bin. - static constexpr Int_t kLookupSize = 1024; // number of slots per axis + static constexpr Int_t kLookupSize = 1024; // number of slots per axis struct AxisLookup { - Double_t invSlotWidth; // 1.0 / slot width for fast index computation - Double_t xmin; // axis minimum - Double_t xmax; // axis maximum - const Double_t* edges; // pointer to bin edges array (nBins+1 entries) - Int_t nBins; // number of bins + Double_t invSlotWidth; // 1.0 / slot width for fast index computation + Double_t xmin; // axis minimum + Double_t xmax; // axis maximum + const Double_t* edges; // pointer to bin edges array (nBins+1 entries) + Int_t nBins; // number of bins Int_t table[kLookupSize]; // slot -> bin index (1-based, TAxis convention) }; AxisLookup* mLookup; //! per-axis lookup tables