rust-index: using the `hg::index::Index` in ancestors iterator and lazy set Since there is no Rust implementation for REVLOGV2/CHANGELOGv2, we declare them to be incompatible with Rust, hence indexes in these formats will use the implementations from Python `mercurial.ancestor`. If this is an unacceptable performance hit for current users of these formats, we can later on add Rust implementations based on the C index for them or implement these formats for the Rust indexes. Among the challenges that we had to meet, we wanted to avoid taking the GIL each time the inner (vcsgraph) iterator has to call the parents function. This would probably still be acceptable in terms of performance with `AncestorsIterator`, but not with `LazyAncestors` nor for the upcoming change in `MissingAncestors`. Hence we enclose the reference to the index in a `PySharedRef`, leading to more rigourous checking of mutations, which does pass now that there no logically immutable methods of `hg::index::Index` that take a mutable reference as input.

     1

# stack.py - Mercurial functions for stack definition

     2

#

     3

#  Copyright Olivia Mackall <olivia@selenic.com> and other

     4

#

     5

# This software may be used and distributed according to the terms of the

     6

# GNU General Public License version 2 or any later version.

     7

     8

     9

def getstack(repo, rev=None):

    10

    """return a sorted smartrev of the stack containing either rev if it is

    11

    not None or the current working directory parent.

    12

    13

    The stack will always contain all drafts changesets which are ancestors to

    14

    the revision and are not merges.

    15

    """

    16

    if rev is None:

    17

        rev = b'.'

    18

    19

    revspec = b'only(%s) and not public() and not ::merge()'

    20

    revisions = repo.revs(revspec, rev)

    21

    revisions.sort()

    22

    return revisions