#include "paal/utils/irange.hpp"
#include <boost/range/algorithm/fill.hpp>
#include <boost/range/algorithm/max_element.hpp>
#include <boost/range/numeric.hpp>
Go to the source code of this file.
|
template<typename Letter > |
bool | paal::detail::leq (Letter a1, int a2, Letter b1, int b2) |
| return true if pair (a1,a2) is smaller than pair (b1,b2) in lexicographic order and false otherwise More...
|
|
template<typename Letter > |
bool | paal::detail::leq (Letter a1, Letter a2, int a3, Letter b1, Letter b2, int b3) |
| return true if triple (a1,a2,a3) is smaller than triple (b1,b2,b3) in lexicographic order and false otherwise More...
|
|
template<typename Letter > |
void | paal::detail::suffix_array (std::vector< Letter > &text, std::vector< int > &SA, Letter max_letter) |
| require text[n]=text[n+1]=text[n+2]=0, n>=2 fill suffix_array suffix_array[i] contains the starting position of the i-1'th smallest suffix in Word More...
|
|
template<typename Letter > |
void | paal::suffix_array (std::vector< Letter > &text, std::vector< int > &SA, Letter max_letter=0) |
| detail More...
|
|
- Author
- Piotr Smulewicz
- Version
- 1.0
- Date
- 2013-08-29
Definition in file suffix_array.hpp.