interactive-coding-challenges/recursion_dynamic/hanoi/test_hanoi.py
Donne Martin 430cca2a01 Update hanoi challenge (#121)
Update constraints and test cases.  Move implementation to a class.  Update tests.
2016-11-19 09:01:44 -05:00

41 lines
1009 B
Python

from nose.tools import assert_equal, assert_raises
class TestHanoi(object):
def test_hanoi(self):
hanoi = Hanoi()
num_disks = 3
src = Stack()
buff = Stack()
dest = Stack()
print('Test: None towers')
assert_raises(TypeError, hanoi.move_disks, num_disks, None, None, None)
print('Test: 0 disks')
hanoi.move_disks(num_disks, src, dest, buff)
assert_equal(dest.pop(), None)
print('Test: 1 disk')
src.push(5)
hanoi.move_disks(num_disks, src, dest, buff)
assert_equal(dest.pop(), 5)
print('Test: 2 or more disks')
for disk_index in range(num_disks, -1, -1):
src.push(disk_index)
hanoi.move_disks(num_disks, src, dest, buff)
for disk_index in range(0, num_disks):
assert_equal(dest.pop(), disk_index)
print('Success: test_hanoi')
def main():
test = TestHanoi()
test.test_hanoi()
if __name__ == '__main__':
main()