library for lightweight suffix array construction algorithm
Project homepage: https://github.com/y-256/libdivsufsort
Description
This library provides a simple and an efficient C API to construct a
suffix array and a Burrows-Wheeler transformed string from a given
string over a constant-size alphabet. The algorithm runs in O(n log n)
worst-case time using only 5n+O(1) bytes of memory space, where n is the
length of the string.
Package information
- Ports path
- devel/libdivsufsort
- Package architecture
- amd64
- Maintainer
- Alexander Bluhm <bluhm@openbsd.org>
- Categories
- devel
- Available flavors
- None listed
Ports list build and test dependencies as well as runtime dependencies. pkg_add selects those needed for installation.
Direct dependencies
Build
- devel/cmake/core STEM->=4
- devel/ninja