std::find_first_of
 | 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. |
Definido no cabeçalho <algorithm> | ||
template<class ForwardIt1, class ForwardIt2 > ForwardIt1 find_first_of( ForwardIt1 first, ForwardIt1 last, | (1) | (até C++11) (desde C++11) |
template<class ForwardIt1, class ForwardIt2, class BinaryPredicate > ForwardIt1 find_first_of( ForwardIt1 first, ForwardIt1 last, | (2) | (até C++11) (desde C++11) |
[first, last) gama para qualquer um dos elementos na [s_first, s_last) gama. A primeira versão utiliza operator== para comparar os elementos, a segunda versão usa o predicado binário dado p. [first, last) for any of the elements in the range [s_first, s_last). The first version uses operator== to compare the elements, the second version uses the given binary predicate p. You can help to correct and verify the translation. Click here for instructions.
Índice |
[editar]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. |
| s_first, s_last | - | a gama de elementos para pesquisar Original: the range of 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: 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. |
| Type requirements | ||
-InputIt must meet the requirements of InputIterator. | ||
-ForwardIt1 must meet the requirements of ForwardIterator. | ||
-ForwardIt2 must meet the requirements of ForwardIterator. | ||
[editar]Valor de retorno
[first, last) intervalo que é igual a um elemento da [s_first; s_last) gama. Se nenhum elemento for encontrado, é retornado last.[first, last) that is equal to an element from the range [s_first; s_last). If no such element is found, last is returned.You can help to correct and verify the translation. Click here for instructions.
[editar]Complexidade
(S*N) onde S = distance(s_first, s_last) e N = distance(first, last).(S*N) comparisons where S = distance(s_first, s_last) and N = distance(first, last).You can help to correct and verify the translation. Click here for instructions.
[editar]Possível implementação
| First version |
|---|
template<class InputIt, class ForwardIt> InputIt find_first_of(InputIt first, InputIt last, ForwardIt s_first, ForwardIt s_last){for(; first != last;++first){for(ForwardIt it = s_first; it != s_last;++it){if(*first ==*it){return first;}}}return last;} |
| Second version |
template<class InputIt, class ForwardIt, class BinaryPredicate> InputIt find_first_of(InputIt first, InputIt last, ForwardIt s_first, ForwardIt s_last, BinaryPredicate p){for(; first != last;++first){for(ForwardIt it = s_first; it != s_last;++it){if(p(*first, *it)){return first;}}}return last;} |
[editar]Exemplo
You can help to correct and verify the translation. Click here for instructions.
#include <algorithm>#include <iostream>#include <vector> int main(){std::vector<int> v{0, 2, 3, 25, 5};std::vector<int> t{3, 19, 10, 2}; auto result = std::find_first_of(v.begin(), v.end(), t.begin(), t.end()); if(result == v.end()){std::cout<<"no elements of v were equal to 3, 19, 10 or 2\n";}else{std::cout<<"found a match at "<<std::distance(v.begin(), result)<<"\n";}}
Saída:
found a match at 1
[editar]Veja também
(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) |
