76 lines
		
	
	
		
			2.9 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			76 lines
		
	
	
		
			2.9 KiB
		
	
	
	
		
			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_RANGES_UPPER_BOUND_H
 | 
						|
#define _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
 | 
						|
 | 
						|
#include <__algorithm/iterator_operations.h>
 | 
						|
#include <__algorithm/lower_bound.h>
 | 
						|
#include <__config>
 | 
						|
#include <__functional/identity.h>
 | 
						|
#include <__functional/invoke.h>
 | 
						|
#include <__functional/ranges_operations.h>
 | 
						|
#include <__iterator/concepts.h>
 | 
						|
#include <__iterator/projected.h>
 | 
						|
#include <__ranges/access.h>
 | 
						|
#include <__ranges/concepts.h>
 | 
						|
#include <__ranges/dangling.h>
 | 
						|
 | 
						|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
 | 
						|
#  pragma GCC system_header
 | 
						|
#endif
 | 
						|
 | 
						|
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
 | 
						|
 | 
						|
_LIBCPP_BEGIN_NAMESPACE_STD
 | 
						|
 | 
						|
namespace ranges {
 | 
						|
namespace __upper_bound {
 | 
						|
struct __fn {
 | 
						|
  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity,
 | 
						|
            indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
 | 
						|
  _LIBCPP_HIDE_FROM_ABI constexpr
 | 
						|
  _Iter operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
 | 
						|
    auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) {
 | 
						|
      return !std::invoke(__comp, __rhs, __lhs);
 | 
						|
    };
 | 
						|
 | 
						|
    return std::__lower_bound_impl<_RangesIterOps>(__first, __last, __value, __comp_lhs_rhs_swapped, __proj);
 | 
						|
  }
 | 
						|
 | 
						|
  template <forward_range _Range, class _Type, class _Proj = identity,
 | 
						|
            indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
 | 
						|
  _LIBCPP_HIDE_FROM_ABI constexpr
 | 
						|
  borrowed_iterator_t<_Range> operator()(_Range&& __r,
 | 
						|
                                         const _Type& __value,
 | 
						|
                                         _Comp __comp = {},
 | 
						|
                                         _Proj __proj = {}) const {
 | 
						|
    auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) {
 | 
						|
      return !std::invoke(__comp, __rhs, __lhs);
 | 
						|
    };
 | 
						|
 | 
						|
    return std::__lower_bound_impl<_RangesIterOps>(ranges::begin(__r),
 | 
						|
                                                   ranges::end(__r),
 | 
						|
                                                   __value,
 | 
						|
                                                   __comp_lhs_rhs_swapped,
 | 
						|
                                                   __proj);
 | 
						|
  }
 | 
						|
};
 | 
						|
} // namespace __upper_bound
 | 
						|
 | 
						|
inline namespace __cpo {
 | 
						|
  inline constexpr auto upper_bound = __upper_bound::__fn{};
 | 
						|
} // namespace __cpo
 | 
						|
} // namespace ranges
 | 
						|
 | 
						|
_LIBCPP_END_NAMESPACE_STD
 | 
						|
 | 
						|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
 | 
						|
 | 
						|
#endif // _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
 |