|
3805 | 3805 | forward_list() : forward_list(Allocator()) { }
|
3806 | 3806 | explicit forward_list(const Allocator&);
|
3807 | 3807 | explicit forward_list(size_type n, const Allocator& = Allocator());
|
3808 |
| - forward_list(size_type n, const T& value, |
3809 |
| - const Allocator& = Allocator()); |
| 3808 | + forward_list(size_type n, const T& value, const Allocator& = Allocator()); |
3810 | 3809 | template <class InputIterator>
|
3811 |
| - forward_list(InputIterator first, InputIterator last, |
3812 |
| - const Allocator& = Allocator()); |
| 3810 | + forward_list(InputIterator first, InputIterator last, const Allocator& = Allocator()); |
3813 | 3811 | forward_list(const forward_list& x);
|
3814 | 3812 | forward_list(forward_list&& x);
|
3815 | 3813 | forward_list(const forward_list& x, const Allocator&);
|
|
3873 | 3871 | // \ref{forwardlist.ops}, \tcode{forward_list} operations
|
3874 | 3872 | void splice_after(const_iterator position, forward_list& x);
|
3875 | 3873 | void splice_after(const_iterator position, forward_list&& x);
|
3876 |
| - void splice_after(const_iterator position, forward_list& x, |
3877 |
| - const_iterator i); |
3878 |
| - void splice_after(const_iterator position, forward_list&& x, |
3879 |
| - const_iterator i); |
| 3874 | + void splice_after(const_iterator position, forward_list& x, const_iterator i); |
| 3875 | + void splice_after(const_iterator position, forward_list&& x, const_iterator i); |
3880 | 3876 | void splice_after(const_iterator position, forward_list& x,
|
3881 | 3877 | const_iterator first, const_iterator last);
|
3882 | 3878 | void splice_after(const_iterator position, forward_list&& x,
|
|
4580 | 4576 | iterator insert(const_iterator position, T&& x);
|
4581 | 4577 | iterator insert(const_iterator position, size_type n, const T& x);
|
4582 | 4578 | template <class InputIterator>
|
4583 |
| - iterator insert(const_iterator position, InputIterator first, |
4584 |
| - InputIterator last); |
| 4579 | + iterator insert(const_iterator position, InputIterator first, InputIterator last); |
4585 | 4580 | iterator insert(const_iterator position, initializer_list<T> il);
|
4586 | 4581 |
|
4587 | 4582 | iterator erase(const_iterator position);
|
4588 | 4583 | iterator erase(const_iterator position, const_iterator last);
|
4589 |
| - void swap(list&) |
4590 |
| - noexcept(allocator_traits<Allocator>::is_always_equal::value); |
| 4584 | + void swap(list&) noexcept(allocator_traits<Allocator>::is_always_equal::value); |
4591 | 4585 | void clear() noexcept;
|
4592 | 4586 |
|
4593 | 4587 | // \ref{list.ops}, list operations
|
4594 | 4588 | void splice(const_iterator position, list& x);
|
4595 | 4589 | void splice(const_iterator position, list&& x);
|
4596 | 4590 | void splice(const_iterator position, list& x, const_iterator i);
|
4597 | 4591 | void splice(const_iterator position, list&& x, const_iterator i);
|
4598 |
| - void splice(const_iterator position, list& x, |
4599 |
| - const_iterator first, const_iterator last); |
4600 |
| - void splice(const_iterator position, list&& x, |
4601 |
| - const_iterator first, const_iterator last); |
| 4592 | + void splice(const_iterator position, list& x, const_iterator first, const_iterator last); |
| 4593 | + void splice(const_iterator position, list&& x, const_iterator first, const_iterator last); |
4602 | 4594 |
|
4603 | 4595 | void remove(const T& value);
|
4604 | 4596 | template <class Predicate> void remove_if(Predicate pred);
|
|
5710 | 5702 | vector() : vector(Allocator()) { }
|
5711 | 5703 | explicit vector(const Allocator&);
|
5712 | 5704 | explicit vector(size_type n, const Allocator& = Allocator());
|
5713 |
| - vector(size_type n, const bool& value, |
5714 |
| - const Allocator& = Allocator()); |
| 5705 | + vector(size_type n, const bool& value, const Allocator& = Allocator()); |
5715 | 5706 | template <class InputIterator>
|
5716 |
| - vector(InputIterator first, InputIterator last, |
5717 |
| - const Allocator& = Allocator()); |
| 5707 | + vector(InputIterator first, InputIterator last, const Allocator& = Allocator()); |
5718 | 5708 | vector(const vector<bool, Allocator>& x);
|
5719 | 5709 | vector(vector<bool, Allocator>&& x);
|
5720 | 5710 | vector(const vector&, const Allocator&);
|
|
5772 | 5762 | iterator insert(const_iterator position, const bool& x);
|
5773 | 5763 | iterator insert(const_iterator position, size_type n, const bool& x);
|
5774 | 5764 | template <class InputIterator>
|
5775 |
| - iterator insert(const_iterator position, |
5776 |
| - InputIterator first, InputIterator last); |
| 5765 | + iterator insert(const_iterator position, InputIterator first, InputIterator last); |
5777 | 5766 | iterator insert(const_iterator position, initializer_list<bool> il);
|
5778 | 5767 |
|
5779 | 5768 | iterator erase(const_iterator position);
|
|
9531 | 9520 | priority_queue(const Compare& x, const Container&);
|
9532 | 9521 | explicit priority_queue(const Compare& x = Compare(), Container&& = Container());
|
9533 | 9522 | template <class InputIterator>
|
9534 |
| - priority_queue(InputIterator first, InputIterator last, |
9535 |
| - const Compare& x, const Container&); |
| 9523 | + priority_queue(InputIterator first, InputIterator last, const Compare& x, |
| 9524 | + const Container&); |
9536 | 9525 | template <class InputIterator>
|
9537 | 9526 | priority_queue(InputIterator first, InputIterator last,
|
9538 |
| - const Compare& x = Compare(), Container&& = Container()); |
| 9527 | + const Compare& x = Compare(), Container&& = Container()); |
9539 | 9528 | template <class Alloc> explicit priority_queue(const Alloc&);
|
9540 | 9529 | template <class Alloc> priority_queue(const Compare&, const Alloc&);
|
9541 | 9530 | template <class Alloc> priority_queue(const Compare&, const Container&, const Alloc&);
|
|
9608 | 9597 | \indexlibrary{\idxcode{priority_queue}!constructor}%
|
9609 | 9598 | \begin{itemdecl}
|
9610 | 9599 | template <class InputIterator>
|
9611 |
| - priority_queue(InputIterator first, InputIterator last, |
9612 |
| - const Compare& x, |
9613 |
| - const Container& y); |
| 9600 | + priority_queue(InputIterator first, InputIterator last, const Compare& x, const Container& y); |
9614 | 9601 | template <class InputIterator>
|
9615 |
| - priority_queue(InputIterator first, InputIterator last, |
9616 |
| - const Compare& x = Compare(), |
| 9602 | + priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare(), |
9617 | 9603 | Container&& y = Container());
|
9618 | 9604 | \end{itemdecl}
|
9619 | 9605 |
|
|
0 commit comments