OLD | NEW |
(Empty) | |
| 1 Name: divsufsort |
| 2 URL: https://github.com/y-256/libdivsufsort |
| 3 Date: 2016-06-01 |
| 4 Security Critical: no |
| 5 License: MIT |
| 6 License File: LICENSE |
| 7 |
| 8 Description: |
| 9 This directory contains a modified version of Yuta Mori's libdivsufsort, |
| 10 available in its original form from: |
| 11 |
| 12 https://github.com/y-256/libdivsufsort |
| 13 |
| 14 The copy in this directory is so extensively modified that the binary format is |
| 15 incompatible with the original and it cannot be compiled outside the Chromium |
| 16 source tree or the Courgette project. |
| 17 |
| 18 List of changes made to original code: |
| 19 - Flattened directory and renamed .c files to .cc files. |
| 20 - Extracted top-of-file license to common file LICENCE. |
| 21 - Removed unused features, e.g., Burrows-Wheeler transformation. |
| 22 - Removed Open EMP usage. |
| 23 - Changed static functions to anonymous namespace functions. |
| 24 - Moved various #define's from divsufsort_private.h to files that use them. |
| 25 - Adapted code to enable PagedArray usage, to reduce effect of memory |
| 26 fragmentation: |
| 27 - Classified saidx_t* to {saidx_t*, saidx_it, const_saidx_it}. |
| 28 - Extracted ss_compare_internal() from ss_compare(), to break awkward usage |
| 29 of local array at end of sssort(). |
| 30 - Defined saidx_it and const_saidx_it to use PagedArray iterators. To |
| 31 restore old behavior, we can define DIVSUFSORT_NO_PAGED_ARRAY. |
| 32 - Added namespace divsuf. |
| 33 - Added divsufsort_with_empty(). |
| 34 - Added unit tests. |
OLD | NEW |