A stack implementation using only one queue and whose methods only use standard queue operations (enqueue, dequeue, peek, size)

QueueStack.py

from collections import deque
from functools import wraps

class QueueStack:

    def __init__(self):
        self.q = deque()
    
    def __repr__(self):
        return f'QueueStack(q={self.q})'
    
    def push(self, x):
        self.q.append(x)
        for _ in range(len(self.q) - 1):
            self.q.append(self.q.popleft())

    def pop(self):
        return self.q.popleft()

    def top(self):
        return self.q[0]

    def empty(self):
        return not self.q