sa-is
| Crates.io | sa-is |
| lib.rs | sa-is |
| version | 0.1.0 |
| created_at | 2025-01-03 22:53:01.791027+00 |
| updated_at | 2025-01-03 22:53:01.791027+00 |
| description | The SA-IS algorithm for suffix array construction. |
| homepage | |
| repository | https://github.com/oguzbilgener/sa-is |
| max_upload_size | |
| id | 1503040 |
| size | 24,570 |
Oğuz Bilgener (oguzbilgener)
documentation
README
sa-is
Suffix Array Induced Sorting (SA-IS) algorithm based on the paper "Linear Suffix Array Construction by Almost Pure Induced-Sorting" by G. Nong, S. Zhang and W. H. Chan and the C++ implementation in Chromium.
Usage
use sa_is::make_suffix_array;
let answer = make_suffix_array(b"banana", char::MAX as usize);
assert_eq!(answer, [5, 3, 1, 0, 4, 2]);
License
This project is licensed under both the BSD-3-Clause and MIT licenses:
- The original code from the Chromium project is licensed under the BSD-3-Clause license.
- Any new contributions made to this project are licensed under the MIT license.
See the LICENSE file for details.