|
libbmb
Modern implementation of STL
|
Forward iterator for linked list. More...
#include <llist_iterator.h>
Public Types | |
| using | value_type = remove_const_t< T > |
| using | reference = conditional_t< IsConst, const T, T > & |
| using | pointer = conditional_t< IsConst, const T, T > * |
| using | difference_type = ptrdiff_t |
| using | iterator_category = forward_iter_tag |
Public Member Functions | |
| LListIter () noexcept | |
| LListIter (BaseNode *node) noexcept | |
| operator LListIter< T, true > () const noexcept | |
| pointer | operator-> () const noexcept |
| reference | operator* () const noexcept |
| Self & | operator++ () noexcept |
| Self | operator++ (int) noexcept |
| bool | operator== (const Self &) const =default |
Friends | |
| template<typename , bool , bool , typename > | |
| class | bmb::LinkedList |
Forward iterator for linked list.
| T | value type that linked list node stores |
| using bmb::detail::LListIter< T, IsConst >::difference_type = ptrdiff_t |
| using bmb::detail::LListIter< T, IsConst >::iterator_category = forward_iter_tag |
| using bmb::detail::LListIter< T, IsConst >::pointer = conditional_t<IsConst, const T, T>* |
| using bmb::detail::LListIter< T, IsConst >::reference = conditional_t<IsConst, const T, T>& |
| using bmb::detail::LListIter< T, IsConst >::value_type = remove_const_t<T> |
|
inlinenoexcept |
|
inlineexplicitnoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
default |
|
friend |