Merge remote-tracking branch 'upstream/stable' into merge_stable

std/algorithm/searching.d

@@ -35,7 +35,7 @@ $(T2 endsWith,
         `endsWith("rocks", "ks")` returns `true`.)
 $(T2 find,
         `find("hello world", "or")` returns `"orld"` using linear search.
-        (For binary search refer to $(REF sortedRange, std,range).))
+        (For binary search refer to $(REF SortedRange, std,range).))
 $(T2 findAdjacent,
         `findAdjacent([1, 2, 3, 3, 4])` returns the subrange starting with
         two equal adjacent elements, i.e. `[3, 3, 4]`.)
@@ -79,9 +79,6 @@ $(T2 maxPos,
         `maxPos([2, 3, 1, 3, 4, 1])` returns the subrange `[4, 1]`,
         i.e., positions the range at the first occurrence of its maximal
         element.)
-$(T2 mismatch,
-        `mismatch("parakeet", "parachute")` returns the two ranges
-        `"keet"` and `"chute"`.)
 $(T2 skipOver,
         Assume `a = "blah"`. Then `skipOver(a, "bi")` leaves `a`
         unchanged and returns `false`, whereas `skipOver(a, "bl")`

std/algorithm/sorting.d

@@ -8,8 +8,7 @@ $(BOOKTABLE Cheat Sheet,
 $(TR $(TH Function Name) $(TH Description))
 $(T2 completeSort,
         If `a = [10, 20, 30]` and `b = [40, 6, 15]`, then
-        `completeSort(a, b)` leaves `a = [6, 10, 15]` and `b = [20$D(
-        30, 40]).
+        `completeSort(a, b)` leaves `a = [6, 10, 15]` and `b = [20, 30, 40]`.
         The range `a` must be sorted prior to the call, and as a result the
         combination `$(REF chain, std,range)(a, b)` is sorted.)
 $(T2 isPartitioned,