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