队列

>队列

>>FIFO(先入先出)队列Queue

>>LIFO(后入先出)队列

>>优先级队列PriorityQueue

### >>FIFO(先入先出)队列Queue
### >>LIFO(后入先出)队列
### >>优先级队列PriorityQueue

from queue import Queue, LifoQueue, PriorityQueue
# 先进先出队列
q = Queue(maxsize=5)
# 后进先出队列
lq = LifoQueue(maxsize=6)
# 优先级队列
pq = PriorityQueue(maxsize=5)
for i in range(5):
    q.put(i)
    lq.put(i)
    pq.put(i)
print(f",名称:先进先出队列{q.queue},对列是否满{q.full()},对列多大{q.qsize()},对列是否为空{q.empty()}")
print(f",名称:后进先出队列{lq.queue},对列是否满{lq.full()},对列多大{lq.qsize()},对列是否为空{lq.empty()}")
print(f",名称:优先级队列{pq.queue},对列是否满{pq.full()},对列多大{pq.qsize()},对列是否为空{pq.empty()}")
print(q.get(), lq.get(), pq.get())
print(f",名称:先进先出队列{q.queue},对列是否满{q.full()},对列多大{q.qsize()},对列是否为空{q.empty()}")
print(f",名称:后进先出队列{lq.queue},对列是否满{lq.full()},对列多大{lq.qsize()},对列是否为空{lq.empty()}")
print(f",名称:优先级队列{pq.queue},对列是否满{pq.full()},对列多大{pq.qsize()},对列是否为空{pq.empty()}")