在Python中实现类似缓冲区的结构

from collections import deque

class Buffer:
    def __init__(self, size):
        self.buffer = deque(maxlen=size)

    def append(self, item):
        self.buffer.append(item)

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

    def __len__(self):
        return len(self.buffer)

buffer = Buffer(5)
for i in range(10):
    buffer.append(i)
    print(buffer)

deque([0], maxlen=5)
deque([0, 1], maxlen=5)
deque([0, 1, 2], maxlen=5)
deque([0, 1, 2, 3], maxlen=5)
deque([0, 1, 2, 3, 4], maxlen=5)
deque([1, 2, 3, 4, 5], maxlen=5)
deque([2, 3, 4, 5, 6], maxlen=5)
deque([3, 4, 5, 6, 7], maxlen=5)
deque([4, 5, 6, 7, 8], maxlen=5)
deque([5, 6, 7, 8, 9], maxlen=5)