devel/libdivsufsort 2.0.2.1 OpenBSD
library for lightweight suffix array construction algorithm
- System
- OpenBSD
- Repository
- OpenBSD ports
- Maintainer
- Alexander Bluhm <[email protected]>
- Categories
- devel
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.
In the other systems
| System | Port | Version |
|---|---|---|
| OpenBSD | devel/libdivsufsort | 2.0.2.1 |
| FreeBSD | math/libdivsufsort | 2.0.2.1.20151027_1 |
| NetBSD | devel/libdivsufsort | 2.0.1 |
| DragonFly | math/libdivsufsort | 2.0.2.1.20151027 |
| HardenedBSD | math/libdivsufsort | 2.0.2.1.20151027_1 |
| GhostBSD | math/libdivsufsort | 2.0.2.1.20151027_1 |
Install
Binary package:
pkg_add libdivsufsort
From the ports tree:
cd /usr/ports/devel/libdivsufsort && make install
Dependencies
Build dependencies 2
No port depends on this one.