auto assumeSorted(alias pred = "a < b", R)(R r) if (isInputRange!(Unqual!R))
Assumes r is sorted by predicate pred and returns the corresponding SortedRange!(pred, R) having r as support. To check for sorted-ness at cost n, use isSorted.
r
pred
SortedRange!(pred, R)
isSorted