16 #ifndef LLVM_ADT_SEQ_H
17 #define LLVM_ADT_SEQ_H
25 template <
typename ValueT>
28 std::random_access_iterator_tag,
30 typedef typename value_sequence_iterator::iterator_facade_base BaseT;
43 template <
typename U,
typename Enabler = decltype(ValueT(std::declval<U>()))>
54 using BaseT::operator-;
56 return Value - RHS.Value;
60 return Value == RHS.Value;
63 return Value < RHS.Value;
70 template <
typename ValueT>
bool operator<(const value_sequence_iterator &RHS) const
BaseT::difference_type difference_type
This provides a very simple, boring adaptor for a begin and end iterator into a range type...
value_sequence_iterator(value_sequence_iterator &&Arg)
value_sequence_iterator()=default
CRTP base class which implements the entire standard iterator facade in terms of a minimal subset of ...
reference operator*() const
difference_type operator-(const value_sequence_iterator &RHS) const
value_sequence_iterator(U &&Value)
value_sequence_iterator & operator-=(difference_type N)
static const unsigned End
value_sequence_iterator & operator+=(difference_type N)
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
iterator_range< detail::value_sequence_iterator< ValueT > > seq(ValueT Begin, ValueT End)
A range adaptor for a pair of iterators.
bool operator==(const value_sequence_iterator &RHS) const
LLVM Value Representation.
BaseT::reference reference