#include <intrusive_slist.h>
Inherited by AZStd::intrusive_slist< T, Hook >::iterator_impl.
|
typedef T | value_type |
|
typedef AZStd::ptrdiff_t | difference_type |
|
typedef const T * | pointer |
|
typedef const T & | reference |
|
typedef forward_iterator_tag | iterator_category |
|
|
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 bool | operator== (const this_type &rhs) const |
|
AZ_FORCE_INLINE bool | operator!= (const this_type &rhs) const |
|
template<class T, class Hook>
class AZStd::intrusive_slist< T, Hook >::const_iterator_impl
Constant iterator implementation. Intrusive list uses bidirectional iterators as any double linked list.
The documentation for this class was generated from the following file:
- Code/Framework/AzCore/AzCore/std/containers/intrusive_slist.h