std::set_union
De cppreference.com
 |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
<metanoindex/>
<tbody> </tbody>| Definido no cabeçalho <algorithm>
|
||
template< class InputIt1, class InputIt2, class OutputIt > OutputIt set_union( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first ); |
(1) | |
template< class InputIt1, class InputIt2, class OutputIt, class Compare > OutputIt set_union( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp ); |
(2) | |
Constrói um início intervalo classificado em
d_first constituído por todos os elementos presentes em uma ou ambas as faixas classificadas [first1, last1) e [first2, last2). A primeira versão espera que tanto a entrada varia de ser resolvido com operator<, a segunda versão espera que sejam classificados com o comp dada função de comparação. Se algum elemento é encontrado m vezes em [first1, last1) e n vezes em [first2, last2), então todos os elementos m serão copiados para [first1, last1) d_first, preservando a ordem, e em seguida, exatamente elementos std::max(n-m, 0) serão copiados para [first2, last2) d_first, também preservar a ordem. O intervalo resultante não pode sobrepor-se a qualquer das faixas de entrada.Original:
Constructs a sorted range beginning at
d_first consisting of all elements present in one or both sorted ranges [first1, last1) and [first2, last2). The first version expects both input ranges to be sorted with operator<, the second version expects them to be sorted with the given comparison function comp. If some element is found m times in [first1, last1) and n times in [first2, last2), then all m elements will be copied from [first1, last1) to d_first, preserving order, and then exactly std::max(n-m, 0) elements will be copied from [first2, last2) to d_first, also preserving order. The resulting range cannot overlap with either of the input ranges.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Parâmetros
| first1, last1 | - | a primeira entrada ordenadas gama
Original: the first input sorted range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| first2, last2 | - | a segunda entrada ordenadas gama
Original: the second input sorted range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| 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:
The signature does not need to have |
| Type requirements | ||
-InputIt1 must meet the requirements of InputIterator.
| ||
-InputIt2 must meet the requirements of InputIterator.
| ||
-OutputIt must meet the requirements of OutputIterator.
| ||
Valor de retorno
Iterator após o final do intervalo construída.
Original:
Iterator past the end of the constructed range.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complexidade
Na maioria das comparações dos 2·(N1+N2-1), onde N1
= std::distance(first1, last1) e N2 = std::distance(first2, last2).Original:
At most 2·(N1+N2-1) comparisons, where N1
= std::distance(first1, last1) and N2 = std::distance(first2, last2).The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Possível implementação
| First version |
|---|
template<class InputIt1, class InputIt2, class OutputIt>
OutputIt set_union(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2,
OutputIt d_first)
{
for (; first1 != last1; ++d_first) {
if (first2 == last2)
return std::copy(first1, last1, d_first);
if (*first2 < *first1) {
*d_first = *first2++;
} else {
*d_first = *first1;
if (!(*first1 < *first2))
++first2;
++first1;
}
}
return std::copy(first2, last2, d_first);
}
|
| Second version |
template<class InputIt1, class InputIt2,
class OutputIt, class Compare>
OutputIt set_union(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2,
OutputIt d_first, Compare comp)
{
for (; first1 != last1; ++d_first) {
if (first2 == last2)
return std::copy(first1, last1, d_first);
if (comp(*first2, *first1)) {
*d_first = *first2++;
} else {
*d_first = *first1;
if (!comp(*first1, *first2))
++first2;
++first1;
}
}
return std::copy(first2, last2, d_first);
}
|
Exemplo
| Esta seção está incompleta Motivo: sem exemplo |
Veja também
devolve verdadeiro se um conjunto é um subconjunto de uma outra Original: returns true if one set is a subset of another The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de função) | |
calcula a diferença entre os dois conjuntos Original: computes the difference between two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de função) | |
calcula a interseção de dois conjuntos Original: computes the intersection of two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de função) | |
calcula a diferença entre os dois conjuntos simétricos Original: computes the symmetric difference between two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de função) | |