|
template<typename textds_t > |
| SADivSufSort (Env &&env, const textds_t &t, CompressMode cm) |
|
void | compress () |
|
virtual | ~Algorithm ()=default |
|
| Algorithm (Algorithm const &)=default |
|
| Algorithm (Algorithm &&)=default |
|
Algorithm & | operator= (Algorithm const &)=default |
|
Algorithm & | operator= (Algorithm &&)=default |
|
| Algorithm (Env &&env) |
| Instantiates an algorithm in the specified environment. More...
|
|
Env & | env () |
| Provides access to the environment that the algorithm works in. More...
|
|
const Env & | env () const |
|
| ArrayDS () |
|
| ArrayDS (const ArrayDS &other)=delete |
|
| ArrayDS (ArrayDS &&other) |
|
ArrayDS & | operator= (ArrayDS &&other) |
|
iv_t | relinquish () |
| Forces the data structure to relinquish its data storage. More...
|
|
iv_t | copy () const |
| Creates a copy of the data structure's storage. More...
|
|
| IntVector () |
|
| IntVector (size_type n) |
|
| IntVector (size_type n, const value_type &val) |
|
| IntVector (size_type n, const value_type &val, uint8_t width) |
|
template<class InputIterator > |
| IntVector (InputIterator first, InputIterator last) |
|
| IntVector (const IntVector &other) |
|
| IntVector (IntVector &&other) |
|
| IntVector (std::initializer_list< value_type > il) |
|
IntVector & | operator= (const IntVector &other) |
|
IntVector & | operator= (IntVector &&other) |
|
IntVector & | operator= (std::initializer_list< value_type > il) |
|
iterator | begin () |
|
iterator | end () |
|
reverse_iterator | rbegin () |
|
reverse_iterator | rend () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
const_reverse_iterator | rbegin () const |
|
const_reverse_iterator | rend () const |
|
const_iterator | cbegin () const |
|
const_iterator | cend () const |
|
const_reverse_iterator | crbegin () const |
|
const_reverse_iterator | crend () const |
|
size_type | size () const |
|
uint64_t | bit_size () const |
|
size_type | max_size () const |
|
uint8_t | width () const |
|
void | width (uint8_t w) |
|
void | resize (size_type n) |
|
void | resize (size_type n, const value_type &val) |
|
void | resize (size_type n, const value_type &val, uint8_t w) |
|
size_type | capacity () const |
|
uint64_t | bit_capacity () const |
|
bool | empty () const |
|
void | reserve (size_type n) |
|
void | reserve (size_type n, uint8_t w) |
|
void | bit_reserve (uint64_t n) |
|
void | shrink_to_fit () |
|
reference | operator[] (size_type n) |
|
const_reference | operator[] (size_type n) const |
|
reference | at (size_type n) |
|
const_reference | at (size_type n) const |
|
reference | front () |
|
const_reference | front () const |
|
reference | back () |
|
const_reference | back () const |
|
internal_data_type * | data () noexcept |
|
const internal_data_type * | data () const noexcept |
|
template<class InputIterator > |
void | assign (InputIterator first, InputIterator last) |
|
void | assign (size_type n, const value_type &val) |
|
void | assign (std::initializer_list< value_type > il) |
|
void | push_back (const value_type &val) |
|
void | push_back (value_type &&val) |
|
void | pop_back () |
|
iterator | insert (const_iterator position, const value_type &val) |
|
iterator | insert (const_iterator position, size_type n, const value_type &val) |
|
template<class InputIterator > |
iterator | insert (const_iterator position, InputIterator first, InputIterator last) |
|
iterator | insert (const_iterator position, value_type &&val) |
|
iterator | insert (const_iterator position, std::initializer_list< value_type > il) |
|
iterator | erase (const_iterator position) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
void | swap (IntVector &other) |
|
void | clear () |
|
template<class... Args> |
iterator | emplace (const_iterator position, Args &&... args) |
|
template<class... Args> |
void | emplace_back (Args &&... args) |
|
Constructs the suffix array using divsufsort.
Definition at line 13 of file SADivSufSort.hpp.