def test_even(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertEqual(perm1.is_even() == perm2.is_even(),
(perm1 * perm2).is_even())
self.assertEqual(perm1.is_even() == perm2.is_even(),
(perm2 * perm1).is_even())
def test_inverse(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
identity = curver.kernel.Permutation.from_index(len(perm1), 0)
self.assertEqual(~(~perm1), perm1)
self.assertEqual(perm1 * ~perm1, identity)
self.assertEqual(~perm1 * perm1, identity)
self.assertEqual(~(perm1 * perm2), ~perm2 * ~perm1)
def test_inverse(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
identity = flipper.kernel.permutation.id_permutation(len(perm1))
self.assertEqual(~(~perm1), perm1)
self.assertEqual(perm1 * ~perm1, identity)
self.assertEqual(~perm1 * perm1, identity)
self.assertEqual(~(perm1 * perm2), ~perm2 * ~perm1)
class TestPermutation(unittest.TestCase):
def assertEqualArray(self, M, N):
self.assertTrue(np.array_equal(M, N),
msg='AssertionError: %s != %s' % (M, N))
@given(strategies.permutations())
def test_pickle(self, perm):
self.assertEqual(perm, pickle.loads(pickle.dumps(perm)))
@given(st.data())
def test_hash(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertTrue(perm1 != perm2 or hash(perm1) == hash(perm2))
@given(strategies.permutations())
def test_equal(self, perm):
self.assertEqual(perm, perm)
@given(st.data())
def test_inverse(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
identity = flipper.kernel.permutation.id_permutation(len(perm1))
self.assertEqual(~(~perm1), perm1)
self.assertEqual(perm1 * ~perm1, identity)
self.assertEqual(~perm1 * perm1, identity)
self.assertEqual(~(perm1 * perm2), ~perm2 * ~perm1)
@given(st.data())
def test_powers(self, data):
perm = data.draw(strategies.permutations())
power = data.draw(st.integers())
self.assertEqual(perm**power, (~perm)**(-power))
power = data.draw(st.integers(
min_value=0)) # Numpy doesn't like inverting integer matrices.
self.assertEqualArray((perm.matrix())**power, (perm**power).matrix())
@given(strategies.permutations())
def test_involution(self, perm):
self.assertTrue(perm.order() <= 2 or perm != perm.inverse())
@given(st.data())
def test_even(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertEqual(perm1.is_even() == perm2.is_even(),
(perm1 * perm2).is_even())
self.assertEqual(perm1.is_even() == perm2.is_even(),
(perm2 * perm1).is_even())
@given(strategies.permutations())
def test_order(self, perm):
identity = flipper.kernel.permutation.id_permutation(len(perm))
for i in range(1, perm.order()):
self.assertNotEqual(perm**i, identity)
self.assertEqual(perm**perm.order(), identity)
def test_powers(self, data):
perm = data.draw(strategies.permutations())
power = data.draw(st.integers())
self.assertEqual(perm**power, (~perm)**(-power))
power = data.draw(st.integers(
min_value=0)) # Numpy doesn't like inverting integer matrices.
self.assertEqualArray((perm.matrix())**power, (perm**power).matrix())
def test_conjugate(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertTrue(perm1.is_conjugate_to(perm2 * perm1 * ~perm2))
self.assertTrue(perm1.is_conjugate_to(~perm2 * perm1 * perm2))
def test_hash(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertImplies(perm1 == perm2, hash(perm1) == hash(perm2))
class TestPermutation(unittest.TestCase):
def assertEqualArray(self, M, N):
self.assertTrue(np.array_equal(M, N), msg='AssertionError: %s != %s' % (M, N))
def assertImplies(self, A, B):
self.assertTrue(not A or B, msg='AssertionError: %s =/=> %s' % (A, B))
@given(strategies.permutations())
def test_pickle(self, perm):
self.assertEqual(perm, pickle.loads(pickle.dumps(perm)))
@given(st.data())
def test_hash(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertImplies(perm1 == perm2, hash(perm1) == hash(perm2))
@given(strategies.permutations())
def test_from_index(self, perm):
self.assertEqual(perm, curver.kernel.Permutation.from_index(len(perm), perm.index()))
@given(strategies.permutations())
def test_equal(self, perm):
self.assertEqual(perm, perm)
@given(st.data())
def test_inverse(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
identity = curver.kernel.Permutation.from_index(len(perm1), 0)
self.assertEqual(~(~perm1), perm1)
self.assertEqual(perm1 * ~perm1, identity)
self.assertEqual(~perm1 * perm1, identity)
self.assertEqual(~(perm1 * perm2), ~perm2 * ~perm1)
@given(st.data())
def test_powers(self, data):
perm = data.draw(strategies.permutations())
power = data.draw(st.integers())
self.assertEqual(perm**power, (~perm)**(-power))
power = data.draw(st.integers(min_value=0)) # Numpy doesn't like inverting integer matrices.
self.assertEqualArray(np.linalg.matrix_power(perm.matrix(), power), (perm**power).matrix())
@given(strategies.permutations())
def test_involution(self, perm):
self.assertImplies(perm.order() > 2, perm != ~perm)
@given(st.data())
def test_even(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertEqual(perm1.is_even() == perm2.is_even(), (perm1 * perm2).is_even())
self.assertEqual(perm1.is_even() == perm2.is_even(), (perm2 * perm1).is_even())
@given(strategies.permutations())
def test_order(self, perm):
identity = curver.kernel.Permutation.from_index(len(perm), 0)
for i in range(1, perm.order()):
self.assertNotEqual(perm**i, identity)
self.assertEqual(perm**perm.order(), identity)
@given(st.data())
def test_conjugate(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertTrue(perm1.is_conjugate_to(perm2 * perm1 * ~perm2))
self.assertTrue(perm1.is_conjugate_to(~perm2 * perm1 * perm2))
def test_hash(self, data):
perm1 = data.draw(strategies.permutations())
perm2 = data.draw(strategies.permutations(len(perm1)))
self.assertTrue(perm1 != perm2 or hash(perm1) == hash(perm2))
