forked from OSchip/llvm-project
76 lines
2.7 KiB
C++
76 lines
2.7 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_INCLUDES_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_INCLUDES_H
|
|
|
|
#include <__algorithm/make_projected.h>
|
|
#include <__algorithm/includes.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/move.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 __includes {
|
|
|
|
struct __fn {
|
|
|
|
template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1, input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
|
|
class _Proj1 = identity, class _Proj2 = identity,
|
|
indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::less>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
bool operator()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp __comp = {},
|
|
_Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
|
|
// TODO: implement
|
|
(void)__first1; (void)__last1; (void)__first2; (void)__last2; (void)__comp; (void)__proj1; (void)__proj2;
|
|
return {};
|
|
}
|
|
|
|
template <input_range _Range1, input_range _Range2, class _Proj1 = identity, class _Proj2 = identity,
|
|
indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>,
|
|
projected<iterator_t<_Range2>, _Proj2>> _Comp = ranges::less>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
bool operator()(_Range1&& __range1, _Range2&& __range2, _Comp __comp = {},
|
|
_Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
|
|
// TODO: implement
|
|
(void)__range1; (void)__range2; (void)__comp; (void)__proj1; (void)__proj2;
|
|
return {};
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace __includes
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto includes = __includes::__fn{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_INCLUDES_H
|