std::forward_list::merge

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::forward_list
Member functions forward_list::forward_list forward_list::~forward_list forward_list::operator= forward_list::assign forward_list::get_allocator Element access forward_list::front Iterators forward_list::before_begin forward_list::cbefore_begin forward_list::begin forward_list::cbegin forward_list::end forward_list::cend Capacity forward_list::empty forward_list::max_size Modifiers forward_list::clear forward_list::insert_after forward_list::emplace_after forward_list::erase_after forward_list::push_front forward_list::emplace_front forward_list::pop_front forward_list::resize forward_list::swap Operations forward_list::merge forward_list::splice_after forward_list::remove forward_list::remove_if forward_list::reverse forward_list::unique forward_list::sort

void merge( forward_list& other );	(1)	(C++11 feature)
void merge( forward_list&& other );	(1)	(C++11 feature)
template <class Compare> void merge( forward_list& other, Compare comp );	(2)	(C++11 feature)
template <class Compare> void merge( forward_list&& other, Compare comp );	(2)	(C++11 feature)

Merges two sorted lists into one. The lists should be sorted into ascending order.

No elements are copied. The container other becomes empty after the operation. The function does nothing if this == &other. If get_allocator() != other.get_allocator(), the behavior is undefined. No iterators or references become invalidated, except that the iterators of moved elements now refer into *this, not into other. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.

Contents 1 Parameters 2 Return value 3 Example 4 Complexity 5 See also

[edit] Parameters

other	-	another container to merge
comp	-	comparison function which returns ​true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const &, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that an object of type forward_list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them. ​

[edit] Return value

(none)

[edit] Example

This section is incomplete

[edit] Complexity

at most size() + other.size() - 1 comparisons.

[edit] See also

splice	moves elements from another forward_list (public member function)