mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
46 lines
1.3 KiB
Python
46 lines
1.3 KiB
Python
from nose.tools import assert_equal
|
|
from nose.tools import raises
|
|
|
|
|
|
class TestStacks(object):
|
|
|
|
@raises(Exception)
|
|
def test_pop_on_empty(self, num_stacks, stack_size):
|
|
print('Test: Pop on empty stack')
|
|
stacks = Stacks(num_stacks, stack_size)
|
|
stacks.pop(0)
|
|
|
|
@raises(Exception)
|
|
def test_push_on_full(self, num_stacks, stack_size):
|
|
print('Test: Push to full stack')
|
|
stacks = Stacks(num_stacks, stack_size)
|
|
for i in xrange(0, stack_size):
|
|
stacks.push(2, i)
|
|
stacks.push(2, stack_size)
|
|
|
|
def test_stacks(self, num_stacks, stack_size):
|
|
print('Test: Push to non-full stack')
|
|
stacks = Stacks(num_stacks, stack_size)
|
|
stacks.push(0, 1)
|
|
stacks.push(0, 2)
|
|
stacks.push(1, 3)
|
|
stacks.push(2, 4)
|
|
|
|
print('Test: Pop on non-empty stack')
|
|
assert_equal(stacks.pop(0), 2)
|
|
assert_equal(stacks.pop(0), 1)
|
|
assert_equal(stacks.pop(1), 3)
|
|
assert_equal(stacks.pop(2), 4)
|
|
|
|
print('Success: test_stacks\n')
|
|
|
|
def main():
|
|
num_stacks = 3
|
|
stack_size = 100
|
|
test = TestStacks()
|
|
test.test_pop_on_empty(num_stacks, stack_size)
|
|
test.test_push_on_full(num_stacks, stack_size)
|
|
test.test_stacks(num_stacks, stack_size)
|
|
|
|
if __name__ == '__main__':
|
|
main() |