The input iterator.
https://docs.python.org/3/library/itertools.html#itertools.permutations for more info.
Returns all successive size length permutations of the input iterator. The permutations are emitted in lexicographic
ordering according to input. So if input is sorted, the permutations will be in sorted order.
Elements in the permutations are treated as unique based on their position in the iterator, not on their value. So
if the input iterator is unique, then there will be no repeat values.
The size of each permutation, must be greater than 0 and less than or equal to the length of the input
https://docs.python.org/3/library/itertools.html#itertools.permutations for more info.
Returns all successive size length permutations of the input iterator. The permutations are emitted in lexicographic
ordering according to input. So if input is sorted, the permutations will be in sorted order.
Elements in the permutations are treated as unique based on their position in the iterator, not on their value. So
if the input iterator is unique, then there will be no repeat values.
https://docs.python.org/3/library/itertools.html#itertools.permutations for more info.
Returns all successive
sizelength permutations of the input iterator. The permutations are emitted in lexicographic ordering according to input. So if input is sorted, the permutations will be in sorted order. Elements in the permutations are treated as unique based on their position in the iterator, not on their value. So if the input iterator is unique, then there will be no repeat values.