#include <intrusive_list.h>
Inherited by AZStd::intrusive_list< T, Hook >::iterator_impl.
Public Types | |
| typedef T | value_type |
| typedef AZStd::ptrdiff_t | difference_type |
| typedef const T * | pointer |
| typedef const T & | reference |
| typedef bidirectional_iterator_tag | iterator_category |
Public Member Functions | |
| AZ_FORCE_INLINE | const_iterator_impl (node_ptr_type node) |
| AZ_FORCE_INLINE const_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 iterator implementation. Intrusive list uses bidirectional iterators as any double linked list.