Removing trailing spaces

std/algorithm.d

@@ -2248,7 +2248,6 @@ unittest
             assert(equal(s.front, [1,2,3,4]));
             assert(equal(s.back, [6,7,8,9,10]));
 
-
             auto s2 = splitter(d, [4, 5]);
             assert(equal(s2.front, [1,2,3]));
             assert(equal(s2.back, [6,7,8,9,10]));
@@ -2967,7 +2966,6 @@ private struct UniqResult(alias pred, Range)
         @property bool empty() { return _input.empty; }
     }
 
-
     static if (isForwardRange!Range) {
         @property typeof(this) save() {
             return typeof(this)(_input.save);
@@ -4740,7 +4738,6 @@ unittest {
     assert(r == ["def", "hij"]);
 }
 
-
 /* (Not yet documented.)
 Consume all elements from $(D r) that are equal to one of the elements
 $(D es).
@@ -7929,7 +7926,6 @@ private void quickSortImpl(alias less, Range)(Range r)
     }
 }
 
-
 /+
     Tim Sort for Random-Access Ranges
 
@@ -7937,7 +7933,6 @@ private void quickSortImpl(alias less, Range)(Range r)
 
     Authors:  Xinok
     License:  Public Domain
-    
 +/
 
 // Tim Sort implementation
@@ -8143,7 +8138,6 @@ private template TimSortImpl(alias pred, R)
         range = range[firstElement .. lastElement];
         mid -= firstElement;
 
-        
         if (mid == 0 || mid == range.length) return;
 
         // Call function which will copy smaller run into temporary memory
@@ -9275,7 +9269,6 @@ if (is(typeof(find!pred(haystack, needle))))
     return !find!pred(haystack, needle).empty;
 }
 
-
 /++
     Returns the 1-based index of the first needle found in $(D haystack). If no
     needle is found, then $(D 0) is returned.