summaryrefslogtreecommitdiff
path: root/NEWS
diff options
context:
space:
mode:
authorLars Wirzenius <liw@liw.fi>2012-05-08 22:31:17 +0100
committerLars Wirzenius <liw@liw.fi>2012-05-08 22:31:17 +0100
commit62a91e6d140233658b9aa6930dc4285272e1a109 (patch)
tree786f68cf51cbd806b98bc516508a1e860ca4404f /NEWS
parent8d79fbfc0b7f8447f60c04f6f65d5b07c9528267 (diff)
downloadlarch-62a91e6d140233658b9aa6930dc4285272e1a109.tar.gz
Release version 0.31larch-0.31
Diffstat (limited to 'NEWS')
-rw-r--r--NEWS3
1 files changed, 2 insertions, 1 deletions
diff --git a/NEWS b/NEWS
index 2122c0a..5771b5c 100644
--- a/NEWS
+++ b/NEWS
@@ -4,13 +4,14 @@ NEWS for larch
These are the release notes for larch, a Python implementation of a
copy-on-write B-tree, designed by Odah Rodeh.
-Version 0.31, released UNRELEASED
+Version 0.31, released 2012-05-08
---------------------------------
* Optimize journal use to have fewer round-trips. This matters when the
journal is stored on a high-latency storage, such as an SFTP server.
* Now handles better missing key or node sizes in the metadata.
* All exceptions thrown by larch are now subclasses of `larch.Error`.
+* The on-disk format is now frozen.
Version 0.30, released 2012-04-29
---------------------------------