Viewing all changes in revision 5365.5.19.
- Committer: John Arbash Meinel
- Date: 2010-08-04 19:20:24 UTC
- mto: This revision was merged to the branch mainline in revision 5390.
- Revision ID: john@arbash-meinel.com-20100804192024-43x2jz5hh28vukjl
Lots of instrumentation. Add a last-lookup cache.
The core loop in the btree code is:
if x in node:
val = node[x]
As such, we avoid all the processing if we just cache when we had
a __contains__ hit. For ls -R we actually get a 100% __getitem__ hit
rate.
The core loop in the btree code is:
if x in node:
val = node[x]
As such, we avoid all the processing if we just cache when we had
a __contains__ hit. For ls -R we actually get a 100% __getitem__ hit
rate.
- files modified:
- bzrlib/_btree_serializer_pyx.pyx
expand all
collapse all
added
removed
