Format

Author: polytypic

internals/testing/insertion_sort_test.cpp

@@ -8,7 +8,8 @@ auto insertion_sort_test = test([]() {
   int values[] = {3, 1, 4, 1, 5, 9, 2, -1};
 
   dumpster_v1::insertion_sort(
-      values, [](auto lhs, auto rhs) { return lhs < rhs; },
+      values,
+      [](auto lhs, auto rhs) { return lhs < rhs; },
       [](auto x) { return x == -1; });
 
   int sorted[] = {1, 1, 2, 3, 4, 5, 9, -1};

provides/include/dumpster_v1/insertion_sort.hpp

@@ -5,7 +5,8 @@
 #include <cstddef>
 
 template <class RandomIt, class Less, class IsSentinel>
-void dumpster_v1::insertion_sort(RandomIt values, Less less,
+void dumpster_v1::insertion_sort(RandomIt values,
+                                 Less less,
                                  IsSentinel is_sentinel) {
   size_t i = 0;
   while (!is_sentinel(values[++i])) {