Python generate_cyclic_permutation Examples

Example #1

 def test_if_input_is_0_then_it_must_return_valid(self):
     expected = [0]
     actual = leonhard.generate_cyclic_permutation(0)
     self.assertEqual(expected, actual)

Example #2

 def test_if_input_is_123_then_it_must_return_valid(self):
     expected = [123, 312, 231]
     actual = leonhard.generate_cyclic_permutation(123)
     self.assertEqual(expected, actual)

Example #3

 def test_if_input_are_letters_then_it_must_raise_a_type_error(self):
     with self.assertRaises(TypeError):
         leonhard.generate_cyclic_permutation('a')

Example #4

 def test_if_input_is_less_than_0_then_it_must_raise_a_value_error(self):
     with self.assertRaises(ValueError):
         leonhard.generate_cyclic_permutation(-1)

Example #5

File: leonhard_samples.py Project: migzpogi/leonhard

# [0, 1, 1, 2, 3]
print(leonhard.generate_fibonacci_sequence(5))

# Fibonacci sequence with 5 terms, starting with 3 and 6
# [3, 6, 9, 15, 24]
print(leonhard.generate_fibonacci_sequence(5, 3, 6))

# 600851475143 is not prime
print(leonhard.is_prime(600851475143))

# 7652413 is prime
print(leonhard.is_prime(7652413))

# Is a Pythagorean triplet
print(leonhard.is_pythagorean_triplet(3, 4, 5))

# Is not a Pythagorean triplet
print(leonhard.is_pythagorean_triplet(1, 2, 3))

# Number of digits is 3
print(leonhard.count_digits(256))

# Collatz sequence
print(leonhard.generate_collatz_sequence(10, []))

# Cyclic permutation
print(leonhard.generate_cyclic_permutation(123))

# Triangle numbers
print(leonhard.is_triangle_number(3))
print(leonhard.is_triangle_number(4))