SDSL 3.0.1
Succinct Data Structure Library
|
An forward iterator for (compressed) suffix trees. More...
#include <cst_iterators.hpp>
Public Types | |
using | iterator_category = std::forward_iterator_tag |
using | value_type = typename Cst::node_type |
using | difference_type = std::ptrdiff_t |
using | pointer = value_type * |
using | reference = value_type & |
typedef const value_type | const_reference |
typedef Cst::size_type | size_type |
typedef cst_dfs_const_forward_iterator< Cst > | iterator |
typedef Cst::node_type | node_type |
Public Member Functions | |
cst_dfs_const_forward_iterator (const Cst *cst, const value_type node, bool visited=false, bool valid=true) | |
Constructor. More... | |
~cst_dfs_const_forward_iterator () | |
Copy Constructor. More... | |
uint8_t | visit () const |
Returns how often the current node was already visited. More... | |
void | skip_subtree () |
const_reference | operator* () const |
Method for dereferencing the iterator. More... | |
iterator & | operator++ () |
Prefix increment of the iterator. More... | |
void | operator++ (int) |
Postfix increment of the iterator. More... | |
bool | operator== (const iterator &it) const |
Equality operator. More... | |
bool | operator!= (const iterator &it) const |
Inequality operator. More... | |
An forward iterator for (compressed) suffix trees.
The cst_dfs_const_forward_iterator iterates through the nodes of a (compressed) suffix tree in depth first search (dfs) order. Note, that
If the current node is a inner node, the method visit() returns 1 for the first visit and 2 for the second one.
This iterator is the standard iterator for the classes
Definition at line 37 of file cst_iterators.hpp.
typedef const value_type sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::const_reference |
Definition at line 46 of file cst_iterators.hpp.
using sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::difference_type = std::ptrdiff_t |
Definition at line 42 of file cst_iterators.hpp.
typedef cst_dfs_const_forward_iterator<Cst> sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::iterator |
Definition at line 48 of file cst_iterators.hpp.
using sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::iterator_category = std::forward_iterator_tag |
Definition at line 40 of file cst_iterators.hpp.
typedef Cst::node_type sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::node_type |
Definition at line 49 of file cst_iterators.hpp.
using sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::pointer = value_type * |
Definition at line 43 of file cst_iterators.hpp.
using sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::reference = value_type & |
Definition at line 44 of file cst_iterators.hpp.
typedef Cst::size_type sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::size_type |
Definition at line 47 of file cst_iterators.hpp.
using sdsl::cst_dfs_const_forward_iterator< Cst, cache_size >::value_type = typename Cst::node_type |
Definition at line 41 of file cst_iterators.hpp.
|
inline |
Constructor.
Definition at line 85 of file cst_iterators.hpp.
|
inline |
Copy Constructor.
Definition at line 106 of file cst_iterators.hpp.
|
inline |
Inequality operator.
Definition at line 185 of file cst_iterators.hpp.
|
inline |
Method for dereferencing the iterator.
Definition at line 127 of file cst_iterators.hpp.
|
inline |
Prefix increment of the iterator.
Definition at line 130 of file cst_iterators.hpp.
|
inline |
Postfix increment of the iterator.
Definition at line 173 of file cst_iterators.hpp.
|
inline |
Equality operator.
Definition at line 176 of file cst_iterators.hpp.
|
inline |
Definition at line 118 of file cst_iterators.hpp.
|
inline |
Returns how often the current node was already visited.
Definition at line 116 of file cst_iterators.hpp.