forked from OSchip/llvm-project
87 lines
3.1 KiB
C++
87 lines
3.1 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_MAKE_PROJECTED_H
|
|
#define _LIBCPP___ALGORITHM_MAKE_PROJECTED_H
|
|
|
|
#include <__concepts/same_as.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__type_traits/decay.h>
|
|
#include <__type_traits/is_member_pointer.h>
|
|
#include <__utility/forward.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 {
|
|
|
|
template <class _Pred, class _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr static
|
|
decltype(auto) __make_projected_pred(_Pred& __pred, _Proj& __proj) {
|
|
if constexpr (same_as<decay_t<_Proj>, identity> && !is_member_pointer_v<decay_t<_Pred>>) {
|
|
// Avoid creating the lambda and just use the pristine predicate -- for certain algorithms, this would enable
|
|
// optimizations that rely on the type of the predicate.
|
|
return __pred;
|
|
|
|
} else {
|
|
return [&](auto&& __x) {
|
|
return std::invoke(__pred, std::invoke(__proj, std::forward<decltype(__x)>(__x)));
|
|
};
|
|
}
|
|
}
|
|
|
|
template <class _Comp, class _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr static
|
|
decltype(auto) __make_projected_comp(_Comp& __comp, _Proj& __proj) {
|
|
if constexpr (same_as<decay_t<_Proj>, identity> && !is_member_pointer_v<decay_t<_Comp>>) {
|
|
// Avoid creating the lambda and just use the pristine comparator -- for certain algorithms, this would enable
|
|
// optimizations that rely on the type of the comparator.
|
|
return __comp;
|
|
|
|
} else {
|
|
return [&](auto&& __lhs, auto&& __rhs) {
|
|
return std::invoke(__comp,
|
|
std::invoke(__proj, std::forward<decltype(__lhs)>(__lhs)),
|
|
std::invoke(__proj, std::forward<decltype(__rhs)>(__rhs)));
|
|
};
|
|
}
|
|
}
|
|
|
|
template <class _Comp, class _Proj1, class _Proj2>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr static
|
|
decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) {
|
|
if constexpr (same_as<decay_t<_Proj1>, identity> && same_as<decay_t<_Proj2>, identity> &&
|
|
!is_member_pointer_v<decay_t<_Comp>>) {
|
|
// Avoid creating the lambda and just use the pristine comparator -- for certain algorithms, this would enable
|
|
// optimizations that rely on the type of the comparator.
|
|
return __comp;
|
|
|
|
} else {
|
|
return [&](auto&& __lhs, auto&& __rhs) {
|
|
return std::invoke(__comp,
|
|
std::invoke(__proj1, std::forward<decltype(__lhs)>(__lhs)),
|
|
std::invoke(__proj2, std::forward<decltype(__rhs)>(__rhs)));
|
|
};
|
|
}
|
|
}
|
|
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
#endif // _LIBCPP___ALGORITHM_MAKE_PROJECTED_H
|