caf6a60e8b
libdivsufsort is a software library that implements a lightweight suffix array construction algorithm. 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.
12 lines
358 B
Makefile
12 lines
358 B
Makefile
# $NetBSD: buildlink3.mk,v 1.1 2021/01/20 11:37:22 nia Exp $
|
|
|
|
BUILDLINK_TREE+= libdivsufsort
|
|
|
|
.if !defined(LIBDIVSUFSORT_BUILDLINK3_MK)
|
|
LIBDIVSUFSORT_BUILDLINK3_MK:=
|
|
|
|
BUILDLINK_API_DEPENDS.libdivsufsort+= libdivsufsort>=2.0.1
|
|
BUILDLINK_PKGSRCDIR.libdivsufsort?= ../../devel/libdivsufsort
|
|
.endif # LIBDIVSUFSORT_BUILDLINK3_MK
|
|
|
|
BUILDLINK_TREE+= -libdivsufsort
|