def yield_all_permutations_of_sequence_in_orbit(sequence, permutation):
'''Yield all permutations of `sequence` in orbit of `permutation` in lex order:
::
>>> list(sequencetools.yield_all_permutations_of_sequence_in_orbit(
... (1, 2, 3, 4), [1, 2, 3, 0]))
[(1, 2, 3, 4), (2, 3, 4, 1), (3, 4, 1, 2), (4, 1, 2, 3)]
Returns generator of `sequence` objects.
'''
from abjad.tools import sequencetools
if not sequencetools.is_permutation(permutation, len(sequence)):
args = (str(permutation), len(sequence))
raise TypeError('"%s" must be permutation of length %s.' % args)
# return identity first #
next_permutation = sequencetools.permute_sequence(sequence, range(len(sequence)))
yield next_permutation
# then return remaining permutations in orbit of permutation #
while True:
next_permutation = sequencetools.permute_sequence(next_permutation, permutation)
if next_permutation == sequence:
break
else:
yield next_permutation
def test_sequencetools_is_permutation_01():
assert sequencetools.is_permutation([3, 0, 1, 2])
assert sequencetools.is_permutation([2, 3, 0, 1])
assert sequencetools.is_permutation([0, 1, 2, 3])
def test_sequencetools_is_permutation_03():
assert sequencetools.is_permutation([3, 0, 1, 2], length=4)
assert not sequencetools.is_permutation([3, 0, 1, 2], length=3)
assert not sequencetools.is_permutation([3, 0, 1, 2], length=5)
def test_sequencetools_is_permutation_02():
assert not sequencetools.is_permutation([0, 0, 1, 2])
assert not sequencetools.is_permutation('foo')
assert not sequencetools.is_permutation(7)
