std::move

 

C++

Language

Concepts

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)

 

Algorithm library

Functions
Non-modifying sequence operations
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifying sequence operations
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partitioning operations
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Sorting operations (on sorted ranges)
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binary search operations (on sorted ranges)
lower_bound upper_bound	binary_search equal_range
Set operations (on sorted ranges)
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operations
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimum/maximum operations
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Numeric operations
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C library
qsort	bsearch

 

Defined in header <algorithm>
template< class InputIterator, class OutputIterator > OutputIterator move( InputIterator first, InputIterator last, OutputIterator d_first );		(since C++11)

Moves the elements in the range [first, last), to another range beginning at d_first.

Parameters

first, last	-	the range of elements to move
d_first	-	the beginning of the destination range. If d_first is within [first, last), std::move_backward must be used instead of std::move.

Return value

Output iterator to the element past the last element moved (d_first + (last - first))

Complexity

Exactly last - first move assignments.

Possible implementation

template<class InputIterator, class OutputIterator> OutputIterator move(InputIterator first, InputIterator last, OutputIterator d_first) { while (first != last) { *d_first++ = std::move(*first++); } return d_first; }

Example

The following code moves threads handles (which themselves are not copyable) from one container to another.

#include <iostream>
#include <vector>
#include <list>
#include <iterator>
#include <thread>
#include <chrono>
void f(int n)
{
   std::this_thread::sleep_for(std::chrono::seconds(n));
   std::cout << "thread " << n << " ended" << '\n';
}
int main() {
   std::vector<std::thread> v;
   v.emplace_back(f, 1);
   v.emplace_back(f, 2);
   v.emplace_back(f, 3);
   std::list<std::thread> l;
   // copy() would not compile,because the thread`s parent is noncopyable

      std::move(v.begin(), v.end(), std::back_inserter(l));
   for(auto& t : l) t.join();
}

Output:

thread 1 ended
thread 2 ended
thread 3 ended

See also

move_backward (C++11)	moves a range of elements to a new location in backwards order (function template)