Mercurial > public > mercurial-scm > hg
diff tests/test-ancestor.py @ 23341:bcc3012f8477
ancestor: add a way to add to bases of a missing ancestor object
This will be useful for setdiscovery, since with that we incrementally add to
our knowledge of common nodes.
| author | Siddharth Agarwal <sid0@fb.com> |
|---|---|
| date | Fri, 14 Nov 2014 17:21:00 -0800 |
| parents | 4178ad511edf |
| children | f710644e1ce9 |
line wrap: on
line diff
--- a/tests/test-ancestor.py Sun Nov 16 00:39:29 2014 -0800 +++ b/tests/test-ancestor.py Fri Nov 14 17:21:00 2014 -0800 @@ -45,6 +45,8 @@ def __init__(self, ancs, bases): self.ancs = ancs self.bases = set(bases) + def addbases(self, newbases): + self.bases.update(newbases) def missingancestors(self, revs): res = set() for rev in revs: @@ -97,6 +99,11 @@ naiveinc = naiveincrementalmissingancestors(ancs, bases) seq = [] for _ in xrange(inccount): + if rng.random() < 0.2: + newbases = samplerevs(graphnodes) + seq.append(('addbases', newbases)) + inc.addbases(newbases) + naiveinc.addbases(newbases) revs = samplerevs(graphnodes) seq.append(('missingancestors', revs)) h = inc.missingancestors(revs)