|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Functions | |
| Array< size_t > | all_positions (const size_t n) |
| Generate an array of all positions from 0 to n. | |
| void | sort_matches (Array< size_t > &a) |
| Sort matches in place using introsort. | |
Generate an array of all positions from 0 to n.
| [in] | n | The maximum position. |
Definition at line 71 of file Suffix_Structures.H.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::Array< T >::reserve().
Referenced by Aleph::Naive_Suffix_Tree::find_all().
Sort matches in place using introsort.
| [in,out] | a | Array of matches to sort. |
Definition at line 84 of file Suffix_Structures.H.
References Aleph::introsort().
Referenced by Aleph::Naive_Suffix_Tree::find_all().