|
Go to the documentation of this file.
9 #ifndef ADOBE_ALGORITHM_MISMATCH_HPP
10 #define ADOBE_ALGORITHM_MISMATCH_HPP
14 #include <boost/range/begin.hpp>
15 #include <boost/range/end.hpp>
16 #include <boost/bind.hpp>
21 #if ADOBE_HAS_CPLUS0X_CONCEPTS
23 namespace std { concept_map CopyConstructible<pair<const unsigned char*, const unsigned char*> > {}}
44 template < class InputRange1, class InputIterator2>
45 inline std::pair<typename boost::range_iterator<InputRange1>::type, InputIterator2>
46 mismatch(InputRange1& range1, InputIterator2 first2)
48 return std::mismatch(boost::begin(range1), boost::end(range1), first2);
57 template < class InputRange1, class InputIterator2>
58 inline std::pair<typename boost::range_const_iterator<InputRange1>::type, InputIterator2>
59 mismatch( const InputRange1& range1, InputIterator2 first2)
61 return std::mismatch(boost::begin(range1), boost::end(range1), first2);
69 template < class InputIterator1, class InputIterator2, class BinaryPredicate>
70 inline std::pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1,
72 InputIterator2 first2,
75 return std::mismatch(first1, last1, first2, boost::bind(pred, _1, _2));
83 template < class InputRange1, class InputIterator2, class BinaryPredicate>
84 inline std::pair<typename boost::range_iterator<InputRange1>::type, InputIterator2>
85 mismatch(InputRange1& range1, InputIterator2 first2, BinaryPredicate pred)
87 return adobe::mismatch(boost::begin(range1), boost::end(range1), first2, pred);
95 template < class InputRange1, class InputIterator2, class BinaryPredicate>
96 inline std::pair<typename boost::range_const_iterator<InputRange1>::type, InputIterator2>
97 mismatch( const InputRange1& range1, InputIterator2 first2, BinaryPredicate pred)
99 return adobe::mismatch(boost::begin(range1), boost::end(range1), first2, pred);
|