|  | // -*- C++ -*- | 
|  | //===----------------------------------------------------------------------===// | 
|  | // | 
|  | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | 
|  | // See https://llvm.org/LICENSE.txt for license information. | 
|  | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | 
|  | // | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | #ifndef _LIBCPP___ALGORITHM_MISMATCH_H | 
|  | #define _LIBCPP___ALGORITHM_MISMATCH_H | 
|  |  | 
|  | #include <__algorithm/comp.h> | 
|  | #include <__config> | 
|  | #include <__iterator/iterator_traits.h> | 
|  | #include <__utility/pair.h> | 
|  |  | 
|  | #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) | 
|  | #  pragma GCC system_header | 
|  | #endif | 
|  |  | 
|  | _LIBCPP_BEGIN_NAMESPACE_STD | 
|  |  | 
|  | template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> | 
|  | _LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2> | 
|  | mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { | 
|  | for (; __first1 != __last1; ++__first1, (void)++__first2) | 
|  | if (!__pred(*__first1, *__first2)) | 
|  | break; | 
|  | return pair<_InputIterator1, _InputIterator2>(__first1, __first2); | 
|  | } | 
|  |  | 
|  | template <class _InputIterator1, class _InputIterator2> | 
|  | _LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2> | 
|  | mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { | 
|  | return std::mismatch(__first1, __last1, __first2, __equal_to()); | 
|  | } | 
|  |  | 
|  | #if _LIBCPP_STD_VER >= 14 | 
|  | template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> | 
|  | _LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2> | 
|  | mismatch(_InputIterator1 __first1, | 
|  | _InputIterator1 __last1, | 
|  | _InputIterator2 __first2, | 
|  | _InputIterator2 __last2, | 
|  | _BinaryPredicate __pred) { | 
|  | for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) | 
|  | if (!__pred(*__first1, *__first2)) | 
|  | break; | 
|  | return pair<_InputIterator1, _InputIterator2>(__first1, __first2); | 
|  | } | 
|  |  | 
|  | template <class _InputIterator1, class _InputIterator2> | 
|  | _LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2> | 
|  | mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { | 
|  | return std::mismatch(__first1, __last1, __first2, __last2, __equal_to()); | 
|  | } | 
|  | #endif | 
|  |  | 
|  | _LIBCPP_END_NAMESPACE_STD | 
|  |  | 
|  | #endif // _LIBCPP___ALGORITHM_MISMATCH_H |