from queue import Queue
# FIFO
queue_obj = Queue()  # 創(chuàng)建一個(gè)隊(duì)列對象
for i in range(4):
    queue_obj.put(i)
while not queue_obj.empty():
    print(queue_obj.get())
# 輸出順序
0
1
2
3

from queue import Queue,LifoQueue

# LIFO
queue_obj = LifoQueue()  # 創(chuàng)建一個(gè)隊(duì)列對象
for i in range(4):
    queue_obj.put(i)
while not queue_obj.empty():
    print(queue_obj.get())
 
# 輸出順序
3
2
1
0

PriorityQueue_obj = PriorityQueue()
PriorityQueue_obj.put((5,45))
PriorityQueue_obj.put((1,42))
PriorityQueue_obj.put((2,47))
while not PriorityQueue_obj.empty():
    print(PriorityQueue_obj.get())
# 輸出順序
(1, 42)
(2, 47)
(5, 45)

priorityQueue_obj = PriorityQueue()
priorityQueue_obj.put((1,45))
priorityQueue_obj.put((1,42))
priorityQueue_obj.put((1,47))
while not PriorityQueue_obj.empty():
    print(PriorityQueue_obj.get())

(1, 42)
(1, 45)
(1, 47)

priorityQueue_obj = PriorityQueue()
priorityQueue_obj.put((1,[1,4]))
priorityQueue_obj.put((1,[2,4]))
priorityQueue_obj.put((1,[2,3]))
while not PriorityQueue_obj.empty():
    print(PriorityQueue_obj.get())
    
(1, [1, 4])
(1, [2, 3])
(1, [2, 4])
當(dāng)優(yōu)先級一樣的時(shí)候，會在比較數(shù)據(jù)部分的大小，同上字符串也可以比較大小，

priorityQueue_obj = PriorityQueue()
priorityQueue_obj.put((1,{"1":9}))   
priorityQueue_obj.put((1,{"k":6}))
priorityQueue_obj.put((1,{"8":9}))
while not priorityQueue_obj.empty():
    print(priorityQueue_obj.get())   # 沒有字典不能直接比較大小
    
# 報(bào)錯內(nèi)容
# TypeError: '<' not supported between instances of 'dict' and 'dict'

class dic:
    def __init__(self,level,data):
        self.level = level
        self.data = data
    def __lt__(self, other):
        if self.level == other.level:
            return len(self.data)<len(other.data)
        return self.level < other.level

priorityQueue_obj = PriorityQueue()
priorityQueue_obj.put(dic(5, {1:4, 2:5}))
priorityQueue_obj.put(dic(4, {1:4}))
priorityQueue_obj.put(dic(5, {1:2}))
while not priorityQueue_obj.empty():
    print(priorityQueue_obj.get().data)

# 結(jié)果
{1: 4}
{1: 2}
{1: 4, 2: 5}

queue_obj = LifoQueue()  # 創(chuàng)建一個(gè)隊(duì)列對象
for i in range(4):
    queue_obj.put(i)
    print(queue_obj.qsize())

結(jié)果
1
2
3
4

queue_obj = Queue(3)  # 隊(duì)列的最大長度為3
for i in range(4): # 當(dāng)向隊(duì)列中添加的元素超過隊(duì)列的最大長度就會發(fā)生阻塞，當(dāng)隊(duì)列中取出一個(gè)數(shù)據(jù)才會解除堵塞
    queue_obj.put(i)
    # print(queue_obj.qsize())
print("阻塞")
queue_obj = Queue(3)  # 創(chuàng)建一個(gè)隊(duì)列對象
for i in range(4):
    queue_obj.put(i,block=False)   當(dāng)超出最大長度的時(shí)就會報(bào)錯

queue_obj = Queue(3)  
for i in range(3):
    queue_obj.put(i)
for i in range(4):  當(dāng)取出元素的時(shí)候發(fā)現(xiàn)沒有元素的時(shí)候就會發(fā)生阻塞
    print(queue_obj.get())
queue_obj = Queue(3)  
for i in range(3):
    queue_obj.put(i)
for i in range(4):  
    print(queue_obj.get(block=False))  如果隊(duì)列為空，仍然繼續(xù)取元素，會發(fā)生報(bào)錯

queue_obj = Queue(3)  
for i in range(4):
    queue_obj.put(i,timeout=4)  # 如果阻塞4秒，原隊(duì)列中仍然沒有位置，則會發(fā)生報(bào)錯