diff options
| author | Lars Wirzenius <liw@liw.fi> | 2011-08-19 17:53:06 +0100 |
|---|---|---|
| committer | Lars Wirzenius <liw@liw.fi> | 2011-08-19 17:53:06 +0100 |
| commit | 729eee9a6eebdde7a570381535e925665b997d27 (patch) | |
| tree | 958b88c6a386f2f98e09f56cb18fe441fa6cf902 /NEWS | |
| parent | 0e78d545008db191eed9a2687eab52a4bbe1d811 (diff) | |
| download | larch-729eee9a6eebdde7a570381535e925665b997d27.tar.gz | |
Prepare NEWS for release.
Diffstat (limited to 'NEWS')
| -rw-r--r-- | NEWS | 5 |
1 files changed, 3 insertions, 2 deletions
@@ -5,7 +5,7 @@ These are the release notes for larch, a Python implementation of a copy-on-write B-tree, designed by Odah Rodeh. -Version 0.23, released UNRELEASED +Version 0.23, released 2011-08-19 --------------------------------- * The default size of the LRU cache used by NodeStoreDisk is not 500 @@ -13,7 +13,8 @@ Version 0.23, released UNRELEASED trees: 37% vs 99% cache hit rates with speed-test for 100k keys. * The `BTree.lookup_range` method now returns a list, not a generator. It turned out to be very surprising to return a generator, especially - with the documentation saying a list was returned. + with the documentation saying a list was returned. (Thanks, Jo Shields, + for the bug report.) Version 0.22, released 2011-08-03 --------------------------------- |