Please consider the following formatting changes

Author: alibuild

Detectors/Upgrades/ITS3/base/include/ITS3Base/ITS3Params.h

@@ -25,8 +25,8 @@ struct ITS3Params : public o2::conf::ConfigurableParamHelper<ITS3Params> {
   bool misalignmentHitsUseProp{false};                                              // Use propagtor for mis-alignment
   std::string globalGeoMisAlignerMacro{"${O2_ROOT}/share/macro/MisAlignGeoITS3.C"}; // Path to macro for global geometry mis-alignment
   // Chip studies
-  bool useDeadChannelMap{false};               // Query for a dead channel map to study disabling individual tiles
-  std::string chipResponseFunction{"APTS"};    // Chip response function one of "Alpide", "APTS" or "Mosaix" (not yet available)
+  bool useDeadChannelMap{false};            // Query for a dead channel map to study disabling individual tiles
+  std::string chipResponseFunction{"APTS"}; // Chip response function one of "Alpide", "APTS" or "Mosaix" (not yet available)
 
   O2ParamDef(ITS3Params, "ITS3Params");
 };

Detectors/Upgrades/ITS3/reconstruction/include/ITS3Reconstruction/TopologyDictionary.h

@@ -51,7 +51,7 @@ class TopologyDictionary
   static constexpr int NumberOfRareGroups = MaxNumberOfRowClasses * MaxNumberOfColClasses;                    ///< Number of entries corresponding to groups of rare topologies (those whos matrix exceed the max number of bytes are empty).
   /// Resets internal structures
   void reset() noexcept;
-  void resetMaps(bool IB=true) noexcept;
+  void resetMaps(bool IB = true) noexcept;
   /// Prints the dictionary
   friend std::ostream& operator<<(std::ostream& os, const its3::TopologyDictionary& dictionary);
   /// Prints the dictionary in a binary file
@@ -62,85 +62,85 @@ class TopologyDictionary
   void print() const noexcept;
 
   /// Returns the x position of the COG for the n_th element
-  [[nodiscard]] float getXCOG(int n, bool IB=true) const
+  [[nodiscard]] float getXCOG(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mXCOG;
   }
   /// Returns the error on the x position of the COG for the n_th element
-  [[nodiscard]] float getErrX(int n, bool IB=true) const
+  [[nodiscard]] float getErrX(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mErrX;
   }
   /// Returns the z position of the COG for the n_th element
-  [[nodiscard]] float getZCOG(int n, bool IB=true) const
+  [[nodiscard]] float getZCOG(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mZCOG;
   }
   /// Returns the error on the z position of the COG for the n_th element
-  [[nodiscard]] float getErrZ(int n, bool IB=true) const
+  [[nodiscard]] float getErrZ(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mErrZ;
   }
   /// Returns the error^2 on the x position of the COG for the n_th element
-  [[nodiscard]] float getErr2X(int n, bool IB=true) const
+  [[nodiscard]] float getErr2X(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mErr2X;
   }
   /// Returns the error^2 on the z position of the COG for the n_th element
-  [[nodiscard]] float getErr2Z(int n, bool IB=true) const
+  [[nodiscard]] float getErr2Z(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mErr2Z;
   }
   /// Returns the hash of the n_th element
-  [[nodiscard]] unsigned long getHash(int n, bool IB=true) const
+  [[nodiscard]] unsigned long getHash(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mHash;
   }
   /// Returns the number of fired pixels of the n_th element
-  [[nodiscard]] int getNpixels(int n, bool IB=true) const
+  [[nodiscard]] int getNpixels(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mNpixels;
   }
   /// Returns the frequency of the n_th element;
-  [[nodiscard]] double getFrequency(int n, bool IB=true) const
+  [[nodiscard]] double getFrequency(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mFrequency;
   }
   /// Returns true if the element corresponds to a group of rare topologies
-  [[nodiscard]] bool isGroup(int n, bool IB=true) const
+  [[nodiscard]] bool isGroup(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mIsGroup;
   }
   /// Returns the pattern of the topology
-  [[nodiscard]] const itsmft::ClusterPattern& getPattern(int n, bool IB=true) const
+  [[nodiscard]] const itsmft::ClusterPattern& getPattern(int n, bool IB = true) const
   {
     const auto& data = (IB) ? mDataIB : mDataOB;
     assert(n >= 0 || n < (int)data.mVectorOfIDs.size());
     return data.mVectorOfIDs[n].mPattern;
   }
 
   /// Fills a hostogram with the distribution of the IDs
-  [[nodiscard]] TH1F* getTopologyDistribution(const std::string_view hname, bool IB=true) const;
+  [[nodiscard]] TH1F* getTopologyDistribution(const std::string_view hname, bool IB = true) const;
   /// Returns the number of elements in the dicionary;
   [[nodiscard]] int getSize(bool IB) const
   {