About cl-btree
B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at but is now made available at SourceForge. Features...
B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at but is now made available at SourceForge.
Features
- supports both integer (32-bit) and variable size string keys/values.
- with string B-tree anything readable can be used as keys/values.
- uses write ahead log as a journal.
- no explicit threading support, locking must be handled externally.
- mapping keys/values support lower (inclusive) and upper (exclusive) bound
- supports both unique and non-unique values.
- read-only cursor
- in-memory B-tree (for testing)
Previous Versions
Here you can find the changelog of cl-btree since it was posted on our website on 2015-04-25 03:00:00.
The latest version is 0.12 and it was updated on 2024-03-19 19:08:10. See below the changes in each version.
cl-btree version
Updated At: 2011-03-20
cl-btree version files
Updated At: 2011-03-20
Changes: Several fixes and updates
Disclaimer
External Download
We do not host cl-btree on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by the software publisher and passed their terms and conditions to be listed there. We recommend caution when installing it.
The external download link for cl-btree is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
