?HAMA

Navigation

Breadcrumbs

Create

Edit File Size: 2.22 KB

/proc/thread-self/root/opt/cloudlinux/venv/lib/python3.11/site-packages/guppy/etc/IterPermute.py

Text Base64

from functools import reduce

def iterpermute(*args):
    args = [iter(a) for a in args]
    la = len(args)
    stopped = [0] * la
    lens = [0] * la
    bufs = [[] for i in range(la)]
    nexts = [None] * la
    n = 0
    while 1:
        anynew = 0
        for i in range(la):
            if stopped[i]:
                nextval = bufs[i][n % lens[i]]
            else:
                try:
                    nextval = next(args[i])
                except StopIteration:
                    if lens[i] == 0:
                        # raise ValueError, 'The iterator passed in arg %d did not return any item'%i
                        return
                    stopped[i] = 1
                    nextval = bufs[i][n % lens[i]]
                else:
                    anynew = 1
                    bufs[i].append(nextval)
                    lens[i] += 1
            nexts[i] = nextval
        if anynew:
            n += 1
            yield tuple(nexts)
        else:
            break

wanted = reduce(lambda x, y: x*y, lens, 1)
    if n >= wanted:
        assert n == wanted
        return
    ixs = list(enumerate(lens))
    ixs.sort(key=lambda x: x[1])
    ixs = [ix for (ix, ln) in ixs]
    jxs = [0] * la
    seen = dict([(tuple([j % lens[i] for i in ixs]), 1)
                 for j in range(n)])

while n < wanted:
        t = tuple([jxs[i] for i in ixs])
        if t not in seen:
            yield tuple([bufs[i][jxs[i]] for i in range(la)])
            n += 1

for i in ixs:
            j = jxs[i]
            j = (j + 1) % lens[i]
            jxs[i] = j
            if j != 0:
                break

def test_iterpermute():
    import itertools
    repeat = itertools.repeat
    assert list(iterpermute()) == [()]
    assert list(iterpermute(repeat(1, 2))) == [(1,), (1,)]
    assert list(iterpermute(repeat(1, 1), repeat(2, 1))) == [(1, 2)]
    assert list(iterpermute(list(range(0, 2)), list(range(2, 3)))) == [
        (0, 2), (1, 2)]
    assert list(iterpermute(list(range(0, 2)), list(range(2, 4)))) == [
        (0, 2), (1, 3), (1, 2), (0, 3)]
    print(list(iterpermute(list(range(0, 2)), list(range(0, 3)))))
    print(list(iterpermute(list(range(0, 3)), list(range(0, 2)))))

if __name__ == '__main__':
    test_iterpermute()

Exit & Reset Text mode: syntax highlighting auto-detects file type.

Name	Size	Perms	Modified	Actions
__pycache__ DIR	-	drwxr-xr-x	2026-02-06 08:01:57	Edit Download recursive recursive
Cat.py	3.99 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
cmd.py	14.72 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
Code.py	1.03 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
Descriptor.py	903 B	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
etc.py	1.66 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
FSA.py	7.20 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
Glue.py	13.68 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
Help.py	6.71 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
IterPermute.py	2.22 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
KanExtension.py	20.71 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
KnuthBendix.py	8.81 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
RE.py	23.59 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
RE_Rect.py	10.39 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
textView.py	3.07 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
tkcursors.py	2.13 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
xterm.py	2.31 KB	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive
__init__.py	87 B	lrw-r--r--	2026-01-20 13:01:48	Edit Download recursive recursive

Directory Contents