Range-v3
Range algorithms, views, and actions for the Standard Library
mismatch.hpp File Reference

Typedefs

template<typename I1 , typename I2 >
using ranges::mismatch_result = detail::in1_in2_result< I1, I2 >
 

Functions

template<typename Rng1 , typename I2Ref , typename C = equal_to, typename P1 = identity, typename P2 = identity>
requires input_range< Rng1 > &&input_iterator< uncvref_t< I2Ref > > &&indirect_relation< C, projected< iterator_t< Rng1 >, P1 >, projected< uncvref_t< I2Ref >, P2 > > ranges::__attribute__ ((deprecated("Use the variant of ranges::mismatch that takes an upper bound for " "both sequences"))) mismatch_result< borrowed_iterator_t< Rng1 >
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
template<typename I1 , typename S1 , typename I2 , typename C = equal_to, typename P1 = identity, typename P2 = identity>
requires input_iterator< I1 > &&sentinel_for< S1, I1 > &&input_iterator< I2 > &&indirect_relation< C, projected< I1, P1 >, projected< I2, P2 > > ranges::__attribute__ ((deprecated("Use the variant of ranges::mismatch that takes an upper bound for " "both sequences"))) mismatch_result< I1
 function template mismatch
 
requires input_iterator< I1 > &&sentinel_for< S1, I1 > &&input_iterator< I2 > &&indirect_relation< C, projected< I1, P1 >, projected< I2, P2 > > I2 ranges::mismatch (I1 begin1, S1 end1, I2 begin2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
 
template<typename I1 , typename S1 , typename I2 , typename S2 , typename C = equal_to, typename P1 = identity, typename P2 = identity>
requires input_iterator< I1 > &&sentinel_for< S1, I1 > &&input_iterator< I2 > &&sentinel_for< S2, I2 > &&indirect_relation< C, projected< I1, P1 >, projected< I2, P2 > > mismatch_result< I1, I2 > ranges::mismatch (I1 begin1, S1 end1, I2 begin2, S2 end2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
requires input_range< Rng1 > &&input_iterator< uncvref_t< I2Ref > > &&indirect_relation< C, projected< iterator_t< Rng1 >, P1 >, projected< uncvref_t< I2Ref >, P2 > > uncvref_t< I2Ref > ranges::mismatch (Rng1 &&rng1, I2Ref &&begin2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
 
template<typename Rng1 , typename Rng2 , typename C = equal_to, typename P1 = identity, typename P2 = identity>
requires input_range< Rng1 > &&input_range< Rng2 > &&indirect_relation< C, projected< iterator_t< Rng1 >, P1 >, projected< iterator_t< Rng2 >, P2 > > mismatch_result< borrowed_iterator_t< Rng1 >, borrowed_iterator_t< Rng2 > > ranges::mismatch (Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.