std::merge
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. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Definido no cabealho <algorithm>
|
||
template< class InputIt1, class InputIt2, class OutputIt > OutputIt merge( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2 OutputIt d_first ); |
(1) | |
template< class InputIt1, class InputIt2, class OutputIt, class Compare> OutputIt merge( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2 OutputIt d_first, Compare comp ); |
(2) | |
Mescla duas faixas classificadas
[first1, last1) e [first2, last2) em um intervalo classificado no incio d_first. A primeira verso utiliza operator< para comparar os elementos, a segunda verso utiliza o comp dada funo de comparao. A ordem relativa dos elementos equivalentes so preservados.Original:
Merges two sorted ranges
[first1, last1) and [first2, last2) into one sorted range beginning at d_first. The first version uses operator< to compare the elements, the second version uses the given comparison function comp. The relative order of equivalent elements is preserved.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.
Parmetros
| first1, last1 | - | a primeira gama de elementos para a fuso
Original: the first range of elements to merge 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 faixa de elementos de fuses
Original: the second range of elements to merge The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| d_first | - | o incio do intervalo de destino
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. |
| 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
Um iterador elemento de sada para alm do ltimo elemento copiado.
Original:
An output iterator to element past the last element copied.
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 comparaes dos
std::distance(first1, last1) + std::distance(first2, last2) + 1.Original:
At most
std::distance(first1, last1) + std::distance(first2, last2) + 1 comparisons.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.
Possvel implementao
| First version |
|---|
template<class InputIt1, class InputIt2, class OutputIt>
OutputIt merge(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;
++first2;
} else {
*d_first = *first1;
++first1;
}
}
return std::copy(first2, last2, d_first);
}
|
| Second version |
template<class InputIt1, class InputIt2,
class OutputIt, class Compare>
OutputIt merge(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;
++first2;
} else {
*d_first = *first1;
++first1;
}
}
return std::copy(first2, last2, d_first);
}
|
Exemplo
#include <iostream>
#include <iterator>
#include <cstdlib>
#include <algorithm>
#include <vector>
int main()
{
const std::size_t items = 10;
std::vector<int> v1, v2, dst;
// fill the vectors
for (std::size_t idx = 0; idx < items; ++idx) {
v1.push_back(std::rand()%items);
v2.push_back(std::rand()%items);
}
// sort
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
// output v1
std::cout << "v1 : ";
std::copy(v1.begin(), v1.end(),
std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
// output v2
std::cout << "v2 : ";
std::copy(v2.begin(), v2.end(),
std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
// merge
std::merge(v1.begin(), v1.end(),
v2.begin(), v2.end(),
std::back_inserter(dst));
// output
std::cout << "dst: ";
std::copy(dst.begin(), dst.end(),
std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
}
Sada:
v1 : 0 0 2 2 3 3 3 6 7 9
v2 : 1 2 5 5 6 6 6 6 7 9
dst: 0 0 1 2 2 2 3 3 3 5 5 6 6 6 6 6 7 7 9 9
Veja tambm
funde duas faixas encomendadas no local Original: merges two ordered ranges in-place The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de funo) | |
tipo um intervalo em ordem crescente Original: sorts a range into ascending order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de funo) | |
Classifica um intervalo de elementos preservando ordem entre elementos iguais Original: sorts a range of elements while preserving order between equal elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de funo) | |