Code beautification. Re #24355

Framework/API/src/WorkspaceFactory.cpp

@@ -130,7 +130,8 @@ void WorkspaceFactoryImpl::initializeFromParent(
   for (size_t i = 0; i < parent.m_axes.size(); ++i) {
     const bool isBinEdge =
         dynamic_cast<const BinEdgeAxis *const>(parent.m_axes[i]) != nullptr;
-    const size_t newAxisLength = child.m_axes[i]->length() + (isBinEdge ? 1 : 0);
+    const size_t newAxisLength =
+        child.m_axes[i]->length() + (isBinEdge ? 1 : 0);
     const size_t oldAxisLength = parent.m_axes[i]->length();
 
     if (!differentSize && newAxisLength == oldAxisLength) {

Framework/Indexing/inc/MantidIndexing/IndexSet.h

@@ -144,8 +144,7 @@ IndexSet<T>::IndexSet(const std::vector<size_t> &indices, size_t fullRange)
 /**
  * Check if the index range is contiguous and in ascending order.
  */
-template <class T>
-bool IndexSet<T>::isContiguous() const noexcept {
+template <class T> bool IndexSet<T>::isContiguous() const noexcept {
   if (!m_isRange || m_indices.size() > 1) {
     for (size_t i = 0; i < m_indices.size() - 1; ++i) {
       if (m_indices[i] + 1 != m_indices[i + 1]) {