std::move

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Algoritmo libreria

Funzioni Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Non modifica le operazioni di sequenza Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
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
Modifica delle operazioni di sequenza Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
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
Partizionamento operazioni Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Ordinamento delle operazioni (su intervalli ordinati) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binarie (le operazioni di ricerca sui campi ordinati) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Impostare le operazioni (su intervalli ordinati) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operazioni Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimo / massimo le operazioni Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operazioni numeriche Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
Libreria C Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template<class InputIt, class OutputIt > OutputIt move( InputIt first, InputIt last, OutputIt d_first );		(dal C++11)

Sposta gli elementi nel [first, last) gamma, ad un altro inizio gamma a d_first. Dopo questa operazione gli elementi della mosso-da posizione conterrà ancora valori validi del tipo appropriato, ma non necessariamente gli stessi valori di prima del trasloco.

Original:

Moves the elements in the range [first, last), to another range beginning at d_first. After this operation the elements in the moved-from range will still contain valid values of the appropriate type, but not necessarily the same values as before the move.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parametri

first, last	-	la gamma di elementi da spostare Original: the range of elements to move The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
d_first	-	l'inizio del campo di destinazione. Se d_first è all'interno [first, last), std::move_backward deve essere usato al posto di NJ std :: mossa </ span> . Original: the beginning of the destination range. If d_first is within [first, last), std::move_backward must be used instead of NJ std :: mossa </ span>. </div> The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. </div></div></div></div>
Type requirements
- InputIt must meet the requirements of InputIterator.
- OutputIt must meet the requirements of OutputIterator.

Valore di ritorno

Iteratore di uscita all'elemento passato l'ultimo elemento spostato (d_first +(last - first))

Original:

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

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Complessità

Esattamente last - first spostare le assegnazioni.

Original:

Exactly last - first move assignments.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Possibile implementazione

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

Esempio

Il codice seguente sposta oggetti thread (che a loro volta non sono copiabili) da un contenitore ad un altro. </ p>

Original:

<p>The following code moves thread objects (which themselves are not copyable) from one container to another.</p>

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

</div>

#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 std::thread is noncopyablestd :: mossa </ span>(v.begin(), v.end(), std::back_inserter(l));
    for(auto& t : l) t.join();
} </div>

Uscita:

Original:

Output:

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

thread 1 ended thread 2 ended thread 3 ended

Vedi anche

move_backward (C++11)	sposta un intervallo di elementi in una nuova posizione in ordine inverso Original: moves a range of elements to a new location in backwards order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (funzione di modello)