44 lines
1.2 KiB
Plaintext
44 lines
1.2 KiB
Plaintext
|
-- NEWS for libdivsufsort
|
||
|
|
|
||
|
|
Changes in release 2.0.0
|
||
|
|
|
||
|
|
- The build system was changed to CMake. (http://www.cmake.org/)
|
||
|
|
- Improved the performance of the suffix-sorting algorithm.
|
||
|
|
- Added OpenMP support.
|
||
|
|
- Added 64-bit version of divsufsort.
|
||
|
|
|
||
|
|
Changes in release 1.2.3
|
||
|
|
|
||
|
|
- Bug fixes.
|
||
|
|
|
||
|
|
Changes in release 1.2.2
|
||
|
|
|
||
|
|
- An important bug fix.
|
||
|
|
|
||
|
|
Changes in release 1.2.1
|
||
|
|
|
||
|
|
- A few bug fixes.
|
||
|
|
- New APIs: sa_search, sa_simplesearch.
|
||
|
|
|
||
|
|
Changes in release 1.2.0
|
||
|
|
|
||
|
|
- Changed license to the MIT/X11 license, see COPYING.
|
||
|
|
- Improved the performance of the suffix array construction.
|
||
|
|
- Change to use a new improved two-stage sorting algorithm.
|
||
|
|
- Replace substringsort with a new sorting algorithm that uses
|
||
|
|
multikey introspective sorting algorithm and in-place/recursive
|
||
|
|
merging algorithm.
|
||
|
|
- Replace drsort with a new sorting algorithm that uses
|
||
|
|
multikey introspective sorting algorithm, Maniscalco's tandem
|
||
|
|
repeat sorting algorithm and Larsson-Sadakane sorting algorithm.
|
||
|
|
- New API: divbwt.
|
||
|
|
|
||
|
|
Changes in release 1.0.2
|
||
|
|
|
||
|
|
- The performance of sorting has been improved.
|
||
|
|
- Fix some bugs.
|
||
|
|
|
||
|
|
Changes in release 1.0.1
|
||
|
|
|
||
|
|
- The performance of sorting has been improved a little bit.
|