# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@octobus.net>
# Date 1495372906 -7200
# Node ID 1d70ec85ae0071a1a8389e962e56c4a35f14b84d
# Parent  c2b7fb580794ccbe21fa8c47f493eff6e9431fee
hidden: add a function returning ancestors of revs within a domain

See documentation for details. This will be used to improve the hidden
computation algorithm. See new changesets for usage.

diff -r c2b7fb580794 -r 1d70ec85ae00 mercurial/repoview.py
--- a/mercurial/repoview.py	Fri May 26 14:52:54 2017 -0700
+++ b/mercurial/repoview.py	Sun May 21 15:21:46 2017 +0200
@@ -92,6 +92,43 @@
                     heappush(heap, -parent)
     return hidden
 
+def _domainancestors(pfunc, revs, domain):
+    """return ancestors of 'revs' within 'domain'
+
+    - pfunc(r): a funtion returning parent of 'r',
+    - revs: iterable of revnum,
+    - domain: consistent set of revnum.
+
+    The domain must be consistent: no connected subset are the ancestors of
+    another connected subset. In other words, if the parents of a revision are
+    not in the domains, no other ancestors of that revision. For example, with
+    the following graph:
+
+        F
+        |
+        E
+        | D
+        | |
+        | C
+        |/
+        B
+        |
+        A
+
+    If C, D, E and F are in the domain but B is not, A cannot be ((A) is an
+    ancestors disconnected subset disconnected of (C+D)).
+
+    (Ancestors are returned inclusively)
+    """
+    stack = list(revs)
+    ancestors = set(stack)
+    while stack:
+        for p in pfunc(stack.pop()):
+            if p != nullrev and p in domain and p not in ancestors:
+                ancestors.add(p)
+                stack.append(p)
+    return ancestors
+
 cacheversion = 1
 cachefile = 'cache/hidden'