comparison mercurial/setdiscovery.py @ 41883:1f069f37e601

discovery: simplify the building of the children mapping

Since we only care about the revisions inside the set we are sampling, we can
use simpler code (and probably sightly faster).

41882:c98420914c10

        children = {}

        for rev in sorted(revs):
            # Always ensure revision has an entry so we don't need to worry
            # about missing keys.
            children.setdefault(rev, [])

            for prev in parentrevs(rev):
                if prev == nullrev:
                    continue

                children.setdefault(prev, []).append(rev)

        _updatesample(revs, revsroots, sample, children.__getitem__)
        assert sample
        sample = _limitsample(sample, size)
        if len(sample) < size:

41883:1f069f37e601

        children = {}

        for rev in sorted(revs):
            # Always ensure revision has an entry so we don't need to worry
            # about missing keys.
            children[rev] = []
            for prev in parentrevs(rev):
                if prev == nullrev:
                    continue
                c = children.get(prev)
                if c is not None:
                    c.append(rev)

        _updatesample(revs, revsroots, sample, children.__getitem__)
        assert sample
        sample = _limitsample(sample, size)
        if len(sample) < size: