16#ifndef LIEF_ITERATORS_H
17#define LIEF_ITERATORS_H
50template<
class T,
bool = std::is_reference_v<T>>
58 container_{std::addressof(container)} {}
77 container_(std::move(container)) {}
90template<
class Ref,
class U,
class IT>
92 if constexpr (std::is_pointer_v<U>) {
93 assert(*it &&
"integrity error: nullptr");
94 return static_cast<Ref
>(**it);
96 return const_cast<Ref
>(*it);
100template<
class T,
class U,
class Category>
102 std::conditional_t<std::is_reference_v<T> || std::is_pointer_v<U>, Category,
103 std::input_iterator_tag>;
118template<class T, typename U = typename decay_t<T>::value_type,
121 template<
class,
typename,
class>
128 using value_type = std::remove_cv_t<std::remove_pointer_t<decay_t<U>>>;
142 container_{other.container_},
144 distance_{other.distance_} {
149 container_{std::move(other.container_)},
151 distance_{other.distance_} {
153 other.container_ = {};
169 template<
class T2,
typename U2,
class IT2,
170 typename = std::enable_if_t<
171 !std::is_same_v<ref_iterator, ref_iterator<T2, U2, IT2>> &&
175 distance_{other.distance_} {
176 if (
auto* container = other.container_.get(); container !=
nullptr) {
177 if constexpr (std::is_reference_v<T>) {
182 it_ = std::next(std::begin(*container_.get()), distance_);
190 container_{std::forward<
details::container_arg_t<T>>(container)},
191 it_(std::
begin(*container_.get())) {}
194 std::swap(container_, other.container_);
195 std::swap(it_, other.it_);
196 std::swap(distance_, other.distance_);
203 it_ = std::next(it_);
215 if (it_ != std::begin(*container_.get())) {
216 it_ = std::prev(it_);
232 std::advance(it_, movement);
233 distance_ += movement;
241 return (*
this) += -movement;
254 assert(n <
size() &&
"integrity error: out of bound");
272 return distance_ - rhs.distance_;
276 return (rhs - *
this) > 0;
286 return !(*
this < rhs);
291 return !(*
this > rhs);
295 if (container_.get() ==
nullptr) {
307 if (
auto* container = it.container_.get(); container !=
nullptr) {
308 it.it_ = std::end(*container);
325 if constexpr (std::is_reference_v<T>) {
326 return container_.get() == other.container_.get() &&
327 distance_ == other.distance_;
329 return size() == other.
size() && distance_ == other.distance_;
334 return !(*
this == other);
338 const auto* container = container_.get();
339 return container !=
nullptr ? container->size() : 0;
343 const auto* container = container_.get();
344 return container ==
nullptr || container->empty();
371 if constexpr (!std::is_reference_v<T>) {
372 it_ = std::next(std::begin(*container_.get()), distance_);
376 details::container_storage<T> container_;
383template<class T, typename U = typename decay_t<T>::value_type,
384 class CT = std::add_const_t<T>>
390template<class T, typename U = typename decay_t<T>::value_type,
398 using value_type = std::remove_cv_t<std::remove_pointer_t<decay_t<U>>>;
408 using filter_t = std::function<bool(
const typename DT::value_type&)>;
415 size_c_{other.size_c_},
416 size_cached_{other.size_cached_},
417 container_{other.container_},
419 filters_{other.filters_},
420 distance_{other.distance_} {
425 size_c_{other.size_c_},
426 size_cached_{other.size_cached_},
427 container_{std::move(other.container_)},
429 filters_{std::move(other.filters_)},
430 distance_{other.distance_} {
433 other.size_cached_ =
false;
434 other.container_ = {};
454 container_{std::forward<
details::container_arg_t<T>>(container)},
455 it_(std::
begin(*container_.get())),
457 filters_.push_back(std::move(filter));
459 if (it_ != std::end(*container_.get()) && !match()) {
466 const std::vector<filter_t>& filters) :
467 container_{std::forward<
details::container_arg_t<T>>(container)},
468 it_(std::
begin(*container_.get())),
470 if (it_ != std::end(*container_.get()) && !match()) {
477 container_{std::forward<
details::container_arg_t<T>>(container)},
478 it_(std::
begin(*container_.get())),
482 std::swap(container_, other.container_);
483 std::swap(it_, other.it_);
484 std::swap(filters_, other.filters_);
485 std::swap(size_c_, other.size_c_);
486 std::swap(size_cached_, other.size_cached_);
487 std::swap(distance_, other.distance_);
494 filters_.push_back(func);
496 size_cached_ =
false;
512 if (container_.get() ==
nullptr) {
515 return {*container_.get(), filters_};
523 if (container_.get() ==
nullptr) {
530 it_end.it_ = std::end(*it_end.container_.get());
563 assert(n <
size() &&
"integrity error: out of bound");
584 if (filters_.empty()) {
585 return container_size();
594 auto end_iter = it.
end();
595 for (; it != end_iter; ++it) {
605 if (filters_.empty()) {
606 return container_size() == 0;
618 if constexpr (std::is_reference_v<T>) {
619 return container_.get() == other.container_.get() &&
620 distance_ == other.distance_;
622 return container_size() == other.container_size() &&
623 distance_ == other.distance_;
628 return !(*
this == other);
632 size_t container_size()
const {
633 const auto* container = container_.get();
634 return container !=
nullptr ? container->size() : 0;
638 return std::all_of(std::begin(filters_), std::end(filters_),
639 [
this](
const filter_t& f) {
return f(*it_); });
643 if (it_ == std::end(*container_.get())) {
649 it_ = std::next(it_);
651 }
while (it_ != std::end(*container_.get()) && !match());
655 if constexpr (!std::is_reference_v<T>) {
656 it_ = std::next(std::begin(*container_.get()), distance_);
661 mutable size_t size_c_ = 0;
662 mutable bool size_cached_ =
false;
663 details::container_storage<T> container_;
665 std::vector<filter_t> filters_;
670template<class T, typename U = typename decay_t<T>::value_type,
671 class CT = std::add_const_t<T>>
679template<
typename IteratorT>
687 begin_(std::forward<T>(it_begin)),
688 end_(std::forward<T>(it_end)) {}
699 return begin_ == end_;
702 class ReferenceProxy {
708 it_(std::move(it)) {}
711 using reference =
decltype(*std::declval<const IteratorDecayTy&>());
717 template<
class It = IteratorDecayTy>
718 auto operator->() const -> decltype(&*std::declval<const It&>()) {
723 ReferenceProxy
at(
typename IteratorDecayTy::difference_type pos)
const {
724 static_assert(IsRandomAccess,
"at() needs random access iterator");
726 std::advance(it, pos);
727 return ReferenceProxy(std::move(it));
730 ReferenceProxy
operator[](
typename IteratorDecayTy::difference_type pos)
const {
735 return std::distance(begin_, end_);
739 static constexpr bool IsRandomAccess =
740 std::is_base_of_v<std::random_access_iterator_tag,
741 typename IteratorDecayTy::iterator_category>;
742 static constexpr bool IsBidirectional =
743 std::is_base_of_v<std::bidirectional_iterator_tag,
744 typename IteratorDecayTy::iterator_category>;
758#if LIEF_HAS_STD_RANGES
759template<
typename IteratorT>
761 std::ranges::enable_borrowed_range<LIEF::iterator_range<IteratorT>> =
true;
766template<
class T,
typename U,
class IT>
767inline constexpr bool std::ranges::enable_view<LIEF::ref_iterator<T, U, IT>> =
768 std::is_reference_v<T>;
770template<
class T,
typename U,
class IT>
771inline constexpr bool std::ranges::enable_view<LIEF::filter_iterator<T, U, IT>> =
772 std::is_reference_v<T>;
777template<
class T,
typename U,
class IT>
779 std::ranges::enable_borrowed_range<LIEF::ref_iterator<T, U, IT>> =
780 std::is_reference_v<T> || std::is_pointer_v<U>;
782template<
class T,
typename U,
class IT>
784 std::ranges::enable_borrowed_range<LIEF::filter_iterator<T, U, IT>> =
785 std::is_reference_v<T> || std::is_pointer_v<U>;
848template<
typename DerivedT,
typename IteratorCategoryT,
typename T,
849 typename DifferenceTypeT = std::ptrdiff_t,
typename PointerT =
T*,
850 typename ReferenceT =
T&>
851class iterator_facade_base {
853 iterator_facade_base() =
default;
863 static constexpr bool IsRandomAccess =
864 std::is_base_of_v<std::random_access_iterator_tag, IteratorCategoryT>;
865 static constexpr bool IsBidirectional =
866 std::is_base_of_v<std::bidirectional_iterator_tag, IteratorCategoryT>;
873 class ReferenceProxy {
874 friend iterator_facade_base;
882 operator ReferenceT()
const {
896 template<
typename RefT>
897 PointerProxy(RefT&& R) :
898 R(std::forward<RefT>(R)) {}
908 static_assert(std::is_base_of_v<iterator_facade_base, DerivedT>,
909 "Must pass the derived type to this template!");
910 static_assert(IsRandomAccess,
911 "The '+' operator is only defined for random access iterators.");
918 static_assert(IsRandomAccess,
919 "The '+' operator is only defined for random access iterators.");
924 static_assert(IsRandomAccess,
925 "The '-' operator is only defined for random access iterators.");
932 static_assert(std::is_base_of_v<iterator_facade_base, DerivedT>,
933 "Must pass the derived type to this template!");
934 return static_cast<DerivedT*
>(
this)->
operator+=(1);
946 "The decrement operator is only defined for bidirectional iterators."
948 return static_cast<DerivedT*
>(
this)->
operator-=(1);
954 "The decrement operator is only defined for bidirectional iterators."
961#ifndef __cpp_impl_three_way_comparison
963 return !(
static_cast<const DerivedT&
>(*this) == RHS);
970 "Relational operators are only defined for random access iterators."
972 return !(
static_cast<const DerivedT&
>(*this) < RHS) &&
973 !(
static_cast<const DerivedT&
>(*
this) == RHS);
979 "Relational operators are only defined for random access iterators."
981 return !(
static_cast<const DerivedT&
>(*this) > RHS);
987 "Relational operators are only defined for random access iterators."
989 return !(
static_cast<const DerivedT&
>(*this) < RHS);
993 return static_cast<const DerivedT*
>(
this)->
operator*();
997 static_assert(IsRandomAccess,
998 "Subscripting is only defined for random access iterators.");
999 return static_cast<const DerivedT*
>(
this)->
operator+(n);
1008template<
typename DerivedT,
typename WrappedIteratorT,
1009 typename IteratorCategoryT =
1010 typename std::iterator_traits<WrappedIteratorT>::iterator_category,
1011 typename T =
typename std::iterator_traits<WrappedIteratorT>::value_type,
1012 typename DifferenceTypeT =
1013 typename std::iterator_traits<WrappedIteratorT>::difference_type,
1014 typename PointerT = std::conditional_t<
1015 std::is_same_v<T, typename std::iterator_traits<WrappedIteratorT>::
1017 typename std::iterator_traits<WrappedIteratorT>::pointer, T*
1019 typename ReferenceT = std::conditional_t<
1020 std::is_same_v<T, typename std::iterator_traits<WrappedIteratorT>::
1022 typename std::iterator_traits<WrappedIteratorT>::reference, T&
1024class iterator_adaptor_base
1025 :
public iterator_facade_base<DerivedT, IteratorCategoryT, T, DifferenceTypeT,
1026 PointerT, ReferenceT> {
1027 using BaseT =
typename iterator_adaptor_base::iterator_facade_base;
1032 iterator_adaptor_base() =
default;
1034 explicit iterator_adaptor_base(WrappedIteratorT u) :
1036 static_assert(std::is_base_of_v<iterator_adaptor_base, DerivedT>,
1037 "Must pass the derived type to this template!");
1040 const WrappedIteratorT& wrapped()
const {
1049 BaseT::IsRandomAccess,
1050 "The '+=' operator is only defined for random access iterators."
1053 return *
static_cast<DerivedT*
>(
this);
1058 BaseT::IsRandomAccess,
1059 "The '-=' operator is only defined for random access iterators."
1062 return *
static_cast<DerivedT*
>(
this);
1064 using BaseT::operator-;
1066 static_assert(BaseT::IsRandomAccess,
1067 "The '-' operator is only defined for random access iterators.");
1073 using BaseT::operator++;
1076 return *
static_cast<DerivedT*
>(
this);
1078 using BaseT::operator--;
1081 BaseT::IsBidirectional,
1082 "The decrement operator is only defined for bidirectional iterators."
1085 return *
static_cast<DerivedT*
>(
this);
1089 const iterator_adaptor_base& RHS) {
1090 return LHS.I == RHS.I;
1094 const iterator_adaptor_base& RHS) {
1096 BaseT::IsRandomAccess,
1097 "Relational operators are only defined for random access iterators."
1099 return LHS.I < RHS.I;
1116template<
typename WrappedIteratorT,
1118 std::remove_reference_t<decltype(**std::declval<WrappedIteratorT>())>>
1120 : iterator_adaptor_base<
1125 template<
typename U>
1134template<
typename RangeT,
1135 typename WrappedIteratorT =
decltype(std::begin(std::declval<RangeT>()))>
1136iterator_range<pointee_iterator<WrappedIteratorT>>
1139 return make_range(PointeeIteratorT(std::begin(std::forward<RangeT>(Range))),
1140 PointeeIteratorT(std::end(std::forward<RangeT>(Range))));
1143template<
typename WrappedIteratorT,
1144 typename T =
decltype(&*std::declval<WrappedIteratorT>())>
1146 : public iterator_adaptor_base<
1159 return Ptr = &*this->I;
1163template<
typename RangeT,
1164 typename WrappedIteratorT =
decltype(std::begin(std::declval<RangeT>()))>
1165iterator_range<pointer_iterator<WrappedIteratorT>>
1168 return make_range(PointerIteratorT(std::begin(std::forward<RangeT>(Range))),
1169 PointerIteratorT(std::end(std::forward<RangeT>(Range))));
1172template<
typename WrappedIteratorT,
1174 std::remove_reference_t<decltype(**std::declval<WrappedIteratorT>())>,
1175 typename T2 = std::add_pointer_t<T1>>
container_t arg_t
Definition iterators.hpp:73
container_t * get() const
Definition iterators.hpp:79
container_storage()=default
std::remove_const_t< T > container_t
Definition iterators.hpp:72
container_storage(arg_t container)
Definition iterators.hpp:76
Storage of the container iterated by a ref_iterator or a filter_iterator.
Definition iterators.hpp:51
container_t * get() const
The container or a nullptr if the storage is default-constructed.
Definition iterators.hpp:61
T arg_t
Definition iterators.hpp:54
container_storage(arg_t container)
Definition iterators.hpp:57
container_storage()=default
std::remove_reference_t< T > container_t
Definition iterators.hpp:53
Iterator which returns a ref on container's values given predicates.
Definition iterators.hpp:392
std::enable_if_t<!std::is_const_v< pointer_t >, pointer_t > operator->()
Definition iterators.hpp:573
bool operator==(const filter_iterator &other) const
Definition iterators.hpp:617
add_const_t< ref_t > operator[](size_t n) const
Definition iterators.hpp:562
filter_iterator cend() const
Definition iterators.hpp:536
std::forward_iterator_tag iterator_category
Definition iterators.hpp:395
std::enable_if_t<!std::is_const_v< ref_t >, remove_const_t< ref_t > > operator*()
Definition iterators.hpp:544
filter_iterator & operator=(const filter_iterator &other)
Definition iterators.hpp:439
filter_iterator(details::container_arg_t< T > container, filter_t filter)
Definition iterators.hpp:453
add_const_t< ref_t > operator*() const
Definition iterators.hpp:550
void swap(filter_iterator &other) noexcept
Definition iterators.hpp:481
filter_iterator & operator++()
Definition iterators.hpp:500
filter_iterator(details::container_arg_t< T > container, const std::vector< filter_t > &filters)
Definition iterators.hpp:465
filter_iterator end() const
Definition iterators.hpp:522
typename filter_iterator::pointer pointer_t
Definition iterators.hpp:407
std::remove_pointer_t< Symbol * > * pointer
Definition iterators.hpp:400
typename filter_iterator::reference ref_t
Definition iterators.hpp:406
filter_iterator(const filter_iterator &other)
Definition iterators.hpp:414
bool is_end() const
Definition iterators.hpp:540
filter_iterator begin() const
Definition iterators.hpp:511
bool empty() const
Definition iterators.hpp:604
std::enable_if_t<!std::is_const_v< ref_t >, remove_const_t< ref_t > > operator[](size_t n)
Definition iterators.hpp:556
Symbol * DT_VAL
Definition iterators.hpp:404
ptrdiff_t difference_type
Definition iterators.hpp:399
~filter_iterator()=default
add_const_t< pointer_t > operator->() const
Definition iterators.hpp:579
std::remove_cv_t< std::remove_pointer_t< decay_t< Symbol * > > > value_type
Definition iterators.hpp:398
filter_iterator()=default
Create an iterator that is not associated with a container. It behaves as an empty range.
size_t size() const
Definition iterators.hpp:583
bool operator!=(const filter_iterator &other) const
Definition iterators.hpp:627
filter_iterator(details::container_arg_t< T > container)
Definition iterators.hpp:476
std::function< bool(const typename DT::value_type &)> filter_t
Definition iterators.hpp:408
std::remove_pointer_t< Symbol * > & reference
Definition iterators.hpp:401
details::iterator_concept_t< symbols_t &, Symbol *, std::forward_iterator_tag > iterator_concept
Definition iterators.hpp:396
filter_iterator(filter_iterator &&other) noexcept
Definition iterators.hpp:424
symbols_t & container_type
Definition iterators.hpp:403
filter_iterator operator++(int)
Definition iterators.hpp:505
decay_t< symbols_t & > DT
Definition iterators.hpp:405
filter_iterator cbegin() const
Definition iterators.hpp:518
filter_iterator & def(filter_t func)
Definition iterators.hpp:493
filter_iterator & operator=(filter_iterator &&other) noexcept
Definition iterators.hpp:445
DerivedT & operator++()
Definition iterators.hpp:1074
DerivedT & operator--()
Definition iterators.hpp:1079
DerivedT & operator-=(difference_type n)
Definition iterators.hpp:1056
ReferenceT operator*() const
Definition iterators.hpp:1102
friend bool operator<(const iterator_adaptor_base &LHS, const iterator_adaptor_base &RHS)
Definition iterators.hpp:1093
friend bool operator==(const iterator_adaptor_base &LHS, const iterator_adaptor_base &RHS)
Definition iterators.hpp:1088
DifferenceTypeT difference_type
Definition iterators.hpp:1045
DerivedT & operator+=(difference_type n)
Definition iterators.hpp:1047
difference_type operator-(const DerivedT &RHS) const
Definition iterators.hpp:1065
CRTP base class which implements the entire standard iterator facade in terms of a minimal subset of ...
Definition iterators.hpp:851
DifferenceTypeT difference_type
Definition iterators.hpp:858
PointerProxy operator->() const
Definition iterators.hpp:992
DerivedT & operator--()
Definition iterators.hpp:943
DerivedT operator++(int)
Definition iterators.hpp:937
T value_type
Definition iterators.hpp:857
friend DerivedT
Definition iterators.hpp:852
friend DerivedT operator+(DifferenceTypeT n, const DerivedT &i)
Definition iterators.hpp:917
bool operator>(const DerivedT &RHS) const
Definition iterators.hpp:967
ReferenceProxy operator[](DifferenceTypeT n) const
Definition iterators.hpp:996
ReferenceT reference
Definition iterators.hpp:860
bool operator>=(const DerivedT &RHS) const
Definition iterators.hpp:984
DerivedT operator-(DifferenceTypeT n) const
Definition iterators.hpp:923
DerivedT & operator++()
Definition iterators.hpp:931
PointerT pointer
Definition iterators.hpp:859
DerivedT operator--(int)
Definition iterators.hpp:951
IteratorCategoryT iterator_category
Definition iterators.hpp:856
DerivedT operator+(DifferenceTypeT n) const
Definition iterators.hpp:907
bool operator!=(const DerivedT &RHS) const
Definition iterators.hpp:962
bool operator<=(const DerivedT &RHS) const
Definition iterators.hpp:976
decltype(*std::declval< const IteratorDecayTy & >()) reference
Definition iterators.hpp:711
auto operator->() const -> decltype(&*std::declval< const It & >())
Definition iterators.hpp:718
friend iterator_range
Definition iterators.hpp:703
Definition iterators.hpp:680
IteratorT begin() const
Definition iterators.hpp:690
ReferenceProxy at(typename IteratorDecayTy::difference_type pos) const
Definition iterators.hpp:723
std::decay_t< assembly::Instruction::Iterator > IteratorDecayTy
Definition iterators.hpp:683
iterator_range(T &&it_begin, T &&it_end)
Definition iterators.hpp:686
IteratorT end() const
Definition iterators.hpp:694
bool empty() const
Definition iterators.hpp:698
ReferenceProxy operator[](typename IteratorDecayTy::difference_type pos) const
Definition iterators.hpp:730
assembly::Instruction::Iterator IteratorTy
Definition iterators.hpp:682
std::ptrdiff_t size() const
Definition iterators.hpp:734
Definition iterators.hpp:1149
pointer_iterator()=default
T & operator*() const
Definition iterators.hpp:1158
pointer_iterator(WrappedIteratorT u)
Definition iterators.hpp:1155
Iterator which returns reference on container's values.
Definition iterators.hpp:120
bool operator<=(const ref_iterator &rhs) const
Definition iterators.hpp:290
ref_iterator & operator--()
Definition iterators.hpp:214
add_const_t< ref_t > operator*() const
Definition iterators.hpp:353
size_t size() const
Definition iterators.hpp:337
ref_iterator & operator++()
Definition iterators.hpp:202
void swap(ref_iterator &other) noexcept
Definition iterators.hpp:193
bool operator<(const ref_iterator &rhs) const
Definition iterators.hpp:275
ref_iterator operator-(typename ref_iterator::difference_type n) const
Definition iterators.hpp:265
ref_iterator operator++(int)
Definition iterators.hpp:208
ref_iterator begin() const
Definition iterators.hpp:294
sections_t container_type
Definition iterators.hpp:133
typename ref_iterator::reference ref_t
Definition iterators.hpp:136
ref_iterator operator--(int)
Definition iterators.hpp:222
ref_iterator cend() const
Definition iterators.hpp:314
ref_iterator(const ref_iterator &other)
Definition iterators.hpp:141
ref_iterator & operator+=(const typename ref_iterator::difference_type &movement)
Definition iterators.hpp:229
std::enable_if_t<!std::is_const_v< ref_t >, remove_const_t< ref_t > > operator[](size_t n)
Definition iterators.hpp:246
std::remove_pointer_t< typename decay_t< sections_t >::value_type > & reference
Definition iterators.hpp:131
std::bidirectional_iterator_tag iterator_category
Definition iterators.hpp:125
std::enable_if_t<!std::is_const_v< ref_t >, remove_const_t< ref_t > > operator*()
Definition iterators.hpp:347
ref_iterator(ref_iterator &&other) noexcept
Definition iterators.hpp:148
ptrdiff_t difference_type
Definition iterators.hpp:129
ref_iterator(details::container_arg_t< T > container)
Definition iterators.hpp:189
ref_iterator operator+(typename ref_iterator::difference_type n) const
Definition iterators.hpp:259
ref_iterator cbegin() const
Definition iterators.hpp:301
bool empty() const
Definition iterators.hpp:342
std::remove_cv_t< std::remove_pointer_t< decay_t< typename decay_t< sections_t >::value_type > > > value_type
Definition iterators.hpp:128
ref_iterator & operator=(ref_iterator &&other) noexcept
Definition iterators.hpp:164
bool operator!=(const ref_iterator &other) const
Definition iterators.hpp:333
bool operator>(const ref_iterator &rhs) const
Definition iterators.hpp:280
bool operator>=(const ref_iterator &rhs) const
Definition iterators.hpp:285
ref_iterator end() const
Definition iterators.hpp:305
ref_iterator & operator-=(const typename ref_iterator::difference_type &movement)
Definition iterators.hpp:238
ref_iterator(const ref_iterator< T2, U2, IT2 > &other)
Definition iterators.hpp:174
add_const_t< ref_t > operator[](size_t n) const
Definition iterators.hpp:253
std::remove_pointer_t< typename decay_t< sections_t >::value_type > * pointer
Definition iterators.hpp:130
std::enable_if_t<!std::is_const_v< pointer_t >, pointer_t > operator->()
Definition iterators.hpp:357
ref_iterator::difference_type operator-(const ref_iterator &rhs) const
Definition iterators.hpp:271
typename decay_t< sections_t >::value_type DT_VAL
Definition iterators.hpp:134
typename ref_iterator::pointer pointer_t
Definition iterators.hpp:137
details::iterator_concept_t< sections_t, typename decay_t< sections_t >::value_type, std::bidirectional_iterator_tag > iterator_concept
Definition iterators.hpp:126
friend class ref_iterator
Definition iterators.hpp:122
bool is_end() const
Definition iterators.hpp:318
add_const_t< pointer_t > operator->() const
Definition iterators.hpp:363
ref_iterator & operator=(const ref_iterator &other)
Definition iterators.hpp:158
bool operator==(const ref_iterator &other) const
Definition iterators.hpp:322
decay_t< sections_t > DT
Definition iterators.hpp:135
#define LIEF_LIFETIMEBOUND
Definition compiler_attributes.hpp:72
@ T
Definition AcceleratorCodes.hpp:96
Definition Abstract/DebugInfo.hpp:27
Ref deref(const IT &it)
Definition iterators.hpp:91
typename container_storage< T >::arg_t container_arg_t
Definition iterators.hpp:88
std::conditional_t< std::is_reference_v< T >||std::is_pointer_v< U >, Category, std::input_iterator_tag > iterator_concept_t
Definition iterators.hpp:101
LIEF namespace.
Definition Abstract/Binary.hpp:41
filter_iterator< CT, U, typename decay_t< CT >::const_iterator > const_filter_iterator
Iterator which returns a const ref on container's values given predicates.
Definition iterators.hpp:672
iterator_range< pointee_iterator< WrappedIteratorT > > make_pointee_range(RangeT &&Range)
Definition iterators.hpp:1137
iterator_range< T > make_range(T &&x, T &&y)
Definition iterators.hpp:752
iterator_range< pointer_iterator< WrappedIteratorT > > make_pointer_range(RangeT &&Range)
Definition iterators.hpp:1166
std::remove_const_t< T > remove_const_t
Definition iterators.hpp:38
ref_iterator< CT, U, typename decay_t< CT >::const_iterator > const_ref_iterator
Iterator which returns a const ref on container's values.
Definition iterators.hpp:385
pointer_iterator< pointee_iterator< WrappedIteratorT, T1 >, T2 > raw_pointer_iterator
Definition iterators.hpp:1176
std::decay_t< T > decay_t
Definition iterators.hpp:32
std::add_const_t< T > add_const_t
Definition iterators.hpp:35
std::add_lvalue_reference_t< T > add_lvalue_reference_t
Definition iterators.hpp:41
An iterator type that allows iterating over the pointees via some other iterator.
Definition iterators.hpp:1123
pointee_iterator()=default
T & operator*() const
Definition iterators.hpp:1129
pointee_iterator(U &&u)
Definition iterators.hpp:1126