Python实现带有阻塞和超时放弃功能的队列结构

本文代码对Python列表进行封装并模拟了队列结构，入队时如果队列已满则阻塞当前线程，超时则放弃；出队时如果队列已空则阻塞当前线程，超时则放弃。

import time

class myQueue:

def __init__(self, size = 10):

self._content = []

self._size = size

self._current = 0

def setSize(self, size):

if size < self._current:

#如果缩小队列，应删除后面的元素

for i in range(size, self._current)[::-1]:

del self._content[i]

self._current = size

self._size = size

def put(self, v, timeout=999999):

#模拟入队，在列表尾部追加元素

if self._current < self._size:

self._content.append(v)

self._current = self._current+1

else:

#队列满，阻塞，超时放弃

for i in range(timeout):

time.sleep(1)

if self._current < self._size:

self._content.append(v)

self._current = self._current+1

break

else:

return '队列已满，超时放弃'

def get(self, timeout=999999):

#模拟出队，从列表头部弹出元素

if self._content:

self._current = self._current-1

return self._content.pop(0)

else:

#队列为空，阻塞，超时放弃

for i in range(timeout):

time.sleep(1)

if self._content:

self._current = self._current-1

return self._content.pop(0)

else:

return '队列为空，超时放弃'

def show(self):

#如果列表非空，输出列表

if self._content:

print(self._content)

else:

print('The queue is empty')

def empty(self):

self._content = []

self._current = 0

def isEmpty(self):

return not self._content

def isFull(self):

return self._current == self._size