iterators.hpp File Reference

#include <ostream>
#include <cmath>
#include <cstddef>
#include <cassert>
#include <iterator>
#include <functional>
#include <algorithm>
#include <type_traits>
#include <vector>

Include dependency graph for iterators.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	LIEF::ref_iterator< T, U, ITERATOR_T >
	Iterator which returns reference on container's values. More...
class	LIEF::filter_iterator< T, U, ITERATOR_T >
	Iterator which return a ref on container's values given predicates. More...
class	LIEF::iterator_range< IteratorT >

Namespaces
namespace	LIEF
	LIEF namespace.

Typedefs
template<class T >
using	LIEF::decay_t = typename std::decay<T>::type
template<class T >
using	LIEF::add_const_t = typename std::add_const<T>::type
template<class T >
using	LIEF::remove_const_t = typename std::remove_const<T>::type
template<class T >
using	LIEF::add_lvalue_reference_t = typename std::add_lvalue_reference<T>::type
template<class T , typename U = typename decay_t<T>::value_type, class CT = typename std::add_const<T>::type>
using	LIEF::const_ref_iterator = ref_iterator<CT, U, typename decay_t<CT>::const_iterator>
	Iterator which return const ref on container's values.
template<class T , typename U = typename decay_t<T>::value_type, class CT = typename std::add_const<T>::type>
using	LIEF::const_filter_iterator = filter_iterator<CT, U, typename decay_t<CT>::const_iterator>
	Iterator which return a const ref on container's values given predicates.

Functions
template<class T >
iterator_range< T >	LIEF::make_range (T x, T y)