; More coding style fixes

* src/sort.c (reverse_sortslice, tim_sort): Correct not-so
egregious misformattings.

(cherry picked from commit b990c37b9adbb4cbbcd6ef652c2a1737cf80269d)

diff --git a/src/sort.c b/src/sort.c
index 94cea4a18dbae35d2fbcd349219e42192f988d4f..dc9f49016aa54c018ad04ff300536b39222bff49 100644 (file)
--- a/src/sort.c
+++ b/src/sort.c
@@ -1052,9 +1052,9 @@ merge_compute_minrun (ptrdiff_t n)
 static void
 reverse_sortslice (sortslice *s, const ptrdiff_t n)
 {
-  reverse_slice(s->keys, &s->keys[n]);
+  reverse_slice (s->keys, &s->keys[n]);
   if (s->values != NULL)
-    reverse_slice(s->values, &s->values[n]);
+    reverse_slice (s->values, &s->values[n]);
 }
 
 static Lisp_Object
@@ -1161,7 +1161,7 @@ tim_sort (Lisp_Object predicate, Lisp_Object keyfunc,
     ms.pending[ms.n].len = n;
     ++ms.n;
     /* Advance to find the next run.  */
-    sortslice_advance(&lo, n);
+    sortslice_advance (&lo, n);
     nremaining -= n;
   } while (nremaining);