python queue模块

import queue
# queue - A multi-producer, multi-consumer queue.
# ['Empty', Exception raised by Queue.get(block=0)/get_nowait()
#  'Full', Exception raised by Queue.put(block=0)/put_nowait()
#  'LifoQueue',
#  'PriorityQueue',
#  'Queue',]


# 1、Empty
q = queue.Queue(3)
q.get(block=False)   # 抛出Empty异常
q.get_nowait()       # 抛出Empty异常

# 2、Full
q = queue.Queue(3)
q.put(1)
q.put(1)
q.put(1)
q.put(1, block=False)  # 抛出Full异常
q.put_nowait(1)        # 抛出Full异常

# 3、Queue
# Create a queue object with a given maximum size.
# If maxsize is <= 0, the queue size is infinite.
q = queue.Queue(5)  # 创建一个长度为5的队列
p = queue.Queue(0)  # 创建一个无限长度的队列
# empty(self) Return True if the queue is empty, False otherwise (not reliable!).
print(q.empty())
# full(self) Return True if the queue is full, False otherwise (not reliable!).
print(q.full())
# put(self, item, block=True, timeout=None) Put an item into the queue.
q.put(1)
# get(self, block=True, timeout=None) Remove and return an item from the queue.
print(q.get())
# put_nowait(self, item) Put an item into the queue without blocking.
print(q.put_nowait(2))
# get_nowait(self) Remove and return an item from the queue without blocking.
print(q.get_nowait())
# qsize(self) Return the approximate size of the queue (not reliable!).
print(q.qsize())
# join(self) Blocks until all items in the Queue have been gotten and processed.
# print(q.join())         # 阻塞put，等待全部get完
# task_done(self) Indicate that a formerly enqueued task is complete.
# print(q.task_done())    # 每次get完之后调用。


# 4、LifoQueue继承Queue，栈
# 方法同Queue
q = queue.LifoQueue(5)
q.put(1)
q.put(2)
q.put(3)
q.put(4)
print(q.get())  # 4
print(q.get())  # 3
print(q.get())  # 2
print(q.get())  # 1


# 5、PriorityQueue继承Queue
# 方法同Queue，元素(priority number, data)
q = queue.PriorityQueue(5)
q.put((1, 'a'))
q.put((4, 'd'))
q.put((2, 'b'))
q.put((3, 'c'))
print(q.get())   # (1, 'a')   # 小的数先出
print(q.get())   # (2, 'b')
print(q.get())   # (3, 'c')
print(q.get())   # (4, 'd')