Skip to content

Commit 4e2ce7d

Browse files
committed
Wording fixes
1 parent 32b00c7 commit 4e2ce7d

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

xml/issue4320.xml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -315,7 +315,7 @@ iterator erase(const_iterator first, const_iterator last);
315315
<blockquote>
316316
<p>
317317
-16- Complexity: Linear in the number of elements erased <ins>and for each
318-
erased element at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of each block
318+
erased element at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of the block
319319
containing the element</ins>. Additionally, if any active blocks become empty of elements
320320
as a result of the function call, at worst linear in the number of
321321
element blocks.
@@ -336,7 +336,7 @@ the proposed solution accepted, the proposed complexity wording becomes:
336336
-11- <i>Complexity</i>: If `empty()` is `false`, exactly `size() - 1` applications
337337
of the corresponding predicate, otherwise no applications of the predicate.
338338
<ins>For each element erased as a result of this function call, at worst <tt>&#x1d4aa;(log n)</tt>
339-
in the capacity of each block containing the element. Additionally, if any active blocks become
339+
in the capacity of the block containing the element. Additionally, if any active blocks become
340340
empty of elements as a result of the function call, at worst linear in the number of element
341341
blocks.</ins>
342342
</p></blockquote>

xml/issue4323.xml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@ the proposed solution accepted, the proposed complexity wording becomes:
5959
-11- <i>Complexity</i>: If `empty()` is `false`, exactly `size() - 1` applications
6060
of the corresponding predicate, otherwise no applications of the predicate.
6161
<ins>For each element erased as a result of this function call, at worst <tt>&#x1d4aa;(log n)</tt>
62-
in the capacity of each block containing the element. Additionally, if any active blocks become
62+
in the capacity of the block containing the element. Additionally, if any active blocks become
6363
empty of elements as a result of the function call, at worst linear in the number of element
6464
blocks.</ins>
6565
</p></blockquote>

0 commit comments

Comments
 (0)