[−][src]Crate suffix_array
Suffix array construction and searching algorithms for in-memory binary data, focusing on space efficiency.
The suffix array construction algorithm is O(n) time and O(1) space, as described in Ge Nong. 2013. Practical linear-time O(1)-workspace suffix sorting for constant alphabets.. There are no heap allocations, except for a bucket array (about 3k memory) in the recursion level 0 for speeding up sorting.
Structs
| SuffixArray | Suffix array for searching byte strings. |
Constants
| MAX_LENGTH | Maximum length of the input string. |