std::search_n
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 ForwardIt, class Size, class T > ForwardIt1 search_n( ForwardIt first, ForwardIt last, Size count, const T& value ); |
(1) | |
template< class ForwardIt, class Size, class T, class BinaryPredicate > ForwardIt1 search_n( ForwardIt first, ForwardIt last, Size count, const T& value, BinaryPredicate p ); |
(2) | |
Pesquisas do
[first, last) intervalo para a primeira seqüência de contagem de elementos idênticos, cada um igual ao valor dado valor. A primeira versão utiliza operator== para comparar os elementos, a segunda versão usa o predicado binário dado p.Original:
Searches the range
[first, last) for the first sequence of count identical elements, each equal to the given value value. 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.
You can help to correct and verify the translation. Click here for instructions.
Parâmetros
| first, last | - | a gama de elementos para examinar
Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| count | - | o comprimento da sequência a ser pesquisada
Original: the length of the sequence to search for The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| value | - | o valor dos elementos para pesquisar
Original: the value of the elements to search for 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:
The signature does not need to have |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator.
| ||
Valor de retorno
IIterator para o início da sequência encontrada no
[first, last) gama. Se nenhuma seqüência for encontrado, é retornado last.Original:
Iiterator to the beginning of the found sequence in the range
[first, last). If no such sequence is found, last is returned.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 aplicações de
last - first do predicado.Original:
At most
last - first applications of the predicate.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 ForwardIt, class Size, class T>
ForwardIt1 search_n(ForwardIt first, ForwardIt last,
Size count, const T& value)
{
Size curr_count = 0;
ForwardIt result, t_last = first;
std::advance(t_last, std::distance(first, last) - count + 1);
for (; first != t_last; first++) {
curr_count = 0;
result = first;
while (*first == value) {
curr_count++;
if (curr_count == count) {
return result;
}
++first;
}
}
return last;
}
|
| Second version |
template<class ForwardIt, class Size, class T, class BinaryPredicate>
ForwardIt1 search_n(ForwardIt first, ForwardIt last,
Size count, const T& value, BinaryPredicate p)
{
Size curr_count = 0;
ForwardIt result, t_last = first;
std::advance(t_last, std::distance(first, last) - count + 1);
for (; first != t_last; first++) {
curr_count = 0;
result = first;
while (p(*first == value)) {
curr_count++;
if (curr_count == count) {
return result;
}
++first;
}
}
return last;
}
|
Exemplo
| Esta seção está incompleta |
Veja também
encontra a última sequência de elementos em um determinado intervalo Original: finds the last sequence of elements in a certain range 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) | |
(C++11) |
encontra o primeiro elemento satisfazer critérios específicos Original: finds the first element satisfying specific criteria 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) |
| searches for a range of elements (modelo de função) | |
