Pattern: PPermut
Generate every permutation of count input items.
Example output
>>> p = PPermut(PSeq([ 1, 11, 111, 1111 ]), 4)
>>> p.nextn(16)
[1, 11, 111, 1111, 1, 11, 1111, 111, 1, 111, 11, 1111, 1, 111, 1111, 11]
Generate every permutation of count input items.
>>> p = PPermut(PSeq([ 1, 11, 111, 1111 ]), 4)
>>> p.nextn(16)
[1, 11, 111, 1111, 1, 11, 1111, 111, 1, 111, 11, 1111, 1, 111, 1111, 11]