#include <intrusive_list.h>
Public Types | |
using | value_type = typename AZStd::iterator_traits< Iter >::value_type |
using | difference_type = typename AZStd::iterator_traits< Iter >::difference_type |
using | pointer = typename AZStd::iterator_traits< Iter >::pointer |
using | reference = typename AZStd::iterator_traits< Iter >::reference |
using | iterator_category = typename AZStd::iterator_traits< Iter >::iterator_category |
using | iterator_type = Iter |
Public Member Functions | |
AZ_FORCE_INLINE | reverse_iterator_impl (node_ptr_type node) |
iterator_type | base () const |
AZ_FORCE_INLINE reference | operator* () const |
AZ_FORCE_INLINE pointer | operator-> () const |
AZ_FORCE_INLINE this_type & | operator++ () |
AZ_FORCE_INLINE this_type | operator++ (int) |
AZ_FORCE_INLINE this_type & | operator-- () |
AZ_FORCE_INLINE this_type | operator-- (int) |
AZ_FORCE_INLINE bool | operator== (const this_type &rhs) const |
AZ_FORCE_INLINE bool | operator!= (const this_type &rhs) const |
Protected Attributes | |
node_ptr_type | m_node |
Friends | |
class | intrusive_list |
Constant reverse iterator implementation. Intrusive list uses bidirectional iterators as any double linked list.