mercurial/scmutil.py

38852:a3dacabd476b

    if node is None:
        return
    repo.changelog.rev(node)  # make sure node isn't filtered
    return node

def shortesthexnodeidprefix(repo, node, minlength=1):
    """Find the shortest unambiguous prefix that matches hexnode."""
    # _partialmatch() of filtered changelog could take O(len(repo)) time,
    # which would be unacceptably slow. so we look for hash collision in
    # unfiltered space, which means some hashes may be slightly longer.
    cl = repo.unfiltered().changelog

            if not isrev(prefix):
                return prefix

    revset = repo.ui.config('experimental', 'revisions.disambiguatewithin')
    if revset:
        revs = repo.anyrevs([revset], user=True)
        if cl.rev(node) in revs:
            hexnode = hex(node)
            for length in range(minlength, len(hexnode) + 1):
                matches = []
                prefix = hexnode[:length]

38853:3588e41f796d

    if node is None:
        return
    repo.changelog.rev(node)  # make sure node isn't filtered
    return node

def shortesthexnodeidprefix(repo, node, minlength=1, cache=None):
    """Find the shortest unambiguous prefix that matches hexnode.

    If "cache" is not None, it must be a dictionary that can be used for
    caching between calls to this method.
    """
    # _partialmatch() of filtered changelog could take O(len(repo)) time,
    # which would be unacceptably slow. so we look for hash collision in
    # unfiltered space, which means some hashes may be slightly longer.
    cl = repo.unfiltered().changelog

            if not isrev(prefix):
                return prefix

    revset = repo.ui.config('experimental', 'revisions.disambiguatewithin')
    if revset:
        revs = None
        if cache is not None:
            revs = cache.get('disambiguationrevset')
        if revs is None:
            revs = repo.anyrevs([revset], user=True)
            if cache is not None:
                cache['disambiguationrevset'] = revs
        if cl.rev(node) in revs:
            hexnode = hex(node)
            for length in range(minlength, len(hexnode) + 1):
                matches = []
                prefix = hexnode[:length]