[−][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 guaranteed to be O(n) time and O(1) space.
For now, this crate uses the C bindings by Amos Wenger to Yuta Mori's dissufsort, which is the fastest known SACA running in single thread with only O(1) additional workspace.
Structs
SuffixArray | Suffix array for searching byte strings. |
Constants
MAX_LENGTH | Maximum length of the input string. |