A small, sane btree library, derived from the old berkeley db 1.85 code base.
- as fast and simple as a sequential text file for sequential writes
- easy to use, difficult to abuse
- large data values and large key values that actually work
- a cache management that tries to avoid any btree corruption:
- if a page is evicted, all dirty pages are flushed to the underlying fd
- signals are blocked in the critical section.
- low space conditions are checked before entry...