class TestStack(unittest.TestCase):
def setUp(self):
self.stack = Stack()
def tearDown(self):
self.stack = None
def test_push(self):
self.stack.push("foo")
self.assertTrue(self.stack.stack.head.data == "foo")
self.assertTrue(self.stack.stack.head.next is None)
self.stack.push("bar")
self.assertTrue(self.stack.stack.head.data == "bar")
self.assertTrue(self.stack.stack.head.next.data == "foo")
def test_pop(self):
self.stack.push("foo")
self.stack.push("bar")
self.assertTrue(self.stack.stack.head.data == "bar")
self.assertTrue(self.stack.stack.head.next.data == "foo")
self.stack.pop()
self.assertTrue(self.stack.stack.head.data == "foo")
self.assertTrue(self.stack.stack.head.next is None)
def testStack():
'''
Here we test algorithms for stacks
We test pushing, popping, and checking if
a stack is empty
Stack is implemented as a python list
It's not the best implementation as we'll
show that the stack will be empty yet it
will be occupying memory with the previously
inserted elements
'''
print('Create an empty stack')
s = Stack()
print('Pop now')
print('Topmost element: ' + str(s.pop()))
print('Insert 5')
s.push(5)
print('Insert 3')
s.push(3)
print('Insert 4')
s.push(4)
print('Is stack empty: ' + str(s.isempty()))
print('Position of top: ' + str(s.top))
print('Pop now')
print('Topmost element: ' + str(s.pop()))
print('Pop now')
print('Topmost element: ' + str(s.pop()))
print('Pop now')
print('Topmost element: ' + str(s.pop()))
print('Pop now')
print('Topmost element: ' + str(s.pop()))
print('Stack in the memory')
print(s.storage)
def test():
s = Stack()
assert s.is_empty() is True
s.push(4)
assert s.items == [4]
s.push("dog")
assert s.items == [4, "dog"]
assert s.peek() == "dog"
s.push(True)
assert s.items == [4, "dog", True]
assert s.size() == 3
assert s.is_empty() is False
s.push(8.4)
assert s.items == [4, "dog", True, 8.4]
assert s.pop() == 8.4
assert s.pop() is True
assert s.size() == 2
class TestStack(unittest.TestCase):
def setUp(self):
self.stack = Stack()
def tearDown(self):
del self.stack
def test_push_pop_peek(self):
values = [10, 20, 30, 40, 50]
for value in values:
self.stack.push(value)
self.assertEqual(len(values), self.stack.size())
values.reverse()
for value in values:
self.assertEqual(value, self.stack.peek())
self.assertEqual(value, self.stack.pop())
def test_pop(self):
self.stack.push(10)
self.assertEqual(1, self.stack.size())
self.assertEqual(10, self.stack.pop())
self.assertEqual(0, self.stack.size())
def test_peek(self):
self.stack.push(10)
self.assertEqual(1, self.stack.size())
self.assertEqual(10, self.stack.peek())
self.assertEqual(1, self.stack.size())
def test_pop_empty(self):
self.assertIsNone(self.stack.pop())
def test_peek_empty(self):
self.assertIsNone(self.stack.peek())
def dummyFunc(opcode: Opcode, bytecode: bc.Bytecode, stack: st.Stack):
if opcode.consume > 0:
stack.pop(opcode.consume, type_hint_constants.ANY)
if opcode.produce > 0:
import time
stack.push(str(int(time.time())))
def dummyFunc(opcode: Opcode, bytecode: bc.Bytecode, stack: st.Stack):
if opcode.consume > 0:
stack.pop(opcode.consume, type_hint_constants.ANY)
if opcode.produce > 0:
import time
stack.push(str(int(time.time())))
def test_size(self):
s = Stack(10)
s.push(10)
s.push(20)
assert s.size == 2
s.pop()
s.pop()
assert s.size == 0
def test_pop(self):
s = Stack()
value = s.pop()
self.assertIsNone(value, 'should return None from empty stack')
s.push(1)
value = s.pop()
self.assertEqual(value, 1, 'should return the stack value')
self.assertEqual(s.pop(), None, 'should remain an empty stack')
def test_exceptions(self):
with self.assertRaises(StackUnderflowException):
s = Stack(1)
s.pop()
with self.assertRaises(StackOverflowException):
s = Stack(1)
s.push(10)
s.push(20)
def test_pop(self):
s = Stack()
value = s.pop()
self.assertIsNone(value, 'should return None from empty stack')
s.push(1)
value = s.pop()
self.assertEqual(value, 1, 'should return the stack value')
self.assertEqual(s.pop(), None, 'should remain an empty stack')
def test_pop(self):
s = Stack(10)
s.push(20)
s.push(10)
value = s.pop()
assert value == 10
assert s.top.value == 20
assert s.top.next == None
s.pop()
assert s.top == None
class CalculatorTest(unittest.TestCase):
"""unitetestモジュールの簡単な実行例その2。"""
@classmethod
def setUpClass(cls):
pass
@classmethod
def tearDownClass(cls):
pass
def setUp(self):
self._stack = Stack()
def tearDown(self):
pass
def test_is_empty(self):
self.assertTrue(self._stack.is_empty())
self._stack.push(1)
self.assertFalse(self._stack.is_empty())
def test_size(self):
self.assertEqual(0, self._stack.size())
self._stack.push(1)
self.assertEqual(1, self._stack.size())
def test_push(self):
self._stack.push(1)
self.assertEqual(1, self._stack.top())
def test_pop(self):
self._stack.push(1)
self.assertEqual(1, self._stack.pop())
self.assertEqual(0, self._stack.size())
with self.assertRaises(IndexError):
self._stack.pop()
def test_top(self):
self._stack.push(1)
self.assertEqual(1, self._stack.top())
self.assertEqual(1, self._stack.size())
self._stack.pop()
with self.assertRaises(IndexError):
self._stack.top()
def test_pop_with_full_stack():
stack = Stack([2, 4, 1, 4020])
expected = 4020
output = stack.pop()
assert output == expected
assert stack.stack[-1] == 1
def validate_brackets(sentence):
brackets = Stack()
for char in sentence:
if char == '(':
brackets.push(True)
elif char == ')':
if brackets.pop() is not True:
return False
return brackets.size() == 0
def proper_parens(str):
"""Return 0 if string of parens is balanced, 1 if open and -1 if broken."""
stack = Stack()
for i in str:
if i is '(':
stack.push(i)
print('data', stack._container.head.data)
elif i is ')':
try:
stack.pop()
except IndexError:
return -1
if stack._container.head:
return 1
return 0
def test_stack_pop_top(self):
stack = Stack()
self.assertTrue(stack.empty())
stack.push(1)
self.assertFalse(stack.empty())
self.assertEqual(stack.top(), 1)
stack.push(2)
self.assertEqual(stack.top(), 2)
stack.push(3)
self.assertEqual(stack.top(), 3)
self.assertEqual(stack.__str__(), "Stack[3, 2, 1]")
self.assertEqual(stack.pop(), 3)
self.assertEqual(stack.pop(), 2)
self.assertEqual(stack.pop(), 1)
self.assertTrue(stack.empty())
def sort_stack(stack):
buffer_stack = Stack()
while(not stack.is_empty()):
value = stack.pop()
if(buffer_stack.is_empty):
buffer_stack.push(value)
else:
if(not buffer_stack.is_empty()):
while(buffer_stack.peek() > value):
temp = buffer_stack.pop()
stack.push(temp)
else:
buffer_stack.push(value)
return buffer_stack
def calculate(self, expr):
result = Stack()
elements = self.expr_to_stack(expr)
while elements.size() > 0:
element = elements.pop()
# If passed operator "=", then we return value from result buffer
if element == '=':
return result.pop()
# If passed number, then add it to result buffer
if isinstance(element, int):
result.push(element)
# If passed another operator, then calculate
if element in self.allowed_operators: # If size >= 2
y = result.pop()
x = result.pop()
value = self.allowed_operators[element](
x, y) # Pass params in reverted direction
result.push(value)
return result.pop()
def calculate_span(stock_price: list):
if len(stock_price) == 0:
raise ValueError("The list cannot be an empty list")
if not isinstance(stock_price, list):
raise ValueError("The `stocks_prices` must be a list")
if not all([isinstance(i, int) for i in stock_price]):
raise ValueError("All values must be integers")
s = Stack(len(stock_price) + 1)
s.push(0)
span = [0] * len(stock_price)
for idx, i in enumerate(stock_price):
while not s.empty() and stock_price[s.top.value] <= i:
v = s.pop()
if (s.empty()):
span[idx] = idx + 1
else:
span[idx] = idx - s.top.value
s.push(idx)
return span
def test_len(self):
s = Stack()
self.assertEqual(len(s), 0, 'no elements yet')
s.push(1)
self.assertEqual(len(s), 1, 'one element')
s.push(2)
self.assertEqual(len(s), 2, 'two elements')
s.pop()
self.assertEqual(len(s), 1, 'one element left')
s.pop()
self.assertEqual(len(s), 0, 'no elements left')
s.pop()
self.assertEqual(len(s), 0, 'still no elements left')
def test_len(self):
s = Stack()
self.assertEqual(len(s), 0, 'no elements yet')
s.push(1)
self.assertEqual(len(s), 1, 'one element')
s.push(2)
self.assertEqual(len(s), 2, 'two elements')
s.pop()
self.assertEqual(len(s), 1, 'one element left')
s.pop()
self.assertEqual(len(s), 0, 'no elements left')
s.pop()
self.assertEqual(len(s), 0, 'still no elements left')
def generate(self, z, sample, max_length):
"""Generate a valid expression from z using the decoder"""
logits_all = self.decoder(z, max_length=max_length).squeeze()
rules_all = []
for logits in logits_all:
t = 0
stack = Stack(grammar=GCFG, start_symbol=START)
rules = []
while stack.nonempty:
alpha = stack.pop()
print(alpha)
mask = get_mask(alpha, stack.grammar, as_variable=True)
probs = mask * logits[t].exp()
probs = probs / probs.sum()
if sample:
m = Categorical(probs)
i = m.sample()
else:
_, i = probs.max(-1) # argmax
# convert PyTorch Variable to regular integer
i = i.item()
# select rule i
rule = stack.grammar.productions()[i]
rules.append(rule)
# add rhs nonterminals to stack in reversed order
for symbol in reversed(rule.rhs()):
if isinstance(symbol, Nonterminal):
stack.push(symbol)
t += 1
if t == max_length:
break
rules_all.append(rules)
# if len(rules) < 15:
# pad = [stack.grammar.productions()[-1]]
return rules_all
def test_pop():
"""Test pop."""
s = Stack()
s.push(3)
assert s.pop() == 3
def filter_tokens(self):
"""
Requests tokens from the lexer and adds INDENT and DEDENT
to the stream where relevant.
:return: filtered token
:raise: VykingIndentationError
"""
# Vyking has 3 indentation states.
# - no colon hence no need to indent
# - COLON was read, next rule must be a single line statement
# or a block statement
# - NEWLINE was read after a colon, user must indent
BOF = 0 # Beginnig of file
NO_INDENT = 1
MAY_INDENT = 2 # COLON was read
MUST_INDENT = 3 # COLON and NEWLINE were read
# Stack storing indentation levels met
levels = Stack()
levels.push(0)
state = BOF
# helper function
def need_DEDENT(token):
"""Returns True if DEDENT is needed"""
if token.value > levels.read():
raise VykingIndentationError(
token.lineno,
"indentation level is too high.\n"
" \tHint: check for missing colon or mismatch in indentation level.",
)
else:
return token.value < levels.read()
for token in self.lexer:
# ignore NEWLINEs at beginning of input
if state == BOF:
if token.type == "NEWLINE":
continue
else:
state = NO_INDENT
if state == NO_INDENT:
if token.type == "COLON":
state = MAY_INDENT
yield token
elif token.type == "WS":
while need_DEDENT(token):
levels.pop()
yield self._DEDENT(token.lineno - 1)
else:
yield token
elif state == MAY_INDENT:
if token.type == "NEWLINE":
state = MUST_INDENT
else:
state = NO_INDENT
yield token
else: # MUST_INDENT
if token.type == "WS" and token.value > levels.read():
# Store new indentation level
levels.push(token.value)
state = NO_INDENT
yield self._INDENT(token.lineno)
else:
raise VykingIndentationError(token.lineno, "Expected indentation")
# Yield DEDENTs at end of input
while levels.pop() != 0:
yield self._DEDENT(self.get_lineno())
yield self._new_token("ENDMARKER", self.get_lineno())
yield None
class TestStack(unittest.TestCase):
def setUp(self) -> None:
self.stack = Stack()
def test_pop(self) -> None:
self.stack.stack = [1]
self.assertEqual(self.stack.pop(), 1)
self.assertEqual(self.stack.stack, [])
self.stack.stack = []
self.assertIsNone(self.stack.pop())
self.assertEqual(self.stack.stack, [])
self.stack.stack = [1, 2, 3]
self.assertEqual(self.stack.pop(), 3)
self.assertEqual(self.stack.stack, [1, 2])
def test_push(self) -> None:
self.stack.push(1)
self.assertEqual(self.stack.stack, [1])
self.stack.push(2.0)
self.assertEqual(self.stack.stack, [1, 2.0])
self.stack.push("3")
self.assertEqual(self.stack.stack, [1, 2.0, "3"])
def test_peek(self) -> None:
self.assertIsNone(self.stack.peek())
self.stack.stack = [1]
self.assertEqual(self.stack.peek(), 1)
self.stack.stack = [1, 2, 3]
self.assertEqual(self.stack.peek(), 3)
self.assertEqual(self.stack.stack, [1, 2, 3])
def test_search(self) -> None:
self.assertIsNone(self.stack.search(1))
self.stack.stack = [1]
self.assertEqual(self.stack.search(1), 1)
self.stack.stack = [1, 2, 3]
self.assertEqual(self.stack.search(1), 3)
self.assertEqual(self.stack.search(2), 2)
self.assertEqual(self.stack.search(3), 1)
def test_is_empty(self) -> None:
self.assertTrue(self.stack.is_empty())
self.stack.stack = [1]
self.assertFalse(self.stack.is_empty())
self.stack.stack = [1, 2, 3]
self.assertFalse(self.stack.is_empty())
def test_clear(self) -> None:
self.stack.stack = [1, 2, 3]
self.stack.clear()
self.assertEqual(self.stack.stack, [])
def test___str__(self) -> None:
self.stack.stack = [1, 2, 3]
self.assertEqual(self.stack.__str__(), "[1, 2, 3]")
def test___len__(self) -> None:
self.stack.stack = [1, 2, 3]
self.assertEqual(len(self.stack), 3)
def test_big_test(self) -> None:
test_case = 100_000
for i in range(test_case):
self.stack.push(i)
for i in reversed(range(test_case)):
self.assertEqual(self.stack.pop(), i)
self.assertIsNone(self.stack.pop())
def test_repr(self) -> None:
for i in range(6):
self.stack.push(i)
self.assertEqual(self.stack.__repr__(), "Stack [0, 1, 2, 3, 4, 5]")
self.stack.push(6)
self.assertEqual(self.stack.__repr__(),
"Stack [0, 1, 2, 3, 4, 5, ...]")
class StackMachine:
"""Implementation of virtual stack machine."""
def __init__(self, text: str):
# Data stack (main stack for operations).
self.__ds = Stack()
# Return stack (supports procedures work).
self.__rs = Stack()
# Instruction pointer.
self.__iptr = 0
# Input text parsed into list of values and instructions.
self.__code_list = list(self.parse(text))
# Storage for variables. Mapping names of vars to their values.
self.__heap = dict()
# Storage for procedures.
self.__procedures = dict()
# Mapping operations in our language to functions that perform the necessary business logic.
self.__valid_operations = {
'+': self.sum,
'-': self.sub,
'*': self.mult,
'/': self.div,
'%': self.mod,
'!': self.fact,
'==': self.equal,
'>': self.greater,
'<': self.less,
'and': self.operator_and,
'or': self.operator_or,
'cast_int': self.cast_int,
'cast_str': self.cast_str,
'drop': self.drop,
'over': self.over,
'dup': self.dup,
'if': self.operator_if,
'jmp': self.jump,
'stack': self.output_stack,
'swap': self.swap,
'print': self.print,
'println': self.println,
'read': self.read,
'call': self.call,
'return': self.ret,
'exit': self.exit,
'store': self.store,
'load': self.load,
}
def compile(self):
"""
When "compiling", we need to do the following:
1. separate procedures from the rest of the code (temp dict self._procedures);
2. go through the code inside the procedures, replace procedures with <procedure_address> 'call';
3. go through the 'main'-code, replace procedures with <procedure_address_> 'call';
4. add an 'exit' instruction to the end of the 'main' code;
5. add the procedure code to the end of the resulting code, save the addresses;
6. go through the resulting code, replace all procedure names with their addresses;
"""
# Step 1. Save all procedures in special dict (self._procedures).
for ptr in range(len(self.__code_list)):
if self.__code_list[ptr] == ':':
# All procedures have the following form:
# : <procedure_name> <instr_1> <instr_2> ... <instr_N> ;
procedure_name = self.__code_list[ptr + 1]
ptr += 2
procedure_code = []
while self.__code_list[ptr] != ';':
procedure_code.append(self.__code_list[ptr])
ptr += 1
# For the specified procedure_name, we set a list of instructions.
# Then the address of the procedure will be the hash of the key in the dict.
self.__procedures[procedure_name] = procedure_code
# Cut the procedures from the course code.
while self.__code_list.count(':') != 0:
ind = self.__code_list.index(':')
last_ind = self.__code_list.index(';')
self.__code_list = self.__code_list[:ind] + self.__code_list[
last_ind + 1:]
# Step 2. Replace procedures with <procedure_address> 'call' in procedures' code.
for procedure_name, procedure_code in self.__procedures.items():
# Check that at least one procedure in code.
if any([p in procedure_code for p in self.__procedures.keys()]):
i = 0
while i != (len(self.__procedures[procedure_name]) - 1):
if procedure_code[i] in self.__procedures:
i += 1
# Replace procedure_name to address of procedure (hash in our dict) and 'call'.
code_copy = procedure_code[:i] + [
'call'
] + procedure_code[i:]
self.__procedures[procedure_name] = code_copy
i += 1
# Step 3. Replace procedures with <procedure_address> 'call' in main-code.
if any([p in self.__code_list for p in self.__procedures.keys()]):
i = 0
while i != (len(self.__code_list) - 1):
if self.__code_list[i] in self.__procedures:
i += 1
# Replace procedure_name to address of procedure (hash in our dict) and 'call'.
code_copy = self.__code_list[:i] + [
'call'
] + self.__code_list[i:]
self.__code_list = code_copy
i += 1
if self.__procedures:
# Step 4. Add an 'exit' instruction.
self.__code_list.append('exit')
# Step 5. Add the procedures code at the end of 'main'-code.
for procedure_name, procedure_code in self.__procedures.items():
# Address of future procedure.
address = len(self.__code_list)
for opcode in procedure_code:
self.__code_list.append(opcode)
self.__code_list.append('return')
self.__procedures[procedure_name] = address
# Step 6. Change procedures' names to their addresses.
for i in range(len(self.__code_list)):
if self.__code_list[i] in self.__procedures:
self.__code_list[i] = self.__procedures[
self.__code_list[i]]
def launch(self):
"""Launching the stack machine."""
self.compile()
print("Compile Result: " + str(self.get_compile_result()))
while self.__iptr < len(self.__code_list):
current = self.__code_list[self.__iptr]
# Go to next instruction.
self.__iptr += 1
if isinstance(current, int):
# Put number on data stack.
self.__ds.push(current)
elif isinstance(current, str) and (
(current[0] == current[len(current) - 1] == '"') or
(current[0] == current[len(current) - 1] == "'")):
# Put message on data stack.
self.__ds.push(current[1:len(current) - 1])
elif current in self.__valid_operations:
# Run the instruction.
self.__valid_operations[current]()
else:
raise InvalidInstructionException(
str(current) +
" is invalid instruction or type for stack machine.")
def parse(self, text: str):
"""Parsing the source code to instructions list for machine."""
stream = io.StringIO(text)
tokens = tokenize.generate_tokens(stream.readline)
# For comments deleting.
comment_flag = False
for toknum, tokval, _, _, _ in tokens:
if toknum == tokenize.NUMBER:
if not comment_flag:
yield int(tokval)
elif toknum == tokenize.NEWLINE or toknum == 58 or tokval == ' ': # '\n'
if comment_flag:
comment_flag = False
continue
elif toknum == tokenize.ENDMARKER: # ''
if not comment_flag:
break
elif tokval == '//': # beginning of the comment
comment_flag = True
else:
if not comment_flag:
yield tokval
def get_TOS(self):
"""
:return: TOS value
"""
return self.__ds.pop()
def get_compile_result(self):
"""
:return: self.__code_list
"""
return self.__code_list
# Instructions implementation.
def sum(self):
"""Implementation of '+'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs + rhs)
def sub(self):
"""Implementation of '-'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs - rhs)
def mult(self):
"""Implementation of '*'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs * rhs)
def div(self):
"""Implementation of '/'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs / rhs)
def mod(self):
"""Implementation of '%'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs % rhs)
def fact(self):
"""Implementation of '!' (factorial function)."""
n = self.__ds.pop()
if not isinstance(n, int) or n < 0:
raise StackMachineException("Factorial does not defined for " +
str(n))
else:
if n == 0:
self.__ds.push(1)
else:
self.__ds.push(
reduce(lambda x, y: x * y, [i for i in range(1, n + 1)]))
def equal(self):
"""Implementation of '=='."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs == rhs)
def greater(self):
"""Implementation of '>'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs > rhs)
def less(self):
"""Implementation of '<'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs < rhs)
def operator_and(self):
"""Implementation of 'and'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs and rhs)
def operator_or(self):
"""Implementation of 'or'."""
rhs = self.__ds.pop()
lhs = self.__ds.pop()
self.__ds.push(lhs or rhs)
def cast_int(self):
"""Cast TOS to int."""
casted_value = int(self.__ds.pop())
self.__ds.push(casted_value)
def cast_str(self):
"""Cast TOS to str."""
casted_value = str(self.__ds.pop())
self.__ds.push(casted_value)
def drop(self):
"""Throw TOS away..."""
self.__ds.pop()
def dup(self):
"""Duplication of TOS."""
tos = self.__ds.top()
self.__ds.push(tos)
def operator_if(self):
"""Implementation if-operator."""
is_false = self.__ds.pop()
is_true = self.__ds.pop()
condition = self.__ds.pop()
if condition:
self.__ds.push(is_true)
else:
self.__ds.push(is_false)
def jump(self):
"""Jumping to pointer of instruction."""
ptr = self.__ds.pop()
if not (0 <= ptr < len(self.__code_list)):
raise OverflowError(
"Instruction jmp cannot be executed with a pointer outside the valid range."
)
self.__iptr = ptr
def output_stack(self):
"""Output the content of DS, IP and RS."""
print("Data " + self.__ds.__str__())
print("Instruction Pointer: " + str(self.__iptr))
print("Return" + self.__rs.__str__())
def swap(self):
"""Swap TOS and TOS-1."""
tos = self.__ds.pop()
tos1 = self.__ds.pop()
self.__ds.push(tos)
self.__ds.push(tos1)
def over(self):
"""
Puts the value of TOS-1 on TOS without removing it.
:example: Stack[3, 2] -> Stack[2, 3, 2]
"""
old_tos = self.__ds.pop()
old_tos1 = self.__ds.pop()
self.__ds.push(old_tos)
self.__ds.push(old_tos1)
def print(self):
"""Output the TOS."""
print(self.__ds.pop(), end=' ')
def println(self):
"""Output the TOS and switching to a new line."""
print(self.__ds.pop())
def read(self):
"""Read an input of user and put it at the TOS."""
self.__ds.push(input())
def exit(self):
"""Terminates the stack machine."""
sys.exit(0)
def ret(self):
"""Return from procedure."""
self.__iptr = self.__rs.pop()
def call(self):
"""Calling an existing procedure."""
# Store return pointer in RS.
self.__rs.push(self.__iptr)
# Jump to calling procedure.
self.jump()
def store(self):
"""Put the value of TOS-1 by the variable initialized by name of TOS."""
var_name = self.__ds.pop()
value = self.__ds.pop()
# Store pair var_name-value in heap.
self.__heap[var_name] = value
def load(self):
"""Loads the value of var from the heap by the name lying on TOS and puts this value on TOS."""
var_name = self.__ds.pop()
if var_name in self.__heap:
# Load the value.
self.__ds.push(self.__heap[var_name])
else:
raise HeapException(f"No variable {var_name} in heap.")
def test_stack_pop_except_error():
"""Test for pop exception error and should get index errror."""
from src.stack import Stack
empty_stack = Stack()
with pytest.raises(IndexError):
empty_stack.pop()
def test_pop_with_empty_stack():
stack = Stack()
expected = None
output = stack.pop()
assert output == expected
def test_stack(self):
s = Stack()
s.push("hello")
self.assertEqual("hello", s.pop())
