6024e5c395
clang 20.0.0 (based on r547379) from build 12806354. Bug: http://b/379133546 Test: N/A Change-Id: I2eb8938af55d809de674be63cb30cf27e801862b Upstream-Commit: ad834e67b1105d15ef907f6255d4c96e8e733f57
87 lines
2.9 KiB
C++
87 lines
2.9 KiB
C++
//===- iterator_range.h - A range adaptor for iterators ---------*- 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
/// \file
|
|
/// This provides a very simple, boring adaptor for a begin and end iterator
|
|
/// into a range type. This should be used to build range views that work well
|
|
/// with range based for loops and range based constructors.
|
|
///
|
|
/// Note that code here follows more standards-based coding conventions as it
|
|
/// is mirroring proposed interfaces for standardization.
|
|
///
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ADT_ITERATOR_RANGE_H
|
|
#define LLVM_ADT_ITERATOR_RANGE_H
|
|
|
|
#include "llvm/ADT/ADL.h"
|
|
#include <type_traits>
|
|
#include <utility>
|
|
|
|
namespace llvm {
|
|
|
|
template <typename From, typename To, typename = void>
|
|
struct explicitly_convertible : std::false_type {};
|
|
|
|
template <typename From, typename To>
|
|
struct explicitly_convertible<
|
|
From, To,
|
|
std::void_t<decltype(static_cast<To>(
|
|
std::declval<std::add_rvalue_reference_t<From>>()))>> : std::true_type {
|
|
};
|
|
|
|
/// A range adaptor for a pair of iterators.
|
|
///
|
|
/// This just wraps two iterators into a range-compatible interface. Nothing
|
|
/// fancy at all.
|
|
template <typename IteratorT>
|
|
class iterator_range {
|
|
IteratorT begin_iterator, end_iterator;
|
|
|
|
public:
|
|
#if __GNUC__ == 7 || (__GNUC__ == 8 && __GNUC_MINOR__ < 4)
|
|
// Be careful no to break gcc-7 and gcc-8 < 8.4 on the mlir target.
|
|
// See https://github.com/llvm/llvm-project/issues/63843
|
|
template <typename Container>
|
|
#else
|
|
template <
|
|
typename Container,
|
|
std::enable_if_t<explicitly_convertible<
|
|
llvm::detail::IterOfRange<Container>, IteratorT>::value> * = nullptr>
|
|
#endif
|
|
iterator_range(Container &&c)
|
|
: begin_iterator(adl_begin(c)), end_iterator(adl_end(c)) {
|
|
}
|
|
iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
|
|
: begin_iterator(std::move(begin_iterator)),
|
|
end_iterator(std::move(end_iterator)) {}
|
|
|
|
IteratorT begin() const { return begin_iterator; }
|
|
IteratorT end() const { return end_iterator; }
|
|
bool empty() const { return begin_iterator == end_iterator; }
|
|
};
|
|
|
|
template <typename Container>
|
|
iterator_range(Container &&)
|
|
-> iterator_range<llvm::detail::IterOfRange<Container>>;
|
|
|
|
/// Convenience function for iterating over sub-ranges.
|
|
///
|
|
/// This provides a bit of syntactic sugar to make using sub-ranges
|
|
/// in for loops a bit easier. Analogous to std::make_pair().
|
|
template <class T> iterator_range<T> make_range(T x, T y) {
|
|
return iterator_range<T>(std::move(x), std::move(y));
|
|
}
|
|
|
|
template <typename T> iterator_range<T> make_range(std::pair<T, T> p) {
|
|
return iterator_range<T>(std::move(p.first), std::move(p.second));
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|