Mercurial > public > mercurial-scm > hg
diff tests/test-ancestor.py.out @ 18091:f7f8159caad3
ancestor: add lazy membership testing to lazyancestors
This also makes the perfancestorset command use lazy membership testing. In a
linear repository with over 400,000 commits, without this patch, hg
perfancestorset takes 0.80 seconds no matter how far behind we're looking.
With this patch, hg perfancestorset -- X takes:
Rev X Time
-1 0.00s
-4000 0.01s
-20000 0.04s
-80000 0.17s
-200000 0.43s
-300000 0.69s
0 0.88s
Thus, for revisions close to tip, we're up to several orders of magnitude
faster. At 0 we're around 10% slower.
| author | Siddharth Agarwal <sid0@fb.com> |
|---|---|
| date | Tue, 18 Dec 2012 12:47:20 -0800 |
| parents | b3ba69692f8a |
| children | 731b2a90983b |
line wrap: on
line diff
--- a/tests/test-ancestor.py.out Tue Dec 18 10:14:01 2012 -0800 +++ b/tests/test-ancestor.py.out Tue Dec 18 12:47:20 2012 -0800 @@ -34,3 +34,13 @@ [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12] % ancestors of [13] and not of [10, 11, 12] [8, 13] +% lazy ancestor set for [], stoprev = 0, inclusive = False +[] +% lazy ancestor set for [11, 13], stoprev = 0, inclusive = False +[7, 8, 3, 4, 1, 0] +% lazy ancestor set for [11, 13], stoprev = 0, inclusive = True +[11, 13, 7, 8, 3, 4, 1, 0] +% lazy ancestor set for [11, 13], stoprev = 6, inclusive = False +[7, 8] +% lazy ancestor set for [11, 13], stoprev = 6, inclusive = True +[11, 13, 7, 8]