|J.J. Green 4355bb8b0d||1 week ago|
|bin||1 week ago|
|config||1 week ago|
|src||1 week ago|
|.distignore||7 months ago|
|.gitattributes||1 week ago|
|.gitignore||1 month ago|
|.gitlab-ci.yml||5 months ago|
|CHANGELOG.md||1 week ago|
|LICENCE||1 year ago|
|Makefile||1 week ago|
|README.md||1 month ago|
|VERSION||1 week ago|
|aclocal.m4||3 months ago|
|configure||1 week ago|
|configure.ac||1 week ago|
|status.json||1 week ago|
Implementation of the R-tree algorithm by A. Guttman, updated by Melinda Green. Retrieved from (1), July 2019. This rather old code (Green reports updating it to ANSI C) has been rewritten in C11 with an extensive test-suite to make a small, reasonably portable self-contained library. For use in smaller projects.
For documentation and stable releases, see the project homepage.
The same underlying algorithms are implemented, and we have some features which seem desirable for a modern library:
This code is beta and the features planned for version 1.0 have been implemented.
./configure make sudo make install
If you do not have the Jansson library (or do not want JSON
support) add the
--disable-json option to the
Similarly, if you do not have libcsv (or do not want CSV
support) pass the
To run the test-suite (which requires the CUnit library)
./configure --enable-unit-tests make make test
./configure --help for additional features.
Debian and derivatives (Ubuntu, Mint, ...)
The licence of the original files, according to (1), is that
You're completely free to use them for any purpose whatsoever. All I ask is that if you find one to be particularly valuable, then consider sending feedback.
Given this, I have released the rewrite under the MIT licence (see the file LICENCE).