style: re-run clang format

apps/io/shm_io.h

@@ -90,6 +90,6 @@ namespace remapping {
 
 void write(const std::string &filename, std::span<const NodeID> partition);
 
-} // namespace partition
+} // namespace remapping
 
 } // namespace kaminpar::shm::io

external/growt/misc/submodules/xxhash/tests/bench/timefn.h

@@ -45,10 +45,7 @@ typedef unsigned long long PTime; /* does not support compilers without long lon
 
 #include <Windows.h> /* LARGE_INTEGER */
 typedef LARGE_INTEGER UTIL_time_t;
-#define UTIL_TIME_INITIALIZER                                                                      \
-  {                                                                                                \
-    { 0, 0 }                                                                                       \
-  }
+#define UTIL_TIME_INITIALIZER {{0, 0}}
 
 #elif defined(__APPLE__) && defined(__MACH__)
 

external/growt/misc/submodules/xxhash/xxhash.h

@@ -1015,7 +1015,9 @@ struct XXH3_state_s {
  * it's still necessary to use XXH3_NNbits_reset*() afterwards.
  */
 #define XXH3_INITSTATE(XXH3_state_ptr)                                                             \
-  { (XXH3_state_ptr)->seed = 0; }
+  {                                                                                                \
+    (XXH3_state_ptr)->seed = 0;                                                                    \
+  }
 
 /* ===   Experimental API   === */
 /* Symbols defined below must be considered tied to a specific library version. */

kaminpar-dist/refinement/gains/compact_hashing_gain_cache.h

@@ -576,4 +576,3 @@ template <typename DistributedGraphType> class CompactHashingGainCache {
 };
 
 } // namespace kaminpar::dist
-

kaminpar-dist/refinement/gains/lazy_compact_hashing_gain_cache.h

@@ -619,4 +619,3 @@ template <typename DistributedGraphType> class LazyCompactHashingGainCache {
 };
 
 } // namespace kaminpar::dist
-

kaminpar-shm/ckaminpar.cc

@@ -188,4 +188,3 @@ kaminpar_edge_weight_t kaminpar_compute_partition_with_max_block_weights(
       std::move(max_block_weights_vec), {partition, kaminpar->n}
   );
 }
-

kaminpar-shm/coarsening/overlay_cluster_coarsener.cc

@@ -278,4 +278,3 @@ bool OverlayClusteringCoarsener::keep_allocated_memory() const {
 }
 
 } // namespace kaminpar::shm
-

kaminpar-shm/coarsening/overlay_cluster_coarsener.h

@@ -68,4 +68,3 @@ class OverlayClusteringCoarsener : public Coarsener {
 };
 
 } // namespace kaminpar::shm
-

kaminpar-shm/partitioning/deep/async_initial_partitioning.cc

@@ -79,12 +79,7 @@ PartitionedGraph AsyncInitialPartitioner::partition_recursive(
 
   if (p_graph.k() < k_prime) {
     extend_partition(
-        p_graph,
-        k_prime,
-        _input_ctx,
-        _tmp_extraction_mem_pool_ets,
-        _bipartitioner_pool,
-        num_threads
+        p_graph, k_prime, _input_ctx, _tmp_extraction_mem_pool_ets, _bipartitioner_pool, num_threads
     );
     p_ctx = create_kway_context(_input_ctx, p_graph);
   }

kaminpar-shm/partitioning/deep/vcycle_deep_multilevel.h

@@ -20,8 +20,7 @@ class VcycleDeepMultilevelPartitioner : public Partitioner {
   VcycleDeepMultilevelPartitioner(const Graph &input_graph, const Context &input_ctx);
 
   VcycleDeepMultilevelPartitioner(const VcycleDeepMultilevelPartitioner &) = delete;
-  VcycleDeepMultilevelPartitioner &
-  operator=(const VcycleDeepMultilevelPartitioner &) = delete;
+  VcycleDeepMultilevelPartitioner &operator=(const VcycleDeepMultilevelPartitioner &) = delete;
 
   VcycleDeepMultilevelPartitioner(VcycleDeepMultilevelPartitioner &&) = delete;
   VcycleDeepMultilevelPartitioner &operator=(VcycleDeepMultilevelPartitioner &&) = delete;

kaminpar-shm/partitioning/helper.cc

@@ -115,9 +115,10 @@ PartitionContext create_twoway_context(
     }
 
     DBG << "[" << current_block << "/" << current_k << "]-> adapted epsilon from "
-        << input_ctx.partition.epsilon() << " to " << adapted_eps << ", changing max block weights to "
-        << max_block_weights[0] << " + " << max_block_weights[1]
-        << ", will be relaxed with parameters max node weight " << graph.max_node_weight();
+        << input_ctx.partition.epsilon() << " to " << adapted_eps
+        << ", changing max block weights to " << max_block_weights[0] << " + "
+        << max_block_weights[1] << ", will be relaxed with parameters max node weight "
+        << graph.max_node_weight();
 
     p_ctx.setup(graph, std::move(max_block_weights), true);
   } else {

kaminpar-shm/partitioning/rb/rb_multilevel.h

@@ -28,7 +28,8 @@ class RBMultilevelPartitioner : public Partitioner {
   PartitionedGraph partition() final;
 
 private:
-  PartitionedGraph partition_recursive(const Graph &graph, BlockID current_block, BlockID current_k);
+  PartitionedGraph
+  partition_recursive(const Graph &graph, BlockID current_block, BlockID current_k);
 
   PartitionedGraph bipartition(const Graph &graph, BlockID current_block, BlockID current_k);
 

kaminpar-shm/refinement/lp/lp_refiner.cc

@@ -104,7 +104,7 @@ class LPRefinerImpl final
   }
 
   [[nodiscard]] bool accept_neighbor(const NodeID u, const NodeID v) {
-      return _communities.empty() || _communities[u] == _communities[v];
+    return _communities.empty() || _communities[u] == _communities[v];
   }
 
   bool move_cluster_weight(