mercurial/copies.py

30047:d13a7c8bf0a5

        repo.ui.debug("  unmatched files in other:\n   %s\n"
                      % "\n   ".join(u2))
    return u1, u2

def _makegetfctx(ctx):
    """return a 'getfctx' function suitable for checkcopies usage

    We have to re-setup the function building 'filectx' for each
    'checkcopies' to ensure the linkrev adjustment is properly setup for
    each. Linkrev adjustment is important to avoid bug in rename
    detection. Moreover, having a proper '_ancestrycontext' setup ensures
    the performance impact of this adjustment is kept limited. Without it,
    each file could do a full dag traversal making the time complexity of
    the operation explode (see issue4537).

    m1 = c1.manifest()
    m2 = c2.manifest()
    ma = ca.manifest()

    # see checkcopies documentation below for these dicts
    copy1, copy2 = {}, {}
    movewithdir1, movewithdir2 = {}, {}
    fullcopy1, fullcopy2 = {}, {}
    diverge = {}

    u1r, u2r = _computenonoverlap(repo, c1, c2, addedinm1, addedinm2)
    u1u, u2u = u1r, u2r
    bothnew = sorted(addedinm1 & addedinm2)

    for f in u1u:
        checkcopies(c1, f, m1, m2, ca, limit, diverge, copy1, fullcopy1)

    for f in u2u:
        checkcopies(c2, f, m2, m1, ca, limit, diverge, copy2, fullcopy2)

    copy = dict(copy1.items() + copy2.items())
    movewithdir = dict(movewithdir1.items() + movewithdir2.items())
    fullcopy = dict(fullcopy1.items() + fullcopy2.items())

    if bothnew:
        repo.ui.debug("  unmatched files new in both:\n   %s\n"
                      % "\n   ".join(bothnew))
    bothdiverge, _copy, _fullcopy = {}, {}, {}
    for f in bothnew:
        checkcopies(c1, f, m1, m2, ca, limit, bothdiverge, _copy, _fullcopy)
        checkcopies(c2, f, m2, m1, ca, limit, bothdiverge, _copy, _fullcopy)
    for of, fl in bothdiverge.items():
        if len(fl) == 2 and fl[0] == fl[1]:
            copy[fl[0]] = of # not actually divergent, just matching renames

    if fullcopy and repo.ui.debugflag:

                                       "dst: '%s'\n") % (f, df))
                    break

    return copy, movewithdir, diverge, renamedelete

def checkcopies(ctx, f, m1, m2, ca, limit, diverge, copy, fullcopy):
    """
    check possible copies of f from m1 to m2

    ctx = starting context for f in m1
    f = the filename to check

30048:91a3c58ecf93

        repo.ui.debug("  unmatched files in other:\n   %s\n"
                      % "\n   ".join(u2))
    return u1, u2

def _makegetfctx(ctx):
    """return a 'getfctx' function suitable for _checkcopies usage

    We have to re-setup the function building 'filectx' for each
    '_checkcopies' to ensure the linkrev adjustment is properly setup for
    each. Linkrev adjustment is important to avoid bug in rename
    detection. Moreover, having a proper '_ancestrycontext' setup ensures
    the performance impact of this adjustment is kept limited. Without it,
    each file could do a full dag traversal making the time complexity of
    the operation explode (see issue4537).

    m1 = c1.manifest()
    m2 = c2.manifest()
    ma = ca.manifest()

    # see _checkcopies documentation below for these dicts
    copy1, copy2 = {}, {}
    movewithdir1, movewithdir2 = {}, {}
    fullcopy1, fullcopy2 = {}, {}
    diverge = {}

    u1r, u2r = _computenonoverlap(repo, c1, c2, addedinm1, addedinm2)
    u1u, u2u = u1r, u2r
    bothnew = sorted(addedinm1 & addedinm2)

    for f in u1u:
        _checkcopies(c1, f, m1, m2, ca, limit, diverge, copy1, fullcopy1)

    for f in u2u:
        _checkcopies(c2, f, m2, m1, ca, limit, diverge, copy2, fullcopy2)

    copy = dict(copy1.items() + copy2.items())
    movewithdir = dict(movewithdir1.items() + movewithdir2.items())
    fullcopy = dict(fullcopy1.items() + fullcopy2.items())

    if bothnew:
        repo.ui.debug("  unmatched files new in both:\n   %s\n"
                      % "\n   ".join(bothnew))
    bothdiverge, _copy, _fullcopy = {}, {}, {}
    for f in bothnew:
        _checkcopies(c1, f, m1, m2, ca, limit, bothdiverge, _copy, _fullcopy)
        _checkcopies(c2, f, m2, m1, ca, limit, bothdiverge, _copy, _fullcopy)
    for of, fl in bothdiverge.items():
        if len(fl) == 2 and fl[0] == fl[1]:
            copy[fl[0]] = of # not actually divergent, just matching renames

    if fullcopy and repo.ui.debugflag:

                                       "dst: '%s'\n") % (f, df))
                    break

    return copy, movewithdir, diverge, renamedelete

def _checkcopies(ctx, f, m1, m2, ca, limit, diverge, copy, fullcopy):
    """
    check possible copies of f from m1 to m2

    ctx = starting context for f in m1
    f = the filename to check