begin() const | tim::graph< T, AllocatorT >::iterator_base | |
difference_type typedef | tim::graph< T, AllocatorT >::iterator_base | |
end() const | tim::graph< T, AllocatorT >::iterator_base | |
iterator_base() | tim::graph< T, AllocatorT >::iterator_base | |
iterator_base(graph_node *) | tim::graph< T, AllocatorT >::iterator_base | |
iterator_base(const iterator_base &)=default | tim::graph< T, AllocatorT >::iterator_base | |
iterator_base(iterator_base &&) noexcept=default | tim::graph< T, AllocatorT >::iterator_base | |
iterator_category typedef | tim::graph< T, AllocatorT >::iterator_base | |
m_parent | tim::graph< T, AllocatorT >::sibling_iterator | |
m_skip_current_children | tim::graph< T, AllocatorT >::iterator_base | protected |
node | tim::graph< T, AllocatorT >::iterator_base | |
number_of_children() const | tim::graph< T, AllocatorT >::iterator_base | |
operator bool() const | tim::graph< T, AllocatorT >::iterator_base | inline |
operator!=(const sibling_iterator &) const | tim::graph< T, AllocatorT >::sibling_iterator | |
operator*() const | tim::graph< T, AllocatorT >::iterator_base | |
operator+(unsigned int) | tim::graph< T, AllocatorT >::sibling_iterator | |
operator++() | tim::graph< T, AllocatorT >::sibling_iterator | |
operator++(int) | tim::graph< T, AllocatorT >::sibling_iterator | |
operator+=(unsigned int) | tim::graph< T, AllocatorT >::sibling_iterator | |
operator--() | tim::graph< T, AllocatorT >::sibling_iterator | |
operator--(int) | tim::graph< T, AllocatorT >::sibling_iterator | |
operator-=(unsigned int) | tim::graph< T, AllocatorT >::sibling_iterator | |
operator->() const | tim::graph< T, AllocatorT >::iterator_base | |
operator=(const sibling_iterator &)=default | tim::graph< T, AllocatorT >::sibling_iterator | |
operator=(sibling_iterator &&) noexcept=default | tim::graph< T, AllocatorT >::sibling_iterator | |
tim::graph::iterator_base::operator=(const iterator_base &)=default | tim::graph< T, AllocatorT >::iterator_base | |
tim::graph::iterator_base::operator=(iterator_base &&) noexcept=default | tim::graph< T, AllocatorT >::iterator_base | |
operator==(const sibling_iterator &) const | tim::graph< T, AllocatorT >::sibling_iterator | |
pointer typedef | tim::graph< T, AllocatorT >::iterator_base | |
range_first() const | tim::graph< T, AllocatorT >::sibling_iterator | |
range_last() const | tim::graph< T, AllocatorT >::sibling_iterator | |
reference typedef | tim::graph< T, AllocatorT >::iterator_base | |
sibling_iterator() | tim::graph< T, AllocatorT >::sibling_iterator | |
sibling_iterator(graph_node *) | tim::graph< T, AllocatorT >::sibling_iterator | |
sibling_iterator(const iterator_base &) | tim::graph< T, AllocatorT >::sibling_iterator | |
sibling_iterator(const sibling_iterator &)=default | tim::graph< T, AllocatorT >::sibling_iterator | |
sibling_iterator(sibling_iterator &&) noexcept=default | tim::graph< T, AllocatorT >::sibling_iterator | |
size_type typedef | tim::graph< T, AllocatorT >::iterator_base | |
skip_children() | tim::graph< T, AllocatorT >::iterator_base | |
skip_children(bool skip) | tim::graph< T, AllocatorT >::iterator_base | |
value_type typedef | tim::graph< T, AllocatorT >::iterator_base | |