comparison contrib/shrink-revlog.py @ 10496:45734b51c99b stable

progress: mark strings for translation

10495:2c2d2f1354b4

    root = []
    # build children and roots
    ui.status('reading revs\n')
    try:
        for i in rl:
            ui.progress('reading', i, total=len(rl))
            children[i] = []
            parents = [p for p in rl.parentrevs(i) if p != node.nullrev]
            # in case of duplicate parents
            if len(parents) == 2 and parents[0] == parents[1]:
                del parents[1]

                children[p].append(i)

            if len(parents) == 0:
                root.append(i)
    finally:
        ui.progress('reading', None, total=len(rl))

    # XXX this is a reimplementation of the 'branchsort' topo sort
    # algorithm in hgext.convert.convcmd... would be nice not to duplicate
    # the algorithm
    ui.status('sorting revs\n')

    ui.status('writing revs\n')

    count = [0]
    def progress(*args):
        ui.progress('writing', count[0], total=len(order))
        count[0] += 1

    order = [r1.node(r) for r in order]

    # this is a bit ugly, but it works

    try:
        group = util.chunkbuffer(r1.group(order, lookup, progress))
        chunkiter = changegroup.chunkiter(group)
        r2.addgroup(chunkiter, unlookup, tr)
    finally:
        ui.progress('writing', None, len(order))

def report(ui, olddatafn, newdatafn):
    oldsize = float(os.stat(olddatafn).st_size)
    newsize = float(os.stat(newdatafn).st_size)

10496:45734b51c99b

    root = []
    # build children and roots
    ui.status('reading revs\n')
    try:
        for i in rl:
            ui.progress(_('reading'), i, total=len(rl))
            children[i] = []
            parents = [p for p in rl.parentrevs(i) if p != node.nullrev]
            # in case of duplicate parents
            if len(parents) == 2 and parents[0] == parents[1]:
                del parents[1]

                children[p].append(i)

            if len(parents) == 0:
                root.append(i)
    finally:
        ui.progress(_('reading'), None, total=len(rl))

    # XXX this is a reimplementation of the 'branchsort' topo sort
    # algorithm in hgext.convert.convcmd... would be nice not to duplicate
    # the algorithm
    ui.status('sorting revs\n')

    ui.status('writing revs\n')

    count = [0]
    def progress(*args):
        ui.progress(_('writing'), count[0], total=len(order))
        count[0] += 1

    order = [r1.node(r) for r in order]

    # this is a bit ugly, but it works

    try:
        group = util.chunkbuffer(r1.group(order, lookup, progress))
        chunkiter = changegroup.chunkiter(group)
        r2.addgroup(chunkiter, unlookup, tr)
    finally:
        ui.progress(_('writing'), None, len(order))

def report(ui, olddatafn, newdatafn):
    oldsize = float(os.stat(olddatafn).st_size)
    newsize = float(os.stat(newdatafn).st_size)