[alg.partition] Use established terminology 'partitioned with respect to'

Author: tkoeppe

source/algorithms.tex

@@ -4257,7 +4257,9 @@
 \pnum
 \returns \tcode{true} if
 \range{first}{last} is empty or if
-\range{first}{last} is partitioned by \tcode{pred}, i.e. if all elements that satisfy \tcode{pred} appear before those that do not.
+the elements \tcode{e} of
+\range{first}{last} are partitioned with respect to the expression
+\tcode{pred(e)}.
 
 \pnum
 \complexity Linear. At most \tcode{last - first} applications of \tcode{pred}.
@@ -4304,13 +4306,11 @@
 \begin{itemdecl}
 template<class BidirectionalIterator, class Predicate>
   BidirectionalIterator
-    stable_partition(BidirectionalIterator first, BidirectionalIterator last,
-                     Predicate pred);
+    stable_partition(BidirectionalIterator first, BidirectionalIterator last, Predicate pred);
 template<class ExecutionPolicy, class BidirectionalIterator, class Predicate>
   BidirectionalIterator
     stable_partition(ExecutionPolicy&& exec,
-                     BidirectionalIterator first, BidirectionalIterator last,
-                     Predicate pred);
+                     BidirectionalIterator first, BidirectionalIterator last, Predicate pred);
 \end{itemdecl}
 
 \begin{itemdescr}
@@ -4364,18 +4364,15 @@
          class OutputIterator2, class Predicate>
   constexpr pair<OutputIterator1, OutputIterator2>
     partition_copy(InputIterator first, InputIterator last,
-                   OutputIterator1 out_true, OutputIterator2 out_false,
-                   Predicate pred);
+                   OutputIterator1 out_true, OutputIterator2 out_false, Predicate pred);
 template<class ExecutionPolicy, class ForwardIterator, class ForwardIterator1,
          class ForwardIterator2, class Predicate>
   pair<ForwardIterator1, ForwardIterator2>
     partition_copy(ExecutionPolicy&& exec,
                    ForwardIterator first, ForwardIterator last,
-                   ForwardIterator1 out_true, ForwardIterator2 out_false,
-                   Predicate pred);
+                   ForwardIterator1 out_true, ForwardIterator2 out_false, Predicate pred);
 \end{itemdecl}
 
-
 \begin{itemdescr}
 \pnum
 \requires
@@ -4415,14 +4412,15 @@
 \begin{itemdecl}
 template<class ForwardIterator, class Predicate>
   constexpr ForwardIterator
-    partition_point(ForwardIterator first, ForwardIterator last,
-                    Predicate pred);
+    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
 \end{itemdecl}
 
-
 \begin{itemdescr}
 \pnum
-\requires \tcode{ForwardIterator}'s value type shall be convertible to \tcode{Predicate}'s argument type. \range{first}{last} shall be partitioned by \tcode{pred}, i.e. all elements that satisfy \tcode{pred} shall appear before those that do not.
+\requires
+\tcode{ForwardIterator}'s value type shall be convertible to
+\tcode{Predicate}'s argument type. The elements \tcode{e} of \range{first}{last}
+shall be partitioned with respect to the expression \tcode{pred(e)}.
 
 \pnum
 \returns An iterator \tcode{mid} such that \tcode{all_of(first, mid, pred)} and \tcode{none_of(mid, last, pred)} are both \tcode{true}.