std::unique_copy

 

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 > ForwardIt unique_copy( InputIt first, InputIt last,                        OutputIt d_first );	(1)
template< class InputIt, class OutputIt, class BinaryPredicate > ForwardIt unique_copy( InputIt first, InputIt last,                        OutputIt d_first, BinaryPredicate p );	(2)

Copia gli elementi dal [first, last) gamma, ad un altro inizio intervallo su d_first in modo tale che non vi siano elementi consecutivi uguali. Solo il primo elemento di ciascun gruppo di elementi uguali viene copiato. La prima versione utilizza operator== di confrontare gli elementi, la seconda versione utilizza il predicato binario dato p.

Original:

Copies the elements from the range [first, last), to another range beginning at d_first in such a way that there are no consecutive equal elements. Only the first element of each group of equal elements is copied. The first version uses operator== to compare the elements, the second version uses the given binary predicate p.

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	-	l'intervallo di elementi di processo Original: the range of elements to process 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 Original: the beginning of the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
p	-	binary predicate which returns ​true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following:  bool pred(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 ForwardIt can be dereferenced and then implicitly converted to both of them. ​
Type requirements
- InputIt must meet the requirements of InputIterator.
- OutputIt must meet the requirements of OutputIterator.
- The type of dereferenced InputIt must meet the requirements of CopyAssignable.
- The type of dereferenced InputIt must meet the requirements of CopyConstructible. if neither InputIt nor OutputIt satisfies ForwardIterator

Valore di ritorno

Uscita iteratore all'elemento passato l'ultimo elemento scritto

Original:

Output iterator to the element past the last written element

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

Possibile implementazione

First version
template<class ForwardIt, class OutputIt> ForwardIt unique_copy(ForwardIt first, ForwardIt last, OutputIt d_first) {   if (first == last) return d_first;   *d_first = *first; while (++first != last) { if (!(*d_first == *first)) { *(++d_first) = *first; } } return ++d_first; }
Second version
template<class ForwardIt, class OutputIt, class BinaryPredicate> ForwardIt unique_copy(ForwardIt first, ForwardIt last, OutputIt d_first, BinaryPredicate p) {   if (first == last) return d_first;   *d_first = *first; while (++first != last) { if (!p(*result, *first)) { *(++d_first) = *first; } } return ++d_first; }

Esempio

Le finiture del programma seguenti tutti gli spazi multipli consecutivi in ​​una stringa const e stampa il risultato

Original:

The following program trims all multiple consecutive spaces in a const string and prints the result

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

#include <string>
#include <iostream>
#include <algorithm>
#include <iterator>
 
int main()
{
    std::string s1 = "The      string    with many       spaces!";
    std::cout << "before: " << s1 << '\n';
 
    std::string s2;
    std::unique_copy(s1.begin(), s1.end(), std::back_inserter(s2),
                     [](char c1, char c2){ return c1 == ' ' && c2 == ' '; });
 
    std::cout << "after:  " << s2 << '\n';
}

Output:

before: The      string    with many       spaces!
after:  The string with many spaces!

Complessità

lineare la distanza tra first e last

Original:

linear in the distance between first and last

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

Vedi anche

adjacent_find	trova due identici (o qualche altra relazione) elementi adiacenti l'uno all'altro Original: finds two identical (or some other relationship) items adjacent to each other 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)
unique	removes consecutive duplicate elements in a range (funzione di modello)