comparison mercurial/revset.py @ 22750:66e2b648deef

_descendant: use filteredset instead of orderedlazyset

The orderedlazyset class is going away. Filteredset gives the same service.

22749:672f15ee2a1d

    s = _revdescendants(repo, args, followfirst)

    # Both sets need to be ascending in order to lazily return the union
    # in the correct order.
    args.ascending()
    result = (orderedlazyset(s, subset.__contains__, ascending=True) +
              orderedlazyset(args, subset.__contains__, ascending=True))

    # Wrap result in a filteredset since it's an _addset, which doesn't
    # implement all the necessary functions to be consumed by callers.
    return orderedlazyset(result, lambda r: True, ascending=True)

def descendants(repo, subset, x):
    """``descendants(set)``
    Changesets which are descendants of changesets in set.
    """

22750:66e2b648deef

    s = _revdescendants(repo, args, followfirst)

    # Both sets need to be ascending in order to lazily return the union
    # in the correct order.
    args.ascending()
    result = (filteredset(s, subset.__contains__, ascending=True) +
              filteredset(args, subset.__contains__, ascending=True))

    # Wrap result in a filteredset since it's an _addset, which doesn't
    # implement all the necessary functions to be consumed by callers.
    return filteredset(result, lambda r: True, ascending=True)

def descendants(repo, subset, x):
    """``descendants(set)``
    Changesets which are descendants of changesets in set.
    """