std::experimental::ranges:: search
| 
           Defined in header
            
            
             <experimental/ranges/algorithm>
            
            | ||
| 
           
            
             template
            
            
             <
            
            ForwardIterator I1, Sentinel
            
             <
            
            I1
            
             >
            
            S1,
             
             ForwardIterator I2, Sentinel
             
              <
             
             I2
             
              >
             
             S2,
             
              class
             
             Pred
             
              =
             
             
              
               ranges::
               
                equal_to
               
              
             
             
              <>
             
             ,
              | (1) | (ranges TS) | 
| 
           
            
             template
            
            
             <
            
            ForwardRange R1, ForwardRange R2,
            
             class
            
            Pred
            
             =
            
            
             
              ranges::
              
               equal_to
              
             
            
            
             <>
            
            ,
             
             
              class
             
             Proj1
             
              =
             
             
              
               ranges::
               
                identity
               
              
             
             ,
             
              class
             
             Proj2
             
              =
             
             
              
               ranges::
               
                identity
               
              
             
             
              >
             
              | (2) | (ranges TS) | 
         [
        
        
         
          first2
         
        
        
         ,
        
        
         
          last2
         
        
        
         )
        
       
       in the range
       
        
         [
        
        
         
          first1
         
        
        
         ,
        
        
         
          last1
         
        
        
         )
        
       
       . Elements are compared using
       
        
         pred
        
       
       after being projected with
       
        
         proj2
        
       
       and
       
        
         proj1
        
       
       , respectively.
      Notwithstanding the declarations depicted above, the actual number and order of template parameters for algorithm declarations is unspecified. Thus, if explicit template arguments are used when calling an algorithm, the program is probably non-portable.
Parameters
| first1, last1 | - | the range of elements to examine | 
| r1 | - | the range of elements to examine | 
| first2, last2 | - | the range of elements to search for | 
| r2 | - | the range of elements to search for | 
| pred | - | predicate to apply to the projected elements | 
| proj1 | - | projection to apply to the elements in the first range | 
| proj2 | - | projection to apply to the elements in the second range | 
Return value
       An iterator to the beginning of first occurrence of the sequence
       
        
         [
        
        
         
          first2
         
        
        
         ,
        
        
         
          last2
         
        
        
         )
        
       
       in the range
       
        
         [
        
        
         
          first1
         
        
        
         ,
        
        
         
          last1
         
        
        
         )
        
       
       . If
       
        
         [
        
        
         
          first2
         
        
        
         ,
        
        
         
          last2
         
        
        
         )
        
       
       is empty,
       
        
         first1
        
       
       is returned. If no such occurrence is found, an iterator that compares equal to
       
        
         last1
        
       
       is returned.
      
Complexity
       At most
       
        S * N
       
       applications of the predicate and each projection, where
       
        
         S
         
          =
         
         last2
         
          -
         
         first2
        
       
       and
       
        
         N
         
          =
         
         last1
         
          -
         
         first1
        
       
       .
      
Possible implementation
| template<ForwardIterator I1, Sentinel<I1> S1, ForwardIterator I2, Sentinel<I2> S2, class Pred = ranges::equal_to<>, class Proj1 = ranges::identity, class Proj2 = ranges::identity> requires IndirectlyComparable<I1, I2, Pred, Proj1, Proj2> I1 search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = Pred{}, Proj1 proj1 = Proj1{}, Proj2 proj2 = Proj2{}) { for (; ; ++first1) { I1 it = first1; for (I2 it2 = first2; ; (void)++it, (void)++it2) { if (it2 == last2) return first1; if (it == last1) return it; if (!ranges::invoke(pred, ranges::invoke(proj1, *it), ranges::invoke(proj2, *it2))) break; } } } | 
Example
| This section is incomplete Reason: no example | 
See also
| searches for the first occurrence of a range of elements (function template) | |
| finds the last sequence of elements in a certain range (function template) | |
| returns
         
          
           
            true
           
          
         
         if one set is a subset of another (function template) | |
| determines if two sets of elements are the same (function template) | |
| finds the first element satisfying specific criteria (function template) | |
| returns
         
          
           
            true
           
          
         
         if one range is lexicographically less than another (function template) | |
| finds the first position where two ranges differ (function template) | |
| searches for a number consecutive copies of an element in a range (function template) |