[forward.list.modifiers] - C++23 → Trunk

Files changed (1) hide show

tmp/tmpdyhkwtgo/{from.md → to.md} +29 -27

tmp/tmpdyhkwtgo/{from.md → to.md} RENAMED Viewed

@@ -1,48 +1,49 @@
 #### Modifiers <a id="forward.list.modifiers">[[forward.list.modifiers]]</a>
-None of the overloads of `insert_after` shall affect the validity of
-iterators and references, and `erase_after` shall invalidate only
-iterators and references to the erased elements. If an exception is
-thrown during `insert_after` there shall be no effect. Inserting `n`
-elements into a `forward_list` is linear in `n`, and the number of calls
-to the copy or move constructor of `T` is exactly equal to `n`. Erasing
-`n` elements from a `forward_list` is linear in `n` and the number of
-calls to the destructor of type `T` is exactly equal to `n`.
 ``` cpp
-template<class... Args> reference emplace_front(Args&&... args);
 ```
 *Effects:* Inserts an object of type `value_type` constructed with
 `value_type(std::forward<Args>(args)...)` at the beginning of the list.
 ``` cpp
-void push_front(const T& x);
-void push_front(T&& x);
 ```
 *Effects:* Inserts a copy of `x` at the beginning of the list.
 ``` cpp
 template<container-compatible-range<T> R>
-  void prepend_range(R&& rg);
 ```
 *Effects:* Inserts a copy of each element of `rg` at the beginning of
 the list.
 [*Note 1*: The order of elements is not reversed. — *end note*]
 ``` cpp
-void pop_front();
 ```
 *Effects:* As if by `erase_after(before_begin())`.
 ``` cpp
-iterator insert_after(const_iterator position, const T& x);
 ```
 *Preconditions:* `T` is *Cpp17CopyInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
@@ -50,11 +51,11 @@ range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
-iterator insert_after(const_iterator position, T&& x);
 ```
 *Preconditions:* `T` is *Cpp17MoveInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
@@ -62,11 +63,11 @@ range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
-iterator insert_after(const_iterator position, size_type n, const T& x);
 ```
 *Preconditions:* `T` is *Cpp17CopyInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
@@ -76,11 +77,12 @@ range \[`begin()`, `end()`).
 *Returns:* An iterator pointing to the last inserted copy of `x`, or
 `position` if `n == 0` is `true`.
 ``` cpp
 template<class InputIterator>
-  iterator insert_after(const_iterator position, InputIterator first, InputIterator last);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `*first`. `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). Neither `first` nor `last`
@@ -92,11 +94,11 @@ are iterators in `*this`.
 *Returns:* An iterator pointing to the last inserted element, or
 `position` if `first == last` is `true`.
 ``` cpp
 template<container-compatible-range<T> R>
-  iterator insert_range_after(const_iterator position, R&& rg);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `*ranges::begin(rg)`. `position` is `before_begin()` or is a
 dereferenceable iterator in the range \[`begin()`, `end()`). `rg` and
@@ -107,19 +109,19 @@ dereferenceable iterator in the range \[`begin()`, `end()`). `rg` and
 *Returns:* An iterator pointing to the last inserted element, or
 `position` if `rg` is empty.
 ``` cpp
-iterator insert_after(const_iterator position, initializer_list<T> il);
 ```
 *Effects:* Equivalent to:
 `return insert_after(position, il.begin(), il.end());`
 ``` cpp
 template<class... Args>
-  iterator emplace_after(const_iterator position, Args&&... args);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `std::forward<Args>(args)...`. `position` is `before_begin()` or is
 a dereferenceable iterator in the range \[`begin()`, `end()`).
@@ -129,11 +131,11 @@ direct-non-list-initialized with `std::forward<Args>(args)...` after
 `position`.
 *Returns:* An iterator pointing to the new object.
 ``` cpp
-iterator erase_after(const_iterator position);
 ```
 *Preconditions:* The iterator following `position` is dereferenceable.
 *Effects:* Erases the element pointed to by the iterator following
@@ -143,11 +145,11 @@ iterator erase_after(const_iterator position);
 was erased, or `end()` if no such element exists.
 *Throws:* Nothing.
 ``` cpp
-iterator erase_after(const_iterator position, const_iterator last);
 ```
 *Preconditions:* All iterators in the range (`position`, `last`) are
 dereferenceable.
@@ -156,33 +158,33 @@ dereferenceable.
 *Returns:* `last`.
 *Throws:* Nothing.
 ``` cpp
-void resize(size_type sz);
 ```
-*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
 inserts `sz - distance(begin(), end())` default-inserted elements at the
 end of the list.
 ``` cpp
-void resize(size_type sz, const value_type& c);
 ```
-*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
 inserts `sz - distance(begin(), end())` copies of `c` at the end of the
 list.
 ``` cpp
-void clear() noexcept;
 ```
 *Effects:* Erases all elements in the range \[`begin()`, `end()`).
 *Remarks:* Does not invalidate past-the-end iterators.

 #### Modifiers <a id="forward.list.modifiers">[[forward.list.modifiers]]</a>
+The member functions in this subclause do not affect the validity of
+iterators and references when inserting elements, and when erasing
+elements invalidate iterators and references to the erased elements
+only. If an exception is thrown by any of these member functions there
+is no effect on the container. Inserting `n` elements into a
+`forward_list` is linear in `n`, and the number of calls to the copy or
+move constructor of `T` is exactly equal to `n`. Erasing `n` elements
+from a `forward_list` is linear in `n` and the number of calls to the
+destructor of type `T` is exactly equal to `n`.
 ``` cpp
+template<class... Args> constexpr reference emplace_front(Args&&... args);
 ```
 *Effects:* Inserts an object of type `value_type` constructed with
 `value_type(std::forward<Args>(args)...)` at the beginning of the list.
 ``` cpp
+constexpr void push_front(const T& x);
+constexpr void push_front(T&& x);
 ```
 *Effects:* Inserts a copy of `x` at the beginning of the list.
 ``` cpp
 template<container-compatible-range<T> R>
+ constexpr void prepend_range(R&& rg);
 ```
 *Effects:* Inserts a copy of each element of `rg` at the beginning of
 the list.
 [*Note 1*: The order of elements is not reversed. — *end note*]
 ``` cpp
+constexpr void pop_front();
 ```
 *Effects:* As if by `erase_after(before_begin())`.
 ``` cpp
+constexpr iterator insert_after(const_iterator position, const T& x);
 ```
 *Preconditions:* `T` is *Cpp17CopyInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
+constexpr iterator insert_after(const_iterator position, T&& x);
 ```
 *Preconditions:* `T` is *Cpp17MoveInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
+constexpr iterator insert_after(const_iterator position, size_type n, const T& x);
 ```
 *Preconditions:* `T` is *Cpp17CopyInsertable* into `forward_list`.
 `position` is `before_begin()` or is a dereferenceable iterator in the
 range \[`begin()`, `end()`).
 *Returns:* An iterator pointing to the last inserted copy of `x`, or
 `position` if `n == 0` is `true`.
 ``` cpp
 template<class InputIterator>
+ constexpr iterator insert_after(const_iterator position,
+                                  InputIterator first, InputIterator last);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `*first`. `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). Neither `first` nor `last`
 *Returns:* An iterator pointing to the last inserted element, or
 `position` if `first == last` is `true`.
 ``` cpp
 template<container-compatible-range<T> R>
+ constexpr iterator insert_range_after(const_iterator position, R&& rg);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `*ranges::begin(rg)`. `position` is `before_begin()` or is a
 dereferenceable iterator in the range \[`begin()`, `end()`). `rg` and
 *Returns:* An iterator pointing to the last inserted element, or
 `position` if `rg` is empty.
 ``` cpp
+constexpr iterator insert_after(const_iterator position, initializer_list<T> il);
 ```
 *Effects:* Equivalent to:
 `return insert_after(position, il.begin(), il.end());`
 ``` cpp
 template<class... Args>
+ constexpr iterator emplace_after(const_iterator position, Args&&... args);
 ```
 *Preconditions:* `T` is *Cpp17EmplaceConstructible* into `forward_list`
 from `std::forward<Args>(args)...`. `position` is `before_begin()` or is
 a dereferenceable iterator in the range \[`begin()`, `end()`).
 `position`.
 *Returns:* An iterator pointing to the new object.
 ``` cpp
+constexpr iterator erase_after(const_iterator position);
 ```
 *Preconditions:* The iterator following `position` is dereferenceable.
 *Effects:* Erases the element pointed to by the iterator following
 was erased, or `end()` if no such element exists.
 *Throws:* Nothing.
 ``` cpp
+constexpr iterator erase_after(const_iterator position, const_iterator last);
 ```
 *Preconditions:* All iterators in the range (`position`, `last`) are
 dereferenceable.
 *Returns:* `last`.
 *Throws:* Nothing.
 ``` cpp
+constexpr void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `forward_list`.
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
 inserts `sz - distance(begin(), end())` default-inserted elements at the
 end of the list.
 ``` cpp
+constexpr void resize(size_type sz, const value_type& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `forward_list`.
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
 inserts `sz - distance(begin(), end())` copies of `c` at the end of the
 list.
 ``` cpp
+constexpr void clear() noexcept;
 ```
 *Effects:* Erases all elements in the range \[`begin()`, `end()`).
 *Remarks:* Does not invalidate past-the-end iterators.

Diff to HTML by rtfpessoa