From 74acd69f8be866b2b32b7f9de63948989eecbba1 Mon Sep 17 00:00:00 2001 From: anonymous Date: Fri, 18 Nov 2016 23:46:48 +0100 Subject: [PATCH 1/2] remove pointless LREFs The LREFs were broken. Could fix that with underscores, but the links would just point back at the current section. There's no point in having such links. --- std/algorithm/sorting.d | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/std/algorithm/sorting.d b/std/algorithm/sorting.d index fb3fd1b3f61..22d4ad8706d 100644 --- a/std/algorithm/sorting.d +++ b/std/algorithm/sorting.d @@ -145,11 +145,11 @@ Checks whether a forward range is sorted according to the comparison operation $(D less). Performs $(BIGOH r.length) evaluations of $(D less). -Unlike $(LREF isSorted), $(LREF isStrictlyMonotonic) does not allow for equal values, +Unlike isSorted, isStrictlyMonotonic does not allow for equal values, i.e. values for which both `less(a, b)` and `less(b, a)` are false. With either function, the predicate must be a strict ordering just like with -$(LREF isSorted). For example, using `"a <= b"` instead of `"a < b"` is +isSorted. For example, using `"a <= b"` instead of `"a < b"` is incorrect and will cause failed assertions. Params: @@ -157,8 +157,8 @@ Params: r = Forward range to check for sortedness. Returns: - `true` if the range is sorted, false otherwise. $(LREF isSorted) allows - duplicates, $(LREF isStrictlyMonotonic) not. + `true` if the range is sorted, false otherwise. isSorted allows + duplicates, isStrictlyMonotonic not. */ bool isSorted(alias less = "a < b", Range)(Range r) if (isForwardRange!(Range)) { From dfebb1f5ff9da3abfd4f77e4b7b7b01f4fafe1ca Mon Sep 17 00:00:00 2001 From: anonymous Date: Mon, 21 Nov 2016 13:05:53 +0100 Subject: [PATCH 2/2] [Ddoc] backticks around isSorted and isStrictlyMonotonic DDOX doesn't do auto-highlighting, but the symbols need to be formatted as code there, too. --- std/algorithm/sorting.d | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/std/algorithm/sorting.d b/std/algorithm/sorting.d index 22d4ad8706d..d33a0d92052 100644 --- a/std/algorithm/sorting.d +++ b/std/algorithm/sorting.d @@ -145,11 +145,11 @@ Checks whether a forward range is sorted according to the comparison operation $(D less). Performs $(BIGOH r.length) evaluations of $(D less). -Unlike isSorted, isStrictlyMonotonic does not allow for equal values, +Unlike `isSorted`, `isStrictlyMonotonic` does not allow for equal values, i.e. values for which both `less(a, b)` and `less(b, a)` are false. With either function, the predicate must be a strict ordering just like with -isSorted. For example, using `"a <= b"` instead of `"a < b"` is +`isSorted`. For example, using `"a <= b"` instead of `"a < b"` is incorrect and will cause failed assertions. Params: @@ -157,8 +157,8 @@ Params: r = Forward range to check for sortedness. Returns: - `true` if the range is sorted, false otherwise. isSorted allows - duplicates, isStrictlyMonotonic not. + `true` if the range is sorted, false otherwise. `isSorted` allows + duplicates, `isStrictlyMonotonic` not. */ bool isSorted(alias less = "a < b", Range)(Range r) if (isForwardRange!(Range)) {