# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@octobus.net>
# Date 2019-03-05 14:39:54
# Node ID 1f069f37e6016412b002ed4099ed1fb679740e3d
# Parent  c98420914c109c6131a2aef57d6a2bdfdda40d7b

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).

diff --git a/mercurial/setdiscovery.py b/mercurial/setdiscovery.py
--- a/mercurial/setdiscovery.py
+++ b/mercurial/setdiscovery.py
@@ -219,13 +219,13 @@ class partialdiscovery(object):
         for rev in sorted(revs):
             # Always ensure revision has an entry so we don't need to worry
             # about missing keys.
-            children.setdefault(rev, [])
-
+            children[rev] = []
             for prev in parentrevs(rev):
                 if prev == nullrev:
                     continue
-
-                children.setdefault(prev, []).append(rev)
+                c = children.get(prev)
+                if c is not None:
+                    c.append(rev)
 
         _updatesample(revs, revsroots, sample, children.__getitem__)
         assert sample