[list] - C++23 → Trunk

Files changed (1) hide show

tmp/tmpupv5zbn9/{from.md → to.md} +148 -140

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

@@ -18,137 +18,143 @@ provided.[^2]
 Descriptions are provided here only for operations on `list` that are
 not described in one of these tables or for operations where there is
 additional semantic information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class list {
   public:
     // types
     using value_type             = T;
     using allocator_type         = Allocator;
-    using pointer                = typename allocator_traits<Allocator>::pointer;
-    using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
     using const_reference        = const value_type&;
     using size_type              = implementation-defined  // type of list::size_type; // see [container.requirements]
     using difference_type        = implementation-defined  // type of list::difference_type; // see [container.requirements]
     using iterator               = implementation-defined  // type of list::iterator; // see [container.requirements]
     using const_iterator         = implementation-defined  // type of list::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // [list.cons], construct/copy/destroy
-    list() : list(Allocator()) { }
-    explicit list(const Allocator&);
-    explicit list(size_type n, const Allocator& = Allocator());
-    list(size_type n, const T& value, const Allocator& = Allocator());
     template<class InputIterator>
-      list(InputIterator first, InputIterator last, const Allocator& = Allocator());
     template<container-compatible-range<T> R>
-      list(from_range_t, R&& rg, const Allocator& = Allocator());
-    list(const list& x);
-    list(list&& x);
-    list(const list&, const type_identity_t<Allocator>&);
-    list(list&&, const type_identity_t<Allocator>&);
-    list(initializer_list<T>, const Allocator& = Allocator());
-    ~list();
-    list& operator=(const list& x);
-    list& operator=(list&& x)
       noexcept(allocator_traits<Allocator>::is_always_equal::value);
-    list& operator=(initializer_list<T>);
     template<class InputIterator>
-      void assign(InputIterator first, InputIterator last);
     template<container-compatible-range<T> R>
-      void assign_range(R&& rg);
-    void assign(size_type n, const T& t);
-    void assign(initializer_list<T>);
-    allocator_type get_allocator() const noexcept;
     // iterators
-    iterator               begin() noexcept;
-    const_iterator         begin() const noexcept;
-    iterator               end() noexcept;
-    const_iterator         end() const noexcept;
-    reverse_iterator       rbegin() noexcept;
-    const_reverse_iterator rbegin() const noexcept;
-    reverse_iterator       rend() noexcept;
-    const_reverse_iterator rend() const noexcept;
-    const_iterator         cbegin() const noexcept;
-    const_iterator         cend() const noexcept;
-    const_reverse_iterator crbegin() const noexcept;
-    const_reverse_iterator crend() const noexcept;
     // [list.capacity], capacity
- [[nodiscard]] bool empty() const noexcept;
-    size_type size() const noexcept;
-    size_type max_size() const noexcept;
-    void      resize(size_type sz);
-    void      resize(size_type sz, const T& c);
     // element access
-    reference       front();
-    const_reference front() const;
-    reference       back();
-    const_reference back() const;
     // [list.modifiers], modifiers
-    template<class... Args> reference emplace_front(Args&&... args);
-    template<class... Args> reference emplace_back(Args&&... args);
-    void push_front(const T& x);
-    void push_front(T&& x);
     template<container-compatible-range<T> R>
-      void prepend_range(R&& rg);
-    void pop_front();
-    void push_back(const T& x);
-    void push_back(T&& x);
     template<container-compatible-range<T> R>
-      void append_range(R&& rg);
-    void pop_back();
-    template<class... Args> iterator emplace(const_iterator position, Args&&... args);
-    iterator insert(const_iterator position, const T& x);
-    iterator insert(const_iterator position, T&& x);
-    iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
-      iterator insert(const_iterator position, InputIterator first, InputIterator last);
     template<container-compatible-range<T> R>
-      iterator insert_range(const_iterator position, R&& rg);
-    iterator insert(const_iterator position, initializer_list<T> il);
-    iterator erase(const_iterator position);
-    iterator erase(const_iterator position, const_iterator last);
-    void     swap(list&) noexcept(allocator_traits<Allocator>::is_always_equal::value);
-    void     clear() noexcept;
     // [list.ops], list operations
-    void splice(const_iterator position, list& x);
-    void splice(const_iterator position, list&& x);
-    void splice(const_iterator position, list& x, const_iterator i);
-    void splice(const_iterator position, list&& x, const_iterator i);
-    void splice(const_iterator position, list& x, const_iterator first, const_iterator last);
-    void splice(const_iterator position, list&& x, const_iterator first, const_iterator last);
-    size_type remove(const T& value);
-    template<class Predicate> size_type remove_if(Predicate pred);
-    size_type unique();
     template<class BinaryPredicate>
-      size_type unique(BinaryPredicate binary_pred);
-    void merge(list& x);
-    void merge(list&& x);
-    template<class Compare> void merge(list& x, Compare comp);
-    template<class Compare> void merge(list&& x, Compare comp);
-    void sort();
-    template<class Compare> void sort(Compare comp);
-    void reverse() noexcept;
   };
   template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     list(InputIterator, InputIterator, Allocator = Allocator())
       -> list<iter-value-type<InputIterator>, Allocator>;
@@ -165,65 +171,65 @@ allocator meets the allocator completeness requirements
 any member of the resulting specialization of `list` is referenced.
 #### Constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
-explicit list(const Allocator&);
 ```
 *Effects:* Constructs an empty list, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
-explicit list(size_type n, const Allocator& = Allocator());
 ```
-*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* Constructs a `list` with `n` default-inserted elements using
 the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
-list(size_type n, const T& value, const Allocator& = Allocator());
 ```
-*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* Constructs a `list` with `n` copies of `value`, using the
 specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
-  list(InputIterator first, InputIterator last, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `list` equal to the range \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
 ``` cpp
 template<container-compatible-range<T> R>
-  list(from_range_t, R&& rg, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `list` object with the elements of the range
 `rg`.
 *Complexity:* Linear in `ranges::distance(rg)`.
 #### Capacity <a id="list.capacity">[[list.capacity]]</a>
 ``` cpp
-void resize(size_type sz);
 ```
-*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* If `size() < sz`, appends `sz - size()` default-inserted
 elements to the sequence. If `sz <= size()`, equivalent to:
 ``` cpp
@@ -231,14 +237,14 @@ list<T>::iterator it = begin();
 advance(it, sz);
 erase(it, end());
 ```
 ``` cpp
-void resize(size_type sz, const T& c);
 ```
-*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* As if by:
 ``` cpp
 if (sz > size())
@@ -253,49 +259,48 @@ else
 ```
 #### Modifiers <a id="list.modifiers">[[list.modifiers]]</a>
 ``` cpp
-iterator insert(const_iterator position, const T& x);
-iterator insert(const_iterator position, T&& x);
-iterator insert(const_iterator position, size_type n, const T& x);
 template<class InputIterator>
-  iterator insert(const_iterator position, InputIterator first,
- InputIterator last);
 template<container-compatible-range<T> R>
-  iterator insert_range(const_iterator position, R&& rg);
-iterator insert(const_iterator position, initializer_list<T>);
-template<class... Args> reference emplace_front(Args&&... args);
-template<class... Args> reference emplace_back(Args&&... args);
-template<class... Args> iterator emplace(const_iterator position, Args&&... args);
-void push_front(const T& x);
-void push_front(T&& x);
 template<container-compatible-range<T> R>
-  void prepend_range(R&& rg);
-void push_back(const T& x);
-void push_back(T&& x);
 template<container-compatible-range<T> R>
-  void append_range(R&& rg);
 ```
 *Complexity:* Insertion of a single element into a list takes constant
 time and exactly one call to a constructor of `T`. Insertion of multiple
 elements into a list is linear in the number of elements inserted, and
 the number of calls to the copy constructor or move constructor of `T`
 is exactly equal to the number of elements inserted.
 *Remarks:* Does not affect the validity of iterators and references. If
-an exception is thrown there are no effects.
 ``` cpp
-iterator erase(const_iterator position);
-iterator erase(const_iterator first, const_iterator last);
-void pop_front();
-void pop_back();
-void clear() noexcept;
 ```
 *Effects:* Invalidates only the iterators and references to the erased
 elements.
@@ -322,12 +327,12 @@ those of `next(i, n)` and `prev(i, n)`, respectively. For `merge` and
 from one list to another. The behavior of splice operations is undefined
 if `get_allocator() !=
 x.get_allocator()`.
 ``` cpp
-void splice(const_iterator position, list& x);
-void splice(const_iterator position, list&& x);
 ```
 *Preconditions:* `addressof(x) != this` is `true`.
 *Effects:* Inserts the contents of `x` before `position` and `x` becomes
@@ -339,12 +344,12 @@ now behave as iterators into `*this`, not into `x`.
 *Throws:* Nothing.
 *Complexity:* Constant time.
 ``` cpp
-void splice(const_iterator position, list& x, const_iterator i);
-void splice(const_iterator position, list&& x, const_iterator i);
 ```
 *Preconditions:* `i` is a valid dereferenceable iterator of `x`.
 *Effects:* Inserts an element pointed to by `i` from list `x` before
@@ -357,18 +362,18 @@ element, but now behave as iterators into `*this`, not into `x`.
 *Throws:* Nothing.
 *Complexity:* Constant time.
 ``` cpp
-void splice(const_iterator position, list& x, const_iterator first,
- const_iterator last);
-void splice(const_iterator position, list&& x, const_iterator first,
- const_iterator last);
 ```
-*Preconditions:* `[first, last)` is a valid range in `x`. `position` is
-not an iterator in the range \[`first`, `last`).
 *Effects:* Inserts elements in the range \[`first`, `last`) before
 `position` and removes the elements from `x`. Pointers and references to
 the moved elements of `x` now refer to those same elements but as
 members of `*this`. Iterators referring to the moved elements will
@@ -379,12 +384,12 @@ into `*this`, not into `x`.
 *Complexity:* Constant time if `addressof(x) == this`; otherwise, linear
 time.
 ``` cpp
-size_type remove(const T& value);
-template<class Predicate> size_type remove_if(Predicate pred);
 ```
 *Effects:* Erases all the elements in the list referred to by a list
 iterator `i` for which the following conditions hold: `*i == value`,
 `pred(*i) != false`. Invalidates only the iterators and references to
@@ -399,12 +404,12 @@ the erased elements.
 predicate.
 *Remarks:* Stable [[algorithm.stable]].
 ``` cpp
-size_type unique();
-template<class BinaryPredicate> size_type unique(BinaryPredicate binary_pred);
 ```
 Let `binary_pred` be `equal_to<>{}` for the first overload.
 *Preconditions:* `binary_pred` is an equivalence relation.
@@ -422,14 +427,14 @@ only the iterators and references to the erased elements.
 *Complexity:* If `empty()` is `false`, exactly `size() - 1` applications
 of the corresponding predicate, otherwise no applications of the
 predicate.
 ``` cpp
-void merge(list& x);
-void merge(list&& x);
-template<class Compare> void merge(list& x, Compare comp);
-template<class Compare> void merge(list&& x, Compare comp);
 ```
 Let `comp` be `less<>` for the first two overloads.
 *Preconditions:* `*this` and `x` are both sorted with respect to the
@@ -446,14 +451,14 @@ elements, but they now behave as iterators into `*this`, not into `x`.
 *Complexity:* At most `size() + x.size() - 1` comparisons if
 `addressof(x) != this`; otherwise, no comparisons are performed.
 *Remarks:* Stable [[algorithm.stable]]. If `addressof(x) != this`, `x`
 is empty after the merge. No elements are copied by this operation. If
-an exception is thrown other than by a comparison there are no effects.
 ``` cpp
-void reverse() noexcept;
 ```
 *Effects:* Reverses the order of the elements in the list. Does not
 affect the validity of iterators and references.
@@ -467,28 +472,31 @@ template<class Compare> void sort(Compare comp);
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 function object. If an exception is thrown, the order of the elements in
 `*this` is unspecified. Does not affect the validity of iterators and
 references.
-*Complexity:* Approximately N log N comparisons, where `N == size()`.
 *Remarks:* Stable [[algorithm.stable]].
 #### Erasure <a id="list.erasure">[[list.erasure]]</a>
 ``` cpp
-template<class T, class Allocator, class U>
   typename list<T, Allocator>::size_type
-    erase(list<T, Allocator>& c, const U& value);
 ```
 *Effects:* Equivalent to:
-`return erase_if(c, [&](auto& elem) { return elem == value; });`
 ``` cpp
 template<class T, class Allocator, class Predicate>
   typename list<T, Allocator>::size_type
-    erase_if(list<T, Allocator>& c, Predicate pred);
 ```
 *Effects:* Equivalent to: `return c.remove_if(pred);`

 Descriptions are provided here only for operations on `list` that are
 not described in one of these tables or for operations where there is
 additional semantic information.
+The types `iterator` and `const_iterator` meet the constexpr iterator
+requirements [[iterator.requirements.general]].
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class list {
   public:
     // types
     using value_type             = T;
     using allocator_type         = Allocator;
+    using pointer                = allocator_traits<Allocator>::pointer;
+    using const_pointer          = allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
     using const_reference        = const value_type&;
     using size_type              = implementation-defined  // type of list::size_type; // see [container.requirements]
     using difference_type        = implementation-defined  // type of list::difference_type; // see [container.requirements]
     using iterator               = implementation-defined  // type of list::iterator; // see [container.requirements]
     using const_iterator         = implementation-defined  // type of list::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // [list.cons], construct/copy/destroy
+ constexpr list() : list(Allocator()) { }
+ constexpr explicit list(const Allocator&);
+ constexpr explicit list(size_type n, const Allocator& = Allocator());
+ constexpr list(size_type n, const T& value, const Allocator& = Allocator());
     template<class InputIterator>
+ constexpr list(InputIterator first, InputIterator last, const Allocator& = Allocator());
     template<container-compatible-range<T> R>
+ constexpr list(from_range_t, R&& rg, const Allocator& = Allocator());
+ constexpr list(const list& x);
+ constexpr list(list&& x);
+ constexpr list(const list&, const type_identity_t<Allocator>&);
+ constexpr list(list&&, const type_identity_t<Allocator>&);
+ constexpr list(initializer_list<T>, const Allocator& = Allocator());
+ constexpr ~list();
+ constexpr list& operator=(const list& x);
+ constexpr list& operator=(list&& x)
       noexcept(allocator_traits<Allocator>::is_always_equal::value);
+ constexpr list& operator=(initializer_list<T>);
     template<class InputIterator>
+ constexpr void assign(InputIterator first, InputIterator last);
     template<container-compatible-range<T> R>
+ constexpr void assign_range(R&& rg);
+ constexpr void assign(size_type n, const T& t);
+ constexpr void assign(initializer_list<T>);
+ constexpr allocator_type get_allocator() const noexcept;
     // iterators
+ constexpr iterator               begin() noexcept;
+ constexpr const_iterator         begin() const noexcept;
+ constexpr iterator               end() noexcept;
+ constexpr const_iterator         end() const noexcept;
+ constexpr reverse_iterator       rbegin() noexcept;
+ constexpr const_reverse_iterator rbegin() const noexcept;
+ constexpr reverse_iterator       rend() noexcept;
+ constexpr const_reverse_iterator rend() const noexcept;
+ constexpr const_iterator         cbegin() const noexcept;
+ constexpr const_iterator         cend() const noexcept;
+ constexpr const_reverse_iterator crbegin() const noexcept;
+ constexpr const_reverse_iterator crend() const noexcept;
     // [list.capacity], capacity
+ constexpr bool empty() const noexcept;
+ constexpr size_type size() const noexcept;
+ constexpr size_type max_size() const noexcept;
+ constexpr void      resize(size_type sz);
+ constexpr void      resize(size_type sz, const T& c);
     // element access
+ constexpr reference       front();
+ constexpr const_reference front() const;
+ constexpr reference       back();
+ constexpr const_reference back() const;
     // [list.modifiers], modifiers
+    template<class... Args> constexpr reference emplace_front(Args&&... args);
+    template<class... Args> constexpr reference emplace_back(Args&&... args);
+ constexpr void push_front(const T& x);
+ constexpr void push_front(T&& x);
     template<container-compatible-range<T> R>
+ constexpr void prepend_range(R&& rg);
+ constexpr void pop_front();
+ constexpr void push_back(const T& x);
+ constexpr void push_back(T&& x);
     template<container-compatible-range<T> R>
+ constexpr void append_range(R&& rg);
+ constexpr void pop_back();
+    template<class... Args> constexpr iterator emplace(const_iterator position, Args&&... args);
+ constexpr iterator insert(const_iterator position, const T& x);
+ constexpr iterator insert(const_iterator position, T&& x);
+ constexpr iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
+ constexpr iterator insert(const_iterator position,
+                                InputIterator first, InputIterator last);
     template<container-compatible-range<T> R>
+ constexpr iterator insert_range(const_iterator position, R&& rg);
+ constexpr iterator insert(const_iterator position, initializer_list<T> il);
+ constexpr iterator erase(const_iterator position);
+ constexpr iterator erase(const_iterator position, const_iterator last);
+ constexpr void     swap(list&) noexcept(allocator_traits<Allocator>::is_always_equal::value);
+ constexpr void     clear() noexcept;
     // [list.ops], list operations
+ constexpr void splice(const_iterator position, list& x);
+ constexpr void splice(const_iterator position, list&& x);
+ constexpr void splice(const_iterator position, list& x, const_iterator i);
+ constexpr void splice(const_iterator position, list&& x, const_iterator i);
+ constexpr void splice(const_iterator position, list& x,
+ const_iterator first, const_iterator last);
+    constexpr void splice(const_iterator position, list&& x,
+                          const_iterator first, const_iterator last);
+ constexpr size_type remove(const T& value);
+    template<class Predicate> constexpr size_type remove_if(Predicate pred);
+ constexpr size_type unique();
     template<class BinaryPredicate>
+ constexpr size_type unique(BinaryPredicate binary_pred);
+ constexpr void merge(list& x);
+ constexpr void merge(list&& x);
+    template<class Compare> constexpr void merge(list& x, Compare comp);
+    template<class Compare> constexpr void merge(list&& x, Compare comp);
+ constexpr void sort();
+    template<class Compare> constexpr void sort(Compare comp);
+ constexpr void reverse() noexcept;
   };
   template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     list(InputIterator, InputIterator, Allocator = Allocator())
       -> list<iter-value-type<InputIterator>, Allocator>;
 any member of the resulting specialization of `list` is referenced.
 #### Constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
+constexpr explicit list(const Allocator&);
 ```
 *Effects:* Constructs an empty list, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
+constexpr explicit list(size_type n, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `list`.
 *Effects:* Constructs a `list` with `n` default-inserted elements using
 the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
+constexpr list(size_type n, const T& value, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `list`.
 *Effects:* Constructs a `list` with `n` copies of `value`, using the
 specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
+ constexpr list(InputIterator first, InputIterator last, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `list` equal to the range \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
 ``` cpp
 template<container-compatible-range<T> R>
+ constexpr list(from_range_t, R&& rg, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `list` object with the elements of the range
 `rg`.
 *Complexity:* Linear in `ranges::distance(rg)`.
 #### Capacity <a id="list.capacity">[[list.capacity]]</a>
 ``` cpp
+constexpr void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `list`.
 *Effects:* If `size() < sz`, appends `sz - size()` default-inserted
 elements to the sequence. If `sz <= size()`, equivalent to:
 ``` cpp
 advance(it, sz);
 erase(it, end());
 ```
 ``` cpp
+constexpr void resize(size_type sz, const T& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `list`.
 *Effects:* As if by:
 ``` cpp
 if (sz > size())
 ```
 #### Modifiers <a id="list.modifiers">[[list.modifiers]]</a>
 ``` cpp
+constexpr iterator insert(const_iterator position, const T& x);
+constexpr iterator insert(const_iterator position, T&& x);
+constexpr iterator insert(const_iterator position, size_type n, const T& x);
 template<class InputIterator>
+ constexpr iterator insert(const_iterator position,
+ InputIterator first, InputIterator last);
 template<container-compatible-range<T> R>
+ constexpr iterator insert_range(const_iterator position, R&& rg);
+constexpr iterator insert(const_iterator position, initializer_list<T>);
+template<class... Args> constexpr reference emplace_front(Args&&... args);
+template<class... Args> constexpr reference emplace_back(Args&&... args);
+template<class... Args> constexpr iterator emplace(const_iterator position, Args&&... args);
+constexpr void push_front(const T& x);
+constexpr void push_front(T&& x);
 template<container-compatible-range<T> R>
+ constexpr void prepend_range(R&& rg);
+constexpr void push_back(const T& x);
+constexpr void push_back(T&& x);
 template<container-compatible-range<T> R>
+ constexpr void append_range(R&& rg);
 ```
 *Complexity:* Insertion of a single element into a list takes constant
 time and exactly one call to a constructor of `T`. Insertion of multiple
 elements into a list is linear in the number of elements inserted, and
 the number of calls to the copy constructor or move constructor of `T`
 is exactly equal to the number of elements inserted.
 *Remarks:* Does not affect the validity of iterators and references. If
+an exception is thrown, there are no effects.
 ``` cpp
+constexpr iterator erase(const_iterator position);
+constexpr iterator erase(const_iterator first, const_iterator last);
+constexpr void pop_front();
+constexpr void pop_back();
+constexpr void clear() noexcept;
 ```
 *Effects:* Invalidates only the iterators and references to the erased
 elements.
 from one list to another. The behavior of splice operations is undefined
 if `get_allocator() !=
 x.get_allocator()`.
 ``` cpp
+constexpr void splice(const_iterator position, list& x);
+constexpr void splice(const_iterator position, list&& x);
 ```
 *Preconditions:* `addressof(x) != this` is `true`.
 *Effects:* Inserts the contents of `x` before `position` and `x` becomes
 *Throws:* Nothing.
 *Complexity:* Constant time.
 ``` cpp
+constexpr void splice(const_iterator position, list& x, const_iterator i);
+constexpr void splice(const_iterator position, list&& x, const_iterator i);
 ```
 *Preconditions:* `i` is a valid dereferenceable iterator of `x`.
 *Effects:* Inserts an element pointed to by `i` from list `x` before
 *Throws:* Nothing.
 *Complexity:* Constant time.
 ``` cpp
+constexpr void splice(const_iterator position, list& x,
+ const_iterator first, const_iterator last);
+constexpr void splice(const_iterator position, list&& x,
+ const_iterator first, const_iterator last);
 ```
+*Preconditions:* \[`first`, `last`) is a valid range in `x`. `position`
+is not an iterator in the range \[`first`, `last`).
 *Effects:* Inserts elements in the range \[`first`, `last`) before
 `position` and removes the elements from `x`. Pointers and references to
 the moved elements of `x` now refer to those same elements but as
 members of `*this`. Iterators referring to the moved elements will
 *Complexity:* Constant time if `addressof(x) == this`; otherwise, linear
 time.
 ``` cpp
+constexpr size_type remove(const T& value);
+template<class Predicate> constexpr size_type remove_if(Predicate pred);
 ```
 *Effects:* Erases all the elements in the list referred to by a list
 iterator `i` for which the following conditions hold: `*i == value`,
 `pred(*i) != false`. Invalidates only the iterators and references to
 predicate.
 *Remarks:* Stable [[algorithm.stable]].
 ``` cpp
+constexpr size_type unique();
+template<class BinaryPredicate> constexpr size_type unique(BinaryPredicate binary_pred);
 ```
 Let `binary_pred` be `equal_to<>{}` for the first overload.
 *Preconditions:* `binary_pred` is an equivalence relation.
 *Complexity:* If `empty()` is `false`, exactly `size() - 1` applications
 of the corresponding predicate, otherwise no applications of the
 predicate.
 ``` cpp
+constexpr void merge(list& x);
+constexpr void merge(list&& x);
+template<class Compare> constexpr void merge(list& x, Compare comp);
+template<class Compare> constexpr void merge(list&& x, Compare comp);
 ```
 Let `comp` be `less<>` for the first two overloads.
 *Preconditions:* `*this` and `x` are both sorted with respect to the
 *Complexity:* At most `size() + x.size() - 1` comparisons if
 `addressof(x) != this`; otherwise, no comparisons are performed.
 *Remarks:* Stable [[algorithm.stable]]. If `addressof(x) != this`, `x`
 is empty after the merge. No elements are copied by this operation. If
+an exception is thrown other than by a comparison, there are no effects.
 ``` cpp
+constexpr void reverse() noexcept;
 ```
 *Effects:* Reverses the order of the elements in the list. Does not
 affect the validity of iterators and references.
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 function object. If an exception is thrown, the order of the elements in
 `*this` is unspecified. Does not affect the validity of iterators and
 references.
+*Complexity:* Approximately N log N comparisons, where N is `size()`.
 *Remarks:* Stable [[algorithm.stable]].
 #### Erasure <a id="list.erasure">[[list.erasure]]</a>
 ``` cpp
+template<class T, class Allocator, class U = T>
   typename list<T, Allocator>::size_type
+ constexpr erase(list<T, Allocator>& c, const U& value);
 ```
 *Effects:* Equivalent to:
+``` cpp
+return erase_if(c, [&](const auto& elem) -> bool { return elem == value; });
+```
 ``` cpp
 template<class T, class Allocator, class Predicate>
   typename list<T, Allocator>::size_type
+ constexpr erase_if(list<T, Allocator>& c, Predicate pred);
 ```
 *Effects:* Equivalent to: `return c.remove_if(pred);`

Diff to HTML by rtfpessoa