diff options
| author | Lars Wirzenius <liw@liw.fi> | 2011-01-07 22:00:05 +0000 |
|---|---|---|
| committer | Lars Wirzenius <liw@liw.fi> | 2011-01-07 22:00:05 +0000 |
| commit | 539809034a97aee4da22014512325b3b49226414 (patch) | |
| tree | 4a524579a508e8871e9931fc2fae3f92bbb51986 /NEWS | |
| parent | 20d863fd87ce812fc62b16bd3def012909c0640a (diff) | |
| download | larch-539809034a97aee4da22014512325b3b49226414.tar.gz | |
Update files for release 0.16.
Diffstat (limited to 'NEWS')
| -rw-r--r-- | NEWS | 9 |
1 files changed, 9 insertions, 0 deletions
@@ -5,6 +5,15 @@ These are the release notes for btree, a Python implementation of a copy-on-write B-tree, designed by Odah Rodeh. +Version 0.16, released 2011-01-07 +--------------------------------- + +* The code to split over-full leaf nodes into two is fixed. Before version + 0.14 we had a problem where one of the two halves might still be too big. + The code in 0.14 fixed that, but introduced a new problem where one of + the new nodes would be very small. Now they should be just right. + No, I have not read Goldilocks recently, why do you ask? + Version 0.15, released 2011-01-02 --------------------------------- |