#ifndef LLVM_ADT_SMALLVECTOR_H
#define LLVM_ADT_SMALLVECTOR_H
+#include "llvm/ADT/iterator_range.h"
#include "llvm/Support/AlignOf.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/MathExtras.h"
this->append(S, E);
}
+ template <typename RangeTy>
+ explicit SmallVector(const llvm::iterator_range<RangeTy> R)
+ : SmallVectorImpl<T>(N) {
+ this->append(R.begin(), R.end());
+ }
+
SmallVector(const SmallVector &RHS) : SmallVectorImpl<T>(N) {
if (!RHS.empty())
SmallVectorImpl<T>::operator=(RHS);
#ifndef LLVM_ADT_ITERATOR_RANGE_H
#define LLVM_ADT_ITERATOR_RANGE_H
-#include <algorithm>
-#include <iterator>
#include <utility>
namespace llvm {
-template <typename Range>
-struct range_traits {
- typedef typename Range::difference_type difference_type;
-};
-
/// \brief A range adaptor for a pair of iterators.
///
/// This just wraps two iterators into a range-compatible interface. Nothing
IteratorT begin_iterator, end_iterator;
public:
- // FIXME: We should be using iterator_traits to determine the
- // difference_type, but most of our iterators do not expose anything like it.
- typedef int difference_type;
-
iterator_range() {}
iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
: begin_iterator(std::move(begin_iterator)),
IteratorT begin() const { return begin_iterator; }
IteratorT end() const { return end_iterator; }
};
-
-/// \brief Determine the distance between the end() and begin() iterators of
-/// a range. Analogous to std::distance().
-template <class Range>
-typename range_traits<Range>::difference_type distance(Range R) {
- return std::distance(R.begin(), R.end());
-}
-
-/// \brief Copies members of a range into the output iterator provided.
-/// Analogous to std::copy.
-template <class Range, class OutputIterator>
-OutputIterator copy(Range In, OutputIterator Result) {
- return std::copy(In.begin(), In.end(), Result);
-}
}
#endif