14e7753441932b61c5eb061dcc5c18a2f2ae4721,gb/hypergraph/sql.py,,nthperm,#Any#Any#,27

Before Change

    n -= 1
    s = len(li)
    res = []
    for x in range(s-1, -1, -1):
        f = math.factorial(x)
        d = n / f
        n -= d * f
        res.append(li[d])
        del(li[d])
    return res


def do_with_edge_permutations(edge, f):

After Change

def nthperm(li, n):
    // TODO: make this more efficient
    indices = [i for i in range(len(li))]
    pos = 0
    for perm in itertools.permutations(indices):
        if pos >= n:
            indices = perm
            break
        pos += 1
    return [li[indices[i]] for i in range(len(li))]


def do_with_edge_permutations(edge, f):

Instances