{"schema_version":1,"metadata":{"branch":"current","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:41.004595+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/snapshots/packages/amd64/sqlports-7.55.tgz","source_sha256":"fcdbba1b9df747882aa9bab4af20ebec8dac10655069c90f1cd4145c06e1235e","package_count":12031,"source_kind":"sqlports"},"package":{"name":"libdivsufsort-2.0.2.1","path":"devel/libdivsufsort","url":"/packages/current/devel/libdivsufsort/","comment":"library for lightweight suffix array construction algorithm","homepage":"https://github.com/y-256/libdivsufsort","maintainer":"Alexander Bluhm <bluhm@openbsd.org>","description":"This library provides a simple and an efficient C API to construct a\nsuffix array and a Burrows-Wheeler transformed string from a given\nstring over a constant-size alphabet.  The algorithm runs in O(n log n)\nworst-case time using only 5n+O(1) bytes of memory space, where n is the\nlength of the string.\n","package_architecture":"amd64","stem":"libdivsufsort","readme":null,"dependencies":[{"path":"devel/cmake/core","type":"build","package_spec":"STEM->=4","url":"/packages/current/devel/cmake/core/"},{"path":"devel/ninja","type":"build","package_spec":"","url":"/packages/current/devel/ninja/"}],"reverse_dependencies":{"count":0,"url":null},"categories":["devel"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}