[PATCH] revset: introduce optional 'while' predicate for ancestors()

Mads Kiilerich mads at kiilerich.com
Sat Oct 11 19:45:37 CDT 2014


On 10/11/2014 02:41 AM, Pierre-Yves David wrote:
>
>
> On 10/10/2014 07:12 AM, Mads Kiilerich wrote:
>> On 10/08/2014 03:27 AM, Pierre-Yves David wrote:
>>>
>>>
>>> On 10/07/2014 05:22 PM, Mads Kiilerich wrote:
>>>> # HG changeset patch
>>>> # User Mads Kiilerich <madski at unity3d.com>
>>>> # Date 1412727753 -7200
>>>> #      Wed Oct 08 02:22:33 2014 +0200
>>>> # Node ID 7c48c97a07b865c86a75562f94656a64a8506273
>>>> # Parent  564ae7d2ec9bee86b00a6ba817271ac0b19deca7
>>>> revset: introduce optional 'while' predicate for ancestors()
>>>>
>>>> When specifying a 'while' set, ancestors() will now only visit
>>>> parents that are
>>>> in that set. This makes it possible to prune while doing an ancestor
>>>> traversal
>>>> and reduce the number of membership tests.  Such a pruning is very
>>>> convenient
>>>> when expensive checks are involved.
>>>>
>>>> The primary initial use case for this feature is that filtering on
>>>> branch name
>>>> is so expensive. Often it is just as relevant to prune everything not
>>>> on the
>>>> branch.
>>>
>>> Feature seems interresting. However ther is a massive refactoring on
>>> revset in progress. I'll look at the patch after the end of the
>>> refactoring landed (opfully tomorrow).
>>
>> Any news on this ... or general thoughts on it from others?
>>
>> Do you guys agree such ancestor pruning is relevant? Can you imagine
>> other kinds of pruning than when yielding ancestors?
>
> Could be useful for descendant too. 

For my primary use case of finding changesets on a branch, we don't need 
it. We already have the branch head and do thus know up front that all 
changesets after that can be pruned. That do not require new language 
support. But yes, it should be added to descendeants too for 
completeness and consistency.

> Seems related to `only()` so maybe the implementation could be joined 
> or something.

Hmm. Yes. only(X,Y) == ancestors(X,!::Y) . The computation of ::Y should 
already be lazy and optimized ... but probably not as much as the 
current implementation of only.

> Seems also related to X::Y.

That one requires backtracking or some kind of keeping track of traces 
of multiple paths and merge or discard them while iterating the DAG. I 
don't think there is anything to share with this feature.

/Mads


More information about the Mercurial-devel mailing list