diff options
| author | Lars Wirzenius <liw@liw.fi> | 2011-01-02 21:57:54 +0000 |
|---|---|---|
| committer | Lars Wirzenius <liw@liw.fi> | 2011-01-02 21:57:54 +0000 |
| commit | 63317efa4a549b42bd5d141e28e06a252b0c544a (patch) | |
| tree | 4bf4d15b105b99ead55317c4d6aecb5d0d2da868 | |
| parent | 779ccdb8157477f3cd917434cff999fdba463b76 (diff) | |
| parent | d99ce680937cc6673b5782cbca53e6ad653e71bc (diff) | |
| download | larch-version_0_15.tar.gz | |
Release version 0.15.version_0_15
| -rw-r--r-- | NEWS | 10 | ||||
| -rw-r--r-- | btree/__init__.py | 2 | ||||
| -rw-r--r-- | debian/changelog | 7 |
3 files changed, 18 insertions, 1 deletions
@@ -5,6 +5,16 @@ These are the release notes for btree, a Python implementation of a copy-on-write B-tree, designed by Odah Rodeh. +Version 0.15, released 2011-01-02 +--------------------------------- + +* This version replaces all use of my custom `bsearch` function with the + `bisect` module in the Python standard library. This speeds up all + operations, some more than others. In-memory benchmarks with ´speed-test` + sped up from about 20% for `remove_range` up to 240% for `lookup`. + No other changes, but I felt this warranted a release on its own. + + Version 0.14, released 2010-12-29 --------------------------------- diff --git a/btree/__init__.py b/btree/__init__.py index 321e16f..8644188 100644 --- a/btree/__init__.py +++ b/btree/__init__.py @@ -14,7 +14,7 @@ # along with this program. If not, see <http://www.gnu.org/licenses/>. -version = '0.14' +version = '0.15' from nodes import LeafNode, IndexNode diff --git a/debian/changelog b/debian/changelog index bc82943..6afcb01 100644 --- a/debian/changelog +++ b/debian/changelog @@ -1,3 +1,10 @@ +python-btree (0.15) squeeze; urgency=low + + * New upstream release. + - replace bsearch with bisect, which results in speedups + + -- Lars Wirzenius <liw@liw.fi> Sun, 02 Jan 2011 21:56:23 +0000 + python-btree (0.14) squeeze; urgency=low * New upstream release. |