B+Tree indices: ongoing progress

Wed Jul 2 03:32:48 BST 2008

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Robert Collins wrote:
| I've added some more tests, current script attached.
|
| Baseline overhead: Read 92994 keys in 7.070
| GraphIndex: Wrote 10147567 bytes in 10.504
| GraphIndex: iter_all_entries in 9.759
| GraphIndex: iter_random_one in 11.993
| GraphIndex: -------Done---------
| Baseline overhead: Read 92994 keys in 6.833
| BTreeIndex: Wrote 4104336 bytes in 21.195
| BTreeIndex: iter_all_entries in 1.925
| BTreeIndex: iter_random_one in 116.497
| BTreeIndex: -------Done---------
|
|
| More coming...
|
|

Would it make sense to turn this into a proper "bzr graph-test"
function, and just shove it into the plugin? That is generally how I do
it. You get argument parsing, all kinds of nice stuff.

John
=:->
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (Cygwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkhq6NAACgkQJdeBCYSNAAPkswCdH/McYoj01o42X9EnYL5Axlzz
8gYAoLcjAzPrTcsNLeW9yybOppykMsp9
=R7nv
-----END PGP SIGNATURE-----