26template <
typename RangeT>
28 ->
decltype(begin(std::forward<RangeT>(range))) {
29 return begin(std::forward<RangeT>(range));
34template <
typename RangeT>
36 ->
decltype(end(std::forward<RangeT>(range))) {
37 return end(std::forward<RangeT>(range));
42template <
typename RangeT>
44 ->
decltype(rbegin(std::forward<RangeT>(range))) {
45 return rbegin(std::forward<RangeT>(range));
50template <
typename RangeT>
52 ->
decltype(rend(std::forward<RangeT>(range))) {
53 return rend(std::forward<RangeT>(range));
60 T &&rhs)
noexcept(
noexcept(swap(std::declval<T>(),
61 std::declval<T>()))) {
62 swap(std::forward<T>(lhs), std::forward<T>(rhs));
67template <
typename RangeT>
69 ->
decltype(
size(std::forward<RangeT>(range))) {
70 return size(std::forward<RangeT>(range));
77template <
typename RangeT>
85template <
typename RangeT>
93template <
typename RangeT>
101template <
typename RangeT>
117template <
typename RangeT>
125template <
typename RangeT>
128template <
typename RangeT>
130 std::remove_reference_t<decltype(*adl_begin(std::declval<RangeT &>()))>;
constexpr auto size_impl(RangeT &&range) -> decltype(size(std::forward< RangeT >(range)))
constexpr auto end_impl(RangeT &&range) -> decltype(end(std::forward< RangeT >(range)))
constexpr void swap_impl(T &&lhs, T &&rhs) noexcept(noexcept(swap(std::declval< T >(), std::declval< T >())))
constexpr auto rend_impl(RangeT &&range) -> decltype(rend(std::forward< RangeT >(range)))
constexpr auto rbegin_impl(RangeT &&range) -> decltype(rbegin(std::forward< RangeT >(range)))
constexpr auto begin_impl(RangeT &&range) -> decltype(begin(std::forward< RangeT >(range)))
decltype(adl_begin(std::declval< RangeT & >())) IterOfRange
std::remove_reference_t< decltype(*adl_begin(std::declval< RangeT & >()))> ValueOfRange
This is an optimization pass for GlobalISel generic memory operations.
auto size(R &&Range, std::enable_if_t< std::is_base_of< std::random_access_iterator_tag, typename std::iterator_traits< decltype(Range.begin())>::iterator_category >::value, void > *=nullptr)
Get the size of a range.
constexpr auto adl_begin(RangeT &&range) -> decltype(adl_detail::begin_impl(std::forward< RangeT >(range)))
Returns the begin iterator to range using std::begin and function found through Argument-Dependent Lo...
constexpr auto adl_end(RangeT &&range) -> decltype(adl_detail::end_impl(std::forward< RangeT >(range)))
Returns the end iterator to range using std::end and functions found through Argument-Dependent Looku...
constexpr auto adl_rbegin(RangeT &&range) -> decltype(adl_detail::rbegin_impl(std::forward< RangeT >(range)))
Returns the reverse-begin iterator to range using std::rbegin and function found through Argument-Dep...
constexpr auto adl_size(RangeT &&range) -> decltype(adl_detail::size_impl(std::forward< RangeT >(range)))
Returns the size of range using std::size and functions found through Argument-Dependent Lookup (ADL)...
constexpr auto adl_rend(RangeT &&range) -> decltype(adl_detail::rend_impl(std::forward< RangeT >(range)))
Returns the reverse-end iterator to range using std::rend and functions found through Argument-Depend...
constexpr void adl_swap(T &&lhs, T &&rhs) noexcept(noexcept(adl_detail::swap_impl(std::declval< T >(), std::declval< T >())))
Swaps lhs with rhs using std::swap and functions found through Argument-Dependent Lookup (ADL).
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.