From 41bff33b2c44fa652219b3c8e60cc0dee1ba02b8 Mon Sep 17 00:00:00 2001 From: Ben FrantzDale Date: Fri, 21 Apr 2023 14:38:08 -0400 Subject: [PATCH] Fix for docs: https://github.com/boostorg/range/issues/145 --- doc/reference/algorithm_ext/is_sorted.qbk | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/doc/reference/algorithm_ext/is_sorted.qbk b/doc/reference/algorithm_ext/is_sorted.qbk index f9c07b4..53794ae 100644 --- a/doc/reference/algorithm_ext/is_sorted.qbk +++ b/doc/reference/algorithm_ext/is_sorted.qbk @@ -19,9 +19,11 @@ bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred); `is_sorted` determines if a range is sorted. For the non-predicate version the return value is `true` if and only if for -each adjacent elements `[x,y]` the expression `x < y` is `true`. +each adjacent elements `[x, y]` the expression `y < x` is `false` (i.e., +`x <= y`), or if the number of elements is zero or one. For the predicate version the return value is `true` is and only if for each -adjacent elements `[x,y]` the expression `pred(x,y)` is `true`. +adjacent elements `[x, y]` the expression `pred(y, x)` is `false`, or if the +number of elements is zero or one. [heading Definition]