cl-btree has relatively high code coverage with unit tests but it is still considered unstable because of low usage rate.
There is two types of B-trees implemented. Default type uses 32-bit unsigned integers as keys and values. The other type uses string as keys and values. The string B-tree can store anything readable as keys and values. The size of key strings or values is not fixed. String B-tree uses simply prin1 to write and read to read keys and values from cl-swap-file block stream.
Here is a sample session for using string B-tree:
cl-btree uses cl-swap-file for storing disk blocks on to file.
Download it from https://sourceforge.net/projects/cl-btree/files/
cl-btree no longer depends on cl-unit-test.
Quick assessment (2021-04-11)
- Depends on cl-swap-file and cl-binary-file—but they're called cl-swap-file-0.6 and cl-binary-file-0.4, so ASDF fails there.
- cl-binary-file depends on trivial-garbage but doesn't actually use it, so the attempt to make a weak hash table isn't portable.
- cl-binary-file implements a kind of bivalent stream (via trivial-gray-streams) but it doesn't work right under CCL.
- Each system includes the lisp-unit module, so there are a bunch of warnings about duplicate definitions.
Tags: StructuredStorage, Data Structure