Project description

sufarray: implementation of suffix array

It uses prefix doubling for calculating the suffix array, which is O(n log n) time. When searching for all occurrences of a string, it takes O(log n) time. Further occurrences takes constant time.

At present the implementation is Python only. This has the drawback that the speed is not comparable with those of other languages.

Project details

These details have not been verified by PyPI

Project links

Homepage

GitHub Statistics

View statistics for this project via Libraries.io, or by using our public dataset on Google BigQuery

Development Status
- 4 - Beta
License
- OSI Approved :: MIT License
Operating System
- OS Independent
Programming Language
Topic
- Software Development :: Libraries

Release history Release notifications | RSS feed

0.1.1

Jan 28, 2020

This version

0.1

Jan 28, 2020

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

sufarray_kkto-0.1.tar.gz (4.1 kB view hashes)

Uploaded Jan 28, 2020 Source

Built Distribution

sufarray_kkto-0.1-py3-none-any.whl (5.4 kB view hashes)

Uploaded Jan 28, 2020 Python 3

Hashes for sufarray_kkto-0.1.tar.gz

Hashes for sufarray_kkto-0.1.tar.gz
Algorithm	Hash digest
SHA256	`9b70bcf8da5f8a4749d91553c1da5c1c0cd91baa9538f89abad93c8bef573bfb`
MD5	`f61e8508058a1200ab86118734aec167`
BLAKE2b-256	`c752e3a2fd1ff9381bb0598416a14781de04e1dd0d195bf54af5e8900f554577`

Hashes for sufarray_kkto-0.1-py3-none-any.whl

Hashes for sufarray_kkto-0.1-py3-none-any.whl
Algorithm	Hash digest
SHA256	`472239a97951f1964fb1582a75e5516fd9a7e14261f5225319177d79d8080730`
MD5	`fec961fb8981f5ba54ab880a6ca7bfc4`
BLAKE2b-256	`72f257f5ad7a694f4f22be3f768b56d69b856c03f392e2787065f8a1b6368121`