At http://bzr.arbash-meinel.com/branches/bzr/1.8-dev/lighter_log_file
------------------------------------------------------------
revno: 3730
revision-id: [EMAIL PROTECTED]
parent: [EMAIL PROTECTED]
committer: John Arbash Meinel <[EMAIL PROTECTED]>
branch nick: lighter_log_file
timestamp: Sun 2008-09-21 09:01:24 -0500
message:
Add a TODO discussing how our index requests should evolve.
=== modified file 'bzrlib/log.py'
--- a/bzrlib/log.py 2008-09-19 03:50:29 +0000
+++ b/bzrlib/log.py 2008-09-21 14:01:24 +0000
@@ -565,6 +565,10 @@
# Looking up keys in batches of 1000 can cut the time in half, as well as
# memory consumption. GraphIndex *does* like to look for a few keys in
# parallel, it just doesn't like looking for *lots* of keys in parallel.
+ # TODO: This code needs to be re-evaluated periodically as we tune the
+ # indexing layer. We might consider passing in hints as to the known
+ # access pattern (sparse/clustered, high success rate/low success
+ # rate). This particular access is clustered with a low success rate.
get_parent_map = branch.repository.texts.get_parent_map
modified_text_revisions = set()
chunk_size = 1000
--
bazaar-commits mailing list
[email protected]
https://lists.ubuntu.com/mailman/listinfo/bazaar-commits
