stack.py

import random

MAXIMUM_STACK_SIZE = 1024

# You define a class using the class keyword and initialize its attributes with the special __init__() method. The self parameter represents the instance of the class.


class Stack:
    # The __init__ dunder is the constructor method to initialize new objects of the class, in this case, empty items list.
    def __init__(self):
        self.items = []

    def __str__(
        self,
    ):  # This dunder method converts the output of the stack to a string
        ws = []
        for i, item in enumerate(self.items[::-1]):
            if i == 0:
                ws.append(f"{item} <first")
            elif i == len(self.items) - 1:
                ws.append(f"{item} <last")
            else:
                ws.append(str(item))
        return "\n".join(ws)

    def push(self, value):
        if len(self.items) == MAXIMUM_STACK_SIZE - 1:
            raise Exception("Stack overflow")
        self.items.append(value)

    def pop(self):
        if len(self.items) == 0:
            raise Exception("Stack underflow")
        return self.items.pop()

    def get(self, index):
        return self.items[-(index + 1)]  # reads from top

    def set(self, index, value):
        self.items[-(index + 1)] = value  # writes from top

    @property
    def stack(self):
        return self.items.copy()


kayakys_stack = Stack()
for _ in range(1023):
    kayakys_stack.push(random.randint(1, 100))
print(kayakys_stack)