comparison mercurial/hbisect.py @ 6762:f67d1468ac50

util: add sort helper

6761:cb981fc955fb

                        children[prev].append(rev)
                    else:
                        children[prev] = [rev]
                        visit.append(prev)

    candidates.sort()
    # have we narrowed it down to one entry?
    tot = len(candidates)
    if tot == 1:
        return (bad, 0, good)
    perfect = tot / 2

    # find the best node to test
    best_rev = None
    best_len = -1
    poison = {}
    for rev in candidates:
        if rev in poison:
            for c in children.get(rev, []):
                poison[c] = True # poison children
            continue

6762:f67d1468ac50

                        children[prev].append(rev)
                    else:
                        children[prev] = [rev]
                        visit.append(prev)

    # have we narrowed it down to one entry?
    tot = len(candidates)
    if tot == 1:
        return (bad, 0, good)
    perfect = tot / 2

    # find the best node to test
    best_rev = None
    best_len = -1
    poison = {}
    for rev in util.sort(candidates):
        if rev in poison:
            for c in children.get(rev, []):
                poison[c] = True # poison children
            continue