At http://bzr.arbash-meinel.com/branches/bzr/1.8-dev/btree_buffer

------------------------------------------------------------
revno: 3776
revision-id: [EMAIL PROTECTED]
parent: [EMAIL PROTECTED]
committer: John Arbash Meinel <[EMAIL PROTECTED]>
branch nick: btree_buffer
timestamp: Tue 2008-10-14 15:28:43 -0500
message:
  This is now the algorithm, rather than just a suggestion.
=== modified file 'doc/developers/btree_index_prefetch.txt'
--- a/doc/developers/btree_index_prefetch.txt   2008-10-14 19:02:26 +0000
+++ b/doc/developers/btree_index_prefetch.txt   2008-10-14 20:28:43 +0000
@@ -241,10 +241,10 @@
   very often, though.
 
 
-Suggested Algorithm
-===================
+Algorithm
+=========
 
-This is the basic outline of my suggested algorithm.
+This is the basic outline of the algorithm.
 
 1. Expand requests by requesting neighboring pages. (So if we read page 10, we
    can expand to also read page 9 and 11.)

-- 
bazaar-commits mailing list
[email protected]
https://lists.ubuntu.com/mailman/listinfo/bazaar-commits

Reply via email to