Rev 3: Switch to comparing in pairs, so we don't have pre-computed hashes. in http://bzr.arbash-meinel.com/plugins/bench_patience

[John Arbash Meinel]

At http://bzr.arbash-meinel.com/plugins/bench_patience

------------------------------------------------------------
revno: 3
revision-id:john at arbash-meinel.com-20071204235627-07ldd8e3pk51jo15
parent: john at arbash-meinel.com-20071204155434-y7y3a2qg7wph0c9s
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: bench_patience
timestamp: Tue 2007-12-04 17:56:27 -0600
message:
  Switch to comparing in pairs, so we don't have pre-computed hashes.
modified:
  __init__.py                    __init__.py-20071204154123-hrdofqdugj0iwxcy-1
-------------- next part --------------
=== modified file '__init__.py'
--- a/__init__.py	2007-12-04 15:54:34 +0000
+++ b/__init__.py	2007-12-04 23:56:27 +0000
@@ -43,7 +43,7 @@
             texts = w.get_line_list(versions)
             total_len = sum(len(t) for t in texts)
             self.outf.write('%d total bytes\n' % total_len)
-            last_text = []
+            last_text = None
             from bzrlib.patiencediff import PatienceSequenceMatcher
             times = []
             pb = ui.ui_factory.nested_progress_bar()
@@ -51,8 +51,11 @@
                 t_overall_start = time.clock()
                 for idx, text in enumerate(texts):
                     pb.update('comparing', idx, len(texts))
+                    if last_text is None:
+                        last_text = text
+                        continue
                     matcher = PatienceSequenceMatcher(None, last_text, text)
-                    last_text = text
+                    last_text = None
                     t_start = time.clock()
                     matcher.get_matching_blocks()
                     t_delta = time.clock() - t_start