Template:Studies of Euler diagrams/transformations/dakota tinora/dh

This code is part of a Python library called discrete helpers, which is not yet published. from discretehelpers.sig_perm import SigPerm from discretehelpers.boolf.examples import dakota, tinora dakota_clan = dakota.ec_clan() dakota_clan.get_block_from_label(tinora) == [(6, 3)] sigperm = SigPerm(pair=(6, 3)) assert sigperm.sequence_string(4) == '(~2, 0, ~1, 3)' assert sigperm.inverse.sequence_string(4) == '(1, ~2, ~0, 3)' assert dakota.apply_sigperm([~2, 0, ~1, 3]) == dakota.apply(~2, 0, ~1, 3) == tinora assert tinora.apply_sigperm([1, ~2, ~0, 3]) == tinora.apply(1, ~2, ~0, 3) == dakota map of spots fullspots_map = dict() for fs in dakota.fullspots: fullspots_map[fs] = sigperm.apply_on_natural_number(fs) assert fullspots_map == { 0: 6, 1: 2, 2: 7, 3: 3, 4: 4, 6: 5, 7: 1, 8: 14, 9: 10 }