SDSL: Succinct Data Structure Library
A C++ template library for succinct data structures
|
A forward iterator for a bottom up traversal of a suffix tree. More...
#include <cst_iterators.hpp>
Public Types | |
typedef Cst::node_type | value_type |
typedef const value_type | const_reference |
typedef Cst::size_type | size_type |
typedef cst_bottom_up_const_forward_iterator < Cst > | iterator |
Public Member Functions | |
cst_bottom_up_const_forward_iterator () | |
Default constructor. | |
cst_bottom_up_const_forward_iterator (const Cst *cst, const value_type node, bool valid=true) | |
Constructor. | |
const_reference | operator* () const |
Method for dereferencing the iterator. | |
iterator & | operator++ () |
Prefix increment of the iterator. | |
iterator | operator++ (int x) |
Postfix increment of the iterator. | |
bool | operator== (const iterator &it) const |
Equality operator. | |
bool | operator!= (const iterator &it) const |
Inequality operator. |
A forward iterator for a bottom up traversal of a suffix tree.