More wording improvements by the submitter

Author: Dani-Hub

xml/issue4320.xml

@@ -306,11 +306,11 @@ iterator erase(const_iterator first, const_iterator last);
 </pre>
 <blockquote>
 <p>
--16- Complexity: Linear in the number of elements erased. Additionally, if any active blocks 
-become empty of elements as a result of the function call, at worst linear in the number of 
-element blocks. <ins>For any active blocks which do not become empty of elements as a result
-of the function call, at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of each block
-which has an element erased from it.</ins>
+-16- Complexity: Linear in the number of elements erased <ins>and for each
+erased element at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of each block
+containing the element</ins>. Additionally, if any active blocks become empty of elements 
+as a result of the function call, at worst linear in the number of 
+element blocks.
 </p>
 </blockquote>
 </blockquote>
@@ -336,12 +336,8 @@ template&lt;class BinaryPredicate = equal_to&lt;T&gt;&gt;
 <p/>
 -11- <i>Complexity</i>: If `empty()` is `false`, exactly `size() - 1` applications 
 of the corresponding predicate, otherwise no applications of the predicate. 
-<ins>If erasures occur, also linear in the number of elements erased.
-Additionally, if any active blocks become empty of elements as a result
-of the function call, at worst linear in the number of element blocks.
-For any active blocks which do not become empty of elements as a result
-of the function call, at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of 
-each block which has an element erased from it.</ins>
+<ins>Additionally, for each element erased as a result of this function call,
+at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of each block containing the element.</ins>
 <p/>
 -12- <i>Remarks</i>: [&hellip;]
 </p>