Espaços nominais
Variantes
    Ações

      std::search

      De cppreference.com
      See More

      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.

      Click here for the English version of this page

      <metanoindex/>

       
      C++
       
      Biblioteca algoritmo
      Funções
      Original:
      Functions
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Não modificar operações de seqüência
      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.
      Modificando operações de seqüência
      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.
      Particionamento operações
      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.
      Operações de classificação (em intervalos ordenados)
      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.
      Binários operações de busca (em intervalos ordenados)
      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.
      Definir operações (em intervalos ordenados)
      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.
      Operações de pilha
      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.
      Mínimo / máximo de operações
      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.
      Operações numéricas
      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.
      C biblioteca
      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.
       
      <tbody> </tbody>
      Definido no cabeçalho <algorithm>
      template< class ForwardIt1, class ForwardIt2 > ForwardIt1 search( ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last );
      		 (1)
      template< class ForwardIt1, class ForwardIt2, class BinaryPredicate > ForwardIt1 search( ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last, BinaryPredicate p );
      		 (2)
      Procura a subseqüência primeiro [s_first, s_last) elementos no [first, last - (s_last - s_first)) intervalo. A primeira versão utiliza operator== para comparar os elementos, a segunda versão usa o predicado binário dado p.
      Original:
      Searches for the first subsequence of elements [s_first, s_last) in the range [first, last - (s_last - s_first)). 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.

      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.
      The types Type1 and Type2 must be such that objects of types ForwardIt1 and ForwardIt2 can be dereferenced and then implicitly converted to Type1 and Type2 respectively.

      ​

      Type requirements
      -
      ForwardIt1, ForwardIt2 must meet the requirements of ForwardIterator.

      Valor de retorno

      Iterator para o início da primeira subsequência [s_first, s_last) no [first, last - (s_last - s_first)) gama. Se nenhuma subseqüência tal for encontrado, last é returned.
      Original:
      Iterator to the beginning of first subsequence [s_first, s_last) in the range [first, last - (s_last - s_first)). If no such subsequence 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.
      Se [s_first, s_last) está vazio, first é devolvido. (desde C++11)
      Original:
      If [s_first, s_last) is empty, first is returned. (desde C++11)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Complexidade

      Na maioria das comparações dos S*N onde S = std::distance(s_first, s_last) e N = std::distance(first, last).
      Original:
      At most S*N comparisons where S = std::distance(s_first, s_last) and N = std::distance(first, last).
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      Possível implementação

      First version 
      template<class ForwardIt1, class ForwardIt2>
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
                        ForwardIt2 s_first, ForwardIt2 s_last)
{
    for (; ; ++first) {
        ForwardIt1 it = first;
        for (ForwardIt2 s_it = s_first; ; ++it, ++s_it) {
            if (s_it == s_last) {
                return first;
            }
            if (it == last) {
                return last;
            }
            if (!(*it == *s_it)) {
                break;
            }
        }
    }
}
      Second version 
      template<class ForwardIt1, class ForwardIt2, class BinaryPredicate>
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
                        ForwardIt2 s_first, ForwardIt2 s_last, 
                        BinaryPredicate p)
{
    for (; ; ++first) {
        ForwardIt1 it = first;
        for (ForwardIt2 s_it = s_first; ; ++it, ++s_it) {
            if (s_it == s_last) {
                return first;
            }
            if (it == last) {
                return last;
            }
            if (!p(*it, *s_it)) {
                break;
            }
        }
    }
}

      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) [edit]
      determina se dois conjuntos de elementos são os mesmos
      Original:
      determines if two sets of elements are the same
      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) [edit]


      (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) [edit]
      retorna true se um intervalo é lexicograficamente menor do que outro
      Original:
      returns true if one range is lexicographically less than 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) [edit]
      encontra a primeira posição em que dois intervalos diferentes
      Original:
      finds the first position where two ranges differ
      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) [edit]
      Procura por um número de cópias consecutivos de um elemento em uma faixa
      Original:
      searches for a number consecutive copies of an element in a 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) [edit]