diff options
| author | Lars Wirzenius <liw@liw.fi> | 2011-02-09 10:56:09 +0000 |
|---|---|---|
| committer | Lars Wirzenius <liw@liw.fi> | 2011-02-09 10:56:09 +0000 |
| commit | 2c93c1a206a3e526cc43d5ff9c6eaec09ee4187e (patch) | |
| tree | d79e841b23c96f5796b6ed5ba473c9d43a86aa5a /README | |
| parent | b6639450597a10cefd10d58022530bcf23cdb704 (diff) | |
| download | larch-2c93c1a206a3e526cc43d5ff9c6eaec09ee4187e.tar.gz | |
Update README.
Diffstat (limited to 'README')
| -rw-r--r-- | README | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -22,7 +22,7 @@ for on-disk storage. Documentation is sparse. Docstrings and reading the code are your best hope. (Help and feedback welcome!) -See the file speed-test for an example. +See the file example.py for an example. * Homepage: <http://liw.fi/btree/> * Version control: `bzr get http://code.liw.fi/btree/bzr/trunk/` @@ -69,8 +69,8 @@ parts of the code. I have three scripts to run simplistic benchmarks: -* `codec-speed` tests speed of the NodeCodec class, for encoding tree nodes - for on-disk storage. +* `codec-speed 1000 no` tests speed of the NodeCodec class, + for encoding tree nodes for on-disk storage. * `speed-test` tests insert and lookup speeds in trees. * `bsearch-speed` compares my binary search routine with the one in the Python standard library module `bisect` (mine is slower, but more |