def _chars(self, token):
return 'U:{}'.format(uniqchars(len(token)))
def combochars(max_chars, segments):
chars = uniqchars(max_chars)
return permutations(chars, segments)
if length < segments:
length = segments
return [[_ for _ in combochars(n, segments)] for n in range(2, length)]
def cartesian(max_chars, max_nums, unique=False):
res = [''.join(prod[0]) for prod in product(
combochars(max_chars, 2), range(0, max_nums))]
if unique:
return list(set(res))
else:
return res
if __name__ == '__main__':
with Section('Combinatorics'):
prnt('Unique chars', uniqchars(10))
fact = factorial(12)
prnt('Final factorial amount:', fact[0])
ppr(fact[1])
combos = combochars(4, 2)
prnt('Permutations of random letters', ', '.join(
[''.join(combo) for combo in combos]))
prnt(
'Combinations of multiple permutations of random letters',
group_combochars(6, segments=2))
prnt('Cartesian product of two sets', cartesian(4, 4))
prnt(
'Cartesian product of two sets (unique)',
cartesian(4, 4, unique=True))
def combochars(max_chars, segments):
chars = uniqchars(max_chars)
return permutations(chars, segments)
if length < segments:
length = segments
return [[_ for _ in combochars(n, segments)] for n in range(2, length)]
def cartesian(max_chars, max_nums, unique=False):
res = [
''.join(prod[0])
for prod in product(combochars(max_chars, 2), range(0, max_nums))
]
if unique:
return list(set(res))
else:
return res
if __name__ == '__main__':
with Section('Combinatorics'):
prnt('Unique chars', uniqchars(10))
fact = factorial(12)
prnt('Final factorial amount:', fact[0])
ppr(fact[1])
combos = combochars(4, 2)
prnt('Permutations of random letters',
', '.join([''.join(combo) for combo in combos]))
prnt('Combinations of multiple permutations of random letters',
group_combochars(6, segments=2))
prnt('Cartesian product of two sets', cartesian(4, 4))
prnt('Cartesian product of two sets (unique)',
cartesian(4, 4, unique=True))
def _chars(self, token):
return 'U:{}'.format(uniqchars(len(token)))
