Files
interactive-coding-challenges/stacks_queues/set_of_stacks/test_set_of_stacks.py
Donne Martin 7f338b0e64 Polish set of stacks challenge and solution (#73)
Update constraints, algorithm discussion, and code.
2016-06-21 05:30:14 -04:00

36 lines
845 B
Python

from nose.tools import assert_equal
class TestSetOfStacks(object):
def test_set_of_stacks(self):
print('Test: Push on an empty stack')
stacks = SetOfStacks(indiv_stack_capacity=2)
stacks.push(3)
print('Test: Push on a non-empty stack')
stacks.push(5)
print('Test: Push on a capacity stack to create a new one')
stacks.push('a')
print('Test: Pop on a stack to destroy it')
assert_equal(stacks.pop(), 'a')
print('Test: Pop general case')
assert_equal(stacks.pop(), 5)
assert_equal(stacks.pop(), 3)
print('Test: Pop on no elements')
assert_equal(stacks.pop(), None)
print('Success: test_set_of_stacks')
def main():
test = TestSetOfStacks()
test.test_set_of_stacks()
if __name__ == '__main__':
main()