Sprout/sprout/range/algorithm/mismatch.hpp

46 lines
1.5 KiB
C++
Raw Normal View History

2012-04-04 08:48:02 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_MISMATCH_HPP
#define SPROUT_RANGE_ALGORITHM_MISMATCH_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
2012-10-05 15:58:56 +00:00
#include <sprout/utility/forward.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/utility/pair/pair.hpp>
2012-12-22 11:10:27 +00:00
#include <sprout/range/type_traits/lvalue_iterator.hpp>
2012-04-04 08:48:02 +00:00
#include <sprout/algorithm/mismatch.hpp>
namespace sprout {
namespace range {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.2.10 Mismatch
template<typename Range1, typename Range2>
inline SPROUT_CONSTEXPR sprout::pair<
2012-04-05 05:54:23 +00:00
typename sprout::range::lvalue_iterator<Range1>::type,
typename sprout::range::lvalue_iterator<Range2>::type
2012-04-04 08:48:02 +00:00
>
mismatch(Range1&& range1, Range2&& range2) {
return sprout::mismatch(
sprout::begin(sprout::forward<Range1>(range1)),
sprout::end(sprout::forward<Range1>(range1)),
sprout::begin(sprout::forward<Range2>(range2))
);
}
template<typename Range1, typename Range2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR sprout::pair<
2012-04-05 05:54:23 +00:00
typename sprout::range::lvalue_iterator<Range1>::type,
typename sprout::range::lvalue_iterator<Range2>::type
2012-04-04 08:48:02 +00:00
>
mismatch(Range1&& range1, Range2&& range2, BinaryPredicate pred) {
return sprout::mismatch(
sprout::begin(sprout::forward<Range1>(range1)),
sprout::end(sprout::forward<Range1>(range1)),
sprout::begin(sprout::forward<Range2>(range2)),
pred
);
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_MISMATCH_HPP