Grammar.

Author: quickfur

std/algorithm/searching.d

@@ -807,9 +807,9 @@ if (isInputRange!R && !isInfinite!R)
     - `needle` is the index into `needles` which matched.
     - Both are `-1` if there was no match.
 
-    Warning: Due to the auto-decoding, the return value of this function may
-    $(I not) correspond to the array index of strings.  To find the index of an
-    element matching the predicate in strings, use $(REF indexOf, std,string)
+    Warning: Due to auto-decoding, the return value of this function may
+    $(I not) correspond to the array index for strings.  To find the index of an
+    element matching the predicate in a string, use $(REF indexOf, std,string)
     instead.
 
     See_Also: $(REF indexOf, std,string)
@@ -1052,9 +1052,9 @@ if (isInputRange!R &&
   - If `startsWith!pred(haystack)` is not `true` for any element in
     `haystack`, then `-1` is returned.
 
-    Warning: Due to the auto-decoding, the return value of this function may
-    $(I not) correspond to the array index of strings.  To find the index of an
-    element matching the predicate in strings, use $(REF indexOf, std,string)
+    Warning: Due to auto-decoding, the return value of this function may
+    $(I not) correspond to the array index for strings.  To find the index of an
+    element matching the predicate in a string, use $(REF indexOf, std,string)
     instead.
   +/
 ptrdiff_t countUntil(alias pred, R)(R haystack)