mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-04-13 11:51:17 +00:00
7ed7d4ccb8
This is a fairly mechanical change, it just moves each algorithm into its own header. This is a NFC. Note: during this change, I burned down all the includes, so this follows "include only and exactly what you use." Differential Revision: https://reviews.llvm.org/D103583
98 lines
3.2 KiB
C++
98 lines
3.2 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_COMP_H
|
|
#define _LIBCPP___ALGORITHM_COMP_H
|
|
|
|
#include <__config>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
// I'd like to replace these with _VSTD::equal_to<void>, but can't because:
|
|
// * That only works with C++14 and later, and
|
|
// * We haven't included <functional> here.
|
|
template <class _T1, class _T2 = _T1>
|
|
struct __equal_to
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;}
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;}
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __equal_to<_T1, _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __equal_to<const _T1, _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __equal_to<_T1, const _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
|
|
};
|
|
|
|
template <class _T1, class _T2 = _T1>
|
|
struct __less
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __less<_T1, _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __less<const _T1, _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
|
|
};
|
|
|
|
template <class _T1>
|
|
struct __less<_T1, const _T1>
|
|
{
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
|
|
};
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_COMP_H
|